Yet another polynomial preconditioner for the conjugate gradient algorithm
From MaRDI portal
Publication:808612
DOI10.1016/0024-3795(91)90385-AzbMath0732.65020OpenAlexW2168224303MaRDI QIDQ808612
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(91)90385-a
numerical experimentsconjugate gradient algorithmChebyshev or least square polynomial preconditioners
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (5)
A numerical study of optimized sparse preconditioners ⋮ Polynomial Preconditioned GMRES and GMRES-DR ⋮ Two-level least squares methods in Krylov subspaces ⋮ Least squares methods in Krylov subspaces ⋮ Unified frameworks for high order Newton-Schulz and Richardson iterations: a computationally efficient toolkit for convergence rate improvement
Cites Work
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- Block Preconditioning for the Conjugate Gradient Method
- Polynomial Preconditioners for Conjugate Gradient Calculations
- m-Step Preconditioned Conjugate Gradient Methods
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Methods of conjugate gradients for solving linear systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Yet another polynomial preconditioner for the conjugate gradient algorithm
