On the convergence of parallel nonstationary multisplitting iteration methods.
From MaRDI portal
Publication:1410828
DOI10.1016/S0377-0427(03)00555-7zbMath1033.65013MaRDI QIDQ1410828
Publication date: 15 October 2003
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
parallel computationmonotone convergencelarge sparse systemsmonotone matrixmatrix multisplittingchaotic multisplitting iteration methodnonstationnary iteration
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)
Related Items (8)
Convergence improvement of relaxed multisplitting USAOR methods for \(H\)-matrices linear systems ⋮ Parallel multisplitting methods with optimal weighting matrices for linear systems ⋮ Convergence theorems for block splitting iterative methods for linear systems ⋮ Modified quasi-Chebyshev acceleration to nonoverlapping parallel multisplitting method ⋮ A note on the inner-outer iterative method for solving the linear equation \(Ax = b\) ⋮ Modified parallel multisplitting iterative methods for non-Hermitian positive definite systems ⋮ A parallel multisplitting method with self-adaptive weightings for solving \(H\)-matrix linear systems ⋮ An inexact parallel splitting augmented Lagrangian method for large system of linear equations
Cites Work
- Unnamed Item
- Convergence of parallel multisplitting iterative methods for M-matrices
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- Models of parallel chaotic iteration methods
- Convergence of relaxed parallel multisplitting methods
- The monotone convergence of the two-stage iterative method for solving large sparse systems of linear equations
This page was built for publication: On the convergence of parallel nonstationary multisplitting iteration methods.