Results 41 to 50 of about 739,476 (283)
New Orthogonal Transforms for Signal and Image Processing
Applied Sciences, 2021 In the paper, orthogonal transforms based on proposed symmetric, orthogonal matrices are created. These transforms can be considered as generalized Walsh–Hadamard Transforms.
Andrzej Dziech
doaj +1 more source
Parallel sparse matrix solution for direct circuit simulation on a multiple FPGA system [PDF]
, 2012 SPICE, from the University of California, at Berkeley, is the de facto world standard for circuit simulation. SPICE is used to model the behaviour of electronic circuits prior to manufacturing to decrease defects and hence reduce costs. However, accurate
Nechma, Tarek
core +1 more source
Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms
IEEE Access, 2021 This paper presents factorizations of each discrete sine transform (DST) matrix of types I, II, III, and IV into a product of sparse, diagonal, bidiagonal, and scaled orthogonal matrices.
Sirani M. Perera, Levi E. Lingsch
doaj +1 more source
On sparse random combinatorial matrices
Discrete Mathematics, 2022 Let $Q_{n,d}$ denote the random combinatorial matrix whose rows are independent of one another and such that each row is sampled uniformly at random from the subset of vectors in $\{0,1\}^n$ having precisely $d$ entries equal to $1$. We present a short proof of the fact that $\Pr[\det(Q_{n,d})=0] = O\left(\frac{n^{1/2}\log^{3/2} n}{d}\right)=o(1 ...
Elad Aigner-Horev, Yury Person
openaire +2 more sources
Direct multiplicative methods for sparse matrices. Linear programming [PDF]
Компьютерные исследования и моделирование, 2017 Multiplicative methods for sparse matrices are best suited to reduce the complexity of operations solving systems of linear equations performed on each iteration of the simplex method.
Anastasiya Borisovna Sviridenko
doaj +1 more source
Adapting the interior point method for the solution of LPs on serial, coarse grain parallel and massively parallel computers [PDF]
, 1990 In this paper we describe a unified scheme for implementing an interior point algorithm (IPM) over a range of computer architectures. In the inner iteration of the IPM a search direction is computed using Newton's method.
Levkovitz, R +7 more
core +6 more sources
Direct multiplicative methods for sparse matrices. Quadratic programming [PDF]
Компьютерные исследования и моделирование, 2018 A numerically stable direct multiplicative method for solving systems of linear equations that takes into account the sparseness of matrices presented in a packed form is considered.
Anastasiya Borisovna Sviridenko
doaj +1 more source
Insights from classifying visual concepts with multiple kernel learning. [PDF]
PLoS ONE, 2012 Combining information from various image features has become a standard technique in concept recognition tasks. However, the optimal way of fusing the resulting kernel functions is usually unknown in practical applications. Multiple kernel learning (MKL)
Alexander Binder +7 more
doaj +1 more source
An efficient sparse regularity concept [PDF]
, 2009 Let A be a 0/1 matrix of size m×n, and let p be the density of A (i.e., the number of ones divided by m · n). We show that A can be approximated in the cut norm within ε · mnp by a sum of cut matrices (of rank 1), where the number of summands is ...
Cooper, Colin +8 more
core +1 more source
IEEE Access, 2020 Existing Dictionary Learning and Sparse Coding (DLSC) algorithms for Symmetric Positive Definite (SPD) matrices usually adopt Reproducing Kernel Hilbert Space as workspace to perform necessary linear operations.
Yang Zhang, Yuesheng Zhu
doaj +1 more source