@Article{EAJAM-9-1,
author = {},
title = {A Relaxation Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems},
journal = {East Asian Journal on Applied Mathematics},
year = {2019},
volume = {9},
number = {1},
pages = {102--121},
abstract = {<p style="text-align: justify;">A general RTMS iteration method for linear complementarity problems is
proposed. Choosing various pairs of relaxation parameters, we obtain new two-sweep
modulus-based matrix splitting iteration methods and already known iteration procedures such as the MS [1] and TMS [27] iteration methods. If the system matrix is
positive definite or an $H_+$-matrix and the relaxation parameters $ω_1$&nbsp;and $ω_2$<sub>&nbsp;</sub>satisfy the
inequality 0≤$ω_1$, $ω_2$≤1, sufficient conditions for the uniform convergence of MS,
TMS and NTMS iteration methods are established. Numerical results show that with
quasi-optimal parameters, RTMS iteration method outperforms MS and TMS iteration
methods in terms of computing efficiency.</p>},
issn = {2079-7370},
doi = {https://doi.org/10.4208/eajam.020318.220618},
url = {https://global-sci.com/article/82593/a-relaxation-two-sweep-modulus-based-matrix-splitting-iteration-method-for-linear-complementarity-problems}
}