If the coefficient matrix is sparse, large-scale linear systems
of the form can be most
efficiently solved if the
zero elements of are not stored. Sparse storage schemes allocate
contiguous storage in memory for
the nonzero elements of the matrix, and perhaps a limited number of
zeros. This, of course, requires a scheme for knowing
where the elements fit into the full matrix.