A parallel multisplitting method with self-adaptive weightings for solving \(H\)-matrix linear systems
From MaRDI portal
Publication:524809
DOI10.1186/s13660-017-1370-7zbMath1431.65036OpenAlexW2611876719WikidataQ41827227 ScholiaQ41827227MaRDI QIDQ524809
Publication date: 3 May 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1370-7
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- On the convergence of the parallel multisplitting AOR algorithm
- Generalizations of the nonstationary multisplitting iterative method for symmetric positive definite linear systems
- Convergence of relaxed parallel multisplitting methods
- The role of diagonal dominance and cell Reynolds number in implicit different methods for fluid mechanics problems
- On recurring theorems on diagonal dominance
- On the convergence of parallel nonstationary multisplitting iteration methods.
- On the convergence of additive and multiplicative splitting iterations for systems of linear equations
- Modified parallel multisplitting iterative methods for non-Hermitian positive definite systems
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Two-Stage and Multisplitting Methods for the Parallel Solution of Linear Systems
- A Simplex Method for Function Minimization
This page was built for publication: A parallel multisplitting method with self-adaptive weightings for solving \(H\)-matrix linear systems
