Repeated Eigenvalues, Fundamental Matrices, and Nonhomogeneous Systems
When a repeated eigenvalue supplies too few eigenvectors, a generalized eigenvector supplies the missing solution as ξte^{ρt} + ηe^{ρt}, giving an improper node. A fundamental set packaged as a matrix Φ(t) yields the matrix exponential e^{At}, the propagator mapping initial states to later ones.
╌╌╌╌
Two gaps remain in the constant-coefficient theory. A repeated eigenvalue can fail to supply enough eigenvectors, leaving the eigenpair method short of solutions; and a forcing term makes the system nonhomogeneous. The connecting idea for both is the fundamental matrix: package a fundamental set as the columns of one matrix, and the whole solution theory compresses into matrix algebra. In the constant-coefficient case that matrix turns out to be a matrix exponential.
Fundamental matrices
Arrange a fundamental set of solutions side by side as the columns of a matrix.
The general solution collapses to one matrix-vector product. Writing as acting on the constant vector gives
For an initial value problem , the constant vector must satisfy , so and
Among all fundamental matrices, one is distinguished by a convenient initial value. Reserve the symbol for the fundamental matrix with
Its columns are the solutions with initial vectors the standard basis vectors . With the IVP solution is as simple as it can be, since :
is a transformation that carries the initial state into the state at any later time — a propagator. Once is known, every initial condition is solved by a single matrix multiplication.
The matrix exponential
The scalar problem , , has solution . The system , , has solution . The parallel is exact once is identified as an exponential of the matrix .
Define by the same power series that defines the scalar exponential, with in place of and in place of :
Every entry of this matrix series converges for all . Differentiating term by term factors out one :
So solves the same matrix initial value problem , that defines the special fundamental matrix. By uniqueness they are the same object:
The exponential shares the algebra of the scalar exponential, including the propagator law and the inverse . When has a full set of eigenvectors the series is not the practical route: diagonalizing gives with , so the eigenpairs already compute it. The series is needed only when eigenvectors run short.
Repeated eigenvalues
An eigenvalue of algebraic multiplicity may have geometric multiplicity : fewer than independent eigenvectors, and so fewer than solutions of the pure form . The missing solutions must be found in a new form, and the pattern copies the repeated-root case for a single second-order equation, where a double root gave the second solution .
The phase portrait for a defective double eigenvalue is an improper node. Every term carries the factor , and every trajectory approaches the origin tangent to the single eigendirection (for ) or departs along it (for ), but no trajectory settles onto a straight line — the term keeps bending it.
This defective example also shows the matrix exponential explicitly. Assembling as columns gives a fundamental matrix, and normalizing to by yields the propagator
the polynomial-in- entries being exactly what the eigenvector shortage produces — the series does not collapse to a single exponential per direction, as it would for a diagonalizable matrix.
For higher multiplicities the chain lengthens: a triple defective eigenvalue adds a term with a second generalized eigenvector solving . Packaged as a similarity transformation, the eigenvector and its generalized companions turn into its Jordan form : the eigenvalue on the diagonal, a just above it in the column of each missing eigenvector, and zeros elsewhere. The Jordan form is the reason the pattern appears — generates exactly those powers of .
Nonhomogeneous systems
Restore a forcing term and consider
The structure copies the single-equation case exactly: the general solution is the general solution of the homogeneous system plus any one particular solution.
Three methods find the particular solution , in increasing order of generality.
- Diagonalization. When is constant and diagonalizable, turns the system into uncoupled scalar equations with , each solved by the first-order integrating factor.
- Undetermined coefficients. When is constant and is polynomial, exponential, or sinusoidal, guess a matching form. The one twist versus the scalar case: if contains with an eigenvalue, the trial must include both and , not alone.
- Variation of parameters. The general method, needing only a fundamental matrix — no restriction on or .
Variation of parameters
Start from the homogeneous general solution and promote the constant vector to an unknown function, . Differentiating and using ,
The homogeneous part cancels, leaving a purely algebraic condition on . Since is invertible, , and integrating gives the general solution.
Summary
The fundamental matrix organizes the constant-coefficient theory.
- Fundamental matrix. Columns are a fundamental set; is the general solution, and the special with propagates initial states via .
- Matrix exponential. For constant , , defined by the same series as the scalar exponential and computed from eigenpairs when they are complete.
- Defective eigenvalues. Missing eigenvectors are replaced by generalized eigenvectors solving ; the extra solution carries and the portrait is an improper node.
- Nonhomogeneous systems. General homogeneous particular; variation of parameters, , finds the particular solution with only a fundamental matrix in hand.
Footnotes
╌╌ END ╌╌