Skip to content
Field Atlas

Atlas / Mathematics / The Dynamics Thread

Field · Emerged 1671 – 1890

Differential Equations

If we know how something is changing at every instant, can we work out where it will be?

5 chapters3 min read5 turning points1 open problem

Branched from
Calculus
Branched into
Dynamical Systems + Numerical Methods for PDEs
Figures
Isaac Newton, Gottfried Wilhelm Leibniz, Jacob Bernoulli, Johann Bernoulli, Leonhard Euler, Augustin-Louis Cauchy, Rudolf Lipschitz, Émile Picard, Joseph Liouville, Sofia Kovalevskaya

In brief

A differential equation relates a quantity to its own rate of change. Newton's second law says the acceleration of a planet is set by its position. The rate at which a radioactive sample decays is proportional to how much of it is left. The rate at which an epidemic grows depends on how many people are infected and how many are still susceptible. Solving the equation means finding the quantity's whole history from the rule and a starting point.

For a century after calculus, mathematicians solved one equation after another by ingenious formulas. By the mid-nineteenth century it was clear that most equations have no such formula. The subject turned to proving that solutions exist, computing them approximately, and, with Poincaré, describing how they behave without solving them at all. That last step began the study of dynamical systems.

Key ideas

Differential equationEnters 1743 – 1768

An equation involving an unknown function and its derivatives, such as y′=kyy' = ky for exponential growth. Ordinary equations involve one variable, usually time; partial differential equations involve several.

Initial value problemEnters 1824 – 1890

A differential equation together with a starting state. Under mild conditions it has exactly one solution: the present determines the future.

Solution in closed formEnters 1841

A formula built from known functions and integrals. Most equations have none, which Liouville proved for a simple-looking equation in 1841.

Numerical methodEnters 1743 – 1768

Approximating a solution by taking many small steps, each following the current rate of change. Euler's method, from 1768, is the simplest, and all simulation software descends from it.

Draws on other domains

Chapter I

Laws of Change

Calculus made it possible to state a law of nature as a rule about rates of change. Newton wrote the laws of motion that way, and in a treatise of 1671 he classified the "fluxional equations" that result. The task was to go backwards, from the rule to the motion. Early successes were spectacular. In 1696 Johann Bernoulli challenged Europe to find the curve of fastest descent. Newton solved it overnight, and Leibniz and Jacob Bernoulli solved it too: a cycloid, the curve traced by a point on a rolling wheel.

Chapter II

Euler's Toolbox

Leonhard Euler turned the tricks into methods. In 1743 he showed that every linear equation with constant coefficients, the kind that describes springs, pendulums and circuits, reduces to finding the roots of a polynomial. He classified equations by type and solved type after type. And where no method worked, he proposed computing the solution approximately: start at the known point, follow the current slope for a short step, recompute the slope, and repeat.

Chapter III

No Formula

The hope that every equation could be solved by formula ended with Joseph Liouville. In 1841 he proved that even the innocent-looking Riccati equation y′=x2+y2y' = x^2 + y^2 has no solution built from elementary functions and integrals. It became clear that solvable equations were the exception.

That raised a basic question: if no formula exists, does a solution exist at all? Augustin-Louis Cauchy proved in the 1820s that it does, under mild conditions, and that it is unique. Rudolf Lipschitz and Émile Picard later gave the sharp conditions and the proof by successive approximation. Sofia Kovalevskaya extended existence to partial differential equations in her thesis of 1874. Determinism, the idea that the present fixes the future, was now a theorem.

Chapter IV

A Closer Look: Stepping Towards ee

The simplest growth law is y′=yy' = y: the rate of growth equals the current amount, starting from y(0)=1y(0) = 1. Its exact solution is y=ety = e^t, so at t=1t = 1 the answer is e=2.71828…e = 2.71828\ldots Pretend we don't know that, and use Euler's method.

With step size hh, each step multiplies the current value by (1+h)(1 + h), since the value grows by hh times itself. Reaching t=1t = 1 takes 1/h1/h steps, so the estimate is (1+h)1/h(1 + h)^{1/h}:

Step size hhStepsEstimate of y(1)y(1)Error
1120.718
0.522.250.468
0.1102.59370.125
0.011002.70480.0135
0.0011,0002.71690.00136

Every tenfold decrease in step size cuts the error roughly tenfold. The method converges, but slowly: the error is proportional to hh. That is why practical solvers use cleverer schemes, such as the fourth-order Runge–Kutta method, which samples the slope four times per step and whose error shrinks like h4h^4, ten thousand times smaller for each tenfold cut in step size.

