Sparse Matrices and Preconditioning
摘要
In applications, linear systems of equations with many unknowns and only a few non-zero entries in the system matrix often occur. In these cases, iterative methods can be implemented particularly efficiently, provided a suitable compressed storage format for the matrix is used. If a simple approximate inverse matrix can also be constructed, an extension of the method of conjugate gradients leads to nearly optimal numerical methods.