View source for Crank–Nicolson method

{{short description|Finite difference method for numerically solving parabolic differential equations}}
{{Differential equations}}

In [[numerical analysis]], the '''Crank–Nicolson method''' is a [[finite difference method]] used for numerically solving the [[heat equation]] and similar [[partial differential equations]].<ref>{{cite book | title = Convective Heat Transfer | author = Tuncer Cebeci | publisher = Springer | year = 2002 | isbn = 0-9668461-4-1 | url = https://books.google.com/books?id=xfkgT9Fd4t4C&dq=%22Crank-Nicolson+method%22&pg=PA257 }}</ref> It is a [[Big O notation|second-order]] method in time. It is [[Explicit and implicit methods|implicit]] in time, can be written as an [[implicit Runge–Kutta method]], and it is [[Numerical stability|numerically stable]]. The method was developed by [[John Crank]] and [[Phyllis Nicolson]] in the 1940s.<ref>{{Cite journal 
 | title = A practical method for numerical evaluation of solutions of partial differential equations of the heat conduction type
 | journal = [[Mathematical Proceedings of the Cambridge Philosophical Society]]
 | volume = 43 
 | issue = 1
 | year = 1947
 | pages = 50&ndash;67
 | doi = 10.1017/S0305004100023197
 | last1 = Crank | first1 = J. | authorlink1=John Crank
 | last2 = Nicolson | first2 = P. | authorlink2=Phyllis Nicolson
 | bibcode = 1947PCPS...43...50C
 | s2cid = 16676040
 }}</ref>

