Finite Difference Schemes and Convergence Analysis

Hard·25 min read
Numerical MethodsFinite DifferencesBlack-Scholes PDEConvergence Analysis

Quick Quiz

1. Why apply the log-spot transformation x=lnSx=\ln S before discretising the Black-Scholes PDE?
2. The explicit (FTCS) scheme needs λ=σ2Δτ/Δx212\lambda=\sigma^2\Delta\tau/\Delta x^2\le\tfrac12. If Δx\Delta x is halved, by what factor must Δτ\Delta\tau shrink to stay stable?
3. Crank-Nicolson is O(Δτ2+Δx2)O(\Delta\tau^2+\Delta x^2) but oscillates near a payoff kink/discontinuity. The standard fix is:
4. The Lax equivalence theorem states that, for a consistent finite-difference approximation of a well-posed linear PDE, stability is equivalent to convergence.
5. Von Neumann analysis of BTCS gives ξ=1/[1+2λ(1cosαΔx)]\xi=1/[1+2\lambda(1-\cos\alpha\Delta x)]. What is maxαξ\max_\alpha|\xi|?
6. For a 2-D model (e.g. Heston), plain Crank-Nicolson is inefficient because at each step the implicit system: