Year: 2013
Type: article
Abstract: In this paper, a two-level domain decomposition algorithm for linear complementarity problem (LCP) is introduced. Inner and outer approximation sequences to the solution of LCP are generated by the proposed algorithm. The algorithm is proved to be convergent and can reach the solution of the problem within finite steps. Some simple numerical results are presented to show the effectiveness of the proposed algorithm.
Authors: Shuilian Xie, Zhe Sun, Yuping Zeng
Institutions: Jiaying University, Jiangxi Normal University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,190
OpenAlex ID: W2136024990
