On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices

DOI10.2307/2005827zbMath0298.65024OpenAlexW4235290997MaRDI QIDQ4053004

Iain S. Duff

Publication date: 1974

Full work available at URL: https://doi.org/10.2307/2005827

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Combinatorial probability (60C05) Roundoff error (65G50) Graph theory (05C99) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical linear algebra (65F99)

Related Items

Computational methods of linear algebra, The average parallel complexity of Cholesky factorization, Solving staircase linear programs by the simplex method, 1: Inversion

Uses Software

• IBM Scratchpad

Cites Work

• A graph theoretic approach to matrix inversion by partitioning
• Random matrices and graphs
• The Use of Linear Graphs in Gauss Elimination
• The Determinant of the Adjacency Matrix of a Graph
• The Product Form of Inverses of Sparse Matrices and Graph Theory
• Some Results on Sparse Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item