基于中点规则的稳健二阶低阶 BUG 积分器

IF 1.6 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING BIT Numerical Mathematics Pub Date : 2024-07-13 DOI:10.1007/s10543-024-01032-x
Gianluca Ceruti, Lukas Einkemmer, Jonas Kusch, Christian Lubich
{"title":"基于中点规则的稳健二阶低阶 BUG 积分器","authors":"Gianluca Ceruti, Lukas Einkemmer, Jonas Kusch, Christian Lubich","doi":"10.1007/s10543-024-01032-x","DOIUrl":null,"url":null,"abstract":"<p>Dynamical low-rank approximation has become a valuable tool to perform an on-the-fly model order reduction for prohibitively large matrix differential equations. A core ingredient is the construction of integrators that are robust to the presence of small singular values and the resulting large time derivatives of the orthogonal factors in the low-rank matrix representation. Recently, the robust basis-update &amp; Galerkin (BUG) class of integrators has been introduced. These methods require no steps that evolve the solution backward in time, often have favourable structure-preserving properties, and allow for parallel time-updates of the low-rank factors. The BUG framework is flexible enough to allow for adaptations to these and further requirements. However, the BUG methods presented so far have only first-order robust error bounds. This work proposes a second-order BUG integrator for dynamical low-rank approximation based on the midpoint quadrature rule. The integrator first performs a half-step with a first-order BUG integrator, followed by a Galerkin update with a suitably augmented basis. We prove a robust second-order error bound which in addition shows an improved dependence on the normal component of the vector field. These rigorous results are illustrated and complemented by a number of numerical experiments.</p>","PeriodicalId":55351,"journal":{"name":"BIT Numerical Mathematics","volume":null,"pages":null},"PeriodicalIF":1.6000,"publicationDate":"2024-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A robust second-order low-rank BUG integrator based on the midpoint rule\",\"authors\":\"Gianluca Ceruti, Lukas Einkemmer, Jonas Kusch, Christian Lubich\",\"doi\":\"10.1007/s10543-024-01032-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Dynamical low-rank approximation has become a valuable tool to perform an on-the-fly model order reduction for prohibitively large matrix differential equations. A core ingredient is the construction of integrators that are robust to the presence of small singular values and the resulting large time derivatives of the orthogonal factors in the low-rank matrix representation. Recently, the robust basis-update &amp; Galerkin (BUG) class of integrators has been introduced. These methods require no steps that evolve the solution backward in time, often have favourable structure-preserving properties, and allow for parallel time-updates of the low-rank factors. The BUG framework is flexible enough to allow for adaptations to these and further requirements. However, the BUG methods presented so far have only first-order robust error bounds. This work proposes a second-order BUG integrator for dynamical low-rank approximation based on the midpoint quadrature rule. The integrator first performs a half-step with a first-order BUG integrator, followed by a Galerkin update with a suitably augmented basis. We prove a robust second-order error bound which in addition shows an improved dependence on the normal component of the vector field. These rigorous results are illustrated and complemented by a number of numerical experiments.</p>\",\"PeriodicalId\":55351,\"journal\":{\"name\":\"BIT Numerical Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2024-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"BIT Numerical Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10543-024-01032-x\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"BIT Numerical Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10543-024-01032-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

摘要

动态低阶近似已成为一种宝贵的工具,可用于对令人望而却步的大型矩阵微分方程进行即时模型阶次缩减。其核心要素是构建对小奇异值的存在以及由此产生的低阶矩阵表示中正交因子的大时间导数具有鲁棒性的积分器。最近,人们引入了鲁棒基更新 & Galerkin (BUG) 积分器。这些方法不需要在时间上向后演化解的步骤,通常具有有利的结构保持特性,并允许对低秩因子进行并行的时间更新。BUG 框架具有足够的灵活性,可以适应这些要求和其他要求。然而,迄今为止提出的 BUG 方法只有一阶稳健误差边界。本研究提出了一种基于中点正交规则的二阶 BUG 积分器,用于动态低阶近似。该积分器首先使用一阶 BUG 积分器执行半步,然后使用适当增强的基础进行 Galerkin 更新。我们证明了稳健的二阶误差约束,此外还显示了对矢量场法向分量的改进依赖性。这些严谨的结果通过一些数值实验进行了说明和补充。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A robust second-order low-rank BUG integrator based on the midpoint rule

Dynamical low-rank approximation has become a valuable tool to perform an on-the-fly model order reduction for prohibitively large matrix differential equations. A core ingredient is the construction of integrators that are robust to the presence of small singular values and the resulting large time derivatives of the orthogonal factors in the low-rank matrix representation. Recently, the robust basis-update & Galerkin (BUG) class of integrators has been introduced. These methods require no steps that evolve the solution backward in time, often have favourable structure-preserving properties, and allow for parallel time-updates of the low-rank factors. The BUG framework is flexible enough to allow for adaptations to these and further requirements. However, the BUG methods presented so far have only first-order robust error bounds. This work proposes a second-order BUG integrator for dynamical low-rank approximation based on the midpoint quadrature rule. The integrator first performs a half-step with a first-order BUG integrator, followed by a Galerkin update with a suitably augmented basis. We prove a robust second-order error bound which in addition shows an improved dependence on the normal component of the vector field. These rigorous results are illustrated and complemented by a number of numerical experiments.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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 Substructuring the Hiptmair-Xu preconditioner for positive definite $$\textbf{H}(\varvec{curl},\Omega )$$ problems A robust second-order low-rank BUG integrator based on the midpoint rule
×
引用
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