Work

A two-level domain decomposition algorithm for linear complementarity problem

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.
Language: English
Open Access status: gold
Estimated APC paid: $2,190
OpenAlex ID: W2136024990
FWCI: 0.307
Cites: 14
Cited by: 1
Related to: 10