Derivation: Euler's method and its order
Three independent routes lead to Euler's formula (Taylor, incremental quotient and integration), and the analysis of the Taylor remainder proves the method is first order.
Route 1: Taylor expansion
Expand the solution by Taylor around , with the Lagrange form of the remainder ( between and ):
The differential equation provides the derivative: . Substituting:
Discard the remainder (the terms of order at least 2) and evaluate at the nodes , with : Euler's scheme remains.
Route 2: incremental quotient
The derivative is the limit of the incremental quotient; for small , that quotient approximates it. This gives the first-order forward difference:
Substituting the approximation into the equation and solving for recovers the same formula:
Route 3: integration
Before using the Fundamental Theorem of Calculus, write the ODE with the dummy variable and integrate both sides over :
Now the Fundamental Theorem of Calculus turns the integral of into the exact difference of the solution:
Approximate the integrand by its value at the left endpoint. In other words, interpolate it with the constant polynomial and integrate that rectangle of base :
Substituting into the integral identity yields Euler's scheme again. Approximating the integrand with higher-degree polynomials produces, along this same route, Heun (trapezoid), RK4 (Simpson) and the Adams methods.
Local error, global error and order
The local error of one step is the Taylor remainder discarded in Route 1 ():
For the global error, sum the local errors. Since is continuous, the intermediate value theorem lets us collect the sum at a single point :
With , one power of cancels and the first-order global error remains: Euler's method is first order.