On the Gaussian elimination method for inverting sparse matrices

DOI10.1007/BF02236371zbMATH Open0234.65038OpenAlexW2924918911MaRDI QIDQ2551673FDOQ2551673

Authors: R. 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

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

Cites Work

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

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2551673)