Sparse algorithms for indefinite system of linear equations

DOI10.1007/S004660050013MaRDI QIDQ1573424zbMATH OpenOpenAlexFDO

Authors N. Delaunay, Pu Chen, H. Runesha, D. T. Nguyen, Tse-Yung P. Chang, P. Tong

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

complexityfactorization algorithmnot positive definitenumerical examplespivoting \(2\times 2\) strategysparse systems of linear equationssymbolic factorization

Mathematics Subject Classification ID

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

Review text

There exists a number of Fortran codes for the systems of linear equations which are either sparse or do not have a positive definite matrix. Perversely, many practical applications call for a coincidence of both these features. The paper tries to meet the need and offers a new computational strategy. With emphasis on the efficiency (in both the accuracy and economy sense) and robust generality, a detailed proposal is based on a combined pivoting (mediated by a two-by-two block-diagonalizing rotation) and factorization (in the, combined again, up and down direction). The details are inspiring and include the re-orderings and simultaneity of the symbolic and numerical factorizations. Together with the restarts of memory arrangements they are designed to minimize the complexity of the -- variable -- fill-in pattern. The real impact of these technical ingredients is illustrated and validated by a few tests.

Recommendations

• Accurate Symmetric Indefinite Linear Equation Solvers
• The Factorization of Sparse Symmetric Indefinite Matrices
• MA57---a code for the solution of sparse symmetric definite and indefinite systems

Cited in

(11)

• High performance sparse solver for unsymmetrical linear equations with out-of-core strategies and its application on meshless methods
• Algorithms for indefinite linear least squares problems
• Solving sparse rational linear systems
• Solution of Sparse Underdetermined Systems of Linear Equations
• Microcomputer symbolic generation of an optimal Crout algorithm for sparse systems of linear equations
• scientific article; zbMATH DE number 18290 (Why is no real title available?)
• Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
• scientific article; zbMATH DE number 1067718 (Why is no real title available?)
• Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
• scientific article; zbMATH DE number 1153374 (Why is no real title available?)
• Efficient Solution of a Sparse Non-symmetric System of Linear Equations

Describes a project that uses

Uses Software

• MA47

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

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