General double-relaxation two-sweep modulus-based matrix splitting iteration methods for horizontal linear complementarity problem

For solving horizontal linear complementarity problem (HLCP), we propose a general double-relaxation two-sweep modulus-based matrix splitting iteration method and a double-relaxation two-sweep modulus-based matrix splitting iteration method which contain a series of methods, by using different split...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Numerical algorithms Ročník 98; číslo 4; s. 1965 - 1983
Hlavní autoři: Wang, Dan, Li, Jicheng
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2025
Springer Nature B.V
Témata:
Algebra
Algorithms
Computer Science
Convergence
Iterative methods
Methods
Numeric Computing
Numerical Analysis
Original Paper
Splitting
Theory of Computation
Relaxation method
Modulus-based method
Horizontal linear complementarity problem
matrix
Two-sweep strategy
ISSN:1017-1398, 1572-9265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:For solving horizontal linear complementarity problem (HLCP), we propose a general double-relaxation two-sweep modulus-based matrix splitting iteration method and a double-relaxation two-sweep modulus-based matrix splitting iteration method which contain a series of methods, by using different splittings. When the system matrices are H + -matrices, we analyze convergence theory of these methods. Numerical examples in this paper illustrate that these methods are more efficient than modulus-based matrix splitting iteration method and general modulus-based matrix splitting iteration method.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
DOI:10.1007/s11075-024-01860-6