{"title":"On the preconditioned GAOR method for a linear complementarity problem with an <i>M</i>-matrix.","authors":"Shu-Xin Miao, Dan Zhang","doi":"10.1186/s13660-018-1789-5","DOIUrl":null,"url":null,"abstract":"<p><p>Recently, based on the Hadjidimos preconditioner, a preconditioned GAOR method was proposed for solving the linear complementarity problem (Liu and Li in East Asian J. Appl. Math. 2:94-107, 2012). In this paper, we propose a new preconditioned GAOR method for solving the linear complementarity problem with an <i>M</i>-matrix. The convergence of the proposed method is analyzed, and the comparison results are obtained to show it accelerates the convergence of the original GAOR method and the preconditioned GAOR method in (Liu and Li in East Asian J. Appl. Math. 2:94-107, 2012). Numerical examples verify the theoretical analysis.</p>","PeriodicalId":49163,"journal":{"name":"Journal of Inequalities and Applications","volume":"2018 1","pages":"195"},"PeriodicalIF":1.6000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13660-018-1789-5","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Inequalities and Applications","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1186/s13660-018-1789-5","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2018/7/27 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 4
Abstract
Recently, based on the Hadjidimos preconditioner, a preconditioned GAOR method was proposed for solving the linear complementarity problem (Liu and Li in East Asian J. Appl. Math. 2:94-107, 2012). In this paper, we propose a new preconditioned GAOR method for solving the linear complementarity problem with an M-matrix. The convergence of the proposed method is analyzed, and the comparison results are obtained to show it accelerates the convergence of the original GAOR method and the preconditioned GAOR method in (Liu and Li in East Asian J. Appl. Math. 2:94-107, 2012). Numerical examples verify the theoretical analysis.
最近,基于Hadjidimos预条件,提出了一种求解线性互补问题的预条件GAOR方法(Liu and Li in East Asian J. Appl.)。数学。2:94-107,2012)。本文提出了一种新的求解m矩阵线性互补问题的预条件GAOR方法。对所提方法的收敛性进行了分析,对比结果表明所提方法加快了原GAOR方法和预置GAOR方法(Liu and Li in East Asian J. Appl.)的收敛速度。数学。2:94-107,2012)。数值算例验证了理论分析的正确性。
期刊介绍:
The aim of this journal is to provide a multi-disciplinary forum of discussion in mathematics and its applications in which the essentiality of inequalities is highlighted. This Journal accepts high quality articles containing original research results and survey articles of exceptional merit. Subject matters should be strongly related to inequalities, such as, but not restricted to, the following: inequalities in analysis, inequalities in approximation theory, inequalities in combinatorics, inequalities in economics, inequalities in geometry, inequalities in mechanics, inequalities in optimization, inequalities in stochastic analysis and applications.