On the optimal choice of pivots for the Gaussian elimination

DOI10.1007/BF02246733zbMath0253.65013OpenAlexW156232442MaRDI QIDQ2557985

Yanyan Li

Publication date: 1972

Published in: Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

Computational methods of linear algebra ⋮ A survey of direct methods for sparse linear systems ⋮ A new method for the solution of Ax=b

Cites Work

• The Elimination form of the Inverse and its Application to Linear Programming
• The Crout reduction for sparse matrices
• Computations with Sparse Matrices
• Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods
• Sparse matrices
• Unnamed Item

This page was built for publication: On the optimal choice of pivots for the Gaussian elimination