Take y′ = y² with y(0) = 1. The candidate y = 1/(1 − t) has y′ = 1/(1 − t)², and y² is 1/(1 − t)² as well, so the residual is 0: it is the check of “Checking a Proposed Solution”, which the lab does exactly. The value at t = 0 is 1, so it passes through the start. At t = 3/4 it is 1/(1/4) = 4; at t = 9/10 it is 10; as t approaches 1 it grows without limit.
Starting higher ends the solution sooner. For y(0) = y₀ the solution is y₀/(1 − y₀·t), whose derivative is y₀²/(1 − y₀·t)², which is its square, so the residual is 0; it ends at t = 1/y₀. From y₀ = 2 it ends at t = 1/2. The time of the end depends on the start, and nothing in the equation announces it.
Theorem · Existence and uniqueness, near the startIf f(t, y) and its derivative with respect to y are continuous near the start (t₀, y₀), then there is exactly one solution through the start on some interval around t₀. The theorem does not say how long the interval is.
The example above shows why the last sentence is not a technicality: here f = y² is as well behaved as a function can be, and the interval is t < 1. The lab demonstrates this one case and does not prove the theorem; the proof belongs to a course in analysis.
Euler's method against the solution
y′ = y², y(0) = 1, h = 1/4
n tₙ yₙ y(tₙ) = 1/(1 − tₙ)
0 0 1 1
1 1/4 5/4 4/3
2 1/2 105/64 2
3 3/4 37905/16384 4
Three steps give y₃ = 37905/16384 ≈ 2.31354, rounded for reading; the true value is 4, and the error the lab prints is 27631/16384. Euler falls well behind, as it must on a rate that rises this fast, and the polygon still looks tame.
Stepping past the end
Run five steps and t₅ = 5/4, which is past t = 1. The lab prints y₅ = 32213971596000663105/4611686018427387904 ≈ 6.98529, a perfectly good fraction, and the tile for the known solution reads undefined at t = 5/4. The formula 1/(1 − t) would give −4 at 5/4, and that number is not the solution either: the solution through (0, 1) has already ended, and the negative branch is a different curve. The method never saw the end, because it never looks further than one step.
The digit budget
Write each value over a power of two. The denominators are 4, 64, 16384, then 2³⁰ and on: each is the square of the last times 4, so the exponent goes 2, 6, 14, 30, 62, …. Their lengths are 1, 2, 5, 10, 19, 38, 77, … digits, doubling. With h = 1/4 the lab completes eleven steps, whose largest denominator has 1233 digits (the last value is shown rounded, ≈ 6.77729e23, over a numerator of 1257 digits), and stops before the twelfth, which would pass its limit of 2000 digits. The tile reads stopped after step 11: digit budget. Nothing was rounded to continue.
That is a fact about the method, and a floating-point program hides it by rounding at every step and carrying on. The numbers it would print past t = 1 are no more the solution than the exact ones are.