STEMviz
Mathematics · Differential Equations and Complex Analysis

Higher-Order Linear Equations with Constant Coefficients

Solves nth-order linear constant-coefficient homogeneous equations via the characteristic polynomial, covering distinct, repeated, and complex conjugate roots, built on the Wronskian and superposition.

Higher-Order Linear Equations with Constant Coefficients

This chapter moves from first-order to nnth-order linear equations, and specialises immediately to the case most of physics and engineering actually needs: constant coefficients. The remarkable fact proved here is that solving such an equation reduces entirely to algebra — factoring a polynomial — rather than to any new integration technique. The chapter builds the linear-algebra scaffolding (linear independence, the Wronskian, superposition) that makes precise why a handful of building-block solutions assembles into the complete general solution, then works out all three cases the characteristic polynomial's roots can take.

Have to hand: factoring and the quadratic formula, complex numbers and Euler's formula eiθ=cos⁡θ+isin⁡θe^{i\theta}=\cos\theta+i\sin\theta (used freely here; Chapter 10 revisits it rigorously), and the determinant of a 2×22\times2 (or n×nn\times n) matrix.

1. The General Linear Equation and Superposition

An nnth-order linear ODE has the form

an(x)y(n)+an−1(x)y(n−1)+⋯+a1(x)y′+a0(x)y=g(x).a_n(x)y^{(n)} + a_{n-1}(x)y^{(n-1)} + \cdots + a_1(x)y' + a_0(x)y = g(x).

It is homogeneous (zero forcing term — the Chapter 2 sense of the word) if g(x)≡0g(x)\equiv 0, and has constant coefficients if every aia_i is a constant. This chapter treats

any(n)+an−1y(n−1)+⋯+a1y′+a0y=0,an≠0, ai constant.a_n y^{(n)} + a_{n-1}y^{(n-1)} + \cdots + a_1 y' + a_0 y = 0, \qquad a_n\ne 0,\ a_i \text{ constant}.

Superposition principle. If y1,…,yny_1,\dots,y_n are each solutions of a linear homogeneous equation, then so is any linear combination c1y1+⋯+cnync_1y_1+\cdots+c_ny_n. This follows immediately from linearity of the differential operator L[y]=any(n)+⋯+a0yL[y]=a_ny^{(n)}+\cdots+a_0y: L[c1y1+⋯+cnyn]=c1L[y1]+⋯+cnL[yn]=0L[c_1y_1+\cdots+c_ny_n] = c_1L[y_1]+\cdots+c_nL[y_n] = 0.

Chapter 1's existence-uniqueness theory extends to this setting: an IVP for an nnth-order linear equation with continuous coefficients and nn initial conditions y(x0),y′(x0),…,y(n−1)(x0)y(x_0),y'(x_0),\dots,y^{(n-1)}(x_0) has a unique solution on the whole interval of continuity of the coefficients (no finite-time blow-up, unlike the nonlinear case). This chapter assumes that theorem and focuses on constructing the solution explicitly.

2. Linear Independence and the Wronskian

The general solution of an nnth-order linear homogeneous equation is a linear combination of nn solutions — but only if those nn solutions are genuinely independent of one another.

Definition. Functions y1,…,yny_1,\dots,y_n are linearly independent on an interval II if the only constants c1,…,cnc_1,\dots,c_n satisfying c1y1(x)+⋯+cnyn(x)=0c_1y_1(x)+\cdots+c_ny_n(x)=0 for every x∈Ix\in I are c1=⋯=cn=0c_1=\cdots=c_n=0.

The practical test uses the Wronskian

W(y1,…,yn)(x)=det⁡(y1y2⋯yny1′y2′⋯yn′⋮⋮y1(n−1)y2(n−1)⋯yn(n−1)).W(y_1,\dots,y_n)(x) = \det\begin{pmatrix} y_1 & y_2 & \cdots & y_n \\ y_1' & y_2' & \cdots & y_n' \\ \vdots & & & \vdots \\ y_1^{(n-1)} & y_2^{(n-1)} & \cdots & y_n^{(n-1)} \end{pmatrix}.

Theorem. If y1,…,yny_1,\dots,y_n solve the same nnth-order linear homogeneous equation with continuous coefficients on II, then either W≡0W\equiv 0 on II (and the yiy_i are linearly dependent) or W(x)≠0W(x)\ne 0 for every x∈Ix\in I (and the yiy_i are linearly independent).

Proof sketch. If the yiy_i were linearly dependent, some nontrivial combination vanishes identically, and the same combination of their derivatives up to order n−1n-1 also vanishes identically, making the columns of the Wronskian matrix linearly dependent at every xx, so W≡0W\equiv 0. Conversely, one shows WW itself satisfies a first-order linear ODE (Abel's formula, W′=−an−1anWW'=-\dfrac{a_{n-1}}{a_n}W), whose solution W(x)=W(x0)e−∫(an−1/an)dxW(x)=W(x_0)e^{-\int (a_{n-1}/a_n)dx} is an exponential and therefore either identically zero (if W(x0)=0W(x_0)=0) or never zero. ■\blacksquare

