Theory for find the eigenvules of a matrix

  • Context: Undergrad 
  • Thread starter Thread starter Jhenrique
  • Start date Start date
  • Tags Tags
    Matrix Theory
Click For Summary

Discussion Overview

The discussion revolves around the theory and methods for finding eigenvalues and eigenvectors of matrices. Participants explore various approaches, including similarity transformations and the QR algorithm, while questioning the existence of a general formula for eigenvectors.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant questions the existence of a formula for finding eigenvectors, noting that while there are many theories for eigenvalues, none seem to exist for eigenvectors.
  • Another participant explains that eigenvalues must be found before eigenvectors, emphasizing that two matrices with the same eigenvalues can have different eigenvectors, and provides the definition of an eigenvector.
  • A participant discusses using similarity transformations to reduce a matrix to diagonal form, stating that the resulting matrix contains the eigenvalues and that the columns of the transformation matrices yield the corresponding eigenvectors.
  • Another participant points out that not all matrices are diagonalizable, providing an example and mentioning that the best alternative is to reduce to Jordan normal form.
  • A later reply clarifies that the QR algorithm converges to the Schur form, which is upper triangular, and questions whether the columns of the transformation matrices are generalized eigenvectors.
  • One participant asserts that not all matrices are diagonalizable, responding to a previous comment without further elaboration.

Areas of Agreement / Disagreement

Participants express differing views on the existence of a general formula for eigenvectors and the diagonalizability of matrices. The discussion remains unresolved regarding the implications of these points.

Contextual Notes

Limitations include the dependence on definitions of eigenvalues and eigenvectors, as well as the conditions under which matrices can be diagonalized or reduced to Jordan normal form.

Jhenrique
Messages
676
Reaction score
4
Exist so much theory for find the eigenvules of a matrix (invariants, characteristic polynomials, algebraic formula with trace and determinant...), but don't exist none formula for find the eigenvectors of a matrix? I never saw none! Please, if such formula exist, give me it or tell when I can study this.
 
Physics news on Phys.org
Jhenrique said:
Exist so much theory for find the eigenvules of a matrix (invariants, characteristic polynomials, algebraic formula with trace and determinant...), but don't exist none formula for find the eigenvectors of a matrix? I never saw none! Please, if such formula exist, give me it or tell when I can study this.

You need to find eigenvalues before you can find eigenvectors. Two matrices with the same eigenvalues can have entirely different eigenvectors, so there is no general formula for finding eigenvectors beyond the definition: [itex]v \neq 0[/itex] is an eigenvector of [itex]M[/itex] if and only if there exists a scalar [itex]\lambda[/itex] such that
[tex] Mv = \lambda v.[/tex]
Having found the eigenvalues as the roots of the characteristic polynomial
[tex]\chi_M(z) = \det (M - zI)[/tex]
you can then find the corresponding eigenvector(s) by using the definition above.
 
If you use similarity transformations of an ##n\times n## matrix ##A## to reduce it a diagonal form, i.e., repeat
$$
\begin{align}
A_{1} &= P_1^{-1} A P_1 \\
A_{2} &= P_2^{-1} P_1^{-1} A P_1 P_2 \\
\vdots \\
A_{k} &= P_k^{-1} \cdots P_1^{-1} A P_1 \cdots P_k
\end{align}
$$
until ##A_{k}## is diagonal, then
$$
A_{k} = \mathrm{diag}( \lambda_1, \lambda_2, \ldots, \lambda_n)
$$
with ##\lambda_i## the eigenvalues of ##A## and the columns of the matrix
$$
X = P_1 P_2 \cdots P_k
$$
are the corresponding eigenvectors.

The QR algorithm is such a method.
 
DrClaude said:
If you use similarity transformations of an ##n\times n## matrix ##A## to reduce it a diagonal form

Not all matrices are diagonalizable, even over [itex]\mathbb{C}[/itex]! For example
[tex] \begin{pmatrix}<br /> 1 & 1 \\ 0 & 1<br /> \end{pmatrix}[/tex]

The best you can do is reduce a matrix to its Jordan normal form, which the above matrix is.

EDIT: QR will converge to the Schur form of [itex]A[/itex], which is upper triangular so the eigenvalues will appear on the diagonal, but is it necessarily the case that the columns of [itex]P_1 \dots P_k[/itex] are generalized eigenvectors of [itex]A[/itex]?
 
Last edited:
pasmith said:
Not all matrices are diagonalizable
I never said they were.
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
5K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K