Two recursive GMRES-type methods for shifted linear systems with general preconditioning

zbMath1355.65055arXiv1403.4428MaRDI QIDQ501649

Kirk M. Soodhalter

Publication date: 9 January 2017

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.4428

File on IPFS

zbMATH Keywords

preconditioningquantum chromodynamicsKrylov subspace methodsshifted linear systemsparameterized linear systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Strong interaction, including quantum chromodynamics (81V05) Preconditioners for iterative methods (65F08)

Related Items (10)

On the computation of a truncated SVD of a large linear discrete ill-posed problem ⋮ Nested Krylov Methods for Shifted Linear Systems ⋮ Infinite GMRES for Parameterized Linear Systems ⋮ On an integrated Krylov-ADI solver for large-scale Lyapunov equations ⋮ A survey of subspace recycling iterative methods ⋮ A flexible and adaptive simpler GMRES with deflated restarting for shifted linear systems ⋮ GMRES algorithms over 35 years ⋮ A FEM for an optimal control problem subject to the fractional Laplace equation ⋮ On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems ⋮ Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously

This page was built for publication: Two recursive GMRES-type methods for shifted linear systems with general preconditioning