This class of matrices includes adjacency matrices, loosely coupled Hamiltonians, and other systems with low connectivity between elements.
Yousef Saad, one of the most highly cited researchers of these objects, is the author of a textbook on "Iterative Methods for" them. Yifan Hu and University of Florida professor Tim Davis maintain a database of these objects for use in evaluating the performance of algorithms on them. The Cuthill-McKee algorithm reorders the entries in these objects to reduce their bandwidth, which one often does before storing them in skyline format. The "eye" and "kron" functions in Python's SciPy package generate these objects. The Yale format uses three (*) arrays to store these things and is similar to the Compressed Row method. The "dictionary of keys" method stores these objects as maps from a row-column pair to an entry, rather than as an array of arrays. This class of matrices includes adjacency matrices, loosely coupled Hamiltonians, and other systems with low connectivity between elements. For 10 points, name these matrices in which most of the elements are zero.
Yousef Saad, one of the most highly cited researchers of these objects, is the author of a textbook on "Iterative Methods for" them.
sparse matrices [or sparse linear systems; prompt on matrices]