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

Abstract

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 (vt - a(t,x) vxx + b(t,x) vx + r(t,x) v, v- (t,x))= f(t,x). For the scheme building on the second order BDF formula (BDF2), we discuss unconditional stability, prove an L2-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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…