Everything About ___
Live briefing

Everything about Sparse matrix

Matrix in which most of the elements are zero

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 is sometimes referred to as the sparsity of the matrix. Wikipedia →

đź§­ Start here: a 6-step reading path

  1. Read the overview: Sparse matrixA 5-minute orientation
  2. Skim a recent paper: A Systematic Survey of General Sparse Matrix-matrix MultiplicationInfluential work since 2022
  3. Pick up a classic book: Iterative solution of large sparse systems of equationsThe most-reprinted book on the subject
  4. Read the landmark paper: Sparse matrix test problemsCited 444 times
  5. Go sideways: Band matrixA closely related topic
  6. Go sideways: Skyline matrixA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Special cases
  2. Use
  3. Storage
  4. Software
  5. History

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics