East Asian J. Appl. Math., 8 (2018), pp. 519-530.
Published online: 2018-08
Cited by
- BibTex
- RIS
- TXT
Modulus-based multisplitting iterative methods for large sparse nonlinear complementarity problems are developed. The approach is based on a reformulation of nonlinear complimentarily problems as implicit fixed-point equations and includes Jacobi, Gauss-Seidel and SOR iteration methods. For systems with positive definite matrices the convergence of the methods is proved. The methods are suitable for implementation on multiprocessor systems and numerical experiments confirm their high efficiency.
}, issn = {2079-7370}, doi = {https://doi.org/10.4208/eajam.300717.210318}, url = {http://global-sci.org/intro/article_detail/eajam/12623.html} }Modulus-based multisplitting iterative methods for large sparse nonlinear complementarity problems are developed. The approach is based on a reformulation of nonlinear complimentarily problems as implicit fixed-point equations and includes Jacobi, Gauss-Seidel and SOR iteration methods. For systems with positive definite matrices the convergence of the methods is proved. The methods are suitable for implementation on multiprocessor systems and numerical experiments confirm their high efficiency.