Rayleigh quotient - Alchetron, The Free Social Encyclopedia

In mathematics, for a given complex Hermitian matrix M and nonzero vector x, the Rayleigh quotient R ( M , x ) , is defined as:

For real matrices and vectors, the condition of being Hermitian reduces to that of being symmetric, and the conjugate transpose x ∗ to the usual transpose x ′ . Note that R ( M , c x ) = R ( M , x ) for any non-zero real scalar c. Recall that a Hermitian (or real symmetric) matrix has real eigenvalues. It can be shown that, for a given matrix, the Rayleigh quotient reaches its minimum value λ min (the smallest eigenvalue of M) when x is v min (the corresponding eigenvector). Similarly, R ( M , x ) ≤ λ max and R ( M , v max ) = λ max .

The Rayleigh quotient is used in the min-max theorem to get exact values of all eigenvalues. It is also used in eigenvalue algorithms to obtain an eigenvalue approximation from an eigenvector approximation. Specifically, this is the basis for Rayleigh quotient iteration.

The range of the Rayleigh quotient (for matrix that is not necessarily Hermitian) is called a numerical range, (or spectrum in functional analysis). When the matrix is Hermitian, the numerical range is equal to the spectral norm. Still in functional analysis, λ max is known as the spectral radius. In the context of C*-algebras or algebraic quantum mechanics, the function that to M associates the Rayleigh–Ritz quotient R(M,x) for a fixed x and M varying through the algebra would be referred to as "vector state" of the algebra.

Bounds for Hermitian M {\displaystyle M}

As stated in the introduction, it is R ( M , x ) ∈ [ λ min , λ max ] . This is immediate after observing that the Rayleigh quotient is a weighted average of eigenvalues of M:

R ( M , x ) = x ∗ M x x ∗ x = ∑ i = 1 n λ i y i 2 ∑ i = 1 n y i 2

where ( λ i , v i ) is the i th eigenpair after orthonormalization and y i = v i ∗ x is the i th coordinate of x in the eigenbasis. It is then easy to verify that the bounds are attained at the corresponding eigenvectors v min , v max .

The fact that the quotient is a weighted average of the eigenvalues can be used to identify the second, the third, ... largest eigenvalues. Let λ max = λ 1 ≥ λ 2 ≥ ⋯ ≥ λ n = λ min be the eigenvalues in decreasing order. If x is constrained to be orthogonal to v 1 , in which case y 1 = v 1 ∗ x = 0 , then R ( M , x ) has the maximum λ 2 , which is achieved when x = v 2 .

Special case of covariance matrices

An empirical covariance matrix M can be represented as the product A ′ A of the data matrix A pre-multiplied by its transpose A ′ . Being a positive semi-definite matrix, M has non-negative eigenvalues, and orthogonal (or othogonalisable) eigenvectors, which can be demonstrated as follows.

Firstly, that the eigenvalues λ i are non-negative:

M v i = A ′ A v i = λ i v i ⇒ v i ′ A ′ A v i = v i ′ λ i v i ⇒ ∥ A v i ∥ 2 = λ i ∥ v i ∥ 2 ⇒ λ i = ∥ A v i ∥ 2 ∥ v i ∥ 2 ≥ 0.

Secondly, that the eigenvectors v i are orthogonal to one another:

M v i = λ i v i ⇒ v j ′ M v i = λ i v j ′ v i ⇒ ( M v j ) ′ v i = λ j v j ′ v i ⇒ λ j v j ′ v i = λ i v j ′ v i ⇒ ( λ j − λ i ) v j ′ v i = 0 ⇒ v j ′ v i = 0

If the eigenvalues are different – in the case of multiplicity, the basis can be orthogonalized.

To now establish that the Rayleigh quotient is maximized by the eigenvector with the largest eigenvalue, consider decomposing an arbitrary vector x on the basis of the eigenvectors v i :

x = ∑ i = 1 n α i v i ,

where

α i = x ′ v i v i ′ v i = ⟨ x , v i ⟩ ∥ v i ∥ 2

is the coordinate of x orthogonally projected onto v i . Therefore we have:

R ( M , x ) = x ′ A ′ A x x ′ x = ( ∑ j = 1 n α j v j ) ′ ( A ′ A ) ( ∑ i = 1 n α i v i ) ( ∑ j = 1 n α j v j ) ′ ( ∑ i = 1 n α i v i ) = ( ∑ j = 1 n α j v j ) ′ ( ∑ i = 1 n α i ( A ′ A ) v i ) ( ∑ i = 1 n α i 2 v i ′ v i ) = ( ∑ j = 1 n α j v j ) ′ ( ∑ i = 1 n α i λ i v i ) ( ∑ i = 1 n α i 2 ∥ v i ∥ 2 )

