Difference between revisions of "Crank–Nicolson method"
Karl Jones (Talk | contribs) |
Karl Jones (Talk | contribs) |
||
| Line 7: | Line 7: | ||
It is implicit in time (see [[Explicit and implicit methods]]), and can be written as an implicit Runge–Kutta method | It is implicit in time (see [[Explicit and implicit methods]]), and can be written as an implicit Runge–Kutta method | ||
| − | It is numerically stable. | + | It is [[Numerical stability|numerically stable]]. |
The method was developed by [[John Crank]] and [[Phyllis Nicolson]] in the mid 20th century. | The method was developed by [[John Crank]] and [[Phyllis Nicolson]] in the mid 20th century. | ||
Latest revision as of 03:59, 23 April 2016
In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations.
Description
It is a second-order method in time. See Big O notation.
It is implicit in time (see Explicit and implicit methods), and can be written as an implicit Runge–Kutta method
It is numerically stable.
The method was developed by John Crank and Phyllis Nicolson in the mid 20th century.
For diffusion equations (and many other equations), it can be shown the Crank–Nicolson method is unconditionally stable.
However, the approximate solutions can still contain (decaying) spurious oscillations if the ratio of time step Δt times the thermal diffusivity to the square of space step, Δx2, is large (typically larger than 1/2 per Von Neumann stability analysis).
For this reason, whenever large time steps or high spatial resolution is necessary, the less accurate backward Euler method is often used, which is both stable and immune to oscillations.
