A tensor Alternating Anderson–Richardson method for solving multilinear systems with M-tensors

IF 2.6 2区 数学 Q1 MATHEMATICS, APPLIED Journal of Computational and Applied Mathematics Pub Date : 2025-06-01 Epub Date: 2024-12-07 DOI:10.1016/j.cam.2024.116419
Jing Niu , Lei Du , Tomohiro Sogabe , Shao-Liang Zhang
{"title":"A tensor Alternating Anderson–Richardson method for solving multilinear systems with M-tensors","authors":"Jing Niu ,&nbsp;Lei Du ,&nbsp;Tomohiro Sogabe ,&nbsp;Shao-Liang Zhang","doi":"10.1016/j.cam.2024.116419","DOIUrl":null,"url":null,"abstract":"<div><div>It is well-known that a multilinear system with a nonsingular <span><math><mi>M</mi></math></span>-tensor and a positive right-hand side has a unique positive solution. Tensor splitting methods generalizing the classical iterative methods for linear systems have been proposed for finding the unique positive solution. The Alternating Anderson–Richardson (AAR) method is an effective method to accelerate the classical iterative methods. In this study, we apply the idea of AAR for finding the unique positive solution quickly. We first present a tensor Richardson method based on tensor regular splittings, then apply Anderson acceleration to the tensor Richardson method and derive a tensor Anderson–Richardson method, finally, we periodically employ the tensor Anderson–Richardson method within the tensor Richardson method and propose a tensor AAR method. Numerical experiments show that the proposed method is effective in accelerating tensor splitting methods.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"461 ","pages":"Article 116419"},"PeriodicalIF":2.6000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377042724006678","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/12/7 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

It is well-known that a multilinear system with a nonsingular M-tensor and a positive right-hand side has a unique positive solution. Tensor splitting methods generalizing the classical iterative methods for linear systems have been proposed for finding the unique positive solution. The Alternating Anderson–Richardson (AAR) method is an effective method to accelerate the classical iterative methods. In this study, we apply the idea of AAR for finding the unique positive solution quickly. We first present a tensor Richardson method based on tensor regular splittings, then apply Anderson acceleration to the tensor Richardson method and derive a tensor Anderson–Richardson method, finally, we periodically employ the tensor Anderson–Richardson method within the tensor Richardson method and propose a tensor AAR method. Numerical experiments show that the proposed method is effective in accelerating tensor splitting methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解具有m张量的多线性系统的张量交替Anderson-Richardson方法
众所周知,具有非奇异m张量且右侧为正的多线性系统具有唯一正解。提出了张量分裂法,推广了线性系统的经典迭代方法,用于求唯一正解。交替安德森-理查德森法(AAR)是一种有效的加速经典迭代方法的方法。在本研究中,我们运用AAR的思想来快速寻找唯一正解。首先提出了一种基于张量正则分裂的张量Richardson方法,然后将Anderson加速度应用到张量Richardson方法中,推导出一个张量Anderson - Richardson方法,最后在张量Richardson方法中周期性地使用张量Anderson - Richardson方法,提出了一个张量AAR方法。数值实验表明,该方法在加速张量分裂方法中是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
5.40
自引率
4.20%
发文量
437
审稿时长
3.0 months
期刊介绍: The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest. The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.
期刊最新文献
A PDE-based image restoration method: Mathematical analysis and implementation Robust learning of minimum error entropy under heavy-tailed noise Dual-valued functions of dual matrices with applications in causal emergence On non-standard Isaac’s wall pursuit game using dynamic programming method A mixed Nitsche extended finite element method for Biot’s consolidation interface problems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1