Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
DOI10.1137/S0895479893249009zbMATH Open0841.65018WikidataQ114073908 ScholiaQ114073908MaRDI QIDQ4857580FDOQ4857580
Authors: R. Bru, C. Corral, Angeles Martínez, J. Mas 
Publication date: 1 July 1996
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
- Parallel relaxed multisplitting methods for a symmetric positive definite matrix
- Polynomial preconditioners based on factorized sparse approximate inverses
- Additive polynomial preconditions for parallel computers
- scientific article; zbMATH DE number 3992788
- scientific article; zbMATH DE number 3917546
numerical resultsconjugate gradient methodparallel methodincomplete Cholesky factorizationmultisplittingspolynomial preconditioners
Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cited In (18)
- Polynomial preconditioners based on factorized sparse approximate inverses
- Multisplitting and two stage multisplitting of a symmetric positive definite matrix∗
- Convergence of generalized relaxed multisplitting methods for symmetric positive definite matrices
- Additive polynomial preconditions for parallel computers
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- On validity of \(m\)-step multisplitting preconditioners for linear systems
- On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
- Multisplitting preconditioners for a symmetric positive definite matrix
- Semiconvergence of parallel multisplitting methods for symmetric positive semidefinite linear systems.
- Preconditioning Sparse Matrices with Alternating and Multiplicative Operator Splittings
- Some notes on multisplitting methods and \(m\)-step preconditioners for linear systems
- Title not available (Why is that?)
- Performance of ILU factorization preconditioners based on multisplittings
- Parallel relaxed multisplitting methods for a symmetric positive definite matrix
- A preconditioned conjugate gradient method on a distributed memory multiprocessor
- Nonstationary two-stage multisplitting methods for symmetric positive definite matrices
- MODIFLED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC POSITIVE DEFINITE MATRIX
- CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
This page was built for publication: Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857580)
