View source for Eigenvalues and eigenvectors

{{redirect|Characteristic root}}
{{Use American English|date=January 2019}}
{{Short description|Vectors that map to their scalar multiples, and the associated scalars}}

In [[linear algebra]], an '''eigenvector''' ({{IPAc-en|ˈ|aɪ|g|ə|n|ˌ|v|ɛ|k|t|ər}}) or '''characteristic vector''' of a [[Linear map|linear transformation]] is a nonzero [[Vector space|vector]] that changes at most by a [[Scalar (mathematics)|scalar]] factor when that linear transformation is applied to it.

There is a direct correspondence between ''n''-by-''n'' [[Square matrix|square matrices]] and linear transformations from an [[Dimension|''n''-dimensional]] [[vector space]] into itself, given any [[Basis (linear algebra)|basis]] of the vector space. For this reason, in a finite-dimensional vector space, it is equivalent to define eigenvalues and eigenvectors using either the language of [[Matrix (mathematics)|matrices]] or the language of linear transformations.{{sfn|Herstein|1964|pp=228, 229}}{{sfn|Nering|1970|p=38}}

[[Geometry|Geometrically]], an eigenvector, corresponding to a [[Real number|real]] nonzero eigenvalue, points in a direction in which it is [[Scaling (geometry)|stretched]] by the transformation and the eigenvalue is the factor by which it is stretched.  If the eigenvalue is negative, the direction is reversed.{{sfn|Burden|Faires|1993|p=401}}  Loosely speaking, in a multidimensional vector space, the eigenvector is not rotated.  However, in a one-dimensional vector space, the concept of [[rotation]] is meaningless.

==Formal definition==
If {{mvar|T}} is a linear transformation from a vector space {{mvar|V}} over a [[Field (mathematics)|field]] {{mvar|F}} into itself and {{math|'''v'''}} is a vector in {{mvar|V}} that is not the [[zero vector]], then {{math|'''v'''}} is an eigenvector of {{mvar|T}} if {{math|''T''('''v''')}} is a scalar multiple of {{math|'''v'''}}.  This condition can be written as the equation
:<math>T(\mathbf{v}) = \lambda \mathbf{v},</math>

where {{mvar|λ}} is a scalar in the field {{mvar|F}}, known as the '''eigenvalue''',  '''characteristic value''', or '''characteristic root''' associated with the eigenvector {{math|'''v'''}}.

If the vector space {{mvar|V}} is finite-dimensional, then the linear transformation {{mvar|T}} can be represented as a square matrix ''A'', and the vector {{math|'''v'''}} by a [[row and column vectors|column vector]], rendering the above mapping as a [[Matrix-vector multiplication|matrix multiplication]] on the left-hand side and a scaling of the column vector on the right-hand side in the equation
:<math>A\mathbf{v} = \lambda \mathbf{v}.</math>

