Polynomial preconditioners based on factorized sparse approximate inverses
type: Item
instance of: scholarly article
title: Polynomial preconditioners based on factorized sparse approximate inverses
zbMATH Open document ID: 1026.65033
DOI: 10.1016/S0096-3003(01)00231-4
author: Yanyan Li
published in: Applied Mathematics and Computation
publication date: 2003-01-28T00:00:00Z
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.
reviewed by: F. Szidarovszky
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 1861247
zbMATH Keywords: reverse Cuthill-McKee ordering
zbMATH Keywords: numerical experiments
zbMATH Keywords: additive polynomial preconditioner
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: multisplitting
zbMATH Keywords: sparse approximate inverses
zbMATH Keywords: multiple minimum degree orderings
describes a project that uses: SparseMatrix
describes a project that uses: Harwell-Boeing sparse matrix collection
MaRDI profile type: Publication
cites work: m-Step Preconditioned Conjugate Gradient Methods
cites work: Additive polynomial preconditions for parallel computers
cites work: Algebraic theory of multiplicative Schwarz methods
cites work: A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
cites work: A comparative study of sparse approximate inverse preconditioners
cites work: Orderings for Factorized Sparse Approximate Inverse Preconditioners
cites work: Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
cites work: Q4326384
cites work: Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
cites work: Sparse matrix test problems
cites work: A Krylov multisplitting algorithm for solving linear systems of equations
cites work: Polynomial Preconditioners for Conjugate Gradient Calculations
cites work: Factorized Sparse Approximate Inverse Preconditionings I. Theory
cites work: Multi-Splittings of Matrices and Parallel Solution of Linear Systems
description: scientific article; zbMATH DE number 1861247