
Sparse matrix
In numerical analysis and scientific computing, a sparse matrix or sparse array is a matrix in which most of the elements are zero. 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. 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.
- Comment
- enIn numerical analysis and scientific computing, a sparse matrix or sparse array is a matrix in which most of the elements are zero. 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. 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.
- Depiction
- Has abstract
- enIn numerical analysis and scientific computing, a sparse matrix or sparse array is a matrix in which most of the elements are zero. 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. 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, as they are common in the machine learning field. 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.
- Is primary topic of
- Sparse matrix
- Label
- enSparse matrix
- Link from a Wikipage to an external page
- portal.acm.org/citation.cfm%3Fid=355707
- scikit-learn.org/stable/modules/classes.html%23module-sklearn.decomposition
- citeseer.ist.psu.edu/gilbert91sparse.html
- crd-legacy.lbl.gov/~xiaoye/SuperLU/
- pastix.gforge.inria.fr/
- basic-matrix-library.readthedocs.io/en/latest/
- sparse.tamu.edu/
- www.netlib.org/sparse/
- www.sympiler.com/
- cran.r-project.org/web/packages/spam/index.html
- netlib.org/linalg/html_templates/node92.html%23SECTION00931200000000000000
- www.mgnet.org/~douglas/Preprints/pub0034.pdf
- faculty.cse.tamu.edu/davis/research.html
- docs.scipy.org/doc/scipy/reference/generated/scipy.sparse.csc_matrix.html
- www.mathworks.com/help/matlab/ref/sparse.html
- reference.wolfram.com/language/guide/SparseArrays.html
- archive.org/details/sparsematrixtech0000piss%7Curl-access=registration%7Cpublisher=
- crates.io/crates/sprs
- faculty.cse.tamu.edu/davis/suitesparse.html
- www.small-project.eu
- Link from a Wikipage to another Wikipage
- Adjacency list
- Adjacency matrix
- ALGLIB
- Algorithm
- Armadillo (C++ library)
- ARPACK
- Array data structure
- Associative array
- Band matrix
- Block-diagonal matrix
- Category:Arrays
- Category:Sparse matrices
- Cholesky decomposition
- Combinatorics
- Computer
- Computer data storage
- Computer memory
- Conjugate gradient
- Data compression
- Data structure
- Deal.II
- Diagonal matrix
- Dune (software)
- Eigen (C++ library)
- Engineering
- File:Finite element sparse matrix.png
- Frontal solver
- GMRES
- Graph bandwidth
- Harry Markowitz
- Harwell-Boeing file format
- Iterative method
- Logical matrix
- Lower bandwidth of a matrix
- Main diagonal
- Matrix (mathematics)
- Matrix Market exchange formats
- Matrix representation
- MUMPS (software)
- Network theory
- NIST
- Numerical analysis
- One-dimensional array
- Ordered pair
- Parallel computing
- Pareto principle
- Partial differential equation
- Portable, Extensible Toolkit for Scientific Computation
- Preconditioner
- Ragged matrix
- Scientific
- Scientific computing
- SciPy
- Single-entry matrix
- Skyline matrix
- SLEPc
- Sparse file
- Sparse graph code
- Springer-Verlag
- Symbolic Cholesky decomposition
- Tridiagonal matrix
- Trilinos
- Undirected graph
- Zero-based numbering
- SameAs
- 8YQG
- Dünnbesetzte Matrix
- Gles matris
- IJle matrix
- m.01y1 l
- Macierz rzadka
- Maldensa matrico
- Ma trận thưa
- Matrice creuse
- Matrice sparsa
- Matriks rongga
- Matriz dispersa
- Matriz esparsa
- Q1050404
- Redka matrika
- Řídká matice
- Ritka mátrix
- Sparse matrix
- Проређена матрица
- Разреженная матрица
- Розріджена матриця
- מטריצה דלילה
- ماتریس خلوت
- 疎行列
- 稀疏矩阵
- 희소행렬
- Subject
- Category:Arrays
- Category:Sparse matrices
- Thumbnail
- WasDerivedFrom
- Sparse matrix?oldid=1116925321&ns=0
- WikiPageLength
- 25718
- Wikipage page ID
- 341015
- Wikipage revision ID
- 1116925321
- WikiPageUsesTemplate
- Template:Anchor
- Template:Center
- Template:Cite book
- Template:Cite journal
- Template:Cite web
- Template:Columns-list
- Template:Data structures
- Template:Harv
- Template:Main article
- Template:Math
- Template:Matrix classes
- Template:Midsize
- Template:Numerical linear algebra
- Template:Reflist
- Template:Short description