A note on the parallel GSAOR method for block diagonally dominant matrices
From MaRDI portal
Publication:269609
DOI10.1515/jnma-2014-1001zbMath1336.65049OpenAlexW2329784733MaRDI QIDQ269609
Publication date: 19 April 2016
Published in: Journal of Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jnma-2014-1001
convergencemultisplittingblock diagonally dominant matricesgeneralized block diagonally dominant matricesgeneralized SAOR method
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of parallel multisplitting iterative methods for M-matrices
- On the parallel GSAOR method for block diagonally dominant matrices
- On the convergence of the parallel multisplitting AOR algorithm
- Convergence of relaxed multisplitting USAOR methods for \(H\)-matrices linear systems
- Comparisons of weak regular splittings and multisplitting methods
- Convergence of relaxed parallel multisplitting methods
- Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem
- Incomplete blockwise factorizations of (block) H-matrices
- Parallel, synchronous and asynchronous two-stage multisplitting methods
- Nonstationary parallel relaxed multisplitting methods
- A class of asynchronous parallel multisplitting blockwise relaxation methods
- New comparison results for parallel multisplitting iterative methods
- Multisplitting of a Symmetric Positive Definite Matrix
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Multisplitting with Different Weighting Schemes
This page was built for publication: A note on the parallel GSAOR method for block diagonally dominant matrices
