Skip to main content icon/video/no-internet

Eigenvectors and eigenvalues are numbers and vectors associated with square matrices, and together they provide the eigendecomposition of a matrix, which analyzes the structure of this matrix. Even though the eigendecomposition does not exist for all square matrices, it has a particularly simple expression for a class of matrices often used in multivariate analysis, such as correlation, covariance, or cross-product matrices. The eigendecomposition of this type of matrices is important in statistics because it is used to find the maximum (or minimum) of functions involving these matrices. For example, principal component analysis is obtained from the eigendecomposition of a covariance matrix and gives the least square estimate of the original data matrix.

Eigenvectors and eigenvalues are also referred to as characteristic vectors and latent roots or characteristic equation (in German, eigen means “specific to” or “characteristic of ”). The set of eigenvalues of a matrix is also called its spectrum.

Notations and Definition

There are several ways to define eigenvectors and eigenvalues. The most common approach defines an eigenvector of the matrix A as a vector u that satisfies the following equation:

None

When rewritten, the equation becomes

None

where λ is a scalar called the eigenvalue associated to the eigenvector.

In a similar manner, a vector u is an eigenvector of a matrix A if the length of the vector (but not its direction) is changed when it is multiplied by A. For example, the matrix

None

has the eigenvectors

None

Figure 1 Two Eigenvectors of a Matrix

None

and

None

We can verify (as illustrated in Figure 1) that only the lengths of u1 and u2 are changed when one of these two vectors is multiplied by the matrix A:

None

and

None

For most applications, we normalize the eigenvectors (i.e., transform them so that their length is equal to one):

None

For the previous example, we obtain

None

We can check that

None

and

None

Traditionally, we put together the set of eigenvectors of A in a matrix denoted U. Each column of U is an eigenvector of A. The eigenvalues are stored in a diagonal matrix (denoted Λ), where the diagonal elements give the eigenvalues (and all the other values are zeros). The first equation can be rewritten as follows:

None

or also as

None

For the previous example, we obtain

None

It is important to note that not all matrices have eigenvalues. For example, the matrix does not have eigenvalues. Even when a matrix has eigenvalues and eigenvectors, the computation of the eigenvectors and eigenvalues of a matrix requires a large number of computations and is therefore better performed by computers.

Digression: An Infinity of Eigenvectors for One Eigenvalue

It is only through a slight abuse of language that we can talk about the eigenvector associated with one given eigenvalue. Strictly speaking, there is an infinity of eigenvectors associated with each eigenvalue of a matrix. Because any scalar multiple of an eigenvector is still an eigenvector, there is, in fact, an (infinite) family of eigenvectors for each eigenvalue, but they are all proportional to each other. For example,

None

...

  • Loading...
locked icon

Sign in to access this content

Get a 30 day FREE TRIAL

  • Watch videos from a variety of sources bringing classroom topics to life
  • Read modern, diverse business cases
  • Explore hundreds of books and reference titles

Sage Recommends

We found other relevant content for you on other Sage platforms.

Loading