which, by orthonormality of the eigenvectors, becomes:

R ( M , x ) = ∑ i = 1 n α i 2 λ i ∑ i = 1 n α i 2 = ∑ i = 1 n λ i ( x ′ v i ) 2 ( x ′ x ) ( v i ′ v i )

The last representation establishes that the Rayleigh quotient is the sum of the squared cosines of the angles formed by the vector x and each eigenvector v i , weighted by corresponding eigenvalues.

If a vector x maximizes R ( M , x ) , then any non-zero scalar multiple k x also maximizes R , so the problem can be reduced to the Lagrange problem of maximizing ∑ i = 1 n α i 2 λ i under the constraint that ∑ i = 1 n α i 2 = 1 .

Define: β i = α i 2 . This then becomes a linear program, which always attains its maximum at one of the corners of the domain. A maximum point will have α 1 = ± 1 and α i = 0 for all i > 1 (when the eigenvalues are ordered by decreasing magnitude).

Thus, as advertised, the Rayleigh quotient is maximized by the eigenvector with the largest eigenvalue.

Formulation using Lagrange multipliers

Alternatively, this result can be arrived at by the method of Lagrange multipliers. The problem is to find the critical points of the function

R ( M , x ) = x T M x ,

subject to the constraint ∥ x ∥ 2 = x T x = 1. In other words, it is to find the critical points of

L ( x ) = x T M x − λ ( x T x − 1 ) ,

where λ is a Lagrange multiplier. The stationary points of L ( x ) occur at

d L ( x ) d x = 0 ⇒ 2 M x − 2 λ x = 0 ⇒ M x = λ x

and

∴ R ( M , x ) = x T M x x T x = λ x T x x T x = λ .

Therefore, the eigenvectors x 1 , … , x n of M are the critical points of the Rayleigh quotient and their corresponding eigenvalues λ 1 , … , λ n are the stationary values of R . This property is the basis for principal components analysis and canonical correlation.

Use in Sturm–Liouville theory

Sturm–Liouville theory concerns the action of the linear operator

L ( y ) = 1 w ( x ) ( − d d x [ p ( x ) d y d x ] + q ( x ) y )

on the inner product space defined by

⟨ y 1 , y 2 ⟩ = ∫ a b w ( x ) y 1 ( x ) y 2 ( x ) d x

of functions satisfying some specified boundary conditions at a and b. In this case the Rayleigh quotient is

⟨ y , L y ⟩ ⟨ y , y ⟩ = ∫ a b y ( x ) ( − d d x [ p ( x ) d y d x ] + q ( x ) y ( x ) ) d x ∫ a b w ( x ) y ( x ) 2 d x .

This is sometimes presented in an equivalent form, obtained by separating the integral in the numerator and using integration by parts:

⟨ y , L y ⟩ ⟨ y , y ⟩ = { ∫ a b y ( x ) ( − d d x [ p ( x ) y ′ ( x ) ] ) d x } + { ∫ a b q ( x ) y ( x ) 2 d x } ∫ a b w ( x ) y ( x ) 2 d x = { − y ( x ) [ p ( x ) y ′ ( x ) ] | a b } + { ∫ a b y ′ ( x ) [ p ( x ) y ′ ( x ) ] d x } + { ∫ a b q ( x ) y ( x ) 2 d x } ∫ a b w ( x ) y ( x ) 2 d x = { − p ( x ) y ( x ) y ′ ( x ) | a b } + { ∫ a b [ p ( x ) y ′ ( x ) 2 + q ( x ) y ( x ) 2 ] d x } ∫ a b w ( x ) y ( x ) 2 d x .

Generalizations

For a given pair (A, B) of matrices, and a given non-zero vector x, the generalized Rayleigh quotient is defined as: R ( A , B ; x ) := x ∗ A x x ∗ B x . The Generalized Rayleigh Quotient can be reduced to the Rayleigh Quotient R ( D , C ∗ x ) through the transformation D = C − 1 A C ∗ − 1 where C C ∗ is the Cholesky decomposition of the Hermitian positive-definite matrix B.
For a given pair (x, y) of non-zero vectors, and a given Hermitian matrix H, the generalized Rayleigh quotient can be defined as: R ( H ; x , y ) := y ∗ H x y ∗ y ⋅ x ∗ x which coincides with R(H,x) when x = y.

References

Rayleigh quotient Wikipedia

(Text) CC BY-SA