K
Let
K
K\in\{R,C\}
\ell\ge0
n>0
A0,A1,...,A\ell
n x n
Ai\inMat(K,n x n)
i=0,...,\ell
A0,...,A\ell
L\colonK\toMat(K,n x n)
L(λ)=
\ell | |
\sum | |
i=0 |
λiAi.
The degree of the matrix pencil is defined as the largest integer
0\lek\le\ell
Ak\ne0
n x n
K
A particular case is a linear matrix pencil
L(λ)=A-λB
B\ne0
(A,B)
A0=A
A1=-B
B
A pencil is called regular if there is at least one value of
λ
\det(L(λ)) ≠ 0
λ
\det(L(λ))=0
(A,I)
A
The set of the eigenvalues of a pencil is called the spectrum of the pencil, and is written
\sigma(A0,...,A\ell)
(A,B)
\sigma(A,B)
\sigma(A,-B)
The linear pencil
(A,B)
B
Matrix pencils play an important role in numerical linear algebra. The problem of finding the eigenvalues of a pencil is called the generalized eigenvalue problem. The most popular algorithm for this task is the QZ algorithm, which is an implicit version of the QR algorithm to solve the eigenvalue problem
Ax=λBx
B
B
If
AB=BA
A
B