==Overview==
Eigenvalues and eigenvectors feature prominently in the analysis of linear transformations. The prefix ''[[wikt:eigen-|eigen-]]'' is adopted from the [[German language|German]] word ''[[wikt:eigen#German|eigen]]'' for "proper", "characteristic".{{sfn|Betteridge|1965}} Originally utilized to study [[principal axis (mechanics)|principal axes]] of the rotational motion of [[rigid body|rigid bodies]], eigenvalues and eigenvectors have a wide range of applications, for example in [[stability theory|stability analysis]], [[vibration analysis#eigenvalue problem|vibration analysis]], [[atomic orbital]]s, [[eigenface|facial recognition]], and [[Eigendecomposition of a matrix|matrix diagonalization]].

In essence, an eigenvector '''v''' of a linear transformation ''T'' is a nonzero vector that, when ''T'' is applied to it, does not change direction. Applying ''T'' to the eigenvector only scales the eigenvector by the scalar value ''λ'', called an eigenvalue. This condition can be written as the equation

:<math>T(\mathbf{v}) = \lambda \mathbf{v},</math>

referred to as the '''eigenvalue equation''' or '''eigenequation'''. In general, ''λ'' may be any [[scalar (mathematics)|scalar]]. For example, ''λ'' may be negative, in which case the eigenvector reverses direction as part of the scaling, or it may be zero or [[complex number|complex]].

[[File:Mona Lisa eigenvector grid.png|thumb|320px|In this [[shear mapping]] the red arrow changes direction, but the blue arrow does not. The blue arrow is an eigenvector of this shear mapping because it does not change direction, and since its length is unchanged, its eigenvalue is 1.]]

The [[Mona Lisa]] example pictured here provides a simple illustration. Each point on the painting can be represented as a vector pointing from the center of the painting to that point. The linear transformation in this example is called a [[shear mapping]]. Points in the top half are moved to the right and points in the bottom half are moved to the left proportional to how far they are from the horizontal axis that goes through the middle of the painting. The vectors pointing to each point in the original image are therefore tilted right or left and made longer or shorter by the transformation. Points ''along'' the horizontal axis do not move at all when this transformation is applied. Therefore, any vector that points directly to the right or left with no vertical component is an eigenvector of this transformation because the mapping does not change its direction. Moreover, these eigenvectors all have an eigenvalue equal to one because the mapping does not change their length, either.

Linear transformations can take many different forms, mapping vectors in a variety of [[vector space]]s, so the eigenvectors can also take many forms. For example, the linear transformation could be a [[differential operator]] like <math>\tfrac{d}{dx}</math>, in which case the eigenvectors are functions called [[eigenfunction]]s that are scaled by that differential operator, such as

:<math>\frac{d}{dx}e^{\lambda x} = \lambda e^{\lambda x}.</math>

Alternatively, the linear transformation could take the form of an ''n'' by ''n'' matrix, in which case the eigenvectors are ''n'' by 1 matrices that are also referred to as eigenvectors. If the linear transformation is expressed in the form of an ''n'' by ''n'' matrix ''A'', then the eigenvalue equation above for a linear transformation can be rewritten as the matrix multiplication

:<math>Av = \lambda v,</math>

where the eigenvector ''v'' is an ''n'' by 1 matrix. For a matrix, eigenvalues and eigenvectors can be used to [[matrix decomposition|decompose the matrix]], for example by [[diagonalizable matrix|diagonalizing]] it.

Eigenvalues and eigenvectors give rise to many closely related mathematical concepts, and the prefix ''eigen-'' is applied liberally when naming them:
* The set of all eigenvectors of a linear transformation, each paired with its corresponding eigenvalue, is called the '''eigensystem''' of that transformation.{{sfn|Press|2007|p=536}}<ref name=WolframEigenvector>{{Cite web|url=http://mathworld.wolfram.com/Eigenvector.html|title=Eigenvector|last=Weisstein|first=Eric W.|website=mathworld.wolfram.com|language=en|access-date=2019-08-04}}</ref>
* The set of all eigenvectors of ''T'' corresponding to the same eigenvalue, together with the zero vector, is called an '''eigenspace''' or '''characteristic space''' of ''T'' associated with that eigenvalue.{{sfn|Nering|1970|p=107}}
* If a set of eigenvectors of ''T'' forms a [[basis (linear algebra)|basis]] of the domain of ''T'', then this basis is called an '''eigenbasis'''.

==History==
Eigenvalues are often introduced in the context of [[linear algebra]] or [[matrix (mathematics)|matrix theory]]. Historically, however, they arose in the study of [[quadratic form]]s and [[differential equation]]s.

In the 18th century [[Leonhard Euler|Euler]] studied the rotational motion of a [[rigid body]] and discovered the importance of the [[Principal axis (mechanics)|principal axes]].<ref>Note:
*  In 1751, Leonhard Euler proved that any body has a principal axis of rotation:  Leonhard Euler (presented:  October 1751 ; published: 1760) [https://archive.org/stream/histoiredelacad07unkngoog#page/n196/mode/2up "Du mouvement d'un corps solide quelconque lorsqu'il tourne autour d'un axe mobile"] (On the movement of any solid body while it rotates around a moving axis), ''Histoire de l'Académie royale des sciences et des belles lettres de Berlin'', pp. 176–227.  [https://archive.org/stream/histoiredelacad07unkngoog#page/n232/mode/2up On p. 212], Euler proves that any body contains a principal axis of rotation:   ''"Théorem.  44.  De quelque figure que soit le corps, on y peut toujours assigner un tel axe, qui passe par son centre de gravité, autour duquel le corps peut tourner librement & d'un mouvement uniforme."''  (Theorem.  44.  Whatever be the shape of the body, one can always assign to it such an axis, which passes through its center of gravity, around which it can rotate freely and with a uniform motion.)
*  In 1755, [[Johann Andreas Segner]] proved that any body has three principal axes of rotation:  Johann Andreas Segner, ''Specimen theoriae turbinum'' [Essay on the theory of tops (i.e., rotating bodies)] ( Halle ("Halae"), (Germany) : Gebauer, 1755).  [{{google books |plainurl=y |id=89NMAAAAcAAJ|29}} p. xxviiii [29]], Segner derives a third-degree equation in ''t'', which proves that a body has three principal axes of rotation.  He then states (on the same page):  ''"Non autem repugnat tres esse eiusmodi positiones plani HM, quia in aequatione cubica radices tres esse possunt, et tres tangentis t valores."''  (However, it is not inconsistent [that there] be three such positions of the plane HM, because in cubic equations, [there] can be three roots, and three values of the tangent t.)
*  The relevant passage of Segner's work was discussed briefly by [[Arthur Cayley]].  See:  A. Cayley (1862) "Report on the progress of the solution of certain special problems of dynamics," ''Report of the Thirty-second meeting of the British Association for the Advancement of Science; held at Cambridge in October 1862'', '''32''' :  184–252 ; see especially [{{google books |plainurl=y |id=S_RJAAAAcAAJ|page=225}}|pp. 225–226.]</ref> [[Lagrange]] realized that the principal axes are the eigenvectors of the inertia matrix.{{sfn|Hawkins|1975|loc=§2}} In the early 19th century, [[Augustin Louis Cauchy|Cauchy]] saw how their work could be used to classify the [[quadric surface]]s, and generalized it to arbitrary dimensions.{{sfn|Hawkins|1975|loc=§3}} Cauchy also coined the term ''racine caractéristique'' (characteristic root) for what is now called ''eigenvalue''; his term survives in ''[[Secular equation|characteristic equation]]''.<ref>{{harvnb|Kline|1972|loc=pp. 807–808}} Augustin Cauchy (1839) "Mémoire sur l'intégration des équations linéaires" (Memoir on the integration of linear equations), ''Comptes rendus'', '''8''' :  827–830, 845–865, 889–907, 931–937.  [http://gallica.bnf.fr/ark:/12148/bpt6k2967c/f833.item.r=.zoom From p. 827:]  ''"On sait d'ailleurs qu'en suivant la méthode de Lagrange, on obtient pour valeur générale de la variable prinicipale une fonction dans laquelle entrent avec la variable principale les racines d'une certaine équation que j'appellerai l'''équation caractéristique'', le degré de cette équation étant précisément l'order de l'équation différentielle qu'il s'agit d'intégrer."''  (One knows, moreover, that by following Lagrange's method, one obtains for the general value of the principal variable a function in which there appear, together with the principal variable, the roots of a certain equation that I will call the "characteristic equation", the degree of this equation being precisely the order of the differential equation that must be integrated.)</ref>

[[Joseph Fourier|Fourier]] used the work of Laplace and Lagrange to solve the [[heat equation]] by [[separation of variables]] in his famous 1822 book ''[[Théorie analytique de la chaleur]]''.{{sfn|Kline|1972|loc=p. 673}} [[Jacques Charles François Sturm|Sturm]] developed Fourier's ideas further and brought them to the attention of Cauchy, who combined them with his own ideas and arrived at the fact that real symmetric matrices have real eigenvalues.<ref name="hawkins3">See {{Harvnb|Hawkins|1975|loc=§3}}</ref> This was extended by [[Charles Hermite|Hermite]] in 1855 to what are now called [[Hermitian matrix|Hermitian matrices]].<ref name="kline807">See {{Harvnb|Kline|1972|loc=pp. 807–808}}</ref> Around the same time, [[Francesco Brioschi|Brioschi]] proved that the eigenvalues of [[orthogonal matrix|orthogonal matrices]] lie on the [[unit circle]],<ref name="hawkins3" /> and [[Alfred Clebsch|Clebsch]] found the corresponding result for [[skew-symmetric matrix|skew-symmetric matrices]].<ref name="kline807" /> Finally, [[Karl Weierstrass|Weierstrass]] clarified an important aspect in the [[stability theory]] started by Laplace by realizing that [[defective matrix|defective matrices]] can cause instability.<ref name="hawkins3" />

In the meantime, [[Joseph Liouville|Liouville]] studied eigenvalue problems similar to those of Sturm; the discipline that grew out of their work is now called ''[[Sturm–Liouville theory]]''.{{sfn|Kline|1972|loc=pp. 715–716}} [[Hermann Schwarz|Schwarz]] studied the first eigenvalue of [[Laplace's equation]] on general domains towards the end of the 19th century, while [[Henri Poincaré|Poincaré]] studied [[Poisson's equation]] a few years later.{{sfn|Kline|1972|loc=pp. 706–707}}

At the start of the 20th century, [[David Hilbert|Hilbert]] studied the eigenvalues of [[integral operator]]s by viewing the operators as infinite matrices.{{sfn|Kline|1972|loc=p. 1063}} He was the first to use the [[German language|German]] word ''eigen'', which means "own", to denote eigenvalues and eigenvectors in 1904,<ref>See:
*  David Hilbert (1904) [http://www.digizeitschriften.de/dms/img/?PPN=PPN252457811_1904&DMDID=dmdlog11&LOGID=log11&PHYSID=phys57#navi "Grundzüge einer allgemeinen Theorie der linearen Integralgleichungen.  (Erste Mitteilung)"] (Fundamentals of a general theory of linear integral equations. (First report)), ''Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse'' (News of the Philosophical Society at Göttingen, mathematical-physical section), pp. 49–91.  [http://www.digizeitschriften.de/dms/img/?PPN=PPN252457811_1904&DMDID=dmdlog11&LOGID=log11&PHYSID=phys57#navi From p. 51:]  ''"Insbesondere in dieser ersten Mitteilung gelange ich zu Formeln, die die Entwickelung einer willkürlichen Funktion nach gewissen ausgezeichneten Funktionen, die ich ''Eigenfunktionen'' nenne, liefern: …'' (In particular, in this first report I arrive at formulas that provide the [series] development of an arbitrary function in terms of some distinctive functions, which I call ''eigenfunctions'': … )  Later on the same page:  ''"Dieser Erfolg ist wesentlich durch den Umstand bedingt, daß ich nicht, wie es bisher geschah, in erster Linie auf den Beweis für die Existenz der Eigenwerte ausgehe, … "'' (This success is mainly attributable to the fact that I do not, as it has happened until now, first of all aim at a proof of the existence of eigenvalues, … )
*  For the origin and evolution of the terms eigenvalue, characteristic value, etc., see:  [http://jeff560.tripod.com/e.html Earliest Known Uses of Some of the Words of Mathematics (E)]</ref> though he may have been following a related usage by [[Helmholtz]]. For some time, the standard term in English was "proper value", but the more distinctive term "eigenvalue" is standard today.{{sfn|Aldrich|2006}}

The first numerical algorithm for computing eigenvalues and eigenvectors appeared in 1929, when [[Richard Edler von Mises|Von Mises]] published the [[power method]]. One of the most popular methods today, the [[QR algorithm]], was proposed independently by [[John G.F. Francis]]<ref>{{Citation|first=J. G. F. |last=Francis|title=The QR Transformation, I (part 1)|journal=The Computer Journal|volume= 4|issue= 3|pages =265–271 |year=1961|doi=10.1093/comjnl/4.3.265}} and {{Citation|doi=10.1093/comjnl/4.4.332|first=J. G. F. |last=Francis|title=The QR Transformation, II (part 2)|journal=The Computer Journal|volume=4|issue= 4| pages= 332–345|year=1962}}</ref> and [[Vera Kublanovskaya]]<ref>{{Citation|first=Vera N. |last=Kublanovskaya|title=On some algorithms for the solution of the complete eigenvalue problem|journal=USSR Computational Mathematics and Mathematical Physics|volume= 3| pages= 637–657 |year=1961}}. Also published in: {{Citation|title=О некоторых алгорифмах для решения полной проблемы собственных значений|trans-title=On certain algorithms for the solution of the complete eigenvalue problem|journal=Журнал вычислительной математики и математической физики (Journal of Computational Mathematics and Mathematical Physics)|volume=1|issue=4| pages=555–570 |year=1961}}</ref> in 1961.{{sfn|Golub|van Loan|1996|loc=§7.3}}{{sfn|Meyer|2000|loc=§7.3}}

==Eigenvalues and eigenvectors of matrices==
{{see also|Euclidean vector|Matrix (mathematics)}}

Eigenvalues and eigenvectors are often introduced to students in the context of linear algebra courses focused on matrices.<ref name=CornellMathCourses>Cornell University Department of Mathematics (2016) [http://www.math.cornell.edu/m/Courses/Catalog/lowerlevel ''Lower-Level Courses for Freshmen and Sophomores'']. Accessed on 2016-03-27.</ref><ref name=UMichMathCourses>University of Michigan Mathematics (2016) [https://www.lsa.umich.edu/UMICH/math/Home/Undergrad/Ugrad_Courses.pdf ''Math Course Catalogue''] {{webarchive|url=https://web.archive.org/web/20151101101339/https://www.lsa.umich.edu/UMICH/math/Home/Undergrad/Ugrad_Courses.pdf |date=2015-11-01 }}. Accessed on 2016-03-27.</ref> Furthermore, linear transformations over a finite-dimensional vector space can be represented using matrices,{{sfn|Herstein|1964|pp=228,229}}{{sfn|Nering|1970|p=38}} which is especially common in numerical and computational applications.{{sfn|Press|2007|pp=38}}

[[File:Eigenvalue equation.svg|thumb|right|250px|Matrix ''A'' acts by stretching the vector ''x'', not changing its direction, so ''x'' is an eigenvector of ''A''.]]

Consider {{mvar|n}}-dimensional vectors that are formed as a list of {{mvar|n}} scalars, such as the three-dimensional vectors
:<math>x = \begin{bmatrix}1\\3\\4\end{bmatrix}\quad\mbox{and}\quad y = \begin{bmatrix}-20\\-60\\-80\end{bmatrix}.</math>

These vectors are said to be [[scalar multiplication|scalar multiples]] of each other, or [[Parallel (geometry)|parallel]] or [[collinearity|collinear]], if there is a scalar {{mvar|λ}} such that
:<math>x = \lambda y.</math>

In this case {{mvar|λ}} = −1/20.

Now consider the linear transformation of {{mvar|n}}-dimensional vectors defined by an {{mvar|n}} by {{mvar|n}} matrix {{mvar|A}},
:<math>Av = w,</math>

or
:<math>\begin{bmatrix}
    A_{11} & A_{12} & \ldots & A_{1n} \\
    A_{21} & A_{22} & \ldots & A_{2n} \\
    \vdots & \vdots & \ddots & \vdots \\
    A_{n1} & A_{n2} & \ldots & A_{nn} \\
  \end{bmatrix}\begin{bmatrix}
    v_1 \\ v_2 \\ \vdots \\ v_n
  \end{bmatrix} = \begin{bmatrix}
    w_1 \\ w_2 \\ \vdots \\ w_n
  \end{bmatrix}
</math>

where, for each row,
:<math>w_i = A_{i1} v_1 + A_{i2} v_2 + \cdots + A_{in} v_n = \sum_{j = 1}^n A_{ij} v_j</math>.

If it occurs that {{mvar|v}} and {{mvar|w}} are scalar multiples, that is if
{{NumBlk|:|<math>A v = w = \lambda v,</math>|{{EquationRef|1}}}}
then {{mvar|v}} is an '''eigenvector''' of the linear transformation {{mvar|A}} and the scale factor {{mvar|λ}} is the '''eigenvalue''' corresponding to that eigenvector. Equation ({{EquationNote|1}}) is the '''eigenvalue equation''' for the matrix {{mvar|A}}.

Equation ({{EquationNote|1}}) can be stated equivalently as
{{NumBlk|:
 |<math>(A - \lambda I)v = 0,</math>
 |{{EquationRef|2}}
}}

where {{mvar|I}} is the {{mvar|n}} by {{mvar|n}} [[identity matrix]] and 0 is the zero vector.

===Eigenvalues and the characteristic polynomial===
{{main|Characteristic polynomial}}

Equation ({{EquationNote|2}}) has a nonzero solution ''v'' [[if and only if]] the [[determinant]] of the matrix {{nowrap|(''A'' − ''λI'')}} is zero. Therefore, the eigenvalues of ''A'' are values of ''λ'' that satisfy the equation
{{NumBlk|:
 |<math>|A-\lambda I| = 0</math>
 |{{EquationRef|3}}
}}

Using [[Leibniz formula for determinants|Leibniz' rule]] for the determinant, the left-hand side of Equation ({{EquationNote|3}}) is a [[polynomial]] function of the variable ''λ'' and the [[degree of a polynomial|degree]] of this polynomial is ''n'', the order of the matrix ''A''. Its [[coefficient]]s depend on the entries of ''A'', except that its term of degree ''n'' is always (−1)<sup>''n''</sup>''λ''<sup>''n''</sup>. This polynomial is called the ''[[characteristic polynomial]]'' of ''A''. Equation ({{EquationNote|3}}) is called the ''characteristic equation'' or the ''secular equation'' of ''A''.

The [[fundamental theorem of algebra]] implies that the characteristic polynomial of an ''n''-by-''n'' matrix ''A'', being a polynomial of degree ''n'', can be [[factorization|factored]] into the product of ''n'' linear terms,
{{NumBlk|:
 |<math>|A - \lambda I| = (\lambda_1 - \lambda )(\lambda_2 - \lambda) \cdots (\lambda_n - \lambda),</math>
 |{{EquationRef|4}}
}}

where each ''λ''<sub>''i''</sub> may be real but in general is a complex number. The numbers ''λ''<sub>1</sub>, ''λ''<sub>2</sub>, ... ''λ''<sub>''n''</sub>, which may not all have distinct values, are roots of the polynomial and are the eigenvalues of ''A''.

As a brief example, which is described in more detail in the examples section later, consider the matrix
:<math>A = \begin{bmatrix}
  2 & 1\\
  1 & 2
\end{bmatrix}.</math>

Taking the determinant of {{nowrap|(''A'' − ''λI'')}}, the characteristic polynomial of ''A'' is
:<math>|A - \lambda I| = \begin{vmatrix}
    2 - \lambda & 1 \\
    1           & 2 - \lambda
  \end{vmatrix} =
  3 - 4\lambda + \lambda^2.
</math>

Setting the characteristic polynomial equal to zero, it has roots at {{nowrap|1=λ = 1}} and {{nowrap|1=λ = 3}}, which are the two eigenvalues of ''A''. The eigenvectors corresponding to each eigenvalue can be found by solving for the components of ''v'' in the equation ''Av'' = ''λv''. In this example, the eigenvectors are any nonzero scalar multiples of
:<math>v_{\lambda=1} = \begin{bmatrix} 1 \\ -1 \end{bmatrix}, \quad v_{\lambda=3} = \begin{bmatrix} 1 \\ 1 \end{bmatrix}.</math>

If the entries of the matrix ''A'' are all real numbers, then the coefficients of the characteristic polynomial will also be real numbers, but the eigenvalues may still have nonzero imaginary parts. The entries of the corresponding eigenvectors therefore may also have nonzero imaginary parts. Similarly, the eigenvalues may be [[irrational number]]s even if all the entries of ''A'' are [[rational number]]s or even if they are all integers. However, if the entries of ''A'' are all [[algebraic number]]s, which include the rationals, the eigenvalues are complex algebraic numbers.

The non-real roots of a real polynomial with real coefficients can be grouped into pairs of [[complex conjugate]]s, namely with the two members of each pair having imaginary parts that differ only in sign and the same real part. If the degree is odd, then by the [[intermediate value theorem]] at least one of the roots is real. Therefore, any [[real matrix]] with odd order has at least one real eigenvalue, whereas a real matrix with even order may not have any real eigenvalues. The eigenvectors associated with these complex eigenvalues are also complex and also appear in complex conjugate pairs.

=== Algebraic multiplicity ===
<!-- Algebraic multiplicity, Simple eigenvalue and Semisimple eigenvalue link here.  Please do not change. -->
Let ''λ''<sub>''i''</sub> be an eigenvalue of an ''n'' by ''n'' matrix ''A''. The '''algebraic multiplicity''' ''μ''<sub>''A''</sub>(''λ''<sub>''i''</sub>) of the eigenvalue is its [[Multiple roots of a polynomial|multiplicity as a root]] of the characteristic polynomial, that is, the largest integer ''k'' such that (''λ'' − ''λ''<sub>''i''</sub>)<sup>''k''</sup> [[polynomial division|divides evenly]] that polynomial.{{sfn|Nering|1970|p=107}}{{sfn|Fraleigh|1976|p=358}}{{sfn|Golub|Van Loan|1996|p=316}}

Suppose a matrix ''A'' has dimension ''n'' and ''d'' ≤ ''n'' distinct eigenvalues. Whereas Equation ({{EquationNote|4}}) factors the characteristic polynomial of ''A'' into the product of ''n'' linear terms with some terms potentially repeating, the characteristic polynomial can instead be written as the product of ''d'' terms each corresponding to a distinct eigenvalue and raised to the power of the algebraic multiplicity,
:<math>|A - \lambda I| = (\lambda_1 - \lambda)^{\mu_A(\lambda_1)}(\lambda_2 - \lambda)^{\mu_A(\lambda_2)} \cdots (\lambda_d - \lambda)^{\mu_A(\lambda_d)}.</math>

If ''d'' = ''n'' then the right-hand side is the product of ''n'' linear terms and this is the same as Equation ({{EquationNote|4}}). The size of each eigenvalue's algebraic multiplicity is related to the dimension ''n'' as
:<math>\begin{align}
      1 &\leq \mu_A(\lambda_i) \leq n, \\
  \mu_A &= \sum_{i=1}^d \mu_A\left(\lambda_i\right) = n.
\end{align} </math>

If ''μ''<sub>''A''</sub>(''λ''<sub>''i''</sub>) = 1, then ''λ''<sub>''i''</sub> is said to be a ''simple eigenvalue''.{{sfn|Golub|Van Loan|1996|p=316}} If ''μ''<sub>''A''</sub>(''λ''<sub>''i''</sub>) equals the geometric multiplicity of ''λ''<sub>''i''</sub>, ''γ''<sub>''A''</sub>(''λ''<sub>''i''</sub>), defined in the next section, then ''λ''<sub>''i''</sub> is said to be a ''semisimple eigenvalue''.

===Eigenspaces, geometric multiplicity, and the eigenbasis for matrices===
<!-- Geometric multiplicity redirects here -->
Given a particular eigenvalue ''λ'' of the ''n'' by ''n'' matrix ''A'', define the [[Set (mathematics)|set]] ''E'' to be all vectors '''''v''''' that satisfy Equation ({{EquationNote|2}}),
:<math>E = \left\{\mathbf{v} : (A - \lambda I)\mathbf{v} = 0\right\}.</math>

On one hand, this set is precisely the [[kernel (linear algebra)|kernel]] or nullspace of the matrix (''A'' − ''λI''). On the other hand, by definition, any nonzero vector that satisfies this condition is an eigenvector of ''A'' associated with ''λ''. So, the set ''E'' is the [[Union (set theory)|union]] of the zero vector with the set of all eigenvectors of ''A'' associated with ''λ'', and ''E'' equals the nullspace of (''A'' − ''λI''). ''E'' is called the '''eigenspace''' or '''characteristic space''' of ''A'' associated with ''λ''.{{sfn|Anton|1987|pp=305,307}}{{sfn|Nering|1970|p=107}} In general ''λ'' is a complex number and the eigenvectors are complex ''n'' by 1 matrices. A property of the nullspace is that it is a [[linear subspace]], so ''E'' is a linear subspace of ℂ<sup>''n''</sup>.

Because the eigenspace ''E'' is a linear subspace, it is [[closure (mathematics)|closed]] under addition. That is, if two vectors ''u'' and ''v'' belong to the set ''E'', written {{nowrap|''u'', ''v'' ∈ ''E''}}, then {{nowrap|(''u'' + ''v'') ∈ ''E''}} or equivalently ''A''(''u'' + ''v'') = ''λ''(''u'' + ''v''). This can be checked using the [[distributive property]] of matrix multiplication. Similarly, because ''E'' is a linear subspace, it is closed under scalar multiplication. That is, if {{nowrap|''v'' ∈ ''E''}} and α is a complex number,  {{nowrap|(''αv'') ∈ ''E''}} or equivalently ''A''(α''v'') = ''λ''(''αv''). This can be checked by noting that multiplication of complex matrices by complex numbers is [[commutative property|commutative]]. As long as ''u'' + ''v'' and ''αv'' are not zero, they are also eigenvectors of ''A'' associated with ''λ''.

The dimension of the eigenspace ''E'' associated with ''λ'', or equivalently the maximum number of linearly independent eigenvectors associated with ''λ'', is referred to as the eigenvalue's '''geometric multiplicity''' ''γ''<sub>''A''</sub>(''λ''). Because ''E'' is also the nullspace of (''A'' − ''λI''), the geometric multiplicity of ''λ'' is the dimension of the nullspace of (''A'' − ''λI''), also called the ''nullity'' of (''A'' − ''λI''), which relates to the dimension and rank of (''A'' − ''λI'') as
:<math>\gamma_A(\lambda) = n - \operatorname{rank}(A - \lambda I).</math>

Because of the definition of eigenvalues and eigenvectors, an eigenvalue's geometric multiplicity must be at least one, that is, each eigenvalue has at least one associated eigenvector. Furthermore, an eigenvalue's geometric multiplicity cannot exceed its algebraic multiplicity. Additionally, recall that an eigenvalue's algebraic multiplicity cannot exceed ''n''.
:<math> 1 \le \gamma_A(\lambda) \le \mu_A(\lambda) \le n</math>

To prove the inequality <math>\gamma_A(\lambda)\le\mu_A(\lambda)</math>, consider how the definition of geometric multiplicity implies the existence of <math>\gamma_A(\lambda)</math> orthonormal eigenvectors <math>\boldsymbol{v}_1,\, \ldots,\, \boldsymbol{v}_{\gamma_A(\lambda)}</math>, such that <math>A \boldsymbol{v}_k = \lambda \boldsymbol{v}_k</math>. We can therefore find a (unitary) matrix <math>V</math> whose first <math>\gamma_A(\lambda)</math> columns are these eigenvectors, and whose remaining columns can be any orthonormal set of <math>n - \gamma_A(\lambda)</math> vectors orthogonal to these eigenvectors of <math>A</math>. Then <math>V</math> has full rank and is therefore invertible, and <math>AV=VD</math> with <math>D</math> a matrix whose top left block is the diagonal matrix <math>\lambda I_{\gamma_A(\lambda)}</math>. This implies that <math>(A - \xi I)V = V(D - \xi I)</math>. In other words, <math>A - \xi I</math> is similar to <math>D - \xi I</math>, which implies that <math>\det(A - \xi I) = \det(D - \xi I)</math>. But from the definition of <math>D</math> we know that <math>\det(D - \xi I)</math> contains a factor <math>(\xi - \lambda)^{\gamma_A(\lambda)}</math>, which means that the algebraic multiplicity of <math>\lambda</math> must satisfy <math>\mu_A(\lambda) \ge \gamma_A(\lambda)</math>.

Suppose <math>A</math> has <math>d \leq n</math> distinct eigenvalues <math>\lambda_1, ..., \lambda_d</math>, where the geometric multiplicity of <math>\lambda_i</math> is <math>\gamma_A (\lambda_i)</math>. The total geometric multiplicity of <math>A</math>,
:<math>\begin{align}
  \gamma_A &= \sum_{i=1}^d \gamma_A(\lambda_i), \\
         d &\le \gamma_A \le n,
\end{align}</math>

is the dimension of the [[Linear subspace#Sum|sum]] of all the eigenspaces of <math>A</math>'s eigenvalues, or equivalently the maximum number of linearly independent eigenvectors of <math>A</math>. If <math>\gamma_A=n</math>, then
* The direct sum of the eigenspaces of all of <math>A</math>'s eigenvalues is the entire vector space <math>\mathbb{C}^n</math>.
* A basis of <math>\mathbb{C}^n</math> can be formed from <math>n</math> linearly independent eigenvectors of <math>A</math>; such a basis is called an '''eigenbasis'''
* Any vector in <math>\mathbb{C}^n</math> can be written as a linear combination of eigenvectors of <math>A</math>.

===Additional properties of eigenvalues===
Let <math>A</math> be an arbitrary <math>n \times n</math> matrix of complex numbers with eigenvalues <math>\lambda_1, ..., \lambda_n</math>. Each eigenvalue appears <math>\mu_A(\lambda_i)</math> times in this list, where <math>\mu_A(\lambda_i)</math> is the eigenvalue's algebraic multiplicity. The following are properties of this matrix and its eigenvalues:
* The [[trace (linear algebra)|trace]] of <math>A</math>, defined as the sum of its diagonal elements, is also the sum of all eigenvalues,
*: <math>\operatorname{tr}(A) = \sum_{i=1}^n a_{ii} = \sum_{i=1}^n \lambda_i = \lambda_1 + \lambda_2 + \cdots + \lambda_n.</math>{{sfn|Beauregard|Fraleigh|1973|p=307}}{{sfn|Herstein|1964|p=272}}{{sfn|Nering|1970|pp=115–116}}
* The [[determinant]] of <math>A</math> is the product of all its eigenvalues,
*: <math>\det(A) = \prod_{i=1}^n \lambda_i = \lambda_1\lambda_2 \cdots \lambda_n.</math>{{sfn|Beauregard|Fraleigh|1973|p=307}}{{sfn|Herstein|1964|p=290}}{{sfn|Nering|1970|p=116}}
* The eigenvalues of the <math>k</math><sup>th</sup> power of <math>A</math>; i.e., the eigenvalues of <math>A^k</math>, for any positive integer <math>k</math>, are <math>\lambda_1^k, ..., \lambda_n^k</math>.
* The matrix <math>A</math> is [[invertible matrix|invertible]] if and only if every eigenvalue is nonzero.
* If <math>A</math> is invertible, then the eigenvalues of <math>A^{-1}</math> are <math>\frac{1}{\lambda_1}, ..., \frac{1}{\lambda_n}</math> and each eigenvalue's geometric multiplicity coincides. Moreover, since the characteristic polynomial of the inverse is the [[reciprocal polynomial]] of the original, the eigenvalues share the same algebraic multiplicity.
* If <math>A</math> is equal to its [[conjugate transpose]] <math>A^*</math>, or equivalently if <math>A</math> is [[Hermitian matrix|Hermitian]], then every eigenvalue is real. The same is true of any [[symmetric matrix|symmetric]] real matrix.
* If <math>A</math> is not only Hermitian but also [[positive-definite matrix|positive-definite]], positive-semidefinite, negative-definite, or negative-semidefinite, then every eigenvalue is positive, non-negative, negative, or non-positive, respectively.
* If <math>A</math> is [[unitary matrix|unitary]], every eigenvalue has absolute value <math>|\lambda_i|=1</math>.
* if <math>A</math> is a <math>n\times n</math> matrix and <math>\{\lambda_1,\ldots,\lambda_k\}</math> are its eigenvalues, then the eigenvalues of matrix <math>I+A</math> (where <math>I</math> is the identity matrix) are <math>\{\lambda_1+1,\ldots,\lambda_k+1\}</math>. Moreover, if <math>\alpha\in\mathbb C</math>, the eigenvalues of <math>\alpha I+A</math> are <math>\{\lambda_1+\alpha,\ldots,\lambda_k+\alpha\}</math>. More generally, for a polynomial <math>P</math> the eigenvalues of matrix <math>P(A)</math> are <math>\{P(\lambda_1), \ldots, P(\lambda_k)\}</math>.

=== Left and right eigenvectors ===
{{see also|left and right (algebra)}}

Many disciplines traditionally represent vectors as matrices with a single column rather than as matrices with a single row. For that reason, the word "eigenvector" in the context of matrices almost always refers to a '''right eigenvector''', namely a ''column'' vector that ''right'' multiplies the <math>n \times n</math> matrix <math>A</math> in the defining equation, Equation ({{EquationNote|1}}),
:<math>Av = \lambda v.</math>

The eigenvalue and eigenvector problem can also be defined for ''row'' vectors that ''left'' multiply matrix <math>A</math>. In this formulation, the defining equation is
:<math>uA = \kappa u,</math>

where <math>\kappa</math> is a scalar and <math>u</math> is a <math>1 \times n</math> matrix. Any row vector <math>u</math> satisfying this equation is called a '''left eigenvector''' of <math>A</math> and <math>\kappa</math> is its associated eigenvalue. Taking the transpose of this equation,
:<math>A^\textsf{T} u^\textsf{T} = \kappa u^\textsf{T}.</math>

Comparing this equation to Equation ({{EquationNote|1}}), it follows immediately that a left eigenvector of <math>A</math> is the same as the transpose of a right eigenvector of <math>A^\textsf{T}</math>, with the same eigenvalue. Furthermore, since the characteristic polynomial of <math>A^\textsf{T}</math> is the same as the characteristic polynomial of <math>A</math>, the eigenvalues of the left eigenvectors of <math>A</math> are the same as the eigenvalues of the right eigenvectors of <math>A^\textsf{T}</math>.

===Diagonalization and the eigendecomposition===
{{main|Eigendecomposition of a matrix}}

Suppose the eigenvectors of ''A'' form a basis, or equivalently ''A'' has ''n'' linearly independent eigenvectors ''v''<sub>1</sub>, ''v''<sub>2</sub>, ..., ''v''<sub>''n''</sub> with associated eigenvalues ''λ''<sub>1</sub>, ''λ''<sub>2</sub>, ..., ''λ''<sub>''n''</sub>. The eigenvalues need not be distinct. Define a square matrix ''Q'' whose columns are the ''n'' linearly independent eigenvectors of ''A'',
: <math>Q = \begin{bmatrix} v_1 & v_2 & \cdots & v_n \end{bmatrix}.</math>

Since each column of ''Q'' is an eigenvector of ''A'', right multiplying ''A'' by ''Q'' scales each column of ''Q'' by its associated eigenvalue,
: <math>AQ = \begin{bmatrix} \lambda_1 v_1 & \lambda_2 v_2 & \cdots & \lambda_n v_n \end{bmatrix}.</math>

With this in mind, define a diagonal matrix Λ where each diagonal element Λ<sub>''ii''</sub> is the eigenvalue associated with the ''i''th column of ''Q''. Then
: <math>AQ = Q\Lambda.</math>

Because the columns of ''Q'' are linearly independent, Q is invertible. Right multiplying both sides of the equation by ''Q''<sup>−1</sup>,
: <math>A = Q\Lambda Q^{-1},</math>

or by instead left multiplying both sides by ''Q''<sup>−1</sup>,
: <math>Q^{-1}AQ = \Lambda.</math>

''A'' can therefore be decomposed into a matrix composed of its eigenvectors, a diagonal matrix with its eigenvalues along the diagonal, and the inverse of the matrix of eigenvectors. This is called the [[eigendecomposition of a matrix|eigendecomposition]] and it is a [[matrix similarity|similarity transformation]]. Such a matrix ''A'' is said to be ''similar'' to the diagonal matrix Λ or ''[[diagonalizable matrix|diagonalizable]]''. The matrix ''Q'' is the change of basis matrix of the similarity transformation. Essentially, the matrices ''A'' and Λ represent the same linear transformation expressed in two different bases. The eigenvectors are used as the basis when representing the linear transformation as&nbsp;Λ.

Conversely, suppose a matrix ''A'' is diagonalizable. Let ''P'' be a non-singular square matrix such that ''P''<sup>−1</sup>''AP'' is some diagonal matrix ''D''. Left multiplying both by ''P'', ''AP'' = ''PD''. Each column of ''P'' must therefore be an eigenvector of ''A'' whose eigenvalue is the corresponding diagonal element of ''D''. Since the columns of ''P'' must be linearly independent for ''P'' to be invertible, there exist ''n'' linearly independent eigenvectors of ''A''. It then follows that the eigenvectors of ''A'' form a basis if and only if ''A'' is diagonalizable.

A matrix that is not diagonalizable is said to be [[defective matrix|defective]]. For defective matrices, the notion of eigenvectors generalizes to [[generalized eigenvector]]s and the diagonal matrix of eigenvalues generalizes to the [[Jordan normal form]]. Over an algebraically closed field, any matrix ''A'' has a [[Jordan normal form]] and therefore admits a basis of generalized eigenvectors and a decomposition into [[generalized eigenspace]]s.

===Variational characterization===
{{main|Min-max theorem}}

In the [[Hermitian matrix|Hermitian]] case, eigenvalues can be given a variational characterization. The largest eigenvalue of <math>H</math> is the maximum value of the [[quadratic form]] <math>x^\textsf{T} H x/x^\textsf{T} x</math>. A value of <math>x</math> that realizes that maximum, is an eigenvector.

===Matrix examples===

====Two-dimensional matrix example====

[[File:Eigenvectors.gif|right|frame|The transformation matrix ''A'' = <math>\bigl[\begin{smallmatrix} 2 & 1\\ 1 & 2 \end{smallmatrix}\bigr]</math> preserves the direction of purple vectors parallel to ''v''<sub>''λ''=1</sub> = [1 −1]<sup>T</sup> and blue vectors parallel to ''v''<sub>''λ''=3</sub> = [1 1]<sup>T</sup>. The red vectors are not parallel to either eigenvector, so, their directions are changed by the transformation. The lengths of the purple vectors are unchanged after the transformation (due to their eigenvalue of 1), while blue vectors  are three times the length of the original (due to their eigenvalue of 3). See also: [[:File:Eigenvectors-extended.gif|An extended version, showing all four quadrants]].]]

Consider the matrix
:<math>A = \begin{bmatrix}
  2 & 1\\
  1 & 2
\end{bmatrix}.</math>

The figure on the right shows the effect of this transformation on point coordinates in the plane.
The eigenvectors ''v'' of this transformation satisfy Equation ({{EquationNote|1}}), and the values of ''λ'' for which the determinant of the matrix (''A''&nbsp;−&nbsp;''λI'') equals zero are the eigenvalues.

Taking the determinant to find characteristic polynomial of ''A'',
:<math>\begin{align}
  |A - \lambda I| & = \left|\begin{bmatrix}
    2 & 1 \\
    1 & 2
  \end{bmatrix} - \lambda\begin{bmatrix}
    1 & 0 \\
    0 & 1
  \end{bmatrix}\right| = \begin{vmatrix}
    2 - \lambda & 1 \\
    1           & 2 - \lambda
  \end{vmatrix}, \\[6pt]
                  & = 3 - 4\lambda + \lambda^2.
\end{align}</math>
Setting the characteristic polynomial equal to zero, it has roots at {{nowrap|1=''λ'' = 1}} and {{nowrap|1=''λ'' = 3}}, which are the two eigenvalues of ''A''.

For {{nowrap|1=''λ'' = 1}}, Equation ({{EquationNote|2}}) becomes,
:<math>(A - I)v_{\lambda=1} = \begin{bmatrix} 1 & 1\\ 1 & 1\end{bmatrix}\begin{bmatrix}v_1 \\ v_2\end{bmatrix} = \begin{bmatrix}0 \\ 0\end{bmatrix}.</math>

Any nonzero vector with ''v''<sub>1</sub> = −''v''<sub>2</sub> solves this equation. Therefore,
:<math>v_{\lambda=1} = \begin{bmatrix} 1 \\ -1 \end{bmatrix}</math>

is an eigenvector of ''A'' corresponding to ''λ'' = 1, as is any scalar multiple of this vector.

For {{nowrap|1=''λ'' = 3}}, Equation ({{EquationNote|2}}) becomes
:<math>(A - 3I)v_{\lambda=3} =
  \begin{bmatrix} -1 & 1\\ 1 & -1 \end{bmatrix}
    \begin{bmatrix} v_1 \\ v_2 \end{bmatrix} =
  \begin{bmatrix} 0 \\ 0 \end{bmatrix}.
</math>

Any nonzero vector with ''v''<sub>1</sub> = ''v''<sub>2</sub> solves this equation. Therefore,
:<math>v_{\lambda=3} = \begin{bmatrix} 1 \\ 1 \end{bmatrix}</math>

is an eigenvector of ''A'' corresponding to ''λ'' = 3, as is any scalar multiple of this vector.

Thus, the vectors ''v''<sub>''λ''=1</sub> and ''v''<sub>''λ''=3</sub> are eigenvectors of ''A'' associated with the eigenvalues {{nowrap|1=''λ'' = 1}} and {{nowrap|1=''λ'' = 3}}, respectively.

====Three-dimensional matrix example====
Consider the matrix
:<math>A = \begin{bmatrix}
  2 & 0 & 0 \\
  0 & 3 & 4 \\
  0 & 4 & 9
\end{bmatrix}.</math>

The characteristic polynomial of ''A'' is
:<math>\begin{align}
  |A-\lambda I| &= \left|\begin{bmatrix}
    2 & 0 & 0 \\
    0 & 3 & 4 \\
    0 & 4 & 9
  \end{bmatrix} - \lambda\begin{bmatrix}
    1 & 0 & 0 \\
    0 & 1 & 0 \\
    0 & 0 & 1
  \end{bmatrix}\right| =
  \begin{vmatrix}
    2 - \lambda & 0 & 0 \\
    0 & 3 - \lambda & 4 \\
    0 & 4 & 9 - \lambda
  \end{vmatrix}, \\[6pt]
                &= (2 - \lambda)\bigl[(3 - \lambda)(9 - \lambda) - 16\bigr] 
                 = -\lambda^3 + 14\lambda^2 - 35\lambda + 22.
\end{align}</math>

The roots of the characteristic polynomial are 2, 1, and 11, which are the only three eigenvalues of ''A''. These eigenvalues correspond to the eigenvectors <math>\begin{bmatrix} 1 & 0 & 0 \end{bmatrix}^\textsf{T},</math> <math>\begin{bmatrix} 0 & -2 & 1 \end{bmatrix}^\textsf{T},</math> and <math>\begin{bmatrix} 0 & 1 & 2 \end{bmatrix}^\textsf{T}</math>, or any nonzero multiple thereof.

====Three-dimensional matrix example with complex eigenvalues====
Consider the [[permutation matrix|cyclic permutation matrix]]
:<math>A = \begin{bmatrix}
  0 & 1 & 0\\
  0 & 0 & 1\\
  1 & 0 & 0
\end{bmatrix}.</math>

This matrix shifts the coordinates of the vector up by one position and moves the first coordinate to the bottom. Its characteristic polynomial is 1&nbsp;−&nbsp;''λ''<sup>3</sup>, whose roots are
:<math>\begin{align}
  \lambda_1 &= 1 \\
  \lambda_2 &= -\frac{1}{2} + \mathbf{i}\frac{\sqrt{3}}{2} \\
  \lambda_3 &= \lambda_2^* = -\frac{1}{2} - \mathbf{i}\frac{\sqrt{3}}{2}
\end{align}</math>

where <math>\mathbf{i}</math> is an imaginary unit with <math>\mathbf{i}^2 = -1.</math>

For the real eigenvalue ''λ''<sub>1</sub> = 1, any vector with three equal nonzero entries is an eigenvector. For example,
:<math>
    A \begin{bmatrix} 5\\ 5\\ 5 \end{bmatrix} =
    \begin{bmatrix} 5\\ 5\\ 5 \end{bmatrix} =
    1 \cdot \begin{bmatrix} 5\\ 5\\ 5 \end{bmatrix}.
</math>

For the complex conjugate pair of imaginary eigenvalues,
:<math>\lambda_2\lambda_3 = 1, \quad \lambda_2^2 = \lambda_3, \quad \lambda_3^2 = \lambda_2.</math>

Then
:<math>
  A \begin{bmatrix} 1 \\ \lambda_2 \\ \lambda_3 \end{bmatrix} =
    \begin{bmatrix} \lambda_2 \\ \lambda_3 \\ 1 \end{bmatrix} =
    \lambda_2 \cdot \begin{bmatrix} 1 \\ \lambda_2 \\ \lambda_3 \end{bmatrix},
</math>

and
:<math>
  A \begin{bmatrix} 1 \\ \lambda_3 \\ \lambda_2 \end{bmatrix} =
    \begin{bmatrix} \lambda_3 \\ \lambda_2 \\ 1 \end{bmatrix} =
    \lambda_3 \cdot \begin{bmatrix} 1 \\ \lambda_3 \\ \lambda_2 \end{bmatrix}.
</math>

Therefore, the other two eigenvectors of ''A'' are complex and are <math>v_{\lambda_2} = \begin{bmatrix} 1 & \lambda_2 & \lambda_3\end{bmatrix}^\textsf{T}</math> and <math>v_{\lambda_3} = \begin{bmatrix} 1 & \lambda_3 & \lambda_2\end{bmatrix}^\textsf{T}</math> with eigenvalues ''λ''<sub>2</sub> and ''λ''<sub>3</sub>, respectively. The two complex eigenvectors also appear in a complex conjugate pair,
:<math>v_{\lambda_2} = v_{\lambda_3}^*.</math>

====Diagonal matrix example====
Matrices with entries only along the main diagonal are called ''[[diagonal matrices]]''.  The eigenvalues of a diagonal matrix are the diagonal elements themselves. Consider the matrix
:<math>A = \begin{bmatrix} 1 & 0 & 0\\ 0 & 2 & 0\\ 0 & 0 & 3\end{bmatrix}.</math>

The characteristic polynomial of ''A'' is
:<math>|A - \lambda I| = (1 - \lambda)(2 - \lambda)(3 - \lambda),</math>

which has the roots {{nowrap|1=''λ''<sub>1</sub> = 1}}, {{nowrap|1=''λ''<sub>2</sub> = 2}}, and {{nowrap|1=''λ''<sub>3</sub> = 3}}. These roots are the diagonal elements as well as the eigenvalues of&nbsp;''A''.

Each diagonal element corresponds to an eigenvector whose only nonzero component is in the same row as that diagonal element. In the example, the eigenvalues correspond to the eigenvectors,
:<math>
  v_{\lambda_1} = \begin{bmatrix} 1\\ 0\\ 0 \end{bmatrix},\quad
  v_{\lambda_2} = \begin{bmatrix} 0\\ 1\\ 0 \end{bmatrix},\quad
  v_{\lambda_3} = \begin{bmatrix} 0\\ 0\\ 1 \end{bmatrix},
</math>

respectively, as well as scalar multiples of these vectors.

====Triangular matrix example====
A matrix whose elements above the main diagonal are all zero is called a ''lower [[triangular matrix]]'', while a matrix whose elements below the main diagonal are all zero is called an ''upper triangular matrix''.  As with diagonal matrices, the eigenvalues of triangular matrices are the elements of the main diagonal.

Consider the lower triangular matrix,
:<math>A = \begin{bmatrix}
  1 & 0 & 0\\
  1 & 2 & 0\\
  2 & 3 & 3
\end{bmatrix}.</math>

The characteristic polynomial of ''A'' is
:<math>|A - \lambda I| = (1 - \lambda)(2 - \lambda)(3 - \lambda),</math>

which has the roots {{nowrap|1=''λ''<sub>1</sub> = 1}}, {{nowrap|1=''λ''<sub>2</sub> = 2}}, and {{nowrap|1=''λ''<sub>3</sub> = 3}}. These roots are the diagonal elements as well as the eigenvalues of&nbsp;''A''.

These eigenvalues correspond to the eigenvectors,
:<math>
  v_{\lambda_1} = \begin{bmatrix} 1\\ -1\\  \frac{1}{2}\end{bmatrix},\quad
  v_{\lambda_2} = \begin{bmatrix} 0\\  1\\ -3\end{bmatrix},\quad
  v_{\lambda_3} = \begin{bmatrix} 0\\  0\\  1\end{bmatrix},
</math>

respectively, as well as scalar multiples of these vectors.

====Matrix with repeated eigenvalues example====
As in the previous example, the lower triangular matrix
:<math>A = \begin{bmatrix}
  2 & 0 & 0 & 0 \\
  1 & 2 & 0 & 0 \\
  0 & 1 & 3 & 0  \\
  0 & 0 & 1 & 3 
\end{bmatrix},</math>

has a characteristic polynomial that is the product of its diagonal elements,
:<math>|A - \lambda I| = \begin{vmatrix}
    2 - \lambda & 0 & 0 & 0 \\
    1 & 2- \lambda & 0 & 0 \\
    0 & 1 & 3- \lambda & 0  \\
    0 & 0 & 1 & 3- \lambda 
  \end{vmatrix} =
  (2 - \lambda)^2(3 - \lambda)^2.
</math>

The roots of this polynomial, and hence the eigenvalues, are 2 and 3. The ''algebraic multiplicity'' of each eigenvalue is 2; in other words they are both double roots. The sum of the algebraic multiplicities of each distinct eigenvalue is ''μ''<sub>''A''</sub> = 4 = ''n'', the order of the characteristic polynomial and the dimension of ''A''.

On the other hand, the ''geometric multiplicity'' of the eigenvalue 2 is only 1, because its eigenspace is spanned by just one vector <math>\begin{bmatrix} 0 & 1 & -1 & 1 \end{bmatrix}^\textsf{T}</math> and is therefore 1-dimensional. Similarly, the geometric multiplicity of the eigenvalue 3 is 1 because its eigenspace is spanned by just one vector <math>\begin{bmatrix} 0 & 0 & 0 & 1 \end{bmatrix}^\textsf{T}</math>. The total geometric multiplicity ''γ''<sub>''A''</sub> is 2, which is the smallest it could be for a matrix with two distinct eigenvalues. Geometric multiplicities are defined in a later section.

==Eigenvalues and eigenfunctions of differential operators==
{{main|Eigenfunction}}

The definitions of eigenvalue and eigenvectors of a linear transformation ''T'' remains valid even if the underlying vector space is an infinite-dimensional [[Hilbert space|Hilbert]] or [[Banach space]]. A widely used class of linear transformations acting on infinite-dimensional spaces are the [[differential operator]]s on [[function space]]s. Let ''D'' be a linear differential operator on the space '''C'''<sup>∞</sup> of infinitely [[derivative|differentiable]] real functions of a real argument ''t''. The eigenvalue equation for ''D'' is the [[differential equation]]
:<math>D f(t) = \lambda f(t)</math>

The functions that satisfy this equation are eigenvectors of ''D'' and are commonly called '''eigenfunctions'''.

===Derivative operator example===

Consider the derivative operator <math>\tfrac{d}{dt}</math> with eigenvalue equation
:<math>\frac{d}{dt}f(t) = \lambda f(t).</math>

This differential equation can be solved by multiplying both sides by ''dt''/''f''(''t'') and integrating. Its solution, the [[exponential function]]
:<math>f(t) = f(0)e^{\lambda t},</math>

is the eigenfunction of the derivative operator. In this case the eigenfunction is itself a function of its associated eigenvalue. In particular, for ''λ'' = 0 the eigenfunction ''f''(''t'') is a constant.

The main [[eigenfunction]] article gives other examples.

==General definition==

The concept of eigenvalues and eigenvectors extends naturally to arbitrary [[linear map|linear transformations]] on arbitrary [[vector space]]s. Let ''V'' be any vector space over some [[field (algebra)|field]] ''K'' of [[scalar (mathematics)|scalars]], and let ''T'' be a linear transformation mapping ''V'' into ''V'',
:<math>T:V \to V.</math>

We say that a nonzero vector '''v''' ∈ ''V'' is an '''eigenvector''' of ''T'' if and only if there exists a scalar ''λ'' ∈ ''K'' such that
{{NumBlk|:
 |<math>T(\mathbf{v}) = \lambda \mathbf{v}.</math>
 | {{EquationRef|5}}
}}

This equation is called the eigenvalue equation for ''T'', and the scalar ''λ'' is the '''eigenvalue''' of ''T'' corresponding to the eigenvector '''v'''. ''T''('''v''') is the result of applying the transformation ''T'' to the vector '''v''', while ''λ'''''v''' is the product of the scalar ''λ'' with '''v'''.{{sfn|Korn|Korn|2000|loc=Section 14.3.5a}}{{sfn||Friedberg|Insel|Spence|1989|loc=p. 217}}

===Eigenspaces, geometric multiplicity, and the eigenbasis===

Given an eigenvalue ''λ'', consider the set
:<math>E = \left\{\mathbf{v} : T(\mathbf{v}) = \lambda \mathbf{v}\right\},</math>

which is the union of the zero vector with the set of all eigenvectors associated with&nbsp;''λ''. ''E'' is called the '''eigenspace''' or '''characteristic space''' of ''T'' associated with&nbsp;''λ''.

By definition of a linear transformation,
:<math>\begin{align}
  T(\mathbf{x} + \mathbf{y}) &= T(\mathbf{x}) + T(\mathbf{y}),\\
        T(\alpha \mathbf{x}) &= \alpha T(\mathbf{x}),
\end{align}</math>

for ('''x''','''y''') ∈ ''V'' and α ∈ ''K''. Therefore, if '''u''' and '''v''' are eigenvectors of ''T'' associated with eigenvalue ''λ'', namely '''u''','''v''' ∈ ''E'', then
:<math>\begin{align}
  T(\mathbf{u} + \mathbf{v}) &= \lambda (\mathbf{u} + \mathbf{v}),\\
        T(\alpha \mathbf{v}) &= \lambda (\alpha \mathbf{v}).
\end{align}</math>

So, both '''u''' + '''v''' and α'''v''' are either zero or eigenvectors of ''T'' associated with ''λ'', namely '''u''' + '''v''', α'''v''' ∈ ''E'', and ''E'' is closed under addition and scalar multiplication. The eigenspace ''E'' associated with ''λ'' is therefore a linear subspace of ''V''.<ref>{{harvnb|Nering|1970|p=107}}; {{harvnb|Shilov|1977|p= 109}} [[b:The Book of Mathematical Proofs/Algebra/Linear Transformations#Lemma for the eigenspace|Lemma for the eigenspace]]</ref> If that subspace has dimension 1, it is sometimes called an '''eigenline'''.<ref>{{Cite book|url={{google books |plainurl=y |id=pkESXAcIiCQC|page=111}}|p=111|title=Schaum's Easy Outline of Linear Algebra|last=Lipschutz|first=Seymour|last2=Lipson|first2=Marc|date=2002-08-12|publisher=McGraw Hill Professional|isbn=9780071398800|language=en}}</ref>

The '''geometric multiplicity''' ''γ''<sub>''T''</sub>(''λ'') of an eigenvalue ''λ'' is the dimension of the eigenspace associated with ''λ'', i.e., the maximum number of linearly independent eigenvectors associated with that eigenvalue.{{sfn|Nering|1970|p=107}}{{sfn|Golub|Van Loan|1996|p=316}} By the definition of eigenvalues and eigenvectors, ''γ''<sub>''T''</sub>(''λ'') ≥ 1 because every eigenvalue has at least one eigenvector.

The eigenspaces of ''T'' always form a [[direct sum]]. As a consequence, eigenvectors of ''different'' eigenvalues are always linearly independent. Therefore, the sum of the dimensions of the eigenspaces cannot exceed the dimension ''n'' of the vector space on which ''T'' operates, and there cannot be more than ''n'' distinct eigenvalues.<ref name="Shilov_lemma">For a proof of this lemma, see {{Harvnb|Roman|2008|loc=Theorem 8.2 on p. 186}}; {{Harvnb|Shilov|1977|loc=p. 109}}; {{Harvnb|Hefferon|2001|loc=p. 364}}; {{Harvnb|Beezer|2006|loc=Theorem EDELI on p. 469}}; and [[b:Famous Theorems of Mathematics/Algebra/Linear Transformations#Lemma for linear independence of eigenvectors|Lemma for linear independence of eigenvectors]]</ref>

Any subspace spanned by eigenvectors of ''T'' is an [[invariant subspace]] of ''T'', and the restriction of ''T'' to such a subspace is diagonalizable. Moreover, if the entire vector space ''V'' can be spanned by the eigenvectors of ''T'', or equivalently if the direct sum of the eigenspaces associated with all the eigenvalues of ''T'' is the entire vector space ''V'', then a basis of ''V'' called an '''eigenbasis''' can be formed from linearly independent eigenvectors of ''T''. When ''T'' admits an eigenbasis, ''T'' is diagonalizable.

===Zero vector as an eigenvector===

While the definition of an eigenvector used in this article excludes the [[zero vector]], it is possible to define eigenvalues and eigenvectors such that the zero vector is an eigenvector.<ref>{{Citation|last=Axler|first= Sheldon |title=Linear Algebra Done Right|edition=2nd |chapter=Ch. 5|page= 77}}</ref>

Consider again the eigenvalue equation, Equation ({{EquationNote|5}}). Define an '''eigenvalue''' to be any scalar ''λ'' ∈ ''K'' such that there exists a nonzero vector '''v''' ∈ ''V'' satisfying Equation ({{EquationNote|5}}). It is important that this version of the definition of an eigenvalue specify that the vector be nonzero, otherwise by this definition the zero vector would allow any scalar in ''K'' to be an eigenvalue. Define an '''eigenvector''' '''v''' associated with the eigenvalue ''λ'' to be any vector that, given ''λ'', satisfies Equation ({{EquationNote|5}}). Given the eigenvalue, the zero vector is among the vectors that satisfy Equation ({{EquationNote|5}}), so the zero vector is included among the eigenvectors by this alternate definition.

===Spectral theory===
{{main|Spectral theory}}

If ''λ'' is an eigenvalue of ''T'', then the operator (''T'' − ''λI'') is not one-to-one, and therefore its inverse (''T'' − ''λI'')<sup>−1</sup> does not exist. The converse is true for finite-dimensional vector spaces, but not for infinite-dimensional vector spaces. In general, the operator (''T'' − ''λI'') may not have an inverse even if ''λ'' is not an eigenvalue.

For this reason, in [[functional analysis]] eigenvalues can be generalized to the [[spectrum (functional analysis)|spectrum of a linear operator]] ''T'' as the set of all scalars ''λ'' for which the operator (''T'' − ''λI'') has no [[bounded operator|bounded]] inverse. The spectrum of an operator always contains all its eigenvalues but is not limited to them.

===Associative algebras and representation theory===
{{main|Weight (representation theory)}}

One can generalize the algebraic object that is acting on the vector space, replacing a single operator acting on a vector space with an [[algebra representation]] – an [[associative algebra]] acting on a [[module (mathematics)|module]]. The study of such actions is the field of [[representation theory]].

The [[weight (representation theory)|representation-theoretical concept of weight]] is an analog of eigenvalues, while ''weight vectors'' and ''weight spaces'' are the analogs of eigenvectors and eigenspaces, respectively.

==Dynamic equations==

The simplest [[difference equation]]s have the form
: <math>x_t = a_1 x_{t-1} + a_2 x_{t-2} + \cdots + a_k x_{t-k}.</math>

The solution of this equation for ''x'' in terms of ''t'' is found by using its characteristic equation
: <math>\lambda^k - a_1\lambda^{k-1} - a_2\lambda^{k-2} - \cdots - a_{k-1}\lambda-a_k = 0,</math>

which can be found by stacking into matrix form a set of equations consisting of the above difference equation and the ''k''&nbsp;–&nbsp;1 equations <math>x_{t-1} = x_{t-1},\  \dots,\  x_{t-k+1} = x_{t-k+1},</math> giving a ''k''-dimensional system of the first order in the stacked variable vector <math>\begin{bmatrix} x_t & \cdots & x_{t-k+1} \end{bmatrix}</math> in terms of its once-lagged value, and taking the characteristic equation of this system's matrix. This equation gives ''k'' characteristic roots <math>\lambda_1,\, \ldots,\, \lambda_k,</math> for use in the solution equation
: <math>x_t = c_1\lambda_1^t + \cdots + c_k\lambda_k^t.</math>

A similar procedure is used for solving a [[differential equation]] of the form
: <math>\frac{d^k x}{dt^k} + a_{k-1}\frac{d^{k-1}x}{dt^{k-1}} + \cdots + a_1\frac{dx}{dt} + a_0 x = 0.</math>

==Calculation==
{{main|Eigenvalue algorithm}}
The calculation of eigenvalues and eigenvectors is a topic where theory, as presented in elementary linear algebra textbooks, is often very far from practice.

===Classical method===
The classical method is to first find the eigenvalues, and then calculate the eigenvectors for each eigenvalue. It is in several ways poorly suited for non-exact arithmetics such as [[floating-point]].

====Eigenvalues====
The eigenvalues of a matrix <math>A</math> can be determined by finding the roots of the characteristic polynomial. This is easy for <math> 2 \times 2 </math> matrices, but the difficulty increases rapidly with the size of the matrix.

In theory, the coefficients of the characteristic polynomial can be computed exactly, since they are sums of products of matrix elements; and there are algorithms that can find all the roots of a polynomial of arbitrary degree to any required [[accuracy]].<ref name="TrefethenBau" /> However, this approach is not viable in practice because the coefficients would be contaminated by unavoidable [[round-off error]]s, and the roots of a polynomial can be an extremely sensitive function of the coefficients (as exemplified by [[Wilkinson's polynomial]]).<ref name=TrefethenBau>{{Citation |first1=Lloyd N. |last1=Trefethen |first2=David |last2=Bau |title = Numerical Linear Algebra |publisher=SIAM |year=1997 }}</ref> Even for matrices whose elements are integers the calculation becomes nontrivial, because the sums are very long; the constant term is the [[determinant]], which for an <math> n \times n </math> is a sum of <math> n! </math> different products.{{NoteTag|By doing [[Gaussian elimination]] over [[formal power series]] truncated to <math>n</math> terms it is possible to get away with <math>O(n^4)</math> operations, but that does not take [[combinatorial explosion]] into account.}}

Explicit [[algebraic solution|algebraic formulas]] for the roots of a polynomial exist only if the degree <math>n</math> is 4 or less. According to the [[Abel–Ruffini theorem]] there is no general, explicit and exact algebraic formula for the roots of a polynomial with degree 5 or more. (Generality matters because any polynomial with degree <math>n</math> is the characteristic polynomial of some [[companion matrix]] of order <math>n</math>.) Therefore, for matrices of order 5 or more, the eigenvalues and eigenvectors cannot be obtained by an explicit algebraic formula, and must therefore be computed by approximate [[numerical method]]s. Even the [[Cubic function#General solution to the cubic equation with real coefficients|exact formula]] for the roots of a degree 3 polynomial is numerically impractical.

====Eigenvectors====
Once the (exact) value of an eigenvalue is known, the corresponding eigenvectors can be found by finding nonzero solutions of the eigenvalue equation, that becomes a [[linear system|system of linear equations]] with known coefficients. For example, once it is known that 6 is an eigenvalue of the matrix
:<math>A = \begin{bmatrix} 4 & 1\\ 6 & 3\end{bmatrix}</math>
we can find its eigenvectors by solving the equation <math>A v = 6 v</math>, that is
:<math>\begin{bmatrix} 4 & 1\\ 6 & 3\end{bmatrix}\begin{bmatrix}x \\y\end{bmatrix} = 6 \cdot \begin{bmatrix}x \\y\end{bmatrix}</math>
This matrix equation is equivalent to two [[linear equation]]s
:<math>
  \left\{ \begin{aligned} 4x + y &= 6x \\ 6x + 3y &= 6y\end{aligned} \right.
  </math> {{spaces|4}} that is {{spaces|4}} <math>
  \left\{ \begin{aligned} -2x + y &= 0 \\ 6x - 3y &= 0\end{aligned} \right.
</math>

Both equations reduce to the single linear equation <math>y=2x</math>. Therefore, any vector of the form <math>\begin{bmatrix} a \\ 2a \end{bmatrix}</math>, for any nonzero real number <math>a</math>, is an eigenvector of <math>A</math> with eigenvalue <math>\lambda = 6</math>.

The matrix <math>A</math> above has another eigenvalue <math>\lambda=1</math>. A similar calculation shows that the corresponding eigenvectors are the nonzero solutions of <math>3x+y=0</math>, that is, any vector of the form <math>\begin{bmatrix} b \\ -3b \end{bmatrix}</math>, for any nonzero real number <math>b</math>.

===Simple iterative methods===
{{main|Power iteration}}
The converse approach, of first seeking the eigenvectors and then determining each eigenvalue from its eigenvector, turns out to be far more tractable for computers. The easiest algorithm here consists of picking an arbitrary starting vector and then repeatedly multiplying it with the matrix (optionally normalising the vector to keep its elements of reasonable size); surprisingly this makes the vector converge towards an eigenvector. [[inverse iteration|A variation]] is to instead multiply the vector by <math>(A - \mu I)^{-1}</math>; this causes it to converge to an eigenvector of the eigenvalue closest to <math>\mu \in \mathbb{C}</math>.

If <math>\mathbf{v}</math> is (a good approximation of) an eigenvector of <math>A</math>, then the corresponding eigenvalue can be computed as
: <math> \lambda = \frac{\mathbf{v}^* A\mathbf{v}}{\mathbf{v}^* \mathbf{v}}</math>

where <math>\mathbf{v}^*</math> denotes the [[conjugate transpose]] of <math>\mathbf{v}</math>.

===Modern methods===
Efficient, accurate methods to compute eigenvalues and eigenvectors of arbitrary matrices were not known until the  [[QR algorithm]] was designed in 1961.<ref name=TrefethenBau/> Combining the [[Householder transformation]] with the LU decomposition results in an algorithm with better convergence than the QR algorithm.{{citation needed|date=March 2013}} For large [[Hermitian matrix|Hermitian]] [[sparse matrix|sparse matrices]], the [[Lanczos algorithm]] is one example of an efficient [[iterative method]] to compute eigenvalues and eigenvectors, among several other possibilities.<ref name=TrefethenBau/>

Most numeric methods that compute the eigenvalues of a matrix also determine a set of corresponding eigenvectors as a by-product of the computation, although sometimes implementors choose to discard the eigenvector information as soon as it is no longer needed.

==Applications==

===Eigenvalues of geometric transformations===
The following table presents some example transformations in the plane along with their 2×2 matrices, eigenvalues, and eigenvectors.
{| class="wikitable" style="text-align:center; margin:1em auto 1em auto;"
!
! [[Scaling (geometry)|Scaling]]
! Unequal scaling
! [[Rotation (geometry)|Rotation]]
! [[Shear mapping|Horizontal shear]]
! [[Hyperbolic rotation]]
|-
! Illustration
| [[File:Homothety in two dim.svg|100px|alt=Equal scaling ([[Homothetic transformation|homothety]])]]
| [[File:Unequal scaling.svg|100px|alt=Vertical shrink and horizontal stretch of a unit square.]]
| [[File:Rotation.png|100px|alt=Rotation by 50 degrees]]
| [[File:Shear.svg|100px|center|alt=Horizontal shear mapping]]
| [[File:Squeeze r=1.5.svg|100px]]
|- style="vertical-align:top"
! Matrix
| <math>\begin{bmatrix}k & 0\\ 0 & k\end{bmatrix}</math>
| <math>\begin{bmatrix}k_1 & 0\\ 0 & k_2\end{bmatrix}</math>
| <math>\begin{bmatrix}c & -s\\ s & c\end{bmatrix}</math><br /><math>c = \cos\theta</math><br /><math>s = \sin\theta</math>
| <math> \begin{bmatrix}1 & k\\ 0 & 1\end{bmatrix}</math>
| <math>\begin{bmatrix}c & s\\ s & c\end{bmatrix}</math><br /><math>c = \cosh\varphi</math><br /><math>s = \sinh\varphi</math>
|-
! Characteristic<br />polynomial
| <math>\ (\lambda - k)^2</math>
| <math>(\lambda - k_1)(\lambda - k_2)</math>
| <math>\lambda^2 - 2c\lambda + 1</math>
| <math>\ (\lambda - 1)^2</math>
| <math>\lambda^2 - 2c\lambda + 1</math>
|-
! Eigenvalues, <math>\lambda_i</math>
| <math>\lambda_1 = \lambda_2 = k</math>
| <math>\lambda_1 = k_1</math><br /><math>\lambda_2 = k_2</math>
| <math>\lambda_1 = e^{\mathbf{i}\theta} = c + s\mathbf{i}</math><br /><math>\lambda_2 = e^{-\mathbf{i}\theta} = c - s\mathbf{i}</math>
| <math>\lambda_1 = \lambda_2 = 1</math>
| <math>\lambda_1 = e^\varphi</math><br /><math>\lambda_2 = e^{-\varphi}</math>,
|-
! Algebraic {{abbr|mult.|multiplicity}},<br /><math>\mu_i = \mu(\lambda_i)</math>
| <math>\mu_1 = 2</math>
| <math>\mu_1 = 1</math><br /><math>\mu_2 = 1</math>
| <math>\mu_1 = 1</math><br /><math>\mu_2 = 1</math>
| <math>\mu_1 = 2</math>
| <math>\mu_1 = 1</math><br /><math>\mu_2 = 1</math>
|-
! Geometric {{abbr|mult.|multiplicity}},<br /><math>\gamma_i = \gamma(\lambda_i)</math>
| <math>\gamma_1 = 2</math>
| <math>\gamma_1 = 1</math><br /><math>\gamma_2 = 1</math>
| <math>\gamma_1 = 1</math><br /><math>\gamma_2 = 1</math>
| <math>\gamma_1 = 1</math>
| <math>\gamma_1 = 1</math><br /><math>\gamma_2 = 1</math>
|-
! Eigenvectors
| All nonzero vectors
| <math>\begin{align}
  u_1 &= \begin{bmatrix} 1\\ 0\end{bmatrix} \\
  u_2 &= \begin{bmatrix} 0\\ 1\end{bmatrix}
\end{align}</math>
| <math>\begin{align}
  u_1 &= \begin{bmatrix}{\ } 1\\ -\mathbf{i}\end{bmatrix} \\
  u_2 &= \begin{bmatrix}{\ } 1\\ +\mathbf{i}\end{bmatrix}
\end{align}</math>
| <math>u_1 = \begin{bmatrix} 1\\ 0\end{bmatrix}</math>
| <math>\begin{align}
  u_1 &= \begin{bmatrix}{\ } 1\\ {\ }1\end{bmatrix} \\
  u_2 &= \begin{bmatrix}{\ } 1\\ -1\end{bmatrix}.
\end{align}</math>
|}

The characteristic equation for a rotation is a [[quadratic equation]] with [[discriminant]] <math>D = -4(\sin\theta)^2</math>, which is a negative number whenever {{mvar|θ}} is not an integer multiple of 180°. Therefore, except for these special cases, the two eigenvalues are complex numbers, <math>\cos\theta \pm \mathbf{i}\sin\theta</math>; and all eigenvectors have non-real entries. Indeed, except for those special cases, a rotation changes the direction of every nonzero vector in the plane.

A linear transformation that takes a square to a rectangle of the same area (a [[squeeze mapping]]) has reciprocal eigenvalues.

===Schrödinger equation===<!-- This section is linked from [[Eigenstate]] -->

[[File:HAtomOrbitals.png|thumb|271px|The [[wavefunction]]s associated with the [[bound state]]s of an [[electron]] in a [[hydrogen atom]] can be seen as the eigenvectors of the [[hydrogen atom|hydrogen atom Hamiltonian]] as well as of the [[angular momentum operator]]. They are associated with eigenvalues interpreted as their energies (increasing downward: <math>n = 1,\, 2,\, 3,\, \ldots</math>) and [[angular momentum]] (increasing across: <!-- do not italicize! -->s, p, d, ...). The illustration shows the square of the absolute value of the wavefunctions. Brighter areas correspond to higher [[probability density function|probability density]] for a position [[measurement in quantum mechanics|measurement]]. The center of each figure is the [[atomic nucleus]], a [[proton]].]]

An example of an eigenvalue equation where the transformation <math>T</math> is represented in terms of a differential operator is the time-independent [[Schrödinger equation]] in [[quantum mechanics]]:

: <math>H\psi_E = E\psi_E \,</math>

where <math>H</math>, the [[Hamiltonian (quantum mechanics)|Hamiltonian]], is a second-order [[differential operator]] and <math>\psi_E</math>, the [[wavefunction]], is one of its eigenfunctions corresponding to the eigenvalue <math>E</math>, interpreted as its [[energy]].

However, in the case where one is interested only in the [[bound state]] solutions of the Schrödinger equation, one looks for <math>\psi_E</math> within the space of [[Square-integrable function|square integrable]] functions. Since this space is a [[Hilbert space]] with a well-defined [[scalar product]], one can introduce a [[Basis (linear algebra)|basis set]] in which <math>\psi_E</math> and <math>H</math> can be represented as a one-dimensional array (i.e., a vector) and a matrix respectively. This allows one to represent the Schrödinger equation in a matrix form.

The [[bra–ket notation]] is often used in this context. A vector, which represents a state of the system, in the Hilbert space of square integrable functions is represented by <math>|\Psi_E\rangle</math>. In this notation, the Schrödinger equation is:
: <math>H|\Psi_E\rangle = E|\Psi_E\rangle</math>

where <math>|\Psi_E\rangle</math> is an '''eigenstate''' of <math>H</math> and <math>E</math> represents the eigenvalue. <math>H</math> is an [[observable]] [[self adjoint operator]], the infinite-dimensional analog of Hermitian matrices. As in the matrix case, in the equation above <math>H|\Psi_E\rangle</math> is understood to be the vector obtained by application of the transformation <math>H</math> to <math>|\Psi_E\rangle</math>.

===Molecular orbitals===
In [[quantum mechanics]], and in particular in [[atomic physics|atomic]] and [[molecular physics]], within the [[Hartree–Fock]] theory, the [[atomic orbital|atomic]] and [[molecular orbital]]s can be defined by the eigenvectors of the [[Fock operator]]. The corresponding eigenvalues are interpreted as [[ionization potential]]s via [[Koopmans' theorem]]. In this case, the term eigenvector is used in a somewhat more general meaning, since the Fock operator is explicitly dependent on the orbitals and their eigenvalues. Thus, if one wants to underline this aspect, one speaks of nonlinear eigenvalue problems. Such equations are usually solved by an [[iteration]] procedure, called in this case [[self-consistent field]] method. In [[quantum chemistry]], one often represents the Hartree–Fock equation in a non-[[orthogonal]] [[basis set (chemistry)|basis set]]. This particular representation is a [[generalized eigenvalue problem]] called [[Roothaan equations]].

===Geology and glaciology===
In [[geology]], especially in the study of [[glacial till]], eigenvectors and eigenvalues are used as a method by which a mass of information of a clast fabric's constituents' orientation and dip can be summarized in a 3-D space by six numbers. In the field, a geologist may collect such data for hundreds or thousands of [[clasts]] in a soil sample, which can only be compared graphically such as in a Tri-Plot (Sneed and Folk) diagram,<ref>{{Citation|doi=10.1002/1096-9837(200012)25:13<1473::AID-ESP158>3.0.CO;2-C|last1=Graham|first1=D.|last2=Midgley|first2= N.|title=Graphical representation of particle shape using triangular diagrams: an Excel spreadsheet method|year= 2000|journal= [[Earth Surface Processes and Landforms]] |volume=25|pages=1473–1477|issue=13|bibcode = 2000ESPL...25.1473G }}</ref><ref>{{Citation|doi=10.1086/626490|last1=Sneed|first1= E. D.|last2=Folk|first2= R. L.|year= 1958|title=Pebbles in the lower Colorado River, Texas, a study of particle morphogenesis|journal= Journal of Geology|volume= 66|issue=2|pages=114–150|bibcode=1958JG.....66..114S}}</ref> or as a Stereonet on a Wulff Net.<ref>{{Citation |last1=Knox-Robinson |first1=C. |last2=Gardoll |first2=Stephen J. |year=1998 |page=243 |volume=24 |journal=Computers & Geosciences |title=GIS-stereoplot: an interactive stereonet plotting module for ArcView 3.0 geographic information system |issue=3 |doi=10.1016/S0098-3004(97)00122-2 |bibcode=1998CG.....24..243K}}</ref>

The output for the orientation tensor is in the three orthogonal (perpendicular) axes of space. The three eigenvectors are ordered <math>v_1, v_2, v_3</math> by their eigenvalues <math>E_1 \geq E_2 \geq E_3</math>;<ref>[http://www.ruhr-uni-bochum.de/hardrock/downloads.htm Stereo32 software]</ref> <math>v_1</math> then is the primary orientation/dip of clast, <math>v_2</math> is the secondary and <math>v_3</math> is the tertiary, in terms of strength. The clast orientation is defined as the direction of the eigenvector, on a [[compass rose]] of [[turn (geometry)|360°]]. Dip is measured as the eigenvalue, the modulus of the tensor: this is valued from 0° (no dip) to 90° (vertical). The relative values of <math>E_1</math>, <math>E_2</math>, and <math>E_3</math> are dictated by the nature of the sediment's fabric. If <math>E_1 = E_2 = E_3</math>, the fabric is said to be isotropic. If <math>E_1 = E_2 > E_3</math>, the fabric is said to be planar. If <math>E_1 > E_2 > E_3</math>, the fabric is said to be linear.<ref>{{Citation |last1=Benn |first1=D. |last2=Evans |first2=D. |year=2004 |title=A Practical Guide to the study of Glacial Sediments |location=London |publisher=Arnold |pages=103–107}}</ref>

===Principal component analysis===
[[File:GaussianScatterPCA.png|thumb|right|PCA of the [[multivariate Gaussian distribution]] centered at <math>(1, 3)</math> with a standard deviation of 3 in roughly the <math>(0.878, 0.478)</math> direction and of&nbsp;1 in the orthogonal direction. The vectors shown are unit eigenvectors of the (symmetric, positive-semidefinite) [[covariance matrix]] scaled by the square root of the corresponding eigenvalue. (Just as in the one-dimensional case, the square root is taken because the [[standard deviation]] is more readily visualized than the [[variance]].]]
{{Main|Principal component analysis}}
{{See also|Positive semidefinite matrix|Factor analysis}}

The [[Eigendecomposition of a matrix#Real symmetric matrices|eigendecomposition]] of a [[symmetric matrix|symmetric]] [[positive semidefinite matrix|positive semidefinite]] (PSD) [[positive semidefinite matrix|matrix]] yields an [[orthogonal basis]] of eigenvectors, each of which has a nonnegative eigenvalue. The orthogonal decomposition of a PSD matrix is used in [[multivariate statistics|multivariate analysis]], where the [[sample variance|sample]] [[covariance matrix|covariance matrices]] are PSD. This orthogonal decomposition is called [[principal components analysis]] (PCA) in statistics. PCA studies [[linear relation]]s among variables. PCA is performed on the [[covariance matrix]] or the [[correlation matrix]] (in which each variable is scaled to have its [[sample variance]] equal to one). For the covariance or correlation matrix, the eigenvectors correspond to [[principal components analysis|principal components]] and the eigenvalues to the [[explained variance|variance explained]] by the principal components. Principal component analysis of the correlation matrix provides an [[orthogonal basis|orthonormal eigen-basis]] for the space of the observed data: In this basis, the largest eigenvalues correspond to the principal components that are associated with most of the covariability among a number of observed data.

Principal component analysis is used to study [[data mining|large]] [[data set]]s, such as those encountered in [[bioinformatics]], [[data mining]], [[chemometrics|chemical research]], [[psychometrics|psychology]], and in [[marketing]]. PCA is also popular in psychology, especially within the field of [[psychometrics]]. In [[Q methodology]], the eigenvalues of the correlation matrix determine the Q-methodologist's judgment of ''practical'' significance (which differs from the [[statistical significance]] of [[hypothesis testing]]; cf. [[Scree's test|criteria for determining the number of factors]]). More generally, principal component analysis can be used as a method of [[factor analysis]] in [[structural equation model]]ing.

===Vibration analysis===
[[File:Mode Shape of a Tuning Fork at Eigenfrequency 440.09 Hz.gif|thumb|Mode shape of a tuning fork at eigenfrequency 440.09{{nbsp}}Hz]]
{{Main|Vibration}}

Eigenvalue problems occur naturally in the vibration analysis of mechanical structures with many [[Degrees of freedom (mechanics)|degrees of freedom]]. The eigenvalues are the natural frequencies (or '''eigenfrequencies''') of vibration, and the eigenvectors are the shapes of these vibrational modes. In particular, undamped vibration is governed by
:<math>m\ddot{x} + kx = 0</math>

or
:<math>m\ddot{x} = -kx</math>

that is, acceleration is proportional to position (i.e., we expect <math>x</math> to be sinusoidal in time).

In <math>n</math> dimensions, <math>m</math> becomes a [[mass matrix]] and <math>k</math> a [[stiffness matrix]]. Admissible solutions are then a linear combination of solutions to the [[generalized eigenvalue problem]]
:<math>kx = \omega^2 mx</math>

where <math>\omega^2</math> is the eigenvalue and <math>\omega</math> is the (imaginary) [[angular frequency]]. The principal vibration modes are different from the principal compliance modes, which are the eigenvectors of <math>k</math> alone. Furthermore, [[damped vibration]], governed by
:<math>m\ddot{x} + c\dot{x} + kx = 0</math>

leads to a so-called [[quadratic eigenvalue problem]],
:<math>\left(\omega^2 m + \omega c + k\right)x = 0.</math>

This can be reduced to a generalized eigenvalue problem by [[quadratic eigenvalue problem#Methods of Solution|algebraic manipulation]] at the cost of solving a larger system.

The orthogonality properties of the eigenvectors allows decoupling of the differential equations so that the system can be represented as linear summation of the eigenvectors. The eigenvalue problem of complex structures is often solved using [[finite element analysis]], but neatly generalize the solution to scalar-valued vibration problems.

===Eigenfaces===
[[File:Eigenfaces.png|thumb|200px|[[Eigenface]]s as examples of eigenvectors]]
{{Main|Eigenface}}
In [[image processing]], processed images of faces can be seen as vectors whose components are the [[brightness]]es of each [[pixel]].<ref>{{Citation
 | last1=Xirouhakis
 | first1=A.
 | last2=Votsis
 | first2=G.
 | last3=Delopoulus
 | first3=A.
 | title=Estimation of 3D motion and structure of human faces
 | publisher=National Technical University of Athens
 | url=http://www.image.ece.ntua.gr/papers/43.pdf
 | format=PDF
 | year=2004
}}</ref> The dimension of this vector space is the number of pixels. The eigenvectors of the [[covariance matrix]] associated with a large set of normalized pictures of faces are called '''[[eigenface]]s'''; this is an example of [[principal component analysis]]. They are very useful for expressing any face image as a [[linear combination]] of some of them. In the [[Facial recognition system|facial recognition]] branch of [[biometrics]], eigenfaces provide a means of applying [[data compression]] to faces for [[Recognition of human individuals|identification]] purposes. Research related to eigen vision systems determining hand gestures has also been made.

Similar to this concept, '''eigenvoices''' represent the general direction of variability in human pronunciations of a particular utterance, such as a word in a language. Based on a linear combination of such eigenvoices, a new voice pronunciation of the word can be constructed. These concepts have been found useful in automatic speech recognition systems for speaker adaptation.

===Tensor of moment of inertia===
In [[mechanics]], the eigenvectors of the [[inertia tensor|moment of inertia tensor]] define the [[principal axis (mechanics)|principal axes]] of a [[rigid body]]. The [[tensor]] of moment of [[inertia]] is a key quantity required to determine the rotation of a rigid body around its [[center of mass]].

===Stress tensor===
In [[solid mechanics]], the [[stress (mechanics)|stress]] tensor is symmetric and so can be decomposed into a [[diagonal]] tensor with the eigenvalues on the diagonal and eigenvectors as a basis. Because it is diagonal, in this orientation, the stress tensor has no [[Shear (mathematics)|shear]] components; the components it does have are the principal components.

===Graphs===
In [[spectral graph theory]], an eigenvalue of a [[graph theory|graph]] is defined as an eigenvalue of the graph's [[adjacency matrix]] <math>A</math>, or (increasingly) of the graph's [[Laplacian matrix]] due to its [[discrete Laplace operator]], which is either <math>D - A</math> (sometimes called the ''combinatorial Laplacian'') or <math>I - D^{-1/2}A D^{-1/2}</math> (sometimes called the ''normalized Laplacian''), where <math>D</math> is a diagonal matrix with <math>D_{ii}</math> equal to the degree of vertex <math>v_i</math>, and in <math>D^{-1/2}</math>, the <math>i</math>th diagonal entry is <math>1/\sqrt{\deg(v_i)}</math>. The <math>k</math>th principal eigenvector of a graph is defined as either the eigenvector corresponding to the <math>k</math>th largest or <math>k</math>th smallest eigenvalue of the Laplacian. The first principal eigenvector of the graph is also referred to merely as the principal eigenvector.

The principal eigenvector is used to measure the [[eigenvector centrality|centrality]] of its vertices. An example is [[Google]]'s [[PageRank]] algorithm. The principal eigenvector of a modified [[adjacency matrix]] of the World Wide Web graph gives the page ranks as its components. This vector corresponds to the [[stationary distribution]] of the [[Markov chain]] represented by the row-normalized adjacency matrix; however, the adjacency matrix must first be modified to ensure a stationary distribution exists. The second smallest eigenvector can be used to partition the graph into clusters, via [[spectral clustering]]. Other methods are also available for clustering.

===Basic reproduction number===
{{main|Basic reproduction number}}
The basic reproduction number (<math>R_0</math>) is a fundamental number in the study of how infectious diseases spread. If one infectious person is put into a population of completely susceptible people, then <math>R_0</math> is the average number of people that one typical infectious person will infect. The generation time of an infection is the time, <math>t_G</math>, from one person becoming infected to the next person becoming infected. In a heterogeneous population, the next generation matrix defines how many people in the population will become infected after time <math>t_G</math> has passed. <math>R_0</math> is then the largest eigenvalue of the next generation matrix.<ref>
{{Citation
 | vauthors=Diekmann O, Heesterbeek JA, Metz JA
 | year = 1990
 | title = On the definition and the computation of the basic reproduction ratio R0 in models for infectious diseases in heterogeneous populations
 | journal = Journal of Mathematical Biology
 | volume = 28
 | issue = 4
 | pages = 365–382
 | pmid = 2117040
 | doi = 10.1007/BF00178324
}}</ref><ref>
{{Citation
 |author1=Odo Diekmann |author2=J. A. P. Heesterbeek
 | title = Mathematical epidemiology of infectious diseases
 | series = Wiley series in mathematical and computational biology
 | publisher = John Wiley & Sons
 | location = West Sussex, England
 | year = 2000
 | url = {{google books |plainurl=y |id=5VjSaAf35}}
}}</ref>

==See also==
* [[Antieigenvalue theory]]
* [[Eigenoperator]]
* [[Eigenplane]]
* [[Eigenvalue algorithm]]
* [[Introduction to eigenstates]]
* [[Jordan normal form]]
* [[List of numerical analysis software]]
* [[Nonlinear eigenproblem]]
* [[Quadratic eigenvalue problem]]
* [[Singular value]]

== Notes ==
{{NoteFoot}}

== References ==
=== Citations ===
{{Reflist}}

=== Sources ===
{{refbegin}}
* {{Citation
| last1=Akivis
| first1=Max A.
| last2=Goldberg
| first2=Vladislav V.
| title=Tensor calculus
| series=Russian
| publisher=Science Publishers, Moscow
| year=1969
}}
* {{Citation
| last = Aldrich
| first = John
| title = Earliest Known Uses of Some of the Words of Mathematics
| url = http://jeff560.tripod.com/e.html
| editor = Jeff Miller
| year = 2006
| chapter = Eigenvalue, eigenfunction, eigenvector, and related terms
| chapterurl = http://jeff560.tripod.com/e.html
| accessdate = 2006-08-22 }}
* {{Citation
| last=Alexandrov
| first=Pavel S.
| title=Lecture notes in analytical geometry
| series=Russian
| publisher=Science Publishers, Moscow
| year=1968
| isbn=
}}{{ISBN?}}
* {{ Citation
| last1 = Anton
| first1 = Howard
| year = 1987
| isbn = 0-471-84819-0
| title = Elementary Linear Algebra
| edition = 5th
| publisher = [[John Wiley & Sons|Wiley]]
| location = New York }}
* {{ citation
| last1 = Beauregard
| first1 = Raymond A.
| first2 = John B.
| last2 = Fraleigh
| year = 1973
| isbn = 0-395-14017-X
| title = A First Course In Linear Algebra: with Optional Introduction to Groups, Rings, and Fields
| publisher = [[Houghton Mifflin Co.]]
| location = Boston }}
* {{Citation
| last=Beezer
| first=Robert A.
| title=A first course in linear algebra
| url=http://linear.ups.edu/
| publisher=Free online book under GNU licence, University of Puget Sound
| year=2006
| isbn=
}}
* {{Citation
| last1 = Betteridge
| first1 = Harold T.
| title = The New Cassell's German Dictionary
| publisher = [[Funk & Wagnall]]
| location = New York
| lccn = 58-7924
| year = 1965
}}
* {{Citation
| last1=Bowen
| first1=Ray M.
| last2=Wang
| first2=Chao-Cheng
| title=Linear and multilinear algebra
| publisher=Plenum Press, New York
| year=1980
| isbn=0-306-37508-7
}}
* {{citation
| last1 = Burden
| first1 = Richard L.
| first2 = J. Douglas
| last2 = Faires
| year = 1993
| isbn = 0-534-93219-3
| title = Numerical Analysis
| edition = 5th
| publisher = [[Prindle, Weber and Schmidt]]
| location = Boston
| url-access = registration
| url = https://archive.org/details/numericalanalysi00burd
}}
* {{Citation
| last1=Carter
| first1=Tamara A.
| last2=Tapia
| first2=Richard A.
| last3=Papaconstantinou
| first3=Anne
| title=Linear Algebra: An Introduction to Linear Algebra for Pre-Calculus Students
| publisher=Rice University, Online Edition
| url=http://ceee.rice.edu/Books/LA/index.html
| accessdate=2008-02-19
}}
* {{Citation
| last = Cohen-Tannoudji
| first = Claude
| authorlink = Claude Cohen-Tannoudji
| title = Quantum mechanics
| publisher = John Wiley & Sons
| year = 1977
| chapter = Chapter II. The mathematical tools of quantum mechanics
| isbn = 0-471-16432-1 }}
* {{ citation
| last =  Curtis
| first = Charles W.
| authorlink = Charles W. Curtis
| title = Linear Algebra: An Introductory Approach
| publisher = Springer
| edition = 4th
| year = 1999
| ISBN = 0-387-90992-3 }}
* {{Citation
| last=Demmel
| first=James W. | authorlink = James Demmel
| title=Applied numerical linear algebra
| publisher=SIAM
| year=1997
| isbn=0-89871-389-7
}}
* {{ citation
| last1 = Fraleigh
| first1 = John B.
| year = 1976
| isbn = 0-201-01984-1
| title = A First Course In Abstract Algebra
| edition = 2nd
| publisher = [[Addison-Wesley]]
| location = Reading }}
* {{Citation
| last1 = Fraleigh
| first1 = John B.
| first2 = Raymond A.
| last2 = Beauregard
| title = Linear algebra
| edition = 3rd
| publisher = Addison-Wesley Publishing Company
| year = 1995
| isbn = 0-201-83999-7}}
* {{Citation
| last = Friedberg
| first = Stephen H.
| first2 = Arnold J.
| last2 = Insel
| first3 = Lawrence E.
| last3 = Spence
| title = Linear algebra
| edition = 2nd
| publisher = Prentice Hall
| location = Englewood Cliffs, NJ
| year = 1989
| isbn = 0-13-537102-3 }}
* {{Citation
| last=Gelfand
| first=I. M.
| title=Lecture notes in linear algebra
| series=Russian
| publisher=Science Publishers, Moscow
| year=1971
| isbn=
}}
* {{Citation
| last1=Gohberg
| first1=Israel
| last2=Lancaster
| first2=Peter
| last3=Rodman
| first3=Leiba
| title=Indefinite linear algebra and applications
| publisher=Birkhäuser Verlag
| place=Basel, Boston, Berlin
| year=2005
| isbn=3-7643-7349-0
}}
* {{Citation
| last1 = Golub
| first1 = Gene F.
| first2 = Henk A.
| last2 = van der Vorst
| title = Eigenvalue computation in the 20th century
| journal = Journal of Computational and Applied Mathematics
| volume = 123
| pages = 35–65
| year = 2000
| doi = 10.1016/S0377-0427(00)00413-1 |bibcode = 2000JCoAM.123...35G }}
* {{Citation
| last1=Golub
| first1=Gene H.
| authorlink1 = Gene H. Golub
| last2=Van Loan
| first2=Charles F.
| authorlink2 = Charles F. Van Loan
| title=Matrix computations
| edition=3rd
| publisher=Johns Hopkins University Press|location=Baltimore, MD
| year=1996
| isbn=978-0-8018-5414-9
}}
* {{Citation
| last=Greub
| first=Werner H.
| title=Linear Algebra
| edition=4th
| publisher=Springer-Verlag|location= New York
| year=1975
| isbn=0-387-90110-8
}}
* {{Citation
| last = Halmos
| first = Paul R.
| authorlink = Paul Halmos
| title = Finite-dimensional vector spaces
| edition = 8th
| publisher = Springer-Verlag
| location = New York
| year = 1987
| isbn = 0-387-90093-4 }}
* {{Citation
| last = Hawkins
| first = T.
| title = Cauchy and the spectral theory of matrices
| journal = Historia Mathematica
| volume = 2
| pages = 1–29
| year = 1975
| doi = 10.1016/0315-0860(75)90032-4 }}
* {{Citation
| last=Hefferon
| first=Jim
| title=Linear Algebra
| publisher=Online book, St Michael's College|location=Colchester, VT
| url=http://joshua.smcvt.edu/linearalgebra/
| year=2001
| isbn=
}}
* {{ citation
| last1 = Herstein
| first1 = I. N.
| year = 1964
| isbn = 978-1114541016
| title = Topics In Algebra
| publisher = [[Blaisdell Publishing Company]]
| location = Waltham }}
* {{Citation
| last1=Horn
| first1=Roger A.
| last2=Johnson
| first2=Charles F.
| title=Matrix analysis
| publisher=Cambridge University Press
| year=1985
| isbn=0-521-30586-1
}}
* {{Citation
| last=Kline
| first=Morris
| title=Mathematical thought from ancient to modern times
| publisher=Oxford University Press
| year=1972
| isbn=0-19-501496-0
}}
* {{Citation
| last1=Korn
| first1=Granino A.
| last2=Korn
| first2=Theresa M.
| title=Mathematical Handbook for Scientists and Engineers: Definitions, Theorems, and Formulas for Reference and Review
| publisher=Dover Publications
| edition=2nd Revised
| year=2000
| isbn=0-486-41147-8
| bibcode=1968mhse.book.....K
| journal=New York: McGraw-Hill
}}
* {{Citation
| last=Kuttler
| first=Kenneth
| title=An introduction to linear algebra
| publisher= Brigham Young University
| url=http://www.math.byu.edu/~klkuttle/Linearalgebra.pdf
| format=PDF
| year=2007
| isbn=
}}
* {{Citation
| last = Lancaster
| first = P.
| title = Matrix theory
| series = Russian
| publisher = Science Publishers
| location = Moscow
| year = 1973 }}
* {{Citation
| last1=Larson
| first1=Ron
| last2=Edwards
| first2=Bruce H.
| title=Elementary linear algebra
| edition=5th
| publisher=Houghton Mifflin Company
| year=2003
| isbn=0-618-33567-6
}}
* {{Citation
| last = Lipschutz
| first = Seymour
| title = Schaum's outline of theory and problems of linear algebra
| edition = 2nd
| publisher = McGraw-Hill Companies
| location = New York
| series = Schaum's outline series
| year = 1991
| isbn = 0-07-038007-4 }}
* {{Citation
| last=Meyer
| first=Carl D.
| title=Matrix analysis and applied linear algebra
| publisher=Society for Industrial and Applied Mathematics (SIAM)|location=Philadelphia
| year=2000
| isbn=978-0-89871-454-8
}}
* {{ citation
| last1 = Nering
| first1 = Evar D.
| year = 1970
| title = Linear Algebra and Matrix Theory
| edition = 2nd
| publisher = [[John Wiley & Sons|Wiley]]
| location = New York
| lccn = 76091646
}}
* {{ru icon}}{{ cite encyclopedia
| last1 = Pigolkina
| first1 = T. S.
| last2 = Shulman
| first2 = V. S.
| title = Eigenvalue
| editor-last = Vinogradov
| editor-first = I. M.
| encyclopedia = Mathematical Encyclopedia
| volume = 5
| publisher = Soviet Encyclopedia
| place = Moscow
| year = 1977 }}
* {{Citation
| last1=Press
| first1=William H.
| last2=Teukolsky
| first2=Saul A.
| authorlink2=Saul Teukolsky
| last3=Vetterling
| first3=William T.
| last4=Flannery
| first4=Brian P.
| title=Numerical Recipes: The Art of Scientific Computing
| year=2007
| edition=3rd
| isbn=978-0521880688
}}
* {{Citation
| last=Roman
| first=Steven
| title=Advanced linear algebra
| edition=3rd
| publisher=Springer Science + Business Media
| place=New York
| year=2008
| isbn=978-0-387-72828-5
}}
* {{Citation
| last=Sharipov
| first=Ruslan A.
| title=Course of Linear Algebra and Multidimensional Geometry: the textbook
| year=1996
| isbn=5-7477-0099-5
| arxiv=math/0405323
|bibcode = 2004math......5323S }}
* {{Citation
| last=Shilov
| first=Georgi E.
| title=Linear algebra
| others=Translated and edited by Richard A. Silverman
| publisher=Dover Publications
| place=New York
| year=1977
| isbn=0-486-63518-X
}}
* {{Citation
| last=Shores
| first=Thomas S.
| title=Applied linear algebra and matrix analysis
| publisher=Springer Science+Business Media
| year=2007
| isbn=0-387-33194-8
}}
* {{Citation
| last=Strang
| first=Gilbert
| title=Introduction to linear algebra
| publisher=Wellesley-Cambridge Press|location=Wellesley, MA
| year=1993
| isbn=0-9614088-5-5
}}
* {{Citation
| last=Strang
| first=Gilbert
| title=Linear algebra and its applications
| publisher=Thomson, Brooks/Cole|location=Belmont, CA
| year=2006
| isbn=0-03-010567-6
}}
{{refend}}

== External links ==
{{Wikibooks|Linear Algebra|Eigenvalues and Eigenvectors}}
* [http://www.physlink.com/education/AskExperts/ae520.cfm What are Eigen Values?] – non-technical introduction from PhysLink.com's "Ask the Experts"
* [http://people.revoledu.com/kardi/tutorial/LinearAlgebra/EigenValueEigenVector.html Eigen Values and Eigen Vectors Numerical Examples] – Tutorial and Interactive Program from Revoledu.
* [https://web.archive.org/web/20100325112901/http://khanexercises.appspot.com/video?v=PhfbEr2btGQ Introduction to Eigen Vectors and Eigen Values] – lecture from Khan Academy
* {{cite web |last=Hill |first=Roger |title=λ – Eigenvalues |url=http://www.sixtysymbols.com/videos/eigenvalues.htm |work=Sixty Symbols |publisher=[[Brady Haran]] for the [[University of Nottingham]] |year=2009}}
* {{cite web |title=A Beginner's Guide to Eigenvectors |url=http://deeplearning4j.org/eigenvector |publisher=[[Deeplearning4j]] |year=2015 |access-date=2015-08-18 |archive-url=https://web.archive.org/web/20180721133013/https://deeplearning4j.org/eigenvector |archive-date=2018-07-21 |url-status=dead }}
* [https://www.youtube.com/watch?v=PFDu9oVAE-g&list=PLZHQObOWTQDPD3MizzM2xVFitgF8hE_ab&index=14 Eigenvectors and eigenvalues | Essence of linear algebra, chapter 10] – A visual explanation with [[3Blue1Brown]]
* [https://www.symbolab.com/solver/matrix-eigenvectors-calculator Matrix Eigenvectors Calculator] from Symbolab (Click on the bottom right button of the 2x12 grid to select a matrix size. Select an <math>n \times n</math> size (for a square matrix), then fill out the entries numerically and click on the Go button. It can accept complex numbers as well.)

===Theory===
* {{Springer |title=Eigen value |id=p/e035150}}
* {{Springer |title=Eigen vector |id=p/e035180}}
* {{planetmath reference|id=4397|title=Eigenvalue (of a matrix)}}
* [http://mathworld.wolfram.com/Eigenvector.html Eigenvector] – Wolfram [[MathWorld]]
* [http://ocw.mit.edu/ans7870/18/18.06/javademo/Eigen/ Eigen Vector Examination working applet]
* [http://web.mit.edu/18.06/www/Demos/eigen-applet-all/eigen_sound_all.html Same Eigen Vector Examination as above in a Flash demo with sound]
* [http://www.sosmath.com/matrix/eigen1/eigen1.html Computation of Eigenvalues]
* [http://www.cs.utk.edu/~dongarra/etemplates/index.html Numerical solution of eigenvalue problems] Edited by Zhaojun Bai, [[James Demmel]], Jack Dongarra, Axel Ruhe, and [[Henk van der Vorst]]
* Eigenvalues and Eigenvectors on the Ask Dr. Math forums: [http://mathforum.org/library/drmath/view/55483.html], [http://mathforum.org/library/drmath/view/51989.html]

===Demonstration applets===
* [http://scienceapplets.blogspot.com/2012/03/eigenvalues-and-eigenvectors.html Java applet about eigenvectors in the real plane]
* [http://reference.wolfram.com/language/guide/DifferentialEquations.html Wolfram Language functionality for Eigenvalues, Eigenvectors and Eigensystems]

{{Linear algebra}}
{{Areas of mathematics |collapsed}}

{{DEFAULTSORT:Eigenvalues And Eigenvectors}}
[[Category:Mathematical physics]]
[[Category:Abstract algebra]]
[[Category:Linear algebra]]
[[Category:Matrix theory]]
[[Category:Singular value decomposition]]
[[Category:Articles including recorded pronunciations]]