Compact storage for iterative solution of large sparse linear systems of equations

Large sparse linear systems of equations occur frequently in engineering mathematics, and are usually solved by an iterative method such as successive over‐relaxation. One of the principal advantages of iterative methods is that the zeros of the system matrix are not destroyed. This property can be used to substantially reduce both computer storage requirements and the number of arithmetic operations. Most standard texts, however, do not emphasize this point. In this paper, a simple compact method of storing the system matrix is described, which substantially reduces storage requirements and improves the efficiency of the computation by eliminating most multiplications by zero.