Multisplitting preconditioners for a symmetric positive definite matrix
From MaRDI portal
Publication:854427
DOI10.1007/BF02896469zbMath1112.65030OpenAlexW1987976437MaRDI QIDQ854427
Jae Heon Yun, Eun Heui Kim, Se-Young Oh
Publication date: 4 December 2006
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02896469
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Cites Work
- Convergence of parallel multisplitting iterative methods for M-matrices
- Topological proofs for certain theorems on matrices with non-negative elements
- Convergence of relaxed parallel multisplitting methods
- On the stability of the incomplete LU-factorizations and characterizations of \(H\)-matrices
- Performance of ILU factorization preconditioners based on multisplittings
- Convergence of two-stage iterative methods using incomplete factorization.
- Convergence of multisplitting method for a symmetric positive definite matrix
- Multisplitting of a Symmetric Positive Definite Matrix
- Polynomial Preconditioners for Conjugate Gradient Calculations
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Two-Stage and Multisplitting Methods for the 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
- Methods of conjugate gradients for solving linear systems
