Flow Lab

Syllabus / Module 7: Systems of ODEs & Dynamical Systems

Lesson 7.4

Complex & Repeated Eigenvalues

Spiral and center solutions from complex eigenvalues; generalized eigenvectors for repeated eigenvalues.

Written byClaude Sonnet

🌊
Why this matters for simulation: Dutch roll — an aircraft's wobbly yaw-roll oscillation — is a complex eigenvalue pair.

By the end of this lesson you can…

  • Turn the complex solution $e^{\lambda t}\mathbf v$ for $\lambda = \alpha \pm i\beta$ into two real solutions using Euler's formula, and fit initial data with a $2\times2$ linear solve.
  • Read the frequency $\beta$, the period $2\pi/\beta$ and the decay per turn $e^{2\pi\alpha/\beta}$ from the eigenvalue, and say what $\mathbf a = \mathrm{Re}\,\mathbf v$ and $\mathbf b = \mathrm{Im}\,\mathbf v$ do to the shape of the spiral.
  • Separate the two repeated-eigenvalue cases: $A = \lambda I$ (star node) and the defective case with one eigenvector.
  • Find a generalized eigenvector $\mathbf w$ with $(A - \lambda I)\mathbf w = \mathbf v$ and derive the solution $e^{\lambda t}(c_1\mathbf v + c_2(t\mathbf v + \mathbf w))$.
  • Locate the transient hump of $t e^{\lambda t}$ (peak at $t = 1/|\lambda|$) and recognise critical damping as a defective node.
  • Measure how the eigenvector matrix becomes ill-conditioned as a defective matrix is approached, and say why codes prefer Schur or expm to eig there.
On this page
·
  1. Complex eigenvalues: from one complex solution to two real ones
  2. Frequency, decay and shape
  3. Repeated eigenvalues
  4. Critical damping is a defective node
  5. Numerics: nearly repeated eigenvalues
  6. Computing it
  7. Concept checks
  8. Problems
  9. Key Takeaways

7.2 Linear Systems & the Eigenvalue Method solved x′=Ax\mathbf x' = A\mathbf x for real, distinct eigenvalues, and 7.3 Phase Portraits & the Trace–Determinant Plane classified every 2×22\times2 picture from TT and DD, taking on trust that a complex pair gives a spiral at rate α\alpha and speed β\beta. This lesson cashes both cheques: the real form of the spiral solutions, and the missing second solution when an eigenvalue is repeated. Both cases matter for simulation. A decaying swirl, a lightly damped aircraft wobble and a vortex are complex pairs, and critical damping, the best-behaved oscillator, is a repeated eigenvalue.

