Backward Differentiation Formula finite difference schemes for diffusion equations with an obstacle term

Finite difference schemes, using backward differentiation formula (BDF), are studied for the approximation of one-dimensional diffusion equations with an obstacle term of the form min(vt − a(t, x)v _xx + b(t, x)v _x + r(t, x)v, v − ϕ(t, x)) = f(t, x). For the scheme building on the second-order BDF formula, we discuss unconditional stability, prove an L ²-error estimate and show numerically second-order convergence, in both space and time, unconditionally on the ratio of the mesh steps. In the analysis an equivalence of the obstacle equation with a Hamilton–Jacobi–Bellman equation is mentioned, and a Crank–Nicolson scheme is tested in this context. Two academic problems for parabolic equations with an obstacle term with explicit solutions and the American option problem in mathematical finance are used for numerical tests.