低秩并行积分器:一个低秩并行积分器。

IF 1.6 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING BIT Numerical Mathematics Pub Date : 2023-01-01 DOI:10.1007/s10543-023-00953-3
Benjamin Carrel, Martin J Gander, Bart Vandereycken
{"title":"低秩并行积分器:一个低秩并行积分器。","authors":"Benjamin Carrel,&nbsp;Martin J Gander,&nbsp;Bart Vandereycken","doi":"10.1007/s10543-023-00953-3","DOIUrl":null,"url":null,"abstract":"<p><p>In this work, the Parareal algorithm is applied to evolution problems that admit good low-rank approximations and for which the dynamical low-rank approximation (DLRA) can be used as time stepper. Many discrete integrators for DLRA have recently been proposed, based on splitting the projected vector field or by applying projected Runge-Kutta methods. The cost and accuracy of these methods are mostly governed by the rank chosen for the approximation. These properties are used in a new method, called low-rank Parareal, in order to obtain a time-parallel DLRA solver for evolution problems. The algorithm is analyzed on affine linear problems and the results are illustrated numerically.</p>","PeriodicalId":55351,"journal":{"name":"BIT Numerical Mathematics","volume":null,"pages":null},"PeriodicalIF":1.6000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9899195/pdf/","citationCount":"7","resultStr":"{\"title\":\"Low-rank Parareal: a low-rank parallel-in-time integrator.\",\"authors\":\"Benjamin Carrel,&nbsp;Martin J Gander,&nbsp;Bart Vandereycken\",\"doi\":\"10.1007/s10543-023-00953-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>In this work, the Parareal algorithm is applied to evolution problems that admit good low-rank approximations and for which the dynamical low-rank approximation (DLRA) can be used as time stepper. Many discrete integrators for DLRA have recently been proposed, based on splitting the projected vector field or by applying projected Runge-Kutta methods. The cost and accuracy of these methods are mostly governed by the rank chosen for the approximation. These properties are used in a new method, called low-rank Parareal, in order to obtain a time-parallel DLRA solver for evolution problems. The algorithm is analyzed on affine linear problems and the results are illustrated numerically.</p>\",\"PeriodicalId\":55351,\"journal\":{\"name\":\"BIT Numerical Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9899195/pdf/\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"BIT Numerical Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10543-023-00953-3\",\"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-023-00953-3","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 7

摘要

在这项工作中,将拟面算法应用于允许良好低秩近似的进化问题,并且动态低秩近似(DLRA)可以作为时间步进器。最近提出了许多基于分割投影向量场或应用投影龙格-库塔方法的DLRA离散积分器。这些方法的成本和精度主要取决于为逼近所选择的秩。这些性质被用于一种新的方法,称为低秩Parareal,以获得进化问题的时间并行DLRA求解器。对该算法在仿射线性问题上进行了分析,并对结果进行了数值说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Low-rank Parareal: a low-rank parallel-in-time integrator.

In this work, the Parareal algorithm is applied to evolution problems that admit good low-rank approximations and for which the dynamical low-rank approximation (DLRA) can be used as time stepper. Many discrete integrators for DLRA have recently been proposed, based on splitting the projected vector field or by applying projected Runge-Kutta methods. The cost and accuracy of these methods are mostly governed by the rank chosen for the approximation. These properties are used in a new method, called low-rank Parareal, in order to obtain a time-parallel DLRA solver for evolution problems. The algorithm is analyzed on affine linear problems and the results are illustrated numerically.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
Parallel line identification for line-implicit-solvers Stability and convergence of the variable-step time filtered backward Euler scheme for parabolic equations Multilevel Monte Carlo using approximate distributions of the CIR process Asymptotically exact a posteriori error estimates for the BDM finite element approximation of mixed Laplace eigenvalue problems Construction of Rosenbrock–Wanner method Rodas5P and numerical benchmarks within the Julia Differential Equations package
×
引用
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