▶ Video Complex eigenvectors become spirals; a missing eigenvector becomes a factor of tcaptions only
Transcript
  1. Last lesson took a spiral on trust. Here is the proof. The matrix with rows 0.8, minus 2 and 1, minus 1.2 has eigenvalues minus 0.2 plus or minus i and eigenvector 2, 1 minus i: real part a, 2, 1; imaginary part b, 0, minus 1.
  2. The complex function e to the lambda t times v solves the system. Euler's formula splits it into cosine plus i sine, and since A is real, the real and imaginary parts are each a solution: x one starts at a, x two at b.
  3. Starting from 1, 1 we need c one a plus c two b to match. Two c one is 1 and c one minus c two is 1, so c is 0.5, minus 0.5. The solution spirals inward, passing minus 0.2466, 0.4424 at t equals 1.
  4. Each solution rotates inside a decay envelope. After one period, 2 pi over beta, x of P is e to the alpha P times x of 0, so the factor per turn is e to the 2 pi alpha over beta: 0.28461 here. The case minus 0.5, 2 gives 0.20788; alpha 0 gives exactly 1.
  5. The shape lives in a and b. A acts on them as a rotation-scaling block, and a cos s plus b sin s is an ellipse through a and b. Last lesson's matrix gives circles; Example 1 is tilted. The factor stays 0.28461.
  6. Now a repeated eigenvalue, T squared equals 4 D. The null space of A minus lambda I decides. If A equals lambda I, every trajectory is a straight ray: a star node. Otherwise there is one eigenline and a missing solution: a defective node.
  7. Guess a factor t: x equals e to the lambda t times t v plus w. The t terms match, and the rest needs A minus lambda I times w equals v, a generalized eigenvector. So x is e to the lambda t times c one plus c two t, v, plus c two w.
  8. Example 2: trace minus 4, determinant 4, so lambda is minus 2 twice. One eigenvector, v equals 1, 1, and w equals 0, 1. Starting at w, x is e to the minus 2 t times t, t plus 1: 0.18394, 0.55182 at t 0.5; 0.13534, 0.27067 at t 1.
  9. The term t e to the lambda t starts at zero and decays, so it must rise first, peaking at t equals 1 over the size of lambda with height 1 over lambda e: 0.5 and 0.18394 for minus 2. From x zero equal to 1, 0, there is a trough of minus 0.02489 at t 1.5.
  10. In the basis v, w, A v is lambda v and A w is v plus lambda w, so A is P J P inverse. The exponential of J is e to the lambda t times 1, t, 0, 1: the same t. For Example 2 at 0.5: e to the minus 1 times 1, 0.5, 0, 1.
  11. Critical damping is a defective node. For y double prime plus 2 y prime plus y, lambda is minus 1 twice, v is 1, minus 1, w is 1, 0, and y is 1 plus t times e to the minus t. y of 1 is 0.73576, y of 2 is 0.40601; the velocity humps at 0.36788.
  12. Perturb Example 2 by delta: lambda is minus 2 plus or minus root delta, with nearly parallel eigenvectors. The condition number of V is 19.95, 200 and 2000 for delta 10 to the minus 2, minus 4, minus 6: about 2 over root delta, and about 10 to the 8 when defective. From memory, codes prefer Schur or expm.
  13. To sum up. A pure imaginary pair is a vortex; the Dutch roll, from memory, is a lightly damped pair with factor near 1. A complex pair gives real and imaginary parts, factor 0.28461 here. A repeated eigenvalue is a star or defective node; critical damping is defective. Next: the matrix exponential.

Complex eigenvalues: from one complex solution to two real ones

A real matrix with T2<4DT^2 \lt 4D has eigenvalues λ=α±iβ\lambda = \alpha \pm i\beta and complex eigenvectors, and the algebra is the same as before: (A−λI)v=0(A - \lambda I)\mathbf v = 0. Write v=a+ib\mathbf v = \mathbf a + i\mathbf b with real vectors a,b\mathbf a, \mathbf b. The complex function eλtve^{\lambda t}\mathbf v solves x′=Ax\mathbf x' = A\mathbf x, but we want real solutions. Euler’s formula (see 1.7 Complex Eigenvalues & Rotation) gives eλt=eαt(cos⁡βt+isin⁡βt)e^{\lambda t} = e^{\alpha t}(\cos\beta t + i\sin\beta t), so

eλtv=eαt[(acos⁡βt−bsin⁡βt)+i (asin⁡βt+bcos⁡βt)],e^{\lambda t}\mathbf v = e^{\alpha t}\big[(\mathbf a\cos\beta t - \mathbf b\sin\beta t) + i\,(\mathbf a\sin\beta t + \mathbf b\cos\beta t)\big],

since i⋅i bsin⁡βt=−bsin⁡βti\cdot i\,\mathbf b\sin\beta t = -\mathbf b\sin\beta t. Because AA is real, A(Re xc)=Re(Axc)A(\mathrm{Re}\,\mathbf x_c) = \mathrm{Re}(A\mathbf x_c) and likewise for Im\mathrm{Im}, so the real part and the imaginary part of any complex solution are each a real solution. The two real solutions are

x1=eαt(acos⁡βt−bsin⁡βt),x2=eαt(asin⁡βt+bcos⁡βt).\mathbf x_1 = e^{\alpha t}(\mathbf a\cos\beta t - \mathbf b\sin\beta t), \qquad \mathbf x_2 = e^{\alpha t}(\mathbf a\sin\beta t + \mathbf b\cos\beta t).

The conjugate eigenvalue λˉ\bar\lambda with vˉ\bar{\mathbf v} only returns the conjugate solution, whose real and imaginary parts are x1\mathbf x_1 and −x2-\mathbf x_2: nothing new. They are independent because at t=0t = 0 they equal a\mathbf a and b\mathbf b, and these are independent: if b=ka\mathbf b = k\mathbf a then v=(1+ik)a\mathbf v = (1 + ik)\mathbf a, a complex multiple of a real vector, which would make λ\lambda real. So the general real solution is x=c1x1+c2x2\mathbf x = c_1\mathbf x_1 + c_2\mathbf x_2, and since x(0)=c1a+c2b\mathbf x(0) = c_1\mathbf a + c_2\mathbf b, fitting initial data is the 2×22\times2 solve [a b] c=x0[\mathbf a\ \mathbf b]\,\mathbf c = \mathbf x_0.

