Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Heun's method

Numerical Algorithm

Heun's method is a numerical procedure for solving ordinary differential equations with a given initial value. The name may refer to the improved or modified Euler method, which is the explicit trapezoidal rule, or to a similar two-stage Runge-Kutta method, and it is named after Karl Heun. Both variants can be seen as extensions of the Euler method into two-stage, second-order Runge-Kutta methods. To advance one step, the method first calculates an intermediate value at the next integration point and then computes the final approximation there from it, which corrects the plain Euler step by averaging slopes at the two ends of the step.

Sources
Heun's method (Wikipedia)
Lead section
Quote, Lead section
In mathematics and computational science, Heun's method may refer to the improved or modified Euler's method (that is, the explicit trapezoidal rule), or a similar two-stage Runge-Kutta method.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.