m -矩阵线性互补问题的预条件传感器方法

Pub Date : 2019-01-01 DOI:10.4134/CKMS.C170423

Dan Zhang

{"title":"m -矩阵线性互补问题的预条件传感器方法","authors":"Dan Zhang","doi":"10.4134/CKMS.C170423","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the preconditioned iterative methods for solving linear complementarity problem associated with an M matrix. Based on the generalized Gunawardena’s preconditioner, two preconditioned SSOR methods for solving the linear complementarity problem are proposed. The convergence of the proposed methods are analyzed, and the comparison results are derived. The comparison results showed that preconditioned SSOR methods accelerate the convergent rate of the original SSOR method. Numerical examples are used to illustrate the theoretical results.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PRECONDITIONED SSOR METHODS FOR THE LINEAR COMPLEMENTARITY PROBLEM WITH M-MATRIX\",\"authors\":\"Dan Zhang\",\"doi\":\"10.4134/CKMS.C170423\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the preconditioned iterative methods for solving linear complementarity problem associated with an M matrix. Based on the generalized Gunawardena’s preconditioner, two preconditioned SSOR methods for solving the linear complementarity problem are proposed. The convergence of the proposed methods are analyzed, and the comparison results are derived. The comparison results showed that preconditioned SSOR methods accelerate the convergent rate of the original SSOR method. Numerical examples are used to illustrate the theoretical results.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4134/CKMS.C170423\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4134/CKMS.C170423","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了求解M矩阵线性互补问题的预条件迭代方法。基于广义Gunawardena预条件，提出了求解线性互补问题的两种预条件SSOR方法。分析了所提方法的收敛性，并给出了比较结果。对比结果表明，预置的SSOR方法加快了原SSOR方法的收敛速度。用数值算例对理论结果进行了说明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

PRECONDITIONED SSOR METHODS FOR THE LINEAR COMPLEMENTARITY PROBLEM WITH M-MATRIX

In this paper, we consider the preconditioned iterative methods for solving linear complementarity problem associated with an M matrix. Based on the generalized Gunawardena’s preconditioner, two preconditioned SSOR methods for solving the linear complementarity problem are proposed. The convergence of the proposed methods are analyzed, and the comparison results are derived. The comparison results showed that preconditioned SSOR methods accelerate the convergent rate of the original SSOR method. Numerical examples are used to illustrate the theoretical results.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助