Example 1. Take A=(0.8−21−1.2)A = \begin{pmatrix}0.8&-2\\1&-1.2\end{pmatrix}, with T=−0.4T = -0.4, D=1.04D = 1.04 and T2−4D=−4T^2 - 4D = -4, so λ=−0.2±i\lambda = -0.2 \pm i (the same eigenvalues as the previous lesson’s spiral). Row 1 of A−λIA - \lambda I is (1−i, −2)(1 - i,\ -2), so (1−i)v1=2v2(1 - i)v_1 = 2v_2 and v=(2, 1−i)\mathbf v = (2,\ 1 - i); row 2 checks: 2+(−1−i)(1−i)=2−2=02 + (-1-i)(1-i) = 2 - 2 = 0. So a=(2,1)\mathbf a = (2, 1), b=(0,−1)\mathbf b = (0, -1), and

x1=e−0.2t(2cos⁡tcos⁡t+sin⁡t),x2=e−0.2t(2sin⁡tsin⁡t−cos⁡t).\mathbf x_1 = e^{-0.2t}\begin{pmatrix}2\cos t\\ \cos t + \sin t\end{pmatrix},\qquad \mathbf x_2 = e^{-0.2t}\begin{pmatrix}2\sin t\\ \sin t - \cos t\end{pmatrix}.

For x0=(1,1)\mathbf x_0 = (1, 1): 2c1=12c_1 = 1 and c1−c2=1c_1 - c_2 = 1 give c=(0.5,−0.5)\mathbf c = (0.5, -0.5), and the combination simplifies to x(t)=e−0.2t(cos⁡t−sin⁡t, cos⁡t)\mathbf x(t) = e^{-0.2t}(\cos t - \sin t,\ \cos t). At t=1t = 1 this is (−0.2466,0.4424)(-0.2466, 0.4424), which block A reproduces from the formula, from eAte^{At} and from RK4.

Frequency, decay and shape

Each real solution is a rotation inside a decay envelope. The angular frequency is β\beta, the period is P=2π/βP = 2\pi/\beta, and the number of turns per unit time is β/2π\beta/2\pi (0.159150.15915 for β=1\beta = 1). After exactly one period the cosines and sines are back at their starting values, so x(P)=eαPx(0)\mathbf x(P) = e^{\alpha P}\mathbf x(0), a vector identity and not just a statement about length. The factor per turn is therefore

ρ=e2πα/β.\rho = e^{2\pi\alpha/\beta}.

For α=−0.2\alpha = -0.2, β=1\beta = 1 this is 0.284610.28461, the number the previous lesson measured, and here x(2π)=0.28461 (1,1)\mathbf x(2\pi) = 0.28461\,(1, 1), exactly parallel to x0=(1,1)\mathbf x_0 = (1,1); block A and the sim’s yellow dot both show (0.28461,0.28461)(0.28461, 0.28461).

There is a one-line rule behind this. Comparing real and imaginary parts of A(a+ib)=(α+iβ)(a+ib)A(\mathbf a + i\mathbf b) = (\alpha + i\beta)(\mathbf a + i\mathbf b) gives Aa=αa−βbA\mathbf a = \alpha\mathbf a - \beta\mathbf b and Ab=βa+αbA\mathbf b = \beta\mathbf a + \alpha\mathbf b: in the basis (a,b)(\mathbf a, \mathbf b) the matrix acts as the rotation-scaling block C=(αβ−βα)C = \begin{pmatrix}\alpha&\beta\\-\beta&\alpha\end{pmatrix}, so A=PCP−1A = PCP^{-1} with P=[a b]P = [\mathbf a\ \mathbf b], the real form of the linear-algebra lesson. For Example 1, Aa=(−0.4,0.8)A\mathbf a = (-0.4, 0.8) and −0.2 (2,1)−(0,−1)=(−0.4,0.8)-0.2\,(2, 1) - (0, -1) = (-0.4, 0.8). The sim prints both residuals (zero) for every setting of its sliders.

