Multipreconditioned Gmres for Shifted Systems
From MaRDI portal
Publication:5372626
DOI10.1137/16M1068694zbMath1392.65043arXiv1603.08970WikidataQ57427899 ScholiaQ57427899MaRDI QIDQ5372626
Arvind K. Saibaba, Peter K. Kitanidis, Tania Bakhos, Scott Ladenheim, Daniel B. Szyld
Publication date: 27 October 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.08970
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
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, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Automated solution of differential equations by the finite element method. The FEniCS book
- A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers
- Deflated GMRES for systems with multiple shifts and multiple right-hand sides
- The computation of bounds for the norm of the error in the conjugate gradient algorithm
- Approximate inverse preconditioning for shifted linear systems
- A stopping criterion for the conjugate gradient algorithm in a finite element method framework
- GMRES with multiple preconditioners
- Stopping criteria for iterations in finite element methods
- Flexible BiCG and flexible Bi-CGSTAB for nonsymmetric linear systems
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Krylov subspace recycling for sequences of shifted linear systems
- Computing matrix functions
- DOLFIN
- The university of Florida sparse matrix collection
- The Lanczos Method for Parameterized Symmetric Linear Systems with Multiple Right-Hand Sides
- Computing $f(A)b$ via Least Squares Polynomial Approximations
- Efficient Preconditioner Updates for Shifted Linear Systems
- On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
- Nested Krylov Methods for Shifted Linear Systems
- Recent computational developments in Krylov subspace methods for linear systems
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Stopping Criteria for Iterative Solvers
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- The Solution of Parametrized Symmetric Linear Systems
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Accuracy and Stability of Numerical Algorithms
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A Flexible Krylov Solver for Shifted Systems with Application to Oscillatory Hydraulic Tomography
- Recycling Subspace Information for Diffuse Optical Tomography
- On the Compatibility of a Given Solution With the Data of a Linear System
- FQMR: A Flexible Quasi-Minimal Residual Method with Inexact Preconditioning
