With the diagonalisation of matrices, we have arrived at the heart of linear algebra. The key to diagonalisation is vectors v not equal to the zero vector with \(A \, v = \lambda \, v\) for a \(\lambda \in {\mathbb K}\) – v is called eigenvector and \(\lambda \) eigenvalue. When diagonalising a matrix \(A \in {\mathbb K}^{n \times n}\) , all eigenvalues of A and a basis of \({\mathbb K}^n\) consisting of eigenvectors are determined.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Diagonalisation: Eigenvalues and Eigenvectors

  • Christian Karpfinger

摘要

With the diagonalisation of matrices, we have arrived at the heart of linear algebra. The key to diagonalisation is vectors v not equal to the zero vector with \(A \, v = \lambda \, v\) for a \(\lambda \in {\mathbb K}\) – v is called eigenvector and \(\lambda \) eigenvalue. When diagonalising a matrix \(A \in {\mathbb K}^{n \times n}\) , all eigenvalues of A and a basis of \({\mathbb K}^n\) consisting of eigenvectors are determined.