The rotation is not a circle in general. The curve acos⁡s+bsin⁡s\mathbf a\cos s + \mathbf b\sin s (the orbit at α=0\alpha = 0) is an ellipse through a\mathbf a and b\mathbf b, and the spiral is that ellipse shrunk by eαte^{\alpha t} as it is traced: the motion goes from a\mathbf a at t=0t = 0 to −b-\mathbf b a quarter turn later. The matrix of the previous lesson, (−0.2−11−0.2)\begin{pmatrix}-0.2&-1\\1&-0.2\end{pmatrix}, has a=(1,0)\mathbf a = (1, 0) and b=(0,−1)\mathbf b = (0, -1), orthogonal and equal in length, so its ellipses are circles. Our Example 1 has a=(2,1)\mathbf a = (2, 1) and b=(0,−1)\mathbf b = (0, -1), and the spiral is tilted and stretched. The shape lives in a,b\mathbf a, \mathbf b; the speed and decay live in β,α\beta, \alpha; and ρ\rho depends on the shape not at all. To see it, load the lab at tilt 0 and tilt 1 and read the same 0.284610.28461.

◆ Interactive Spirals, defective nodes and star nodes: drag the start point and read the eigen-structure

Loading simulation…

What to try. (1) Complex mode: move the tilt slider from 0 to 1 and watch the dashed ellipse and the spiral change shape while the readout’s factor per turn stays 0.284610.28461. (2) Put α=−0.5\alpha = -0.5, β=2\beta = 2: the factor per turn is 0.207880.20788 and the period 3.14163.1416. (3) Put α=0\alpha = 0, β=2\beta = 2, tilt 0: closed circles, factor 1.000001.00000, the vortex u=(−2y,2x)\mathbf u = (-2y, 2x). (4) Defective and critical modes: drag the start point on and off the dashed line.

Repeated eigenvalues

If λ\lambda is a double root of λ2−Tλ+D\lambda^2 - T\lambda + D (so T2=4DT^2 = 4D), there are two cases, decided by the null space of A−λIA - \lambda I. Case 1: diagonalizable. If A−λI=0A - \lambda I = 0, i.e. A=λIA = \lambda I, every vector is an eigenvector, x(t)=eλtx0\mathbf x(t) = e^{\lambda t}\mathbf x_0, and every trajectory is a straight ray: the star node. Case 2: defective. Otherwise A−λIA - \lambda I is a nonzero matrix with a one-dimensional null space: one eigenline, a single solution eλtve^{\lambda t}\mathbf v of the usual kind, and a missing second one.

Where the second solution comes from. Guess that the extra solution has a factor tt: try x=eλt(tv+w)\mathbf x = e^{\lambda t}(t\mathbf v + \mathbf w). Then x′=eλt[λ(tv+w)+v]\mathbf x' = e^{\lambda t}[\lambda(t\mathbf v + \mathbf w) + \mathbf v], while Ax=eλt(tλv+Aw)A\mathbf x = e^{\lambda t}(t\lambda\mathbf v + A\mathbf w) because Av=λvA\mathbf v = \lambda\mathbf v. The terms in tt match on their own, and the rest requires

(A−λI) w=v.(A - \lambda I)\,\mathbf w = \mathbf v .

Such a w\mathbf w is a generalized eigenvector. It exists because for a 2×22\times2 matrix with a double root, Cayley–Hamilton gives (A−λI)2=0(A - \lambda I)^2 = 0: the image of N=A−λIN = A - \lambda I lies inside its null space, which is the line spanned by v\mathbf v, and the image is a line since N≠0N \neq 0, so v\mathbf v is in the image. Any w\mathbf w off the eigenline works; adding a multiple of v\mathbf v to w\mathbf w gives another valid choice and only reshuffles the constants. Then x1=eλtv\mathbf x_1 = e^{\lambda t}\mathbf v and x2=eλt(tv+w)\mathbf x_2 = e^{\lambda t}(t\mathbf v + \mathbf w) are independent (v,w\mathbf v, \mathbf w are, at t=0t = 0), and

x(t)=eλt(c1v+c2(tv+w))=eλt((c1+c2t)v+c2w),[v w] c=x0.\mathbf x(t) = e^{\lambda t}\big(c_1\mathbf v + c_2(t\mathbf v + \mathbf w)\big) = e^{\lambda t}\big((c_1 + c_2 t)\mathbf v + c_2\mathbf w\big),\qquad [\mathbf v\ \mathbf w]\,\mathbf c = \mathbf x_0 .

