A survey of sparse matrix research
- 1 April 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 65 (4) , 500-535
- https://doi.org/10.1109/proc.1977.10514
Abstract
This paper surveys the state of the art in sparse matrix research in January 1976. Much of the survey deals with the solution of sparse simultaneous linear equations, including the storage of such matrices and the effect of paging on sparse matrix algorithms. In the symmetric case, relevant terms from graph theory are defined. Band systems and matrices arising from the discretization of partial differential equations are treated as separate cases. Preordering techniques are surveyed with particular emphasis on partitioning (to block triangular form) and tearing (to bordered block triangular form). Methods for solving the least squares problem and for sparse linear programming are also reviewed. The sparse eigenproblem is discussed with particular reference to some fairly recent iterative methods. There is a short discussion of general iterative techniques, and reference is made to good standard texts in this field. Design considerations when implementing sparse matrix algorithms are examined and finally comments are made concerning the availability of codes in this area.Keywords
This publication has 306 references indexed in Scilit:
- Solution of linear equations with skyline-stored symmetric matrixComputers & Structures, 1975
- Hashing the subscripts of a sparse matrixBIT Numerical Mathematics, 1974
- Direct solution of large systems of linear equationsComputers & Structures, 1974
- The method of conjugate gradients used in inverse iterationBIT Numerical Mathematics, 1972
- Optimal gradient minimization scheme for finite element eigenproblemsJournal of Sound and Vibration, 1972
- On the reduction of a symmetric matrix to tridiagonal formBIT Numerical Mathematics, 1971
- A direct iteration method of obtaining latent roots and vectors of a symmetric matrixMathematical Proceedings of the Cambridge Philosophical Society, 1967
- Solving linear least squares problems by Gram-Schmidt orthogonalizationBIT Numerical Mathematics, 1967
- Primal partition programming for block diagonal matricesNumerische Mathematik, 1964
- A graph theoretic approach to matrix inversion by partitioningNumerische Mathematik, 1962