A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination

DOI10.1093/imamat/14.3.281zbMath0308.65021OpenAlexW2092097552MaRDI QIDQ4066491

John K. Reid, Iain S. Duff

Publication date: 1974

Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamat/14.3.281

Mathematics Subject Classification ID

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

Related Items

Computational methods of linear algebra, Hierarchical partition—a new optimal pivoting algorithm, A survey of direct methods for sparse linear systems, Pivot selection and row ordering in Givens reduction on sparse matrices, A new method for the solution of Ax=b, Ordering algorithms for irreducible sparse linear systems, Solving staircase linear programs by the simplex method, 1: Inversion, A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases