On solving sparse symmetric linear systems whose definiteness is unknown

DOI10.1016/J.APNUM.2007.01.014MaRDI QIDQ2480942zbMATH OpenOpenAlexFDO

Authors Roummel F. Marcia

Publication date 7 April 2008

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apnum.2007.01.014

zbMATH Keywords

conjugate gradient methodtridiagonal matricessymmetric indefinite matricessymmetric indefinite factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Recommendations

• scientific article; zbMATH DE number 4039123
• A hybrid iterative method for symmetric indefinite linear systems
• scientific article; zbMATH DE number 704287
• A note on simultaneous preconditioning and symmetrization of non-symmetric linear systems.
• scientific article; zbMATH DE number 4102379

Cites work

• scientific article; zbMATH DE number 3161527 (Why is no real title available?)
• scientific article; zbMATH DE number 88927 (Why is no real title available?)
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 1063693 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
• A simplified pivoting strategy for symmetric tridiagonal matrices
• Accurate Symmetric Indefinite Linear Equation Solvers
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
• Methods of conjugate gradients for solving linear systems
• Partial Pivoting Strategies for Symmetric Matrices
• Solution of Sparse Indefinite Systems of Linear Equations
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• Stability of block LDL^T factorization of a symmetric tridiagonal matrix

Cited in

(7)

• Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
• Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
• A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges.
• An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
• Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation
• Delayed gradient methods for symmetric and positive definite linear systems
• A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization

This page was built for publication: On solving sparse symmetric linear systems whose definiteness is unknown

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