A New Class of Splitting Methods That Preserve Ergodicity and Exponential Integrability for the Stochastic Langevin Equation

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED
Chuchu Chen, Tonghe Dang, Jialin Hong, Fengshan Zhang
{"title":"A New Class of Splitting Methods That Preserve Ergodicity and Exponential Integrability for the Stochastic Langevin Equation","authors":"Chuchu Chen, Tonghe Dang, Jialin Hong, Fengshan Zhang","doi":"10.1137/24m1687686","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 63, Issue 2, Page 1000-1024, April 2025. <br/> Abstract. In this paper, we propose a new class of splitting methods to solve the stochastic Langevin equation, which can simultaneously preserve the ergodicity and exponential integrability of the original equation. The central idea is to extract a stochastic subsystem that possesses the strict dissipation from the original equation, which is inspired by the inheritance of the Lyapunov structure for obtaining the ergodicity. We prove that the exponential moment of the numerical solution is bounded, thus validating the exponential integrability of the proposed methods. Further, we show that under moderate verifiable conditions, the methods have the first-order convergence in both strong and weak senses, and we present several concrete splitting schemes based on the methods. The splitting strategy of methods can be readily extended to construct conformal symplectic methods and high-order methods that preserve both the ergodicity and the exponential integrability, as demonstrated in numerical experiments. Our numerical experiments also show that the proposed methods have good performance in the long-time simulation.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"31 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2025-04-28","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/24m1687686","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

SIAM Journal on Numerical Analysis, Volume 63, Issue 2, Page 1000-1024, April 2025.
Abstract. In this paper, we propose a new class of splitting methods to solve the stochastic Langevin equation, which can simultaneously preserve the ergodicity and exponential integrability of the original equation. The central idea is to extract a stochastic subsystem that possesses the strict dissipation from the original equation, which is inspired by the inheritance of the Lyapunov structure for obtaining the ergodicity. We prove that the exponential moment of the numerical solution is bounded, thus validating the exponential integrability of the proposed methods. Further, we show that under moderate verifiable conditions, the methods have the first-order convergence in both strong and weak senses, and we present several concrete splitting schemes based on the methods. The splitting strategy of methods can be readily extended to construct conformal symplectic methods and high-order methods that preserve both the ergodicity and the exponential integrability, as demonstrated in numerical experiments. Our numerical experiments also show that the proposed methods have good performance in the long-time simulation.
一类新的保持随机朗格万方程遍历性和指数可积性的分裂方法
SIAM数值分析杂志,第63卷,第2期,1000-1024页,2025年4月。摘要。本文提出了一类新的解随机朗之万方程的分裂方法,该方法能同时保持原方程的遍历性和指数可积性。其中心思想是从原方程中提取一个具有严格耗散的随机子系统,其灵感来自于对李雅普诺夫结构的继承,以获得遍历性。我们证明了数值解的指数矩是有界的,从而验证了所提方法的指数可积性。进一步证明了在中等可验证条件下,这些方法在强、弱意义上都具有一阶收敛性,并在此基础上提出了几种具体的分裂方案。数值实验证明,方法的分裂策略可以很容易地扩展到构造保形辛方法和高阶方法,同时保持遍历性和指数可积性。数值实验也表明,该方法在长时间模拟中具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信