Krylov Subspace Solvers and Preconditioners

DOI10.1051/proc/201863001zbMath1406.65021OpenAlexW2897347413MaRDI QIDQ4615479

Kees Vuik

Publication date: 28 January 2019

Published in: ESAIM: Proceedings and Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/proc/201863001

zbMATH Keywords

conjugate gradient methodsystem of linear equationssystem of linear equations with the ``preconditioner matrix

Mathematics Subject Classification ID

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

Related Items

Sparse Aitken-Schwarz domain decomposition with application to Darcy flow

Uses Software

• LSQR
• CGS
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
• On the eigenvalue distribution of a class of preconditioning methods
• A study of semiiterative methods for nonsymmetric systems of linear equations
• The rate of convergence of conjugate gradients
• Preconditioned conjugate gradients for solving singular systems
• Preconditioning techniques for nonsymmetric and indefinite linear systems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Factorizing symmetric indefinite matrices
• The Tchebychev iteration for nonsymmetric linear systems
• The superlinear convergence behaviour of GMRES
• Condition, equilibration and pivoting in linear algebraic systems
• Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
• The Determination of the Optimum Accelerating Factor for Successive Over-relaxation
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• High Performance Preconditioning
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• How Fast are Nonsymmetric Matrix Iterations?
• Solution of the discretized incompressible Navier-Stokes equations with the GMRES method
• 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
• A class of first order factorization methods
• Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
• Iterative Solution Methods
• The Tortoise and the Hare Restart GMRES
• Iterative Krylov Methods for Large Linear Systems
• GMRESR: a family of nested GMRES methods
• Any Nonincreasing Convergence Curve is Possible for GMRES
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• A Flexible Inner-Outer Preconditioned GMRES Algorithm
• A Novel Multigrid Based Preconditioner For Heterogeneous Helmholtz Problems
• The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A”
• Methods of conjugate gradients for solving linear systems