Strong convergence rate of Runge--Kutta methods and simplified step-$N$ Euler schemes for SDEs driven by fractional Brownian motions
Jialin Hong, Chuying Huang, Xu Wang

TL;DR
This paper establishes the optimal strong convergence rates for Runge--Kutta and simplified step-N Euler schemes applied to SDEs driven by fractional Brownian motions with Hurst parameter H in (1/2, 1), providing theoretical insights and numerical validation.
Contribution
It introduces order conditions for Runge--Kutta methods to achieve the optimal convergence rate and confirms the conjectured rate for simplified step-N Euler schemes in this context.
Findings
Runge--Kutta methods achieve convergence rate 2H-1/2.
Simplified step-N Euler schemes also attain the optimal rate.
Numerical experiments confirm theoretical convergence rates.
Abstract
This paper focuses on the strong convergence rate of both Runge--Kutta methods and simplified step- Euler schemes for stochastic differential equations driven by multi-dimensional fractional Brownian motions with . Based on the continuous dependence of both stage values and numerical schemes on driving noises, order conditions of Runge--Kutta methods are proposed for the optimal strong convergence rate . This provides an alternative way to analyze the convergence rate of explicit schemes by adding `stage values' such that the schemes are comparable with Runge--Kutta methods. Taking advantage of this technique, the optimal strong convergence rate of simplified step-N Euler scheme is obtained, which gives an answer to a conjecture in when . Numerical experiments verify the theoretial convergence rate.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
