Whenever we approximate differential equations (ODEs and PDEs) via numerical discretization (e.g., finite differences), we can think about the accuracy of the simulated solution with respect to the ground truth continuous solution using three fundamental concepts:
A numerical scheme is said to be consistent with respect to a differential equation if the local truncation error \(\tau(\Delta t, \Delta x)\) vanishes to zero as the discretization step sizes tend towards zero:
A numerical scheme is said to be stable if small perturbations (e.g., round-off errors, small fluctuations in initial/boundary data) remain bounded and do not blow up towards infinity as the scheme advances.
A numerical method is said to be convergent if the global error between the ground truth analytical/continuous solution \(u(x,t)\) and the numerical approximation \(u_j^n\) tends to zero at any fixed point \((x,t)\) as the grid spacings are decreased towards zero:
For a well-posed linear initial value problem, a continuous finite difference approximation is said to be convergent if and only if it is both consistent and stable.