Efficient spectral sparse grid approximations for solving multi-dimensional forward backward SDEs

36Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This is the second part of a series papers on multi-step schemes for solving coupled forward backward stochastic differential equations (FBSDEs). We extend the basic idea in our former paper [W. Zhao, Y. Fu and T. Zhou, SIAM J. Sci. Comput., 36 (2014), pp. A1731-A1751] to solve high-dimensional FBSDEs, by using the spectral sparse grid approximations. The main issue for solving high-dimensional FBSDEs is to build an efficient spatial discretization, and deal with the related high-dimensional conditional expectations and inter-polations. In this work, we propose the sparse grid spatial discretization. The sparse grid Gaussian-Hermite quadrature rule is used to approximate the conditional expectations. And for the associated high-dimensional interpolations, we adopt a spectral expansion of functions in polynomial spaces with respect to the spatial variables, and use the sparse grid approximations to recover the expansion coefficients. The FFT algorithm is used to speed up the recovery procedure, and the entire algorithm admits efficient and highly accurate approximations in high dimensions. Several numerical examples are presented to demonstrate the efficiency of the proposed methods.

Cite

CITATION STYLE

APA

Fu, Y., Zhao, W., & Zhou, T. (2017). Efficient spectral sparse grid approximations for solving multi-dimensional forward backward SDEs. Discrete and Continuous Dynamical Systems - Series B, 22(9), 3439–3458. https://doi.org/10.3934/dcdsb.2017174

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free