Sparse matrix

Summary

A sparse matrix is a matrix in which most entries are zero. Such matrices are stored by listing only the nonzero entries with their positions, which saves memory. Algorithms that skip the zeros can be much faster than algorithms for general, dense matrices. Large sparse matrices arise from networks, from discretised differential equations and from many problems in data science.