Example 2. A=(−31−1−1)A = \begin{pmatrix}-3&1\\-1&-1\end{pmatrix}: T=−4T = -4, D=4D = 4, T2−4D=0T^2 - 4D = 0, so λ=−2\lambda = -2 twice. A+2I=(−11−11)A + 2I = \begin{pmatrix}-1&1\\-1&1\end{pmatrix} is nonzero, so v=(1,1)\mathbf v = (1, 1) is the only eigenvector. Solve (A+2I)w=v(A + 2I)\mathbf w = \mathbf v: −w1+w2=1-w_1 + w_2 = 1, and w=(0,1)\mathbf w = (0, 1) works (block B prints (A+2I)w=(1,1)(A + 2I)\mathbf w = (1, 1) and (A+2I)2=0(A + 2I)^2 = 0). Starting from x0=w=(0,1)\mathbf x_0 = \mathbf w = (0,1) gives c=(0,1)\mathbf c = (0, 1) and x=e−2t(t,t+1)\mathbf x = e^{-2t}(t, t + 1). At t=0.5t = 0.5 this is (0.18394,0.55182)(0.18394, 0.55182) and at t=1t = 1 it is (0.13534,0.27067)(0.13534, 0.27067); formula, eAte^{At} and RK4 agree in block B.

The picture. Since x≈c2 t eλtv\mathbf x \approx c_2\,t\,e^{\lambda t}\mathbf v at late times, for λ<0\lambda \lt 0 every trajectory eventually runs into the origin tangent to the single eigenline, because the teλtvt e^{\lambda t}\mathbf v term dominates: that is the defective node of the previous lesson. Backwards in time the tvt\mathbf v term dominates again, so the curves come in from far away along the same line, on the opposite side, with a bend in between. The sim’s defective mode draws v\mathbf v dashed, w\mathbf w as an arrow, and the curves bending onto the line.

The hump. teλtt e^{\lambda t} is zero at t=0t = 0 and decays at the end, so it must rise first. Setting its derivative (1+λt)eλt(1 + \lambda t)e^{\lambda t} to zero gives the peak at t=1/∣λ∣t = 1/|\lambda| with height 1/(∣λ∣e)1/(|\lambda| e). For λ=−2\lambda = -2 that is t=0.5t = 0.5 and height 0.183940.18394, the value in the dashed curve of the sim and in block B. A stable defective system can therefore get larger before it decays: a transient hump. In general the v\mathbf v-coordinate is (c1+c2t)eλt(c_1 + c_2 t)e^{\lambda t}, with its extremum at t∗=1/∣λ∣−c1/c2t^* = 1/|\lambda| - c_1/c_2 if that is positive; the readout states it, and for x0=(1,0)\mathbf x_0 = (1, 0) in Example 2 (c=(1,−1)\mathbf c = (1, -1)) it is a trough of −0.02489-0.02489 at t=1.5t = 1.5.

Growing and stable cases. Nothing above used the sign of λ\lambda. For λ>0\lambda \gt 0 the same formulas describe a defective node that expands, which is the stable one traced backwards in time (A→−AA \to -A sends λ→−λ\lambda \to -\lambda, as the previous lesson noted); the hump is then simply monotone growth. For the star node the decay is the plain scalar one: after the e-folding time 1/∣λ∣1/|\lambda| (the sim prints it) every vector has shrunk by e−1e^{-1}, and no direction is special. The defective node is the opposite extreme: one direction is special, and everything else leans toward it.

Jordan form. In the basis (v,w)(\mathbf v, \mathbf w) we have Av=λvA\mathbf v = \lambda\mathbf v and Aw=v+λwA\mathbf w = \mathbf v + \lambda\mathbf w, so A=PJP−1A = PJP^{-1} with P=[v w]P = [\mathbf v\ \mathbf w] and

J=(λ10λ),eJt=eλt(1t01).J = \begin{pmatrix}\lambda & 1\\ 0 & \lambda\end{pmatrix}, \qquad e^{Jt} = e^{\lambda t}\begin{pmatrix}1 & t\\ 0 & 1\end{pmatrix}.

