Foundations/Classifying Equations: Order, Linearity, ODE vs. PDE

Lesson 1.21,670 words

Classifying Equations: Order, Linearity, ODE vs. PDE

Every solution method targets a specific class of equation, so the first question about any differential equation is which classes it belongs to. Four independent axes sort them: ordinary versus partial, order, linear versus nonlinear, and homogeneous versus nonhomogeneous.

╌╌╌╌

There is no single method that solves every differential equation. Each technique — integrating factors, the characteristic equation, series, the Laplace transform — is built for one class of equation and useless outside it. Choosing a method therefore begins with placing an equation in its classes, and the classification is a fixed vocabulary worth learning before any solving.1 The axes are independent: an equation is ordinary or partial, of some order, linear or nonlinear, homogeneous or not, all at once.

Ordinary versus partial

The first split is by how many independent variables the unknown function depends on.2

An ordinary equation governs the charge on a capacitor in a series circuit:

with the only independent variable. By contrast the heat equation and the wave equation,

have depending on both position and time , so partial derivatives appear and both are PDEs. The theory of PDEs is substantially harder than that of ODEs and largely separate from it, though separation of variables reduces the classical PDEs back to ODEs.

Order

The circuit equation above is second-order, and both classical PDEs are second-order. The most general th-order ODE relates , the unknown , and its first derivatives through some function :

It is usually assumed the equation can be solved for the highest derivative,

which removes an ambiguity: a single implicit equation can encode several of these explicit ones. The equation , quadratic in , splits by the quadratic formula into two distinct first-order equations,

A related notion is degree: the power to which the highest-order derivative is raised once the equation is written as a polynomial in its derivatives. has order one and degree two. Degree is defined only when such a polynomial form exists (an equation containing or has no degree), and it plays a far smaller role than order, which every equation possesses.

Linear versus nonlinear

The most consequential axis is linearity.

The unknown and its derivatives appear only to the first power, never multiplied together, and never inside a nonlinear function. The coefficients may be any functions of the independent variable, because linearity restricts how enters, not how does; is linear.

Linearity is a rule about the left-hand operator: and its derivatives enter only linearly, with -dependence confined to the coefficients. Any product, power, or nonlinear function of breaks it.

Three standard equations show what breaks linearity:

  • Products of the unknown with a derivative. In the term multiplies the unknown by its own derivative; the equation is nonlinear.
  • A nonlinear function of the unknown. The undamped pendulum is nonlinear through .
  • Products of unknowns in a system. The Lotka–Volterra predator–prey equations couple prey and predator through the products , making each equation nonlinear.

Linear theory is highly developed and the reason so much of the subject is tractable; nonlinear equations have no comparably general theory and are approached qualitatively or numerically. When a nonlinear equation cannot be solved directly, a common recourse is linearization: replacing it near a point by a linear approximation. For small swings , and the pendulum becomes the linear , whose solutions are ordinary oscillations. Linearization is exact only in the limit, and phenomena confined to the nonlinear regime, such as limit cycles and chaos, disappear under it; it is only a local approximation.

PropertyLinearNonlinear
Form of in linear (first powers, no products)anything else
Superposition of solutionsholds (for the homogeneous case)fails in general
General theorycomplete and constructivefragmentary; qualitative or numerical
Example

Homogeneous versus nonhomogeneous

Within the linear class, the forcing term gives a further split.

Homogeneity matters because homogeneous linear equations obey superposition: any linear combination of solutions is again a solution. If and solve , so does for every choice of constants — the structure that makes the general solution of a linear equation a finite-dimensional family, developed in the second-order chapter. Nonhomogeneous equations lose this: the difference of two solutions solves the homogeneous equation, so the full solution is one particular solution plus the homogeneous family, never an arbitrary combination on its own. (The word homogeneous is overloaded in this subject; it names a different property of first-order equations solved by the substitution , treated under separable and exact equations.)

Systems

The classifications so far assume one unknown function. With two or more, one equation no longer suffices.

The Lotka–Volterra model is a two-equation first-order system,

for prey and predator . Any higher-order equation converts to a first-order system by naming its derivatives as new variables, so first-order systems and the matrix methods they enable subsume the whole subject.

