About this Simulation

This simulation enables students to visualize and compare three fundamental numerical methods for solving ordinary differential equations: Euler, Heun, and fourth-order Runge-Kutta. Adjust step size and view fields to observe how different algorithms converge toward accurate solutions, understanding their strengths and computational efficiency.

Learning objectives: Understand how numerical methods approximate ODE solutions through iterative stepping | Compare accuracy and efficiency trade-offs between Euler, Heun, and Runge-Kutta algorithms | Explore the impact of step size on solution precision and stability