On the Gaussian elimination method for inverting sparse matrices

DOI10.1007/BF02236371zbMath0234.65038OpenAlexW2924918911MaRDI QIDQ2551673

Reginald P. Tewarson

Publication date: 1972

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02236371

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

Computational methods of linear algebra ⋮ Asymptotically fast solution of Toeplitz and related systems of linear equations ⋮ A survey of direct methods for sparse linear systems

Cites Work

• A graph theoretic approach to matrix inversion by partitioning
• Random matrices and graphs
• Partitioning and Tearing Systems of Equations
• Row-column permutation of sparse matrices
• A Graph Technique for Inverting Certain Matrices
• Computations with Sparse Matrices
• Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods
• On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations
• On the Inversion of Sparse Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Gaussian elimination method for inverting sparse matrices