pith. sign in

arxiv: 1607.06897 · v1 · pith:R3NI6IOHnew · submitted 2016-07-23 · 🧮 math.NA · cs.NA

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

classification 🧮 math.NA cs.NA
keywords gridsparseapproximationshighdimensionalefficientfbsdessolving
0
0 comments X
read the original abstract

This is the second part in a series of 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 interpolations. In this work, we propose the sparse grid spatial discretization. We use the sparse grid Gaussian-Hermite quadrature rule to approximate the conditional expectations. And for the associated high dimensional interpolations, we adopt an 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 high accurate approximations in high-dimensions, provided that the solutions are sufficiently smooth. Several numerical examples are presented to demonstrate the efficiency of the proposed methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.