On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
From MaRDI portal
Publication:2448311
DOI10.1016/j.cam.2013.02.020zbMath1285.65020OpenAlexW2053893326MaRDI QIDQ2448311
Jennifer Pestana, Andrew J. Wathen
Publication date: 30 April 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.02.020
Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items
Some observations on preconditioning for non-self-adjoint and time-dependent problems ⋮ A Note on Constraint Preconditioning ⋮ GMRES algorithms over 35 years ⋮ Weighted Inner Products for GMRES and GMRES-DR ⋮ A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues ⋮ The role eigenvalues play in forming GMRES residual norms with non-normal matrices ⋮ Null-Space Preconditioners for Saddle Point Systems ⋮ Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems ⋮ A Preconditioned MINRES Method for Nonsymmetric Toeplitz Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new look at CMRH and its relation to GMRES
- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- A semi-circulant preconditioner for the convection-diffusion equation
- Krylov sequences of maximal length and convergence of GMRES
- Weighted FOM and GMRES for solving nonsymmetric linear systems
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- A multigrid preconditioner for stabilised discretisations of advection-diffusion problems
- The importance of eigenvectors for local preconditioners of the Euler equations
- On the eigenvalues of a class of saddle point matrices
- The effect of non-optimal bases on the convergence of Krylov subspace methods
- Analysis of the convergence of the minimal and the orthogonal residual methods
- The university of Florida sparse matrix collection
- GMRES vs. Ideal GMRES
- A Taxonomy for Conjugate Gradient Methods
- Recent computational developments in Krylov subspace methods for linear systems
- Geometric aspects of the theory of Krylov subspace methods
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- Combination Preconditioning and the Bramble–Pasciak$^{+}$ Preconditioner
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Proposal for Toeplitz Matrix Calculations
- An Optimal Circulant Preconditioner for Toeplitz Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- From Potential Theory to Matrix Iterations in Six Steps
- Convergence analysis of Krylov subspace methods
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Computable Convergence Bounds for GMRES
- Preconditioning and convergence in the right norm
- An Introduction to Iterative Toeplitz Solvers
- Some Remarks on the Elman Estimate for GMRES
- GMRES Convergence Analysis for a Convection-Diffusion Model Problem
- Methods of conjugate gradients for solving linear systems
- The role of the inner product in stopping criteria for conjugate gradient iterations
