Computing with sparse matrices
T. S. Chow, Janusz S. Kowalik · International Journal for Numerical Methods in Engineering · 1973
Abstract A survey of recent developments in sparse matrix technology is presented. Two fundamental areas are reviewed: Sorting and reordering techniques by which the non‐zero elements of a given sparse matrix can be rearranged to obtain a form which leads to more efficient computations. Direct methods for solving systems of linear equations and computing inverses.