满足换元条件的 SDE 的高阶分裂方法

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED SIAM Journal on Numerical Analysis Pub Date : 2024-02-15 DOI:10.1137/23m155147x
James M. Foster, Gonçalo dos Reis, Calum Strange
{"title":"满足换元条件的 SDE 的高阶分裂方法","authors":"James M. Foster, Gonçalo dos Reis, Calum Strange","doi":"10.1137/23m155147x","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 62, Issue 1, Page 500-532, February 2024. <br/> Abstract. In this paper, we introduce a new simple approach to developing and establishing the convergence of splitting methods for a large class of stochastic differential equations (SDEs), including additive, diagonal, and scalar noise types. The central idea is to view the splitting method as a replacement of the driving signal of an SDE, namely, Brownian motion and time, with a piecewise linear path that yields a sequence of ODEs—which can be discretized to produce a numerical scheme. This new way of understanding splitting methods is inspired by, but does not use, rough path theory. We show that when the driving piecewise linear path matches certain iterated stochastic integrals of Brownian motion, then a high order splitting method can be obtained. We propose a general proof methodology for establishing the strong convergence of these approximations that is akin to the general framework of Milstein and Tretyakov. That is, once local error estimates are obtained for the splitting method, then a global rate of convergence follows. This approach can then be readily applied in future research on SDE splitting methods. By incorporating recently developed approximations for iterated integrals of Brownian motion into these piecewise linear paths, we propose several high order splitting methods for SDEs satisfying a certain commutativity condition. In our experiments, which include the Cox–Ingersoll–Ross model and additive noise SDEs (noisy anharmonic oscillator, stochastic FitzHugh–Nagumo model, underdamped Langevin dynamics), the new splitting methods exhibit convergence rates of [math] and outperform schemes previously proposed in the literature.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":null,"pages":null},"PeriodicalIF":2.8000,"publicationDate":"2024-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"High Order Splitting Methods for SDEs Satisfying a Commutativity Condition\",\"authors\":\"James M. Foster, Gonçalo dos Reis, Calum Strange\",\"doi\":\"10.1137/23m155147x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Numerical Analysis, Volume 62, Issue 1, Page 500-532, February 2024. <br/> Abstract. In this paper, we introduce a new simple approach to developing and establishing the convergence of splitting methods for a large class of stochastic differential equations (SDEs), including additive, diagonal, and scalar noise types. The central idea is to view the splitting method as a replacement of the driving signal of an SDE, namely, Brownian motion and time, with a piecewise linear path that yields a sequence of ODEs—which can be discretized to produce a numerical scheme. This new way of understanding splitting methods is inspired by, but does not use, rough path theory. We show that when the driving piecewise linear path matches certain iterated stochastic integrals of Brownian motion, then a high order splitting method can be obtained. We propose a general proof methodology for establishing the strong convergence of these approximations that is akin to the general framework of Milstein and Tretyakov. That is, once local error estimates are obtained for the splitting method, then a global rate of convergence follows. This approach can then be readily applied in future research on SDE splitting methods. By incorporating recently developed approximations for iterated integrals of Brownian motion into these piecewise linear paths, we propose several high order splitting methods for SDEs satisfying a certain commutativity condition. In our experiments, which include the Cox–Ingersoll–Ross model and additive noise SDEs (noisy anharmonic oscillator, stochastic FitzHugh–Nagumo model, underdamped Langevin dynamics), the new splitting methods exhibit convergence rates of [math] and outperform schemes previously proposed in the literature.\",\"PeriodicalId\":49527,\"journal\":{\"name\":\"SIAM Journal on Numerical Analysis\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2024-02-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Numerical Analysis\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m155147x\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Numerical Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m155147x","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

SIAM 数值分析期刊》第 62 卷第 1 期第 500-532 页,2024 年 2 月。 摘要本文介绍了一种新的简单方法,用于开发和建立一大类随机微分方程(SDE)的分裂方法的收敛性,包括加性、对角和标量噪声类型。其核心思想是将分裂方法看作是将 SDE 的驱动信号(即布朗运动和时间)替换为片断线性路径,从而产生一连串的 ODE--可将其离散化以产生数值方案。这种理解分裂方法的新方法受到粗糙路径理论的启发,但并不使用粗糙路径理论。我们证明,当驱动的片断线性路径与布朗运动的某些迭代随机积分相匹配时,就能得到高阶分裂方法。我们提出了建立这些近似方法强收敛性的一般证明方法,这与米尔斯坦和特列季亚科夫的一般框架相似。也就是说,一旦获得了分裂方法的局部误差估计值,就会得到全局收敛率。这种方法可随时应用于未来的 SDE 分裂方法研究。通过将最近开发的布朗运动迭代积分近似值纳入这些片断线性路径,我们提出了几种满足特定交换性条件的 SDE 高阶分裂方法。我们的实验包括 Cox-Ingersoll-Ross 模型和加性噪声 SDE(噪声非谐振荡器、随机 FitzHugh-Nagumo 模型、欠阻尼 Langevin 动力学),在这些实验中,新的分裂方法表现出 [math] 的收敛率,优于之前文献中提出的方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
High Order Splitting Methods for SDEs Satisfying a Commutativity Condition
SIAM Journal on Numerical Analysis, Volume 62, Issue 1, Page 500-532, February 2024.
Abstract. In this paper, we introduce a new simple approach to developing and establishing the convergence of splitting methods for a large class of stochastic differential equations (SDEs), including additive, diagonal, and scalar noise types. The central idea is to view the splitting method as a replacement of the driving signal of an SDE, namely, Brownian motion and time, with a piecewise linear path that yields a sequence of ODEs—which can be discretized to produce a numerical scheme. This new way of understanding splitting methods is inspired by, but does not use, rough path theory. We show that when the driving piecewise linear path matches certain iterated stochastic integrals of Brownian motion, then a high order splitting method can be obtained. We propose a general proof methodology for establishing the strong convergence of these approximations that is akin to the general framework of Milstein and Tretyakov. That is, once local error estimates are obtained for the splitting method, then a global rate of convergence follows. This approach can then be readily applied in future research on SDE splitting methods. By incorporating recently developed approximations for iterated integrals of Brownian motion into these piecewise linear paths, we propose several high order splitting methods for SDEs satisfying a certain commutativity condition. In our experiments, which include the Cox–Ingersoll–Ross model and additive noise SDEs (noisy anharmonic oscillator, stochastic FitzHugh–Nagumo model, underdamped Langevin dynamics), the new splitting methods exhibit convergence rates of [math] and outperform schemes previously proposed in the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.80
自引率
6.90%
发文量
110
审稿时长
4-8 weeks
期刊介绍: SIAM Journal on Numerical Analysis (SINUM) contains research articles on the development and analysis of numerical methods. Topics include the rigorous study of convergence of algorithms, their accuracy, their stability, and their computational complexity. Also included are results in mathematical analysis that contribute to algorithm analysis, and computational results that demonstrate algorithm behavior and applicability.
期刊最新文献
How Sharp Are Error Bounds? –Lower Bounds on Quadrature Worst-Case Errors for Analytic Functions– Fractal Multiquadric Interpolation Functions High Order Biorthogonal Functions in [math](curl) Convergence Analysis of the Parareal Algorithm with Nonuniform Fine Time Grid Numerical Reconstruction of Diffusion and Potential Coefficients from Two Observations: Decoupled Recovery and Error Estimates
×
引用
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