Yet another polynomial preconditioner for the conjugate gradient algorithm

DOI10.1016/0024-3795(91)90385-AMaRDI QIDQ808612zbMATH OpenOpenAlexFDO

Authors Dianne P. O'Leary

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

zbMATH Keywords

Chebyshev or least square polynomial preconditionersconjugate gradient algorithmnumerical experiments

Mathematics Subject Classification ID

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

Review text

The author discusses an adaptive technique for constructing preconditioners for the conjugate gradient algorithm which is based on the conjugate gradient residual polynomial. She presents an algorithm and results of numerical experiments showing that there are problems for which the method presented can compete with Chebyshev or least square polynomial preconditioners.

Recommendations

• scientific article; zbMATH DE number 16953
• scientific article; zbMATH DE number 4098613
• Efficient Polynomial Preconditioning for the Conjugate Gradient Method
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• Polynomial Preconditioners for Conjugate Gradient Calculations

Cites work

• m-Step Preconditioned Conjugate Gradient Methods
• A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
• Adaptive polynomial preconditioning for Hermitian indefinite linear systems
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Approximating the inverse of a matrix for use in iterative algorithms on vector processors
• Block Preconditioning for the Conjugate Gradient Method
• scientific article; zbMATH DE number 3145563 (Why is no real title available?)
• scientific article; zbMATH DE number 3958642 (Why is no real title available?)
• scientific article; zbMATH DE number 3196185 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems
• Polynomial Preconditioners for Conjugate Gradient Calculations
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• Solution of Sparse Indefinite Systems of Linear Equations

Cited in

(12)

• A numerical study of optimized sparse preconditioners
• Two-level least squares methods in Krylov subspaces
• Orthogonality of residual polynomials used in minimax polynomial preconditioning
• Unified frameworks for high order Newton-Schulz and Richardson iterations: a computationally efficient toolkit for convergence rate improvement
• Least squares methods in Krylov subspaces
• Polynomial Preconditioned GMRES and GMRES-DR
• Polynomial Preconditioners for Conjugate Gradient Calculations
• scientific article; zbMATH DE number 16953 (Why is no real title available?)
• scientific article; zbMATH DE number 1735439 (Why is no real title available?)
• scientific article; zbMATH DE number 1762043 (Why is no real title available?)
• A polynomial preconditioner for the CMRH algorithm
• An adaptive CGNR algorithm for solving large linear systems

This page was built for publication: Yet another polynomial preconditioner for the conjugate gradient algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808612)