maths.free › Linear Algebra › Diagonalisation and matrix powers

Diagonalisation and matrix powers

A = PDP⁻¹, computing Aⁿ, and the matrices that cannot be diagonalised.

With a full set of eigenvectors, A = PDP⁻¹ where D is diagonal, so Aⁿ = PDⁿP⁻¹: Fibonacci in closed form, Markov chains at equilibrium. Picture it: the transformation stretching along eigenvector directions and nothing else. Think it: symmetric matrices always diagonalise with orthogonal eigenvectors (the spectral theorem); defective ones need Jordan form.

Ýüklenen mysal · eigenvalues of [[4,1],[2,3]]

Linear-Algebra · Eigenvalues

Eigenvalues of [[4,1],[2,3]]

\left[\begin{matrix}4 & 1\\2 & 3\end{matrix}\right]

Adım adım

  1. \det(A - \lambda I) = 0

    Eigenvalues are the roots of the characteristic polynomial.

  2. \det\left[\begin{matrix}4 - \lambda & 1\\2 & 3 - \lambda\end{matrix}\right] = 0

    Subtract λ from the diagonal.

  3. \lambda^{2} - 7 \lambda + 10 = 0

    Expand the determinant.

  4. \left(\lambda - 5\right) \left(\lambda - 2\right) = 0

    Factor.

  5. \lambda = 5, \lambda = 2

    Eigenvalues (with multiplicity).

  6. \lambda = 2:\ (A - \lambda I)\mathbf{v} = 0 \Rightarrow \mathbf{v} = \left[\begin{matrix}- \frac{1}{2}\\1\end{matrix}\right]

    Solve (A − 2I)v = 0 for a basis eigenvector.

  7. \lambda = 5:\ (A - \lambda I)\mathbf{v} = 0 \Rightarrow \mathbf{v} = \left[\begin{matrix}1\\1\end{matrix}\right]

    Solve (A − 5I)v = 0 for a basis eigenvector.

Jawaby görkez
\lambda = 5,\; \lambda = 2

Indi sen Bir meseläni saýla, ýa-da ýaz ýa-da özüňi surata çek. Her ädim, bir resim, jogap sorag berlençä gizlenýär.

Özüň işle

Mugt hasap her bir ders üçin notlar goşýar, tamamlanan zadyňyzyň ýazgysyny, çözen problemaňyzy bir ýerde, we bu sahypa barada sorap biljek mugallymy. Matematika özüçe her kim üçin açyk, girseň ýa girmeseň.

_Gün _Giriş

Şu ýerde ulanylan simwollar

Eň täze düşündirme, surat, we her harpyň manysy üçin her bir simwoly basyň.

Nädip: Diagonalisation and matrix powers

  1. Eigenvalues are the roots of the characteristic polynomial.
  2. Subtract λ from the diagonal.
  3. Expand the determinant.
  4. Factor.
  5. Eigenvalues (with multiplicity).
  6. Solve (A − 2I)v = 0 for a basis eigenvector.
  7. Solve (A − 5I)v = 0 for a basis eigenvector.

Adamlar soraýan soraglar

What does a determinant mean geometrically?

It is the factor by which the matrix scales area (2×2) or volume (3×3), with a negative sign if orientation flips. Zero means the matrix flattens space and cannot be undone.

What is an eigenvector?

A direction the matrix does not turn: it only stretches it by the eigenvalue. Along eigenvectors a complicated matrix acts like multiplication by a number.

Why is matrix multiplication not commutative?

Because a matrix is a transformation and AB means "do B, then A". Rotating then reflecting is not the same as reflecting then rotating.

_Ýaşa Linear Algebra

DeterminantsMatrix inverseEigenvalues and eigenvectorsMatrix multiplicationRow reductionVector spaces, span and linear independenceOrthogonality, projections and least squaresLinear transformations and change of basis