This theorem is why checking nn solutions' Wronskian at a single convenient point (often x=0x=0) is enough to certify independence everywhere.

3. The Characteristic Equation

Seek solutions of any(n)+⋯+a0y=0a_ny^{(n)}+\cdots+a_0y=0 of the trial form y=erxy=e^{rx}. Since y(k)=rkerxy^{(k)}=r^ke^{rx}, substituting gives

erx(anrn+an−1rn−1+⋯+a1r+a0)=0.e^{rx}\bigl(a_nr^n + a_{n-1}r^{n-1}+\cdots+a_1r+a_0\bigr) = 0.

As erx≠0e^{rx}\ne 0, this holds exactly when rr is a root of the characteristic (auxiliary) polynomial

anrn+an−1rn−1+⋯+a1r+a0=0.a_nr^n+a_{n-1}r^{n-1}+\cdots+a_1r+a_0 = 0.

So: every root rr of this algebraic equation gives a solution y=erxy=e^{rx} of the differential equation — the entire problem of solving the ODE has been converted into the entirely algebraic problem of factoring a polynomial. By the fundamental theorem of algebra, the characteristic polynomial has exactly nn roots counted with multiplicity (possibly complex, possibly repeated), and the three cases below cover every possibility.

4. Case 1: Distinct Real Roots

If r1,…,rnr_1,\dots,r_n are real and all different, the nn functions er1x,…,ernxe^{r_1x},\dots,e^{r_nx} are linearly independent (their Wronskian is a nonzero multiple of the Vandermonde determinant in the rir_i, which is nonzero exactly because the rir_i are distinct), so the general solution is

y(x)=c1er1x+c2er2x+⋯+cnernx.y(x) = c_1e^{r_1x}+c_2e^{r_2x}+\cdots+c_ne^{r_nx}.

Worked example. Solve y′′−y′−6y=0y''-y'-6y=0. Characteristic equation: r2−r−6=0r^2-r-6=0, factoring as (r−3)(r+2)=0(r-3)(r+2)=0, so r=3,−2r=3,-2. General solution:

y(x)=c1e3x+c2e−2x.y(x) = c_1e^{3x}+c_2e^{-2x}.

5. Case 2: Repeated Real Roots

If rr is a root of multiplicity kk, the trial form erxe^{rx} only yields one independent solution where kk are needed. Reduction of order supplies the rest: given one solution y1=erxy_1=e^{rx} of a second-order equation, seek a second solution of the form y2=v(x)erxy_2=v(x)e^{rx} for an unknown function vv. Substituting into y′′+py′+qy=0y''+py'+qy=0 (with p,qp,q constants here) and using that rr is a repeated root of r2+pr+q=0r^2+pr+q=0 (so r=−p/2r=-p/2 and the first-derivative terms cancel), one finds v′′=0v''=0, i.e. v(x)=Ax+Bv(x)=Ax+B. Taking v=xv=x gives the second independent solution xerxxe^{rx}.

Pattern for multiplicity kk. A root rr repeated kk times contributes exactly the kk independent solutions

erx, xerx, x2erx, …, xk−1erx.e^{rx},\ xe^{rx},\ x^2e^{rx},\ \ldots,\ x^{k-1}e^{rx}.

Worked example. Solve y′′−6y′+9y=0y''-6y'+9y=0. Characteristic equation: r2−6r+9=(r−3)2=0r^2-6r+9=(r-3)^2=0, so r=3r=3 with multiplicity 22. General solution:

y(x)=c1e3x+c2xe3x.y(x) = c_1e^{3x}+c_2xe^{3x}.

6. Case 3: Complex Conjugate Roots

Since the characteristic polynomial has real coefficients, complex roots occur in conjugate pairs r=α±iβr=\alpha\pm i\beta (β≠0\beta\ne 0). The trial solutions e(α+iβ)xe^{(\alpha+i\beta)x} and e(α−iβ)xe^{(\alpha-i\beta)x} are complex-valued; by Euler's formula,

e(α±iβ)x=eαx(cos⁡βx±isin⁡βx).e^{(\alpha\pm i\beta)x} = e^{\alpha x}\bigl(\cos\beta x \pm i\sin\beta x\bigr).

Because the equation is linear with real coefficients, the real and imaginary parts of any complex solution are themselves real solutions (if L[u+iv]=0L[u+iv]=0 with u,vu,v real-valued and LL has real coefficients, then L[u]+iL[v]=0L[u]+iL[v]=0, and since L[u],L[v]L[u],L[v] are both real, each must vanish separately). Taking real and imaginary parts of e(α+iβ)xe^{(\alpha+i\beta)x} gives the two independent real solutions

eαxcos⁡βx,eαxsin⁡βx.e^{\alpha x}\cos\beta x, \qquad e^{\alpha x}\sin\beta x.

