Sparse algorithms for indefinite system of linear equations

DOI10.1007/s004660050013zbMath0962.65026MaRDI QIDQ1573424

N. Delaunay

Publication date: 31 May 2001

Published in: Computational Mechanics (Search for Journal in Brave)

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

zbMATH Keywords

complexity; numerical examples; factorization algorithm; sparse systems of linear equations; symbolic factorization; not positive definite; pivoting \(2\times 2\) strategy

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

68W30: Symbolic computation and algebraic computation

65Y20: Complexity and performance of numerical algorithms

65F05: Direct numerical methods for linear systems and matrix inversion

Uses Software

• MA47