"Sparsity" redirects here. For other uses, see Sparse (disambiguation).
Example of sparse matrix
The above sparse matrix contains only 9 non-zero elements, with 26 zero elements. Its sparsity is 74%, and its density is 26%.
In numerical analysis and scientific computing, a sparse matrix or sparse array is a matrix in which most of the elements are zero.[1] There is no strict definition regarding the proportion of zero-value elements for a matrix to qualify as sparse but a common criterion is that the number of non-zero elements is roughly equal to the number of rows or columns. By contrast, if most of the elements are non-zero, the matrix is considered dense.[1] The number of zero-valued elements divided by the total number of elements (e.g., m × n for an m × n matrix) is sometimes referred to as the sparsity of the matrix.
Conceptually, sparsity corresponds to systems with few pairwise interactions. For example, consider a line of balls connected by springs from one to the next: this is a sparse system as only adjacent balls are coupled. By contrast, if the same line of balls were to have springs connecting each ball to all other balls, the system would correspond to a dense matrix. The concept of sparsity is useful in combinatorics and application areas such as network theory and numerical analysis, which typically have a low density of significant data or connections. Large sparse matrices often appear in scientific or engineering applications when solving partial differential equations.
When storing and manipulating sparse matrices on a computer, it is beneficial and often necessary to use specialized algorithms and data structures that take advantage of the sparse structure of the matrix. Specialized computers have been made for sparse matrices,[2] as they are common in the machine learning field.[3] Operations using standard dense-matrix structures and algorithms are slow and inefficient when applied to large sparse matrices as processing and memory are wasted on the zeros. Sparse data is by nature more easily compressed and thus requires significantly less storage. Some very large sparse matrices are infeasible to manipulate using standard dense-matrix algorithms.
^ abYan, Di; Wu, Tao; Liu, Ying; Gao, Yang (2017). "An efficient sparse-dense matrix multiplication on a multicore system". 2017 IEEE 17th International Conference on Communication Technology (ICCT). IEEE. pp. 1880–1883. doi:10.1109/icct.2017.8359956. ISBN 978-1-5090-3944-9. The computation kernel of DNN is large sparse-dense matrix multiplication. In the field of numerical analysis, a sparse matrix is a matrix populated primarily with zeros as elements of the table. By contrast, if the number of non-zero elements in a matrix is relatively large, then it is commonly considered a dense matrix. The fraction of zero elements (non-zero elements) in a matrix is called the sparsity (density). Operations using standard dense-matrix structures and algorithms are relatively slow and consume large amounts of memory when applied to large sparse matrices.
^"Cerebras Systems Unveils the Industry's First Trillion Transistor Chip". www.businesswire.com. 2019-08-19. Retrieved 2019-12-02. The WSE contains 400,000 AI-optimized compute cores. Called SLAC™ for Sparse Linear Algebra Cores, the compute cores are flexible, programmable, and optimized for the sparse linear algebra that underpins all neural network computation
^"Argonne National Laboratory Deploys Cerebras CS-1, the World's Fastest Artificial Intelligence Computer | Argonne National Laboratory". www.anl.gov (Press release). Retrieved 2019-12-02. The WSE is the largest chip ever made at 46,225 square millimeters in area, it is 56.7 times larger than the largest graphics processing unit. It contains 78 times more AI optimized compute cores, 3,000 times more high speed, on-chip memory, 10,000 times more memory bandwidth, and 33,000 times more communication bandwidth.
In numerical analysis and scientific computing, a sparsematrix or sparse array is a matrix in which most of the elements are zero. There is no strict...
In mathematics, particularly matrix theory, a band matrix or banded matrix is a sparsematrix whose non-zero entries are confined to a diagonal band, comprising...
LAPACK defines various matrix representations in memory. There is also Sparsematrix representation and Morton-order matrix representation. According...
The SparseMatrix Converter is an AC/AC converter which offers a reduced number of components, a low-complexity modulation scheme, and low realization...
adjacency matrix and the time needed to perform operations on them is dependent on the matrix representation chosen for the underlying matrix. Sparsematrix representations...
a hollow matrix may refer to one of several related classes of matrix: a sparsematrix; a matrix with a large block of zeroes; or a matrix with diagonal...
In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices...
following equivalent definition is in matrix form. Let V{\displaystyle V} be a p×p symmetric matrix, one can rewrite the sparse PCA problem as maxTr(ΣV)subject...
directional gradient of a rasterized matrix. Once a matrix or a high dimensional vector is transferred to a sparse space, different recovery algorithms...
statistics, the projection matrix ( P ) {\displaystyle (\mathbf {P} )} , sometimes also called the influence matrix or hat matrix ( H ) {\displaystyle (\mathbf...
each matrix column is equal to unity. The numerical coefficient α {\displaystyle \alpha } is known as a damping factor. Usually S is a sparsematrix and...
to BLAS for handling sparse matrices have been suggested over the course of the library's history; a small set of sparsematrix kernel routines was finally...
algorithm is the multiplication of matrix A {\displaystyle A} by a vector, so it is effective for a very large sparsematrix with appropriate implementation...
hierarchical matrices (H-matrices) are used as data-sparse approximations of non-sparse matrices. While a sparsematrix of dimension n {\displaystyle n} can be represented...
sign matrix, a matrix of 0, 1, and –1 coefficients with the nonzeros in each row or column alternating between 1 and –1 and summing to 1 Sparsematrix, a...
distance-based similarity. Algorithms to construct the graph adjacency matrix as a sparsematrix are typically based on a nearest neighbor search, which estimate...
or factorization factors a matrix as the product of a lower triangular matrix and an upper triangular matrix (see matrix decomposition). The product...
Sparse array, with most elements omitted, to store a sparsematrix Variable-length array or various related concepts: Array programming, using matrix...