On the Forsythe conjecture

IF 1.6 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING BIT Numerical Mathematics Pub Date : 2023-09-27 DOI:10.1007/s10543-023-00991-x
Vance Faber, Jörg Liesen, Petr Tichý
{"title":"On the Forsythe conjecture","authors":"Vance Faber, Jörg Liesen, Petr Tichý","doi":"10.1007/s10543-023-00991-x","DOIUrl":null,"url":null,"abstract":"Abstract Forsythe formulated a conjecture about the asymptotic behavior of the restarted conjugate gradient method in 1968. We translate several of his results into modern terms, and pose an analogous version of the conjecture (originally formulated only for symmetric positive definite matrices) for symmetric and nonsymmetric matrices. Our version of the conjecture uses a two-sided or cross iteration with the given matrix and its transpose, which is based on the projection process used in the Arnoldi (or for symmetric matrices the Lanczos) algorithm. We prove several new results about the limiting behavior of this iteration, but the conjecture still remains largely open. We hope that our paper motivates further research that eventually leads to a proof of the conjecture.","PeriodicalId":55351,"journal":{"name":"BIT Numerical Mathematics","volume":"43 1","pages":"0"},"PeriodicalIF":1.6000,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"BIT Numerical Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10543-023-00991-x","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract Forsythe formulated a conjecture about the asymptotic behavior of the restarted conjugate gradient method in 1968. We translate several of his results into modern terms, and pose an analogous version of the conjecture (originally formulated only for symmetric positive definite matrices) for symmetric and nonsymmetric matrices. Our version of the conjecture uses a two-sided or cross iteration with the given matrix and its transpose, which is based on the projection process used in the Arnoldi (or for symmetric matrices the Lanczos) algorithm. We prove several new results about the limiting behavior of this iteration, but the conjecture still remains largely open. We hope that our paper motivates further research that eventually leads to a proof of the conjecture.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于福赛斯猜想
Forsythe(1968)提出了关于重新启动共轭梯度法渐近性的一个猜想。我们把他的一些结果翻译成现代术语,并提出了一个类似的版本的猜想(最初只表述对称正定矩阵)对称和非对称矩阵。我们的猜想版本使用给定矩阵及其转置的双边或交叉迭代,这是基于在Arnoldi(或对称矩阵Lanczos)算法中使用的投影过程。我们证明了几个关于这个迭代的极限行为的新结果,但是这个猜想在很大程度上仍然是开放的。我们希望我们的论文能激发进一步的研究,最终证明这一猜想。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
BIT Numerical Mathematics
BIT Numerical Mathematics 数学-计算机:软件工程
CiteScore
2.90
自引率
0.00%
发文量
38
审稿时长
6 months
期刊介绍: The journal BIT has been published since 1961. BIT publishes original research papers in the rapidly developing field of numerical analysis. The essential areas covered by BIT are development and analysis of numerical methods as well as the design and use of algorithms for scientific computing. Topics emphasized by BIT include numerical methods in approximation, linear algebra, and ordinary and partial differential equations.
期刊最新文献
Pressure-robust approximation of the incompressible Navier–Stokes equations in a rotating frame of reference Lower error bounds and optimality of approximation for jump-diffusion SDEs with discontinuous drift Super-localized orthogonal decomposition for convection-dominated diffusion problems A robust second-order low-rank BUG integrator based on the midpoint rule Weak convergence of tamed exponential integrators for stochastic differential equations
×
引用
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