Simulation of BSDEs by Wiener chaos expansion

We present an algorithm to solve BSDEs based on Wiener chaos expansion and Picard’s iterations. We get a forward scheme where the conditional expectations are easily computed thanks to chaos decomposition formulas. We use the Malliavin derivative to compute Z. Concerning the error, we derive explicit bounds with respect to the number of chaos and the discretization time step. We also present numerical experiments. We obtain very encouraging results in terms of speed and accuracy.