JOVANA
Library Glossary Getting Started Three Levels Fields How it works Mission
Join the mission
All guides

Picard Iteration: Building the Solution

The earlier guides promised a solution exists and is unique. This one actually builds it — start with a crude guess, feed it through one integral over and over, and watch the guesses close in on the true solution like a target you are zeroing in on.

From a statement to a construction

By now you have two promises in hand. Guide 1 used Peano's theorem to swear that whenever the right-hand side f(t, y) is merely continuous, the initial value problem y' = f(t, y), y(t0) = y0 has at least one solution. Guide 2 added the Lipschitz condition and upgraded that to exactly one solution. Both were existence statements — they told you a solution is out there without ever showing you how to get your hands on it. This guide closes that gap. Picard iteration is a recipe that actually constructs the solution, one approximation at a time, and as a bonus it proves existence and uniqueness all over again from the inside.

The first move is one you have quietly seen before: turn the differential equation into an integral equation. Integrate both sides of y' = f(t, y) from the start time t0 up to a general time t. The left side telescopes — the integral of a derivative is just the change in y — giving y(t) - y(t0). Bringing y(t0) = y0 over, the whole IVP becomes y(t) = y0 + (the integral from t0 to t of f(s, y(s)) ds). This is the fixed-point form of the problem, and it has folded the initial condition right inside it.

That one integration has quietly done something powerful: it converted a statement about a derivative into a statement about y itself, with the initial condition baked in and no derivatives left to satisfy separately. The price is that the unknown y now appears on both sides — on the left, and again inside the integral on the right. That self-referential shape looks like a problem, but it is exactly the shape an iteration can chew on.

The loop: guess, plug in, repeat

Notice the awkward beauty of the integral form: the unknown y appears on the left and also inside the integral on the right. You cannot just compute the right side, because you would need to already know y to do it. So instead you bootstrap. Make any crude first guess for y — the simplest honest choice is the constant function y0(t) = y0, the flat line that at least satisfies the initial condition. Feed that guess into the right-hand integral and out comes a new, usually better function. Call it y1. Then feed y1 back in to get y2, feed y2 in to get y3, and keep going. This loop is Picard iteration, and each pass is one round of successive approximations.

  y_0(t) = y0                            (flat first guess)

  y_1(t) = y0 + S[t0..t] f(s, y_0(s)) ds
  y_2(t) = y0 + S[t0..t] f(s, y_1(s)) ds
  y_3(t) = y0 + S[t0..t] f(s, y_2(s)) ds
     ...
  y_{n+1}(t) = y0 + S[t0..t] f(s, y_n(s)) ds

  the y_n converge to the true solution y(t)
Each new approximation is the old one pushed once through the integral. The sequence y0, y1, y2, ... marches toward the true solution.

It is worth doing one tiny case by hand, because the magic is concrete. Take y' = y with y(0) = 1, whose true answer you already know is e^t. Start with y0 = 1. Then y1 = 1 + (integral from 0 to t of 1 ds) = 1 + t. Next y2 = 1 + (integral of (1 + s) ds) = 1 + t + t^2/2. Then y3 = 1 + t + t^2/2 + t^3/6. Each step glues on exactly the next term of the Taylor series for e^t. The crude flat guess is sharpening, term by term, into the very function it should be — you are literally watching e^t assemble itself.

Why the guesses must converge

Watching e^t appear is delightful, but why should the loop converge in general rather than wander or blow up? Here is exactly where the Lipschitz condition from guide 2 earns its keep. The operation "take a function, push it through the integral" is a single machine that turns functions into functions. The Lipschitz bound on f controls how much that machine can stretch the gap between two inputs: if two guesses differ by some amount, their outputs differ by a smaller amount, at least over a short enough time interval. A machine that always shrinks distances is a contraction, and this is the heart of the contraction mapping principle.

Once you know the machine is a contraction, the rest is almost forced. Picture each function as a point in a vast space of functions, and the integral machine as a rule that moves every point closer to one special spot. Apply it again and again and every starting point spirals into that single resting place — a point the machine leaves unmoved, a fixed point. But a function the integral machine leaves unmoved is precisely a function satisfying y(t) = y0 + (integral of f), which is the integral form of our IVP. So the limit of the Picard sequence is the solution, the spiral cannot land anywhere else, and convergence and uniqueness drop out of the same argument.

What it really gives you, and what it does not

It is tempting to read Picard iteration as a practical solving method — crank the loop a few times and read off your answer. Be honest about this: it is far more valuable as a proof than as a calculator. The clean cases where every integral evaluates in elementary functions and the terms assemble into a recognizable series, like the e^t example, are the exception. For a generic f(t, y) the very first integral may already have no closed form, and the second iterate would ask you to integrate something built from that. As a hand method it stalls almost immediately; this is just another face of the blunt fact that most ODEs have no closed-form solution at all.

  1. Rewrite y' = f(t, y), y(t0) = y0 in integral form: y(t) = y0 + (integral from t0 to t of f(s, y(s)) ds).
  2. Start the sequence with the flat guess y0(t) = y0, the constant that already meets the initial condition.
  3. Get the next approximation by plugging the current one into the right-hand integral: y_{n+1} = y0 + (integral of f(s, y_n(s)) ds).
  4. Repeat. If f is Lipschitz in y, the integral map is a contraction on a short interval, so the y_n converge to the one true solution — that is what the proof guarantees.

So what does it really give you? First, a constructive proof of the Picard-Lindelof theorem: existence and uniqueness are no longer accepted on faith but earned by an explicit limit, answering the existence question in the most satisfying way. Second, a mental model that pays off everywhere — the same contraction idea reappears whenever a numerical scheme converges to a steady state, or a recursive map settles to a fixed point. Third, it draws the sharp line you will explore next. Drop the Lipschitz condition and the integral machine may stop being a contraction; then the spiral can land in more than one place, and uniqueness can shatter. That cliff edge — y' = y^(2/3) and its many solutions through the origin — is exactly where guide 4 begins.