Improved comparison theorem for the nonlinear multisplitting relaxation method
From MaRDI portal
Publication:1921204
The authors continue here their earlier work [Chin. Ann. Math., Ser. B 15, No. 3, 335-348 (1994; Zbl 0814.65047)] on multisplitting, relaxation methods for solving systems of nonlinear equations \(F(x)=0\). A theorem is proved which provides a comparison, in the natural partial ordering of \(\mathbb{R}^n\), between the iterates produced by two suitably related multisplittings of \(F\).
Recommendations
- New comparison theorem for the nonlinear multisplitting relaxation method for the nonlinear complementarity problems
- Parallel nonlinear multisplitting relaxation methods
- Nonstationary multisplittings with general weighting matrices for mildly nonlinear systems
- On monotone convergence of nonlinear multisplitting relaxation methods
- scientific article; zbMATH DE number 411262
Cites work
- A Nonlinear Parallel Algorithm with Application to the Stefan Problem
- scientific article; zbMATH DE number 1348819 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Nonlinear Generalizations of Matrix Diagonal Dominance with Application to Gauss–Seidel Iterations
- On \(M\)-functions and their application to nonlinear Gauss-Seidel iterations and to network flows
- On monotone convergence of nonlinear multisplitting relaxation methods
- On the convergence of the parallel multisplitting AOR algorithm
- Parallel Algorithms for Nonlinear Problems
- Parallel nonlinear AOR method and its convergence
- Parallel nonlinear multisplitting methods
Cited in
(3)
This page was built for publication: Improved comparison theorem for the nonlinear multisplitting relaxation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921204)