The second formula is stated here and derived in 7.5 The Matrix Exponential & Fundamental Matrices; the tt in the corner is the same tt as in tv+wt\mathbf v + \mathbf w. Block B finds P−1AP=JP^{-1}AP = J for Example 2 and prints eJ⋅0.5=(0.367880.1839400.36788)e^{J\cdot0.5} = \begin{pmatrix}0.36788&0.18394\\0&0.36788\end{pmatrix}, which is e−1e^{-1} times (10.501)\begin{pmatrix}1&0.5\\0&1\end{pmatrix}.

Coupled oscillators, previewed. Two masses on springs give a four-dimensional system whose eigenvalues come in pairs ±iωk\pm i\omega_k, one pair per normal mode: each mode is a center (α=0\alpha = 0, β=ωk\beta = \omega_k) in the sense above, and damping would add α<0\alpha \lt 0 to each. That is the subject of 14.1 Coupled Oscillators & Normal Modes.

Critical damping is a defective node

The scalar lesson 5.2 Constant Coefficients & the Characteristic Equation solved y′′+2y′+y=0y'' + 2y' + y = 0 with the repeated root r=−1r = -1 and the unexpected solution tertte^{rt}. Here is why. With x=(y,y′)\mathbf x = (y, y') the companion matrix is (01−1−2)\begin{pmatrix}0&1\\-1&-2\end{pmatrix}, with T=−2T = -2, D=1D = 1, double eigenvalue −1-1. A+I=(11−1−1)A + I = \begin{pmatrix}1&1\\-1&-1\end{pmatrix} has rank 1 (block C), so there is one eigenvector v=(1,−1)\mathbf v = (1, -1), and w=(1,0)\mathbf w = (1, 0) solves (A+I)w=v(A + I)\mathbf w = \mathbf v. For y(0)=1y(0) = 1, y′(0)=0y'(0) = 0 we get c=(0,1)\mathbf c = (0, 1) and y=(1+t)e−ty = (1 + t)e^{-t}, y′=−te−ty' = -te^{-t}: the tt is the defective factor. y(1)=0.73576y(1) = 0.73576 and y(2)=0.40601y(2) = 0.40601 match eAte^{At} and RK4. The velocity makes the hump of the previous paragraph, peaking in magnitude at t=1/∣λ∣=1t = 1/|\lambda| = 1 with 1/e=0.367881/e = 0.36788; this is the sim’s critical preset, whose readout gives the same extremum. In the (T,D)(T, D) plane this is the point where the damping parameter crosses the parabola, which the last lesson found fragile: slightly more damping gives a node, slightly less an oscillating spiral.

Numerics: nearly repeated eigenvalues

Perturb the defective matrix of Example 2 to Aδ=(−31−1+δ−1)A_\delta = \begin{pmatrix}-3&1\\-1+\delta&-1\end{pmatrix}: now T2−4D=4δT^2 - 4D = 4\delta, and for δ>0\delta \gt 0 the eigenvalues are −2±δ-2 \pm \sqrt\delta with eigenvectors (1,1±δ)(1, 1 \pm \sqrt\delta), nearly parallel. Block D measures the condition number of the unit-column eigenvector matrix: 19.9519.95, 200.00200.00 and 2000.002000.00 for δ=10−2,10−4,10−6\delta = 10^{-2}, 10^{-4}, 10^{-6}, close to 2/δ2/\sqrt\delta, and about 10810^{8} for the exactly defective matrix, where np.linalg.eig also splits the double eigenvalue into −2±2×10−8-2 \pm 2\times10^{-8}, a split that is rounding noise (this exact figure is platform dependent). The expansion coefficients blow up in the same way: with v±=(1,1±δ)\mathbf v_\pm = (1, 1 \pm \sqrt\delta) and start (0,1)(0, 1), c1=−c2=1/(2δ)=5,50,500c_1 = -c_2 = 1/(2\sqrt\delta) = 5, 50, 500 (block D), and the solution is the difference of two large, nearly equal terms,

x1(t)=e(−2+δ)t−e(−2−δ)t2δ  →  te−2t(δ→0),x_1(t) = \frac{e^{(-2+\sqrt\delta)t} - e^{(-2-\sqrt\delta)t}}{2\sqrt\delta} \;\to\; t e^{-2t} \quad (\delta \to 0),

