Finite Difference Methods for Option Pricing › Finite Difference Methods for Option Pricing

Derivative pricing uses two major numerical approaches: binomial trees, which discretize the underlying asset's price movements into up and down jumps, and Monte Carlo simulation, which generates random paths of the underlying asset to estimate option values. Both methods are powerful, but they approach the pricing problem from a probabilistic perspective, simulating possible futures and working backward or averaging outcomes.

Finite difference methods take an entirely different approach. Rather than simulating the stochastic process that drives asset prices, they directly attack the partial differential equation (PDE) that governs option values. As shown in the chapter on the Black-Scholes-Merton PDE, the option price $V(S,t)$ satisfies a deterministic equation that can be solved numerically by discretizing both the asset price and time dimensions onto a grid.

This chapter develops three finite difference schemes, each representing a different trade-off between computational simplicity and numerical stability: the explicit scheme, the implicit scheme, and the Crank-Nicolson scheme. Understanding these methods provides essential tools for pricing options where analytical solutions don't exist, including American options with early exercise features and exotic derivatives with complex payoff structures. We'll examine how to set up the computational grid, handle boundary conditions, ensure numerical stability, and implement each scheme in practice.