One second-order equation, three eigenvalue cases, solved end to end
Dr. Mohamed Mabrok · Qatar University
Why Turn a Good Equation Into a System?
You can already solve $y'' + 5y' + 6y = 0$ with the characteristic equation. So why rewrite it
as two equations and bring in eigenvalues?
Because the world is coupled
Two tanks, two masses, an RLC network. Those are systems from the start,
and there is no single scalar equation to write.
Because computers need it
Every numerical solver you will ever call — Runge–Kutta, MATLAB's
ode45, SciPy — takes first-order systems only. This conversion is what you do before you type.
Because it shows you the picture
The eigenvalues tell you the behaviour before you solve: settles, oscillates,
blows up. The scalar method hides that.
Today
One recipe, then the same second-order equation solved three times — once for each thing the
eigenvalues can do. Same initial conditions every time, so only the case changes.
The Conversion Recipe
The rule is always the same: name every derivative below the highest one.
1 Set $x_1 = y$, $x_2 = y'$ (for order $n$, go up to $x_n = y^{(n-1)}$)
2 Differentiate each one. Every $x_k'$ is simply the next $x$.
3 For the last one, use the original equation to replace $y''$.
$x_1' = x_2$ is not a modelling assumption. It is just the sentence "the derivative of $y$ is $y'$",
written down. Half of this conversion is bookkeeping.
The Companion Matrix
Write $\;y'' + p\,y' + q\,y = 0\;$ in matrix form and you always get the same shape:
That is exactly the characteristic equation you would have written in Chapter 2.
Converting to a system does not change the mathematics at all — it changes what you can see.
Your eigenvalues are your old roots $r$, wearing a different hat.
A Shortcut You Should Know
For a companion matrix you never have to solve for the eigenvector. It is always the same.
The middle step is where the characteristic equation earns its keep: $\lambda^2 = -q - p\lambda$
is exactly $\lambda^2 + p\lambda + q = 0$ rearranged.
And it makes sense
The eigenvector is $(y, y')$ for the solution $y = e^{\lambda t}$. Of course the second entry is
$\lambda$ times the first — differentiating $e^{\lambda t}$ multiplies it by $\lambda$.
Three Cases, and Only Three
A real quadratic has a discriminant. That is all that stands between you and the answer.
$p^2 - 4q \gt 0$
Distinct real Two eigenvalues, two eigenvectors. The easy one.
$p^2 - 4q = 0$
Repeated One eigenvalue, and — the whole difficulty — often only one eigenvector.
$p^2 - 4q = 25 - 24 = 1 \gt 0$. Two distinct real roots, exactly as promised — and both negative,
so we already know the answer decays before we have written it down.
Problem 1 — Eigenvectors
Step 3. Use the shortcut $\mathbf{v} = (1, \lambda)^T$ — but let us do one the long way first, to see it work.
$y = x_1 = c_1 e^{-2t} + c_2 e^{-3t}$. That is precisely what Chapter 2 would have given you.
The system did not find a different answer — it found the same answer, with the velocity carried along underneath.
Problem 1 — Initial Conditions
Step 5. Put $t = 0$ and match $\mathbf{x}(0) = (1, 0)^T$.
$y'(t) = -6e^{-2t} + 6e^{-3t} = 6e^{-3t}(1 - e^{t})$, so $y'(0) = 0$ and $y' \lt 0$ after that ✓
Substituting into $y'' + 5y' + 6y$ gives zero ✓
Stable node
Two negative real eigenvalues. Every trajectory walks into the origin without ever turning around.
The $e^{-3t}$ piece dies first; the long-run behaviour belongs to $\lambda = -2$, the
slower eigenvalue.
$p^2 - 4q = 16 - 16 = 0$. One eigenvalue, $\lambda = -2$, repeated twice.
We need two independent solutions and we have been handed one eigenvalue. This is the interesting case.
But look for a second one. $(A+2I)\mathbf{v} = \mathbf{0}$ means $2v_1 + v_2 = 0$ — a single line through
the origin. Every solution is a multiple of $(1,-2)^T$.
The matrix is defective
Algebraic multiplicity 2, geometric multiplicity 1. We are one solution short, and no amount of
staring at $(A+2I)\mathbf{v}=\mathbf{0}$ will produce it. Guessing a second $e^{-2t}\mathbf{w}$
fails too: it would have to be a multiple of the first.
Problem 2 — The Generalized Eigenvector
So we stop asking for zero, and ask for $\mathbf{v}$ instead:
The two agree — and they agree only because $A\mathbf{w} = \lambda\mathbf{w} + \mathbf{v}$.
So that is the answer to "why the extra $t$"
In Chapter 2 you were told to multiply by $t$ when roots repeat. Here you can see what the $t$ is:
it is the trace of a missing eigenvector, and $\mathbf{w}$ is what stands in for it.
$y(0) = 1$ ✓ and $y'(t) = -4t\,e^{-2t}$, so $y'(0) = 0$ ✓
Chapter 2 would write $y = (A + Bt)e^{-2t}$ and get $A = 1$, $B = 2$. Same answer ✓
Problem 2 — The Picture
No overshoot — check the derivative
$y' = -4t\,e^{-2t}$, which is negative for every $t \gt 0$. The $t$ does not make it rise.
With this starting data the solution falls from 1 and never turns.
What the $t$ does instead: it slows the fall
At $t = 0.5$, Problem 1 is at $0.657$ while Problem 2 is still at $0.736$. At $t = 1$: $0.306$ against $0.406$.
The repeated root is the exact borderline — the slowest decay you can have without the system starting to oscillate.
In Chapter 2's language, these three problems are overdamped, critically damped
and underdamped.
Real part $-1$: decay at rate $e^{-t}$. Imaginary part $2$: oscillation at frequency 2.
You already know the answer looks like a fading wobble — the algebra only fills in the amplitudes.
Problem 3 — The Complex Eigenvector
Take just one of the pair — $\lambda = -1 + 2i$. The conjugate gives nothing new.
$A$ has real entries. So if $\mathbf{z}$ solves $\mathbf{x}' = A\mathbf{x}$, then its real part and
its imaginary part each solve it separately. Two real solutions, out of one complex one.
Problem 3 — Splitting With Euler
Expand, using $e^{(-1+2i)t} = e^{-t}(\cos 2t + i\sin 2t)$:
Same equation shape, same initial conditions, three different lives
Every one of them decays, because every eigenvalue has negative real part. And the first two never turn
back at all — only the complex pair crosses zero. These are the three damping regimes from Chapter 2,
now readable straight off the eigenvalues.
The Method, in Six Lines
1 Name the lower derivatives: $x_1 = y$, $x_2 = y'$.
2 Write $\mathbf{x}' = A\mathbf{x}$ with the companion matrix.
3 Solve $\det(A - \lambda I) = 0$ — your old characteristic equation.
4 Eigenvectors are $(1, \lambda)^T$. If a root repeats, solve $(A-\lambda I)\mathbf{w} = \mathbf{v}$ for the missing direction.
5 Build $\mathbf{x}$: $e^{\lambda t}\mathbf{v}$ for each root, $e^{\lambda t}(t\mathbf{v}+\mathbf{w})$ for a repeat, real and imaginary parts for a complex pair.
6 Fit the constants at $t = 0$, then read $y = x_1$.
Four Ways This Goes Wrong
Sign slip in the bottom row
$y'' + 5y' + 6y = 0$ gives $y'' = -6y - 5y'$. The entries are $-q$ and $-p$, both negative here.
Moving the terms across is where marks disappear.
Using $e^{\lambda t}\mathbf{w}$ for the repeated case
The second solution is $e^{\lambda t}(t\mathbf{v} + \mathbf{w})$. Drop the $t\mathbf{v}$
and it simply is not a solution — substitute it and the $\mathbf{v}$ term has nothing to cancel against.
Using both complex conjugates
$\lambda$ and $\bar\lambda$ give the same two real solutions. Take one, split it into
real and imaginary parts, and stop.
Forgetting that $y$ is only the first component
You solved for $\mathbf{x} = (y, y')^T$. The answer to the original question is $x_1$.
The second component is a free bonus: the velocity.
Why This Was Worth the Trouble
It scales
A fourth-order equation becomes a $4\times4$ system by exactly the same recipe. Two coupled
second-order equations become a $4\times4$ system too — and there is no scalar method for those at all.
It is what the computer wants
Hand $\mathbf{x}' = A\mathbf{x}$ and $\mathbf{x}(0)$ to any solver and it runs. That is why this
conversion is the first thing done in every simulation you will ever write.
And it tells you the answer before you have one
Eigenvalues negative and real: it settles quietly. Negative with an imaginary part: it rings, then settles.
Any eigenvalue with a positive real part: it runs away, and no choice of initial condition will save it.
You can say all of that from $\det(A - \lambda I) = 0$, before solving anything.
What To Take Away
The conversion is bookkeeping
Name the lower derivatives. The first row writes itself; the last row is the original equation rearranged.
Nothing is lost
The companion matrix has the same characteristic equation. Eigenvalues are your old roots. The first component is your old answer.
The repeat is the only hard case
One eigenvector short, so you chase it with $(A-\lambda I)\mathbf{w} = \mathbf{v}$. That is where the $t$ in Chapter 2 came from.
Complex means rotation
Take one eigenvalue, expand with Euler, keep the real and imaginary parts. Real part decays, imaginary part spins.
Convert. Find the eigenvalues. Build. Fit. Read off $x_1$.