Pages that link to "Item:Q4857580"
From MaRDI portal
The following pages link to Multisplitting Preconditioners Based on Incomplete Choleski Factorizations (Q4857580):
Displayed 11 items.
- Multisplitting preconditioners for a symmetric positive definite matrix (Q854427) (← links)
- On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors (Q1013149) (← links)
- On validity of \(m\)-step multisplitting preconditioners for linear systems (Q1855158) (← links)
- Polynomial preconditioners based on factorized sparse approximate inverses (Q1855875) (← links)
- Convergence of generalized relaxed multisplitting methods for symmetric positive definite matrices (Q1862017) (← links)
- A preconditioned conjugate gradient method on a distributed memory multiprocessor (Q1894218) (← links)
- Parallel relaxed multisplitting methods for a symmetric positive definite matrix (Q2493762) (← links)
- Some notes on multisplitting methods and \(m\)-step preconditioners for linear systems (Q2564936) (← links)
- Semiconvergence of parallel multisplitting methods for symmetric positive semidefinite linear systems (Q2889388) (← links)
- Multisplitting and two stage multisplitting of a symmetric positive definite matrix<sup>∗</sup> (Q4934826) (← links)
- Nonstationary two-stage multisplitting methods for symmetric positive definite matrices (Q5931721) (← links)