Sparse algorithms for indefinite system of linear equations

DOI10.1007/s004660050013zbMath0962.65026OpenAlexW1982011314MaRDI 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

complexitynumerical examplesfactorization algorithmsparse systems of linear equationssymbolic factorizationnot positive definitepivoting \(2\times 2\) strategy

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

High performance sparse solver for unsymmetrical linear equations with out-of-core strategies and its application on meshless methods

Uses Software

• MA47

This page was built for publication: Sparse algorithms for indefinite system of linear equations