Preconditioning techniques for nonsymmetric and indefinite linear systems
DOI10.1016/0377-0427(88)90345-7zbMath0662.65028OpenAlexW2044557804MaRDI QIDQ1114329
Publication date: 1988
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(88)90345-7
comparison of methodspreconditioningnormal equationsleast squares problemslarge sparse linear systemsSSORincomplete CholeskyindefinitenonsymmetricGram-Schmidt-processincomplete LQ factorizationincomplete LU factorization with pivoting
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (40)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An iterative method for the Helmholtz equation
- Solution of sparse linear least squares problems using Givens rotations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Stability Analysis of Incomplete LU Factorizations
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Use of Iterative Refinement in the Solution of Sparse Linear Systems
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
This page was built for publication: Preconditioning techniques for nonsymmetric and indefinite linear systems