Convergence

A numerical algorithm converges if, when continually refined with a smaller step size, the approximate solutions converge to the exact solution - i.e., the true solution is recovered in the limit $\Delta t\to 0$.

In convergence proofs, only the truncation error is considered - round-off errors are discarded.