For [[diffusion equation]]s (and many other equations), it can be shown the Crank–Nicolson method is unconditionally [[Numerical stability|stable]].<ref>{{Cite book | last1=Thomas | first1=J. W. | title=Numerical Partial Differential Equations: Finite Difference Methods | publisher=[[Springer-Verlag]] | location=Berlin, New York | series=Texts in Applied Mathematics | isbn=978-0-387-97999-1 | year=1995 |volume=22 }}. Example 3.3.2 shows that Crank–Nicolson is unconditionally stable when applied to <math>u_t = au_{xx}</math>.</ref> However, the approximate solutions can still contain (decaying) spurious oscillations if the ratio of time step <math>\Delta t</math> times the [[thermal diffusivity]] to the square of space step, <math>\Delta x^2</math>, 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.{{citation needed|reason=Why Crank–Nicolson method could contain oscillations, but backward Euler method couldn't?|date=July 2016}}

==Principle==
[[File:Crank-Nicolson-stencil.svg|thumb|200px|right|The Crank–Nicolson [[Stencil (numerical analysis)|stencil]] for a 1D problem]]

The Crank–Nicolson method is based on the [[trapezoidal rule (differential equations)|trapezoidal rule]], giving second-order convergence in time. For linear equations, the trapezoidal rule is equivalent to the [[Midpoint method|implicit midpoint method]]{{Citation needed|date=September 2019}}—the simplest example of a [[Gauss–Legendre method|Gauss–Legendre]] implicit Runge–Kutta method—which also has the property of being a [[geometric integrator]]. For example, in one dimension, suppose the [[partial differential equation]] is
<math display="block">\frac{\partial u}{\partial t} = F\left(u, x, t, \frac{\partial u}{\partial x}, \frac{\partial^2 u}{\partial x^2}\right).</math>

Letting <math>u(i \Delta x, n \Delta t) = u_i^n</math> and <math>F_i^n = F</math> evaluated for <math>i, n</math> and <math>u_i^n</math>, the equation for Crank–Nicolson method is a combination of the [[forward Euler method]] at <math>n</math> and the [[backward Euler method]] at <math>n+1</math> (note, however, that the method itself is ''not'' simply the average of those two methods, as the backward Euler equation has an implicit dependence on the solution):
{| class="wikitable"
|<math>\frac{u_i^{n+1} - u_i^n}{\Delta t} = 
 F_i^n\left(u, x, t, \frac{\partial u}{\partial x}, \frac{\partial^2 u}{\partial x^2}\right) </math> || forward Euler
|-
| <math>\frac{u_i^{n+1} - u_i^n}{\Delta t} = 
 F_i^{n+1}\left(u, x, t, \frac{\partial u}{\partial x}, \frac{\partial^2 u}{\partial x^2}\right) </math> || backward Euler
|-
| <math>\frac{u_i^{n+1} - u_i^n}{\Delta t} = 
 \frac{1}{2} \left[
  F_i^{n+1}\left(u, x, t, \frac{\partial u}{\partial x}, \frac{\partial^2 u}{\partial x^2}\right) + 
  F_i^n\left(u, x, t, \frac{\partial u}{\partial x}, \frac{\partial^2 u}{\partial x^2}\right)
 \right] </math> || {{nowrap|Crank–Nicolson}}
|}
Note that this is an ''implicit method'': to get the "next" value of <math>u</math> in time, a system of algebraic equations must be solved. If the partial differential equation is nonlinear, the [[temporal discretization|discretization]] will also be nonlinear, so that advancing in time will involve the solution of a system of nonlinear algebraic equations, though linearizations are possible. In many problems, especially linear diffusion, the algebraic problem is [[tridiagonal]] and may be efficiently solved with the [[tridiagonal matrix algorithm]], which gives a fast <math>\mathcal{O}(N)</math> direct solution, as opposed to the usual <math>\mathcal{O}(N^3)</math> for a full matrix, in which <math>N</math> indicates the matrix size.

==Example: 1D diffusion==

The Crank–Nicolson method is often applied to [[Diffusion equation|diffusion problems]]. As an example, for linear diffusion,

: <math>\frac{\partial u}{\partial t} = a \frac{\partial^2 u}{\partial x^2},</math>

applying a [[finite difference]] spatial discretization for the right-hand side, the Crank–Nicolson discretization is then

: <math>\frac{u_i^{n+1} - u_i^n}{\Delta t} = \frac{a}{2 (\Delta x)^2}\left(
 (u_{i+1}^{n+1} - 2 u_i^{n+1} + u_{i-1}^{n+1}) + 
 (u_{i+1}^n - 2 u_i^n + u_{i-1}^n)
\right)</math>

or, letting <math>r = \frac{a \Delta t}{2(\Delta x)^2}</math>,

: <math>-r u_{i+1}^{n+1} + (1 + 2r) u_i^{n+1} - r u_{i-1}^{n+1} = r u_{i+1}^n + (1 - 2r) u_i^n + r u_{i-1}^n.</math>

Given that the terms on the right-hand side of the equation are known, this is a [[tridiagonal]] problem, so that <math>u_i^{n+1}</math> may be efficiently solved by using the [[tridiagonal matrix algorithm]] in favor over the much more costly [[matrix inversion]].

A quasilinear equation, such as (this is a minimalistic example and not general)

: <math>\frac{\partial u}{\partial t} = a(u) \frac{\partial^2 u}{\partial x^2},</math>

would lead to a nonlinear system of algebraic equations, which could not be easily solved as above; however, it is possible in some cases to linearize the problem by using the old value for <math>a</math>, that is, <math>a_i^n(u)</math> instead of <math>a_i^{n+1}(u)</math>. Other times, it may be possible to estimate <math>a_i^{n+1}(u)</math> using an explicit method and maintain stability.

==Example: 1D diffusion with advection for steady flow, with multiple channel connections==
This is a solution usually employed for many purposes when there is a contamination problem in streams or rivers under steady flow conditions, but information is given in one dimension only. Often the problem can be simplified into a 1-dimensional problem and still yield useful information.

Here we model the concentration of a solute contaminant in water. This problem is composed of three parts: the known diffusion equation (<math>D_x</math> chosen as constant), an [[Advection|advective]] component (which means that the system is evolving in space due to a velocity field), which we choose to be a constant <math>U_x</math>, and a lateral interaction between longitudinal channels (<math>k</math>):

{{NumBlk|:|<math>\frac{\partial C}{\partial t} = D_x \frac{\partial^2 C}{\partial x^2} - U_x \frac{\partial C}{\partial x} - k(C - C_N) - k(C - C_M),</math>|{{EquationRef|1}}}}

where <math>C</math> is the concentration of the contaminant, and subscripts <math>N</math> and <math>M</math> correspond to ''previous'' and ''next'' channel.

The Crank–Nicolson method (where <math>i</math> represents position, and <math>j</math> time) transforms each component of the PDE into the following:

{{NumBlk|:|<math>\frac{\partial C}{\partial t} \Rightarrow \frac{C_i^{j+1} - C_i^j}{\Delta t},</math>|{{EquationRef|2}}}}

{{NumBlk|:|<math>\frac{\partial^2 C}{\partial x^2} \Rightarrow \frac{1}{2 (\Delta x)^2}\left(
 (C_{i+1}^{j+1} - 2 C_i^{j+1} + C_{i-1}^{j+1}) + 
 (C_{i+1}^j - 2 C_i^j + C_{i-1}^j)
\right),</math>|{{EquationRef|3}}}}

{{NumBlk|:|<math>\frac{\partial C}{\partial x} \Rightarrow \frac{1}{2}\left(
 \frac{(C_{i+1}^{j+1} - C_{i-1}^{j+1})}{2 (\Delta x)} + 
 \frac{(C_{i+1}^j - C_{i-1}^j)}{2 (\Delta x)}
\right),</math>|{{EquationRef|4}}}}

{{numBlk|:|<math>C \Rightarrow \frac{1}{2} (C_i^{j+1} + C_i^j),</math>|{{EquationRef|5}}}}

{{NumBlk|:|<math>C_N \Rightarrow \frac{1}{2} (C_{Ni}^{j+1} + C_{Ni}^j),</math>|{{EquationRef|6}}}}

{{numBlk|:|<math>C_M \Rightarrow \frac{1}{2} (C_{Mi}^{j+1} + C_{Mi}^j).</math>|{{EquationRef|7}}}}

Now we create the following constants to simplify the algebra:

: <math>\lambda = \frac{D_x \, \Delta t}{2 \, \Delta x^2},</math>

: <math>\alpha = \frac{U_x \, \Delta t}{4 \, \Delta x},</math>

: <math>\beta = \frac{k \, \Delta t}{2},</math>

and substitute ({{EquationNote|2}}), ({{EquationNote|3}}), ({{EquationNote|4}}), ({{EquationNote|5}}), ({{EquationNote|6}}), ({{EquationNote|7}}), <math>\alpha</math>, <math>\beta</math> and <math>\lambda</math> into ({{EquationNote|1}}). We then put the ''new time'' terms on the left (<math>j+1</math>) and the ''present time'' terms on the right (<math>j</math>) to get

: <math>-\beta C_{Ni}^{j+1} - (\lambda + \alpha)C_{i-1}^{j+1} + (1 + 2\lambda + 2\beta)C_i^{j+1} - (\lambda - \alpha)C_{i+1}^{j+1} - \beta C_{Mi}^{j+1} = {}</math>
: <math>\qquad \beta C_{Ni}^j + (\lambda + \alpha)C_{i-1}^j + (1 - 2\lambda - 2\beta)C_i^j + (\lambda - \alpha)C_{i+1}^j + \beta C_{Mi}^j.</math>

To model the ''first'' channel, we realize that it can only be in contact with the following channel (<math>M</math>), so the expression is simplified to

: <math>-(\lambda + \alpha)C_{i-1}^{j+1} + (1 + 2\lambda + \beta)C_i^{j+1} - (\lambda - \alpha)C_{i+1}^{j+1} - \beta C_{Mi}^{j+1} = {}</math>
: <math>\qquad {} +(\lambda + \alpha)C_{i-1}^j + (1 - 2\lambda - \beta)C_i^j + (\lambda - \alpha)C_{i+1}^j + \beta C_{Mi}^j.</math>

In the same way, to model the ''last'' channel, we realize that it can only be in contact with the previous channel (<math>N</math>), so the expression is simplified to

: <math>-\beta C_{Ni}^{j+1} - (\lambda + \alpha)C_{i-1}^{j+1} + (1 + 2\lambda + \beta)C_i^{j+1} - (\lambda - \alpha)C_{i+1}^{j+1} = {}</math>
: <math>\qquad \beta C_{Ni}^j + (\lambda + \alpha)C_{i-1}^j + (1 - 2\lambda - \beta)C_i^j + (\lambda - \alpha)C_{i+1}^j.</math>

To solve this linear system of equations, we must now see that boundary conditions must be given first to the beginning of the channels:

: <math>C_0^j</math>: boundary condition for the channel at present time step,
: <math>C_{0}^{j+1}</math>: boundary condition for the channel at next time step,
: <math>C_{N0}^j</math>: boundary condition for the previous channel to the one analyzed at present time step,
: <math>C_{M0}^j</math>: boundary condition for the next channel to the one analyzed at present time step.

For the last cell of the channels (<math>z</math>), the most convenient condition becomes an adiabatic one, so

: <math> \left. \frac{\partial C}{\partial x} \right|_{x=z} = 
 \frac{C_{i+1} - C_{i-1}}{2 \, \Delta x} = 0.</math>

This condition is satisfied if and only if (regardless of a null value)

: <math>C_{i+1}^{j+1} = C_{i-1}^{j+1}.</math>

Let us solve this problem (in a matrix form) for the case of 3 channels and 5 nodes (including the initial boundary condition). We express this as a linear system problem:

: <math>\mathbf{AA}\,\mathbf{C^{j+1}} = \mathbf{BB}\,\mathbf{C^j} + \mathbf{d},</math>

where

: <math>\mathbf{C^{j+1}} = \begin{bmatrix}
 C_{11}^{j+1}\\ C_{12}^{j+1} \\ C_{13}^{j+1} \\ C_{14}^{j+1} \\
 C_{21}^{j+1}\\ C_{22}^{j+1} \\ C_{23}^{j+1} \\ C_{24}^{j+1} \\
 C_{31}^{j+1}\\ C_{32}^{j+1} \\ C_{33}^{j+1} \\ C_{34}^{j+1} 
\end{bmatrix},
\quad
\mathbf{C^j} = \begin{bmatrix}
 C_{11}^j\\ C_{12}^j \\ C_{13}^j \\ C_{14}^j \\
 C_{21}^j\\ C_{22}^j \\ C_{23}^j \\ C_{24}^j \\
 C_{31}^j\\ C_{32}^j \\ C_{33}^j \\ C_{34}^j
\end{bmatrix}.</math>

Now we must realize that '''AA''' and '''BB''' should be arrays made of four different subarrays (remember that only three channels are considered for this example, but it covers the main part discussed above):

: <math>\mathbf{AA} = \begin{bmatrix}
 AA1 & AA3 & 0 \\
 AA3 & AA2 & AA3 \\
 0 & AA3 & AA1
\end{bmatrix},
\quad
\mathbf{BB} = \begin{bmatrix}
 BB1 & -AA3 & 0 \\
 -AA3 & BB2 & -AA3 \\
 0 & -AA3 & BB1
\end{bmatrix},</math>

where the elements mentioned above correspond to the next arrays, and an additional 4×4 full of zeros. Please note that the sizes of AA and BB are 12×12:

: <math>\mathbf{AA1} = \begin{bmatrix}
 (1 + 2\lambda + \beta) & -(\lambda - \alpha) & 0 & 0 \\
 -(\lambda + \alpha) & (1 + 2\lambda + \beta) & -(\lambda - \alpha) & 0 \\
 0 & -(\lambda + \alpha) & (1 + 2\lambda + \beta) & -(\lambda - \alpha) \\
 0 & 0 & -2\lambda & (1 + 2\lambda + \beta)
\end{bmatrix},</math>

: <math>\mathbf{AA2} = \begin{bmatrix}
 (1 + 2\lambda + 2\beta) & -(\lambda - \alpha) & 0 & 0 \\
 -(\lambda + \alpha) & (1 + 2\lambda + 2\beta) & -(\lambda - \alpha) & 0 \\
 0 & -(\lambda + \alpha) & (1 + 2\lambda + 2\beta) & -(\lambda - \alpha) \\
 0 & 0 & -2\lambda & (1 + 2\lambda + 2\beta)
\end{bmatrix},</math>

: <math>\mathbf{AA3} = \begin{bmatrix}
 -\beta & 0 & 0 & 0 \\
 0 & -\beta & 0 & 0 \\
 0 & 0 & -\beta & 0 \\
 0 & 0 & 0 & -\beta
\end{bmatrix},</math>

: <math>\mathbf{BB1} = \begin{bmatrix}
 (1 - 2\lambda - \beta) & (\lambda - \alpha) & 0 & 0 \\
 (\lambda + \alpha) & (1 - 2\lambda - \beta) & (\lambda - \alpha) & 0 \\
 0 & (\lambda + \alpha) & (1 - 2\lambda - \beta) & (\lambda - \alpha) \\
 0 & 0 & 2\lambda & (1 - 2\lambda - \beta)
\end{bmatrix},</math>

: <math>\mathbf{BB2} = \begin{bmatrix}
 (1 - 2\lambda - 2\beta) & (\lambda - \alpha) & 0 & 0 \\
 (\lambda + \alpha) & (1 - 2\lambda - 2\beta) & (\lambda - \alpha) & 0 \\
 0 & (\lambda + \alpha) & (1 - 2\lambda - 2\beta) & (\lambda - \alpha) \\
 0 & 0 & 2\lambda & (1 - 2\lambda - 2\beta)
\end{bmatrix}.</math>

The '''d''' vector here is used to hold the boundary conditions. In this example it is a 12×1 vector:

: <math>\mathbf{d} = \begin{bmatrix}
 (\lambda + \alpha)(C_{10}^{j+1} + C_{10}^j) \\ 0 \\ 0 \\ 0 \\
 (\lambda + \alpha)(C_{20}^{j+1} + C_{20}^j) \\ 0 \\ 0 \\ 0 \\
 (\lambda + \alpha)(C_{30}^{j+1} + C_{30}^j) \\ 0 \\ 0 \\ 0
\end{bmatrix}.</math>

To find the concentration at any time, one must iterate the following equation:
: <math>\mathbf{C^{j+1}} = \mathbf{AA}^{-1} (\mathbf{BB}\,\mathbf{C^j} + \mathbf{d}).</math>

==Example: 2D diffusion==
When extending into two dimensions on a uniform [[Cartesian grid]], the derivation is similar and the results may lead to a system of [[Banded matrix|band-diagonal]] equations rather than [[Tridiagonal matrix|tridiagonal]] ones. The two-dimensional heat equation

: <math>\frac{\partial u}{\partial t} = a \, \nabla^2 u,</math>

: <math>\frac{\partial u}{\partial t} = a \left(\frac{\partial^2 u}{\partial x^2} + \frac{\partial^2 u}{\partial y^2}\right)</math>

can be solved with the Crank–Nicolson discretization of

: <math>\begin{align}
 u_{i,j}^{n+1} = {} & u_{i,j}^n + \frac{1}{2} \frac{a \Delta t}{(\Delta x)^2} \big[(u_{i+1,j}^{n+1} + u_{i-1,j}^{n+1} + u_{i,j+1}^{n+1} + u_{i,j-1}^{n+1} - 4u_{i,j}^{n+1}) \\
 &+ (u_{i+1,j}^n + u_{i-1,j}^n + u_{i,j+1}^n + u_{i,j-1}^n - 4u_{i,j}^n)\big],
\end{align}</math>

assuming that a square grid is used, so that <math>\Delta x = \Delta y</math>. This equation can be simplified somewhat by rearranging terms and using the [[Courant number|CFL number]]

: <math>\mu = \frac{a \, \Delta t}{(\Delta x)^2}.</math>

For the Crank–Nicolson numerical scheme, a low CFL number is not required for stability, however, it is required for numerical accuracy. We can now write the scheme as

: <math>(1 + 2\mu)u_{i,j}^{n+1} - \frac{\mu}{2}\left(u_{i+1,j}^{n+1} + u_{i-1,j}^{n+1} + u_{i,j+1}^{n+1} + u_{i,j-1}^{n+1}\right)</math>
: <math>\qquad = (1 - 2\mu)u_{i,j}^{n} + \frac{\mu}{2}\left(u_{i+1,j}^{n} + u_{i-1,j}^{n} + u_{i,j+1}^{n} + u_{i,j-1}^{n}\right).</math>

Solving such a linear system is costly. Hence an [[alternating-direction implicit method]] can be implemented to solve the numerical PDE, whereby one dimension is treated implicitly, and other dimension explicitly for half of the assigned time step and conversely for the remainder half of the time step. The benefit of this strategy is that the implicit solver only requires a [[tridiagonal matrix algorithm]] to be solved. The difference between the true Crank–Nicolson solution and ADI approximated solution has an order of accuracy of <math>O(\Delta t^4)</math> and hence can be ignored with a sufficiently small time step.<ref>{{cite web |title=Multi-Dimensional Parabolic Problems |url=http://www.cs.rpi.edu/~flaherje/pdf/pde5.pdf |website=Computer Science Department |publisher=RPI |access-date=29 May 2016}}</ref>

==Crank–Nicolson for nonlinear problems==
Because the Crank–Nicolson method is [[Implicit function|implicit]], it is generally impossible to solve exactly. Instead, an iterative  technique should be used to converge to the solution. One option is to use [[Newton's method]] to converge on the prediction, but this requires the computation of the [[Jacobian matrix and determinant|Jacobian]]. For a high-dimensional system like those in [[computational fluid dynamics]] or [[numerical relativity]], it may be infeasible to compute this Jacobian.

A Jacobian-free alternative is [[fixed-point iteration]]. If <math> f </math> is the velocity of the system, then the Crank–Nicolson prediction will be a fixed point of the map <math>\Phi(x) = x_0 + \frac{h}{2}\left[ f(x_0) + f(x) \right].</math> If the map iteration <math>x^{(i+1)} = \Phi(x^{(i)}) </math> does not converge, the parameterized map <math> \Theta(x,\alpha) = \alpha x + (1-\alpha)\Phi(x)</math>, with <math> \alpha \in(0,1) </math>, may be better behaved. In expanded form, the update formula is 

: <math> x^{i+1} = \alpha x^i + (1-\alpha)\left[ x_0 + \frac{h}{2} \left( f(x_0) + f(x^i) \right) \right],</math>

where <math>x^i</math> is the current guess and <math>x_{i-1}</math> is the previous time-step.

Even for high-dimensional systems, iteration of this map can converge surprisingly quickly.

[[File:Crank-Nicolson Navier-Stokes 2D.webm|300px|thumb|center|A numerical solution of the Navier–Stokes equations in the vorticity form. In this case <math>\alpha=7/8</math> was needed for fixed-point iteration of Crank–Nicolson to converge.]]

==Application in financial mathematics==
{{Further information|Finite difference methods for option pricing}}
Because a number of other phenomena can be [[Mathematical model|modeled]] with the [[heat equation]] (often called the diffusion equation in [[financial mathematics]]), the Crank–Nicolson method has been applied to those areas as well.<ref>{{cite book | title = The Mathematics of Financial Derivatives: A Student Introduction | author1 = Wilmott, P. | author2 = Howison, S. | author3 = Dewynne, J. | publisher = Cambridge Univ. Press | year = 1995 | isbn = 0-521-49789-2 | url = https://archive.org/details/mathematicsoffin00wilm | url-access = registration | quote = The Mathematics of Financial Derivatives Wilmott. }}</ref> Particularly, the [[Black–Scholes]] option pricing model's [[differential equation]] can be transformed into the heat equation, and thus  [[numerical methods|numerical solutions]] for [[Valuation of options|option pricing]] can be obtained with the Crank–Nicolson method.

The importance of this for finance is that option pricing problems, when extended beyond the standard assumptions (e.g. incorporating changing dividends), cannot be solved in closed form, but can be solved using this method.  Note however, that for non-smooth final conditions (which happen for most financial instruments), the Crank–Nicolson method is not satisfactory as numerical oscillations are not damped.  For [[vanilla option]]s, this results in oscillation in the [[Greeks (finance)#Gamma|gamma value]] around the [[strike price]].  Therefore, special damping initialization steps are necessary (e.g., fully implicit finite difference method).

==See also==
*[[Financial mathematics]]
*[[Trapezoidal rule]]

==References==

<references/>
<!-- *Fitzpatrick R. (2003) ''[http://farside.ph.utexas.edu/~rfitzp/teaching/329/lectures/node80.html The Crank–Nicolson scheme]''. Retrieved May 4, 2005.
*Pitman E. Bruce. (1999) ''[http://www.math.buffalo.edu/~pitman/courses/mth438/na/node16.html Parabolic equations]''. Retrieved May 4, 2005. -->


==External links==
*[http://www3.nd.edu/~dbalsara/Numerical-PDE-Course/ Numerical PDE Techniques for Scientists and Engineers], open access Lectures and Codes for Numerical PDEs
*[http://scicomp.stackexchange.com/questions/7399/how-to-discretize-the-advection-equation-using-the-crank-nicolson-methods An example of how to apply and implement the Crank–Nicolson method for the Advection equation]

{{Numerical integrators}}

{{Numerical PDE}}

{{DEFAULTSORT:Crank-Nicolson Method}}
[[Category:Mathematical finance]]
[[Category:Numerical differential equations]]
[[Category:Finite differences]]