Numer. Math. Theor. Meth. Appl., 10 (2017), pp. 222-242.
Published online: 2017-10
[An open-access article; the PDF is free to any online user.]
Cited by
- BibTex
- RIS
- TXT
The deferred correction (DC) method is a classical method for solving ordinary differential equations; one of its key features is to iteratively use lower order numerical methods so that high-order numerical scheme can be obtained. The main advantage of the DC approach is its simplicity and robustness. In this paper, the DC idea will be adopted to solve forward backward stochastic differential equations (FBSDEs) which have practical importance in many applications. Noted that it is difficult to design high-order and relatively "clean" numerical schemes for FBSDEs due to the involvement of randomness and the coupling of the FSDEs and BSDEs. This paper will describe how to use the simplest Euler method in each DC step–leading to simple computational complexity–to achievehigh order rate of convergence.
}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.2017.s02}, url = {http://global-sci.org/intro/article_detail/nmtma/12344.html} }The deferred correction (DC) method is a classical method for solving ordinary differential equations; one of its key features is to iteratively use lower order numerical methods so that high-order numerical scheme can be obtained. The main advantage of the DC approach is its simplicity and robustness. In this paper, the DC idea will be adopted to solve forward backward stochastic differential equations (FBSDEs) which have practical importance in many applications. Noted that it is difficult to design high-order and relatively "clean" numerical schemes for FBSDEs due to the involvement of randomness and the coupling of the FSDEs and BSDEs. This paper will describe how to use the simplest Euler method in each DC step–leading to simple computational complexity–to achievehigh order rate of convergence.