|
|
|
|
eigenvalue (of a matrix)
|
(Definition)
|
|
|
Let be an complex
matrix. A number
is said to be an eigenvalue of if there is a nonzero
column vector for which
The computation of the eigenvalues of a given matrix is relatively easy from a theoretical point of view, though often computationally infeasible, or at least difficult. The basic procedure is to note that the eigenvalues of a matrix are precisely the solutions to the equation
where denotes the
identity matrix and is the determinant function. As the above determinant is simply a polynomial (of degree , called the characteristic polynomial of ) in with coefficients in
, its roots can be calculated or approximated accordingly to give the eigenvalues of the matrix. Following this train of thought, we also note that this polynomial has degree at least 1, so since
is algebraically closed, it is thus guaranteed that any has at least one eigenvalue (and at most ). If is a multiple root (say, of multiplicity ) of the
defining polynomial, we say that is an eigenvalue of multiplicity .
If one is given a
matrix of real numbers, the above argument implies that has at least one complex eigenvalue; the question of whether or not has real eigenvalues is more subtle since there is no real-numbers analogue of the fundamental theorem of algebra. It should not be a surprise then that some real matrices do not have real eigenvalues. For example, let
In this case
; clearly no real number satisfies
; hence has no real eigenvalues (although has complex eigenvalues and ).
If one converts the above theory into an algorithm for calculating the eigenvalues of a matrix , one is led to a two-step procedure:
- Compute the polynomial
.
- Solve
.
Unfortunately, computing
determinants and finding roots of polynomials of degree are both computationally messy procedures for even moderately large , so for most practical purposes variations on this naive scheme are needed. See the eigenvalue problem for more information.
|
"eigenvalue (of a matrix)" is owned by mathcam. [ full author list (2) | owner history (1) ]
|
|
(view preamble)
Cross-references: symmetric matrix, diagonalizable, purely imaginary, skew-symmetric, Hermitian matrices, eigenvalue problem, variations, even, algorithm, fundamental theorem of algebra, implies, argument, real numbers, multiplicity, multiple root, algebraically closed, roots, coefficients, characteristic polynomial, degree, polynomial, function, determinant, identity matrix, equation, solutions, point, eigenvalues, column vector, eigenvalue, number, matrix, complex
This is version 8 of eigenvalue (of a matrix), born on 2003-06-26, modified 2005-06-29.
Object id is 4397, canonical name is EigenvalueOfAMatrix.
Accessed 24169 times total.
Classification:
| AMS MSC: | 15-00 (Linear and multilinear algebra; matrix theory :: General reference works ) | | | 15A18 (Linear and multilinear algebra; matrix theory :: Eigenvalues, singular values, and eigenvectors) | | | 65-00 (Numerical analysis :: General reference works ) | | | 65F15 (Numerical analysis :: Numerical linear algebra :: Eigenvalues, eigenvectors) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|