the derivative of eλte^{\lambda t} with respect to λ\lambda: the tt factor is the limit of two merging exponentials. In this small example the computed VeΛtV−1V e^{\Lambda t}V^{-1} still agreed with expm to about 10−1410^{-14} (block D), so no disaster is shown; the worst-case bound grows like the condition number, and from memory, this is why production codes prefer the Schur decomposition (or a Padé expm), which uses orthogonal transformations and never forms a near-singular eigenvector matrix. The next lesson builds eAte^{At} without eigenvectors.

Computing it

🐍 PythonLab: complex solution against expm and RK4; defective solution, hump and Jordan form; critical damping; the conditioning of nearly repeated eigenvalues (blocks A to D)
⌘/Ctrl + Enter

Now do the central step yourself. Everything is real here, so the grader compares real numbers.

🧪 Coding exerciseExercise: generalized eigenvector, the defective solution formula, and an RK4 check
⌘/Ctrl + Enter

Concept checks

✅ Concept check

A system has eigenvalues $-0.5 \pm 2i$. By what factor does the radius shrink per full turn? (Give a number.)

✅ Concept check

Two real matrices both have eigenvalues $-0.2 \pm i$ but different eigenvectors. What differs between their phase portraits?

✅ Concept check

$A = \begin{pmatrix}-2&1\\0&-2\end{pmatrix}$ has the eigenvector $\mathbf v = (1, 0)$ and a double eigenvalue $-2$. Why is $e^{-2t}(c_1\mathbf v + c_2 t\mathbf v)$ not the general solution?

Problems

✏️ Pen & paperComplex pair by hand●●○

Solve x′=Ax\mathbf x' = A\mathbf x, x(0)=(1,0)\mathbf x(0) = (1, 0) for A=(3−24−1)A = \begin{pmatrix}3&-2\\4&-1\end{pmatrix}. Give the period and the growth factor per turn.

Show worked solution

T=2T = 2, D=−3+8=5D = -3 + 8 = 5, λ=1±2i\lambda = 1 \pm 2i. Row 1 of A−λIA - \lambda I: (2−2i)v1=2v2(2 - 2i)v_1 = 2v_2, so v=(1,1−i)\mathbf v = (1, 1 - i): a=(1,1)\mathbf a = (1, 1), b=(0,−1)\mathbf b = (0, -1). Fit c1a+c2b=(1,0)c_1\mathbf a + c_2\mathbf b = (1, 0): c1=1c_1 = 1, c1−c2=0c_1 - c_2 = 0, so c2=1c_2 = 1. Then x=et[(cos⁡2t+sin⁡2t)a+(cos⁡2t−sin⁡2t)b]=et(cos⁡2t+sin⁡2t, 2sin⁡2t)\mathbf x = e^{t}[(\cos 2t + \sin 2t)\mathbf a + (\cos 2t - \sin 2t)\mathbf b] = e^{t}(\cos 2t + \sin 2t,\ 2\sin 2t). Check: x′(0)=(3,4)=Ax0\mathbf x'(0) = (3, 4) = A\mathbf x_0. Period π\pi, factor e2π⋅1/2=eπ=23.141e^{2\pi\cdot1/2} = e^{\pi} = 23.141 (a growing spiral; computed by hand and not from the sim).

✏️ Pen & paperA defective node●●○

For A=(1−113)A = \begin{pmatrix}1&-1\\1&3\end{pmatrix} find λ\lambda, v\mathbf v, a generalized w\mathbf w, and the solution with x(0)=(1,0)\mathbf x(0) = (1, 0).

Show worked solution

T=4T = 4, D=4D = 4, so λ=2\lambda = 2 twice. A−2I=(−1−111)≠0A - 2I = \begin{pmatrix}-1&-1\\1&1\end{pmatrix} \neq 0: v=(1,−1)\mathbf v = (1, -1) only. (A−2I)w=v(A - 2I)\mathbf w = \mathbf v needs −w1−w2=1-w_1 - w_2 = 1; take w=(−1,0)\mathbf w = (-1, 0). Fit c1(1,−1)+c2(−1,0)=(1,0)c_1(1, -1) + c_2(-1, 0) = (1, 0): c1=0c_1 = 0, c2=−1c_2 = -1. So x=−e2t(tv+w)=e2t(1−t, t)\mathbf x = -e^{2t}(t\mathbf v + \mathbf w) = e^{2t}(1 - t,\ t). Check: x′(0)=(1,1)=A(1,0)\mathbf x'(0) = (1, 1) = A(1, 0). Growing λ\lambda: the same picture run backwards in time. (Hand computation; the exercise cell above verifies this matrix.)

