×

Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods. (English) Zbl 0222.65051


MSC:

65F10 Iterative numerical methods for linear systems
65F50 Computational methods for sparse matrices
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] F. B. Hildebrand,Introduction to Numerical Analysis, McGraw-Hill, New York, 1956, pp. 428–429. · Zbl 0070.12401
[2] R. P. Tewarson,On the Product Form of Inverses of Sparse Matrices, SIAM Rev., v. 8. 3, 1966, pp. 336–342. · Zbl 0222.65050 · doi:10.1137/1008066
[3] R. P. Tewarson,On the Product Form of Inverses of Sparse Matrices and Graph Theory, SIAM Rev., v. 9, 1, 1967, pp. 91–99. · Zbl 0168.13302 · doi:10.1137/1009004
[4] R. G. Busacker and T. L. Saaty,Finite Graphs and Networks, McGraw-Hill, New York, 1965. · Zbl 0146.20104
[5] F. Harary,A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues, J. Math. and Phys., v. 38, 1959, pp. 104–111. · Zbl 0087.01701 · doi:10.1002/sapm1959381104
[6] S. Parter,The use of Linear Graphs in Gauss Elimination, SIAM Rev., v. 3, 2, 1961, pp. 119–130. · Zbl 0102.11302 · doi:10.1137/1003021
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.