Polynomial preconditioners based on factorized sparse approximate inverses

DOI10.1016/S0096-3003(01)00231-4zbMath1026.65033MaRDI QIDQ1855875

Yanyan Li

Publication date: 28 January 2003

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

zbMATH Keywords

numerical experimentsconjugate gradient methodmultisplittingsparse approximate inversesadditive polynomial preconditionermultiple minimum degree orderingsreverse Cuthill-McKee ordering

Mathematics Subject Classification ID

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

Uses Software

• SparseMatrix
• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item
• Additive polynomial preconditions for parallel computers
• A comparative study of sparse approximate inverse preconditioners
• A Krylov multisplitting algorithm for solving linear systems of equations
• Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
• Polynomial Preconditioners for Conjugate Gradient Calculations
• m-Step Preconditioned Conjugate Gradient Methods
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Sparse matrix test problems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• Orderings for Factorized Sparse Approximate Inverse Preconditioners
• Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
• Algebraic theory of multiplicative Schwarz methods

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