Multisplitting Preconditioners Based on Incomplete CholeskiFactorizations

Authors:
R. Bru;C. Corral;A. Martinez;J. Mas
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
1995

Citing 0
Cited 4

Polynomial preconditioners based on factorized sparse approximate inverses

Applied Mathematics and Computation
Convergence of generalized relaxed multisplitting methods for symmetric positive definite matrices

Applied Numerical Mathematics
On validity of m-step multisplitting preconditioners for linear systems

Applied Mathematics and Computation
On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors

Mathematics and Computers in Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let $Ax=b$ be a linear system where $A$ is a symmetric positive definite matrix. Preconditioners for the conjugate gradient method based on multisplittings obtained by incomplete Choleski factorizations of $A$ are studied. The validity of these preconditioners when $A$ is an $M$-matrix is proved and a parallel implementation is presented.