Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 15 Feb 2018 in math.NA and cs.NA | (1802.05681v3)

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 $$\min(v_t - a(t,x) v_{xx} + b(t,x) v_x + r(t,x) v, v- \varphi(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.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.