✏️ Pen & paperCritical damping for any stiffness●●●

Show that y′′+2ky′+k2y=0y'' + 2ky' + k^2y = 0 (k>0k \gt 0) is always a defective node, and find the largest speed ∣y′∣|y'| for y(0)=1y(0) = 1, y′(0)=0y'(0) = 0.

Show worked solution

The companion matrix is (01−k2−2k)\begin{pmatrix}0&1\\-k^2&-2k\end{pmatrix}, with T=−2kT = -2k, D=k2D = k^2, T2−4D=0T^2 - 4D = 0: double λ=−k\lambda = -k. A+kI=(k1−k2−k)A + kI = \begin{pmatrix}k&1\\-k^2&-k\end{pmatrix} has the entry 1≠01 \neq 0, so it is nonzero: one eigenvector (1,−k)(1, -k) and a defective node. Take w=(1/k,0)\mathbf w = (1/k, 0): (A+kI)w=(1,−k)=v(A + kI)\mathbf w = (1, -k) = \mathbf v. Then x0=(1,0)=kw\mathbf x_0 = (1, 0) = k\mathbf w, so c=(0,k)\mathbf c = (0, k) and y=(1+kt)e−kty = (1 + kt)e^{-kt}, y′=−k2te−kty' = -k^2te^{-kt}. This is largest in magnitude at t=1/kt = 1/k (the hump), where ∣y′∣=k/e|y'| = k/e. For k=1k = 1: 0.367880.36788 (the sim’s critical preset).

Key Takeaways

  • For λ=α±iβ\lambda = \alpha \pm i\beta and v=a+ib\mathbf v = \mathbf a + i\mathbf b: x1=eαt(acos⁡βt−bsin⁡βt)\mathbf x_1 = e^{\alpha t}(\mathbf a\cos\beta t - \mathbf b\sin\beta t) and x2=eαt(asin⁡βt+bcos⁡βt)\mathbf x_2 = e^{\alpha t}(\mathbf a\sin\beta t + \mathbf b\cos\beta t) are real solutions (real and imaginary parts of eλtve^{\lambda t}\mathbf v), and c1a+c2b=x0c_1\mathbf a + c_2\mathbf b = \mathbf x_0 fits the data.
  • The period is 2π/β2\pi/\beta and the factor per turn is e2πα/βe^{2\pi\alpha/\beta} (0.284610.28461 for −0.2±i-0.2 \pm i), independent of a,b\mathbf a, \mathbf b, which set the tilt and stretch of the ellipse.
  • A repeated eigenvalue gives a star node (A=λIA = \lambda I, every vector an eigenvector) or a defective node (one eigenvector).
  • In the defective case solve (A−λI)w=v(A - \lambda I)\mathbf w = \mathbf v; then x=eλt((c1+c2t)v+c2w)\mathbf x = e^{\lambda t}((c_1 + c_2 t)\mathbf v + c_2\mathbf w), because substituting eλt(tv+w)e^{\lambda t}(t\mathbf v + \mathbf w) leaves exactly that equation.
  • teλtte^{\lambda t} peaks at t=1/∣λ∣t = 1/|\lambda| with height 1/(∣λ∣e)1/(|\lambda|e) (0.50.5 and 0.183940.18394 for λ=−2\lambda = -2): a stable defective system has a transient hump.
  • The 2×22\times2 Jordan block (λ10λ)\begin{pmatrix}\lambda&1\\0&\lambda\end{pmatrix} has eJt=eλt(1t01)e^{Jt} = e^{\lambda t}\begin{pmatrix}1&t\\0&1\end{pmatrix} (derived in the matrix-exponential lesson); critical damping is a defective node with y=(1+t)e−ty = (1 + t)e^{-t}.
  • Near a defective matrix the eigenvector matrix has condition number about 2/δ2/\sqrt\delta (19.9519.95, 200.00200.00, 2000.002000.00); Schur or expm is preferred (from memory).
  • A vortex is a pure imaginary pair and the Dutch roll a lightly damped complex pair (from memory); next is 7.5 The Matrix Exponential & Fundamental Matrices.
Finished this lesson?

Mark it complete to track your progress (saved in this browser). Reading every section does this for you.

Where this leads

These later lessons build directly on this one: