✳flâneur — a map of the web's best reading

Sparse matrix

en.wikipedia.org · 3,992 words · saved by 1 readers

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.

Sparse matrix - Wikipedia Jump to content From Wikipedia, the free encyclopedia Matrix in which most of the elements are zero "Sparsity" redirects here. For other uses, see Sparse (disambiguation) . Example of sparse matrix \\left(\\begin{smallmatrix}\n11 & 22 & 0 & 0 & 0 & 0 & 0 \\\\\n0 & 33 & 44 & 0 & 0 & 0 & 0 \\\\\n0 & 0 & 55 & 66 & 77 & 0 & 0 \\\\\n0 & 0 & 0 & 0 & 0 & 88 & 0 \\\\\n0 & 0 & 0 & 0 & 0 & 0 & 99 \\\\\n\\end{smallmatrix}\\right)</math>"}},"i":0}}]}'> ( 11 22 0 0 0 0 0 0 33 44 0 0 0 0 0 0 55 66 77 0 0 0 0 0 0 0 88 0 0 0 0 0 0 0 99 ) {\displaystyle \left({\begin{smallmatrix}11&22

Explore this link on the map →

related reading