Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods

DOI10.1007/BF01939264zbMath0222.65051MaRDI QIDQ5627576

Reginald P. Tewarson

Publication date: 1967

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items

Computer program for solution of large, sparse, unsymmetric systems of linear equations ⋮ On the reduction of a sparse matrix to hessenberg form ⋮ On the transformation of symmetric sparse matrices to the triple diagonal form ⋮ Computational methods of linear algebra ⋮ Some Results on Sparse Matrices ⋮ A survey of direct methods for sparse linear systems ⋮ On solving problems with sparse matrices ⋮ On computing generalized inverses ⋮ On the Gaussian elimination method for inverting sparse matrices ⋮ On the optimal choice of pivots for the Gaussian elimination ⋮ A desirable form for sparse matrices when computing their inverse in factored forms ⋮ Solution of linear equations with coefficient matrix in band form

Cites Work

• Unnamed Item
• Unnamed Item
• A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
• The Use of Linear Graphs in Gauss Elimination
• The Product Form of Inverses of Sparse Matrices and Graph Theory
• On the Product Form of Inverses of Sparse Matrices