隐式互补问题的基于模数的修正两步矩阵分割迭代法

IF 2.6 3区 数学
Lu-Xin Wang, Yang Cao, Qin-Qin Shen, Chen-Can Zhou
{"title":"隐式互补问题的基于模数的修正两步矩阵分割迭代法","authors":"Lu-Xin Wang, Yang Cao, Qin-Qin Shen, Chen-Can Zhou","doi":"10.1007/s40314-024-02860-x","DOIUrl":null,"url":null,"abstract":"<p>To further accelerate the convergence rate of the recent proposed modified modulus-based matrix splitting (MMMS) iteration method for solving the implicit complementarity problems, by using the two-step iteration methodology, a class of modified two-step modulus-based matrix splitting (MTMMS) iteration methods are studied in this paper. The convergence analyses of the MTMMS iteration method are carefully studied when the system matrix is a positive definite matrix or an <span>\\(H_+\\)</span>-matrix. Finally, two numerical experiments are presented. Numerical results show that the proposed MTMMS iteration method performs much better than the existing MMMS iteration method.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"27 1","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Modified two-step modulus-based matrix splitting iteration methods for implicit complementarity problems\",\"authors\":\"Lu-Xin Wang, Yang Cao, Qin-Qin Shen, Chen-Can Zhou\",\"doi\":\"10.1007/s40314-024-02860-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>To further accelerate the convergence rate of the recent proposed modified modulus-based matrix splitting (MMMS) iteration method for solving the implicit complementarity problems, by using the two-step iteration methodology, a class of modified two-step modulus-based matrix splitting (MTMMS) iteration methods are studied in this paper. The convergence analyses of the MTMMS iteration method are carefully studied when the system matrix is a positive definite matrix or an <span>\\\\(H_+\\\\)</span>-matrix. Finally, two numerical experiments are presented. Numerical results show that the proposed MTMMS iteration method performs much better than the existing MMMS iteration method.</p>\",\"PeriodicalId\":51278,\"journal\":{\"name\":\"Computational and Applied Mathematics\",\"volume\":\"27 1\",\"pages\":\"\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2024-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s40314-024-02860-x\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s40314-024-02860-x","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了进一步加快最近提出的基于修正模数的矩阵分裂(MMMS)迭代法的收敛速度,利用两步迭代法求解隐式互补问题,本文研究了一类基于修正模数的两步矩阵分裂(MTMMS)迭代法。在系统矩阵为正定矩阵或(H_+\)矩阵时,仔细研究了 MTMMS 迭代方法的收敛性分析。最后,介绍了两个数值实验。数值结果表明,所提出的 MTMMS 迭代法的性能远远优于现有的 MMMS 迭代法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modified two-step modulus-based matrix splitting iteration methods for implicit complementarity problems

To further accelerate the convergence rate of the recent proposed modified modulus-based matrix splitting (MMMS) iteration method for solving the implicit complementarity problems, by using the two-step iteration methodology, a class of modified two-step modulus-based matrix splitting (MTMMS) iteration methods are studied in this paper. The convergence analyses of the MTMMS iteration method are carefully studied when the system matrix is a positive definite matrix or an \(H_+\)-matrix. Finally, two numerical experiments are presented. Numerical results show that the proposed MTMMS iteration method performs much better than the existing MMMS iteration method.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
11.50%
发文量
352
期刊介绍: Computational & Applied Mathematics began to be published in 1981. This journal was conceived as the main scientific publication of SBMAC (Brazilian Society of Computational and Applied Mathematics). The objective of the journal is the publication of original research in Applied and Computational Mathematics, with interfaces in Physics, Engineering, Chemistry, Biology, Operations Research, Statistics, Social Sciences and Economy. The journal has the usual quality standards of scientific international journals and we aim high level of contributions in terms of originality, depth and relevance.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信