Picard Iteration Calculator: Step-by-Step Solutions

Successive approximations φ₁, φ₂, … with exact polynomial arithmetic. Every step of the solution is shown, as you would write it on paper, using exact fractions.

What it solves

For $y^{\prime }=f(x,y)$, $y(0)=y_0$ with $f$ a polynomial: ${\phi }_0=y_0$ and ${\phi }_{k+1}(x)=y_0+{\int }_0^{x}f(t,{\phi }_k(t))dt$.

How to use it

1. Enter your own numbers or functions in the boxes (an example is already filled in, or press Random example).
2. Check the equation preview, then press Solve step by step.
3. Reveal the solution one step at a time with Next step, or show everything at once.

Need the theory first? Read Section 8.3: The Method of Successive Approximations, which explains the method in small steps with worked examples and exercises, then come back and test yourself with the Chapter 8 quiz.

All computations run in your browser; nothing is sent to a server.