A Comparison of Adaptive Chebyshev and Least Squares Polynomial Preconditioning for Hermitian Positive Definite Linear Systems
From MaRDI portal
Publication:3990900
DOI10.1137/0913001zbMath0745.65019MaRDI QIDQ3990900
James S. Otto, Thomas A. Manteuffel, Steven F. Ashby
Publication date: 28 June 1992
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0913001
efficiency; conjugate gradient methods; test problems; adaptive procedure; Chebyshev preconditioning; Hermitian positive definite linear systems; least squares polynomial preconditioning
65F10: Iterative numerical methods for linear systems
Related Items
Proxy-GMRES: Preconditioning via GMRES in Polynomial Space, Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction, A numerical study of optimized sparse preconditioners, GMRES convergence bounds for eigenvalue problems, Preconditioning complex symmetric linear systems, Polynomial Preconditioned GMRES and GMRES-DR, Preconditioning of Radial Basis Function Interpolation Systems via Accelerated Iterated Approximate Moving Least Squares Approximation