{"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":54709,"journal":{"name":"Numerical Algorithms","volume":"3 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11075-024-01889-7","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
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.
期刊介绍:
The journal Numerical Algorithms is devoted to numerical algorithms. It publishes original and review papers on all the aspects of numerical algorithms: new algorithms, theoretical results, implementation, numerical stability, complexity, parallel computing, subroutines, and applications. Papers on computer algebra related to obtaining numerical results will also be considered. It is intended to publish only high quality papers containing material not published elsewhere.