The independent axes of classification. An equation is placed on each branch at once — the circuit equation is an ODE, second-order, linear, nonhomogeneous, single-unknown.

Solutions

Classification sorts equations; the parallel question is what counts as solving one.

The interval is part of the statement: a function can solve an equation on one interval and fail on another where a derivative blows up. Verifying a candidate is mechanical — compute its derivatives and substitute.3

Substitution confirms a solution but does not find one, since there are too many functions to guess from; it is the one check always available. A less trivial case shows superposition and the count of constants together.

A solution of an th-order equation generally carries arbitrary constants, one contributed by each integration needed to undo the derivatives.

Existence, uniqueness, and determination

Writing an equation does not guarantee a solution exists. The equation has no real solution at all, and has only the single solution , carrying no constant. Three questions organize the theory:4

  • Existence. Does a solution exist? Theorems guarantee one under mild conditions on ; a model that yields an equation with no solution signals a flaw in the formulation.
  • Uniqueness. Is it the only one? Fixing enough conditions should pick out a single solution — otherwise a found solution might not be the whole answer.
  • Determination. Can the solution actually be produced, exactly or approximately? Many equations have solutions inexpressible in elementary functions, which is why numerical and series methods exist alongside exact ones.

For first-order equations Picard's theorem answers the first two at once: if and are continuous on a rectangle, exactly one integral curve passes through each interior point.5 The precise hypotheses, and the equations where uniqueness fails, come with existence and uniqueness.

Initial versus boundary conditions

An th-order equation needs side conditions to fix its constants, and where those conditions are imposed determines the kind of problem.

Both problems constrain a second-order equation with two conditions. The IVP pins the value and slope at one end; the BVP pins the value at each end, and the middle is whatever the equation makes it.

An IVP for a well-behaved equation has exactly one solution; a BVP can have one, none, or infinitely many, depending on the equation and the interval, and that sensitivity is what makes boundary value problems generate eigenvalues and drive Fourier methods.

A brief lineage

The vocabulary above was assembled over three centuries, each term attached to the problems that forced it.6 Newton and Leibniz created the calculus the subject is written in; the Bernoullis turned mechanics problems into differential equations and solved the brachistochrone; Euler classified first-order equations and found integrating factors and constant-coefficient methods; Lagrange proved the structure of linear solution spaces and developed variation of parameters; Laplace lent his name to a transform and to the equation of potential theory; and Poincaré, facing equations no formula could solve, founded the qualitative, geometric study of nonlinear solutions.

A few landmarks. The early names built exact-solution methods; the later shift toward existence theory and qualitative geometry answered the equations those methods could not solve.

Given any differential equation, naming its type, order, linearity, and whether it is forced places it in a class, and the class names the method. The full historical account of these figures closes these notes.

Footnotes

  1. Boyce & DiPrima, Elementary Differential Equations and Boundary Value Problems, §1.3 — Classification of Differential Equations: ODE versus PDE, order, systems, and the linear/nonlinear distinction, presented as the vocabulary needed to select solution methods. 2
  2. Simmons, Differential Equations with Applications and Historical Notes, Ch. 1 §1 — Introduction: the definitions of ordinary and partial differential equations and of order, with Legendre's, Bessel's, Laplace's, the heat, and the wave equations as reference examples.
  3. Simmons, Ch. 1 §2 — General Remarks on Solutions: verifying , , and as solutions of , and the rule that a solution carries arbitrary constants equal in number to the order. 2
  4. Boyce & DiPrima, §1.3 — Some Important Questions: existence, uniqueness, and the practical determination of solutions, including equations with no solution or a single constant-free solution.
  5. Simmons, Ch. 1 §2 — Picard's theorem: continuity of and on a rectangle guarantees a unique integral curve through each interior point, giving the one-parameter family of a first-order equation.
  6. Boyce & DiPrima, §1.1–§1.3 — Historical Background, Parts I–III: from Newton, Leibniz, and the Bernoullis through Euler, Lagrange, and Laplace to the qualitative and computational methods associated with Poincaré and after.

╌╌ END ╌╌