Stability of polynomial preconditioning

MaRDI QIDQ2753112zbMATH OpenFDO

Authors Yu Liang, J. Weston, Marek Szularz

Publication date 11 August 2003

zbMATH Keywords

GMRESlarge-scale sparse linear equationsnumerical examplesperturbationpolynomial computationpolynomial preconditioningrounding errorsstability

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• Polynomial preconditioned Arnoldi with stability control
• scientific article; zbMATH DE number 4182691
• Polynomial preconditioners based on factorized sparse approximate inverses
• Efficient Polynomial Preconditioning for the Conjugate Gradient Method

Cited in

(9)

• Pole placement preconditioning
• Polynomial Preconditioned GMRES and GMRES-DR
• Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning
• A Stability Property of T. Chan's Preconditioner
• scientific article; zbMATH DE number 1863313 (Why is no real title available?)
• Polynomial preconditioned Arnoldi with stability control
• Application of polynomial preconditioners to conservation laws
• Generalized least-squares polynomial preconditioners for symmetric indefinite linear equations
• Parallel matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks

This page was built for publication: Stability of polynomial preconditioning

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