Rational approximation preconditioners for sparse linear systems.
From MaRDI portal
Publication:1410875
DOI10.1016/S0377-0427(03)00480-1zbMath1033.65029MaRDI QIDQ1410875
Philippe Guillaume, Masha Sosonkina, Yousef Saad
Publication date: 15 October 2003
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
numerical experimentsPadé approximationpreconditioningsparse matrixrational approximationincomplete LU factorizationill-conditioned matricesmatrix diagonal shifting
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rational Krylov sequence methods for eigenvalue computation
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Experimental study of ILU preconditioners for indefinite matrices
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- Continuation-Conjugate Gradient Methods for the Least Squares Solution of Nonlinear Boundary Value Problems
- A Stability Analysis of Incomplete LU Factorizations
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Deflated and Augmented Krylov Subspace Techniques
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Preconditioning strategies for linear systems arising in tire design
- A Restarted GMRES Method Augmented with Eigenvectors
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- ARMS: an algebraic recursive multilevel solver for general sparse linear systems