Two-grid Penalty Approximation Scheme for Doubly Reflected BSDEs
Wonjae Lee, Hyungbin Park

TL;DR
This paper introduces a two-grid penalization scheme for approximating doubly reflected BSDEs, providing explicit error bounds and numerical validation within financial models.
Contribution
It develops a novel two-grid penalization method with explicit error analysis for doubly reflected BSDEs, improving accuracy and computational efficiency.
Findings
Achieved a uniform O(λ^{-1}) bound for the value process.
Derived explicit error bounds in (Δt, ilde{Δt}, λ) and tuning rules.
Numerical experiments confirm the theoretical O(n^{-1/2}) error rate.
Abstract
We study penalization coupled with time discretization for decoupled Markovian doubly reflected BSDEs with obstacles \(p_b(t,X_t)\le Y_t\le p_w(t,X_t)\). The DRBSDE is approximated by a penalized BSDE with parameter \(\lambda\) and discretized by an implicit Euler scheme with step \(\Delta t\). A key difficulty is that the forward approximation used to evaluate the obstacles generates an error term that is amplified by \(\lambda\). In the single-obstacle case this amplification can be removed by the shift \(Y-p_b(t,X)\), but no analogous transformation eliminates both obstacles simultaneously; this motivates simulating the forward SDE on a finer grid \(\tilde{\Delta t}\) and projecting onto the backward grid (two-grid scheme). Under structural assumptions motivated by financial barriers we sharpen penalization rates and obtain a uniform \(O(\lambda^{-1})\) bound for the value process.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