The example also shows compound interest. Growing 100% a year, compounded nn times, gives (1+1/n)n(1 + 1/n)^n, which approaches ee. Jacob Bernoulli found the number this way in 1683. Euler's method and compound interest are the same calculation.

Chapter V

Beyond Solving

By the late nineteenth century the question had shifted from "what is the solution?" to "what does it do?" Will a planet's orbit stay bounded? Will a population settle down or oscillate? Henri Poincaré answered such questions from the geometry of the equations alone, founding the theory of dynamical systems. One of the oldest questions of that kind, how many isolated periodic cycles a polynomial equation in the plane can have, was Hilbert's sixteenth problem in 1900, and it is still open.

Applications

Where it is used

  • Epidemiology↗ Biology · Infectious Disease Dynamics

    The SIR model

    In 1927 William Kermack and Anderson McKendrick modelled an epidemic with three coupled differential equations for susceptible, infected and recovered people. Their model predicts a threshold for an outbreak, and its descendants guided responses to COVID-19.

    › Sources (1)
    • Kermack, W. O. & McKendrick, A. G. (1927). A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society A 115(772): 700–721.
  • Mechanics↗ Physics · Classical Mechanics

    Every law of motion is a differential equation

    Newton's second law, F=maF = ma, is a differential equation for position. Planetary orbits, projectiles, pendulums and spacecraft trajectories are all found by solving it, exactly for two bodies and numerically for more.

    › Sources (1)
    • Arnold, V. I. (1989). Mathematical Methods of Classical Mechanics (2nd ed.). Springer.
  • Engineering

    Simulation

    Weather forecasts, crash tests, circuit design and climate models all integrate differential equations numerically. The Runge–Kutta methods of around 1900, refined versions of Euler's step-by-step method, are still the workhorses.

    › Sources (1)
    • Butcher, J. C. (2016). Numerical Methods for Ordinary Differential Equations (3rd ed.). Wiley.
  • Fluid dynamics↗ Physics · Fluid Dynamics

    The equations nobody can solve

    The Navier–Stokes equations are a system of nonlinear partial differential equations, and they are the standard example of how far existence theory lags behind use: they are solved numerically every day to design aircraft and forecast weather, and whether smooth solutions exist in three dimensions for all time is a Millennium Prize problem. The nonlinear term that makes them intractable is the one describing fluid carrying its own momentum.

    › Sources (1)
    • Fefferman, C. L. (2006). Existence and smoothness of the Navier–Stokes equation. In The Millennium Prize Problems, 57–67. Clay Mathematics Institute.

Open problems

Where the map runs out

Open

Hilbert's sixteenth problem (second part)

Open as of 2026, even for equations of degree two.

A limit cycle is an isolated closed orbit that nearby solutions spiral towards or away from. For a system x′=P(x,y)x' = P(x, y), y′=Q(x,y)y' = Q(x, y) with PP and QQ polynomials of degree nn, how many limit cycles can there be? Hilbert asked in 1900 for the maximum number and their possible arrangements.

Why it is hard

Even the statement that each such system has finitely many limit cycles took until 1991–92 to prove, by Yulij Ilyashenko and Jean Écalle independently, after a 1923 proof by Dulac was found to be flawed. Systems of degree two are known that have four limit cycles, but no one has proved that there cannot be more.

What resolving it unlocks

Limit cycles model self-sustaining oscillations, from heartbeats to electronic oscillators. A bound would tell exactly how many independent rhythms simple polynomial models can sustain.

› Sources (1)
  • Ilyashenko, Y. (2002). Centennial history of Hilbert's 16th problem. Bulletin of the American Mathematical Society 39(3): 301–354.

Further reading

  1. Strogatz, S. (2019). Infinite Powers: How Calculus Reveals the Secrets of the Universe. Houghton Mifflin Harcourt.

    A popular account of calculus and the differential equations that grew from it.

  2. Hirsch, M. W., Smale, S. & Devaney, R. L. (2013). Differential Equations, Dynamical Systems, and an Introduction to Chaos (3rd ed.). Academic Press.

    An undergraduate textbook that leads from equations to dynamical systems.

  3. Arnold, V. I. (1992). Ordinary Differential Equations. Springer.

    A geometric, intuitive treatment by one of the masters of the subject.