Quadratic eigenvalue problem explained
In mathematics, the quadratic eigenvalue problem[1] (QEP), is to find scalar eigenvalues
, left
eigenvectors
and right eigenvectors
such that
where
, with matrix coefficients
and we require that
, (so that we have a nonzero leading coefficient). There are
eigenvalues that may be
infinite or finite, and possibly zero. This is a special case of a
nonlinear eigenproblem.
is also known as a quadratic
polynomial matrix.
Spectral theory
A QEP is said to be regular if
identically. The coefficient of the
term in
is
, implying that the QEP is regular if
is nonsingular.
Eigenvalues at infinity and eigenvalues at 0 may be exchanged by considering the reversed polynomial,
. As there are
eigenvectors in a
dimensional space, the eigenvectors cannot be orthogonal. It is possible to have the same eigenvector attached to different eigenvalues.
Applications
Systems of differential equations
Quadratic eigenvalue problems arise naturally in the solution of systems of second order linear differential equations without forcing:
Where
, and
. If all quadratic eigenvalues of
are distinct, then the solution can be written in terms of the quadratic eigenvalues and right quadratic eigenvectors as
q(t)=
\alphajxj
=XeΛ\alpha
Where
Λ=Diag([λ1,\ldots,λ2n])\inR2n
are the quadratic eigenvalues,
are the
right quadratic eigenvectors, and
\alpha=[\alpha1, … ,\alpha2n]\top\inR2n
is a parameter vector determined from the initial conditions on
and
.
Stability theory for linear systems can now be applied, as the behavior of a solution depends explicitly on the (quadratic) eigenvalues.
Finite element methods
A QEP can result in part of the dynamic analysis of structures discretized by the finite element method. In this case the quadratic,
has the form
, where
is the
mass matrix,
is the
damping matrix and
is the
stiffness matrix.Other applications include vibro-acoustics and fluid dynamics.
Methods of solution
and
are based on transforming the problem to
Schur or Generalized Schur form. However, there is no analogous form for quadratic matrix polynomials.One approach is to transform the quadratic matrix polynomial to a linear
matrix pencil (
), and solve a generalized eigenvalue problem. Once eigenvalues and eigenvectors of the linear problem have been determined, eigenvectors and eigenvalues of the quadratic can be determined.
The most common linearization is the first companion linearization
L1(λ)=\begin{bmatrix}
0&N\\
-K&-C\end{bmatrix}
-
λ\begin{bmatrix}
N&0\\
0&M\end{bmatrix},
with corresponding eigenvector
z=\begin{bmatrix}
x\\
λx
\end{bmatrix}.
For convenience, one often takes
to be the
identity matrix. We solve
for
and
, for example by computing the Generalized Schur form. We can then take the first
components of
as the eigenvector
of the original quadratic
.
Another common linearization is given by
L2(λ)=\begin{bmatrix}
-K&0\\
0&N
\end{bmatrix}
-
λ\begin{bmatrix}
C&M\\
N&0\end{bmatrix}.
In the case when either
or
is a
Hamiltonian matrix and the other is a
skew-Hamiltonian matrix, the following linearizations can be used.
L3(λ)=\begin{bmatrix}
K&0\\
C&K
\end{bmatrix}
-
λ\begin{bmatrix}
0&K\\
-M&0\end{bmatrix}.
L4(λ)=\begin{bmatrix}
0&-K\\
M&0
\end{bmatrix}
-
λ\begin{bmatrix}
M&C\\
0&M\end{bmatrix}.
References
- F. Tisseur and K. Meerbergen, The quadratic eigenvalue problem, SIAMRev., 43 (2001), pp. 235–286.