Sharp estimates for the convergence rate of Orthomin(k) for a class of linear systems

IF 2.6 2区 数学 Q1 MATHEMATICS, APPLIED Journal of Computational and Applied Mathematics Pub Date : 2025-12-15 Epub Date: 2025-04-22 DOI:10.1016/j.cam.2025.116699
Andrei Drăgănescu , Florin Spinu
{"title":"Sharp estimates for the convergence rate of Orthomin(k) for a class of linear systems","authors":"Andrei Drăgănescu ,&nbsp;Florin Spinu","doi":"10.1016/j.cam.2025.116699","DOIUrl":null,"url":null,"abstract":"<div><div>In this work we show that the convergence rate of Orthomin(<span><math><mi>k</mi></math></span>) applied to systems of the form <span><math><mrow><mrow><mo>(</mo><mi>I</mi><mo>+</mo><mi>ρ</mi><mi>U</mi><mo>)</mo></mrow><mi>x</mi><mo>=</mo><mi>b</mi></mrow></math></span>, where <span><math><mi>U</mi></math></span> is a unitary operator and <span><math><mrow><mn>0</mn><mo>&lt;</mo><mi>ρ</mi><mo>&lt;</mo><mn>1</mn></mrow></math></span>, is less than or equal to <span><math><mi>ρ</mi></math></span>. Moreover, we give examples of operators <span><math><mi>U</mi></math></span> and <span><math><mrow><mi>ρ</mi><mo>&gt;</mo><mn>0</mn></mrow></math></span> for which the asymptotic convergence rate of Orthomin(<span><math><mi>k</mi></math></span>) is exactly <span><math><mi>ρ</mi></math></span>, thus showing that the estimate is sharp. While the systems under scrutiny may not be of great interest in themselves, their existence shows that, in general, Orthomin(<span><math><mi>k</mi></math></span>) does not converge faster than Orthomin(1). Furthermore, we give examples of systems for which Orthomin(<span><math><mi>k</mi></math></span>) has the same asymptotic convergence rate as Orthomin(2) for <span><math><mrow><mi>k</mi><mo>≥</mo><mn>2</mn></mrow></math></span>, but smaller than that of Orthomin(1). The latter systems are related to the numerical solution of certain partial differential equations.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116699"},"PeriodicalIF":2.6000,"publicationDate":"2025-12-15","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/S0377042725002134","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/4/22 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

In this work we show that the convergence rate of Orthomin(k) applied to systems of the form (I+ρU)x=b, where U is a unitary operator and 0<ρ<1, is less than or equal to ρ. Moreover, we give examples of operators U and ρ>0 for which the asymptotic convergence rate of Orthomin(k) is exactly ρ, thus showing that the estimate is sharp. While the systems under scrutiny may not be of great interest in themselves, their existence shows that, in general, Orthomin(k) does not converge faster than Orthomin(1). Furthermore, we give examples of systems for which Orthomin(k) has the same asymptotic convergence rate as Orthomin(2) for k2, but smaller than that of Orthomin(1). The latter systems are related to the numerical solution of certain partial differential equations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一类线性系统的Orthomin(k)收敛速率的尖锐估计
在这项工作中,我们证明了Orthomin(k)的收敛速率适用于形式为(I+ρU)x=b的系统,其中U是一个酉算子,0<ρ<;1小于或等于ρ。此外,我们还给出了算子U和ρ>;0的例子,其中Orthomin(k)的渐近收敛速率正好是ρ,从而表明估计是尖锐的。虽然被审查的系统本身可能不太感兴趣,但它们的存在表明,一般来说,Orthomin(k)并不比Orthomin(1)收敛得快。进一步,我们给出了在k≥2时,Orthomin(k)与Orthomin(2)具有相同的渐近收敛速率,但小于Orthomin(1)的系统的例子。后一类系统与某些偏微分方程的数值解有关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
New relaxation modulus-based iterative method for large and sparse implicit complementarity problem Enhancing efficiency of proximal gradient method with predicted and corrected step sizes Optimal alignment of Lorentz orientation and generalization to matrix Lie groups A novel twin extreme learning machine for regression problems The alternating Halpern-Mann iteration for families of maps
×
引用
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