Results 11 to 20 of about 43,727 (260)
Sparse matrices in frame theory [PDF]
Computational Statistics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Felix Krahmer +2 more
openaire +4 more sources
Applied Sciences, 2022 The sparse matrix–vector product (SpMV), considered one of the seven dwarfs (numerical methods of significance), is essential in high-performance real-world scientific and analytical applications requiring solution of large sparse linear equation systems,
Muhammad Ahmed +6 more
doaj +1 more source
Explicit Expression for Arbitrary Positive Integer Powers of Special Sparse Matrices
Journal of Mathematics, 2022 Sparse matrices appear frequently in mathematical models. In this paper, we firstly present a general expression for the entries of the r th r∈ℕ power of a certain n-square sparse matrix, in terms of the Chebyshev polynomials of the second kind. Secondly,
Mohammad Beiranvand +1 more
doaj +1 more source
IEEE Access, 2022 Recent advances have shown that the challenging problem of matrix completion arises from real-world applications, such as image recovery, and recommendation systems.
Ying Zhang +3 more
doaj +1 more source
Pentadiagonal Companion Matrices
Special Matrices, 2016 The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally ...
Eastman Brydon, Vander Meulen Kevin N.
doaj +1 more source
Application of Sparse Representation in Bioinformatics
Frontiers in Genetics, 2021 Inspired by L1-norm minimization methods, such as basis pursuit, compressed sensing, and Lasso feature selection, in recent years, sparse representation shows up as a novel and potent data processing method and displays powerful superiority.
Shuguang Han +8 more
doaj +1 more source
Linear Algebra and its Applications, 2003 The sparsity of orthogonal matrices which have both a column and a row of nonzero is studied. In Section 2, the authors describe a rich family \(n\) by \(n\) orthogonal matrices, namely, those that are the product of \(n-1\) Givens rotations. They show that this family contains a sparsest fully indecomposable orthogonal matrix with a full row.
Cheon, Gi-Sang +4 more
openaire +1 more source
SparseM: A Sparse Matrix Package for R *
Journal of Statistical Software, 2003 SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the package is illustrated by a family of linear model fitting functions that implement least squares methods for problems with sparse design matrices ...
Roger Koenker, Pin Ng
doaj +1 more source
New flexible deterministic compressive measurement matrix based on finite Galois field
IET Image Processing, 2022 Nowadays, the deterministic construction of sensing matrices is a hot topic in compressed sensing. The coherence of the measurement matrix is an important research area in the design of deterministic compressed sensing.
Vahdat Kazemi +2 more
doaj +1 more source
Local Laws for Sparse Sample Covariance Matrices
Mathematics, 2022 We proved the local Marchenko–Pastur law for sparse sample covariance matrices that corresponded to rectangular observation matrices of order n×m with n/m→y (where y>0) and sparse probability npn>logβn (where β>0).
Alexander N. Tikhomirov +1 more
doaj +1 more source