Next: Variation of parameters
Up: Linear Stability
Previous: The exponential matrix
The the study of bifurcation below, it will be of interest to consider
the inhomogeneous problem
|  |
(10) |
where
is an eigenvalue of A. If
is an eigenvalue of
geometric multiplicity k, then F must satisfy k solvability conditions
for a solution of (1.11) to exist. These solvability conditions can
be phrased in terms of the adjoint problem. Let
denote the
usual inner product:
|  |
(11) |
Suppose now that b is orthogonal to every F for which (1.11)
has a solution. Then
|  |
(12) |
for every X. Here A* denotes the adjoint matrix:
.
We conclude from (1.13) that
, i.e. b is
an eigenvector of A* with eigenvalue
. The equation (1.11)
is solvable if and only if F is orthogonal to every such eigenvector b.
Example 4
The matrix
|  |
(13) |
has a simple eigenvalue 0 with eigenvector (1,-1)T. The adjoint matrix
is
|  |
(14) |
with eigenvector b=(1,0)T. The system
is solvable if an only if (b,F)=f1=0.
By a general theorem of linear algebra, the codimension of the range
of
must equal the dimension of its nullspace. Hence
the geometric multiplicity of the adjoint eigenvalue
problem is equal to that of the original eigenvalue problem. Let
be
a specific eigenvalue A with
geometric multiplicity k and let
be
k linearly independent eigenvectors. Then there exist k linearly independent
eigenvectors b1,b2,...,bk of the adjoint matrix A* with eigenvalue
. It can be shown that
if the algebraic multiplicity of the eigenvalue is also equal to k,
then the
matrix
is nonsingular. We can then replace the
bi by their linear combinations
|  |
(15) |
We check that
|  |
(16) |
We shall now assume that the bi have in the first place been chosen such
that the normalization (1.18) holds and drop the tilde.
We can now define a projection operator
|  |
(17) |
It is easily checked that P(PF)=PF and that (bi,PF)=0 for every i. That
is, PF lies in the range of
. The equation (1.19) thus
provides
a linear decomposition of F into PF and a linear combination of
the eigenvectors
. We refer to P as a projection operator; for any F,
PF is the part of F in the decomposition which lies in the range of
. The equation
can be decomposed
into two parts using the projection P. Let Y=PX, Z=(I-P)X, G=PF,
H=(I-P)F. Then we find
|  |
(18) |
The first of these equations can be solved uniquely for Y as a function of
G. The second equation simplifies to H=0, since
. Hence
we have the solvability condition H=0, and Z is arbitrary.
Next: Variation of parameters
Up: Linear Stability
Previous: The exponential matrix
Michael Renardy
1998-07-13