Modulus-Based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem
East Asian J. Appl. Math., 7 (2017), pp. 363-375.
Published online: 2018-02
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{EAJAM-7-363,
author = {Chen-Liang Li and Jun-Tao Hong},
title = {Modulus-Based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem},
journal = {East Asian Journal on Applied Mathematics},
year = {2018},
volume = {7},
number = {2},
pages = {363--375},
abstract = {
We construct modulus-based synchronous multisplitting iteration methods to solve a large implicit complementarity problem on parallel multiprocessor systems, and prove their convergence. Numerical results confirm our theoretical analysis and show that these new methods are efficient.
}, issn = {2079-7370}, doi = {https://doi.org/10.4208/eajam.261215.220217a}, url = {http://global-sci.org/intro/article_detail/eajam/10754.html} }
TY - JOUR
T1 - Modulus-Based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem
AU - Chen-Liang Li & Jun-Tao Hong
JO - East Asian Journal on Applied Mathematics
VL - 2
SP - 363
EP - 375
PY - 2018
DA - 2018/02
SN - 7
DO - http://doi.org/10.4208/eajam.261215.220217a
UR - https://global-sci.org/intro/article_detail/eajam/10754.html
KW - Implicit complementarity problem, synchronous, iterative method, modulus-based multisplitting.
AB -
We construct modulus-based synchronous multisplitting iteration methods to solve a large implicit complementarity problem on parallel multiprocessor systems, and prove their convergence. Numerical results confirm our theoretical analysis and show that these new methods are efficient.
Chen-Liang Li and Jun-Tao Hong. (2018). Modulus-Based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem.
East Asian Journal on Applied Mathematics. 7 (2).
363-375.
doi:10.4208/eajam.261215.220217a
Copy to clipboard