Preconditioned parallel multisplitting USAOR method for \(H\)-matrices linear systems
From MaRDI portal
Publication:668912
DOI10.1016/j.amc.2015.11.068zbMath1410.65109OpenAlexW2221448510MaRDI QIDQ668912
Publication date: 19 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.11.068
Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
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
- 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
- Existence and uniqueness of splittings for stationary iterative methods with applications to alternating methods
- On the convergence domain of the matrix multisplitting relaxation methods for linear systems
- Weak-convergence theory of quasi-nonnegative splittings for singular matrices.
- Convergence of relaxed parallel multisplitting methods with different weighting schemes
- Two-sided bounds for the inverse of an \(H\)-matrix
- Comparison theorems of preconditioned Gauss-Seidel methods for \(M\)-matrices
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Multisplitting with Different Weighting Schemes
- Comparison analysis for improving preconditioned SOR-type iterative method