{"title":"指数网格上的卡普托-哈达玛德分数随机微分方程的欧拉-丸山方法及其快速近似值","authors":"Min Li, Shangjiang Guo, Peng Hu, Haiyan Song","doi":"10.1007/s11075-024-01889-7","DOIUrl":null,"url":null,"abstract":"<p>This paper studies the numerical solutions of Caputo–Hadamard fractional stochastic differential equations. Firstly, we construct an Euler–Maruyama (EM) scheme for the equations, and the corresponding convergence rate is investigated. Secondly, we propose a fast EM scheme based on the sum-of-exponentials approximation to decrease the computational cost of the EM scheme. More concretely, the fast EM scheme reduces the computational cost from <span>\\(O(N^2)\\)</span> to <span>\\(O(N\\log ^2 N)\\)</span> and the storage from <i>O</i>(<i>N</i>) to <span>\\(O(\\log ^2 N)\\)</span> when the final time <span>\\(T\\approx e\\)</span>, where <i>N</i> is the total number of time steps. Moreover, considering the statistical errors from Monte Carlo path approximations, multilevel Monte Carlo (MLMC) techniques are utilized to reduce computational complexity. In particular, for a prescribed accuracy <span>\\(\\varepsilon >0\\)</span>, the EM scheme and the fast EM scheme, integrated with the MLMC technique, respectively reduce the standard EM scheme’s computational complexity from <span>\\(O(\\varepsilon ^{-2-\\frac{2}{\\widetilde{\\alpha }}})\\)</span> to <span>\\(O(\\varepsilon ^{-\\frac{2}{\\widetilde{\\alpha }}})\\)</span> and the fast EM scheme’s complexity to <span>\\(O(\\varepsilon ^{-\\frac{1}{\\widetilde{\\alpha }}}\\left|\\log \\varepsilon \\right|^3)\\)</span>, where <span>\\(0<\\widetilde{\\alpha }=\\alpha -\\frac{1}{2}<\\frac{1}{2}\\)</span>. Finally, numerical examples are included to verify the theoretical results and demonstrate the performance of our methods.</p>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Euler–Maruyama method for Caputo–Hadamard fractional stochastic differential equations on exponential meshes and its fast approximation\",\"authors\":\"Min Li, Shangjiang Guo, Peng Hu, Haiyan Song\",\"doi\":\"10.1007/s11075-024-01889-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>This paper studies the numerical solutions of Caputo–Hadamard fractional stochastic differential equations. Firstly, we construct an Euler–Maruyama (EM) scheme for the equations, and the corresponding convergence rate is investigated. Secondly, we propose a fast EM scheme based on the sum-of-exponentials approximation to decrease the computational cost of the EM scheme. More concretely, the fast EM scheme reduces the computational cost from <span>\\\\(O(N^2)\\\\)</span> to <span>\\\\(O(N\\\\log ^2 N)\\\\)</span> and the storage from <i>O</i>(<i>N</i>) to <span>\\\\(O(\\\\log ^2 N)\\\\)</span> when the final time <span>\\\\(T\\\\approx e\\\\)</span>, where <i>N</i> is the total number of time steps. Moreover, considering the statistical errors from Monte Carlo path approximations, multilevel Monte Carlo (MLMC) techniques are utilized to reduce computational complexity. In particular, for a prescribed accuracy <span>\\\\(\\\\varepsilon >0\\\\)</span>, the EM scheme and the fast EM scheme, integrated with the MLMC technique, respectively reduce the standard EM scheme’s computational complexity from <span>\\\\(O(\\\\varepsilon ^{-2-\\\\frac{2}{\\\\widetilde{\\\\alpha }}})\\\\)</span> to <span>\\\\(O(\\\\varepsilon ^{-\\\\frac{2}{\\\\widetilde{\\\\alpha }}})\\\\)</span> and the fast EM scheme’s complexity to <span>\\\\(O(\\\\varepsilon ^{-\\\\frac{1}{\\\\widetilde{\\\\alpha }}}\\\\left|\\\\log \\\\varepsilon \\\\right|^3)\\\\)</span>, where <span>\\\\(0<\\\\widetilde{\\\\alpha }=\\\\alpha -\\\\frac{1}{2}<\\\\frac{1}{2}\\\\)</span>. Finally, numerical examples are included to verify the theoretical results and demonstrate the performance of our methods.</p>\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2024-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11075-024-01889-7\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11075-024-01889-7","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
摘要
本文研究 Caputo-Hadamard 分数随机微分方程的数值解法。首先,我们构建了方程的 Euler-Maruyama (EM) 方案,并研究了相应的收敛速率。其次,我们提出了一种基于指数和近似的快速 EM 方案,以降低 EM 方案的计算成本。更具体地说,当最终时间为(T/approx e/),其中N为总时间步数时,快速EM方案将计算成本从(O(N^2)\)降低到(O(N/log ^2 N)\),存储成本从(O(N))降低到(O(\log ^2 N)\)。此外,考虑到蒙特卡罗路径近似的统计误差,多级蒙特卡罗(MLMC)技术被用来降低计算复杂度。特别是,对于规定精度 \(\varepsilon >;0),EM方案和快速EM方案与MLMC技术相结合、分别将标准EM方案的计算复杂度从(O(\varepsilon ^{-2-\frac{2}{widetilde{\alpha }})降低到(O(\varepsilon ^{-\frac{2}{widetilde{\alpha }})。\而快速 EM 方案的复杂度为 O(^{-\frac{1}{widetilde\alpha }}left|\log \varepsilon \right|^3)\)、其中 \(0<;\widetilde{alpha }=\alpha -\frac{1}{2}<\frac{1}{2}\).最后,我们还列举了一些数值示例来验证理论结果,并展示我们的方法的性能。
An Euler–Maruyama method for Caputo–Hadamard fractional stochastic differential equations on exponential meshes and its fast approximation
This paper studies the numerical solutions of Caputo–Hadamard fractional stochastic differential equations. Firstly, we construct an Euler–Maruyama (EM) scheme for the equations, and the corresponding convergence rate is investigated. Secondly, we propose a fast EM scheme based on the sum-of-exponentials approximation to decrease the computational cost of the EM scheme. More concretely, the fast EM scheme reduces the computational cost from \(O(N^2)\) to \(O(N\log ^2 N)\) and the storage from O(N) to \(O(\log ^2 N)\) when the final time \(T\approx e\), where N is the total number of time steps. Moreover, considering the statistical errors from Monte Carlo path approximations, multilevel Monte Carlo (MLMC) techniques are utilized to reduce computational complexity. In particular, for a prescribed accuracy \(\varepsilon >0\), the EM scheme and the fast EM scheme, integrated with the MLMC technique, respectively reduce the standard EM scheme’s computational complexity from \(O(\varepsilon ^{-2-\frac{2}{\widetilde{\alpha }}})\) to \(O(\varepsilon ^{-\frac{2}{\widetilde{\alpha }}})\) and the fast EM scheme’s complexity to \(O(\varepsilon ^{-\frac{1}{\widetilde{\alpha }}}\left|\log \varepsilon \right|^3)\), where \(0<\widetilde{\alpha }=\alpha -\frac{1}{2}<\frac{1}{2}\). Finally, numerical examples are included to verify the theoretical results and demonstrate the performance of our methods.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.