On validity of \(m\)-step multisplitting preconditioners for linear systems
From MaRDI portal
Publication:1855158
DOI10.1016/S0096-3003(00)00151-XzbMath1026.65032MaRDI QIDQ1855158
Publication date: 28 January 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
Convergences of splitting iterative methods for symmetric indefinite linear systems, Modified parallel multisplitting iterative methods for non-Hermitian positive definite systems, On \(k\)-step CSCS-based polynomial preconditioners for Toeplitz linear systems with application to fractional diffusion equations
Cites Work
- Symmetric multisplitting of a symmetric positive definite matrix
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- A Krylov multisplitting algorithm for solving linear systems of equations
- Some notes on multisplitting methods and \(m\)-step preconditioners for linear systems
- Convergence of nested classical iterative methods for linear systems
- m-Step Preconditioned Conjugate Gradient Methods
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Multisplitting with Different Weighting Schemes
- Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
- Diagonally compensated reduction and related preconditioning methods
- Unnamed Item
- Unnamed Item
