A new matrix splitting generalized iteration method for linear complementarity problems

Rashid Ali and Ali Akgul

Applied Mathematics and Computation, 2024, vol. 464, issue C

Abstract: The linear complementarity problems (LCPs) can be encountered in various scientific computing, management science, and operations research. In this study, we introduce and analyze a new generalized accelerated overrelaxation (NGAOR) method for solving LCPs, in which one special case reduces to a new generalized successive overrelaxation (NGSOR) method. Moreover, we prove the convergence of the proposed methods when the system matrix is an H-matrix (irreducible or strictly diagonally dominant matrix). Numerical results for several experiments are present to show the effectiveness and efficiency of the proposed methods.

Keywords: Linear complementarity problems; Iteration methods; Matrix decomposition; Convergence; H-matrix (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323005477
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:464:y:2024:i:c:s0096300323005477

DOI: 10.1016/j.amc.2023.128378

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().