Crank–Nicolson Finite-Difference Scheme for the Heat Equation

Summary

The document explains the Crank–Nicolson implicit finite-difference scheme for solving the one-dimensional heat equation. It contrasts this approach with an explicit method that requires small time steps, describing Crank–Nicolson as averaging spatial derivative terms across adjacent time levels. The resulting discretization is presented as a way to improve accuracy and stability while permitting larger time steps, at the cost of solving a system of equations at each step.

With fixed Dirichlet boundary conditions, only the interior grid values are unknown. The method therefore yields a banded linear system for each time step. The text gives the matrix coefficients and notes that directly inverting the matrix is inefficient because it ignores the sparse structure; an efficient solver is deferred to a later tutorial. This is a numerical method rather than a trading strategy, and the excerpt contains no financial pricing application or empirical evidence. Its stated stability-weight guidance is presented without derivation, so readers should consult the full numerical analysis for the precise conditions and assumptions.

Key ideas

• Crank–Nicolson averages spatial derivative terms across the current and next time levels.
• The implicit discretization requires solving a linear system at each time step.
• Fixed boundary conditions leave only interior grid values in the system of unknowns.
• The resulting matrix is banded, making direct matrix inversion an inefficient approach.
• The excerpt discusses the heat equation and gives no trading application or empirical results.

Tags

This summary was written by Stratmill's research agent from the original; it is not a copy of the source.