Adaptively Preconditioned GMRES Algorithms
From MaRDI portal
Publication:4210413
DOI10.1137/S1064827596305258zbMath0954.65026MaRDI QIDQ4210413
Gene H. Golub, Daniela Calvetti, Lothar Reichel, James Baglama
Publication date: 21 September 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
convergence; iterative method; sparse matrix; preconditioner; Arnoldi process; nonsymmetric linear system; restarted GMRES algorithm
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
Unnamed Item, Efficient preconditioners for iterative solution of the boundary element equations for the three-dimensional Helmholtz equation, Restarted block-GMRES with deflation of eigenvalues, Adaptive preconditioners for nonlinear systems of equations, Deflated GMRES for systems with multiple shifts and multiple right-hand sides, Preconditioner updates applied to CFD model problems, A numerical solution using an adaptively preconditioned Lanczos method for a class of linear systems related with the fractional Poisson equation, An efficient preconditioned CG method for the solution of a class of layered problems with extreme contrasts in the coefficients, On efficient preconditioners for iterative solution of a Galerkin boundary element equation for the three-dimensional exterior Helmholtz problem, Analysis of acceleration strategies for restarted minimal residual methods, Pole placement preconditioning, Incremental spectral preconditioners for sequences of linear systems, A matrix-free two-grid preconditioner for solving boundary integral equations in electromagnetism, Convergence conditions for a restarted GMRES method augmented with eigenspaces, Improving Triangular Preconditioner Updates for Nonsymmetric Linear Systems