A complex conjugate pair repeated kk times contributes 2k2k real solutions by multiplying this pattern by 1,x,…,xk−11,x,\dots,x^{k-1}, exactly as in Case 2.

Worked example. Solve y′′+2y′+5y=0y''+2y'+5y=0. Characteristic equation: r2+2r+5=0r^2+2r+5=0, giving r=−2±4−202=−1±2ir=\dfrac{-2\pm\sqrt{4-20}}{2} = -1\pm 2i, so α=−1,β=2\alpha=-1,\beta=2. General solution:

y(x)=e−x(c1cos⁡2x+c2sin⁡2x).y(x) = e^{-x}\bigl(c_1\cos 2x + c_2\sin 2x\bigr).

7. Assembling the General Solution for Mixed Cases

A characteristic polynomial of degree nn in general has some distinct real roots, some repeated real roots, and some complex conjugate pairs (possibly repeated); the general solution is the sum of the contribution from each case, with nn arbitrary constants in total — guaranteed linearly independent as a full set by an extension of the Wronskian argument of Section 2.

Worked example (fourth order, mixed). Solve y(4)−y=0y^{(4)} - y = 0. Characteristic equation: r4−1=0r^4-1=0, factoring as (r2−1)(r2+1)=0(r^2-1)(r^2+1)=0, so r=1,−1r=1,-1 (real, distinct) and r=±ir=\pm i (complex, α=0,β=1\alpha=0,\beta=1). General solution:

y(x)=c1ex+c2e−x+c3cos⁡x+c4sin⁡x.y(x) = c_1e^{x}+c_2e^{-x}+c_3\cos x+c_4\sin x.

8. Common Exam Pitfalls

  • Forgetting the extra factor of xx (or x2,…x^2,\dots) for repeated roots. Writing y=c1e3x+c2e3xy=c_1e^{3x}+c_2e^{3x} for a double root r=3r=3 is wrong — the second term collapses into the first (they are linearly dependent), leaving only one arbitrary constant where two are needed; it must be c1e3x+c2xe3xc_1e^{3x}+c_2xe^{3x}.
  • Writing complex exponentials instead of the real sine/cosine form. y=c1e(α+iβ)x+c2e(α−iβ)xy=c_1e^{(\alpha+i\beta)x}+c_2e^{(\alpha-i\beta)x} is a valid complex general solution, but for a real-valued IVP the expected answer is the real form eαx(c1cos⁡βx+c2sin⁡βx)e^{\alpha x}(c_1\cos\beta x+c_2\sin\beta x) (with new, real constants related to but not identical to the complex c1,c2c_1,c_2).
  • Misreading the characteristic equation's sign convention. y′′+py′+qy=0y''+py'+qy=0 gives r2+pr+q=0r^2+pr+q=0 — the signs of p,qp,q carry over unchanged; a common error is flipping a sign when the original equation is written with a term moved to the other side.
  • Using the Wronskian test on functions that do not solve the same equation. The dichotomy "W≡0W\equiv0 or never zero" is a theorem about solutions of a common linear ODE; for arbitrary functions, WW can vanish at isolated points without implying global dependence or independence.
  • Dropping a root during factoring of a higher-degree characteristic polynomial. Always verify the number of roots found (with multiplicity) equals the degree nn of the polynomial — a degree-4 polynomial factored into only three roots signals an arithmetic slip.
  • Confusing "repeated root" multiplicity with the number of arbitrary constants needed overall. Every individual root (real or complex, simple or repeated) contributes exactly as many basis solutions as its multiplicity; the total across all roots must equal nn, matching the order of the equation.

Summary

  • Superposition: linear combinations of solutions of a linear homogeneous equation are themselves solutions, by linearity of the differential operator LL.
  • Linear independence is tested via the Wronskian; for solutions of a common linear equation with continuous coefficients, WW is either identically zero or never zero (Abel's formula).
  • Characteristic equation: trying y=erxy=e^{rx} converts any(n)+⋯+a0y=0a_ny^{(n)}+\cdots+a_0y=0 into the polynomial equation anrn+⋯+a0=0a_nr^n+\cdots+a_0=0.
  • Distinct real roots rir_i contribute erixe^{r_ix} each; repeated real roots of multiplicity kk contribute erx,xerx,…,xk−1erxe^{rx},xe^{rx},\dots,x^{k-1}e^{rx} (derived via reduction of order); complex conjugate pairs α±iβ\alpha\pm i\beta contribute the real solutions eαxcos⁡βx, eαxsin⁡βxe^{\alpha x}\cos\beta x,\,e^{\alpha x}\sin\beta x (from Euler's formula and taking real/imaginary parts), each repeated similarly if the pair itself is repeated.
  • The general solution sums the contributions of all roots, with exactly nn arbitrary constants for an nnth-order equation, fixed by nn initial conditions via the (assumed) existence-uniqueness theorem for linear equations.