A new matrix splitting generalized iteration method for linear complementarity problems

Basit Öğe Kaydı
dc.contributor.authorAli, Rashid
dc.contributor.authorAkgul, Ali
dc.date.accessioned2024-12-24T19:25:19Z
dc.date.available2024-12-24T19:25:19Z
dc.date.issued2024
dc.departmentSiirt Üniversitesi
dc.description.abstractThe 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. AMS classification: 65F10, 90C33
dc.identifier.doi10.1016/j.amc.2023.128378
dc.identifier.issn0096-3003
dc.identifier.issn1873-5649
dc.identifier.scopus2-s2.0-85173629120
dc.identifier.scopusqualityQ1
dc.identifier.urihttps://doi.org/10.1016/j.amc.2023.128378
dc.identifier.urihttps://hdl.handle.net/20.500.12604/6349
dc.identifier.volume464
dc.identifier.wosWOS:001091601500001
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier Science Inc
dc.relation.ispartofApplied Mathematics and Computation
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_20241222
dc.subjectLinear complementarity problems
dc.subjectIteration methods
dc.subjectMatrix decomposition
dc.subjectConvergence
dc.subjectH-matrix
dc.titleA new matrix splitting generalized iteration method for linear complementarity problems
dc.typeArticle

Dosyalar

Koleksiyon

WOS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu