pith. sign in

arxiv: 2512.16418 · v2 · pith:YJVCCJEInew · submitted 2025-12-18 · 🧮 math.NA · cs.NA· math.PR

An Euler scheme for BSDEs via the Wiener chaos decomposition

classification 🧮 math.NA cs.NAmath.PR
keywords bsdeschaosdecompositioneulerimplementationnumericalschemetime
0
0 comments X
read the original 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.

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.