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...

Full description

Saved in:
Bibliographic Details
Published in:Numerical algorithms Vol. 98; no. 4; pp. 1965 - 1983
Main Authors: Wang, Dan, Li, Jicheng
Format: Journal Article
Language:English
Published: New York Springer US 01.04.2025
Springer Nature B.V
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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