IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v240y2026icp20-37.html

Tamed Euler interpolation multilevel Monte Carlo method for quadratic forward backward stochastic differential equations

Author

Listed:
  • Han, Qiang
  • Liu, Yurong

Abstract

We introduce a tamed Euler time-discretization method to approximate the analytical solutions of forward backward stochastic differential equations with generators of quadratic growth with respect to Z. Then we demonstrate that the time-discretization error of order of the tamed Euler scheme is 12 in the L2 sense. Moreover, a new estimator constructed based on the interpolation method and the multilevel Monte Carlo method is applied to approximate conditional expectations in the tamed Euler scheme. Compared with the interpolation Monte Carlo method, in our explicit tamed Euler scheme, this estimator reduces the computational complexity from O(ϵ−4−1r) to O(ϵ−2−1r), where ϵ denotes the prescribed accuracy and r represents the degree of polynomial interpolation functions. In a word, our proposed probabilistic numerical method has not only higher order but also lower computational complexity. Finally, numerical examples are given to illustrate our convergence results and significant computational savings.

Suggested Citation

  • Han, Qiang & Liu, Yurong, 2026. "Tamed Euler interpolation multilevel Monte Carlo method for quadratic forward backward stochastic differential equations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 240(C), pages 20-37.
  • Handle: RePEc:eee:matcom:v:240:y:2026:i:c:p:20-37
    DOI: 10.1016/j.matcom.2025.07.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037847542500268X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2025.07.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:240:y:2026:i:c:p:20-37. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.