eigen {base} | R Documentation |
Computes eigenvalues and eigenvectors of real (double, integer, logical) or complex matrices.
eigen(x, symmetric, only.values = FALSE, EISPACK = FALSE)
x |
a matrix whose spectral decomposition is to be computed. |
symmetric |
if |
only.values |
if |
EISPACK |
logical. Should EISPACK be used (for compatibility with R < 1.7.0)? |
If symmetric
is unspecified, the code attempts to
determine if the matrix is symmetric up to plausible numerical
inaccuracies. It is faster and surer to set the value yourself.
eigen
is preferred to eigen(EISPACK = TRUE)
for new projects, but its eigenvectors may differ in sign and
(in the asymmetric case) in normalization. (They may also differ
between methods and between platforms.)
Computing the eigenvectors is the slow part for large matrices.
Computing the eigendecomposition of a matrix is subject to errors on a
real-world computer: the definitive analysis is Wilkinson (1965). All
you can hope for is a solution to a problem suitably close to
x
. So even though a real asymmetric x
may have an
algebraic solution with repeated real eigenvalues, the computed
solution may be of a similar matrix with complex conjugate pairs of
eigenvalues.
The spectral decomposition of x
is returned as components of a
list with components
values |
a vector containing the p eigenvalues of |
vectors |
either a p * p matrix whose columns
contain the eigenvectors of For Recall that the eigenvectors are only defined up to a constant: even when the length is specified they are still only defined up to a scalar of modulus one (the sign for real matrices). |
If r <- eigen(A)
, and V <- r$vectors; lam <- r$values
,
then
A = V Lmbd V^(-1)
(up to numerical
fuzz), where Lmbd =diag(lam)
.
EISPACK = TRUE
(for compatibility with R < 1.7.0) was formally
deprecated in R 2.15.2.
By default eigen
uses the LAPACK routines DSYEVR
,
DGEEV
, ZHEEV
and ZGEEV
whereas
eigen(EISPACK = TRUE)
provides an interface to the EISPACK
routines RS
, RG
, CH
and CG
.
LAPACK and EISPACK are from http://www.netlib.org/lapack and http://www.netlib.org/eispack and their guides are listed in the references.
Anderson. E. and ten others (1999)
LAPACK Users' Guide. Third Edition. SIAM.
Available on-line at
http://www.netlib.org/lapack/lug/lapack_lug.html.
Becker, R. A., Chambers, J. M. and Wilks, A. R. (1988) The New S Language. Wadsworth & Brooks/Cole.
Smith, B. T., Boyle, J. M., Dongarra, J. J., Garbow, B. S., Ikebe, Y., Klema, V., and Moler, C. B. (1976). Matrix Eigensystems Routines – EISPACK Guide. Springer-Verlag Lecture Notes in Computer Science 6.
Wilkinson, J. H. (1965) The Algebraic Eigenvalue Problem. Clarendon Press, Oxford.
Wilkinson, J. H. and Reinsch, C. (1971) Linear Algebra. Volume
II of Handbook for Automatic Computation, Springer-Verlag.
[Original source for EISPACK, in ALGOL.]
svd
, a generalization of eigen
; qr
, and
chol
for related decompositions.
To compute the determinant of a matrix, the qr
decomposition is much more efficient: det
.
eigen(cbind(c(1,-1), c(-1,1))) eigen(cbind(c(1,-1), c(-1,1)), symmetric = FALSE) # same (different algorithm). eigen(cbind(1, c(1,-1)), only.values = TRUE) eigen(cbind(-1, 2:1)) # complex values eigen(print(cbind(c(0, 1i), c(-1i, 0)))) # Hermite ==> real Eigenvalues ## 3 x 3: eigen(cbind( 1, 3:1, 1:3)) eigen(cbind(-1, c(1:2,0), 0:2)) # complex values