A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems

DOI10.1137/0915029zbMath0806.65030OpenAlexW2130860589MaRDI QIDQ4294373

Wayne D. Joubert

Publication date: 9 February 1995

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0915029

zbMATH Keywords

convergencenumerical experimentsiterative methodspolynomial preconditioningconjugate residual methodgeneralized restarted minimal residual method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (10)

Polynomial Preconditioned GMRES and GMRES-DR ⋮ A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides ⋮ Restarted GMRES preconditioned by deflation ⋮ A survey of subspace recycling iterative methods ⋮ GMRES algorithms over 35 years ⋮ A modified SSOR-like preconditioner for non-Hermitian positive definite matrices ⋮ On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems ⋮ Convergence analysis of Krylov subspace methods ⋮ Stability of Linear GMRES Convergence with Respect to Compact Perturbations ⋮ Generalizations of the field of values useful in the study of polynomial functions of a matrix

This page was built for publication: A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems