A sign-based linear method for horizontal linear complementarity problems

For the horizontal linear complementarity problem, we establish a linear method based on the sign patterns of the solution of the equivalent modulus equation under the assumption of strict complementarity. The new method is equivalent to solving two linear equations, avoiding parameters selection, s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Numerical algorithms Ročník 91; číslo 3; s. 1165 - 1181
Hlavní autori: Shao, Xin-Hui, Wang, Zhe, Shen, Hai-Long
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.11.2022
Springer Nature B.V
Predmet:
Algebra
Algorithms
Computer Science
Equivalence
Iterative methods
Linear equations
Methods
Numeric Computing
Numerical Analysis
Original Paper
Sparse matrices
Splitting
Theorems
Theory of Computation
Modulus equation
Sign analysis
Horizontal complementarity problem
ISSN:1017-1398, 1572-9265
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:For the horizontal linear complementarity problem, we establish a linear method based on the sign patterns of the solution of the equivalent modulus equation under the assumption of strict complementarity. The new method is equivalent to solving two linear equations, avoiding parameters selection, so it is more convenient and practical. Numerical examples show that the new method is superior to the previous modulus-based matrix splitting iterative method, two-step modulus-based matrix splitting iterative method and modulus-based nonsmooth Newton’s method in computing efficiency. The new method can be used as a solution scheme to the horizontal complementarity problem of large sparse matrices.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
DOI:10.1007/s11075-022-01296-w