Heun's method
The numerical procedure for solving ordinary differential equations with a given initial value created by Karl Heun.
Facts
8 properties- Instance of
- explicit Runge–Kutta method
- Butcher tableau
- \begin{array}{c|cc}0 & 0 & 0 \\1 & 1 & 0 \\ \hline & 1/2 & 1/2 \\ \end{array}[9]
- Defining formula
- \begin{aligned}\tilde{y}_{i+1} &= y_{i}+h f\left(t_{i}, y_{i}\right) \\y_{i+1} &= y_{i}+\frac{h}{2}\left[f\left(t_{i}, y_{i}\right)+f\left(t_{i+1}, \tilde{y}_{i+1}\right)\right]\end{aligned}[7]
- Different from
- trapezoidal rule[6]
- Has characteristic
- number of stages, order of convergence[4][5]
- Has part(s)
- Euler method[3]
- Has parts
- Euler method
🏷️ Also known as
en Heun's method
en explicit trapezoid rule
en improved Euler's method
en modified Euler's method
ar طريقة هيون
de Heun-Verfahren
fr méthode de Heun
id Metode Heun
it metodo di Heun
ja フンア法
ko 호인의 방법
ro metoda lui Heun
ru метод Хойна
sv Heuns metod
zh Heun方法
🔖 Identifiers · 2
- Freebase ID
- /m/02rr57j
- Microsoft Academic ID (discontinued)
- 136491612
🔗 Connections
Created notable works 1
Different from 1
Has part(s) 1
Maintained by WikiProject 1
Named after 1
← Different from 1
Press Enter · cited answer in seconds
0 sources
Summary
Heun's method is an explicit Runge–Kutta method[1].