.png){kind=icon}
.png){kind=icon}
Return
A two-step parallel iteration method for large sparse horizontal linear complementarity problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2022.127609.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this work, a two-step modulus-based synchronous multisplitting iteration method is constructed for solving large sparse horizontal linear complementarity problems. Some convergence theorems of the proposed method are presented, which can generalize the convergence results of some existing methods. Numerical tests on parallel computers by OpenACC show that the proposed method is efficient.(c) 2022 Elsevier Inc. All rights reserved.
Keywords:
Horizontal linear complementarity problem
Two-step method
Modulus-based method
Synchronous multisplitting
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W