Multisplitting Preconditioners Based on Incomplete Choleski Factorizations

DOI10.1137/S0895479893249009zbMath0841.65018WikidataQ114073908 ScholiaQ114073908MaRDI QIDQ4857580

C. Corral, Rafael Bru, Àngeles Martínez, José Mas

Publication date: 1 July 1996

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

numerical resultspolynomial preconditionersconjugate gradient methodparallel methodincomplete Cholesky factorizationmultisplittings

Mathematics Subject Classification ID

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

Related Items (11)

Semiconvergence of parallel multisplitting methods for symmetric positive semidefinite linear systems ⋮ A preconditioned conjugate gradient method on a distributed memory multiprocessor ⋮ Multisplitting preconditioners for a symmetric positive definite matrix ⋮ Nonstationary two-stage multisplitting methods for symmetric positive definite matrices ⋮ Parallel relaxed multisplitting methods for a symmetric positive definite matrix ⋮ Multisplitting and two stage multisplitting of a symmetric positive definite matrix^∗ ⋮ On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors ⋮ Some notes on multisplitting methods and \(m\)-step preconditioners for linear systems ⋮ On validity of \(m\)-step multisplitting preconditioners for linear systems ⋮ Polynomial preconditioners based on factorized sparse approximate inverses ⋮ Convergence of generalized relaxed multisplitting methods for symmetric positive definite matrices

This page was built for publication: Multisplitting Preconditioners Based on Incomplete Choleski Factorizations