A Comparison of Adaptive Chebyshev and Least Squares Polynomial Preconditioning for Hermitian Positive Definite Linear Systems

DOI10.1137/0913001zbMath0745.65019OpenAlexW2084220013MaRDI 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

zbMATH Keywords

efficiencyconjugate gradient methodstest problemsadaptive procedureChebyshev preconditioningHermitian positive definite linear systemsleast squares polynomial preconditioning

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items

A numerical study of optimized sparse preconditioners, Polynomial Preconditioned GMRES and GMRES-DR, GMRES convergence bounds for eigenvalue problems, Preconditioning complex symmetric linear systems, Preconditioning of Radial Basis Function Interpolation Systems via Accelerated Iterated Approximate Moving Least Squares Approximation, Proxy-GMRES: Preconditioning via GMRES in Polynomial Space, Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction