(data structure)
Definition: A matrix that has relatively few non-zero (or "interesting") entries. It may be represented in much less than n × m space.
See also ragged matrix, huge sparse array.
Note: A n × m matrix with k non-zero entries is sparse if k << n × m. It may be faster to represent the matrix compactly as a list of the non-zero indexes and associated entries, as a list of lists of entries (one list for each row), coordinate format (the values and their row/column positions), or by a point access method.
Author: PEB
A picture of a sparse matrix with dual {linked lists}. Yousef Saad's Iterative methods for sparse linear systems (PDF), chapters 1-3 of a textbook covering linear algebra and types of matrices. Sparse matrix implementations, including the coordinate format, begin on page 85 (PDF page 97). Other formats and information on a newer edition.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 6 June 2008.
HTML page formatted Fri Jun 6 10:35:12 2008.
Cite this as:
Paul E. Black, "sparse matrix", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 6 June 2008. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/sparsematrix.html
