A forward--backward stochastic algorithm for quasi-linear PDEs

We propose a time-space discretization scheme for quasi-linear parabolic PDEs. The algorithm relies on the theory of fully coupled forward--backward SDEs, which provides an efficient probabilistic representation of this type of equation. The derivated algorithm holds for strong solutions defined on any interval of arbitrary length. As a bypass product, we obtain a discretization procedure for the underlying FBSDE. In particular, our work provides an alternative to the method described in [Douglas, Ma and Protter (1996) Ann. Appl. Probab. 6 940--968] and weakens the regularity assumptions required in this reference.Comment: Published at http://dx.doi.org/10.1214/105051605000000674 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Piecewise Constant Policy Approximations to Hamilton-Jacobi-Bellman Equations

An advantageous feature of piecewise constant policy timestepping for Hamilton-Jacobi-Bellman (HJB) equations is that different linear approximation schemes, and indeed different meshes, can be used for the resulting linear equations for different control parameters. Standard convergence analysis suggests that monotone (i.e., linear) interpolation must be used to transfer data between meshes. Using the equivalence to a switching system and an adaptation of the usual arguments based on consistency, stability and monotonicity, we show that if limited, potentially higher order interpolation is used for the mesh transfer, convergence is guaranteed. We provide numerical tests for the mean-variance optimal investment problem and the uncertain volatility option pricing model, and compare the results to published test cases

A unified approach for the solution of the Fokker-Planck equation

This paper explores the use of a discrete singular convolution algorithm as a unified approach for numerical integration of the Fokker-Planck equation. The unified features of the discrete singular convolution algorithm are discussed. It is demonstrated that different implementations of the present algorithm, such as global, local, Galerkin, collocation, and finite difference, can be deduced from a single starting point. Three benchmark stochastic systems, the repulsive Wong process, the Black-Scholes equation and a genuine nonlinear model, are employed to illustrate the robustness and to test accuracy of the present approach for the solution of the Fokker-Planck equation via a time-dependent method. An additional example, the incompressible Euler equation, is used to further validate the present approach for more difficult problems. Numerical results indicate that the present unified approach is robust and accurate for solving the Fokker-Planck equation.Comment: 19 page