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

Pub Date : 2019-01-01 DOI:10.4134/CKMS.C170423
Dan Zhang
{"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}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
m -矩阵线性互补问题的预条件传感器方法
本文研究了求解M矩阵线性互补问题的预条件迭代方法。基于广义Gunawardena预条件,提出了求解线性互补问题的两种预条件SSOR方法。分析了所提方法的收敛性,并给出了比较结果。对比结果表明,预置的SSOR方法加快了原SSOR方法的收敛速度。用数值算例对理论结果进行了说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1