On the optimal choice of pivots for the Gaussian elimination

DOI10.1007/BF02246733zbMATH Open0253.65013OpenAlexW156232442MaRDI QIDQ2557985FDOQ2557985

Authors: 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)

Cites Work

• Title not available (Why is that?)
• The elimination form of the inverse and its application to linear programming
• Sparse matrices
• 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

Cited In (3)

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

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

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