Before we start, one shared picture. Every method in this topic is measured on the test problemy′=λy (the model ODE whose true solution y=y0eλt we already know). The number that
decides everything is called the amplification factor: the number you multiply yn by to get
yn+1. If its size is below 1, each step shrinks y toward 0 (good, stable); if above 1, each
step grows y (bad, blows up).
Everything below is just asking "what is R(z), is its size under 1, and what does that force?"
(Read a formula, plug in, report a number. No strategy yet.)
Recall Solution L1.1
WHAT: just substitute. z=hλ=(0.05)(−20)=−1.
WHY these numbers:z bundles step size and decay into one dimensionless quantity — the only thing
the stability test looks at.
R(z)=1−z1=1−(−1)1=21=0.5.
Since ∣0.5∣<1, this step shrinksy: stable. ✅
Recall Solution L1.2
z=−1, so R(z)=1+(−1)=0. ∣0∣<1 → stable (in fact this hits the true value's fast decay hard).
Recognising that forward Euler's factor is 1+z (not 1/(1−z)) is the whole point of this rung.
Recall Solution L1.3
Backward Euler. Its stable region (violet) is the entire outside of a small disk on the right, which
contains the whole negative real axis — every negative z is stable. Forward Euler's stable region
(magenta) is a disk of radius 1 centred at −1; it only covers −2<z<0. Beyond z=−2 forward Euler
is unstable. This is the A-stability of backward Euler drawn as a picture.
(Run the method for real: derive, rearrange, iterate.)
Recall Solution L2.1
WHAT: backward Euler on the linear test problem gives yn+1=1−hλ1yn.
WHY rearrange:yn+1 appears inside f, so we move it to the left — the defining implicit move.
z=hλ=(0.5)(−4)=−2,R=1−(−2)1=31.y1=31⋅1=0.3333,y2=31⋅y1=0.1111.
Compare true y(1)=e−4=0.0183 — decaying too, direction correct (first order, so not exact).
Recall Solution L2.2
z=hλ=(0.6)(−4)=−2.4.
Forward:R=1+z=1−2.4=−1.4. y1=−1.4, y2=1.96. ∣−1.4∣>1 → grows and flips sign: unstable.
Backward:R=1/(1−(−2.4))=1/3.4=0.2941. y1=0.2941, y2=0.0865 → decays smoothly: stable.
The difference is entirely in the factor: forward left the disk of radius 1; backward never can.
Recall Solution L2.3
WHAT:y1=y0+hf(t1,y1)=0+0.1(−30y1+3).
WHY:f is evaluated at the newy1, so y1 sits on both sides — collect it.
y1=−3y1+0.3⇒y1+3y1=0.3⇒4y1=0.3⇒y1=0.075.
(Sanity: the steady state is y′=0⇒y=3/30=0.1; we moved from 0 toward 0.1. ✅)
Stability: ∣1+hλ∣<1⇒h<∣λ∣2=2502=0.008.
To reach t=5: steps=0.0085=625 steps, just to stay stable, not for accuracy.
Why this bound: the stable interval on the real axis is −2<z<0, i.e. −2<hλ<0, giving h<2/∣λ∣.
Recall Solution L3.2
Let z=hλ. Since h>0 and λ<0, we have z<0, so 1−z=1−(negative)=1+∣z∣>1.
Therefore
∣R(z)∣=1−z1=1−z1<1because the denominator exceeds 1.
No upper bound on h appears anywhere — that is exactly what unconditional stability means. The step
is chosen for accuracy alone.
Recall Solution L3.3
Forward Euler must satisfy stability for the fastest mode: h<2/∣λ2∣=2/1000=0.002.
Steps =10/0.002=5000.
Backward Euler has no stability cap; using h=0.1 gives steps =10/0.1=100.
Ratio =5000/100=50× fewer steps. Why the fast mode dominates: stability of an explicit method is
set by the smallest time scale 1/∣λ2∣, even long after that component is numerically zero — the
definition of stiffness.
(Combine ideas: Newton inside backward Euler, method comparison.)
Recall Solution L4.1
WHAT: the implicit equation is g(y)=y−y0−h(−y3)=y−1+0.5y3=0.
WHY Newton: simple iteration would need ∣h∂f/∂y∣<1, the very stiff restriction we
escape; Newton has no such cap.
g′(y)=1+1.5y2.
At y(0)=1: g(1)=1−1+0.5=0.5, g′(1)=1+1.5=2.5.
y(1)=y(0)−g′(y(0))g(y(0))=1−2.50.5=1−0.2=0.8.
One more check of direction: y should decay from 1, and indeed 0.8<1. ✅ (Further Newton steps refine
toward the exact root of g.)
Recall Solution L4.2
z=hλ=(0.5)(−2)=−1.
Backward Euler:y1=1−z1=21=0.5. Error =0.5−0.3679=0.1321.
Trapezoidal: factor R=1−z/21+z/2=1+0.51−0.5=1.50.5=0.3333.
Error =0.3333−0.3679=−0.0346 — about 4× smaller.
Why: trapezoidal is second-order O(h2); backward Euler is first-order O(h). Both are stable here,
but trapezoidal is more accurate — a reminder that stability and accuracy are separate axes.
(a) Stiff? The stiffness ratio =∣λmin∣∣λmax∣=140000=40000 — modes
span 4 orders of magnitude of time scale. Yes, strongly stiff.(b) Forward Euler steps: governed by the fastest mode: h<2/40000=5×10−5.
Steps =20/(5×10−5)=400000. Prohibitive.
(c) Choice: an L-stable implicit method such as backward Euler. Reason: the fastest mode has
z=hλ→−∞ for any reasonable h; backward Euler's factor 1/(1−z)→0 damps it in a single
step, while an explicit method cannot. Choose h purely for accuracy on the slow λ=−1 mode
(e.g. h≈0.05–0.1), solving the implicit equations with Newton.
Recall Solution L5.2
Define E(h)=e−h1/(1+h)−e−h=1+heh−1 (multiplying through by eh).
At h=0.2:e0.2=1.2214, 1+h=1.2, ratio =1.01784, so E=0.01784≤0.05 ✅.
At h=0.3:e0.3=1.34986, 1+h=1.3, ratio =1.03835, so E=0.03835≤0.05 ✅.
Both pass; the tolerance permits h=0.3 (and a little beyond). Why this matters: with stability free,
the only thing sizing h is this accuracy budget — exactly the situation the whole topic promised.
Recall Solution L5.3
A-stability was shown in L3.2 (entire left half-plane stable). For the limit:
lim∣z∣→∞1−z1=lim∣z∣→∞∣1−z∣1=0.
The denominator grows without bound, so the factor vanishes. Both conditions hold → backward Euler is
L-stable. Contrast with trapezoidal, whose factor tends to ∣−1∣=1 (A-stable but not L-stable).
Recall One-line summary to test yourself
Everything reduces to one number ::: z=hλ: read R(z), check ∣R(z)∣<1, and remember backward Euler's ∣R∣<1 for all z in the left half-plane while forward Euler's holds only inside a disk of radius 1 about −1.