Multipreconditioned GMRES for shifted systems
From MaRDI portal
Abstract: An implementation of GMRES with multiple preconditioners (MPGMRES) is proposed for solving shifted linear systems with shift-and-invert preconditioners. With this type of preconditioner, the Krylov subspace can be built without requiring the matrix-vector product with the shifted matrix. Furthermore, the multipreconditioned search space is shown to grow only linearly with the number of preconditioners. This allows for a more efficient implementation of the algorithm. The proposed implementation is tested on shifted systems that arise in computational hydrology and the evaluation of different matrix functions. The numerical results indicate the effectiveness of the proposed approach.
Recommendations
- A flexible and adaptive simpler GMRES with deflated restarting for shifted linear systems
- Accelerated preconditioner updates for solving shifted linear systems
- Efficient preconditioner updates for shifted linear systems
- A weighted simpler GMRES algorithm for shifted linear systems
- A flexible preconditioned Arnoldi method for shifted linear systems
Cites work
- A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A flexible Krylov solver for shifted systems with application to oscillatory hydraulic tomography
- A flexible preconditioned Arnoldi method for shifted linear systems
- A stopping criterion for the conjugate gradient algorithm in a finite element method framework
- Accuracy and Stability of Numerical Algorithms
- Approximate inverse preconditioning for shifted linear systems
- Automated solution of differential equations by the finite element method. The FEniCS book
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Computing A^\alpha, \log(A), and Related Matrix Functions by Contour Integrals
- Computing f(A)b via least squares polynomial approximations
- Computing matrix functions
- Deflated GMRES for systems with multiple shifts and multiple right-hand sides
- DOLFIN: automated finite element computing
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient preconditioner updates for shifted linear systems
- Flexible BiCG and flexible Bi-CGSTAB for nonsymmetric linear systems
- FQMR: A flexible quasi-minimal residual method with inexact preconditioning
- GMRES with multiple preconditioners
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- Krylov subspace recycling for sequences of shifted linear systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Nested Krylov Methods for Shifted Linear Systems
- On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
- On the Compatibility of a Given Solution With the Data of a Linear System
- Preconditioned multishift BiCG for \(\mathcal{H}_2\)-optimal model reduction
- Recent computational developments in Krylov subspace methods for linear systems
- Recycling Subspace Information for Diffuse Optical Tomography
- Stopping criteria for iterations in finite element methods
- Stopping Criteria for Iterative Solvers
- The computation of bounds for the norm of the error in the conjugate gradient algorithm
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- The Lanczos method for parameterized symmetric linear systems with multiple right-hand sides
- The Solution of Parametrized Symmetric Linear Systems
- The University of Florida sparse matrix collection
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
Cited in
(18)- An efficient two-level preconditioner for multi-frequency wave propagation problems
- GMRES with multiple preconditioners
- Flexible and deflated variants of the block shifted GMRES method
- A new shifted block GMRES method with inexact breakdowns for solving multi-shifted and multiple right-hand sides linear systems
- GMRES algorithms over 35 years
- Efficient preconditioner updates for shifted linear systems
- Efficient D-optimal design of experiments for infinite-dimensional Bayesian linear inverse problems
- Infinite GMRES for parameterized linear systems
- Block Krylov subspace methods for functions of matrices. II: Modified block FOM
- Accelerated preconditioner updates for solving shifted linear systems
- Multigrid approach in shifted linear systems for the non-degenerated twisted mass operator
- Preconditioners for Krylov subspace methods: An overview
- A survey of subspace recycling iterative methods
- Preconditioned Chebyshev BiCG method for parameterized linear systems
- Interior eigensolver based on rational filter with composite rule
- Improved error bounds for the deflated multi-preconditioned CG method
- On the computation of the Mittag-Leffler function of fractional powers of accretive operators
- Minimal residual rational Krylov subspace method for sequences of shifted linear systems
This page was built for publication: Multipreconditioned GMRES for shifted systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5372626)
