Also found in: Dictionary, Thesaurus, Medical, Wikipedia.
Related to eigenvalue: eigenvalue equation, Eigenvalue Problem

Eigenvalue (quantum mechanics)

If an equation containing a variable parameter possesses nontrivial solutions only for certain special values of the parameter, these solutions are called eigenfunctions and the special values are called eigenvalues.

The eigenfunction-eigenvalue relation is of particular importance in quantum mechanics because of its prominence in the equations which relate the mathematical formalism of the theory with physical results. See Quantum mechanics



(or characteristic value). An eigenvalue of a linear transformation or operator A is a number λ for which there exists a nonzero vector x such that Ax = λx; the vector x is called an eigenvector, or characteristic vector. Thus, the eigenvalues of a differential operator L(y) with given boundary conditions are numbers X for which the equation L(y) = λy has a nonzero solution that satisfies the boundary conditions. For example, if the operator L(y) has the form -y”, then numbers of the form λn = n2, where n is a natural number, are eigenvalues of the operator under the boundary conditions y (0) = y (π) = 0, since the functions yn = sin nx satisfy the equation - yn = n2y with the indicated boundary conditions. If, however, λ + n2 for any natural n, then only the function y(x) = 0 satisfies the equation –y” = λy under the same boundary conditions. Eigenvalues of linear operators are of importance in many problems in mathematics, mechanics, and physics—in problems, for example, in analytic geometry, algebra, the theory of vibrations, and quantum mechanics.

The eigenvalues of the matrix A = ║aik║, where i, k = 1, 2, . . . , n, are the eigenvalues of the linear transformation on an n-dimensional complex space that corresponds to A. The eigenvalues can also be defined as the roots of the equation det(A - λE) = 0, where E is the unit matrix—that is, the roots of the equation

which is called the characteristic equation of the matrix. Since these numbers are the same for the similar matrices A and B’XAB where B is a nonsingular matrix, they characterize properties of the linear transformation that are independent of the choice of coordinate system. To each root λ, of equation (*) there corresponds a vector xi ≠ 0 (an eigenvector) such that Axi = λixi. If all the eigenvalues are distinct, then the set of eigenvectors may be chosen as the basis of the vector space. With respect to this basis, the linear transformation is described by the diagonal matrix

Every matrix A with distinct eigenvalues can be represented in the form C–1ʌC. If A is a Hermitian matrix, then its eigenvalues are real, the eigenvectors are orthogonal, and there exists a unitary matrix that can be chosen as C. The absolute value of every eigenvalue of a unitary matrix is equal to 1. The sum of the eigenvalues of a matrix is equal to the sum of its diagonal elements—that is, to the trace of the matrix. Knowledge of the eigenvalues of a matrix plays an important role in the investigation of the convergence of certain approximate methods of solving systems of linear equations.


The one of the scalars λ such that T (v) = λ v, where T is a linear operator on a vector space, and v is an eigenvector. Also known as characteristic number; characteristic root; characteristic value; latent root; proper value.


The factor by which a linear transformation multiplies one of its eigenvectors.
References in periodicals archive ?
Therefore, the rule of eigenvalues greater than 1 as a criterion for retaining components is rather arbitrary; sampling values of correlations extracted from populations of non-correlated variables will produce eigenvalues over one.
In this article we find lower bounds for the first eigenvalue of Steklov in geodesic balls and simply connected domain of a Riemannian n-manifold; where n = 2, 3, complete of non-positive sectional curvature.
For a connected network, the Laplacian Lap has a simple eigenvalue zero, with an associated eigenvector equal to j.
Moreover, we have concluded that in order to give better predictions using manipulated data, the available information has to be manipulated in such a way that the corresponding Leslie matrix has complex eigenvalues whose magnitudes are very close to the magnitude of the unique largest real eigenvalue.
This method can reduce computational complexity since the eigenvalue decomposition processing is avoided.
To show the differences between the FEM-DDMs using FOTC, SOTC TE, SOTC-Full-J, and SOTC-Full-En for modeling an EM problem, we first consider an air box with mesh size of [lambda]/20 and the eigenvalue distributions using different TCs are shown in Fig.
Diagnostic tests for collinearity are: VIF (variance inflation factor), correlation matrix of variables, eigenvalues and eigenvectors, condition indices, variance proportions.
intersections of lattice permutohedra with SR(d, n)) are eigenvectors with eigenvalue - n.
From the description of the steps, we can see that the key of this algorithm is eigenvalue decomposition of the covariance matrix and the selection of the decision threshold.
In this paper, we present a methodology to reduce the computational effort associated with repeated eigenvalue analyses in topography optimization of vibratory problems.
A Discussion of Complex Eigenvalue Analytical Methods as They Relate to the Prediction of Brake Noise," SAE Int.