Minimal Residual Method Stronger than Polynomial Preconditioning
From MaRDI portal
Publication:4717288
DOI10.1137/S0895479895286748zbMath0862.65019WikidataQ87751238 ScholiaQ87751238MaRDI QIDQ4717288
Vance Faber, Emanuel Knill, Thomas A. Manteuffel, Wayne D. Joubert
Publication date: 25 May 1997
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
convergence; iterative methods; GMRES; triangular Toeplitz matrix; polynomial preconditioning; nonsymmetric coefficient matrices; restarted minimal residual method
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
Field of values of perturbed matrices and quantum states, Convergence analysis of Krylov subspace methods, Weighted Inner Products for GMRES and GMRES-DR, Polynomial numerical hulls of the direct sum of a normal matrix and a Jordan block, Generalizations of the field of values useful in the study of polynomial functions of a matrix, DGMRES and index numerical range of matrices, On the convergence rate of DGMRES, Complete stagnation of GMRES for normal matrices, Polynomial numerical hulls of the direct sum of two Jordan blocks, Polynomial numerical hulls of matrices, GMRES algorithms over 35 years