Improved comparison theorem for the nonlinear multisplitting relaxation method
From MaRDI portal
Publication:1921204
DOI10.1016/0898-1221(96)00027-2zbMath0856.65052OpenAlexW2018064229MaRDI QIDQ1921204
Publication date: 2 March 1997
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(96)00027-2
Cites Work
- Unnamed Item
- Unnamed Item
- On the convergence of the parallel multisplitting AOR algorithm
- Parallel nonlinear multisplitting methods
- On monotone convergence of nonlinear multisplitting relaxation methods
- Parallel nonlinear AOR method and its convergence
- On \(M\)-functions and their application to nonlinear Gauss-Seidel iterations and to network flows
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Parallel Algorithms for Nonlinear Problems
- A Nonlinear Parallel Algorithm with Application to the Stefan Problem
- Nonlinear Generalizations of Matrix Diagonal Dominance with Application to Gauss–Seidel Iterations
This page was built for publication: Improved comparison theorem for the nonlinear multisplitting relaxation method