Identify what is changing in Euler’s method
Read the independent variable, dependent quantity, interval, and initial or boundary information before choosing an operation. Rebuild missing background in the differential equations subject guide, then use differential equations practice to retrieve the relationship without being told its name.
Conditions required before the rule can be used
Stiff equations blow up unless h is tiny. Take y' = −20y with h = 0.2: each step multiplies y by 1 − 4 = −3, so the numbers swing to −3, 9, −27, and after five steps reach −243, while the true solution is quietly decaying toward zero.
Build the derivative, integral, or model in stages
- Name the unknown, and the unit the answer has to come out in.
- Match the symbols to your values. $h$ is step size and $y'=f(x,y)$.
- Check the conditions before substituting. Smaller $h$ usually improves accuracy but increases work; accumulated error must be monitored.
- Substitute, keep exact values to the last line, then test the sign, size, and unit against a rough estimate - The check that catches most differential equations slips.
Euler’s method through one changing case
Track what each line says about rate, accumulation, or evolution:
Check change against behavior and units
After using Euler’s method, repeat the calculation with units attached and test the result against a boundary case or a quick numerical estimate.
Where a change calculation commonly breaks
What goes wrong: Students compute the slope once at the starting point and reuse it for every step.
Why it fails: That draws a single straight line and misses the whole idea. The slope has to be recomputed at each new point, because the point is what determines it.
Repair: Recalculate f at the current x and y before every hop. For y' = y from y(0) = 1 with h = 0.1, the first step gives 1.1, and the second uses the new slope 1.1 to reach 1.21, not 1.2.
Questions about change in Euler’s method
Why is my answer always low for y' = y?
Because that solution curves upward, and each straight-line hop cuts underneath the curve. Ten steps of size 0.1 give 2.5937 against a true value of 2.7183, about 4.6 percent short.
How does the error shrink as I make h smaller?
Roughly in proportion to h, since the method is first order. Halving the step size about halves the error, which is slow going compared with higher-order methods.
Does a smaller step always help?
Up to a point. Past a certain fineness the extra rounding error from millions of additions outweighs the improvement, so accuracy stops improving and eventually gets worse.
If it is so inaccurate, why learn it?
Because it makes the idea visible in one line and it is the foundation every better method builds on. Runge-Kutta and the implicit solvers are all refinements of this same step-and-repeat scheme.
Change one input, predict whether the output should rise, fall, or stay fixed, and only then recalculate.