ODE Solution Techniques — The Standard Toolkit

The whole discipline of solving ODEs by hand reduces to classification first, method second. Almost every "trick" is a recognition heuristic: spot the form, apply the canonical transformation that collapses it onto something integrable. Here we revise the standard arsenal for the master's course, ordered roughly by order and linearity. The thing to internalize is that nearly all of these are substitutions that linearize, separate, or reduce order — the integration at the end is usually the easy part.

[!note] The classification reflex Before reaching for any method, answer four questions: (1) What order? (2) Linear or nonlinear? (3) Constant or variable coefficients? (4) Homogeneous or forced? This 4-tuple determines essentially everything downstream. A "hard" ODE is most often a familiar form wearing an unfamiliar substitution.

First-Order Equations

The first-order zoo is where substitution mastery pays off. The endgame is always separable or linear; the trick is the change of variables that gets you there.

Separable

The base case. If you can factor the RHS into a pure- part and a pure- part, you integrate each side independently.

Worked line: .

[!tip] Watch for lost solutions Dividing by silently discards any constant solution where . Always check the roots of separately — these equilibria are genuine solutions and a common source of dropped marks.

Linear First-Order — Integrating Factor

The canonical form . Multiply through by , which is engineered precisely so the LHS becomes a single product derivative.

Worked line: .

The integrating-factor idea is the prototype for an enormous amount of later machinery — see Exact Equations (where you hunt for that restores exactness) and the operator-conjugation view in Variation of Parameters.

Exact Equations

Write the equation as . It is exact iff there exists a potential with , ; the solution is then the level set .

[!note] The exactness criterion Exactness holds iff (on a simply connected domain). This is just Clairaut's theorem / the closed-form condition in disguise.

Worked line: . Check: ✓. Integrate .

When not exact, you search for an integrating factor. The two tractable cases:

ConditionIntegrating factor
depends only on
depends only on

Homogeneous Substitution

If the equation can be written — i.e. RHS is invariant under — substitute , so and . This always separates:

Do not confuse this sense of "homogeneous" (scale-invariant RHS) with the linear-algebra sense (zero forcing term). Same word, unrelated meaning — a classic exam trap.

Bernoulli Equation — Substitution

Form with . The nonlinearity is removed by , which produces a linear equation in :

then solve by integrating factor. This is the archetypal "nonlinear → linear via power substitution" move; the same spirit recurs in the Riccati Equation (which linearizes to second-order once one particular solution is known).

Second-Order Linear Equations

Here the structure theorem dominates: the general solution is , where spans the 2D solution space of the homogeneous problem and is any particular solution. The methods split cleanly into "find " and "find ."

Characteristic Equation (Constant Coefficients)

For , the ansatz reduces the ODE to the algebraic . Three cases by discriminant:

RootsDiscriminantGeneral solution
Distinct real
Repeated real
Complex

[!note] Why the in the repeated case? A double root only supplies one exponential, leaving the solution space under-spanned. Reduction of Order applied to generates the second basis element — the factor is not arbitrary but forced by the deficiency.

Proof for Characteristic Equation

Claim. Every solution of is (distinct roots) or (repeated), where solve .

Proof. Since , , the operator factors: where . So the equation is .

Let be any solution and set . Then , i.e. . Multiply by ; by the product rule , so is a constant and . Then . Multiply by , again by the product rule: Integrate:

  • : , so .
  • : exponent is , so , giving .

Every step is an equivalence, so these are all the solutions.

Undetermined Coefficients

For nice forcing — polynomials, exponentials, sines/cosines, and their products — guess a of the same functional shape and solve for the coefficients.

Forcing Trial
(degree )
or
product of aboveproduct of trials

[!tip] The resonance modification If your trial already solves the homogeneous equation, it contributes nothing. Multiply by (or for a double root) until the overlap is killed. This -bump is the same mechanism as the repeated-root case — both are symptoms of resonance.

Variation of Parameters

The general-purpose method for any continuous forcing , given a fundamental pair . With Wronskian :

Strictly more powerful than undetermined coefficients (no restriction on ), but the integrals are often nastier. Use it when is something like or that has no finite family of derivatives.

[!note] Conceptual content The method promotes the constants in to functions , then imposes the convenience constraint to close the system. It is the ODE shadow of expanding the forcing in the basis of homogeneous solutions.

Reduction of Order

If one solution is known, the substitution collapses the second-order equation to a first-order equation in . This is how you manufacture the missing basis vector when the characteristic method degenerates, and the conceptual seed of variation of parameters.

Cauchy–Euler Equation

The variable-coefficient form where each derivative's coefficient matches its order. Two equivalent routes:

  • Direct ansatz: try , yielding the indicial equation .
  • Substitution : transforms the whole equation into constant coefficients in , recovering Characteristic Equation.

The repeated-root and complex-root cases mirror the constant-coefficient ones, with playing the role of and replacing the oscillatory terms.

Order-Reduction Meta-Tricks

These are not tied to linearity and are the main hope for nonlinear second-order problems.

Autonomous / Missing-Variable Reduction

Set . Two distinct cases depending on what's absent:

[!note] Two reduction patterns Independent variable missing (): use the chain-rule identity to convert into a first-order ODE in . Dependent variable missing (): treat directly as the unknown, giving a first-order ODE in .

The first pattern is the workhorse for conservative mechanical systems — it is literally how you derive energy conservation, since integrates to .

Laplace Transforms

For linear constant-coefficient initial value problems, especially with discontinuous, piecewise, or impulsive (-function) forcing. The transform converts the whole IVP into algebra:

Solve algebraically for , then invert (partial fractions + table). The decisive advantage is that initial conditions are baked in automatically — no solving for at the end — and the Heaviside Step Function / Dirac Delta forcing terms that break undetermined coefficients are handled cleanly.

[!tip] When to reach for Laplace The moment you see a forcing term that switches on at , a square pulse, or an impulse. Variation of parameters can technically handle these but turns into a piecewise integration nightmare; Laplace is built for it.

Synthesis — Method Selection Map

The practical skill is routing, not computation. Compressed decision logic:

If the equation is...Reach for...
1st order, factors into -part × -partSeparable
1st order, linear ()Integrating factor
1st order, , Exact
1st order, RHS depends on Homogeneous sub
1st order, Bernoulli sub
2nd order linear, const coeff, homogeneousCharacteristic equation
2nd order linear, nice forcingUndetermined coefficients
2nd order linear, arbitrary forcingVariation of parameters
2nd order linear, Cauchy–Euler
One solution already knownReduction of order
or explicitly missing substitution
Linear IVP, discontinuous/impulsive forcingLaplace transform

[!note] The deep through-line Strip away the names and there are really only three moves: separate (decouple the variables), linearize (substitute away a nonlinearity), and reduce order (trade a high-order ODE for lower-order ones). Every technique above is one of these three wearing problem-specific clothing. This is worth keeping in mind because the same trinity reappears in PDEs (separation of variables, linearization about equilibria, method of characteristics) and in dynamical-systems reduction generally.