Crank–Nicolson method
Finite difference method for numerically solving parabolic 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. It is a second-order method in time. It is implicit in time, can be written as an implicit Runge–Kutta method, and it is numerically stable.
Nº Q588725 ★
Common · History
Crank–Nicolson method
Finite difference method for numerically solving parabolic 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. It is a second-order method in time. It is implicit in time, can be written as an implicit Runge–Kutta method, and it is numerically stable.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations. It is a second-order method in time. It is implicit in time, can be written as an implicit Runge–Kutta method, and it is numerically stable. The method was developed by John Crank and Phyllis Nicolson in the 1940s. 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 {\displaystyle \Delta t} times the thermal diffusivity to the square of space step, Δ x 2 {\displaystyle \Delta x^{2}} , 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.
Text: Wikipédia, CC BY-SA 4.0. · Image: The original uploader was Jean-Christophe BENOIST at French... (CC BY-SA 3.0) ·
Related cards
Nelder–Mead method
Numerical optimization algorithm
Nº Q1253278 ★★
Monte Carlo method
Broad class of computational algorithms using random sampling to obtain numerical results
Nº Q232207 ★★★★
Jacobi method
Iterative method used to solve a linear system of equations
Nº Q1481893 ★★
Hartree–Fock method
Method of approximation for the determination of the wave function and the energy of a quantum many-body system in a stationary state
Nº Q7879841 ★★
Method of characteristics
Technique for solving hyperbolic partial differential equations
Nº Q1785085 ★
Heron's method
Heron's method of calculating a square root
Nº Q20725439 ★★★