4.8.26 · D4Numerical Methods

Exercises — Stiff equations — implicit methods, backward Euler

2,165 words10 min readBack to topic

Before we start, one shared picture. Every method in this topic is measured on the test problem (the model ODE whose true solution we already know). The number that decides everything is called the amplification factor: the number you multiply by to get . If its size is below , each step shrinks toward (good, stable); if above , each step grows (bad, blows up).

Figure — Stiff equations — implicit methods, backward Euler

Everything below is just asking "what is , is its size under , and what does that force?"


Level 1 — Recognition

(Read a formula, plug in, report a number. No strategy yet.)

Recall Solution L1.1

WHAT: just substitute. . WHY these numbers: bundles step size and decay into one dimensionless quantity — the only thing the stability test looks at. Since , this step shrinks : stable. ✅

Recall Solution L1.2

, so . stable (in fact this hits the true value's fast decay hard). Recognising that forward Euler's factor is (not ) is the whole point of this rung.

Figure — Stiff equations — implicit methods, backward Euler
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 is stable. Forward Euler's stable region (magenta) is a disk of radius centred at ; it only covers . Beyond forward Euler is unstable. This is the A-stability of backward Euler drawn as a picture.


Level 2 — Application

(Run the method for real: derive, rearrange, iterate.)

Recall Solution L2.1

WHAT: backward Euler on the linear test problem gives . WHY rearrange: appears inside , so we move it to the left — the defining implicit move. Compare true — decaying too, direction correct (first order, so not exact).

Recall Solution L2.2

. Forward: . , . → grows and flips sign: unstable. Backward: . , → decays smoothly: stable. The difference is entirely in the factor: forward left the disk of radius ; backward never can.

Recall Solution L2.3

WHAT: . WHY: is evaluated at the new , so sits on both sides — collect it. (Sanity: the steady state is ; we moved from toward . ✅)


Level 3 — Analysis

(Now reason about conditions, not just numbers.)

Recall Solution L3.1

Stability: . To reach : steps, just to stay stable, not for accuracy. Why this bound: the stable interval on the real axis is , i.e. , giving .

Recall Solution L3.2

Let . Since and , we have , so . Therefore No upper bound on 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: . Steps . Backward Euler has no stability cap; using gives steps . Ratio fewer steps. Why the fast mode dominates: stability of an explicit method is set by the smallest time scale , even long after that component is numerically zero — the definition of stiffness.


Level 4 — Synthesis

(Combine ideas: Newton inside backward Euler, method comparison.)

Recall Solution L4.1

WHAT: the implicit equation is . WHY Newton: simple iteration would need , the very stiff restriction we escape; Newton has no such cap. At : , . One more check of direction: should decay from , and indeed . ✅ (Further Newton steps refine toward the exact root of .)

Recall Solution L4.2

. Backward Euler: . Error . Trapezoidal: factor . Error — about smaller. Why: trapezoidal is second-order ; backward Euler is first-order . Both are stable here, but trapezoidal is more accurate — a reminder that stability and accuracy are separate axes.


Level 5 — Mastery

(Design and justify; open-ended reasoning.)

Recall Solution L5.1

(a) Stiff? The stiffness ratio — modes span 4 orders of magnitude of time scale. Yes, strongly stiff. (b) Forward Euler steps: governed by the fastest mode: . Steps . Prohibitive. (c) Choice: an L-stable implicit method such as backward Euler. Reason: the fastest mode has for any reasonable ; backward Euler's factor damps it in a single step, while an explicit method cannot. Choose purely for accuracy on the slow mode (e.g. ), solving the implicit equations with Newton.

Recall Solution L5.2

Define (multiplying through by ). At : , , ratio , so ✅. At : , , ratio , so ✅. Both pass; the tolerance permits (and a little beyond). Why this matters: with stability free, the only thing sizing 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: The denominator grows without bound, so the factor vanishes. Both conditions hold → backward Euler is L-stable. Contrast with trapezoidal, whose factor tends to (A-stable but not L-stable).


Recall One-line summary to test yourself

Everything reduces to one number ::: : read , check , and remember backward Euler's for all in the left half-plane while forward Euler's holds only inside a disk of radius about .


Connections

  • Parent topic
  • Forward Euler method
  • Region of absolute stability
  • A-stability and L-stability
  • Trapezoidal / Crank–Nicolson method
  • Newton's method for root finding
  • Runge–Kutta methods
  • Eigenvalues and time scales of linear systems