Polynomial preconditioners based on factorized sparse approximate inverses

DOI10.1016/S0096-3003(01)00231-4MaRDI QIDQ1855875zbMATH OpenFDO

Authors Yanyan Li, J. Cerdán, J. Marín, Angeles Martínez

Publication date 28 January 2003

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0096-3003(01)00231-4

zbMATH Keywords

additive polynomial preconditionerconjugate gradient methodmultiple minimum degree orderingsmultisplittingnumerical experimentsreverse Cuthill-McKee orderingsparse approximate inverses

Mathematics Subject Classification ID

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

Review text

The authors propose an additive polynomial preconditioner for solving linear systems with the conjugate gradient method based on multisplitting, which is obtained by computing some factorized sparse approximate inverses of the coefficient matrix. Numerical experiments on structural analysis and transport/diffusion problems are presented. The effect of the reverse Cuthill-McKee and multiple minimum degree orderings is also evaluated.

Recommendations

• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• A comparative study of sparse approximate inverse preconditioners
• scientific article; zbMATH DE number 833706
• Factorized sparse approximate inverses for preconditioning
• scientific article; zbMATH DE number 1873440

Cites work

• m-Step Preconditioned Conjugate Gradient Methods
• A comparative study of sparse approximate inverse preconditioners
• A Krylov multisplitting algorithm for solving linear systems of equations
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
• Additive polynomial preconditions for parallel computers
• Algebraic theory of multiplicative Schwarz methods
• Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
• Orderings for Factorized Sparse Approximate Inverse Preconditioners
• Polynomial Preconditioners for Conjugate Gradient Calculations
• Sparse matrix test problems

Cited in

(8)

• Stability of polynomial preconditioning
• scientific article; zbMATH DE number 495313 (Why is no real title available?)
• Polynomial preconditioning for specially structured linear systems of equations
• scientific article; zbMATH DE number 1873440 (Why is no real title available?)
• Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
• Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
• Factorised preconditionings of successive approximations in finite precision
• Parallel matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks

Describes a project that uses

Uses Software

• SparseMatrix
• Harwell-Boeing sparse matrix collection

This page was built for publication: Polynomial preconditioners based on factorized sparse approximate inverses

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