One Euler step multiplies by one number
For y′ = −a·y the step is yₙ₊₁ = yₙ + h·(−a·yₙ) = (1 − a·h)·yₙ. The factor 1 − a·h is the same at every step, so yₙ = y₀·(1 − a·h)ⁿ exactly: a geometric sequence of fractions, whatever the size of a or h.
On y′ = −a·y one Euler step multiplies the value by the exact factor 1 − a·h, and the whole column is a geometric sequence in that factor. The steps decay only when the factor lies between −1 and 1, which is h < 2/a. A larger step makes the exact fractions grow while the true solution falls to nearly zero. The backward step divides by 1 + a·h instead, and that factor lies between 0 and 1 for every step size.
Core ideas
Three ideas: the factor, the bound it gives, and the different step that has no bound.
For y′ = −a·y the step is yₙ₊₁ = yₙ + h·(−a·yₙ) = (1 − a·h)·yₙ. The factor 1 − a·h is the same at every step, so yₙ = y₀·(1 − a·h)ⁿ exactly: a geometric sequence of fractions, whatever the size of a or h.
A geometric sequence goes to zero exactly when the size of its factor is less than 1. The condition |1 − a·h| < 1 means −1 < 1 − a·h < 1, which is 0 < a·h < 2, and so h < 2/a. The true solution decays for every h, so the bound belongs to the method alone.
Backward Euler evaluates the rate at the new point: yₙ₊₁ = yₙ + h·(−a·yₙ₊₁). Solving for yₙ₊₁ gives yₙ₊₁ = yₙ/(1 + a·h). For a > 0 and h > 0 the denominator exceeds 1, so the factor lies strictly between 0 and 1 at every step size.
The material
Euler's factor, what each range of the step does, the bound with its proof, the lab's three steps on one decay, and the backward alternative with its limits.
Take y′ = −5y with y(0) = 1. The true solution is e^(−5t), which falls toward zero quickly. The question for this lesson is whether Euler's polygon falls with it, and the answer depends on the step alone.
Everything is carried by the factor ρ = 1 − a·h, an exact fraction. Its sign says whether successive values change sign, and its size says whether they shrink.
Forward Euler on y′ = −a·y with a > 0 goes to zero for every starting value exactly when 0 < h < 2/a.
Euler gives yₙ = y₀·ρⁿ with ρ = 1 − a·h. A geometric sequence goes to zero for every start when |ρ| < 1, and does not when |ρ| ≥ 1.
Now |1 − a·h| < 1 means −1 < 1 − a·h < 1. Subtracting 1 and changing signs gives 0 < a·h < 2, which is 0 < h < 2/a. At h = 2/a the factor is exactly −1 and the values alternate forever without shrinking.
□
For a = 5 the bound is 2/5, and a second marker, 1/a = 1/5, is where the factor changes sign. Below 1/5 the factor is positive and the steps decay smoothly. Between 1/5 and 2/5 it is negative: the values alternate in sign and still shrink. Above 2/5 they alternate and grow.
The last row is the preset the lab opens with. With h = 1/2 and eight steps the polygon reaches t = 4, where it holds (3/2)⁸ = 6561/256, which is about 25.6289, rounded. The true value is e^(−20) ≈ 2.06115·10⁻⁹, also rounded, and the tile writes it as 2.06115e-9. Every fraction in the column is correct arithmetic; the method has turned a decay into a growth.
A step of 1/2 looks small, and for a slow decay such as y′ = −y it is: the bound there is 2. The bound shrinks as a grows, so a quickly decaying component forces a small step even after it has stopped mattering to the answer. That is what the word stiff names here: the step is capped by the fastest decay in the problem, not by the accuracy one wants.
The backward factor 1/(1 + a·h) is between 0 and 1 whatever h is. For a = 5 and h = 1/2 it is 1/(1 + 5/2) = 2/7, so the steps decay, where the forward factor was −3/2. Stable does not mean accurate: the true factor over one step is e^(−5/2) ≈ 0.082085, rounded, and 2/7 ≈ 0.285714 is more than three times as large. After eight steps the backward column holds (2/7)⁸ = 256/5764801, still far above the true value, but it has not blown up.
For y′ = −a·y the backward step is solved by one division, because the equation is linear in y. For a nonlinear right-hand side the new value appears on both sides inside the function, and finding it takes an equation to be solved at every step.
That cost is the price of the bound's disappearing. This course shows the one linear case; the general theory is not part of it.
Interactive
Euler's factor 1 − a·h, exactly
Method
Compute the factor, read its size and sign, compare the step with the bound, and only then trust the column.
Read a, which is positive for a decay. For an equation with a forcing, the gap to the steady state obeys this equation, so a is the same.
An exact fraction. Then yₙ = y₀·(1 − a·h)ⁿ, and every value in the Euler column is a power of the factor.
Between 0 and 1: smooth decay. Between −1 and 0: alternating and decaying. Exactly −1: alternating without shrinking. Below −1: alternating and growing.
The steps decay exactly when h < 2/a. If the step is larger, shrink it, or change the method.
1/(1 + a·h), between 0 and 1 for every h. It decays, but how closely it follows the true decay is a separate question.
The decay rate is a = 5 and the step is h = 1/2, so the bound is 2/5 and the step exceeds it. The forward factor and the backward factor are both exact.
The polygon does not merely lose accuracy. It reverses its behaviour: a quantity that decays to nearly zero is described as one that grows and changes sign at every step. A smaller error per step would not have prevented this, because the factor amplifies whatever error there is.
For a rehearsal, take the second preset. The step 1/4 is above 1/5 and below 2/5. Predict the factor, the verdict and y₈ before pressing the button, then read the backward factor as well.
You should be able to write the forward factor 1 − a·h as an exact fraction, classify the behaviour from its sign and size, derive the bound h < 2/a, compute the backward factor 1/(1 + a·h), and say why a small step size alone does not guarantee a faithful answer.
Something to change about this lesson? Write it down, tick it off when it is handled, and export the list when you want to act on it. Kept in this browser only: nothing is sent anywhere, and nobody is notified.
No recommendations yet for this lesson.