Abstract

This paper is dedicated to the presentation and the analysis of a numerical scheme for forward–backward SDEs of the McKean–Vlasov type, or equivalently for solutions to PDEs on the Wasserstein space. Because of the mean field structure of the equation, earlier methods for classical forward–backward systems fail. The scheme is based on a variation of the method of continuation. The principle is to implement recursively local Picard iterations on small time intervals. We establish a bound for the rate of convergence under the assumption that the decoupling field of the forward–backward SDE (or equivalently the solution of the PDE) satisfies mild regularity conditions. We also provide numerical illustrations.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call