2000 character limit reached
An Euler scheme for BSDEs via the Wiener chaos decomposition
Published 18 Dec 2025 in math.NA and math.PR | (2512.16418v1)
Abstract: The Euler scheme is a standard time discretization for BSDEs, but its implementation hinges on approximating conditional expectations and the associated martingale terms at each time step. We propose an implementation based on the Wiener chaos decomposition to approximate these quantities. In contrast to many numerical schemes that rely on a forward-backward (Markovian) structure, our approach accommodates arbitrary $\mathcal{F}_T$-measurable square-integrable terminal conditions. We provide a comprehensive convergence analysis and illustrate the method on several numerical examples.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.