ENGG2013 Unit 7 Non-singular matrix and Gauss-Jordan elimination Jan, 2011.
ENGG2013 Unit 19 The principal axes theorem Mar, 2011.
-
date post
20-Dec-2015 -
Category
Documents
-
view
217 -
download
2
Transcript of ENGG2013 Unit 19 The principal axes theorem Mar, 2011.
Outline
• Special matrices– Symmetric, skew-symmetric, orthogonal
• Principle axes theorem• Application to conic sections
kshum ENGG2013 2
Diagonalizable ??
• A square matrix M is called diagonalizable if we can find an invertible matrix, say P, such that the product P–1 M P is a diagonal matrix.– Example
• Some matrix cannot be diagonalized.– Example
kshum ENGG2013 3
Theorem
An nn matrix M is diagonalizable if and only if we can find n linear independent eigenvectors of M.
Proof: For concreteness, let’s just consider the 33 case.
kshum ENGG2013 4
by definition
The three columns are linearly independent becausethe matrix is invertible
Complex eigenvalue
• There are some matrices whose eigenvalues are complex numbers.– For example: the matrix which represents rotation
by 45 degree counter-clockwise.
kshum ENGG2013 6
Theorem
If an nn matrix M has n distinct eigenvalues,then M is diagonalizable
kshum ENGG2013 7
The converse is false: There is some diagonalizable matrix with repeated eigenvalues.
Matrix in special form
• Symmetric: AT=A.• Skew-symmetric: AT= –A.• Orthogonal: AT =A-1, or equivalently AT A = I.• Examples:
kshum ENGG2013 8
symmetric skew-symmetricsymmetricandorthogonal
Orthogonal matrix
A matrix M is called orthogonal if
Each column has norm 1
Dot product = 1
9kshum
MMT I
Orthogonal matrix
A matrix M is called orthogonal if
Any two distinct columns are orthogonal
Dot product = 0
10kshum
Principal axes theorem
Given any nn symmetric matrix A, we have:1.The eigenvalues of A are real.2. A is diagonalizable.3.We can pick n mutually perpendicular (aka
orthogonal) eigenvectors.
kshum ENGG2013 11
Proof omitted.
Q
http://en.wikipedia.org/wiki/Principal_axis_theorem
Two sufficient conditions for diagonalizability
kshum ENGG2013 12
Diagonalizable
Distinct eigenvaluesSymmetric,
skew-symmetric,orthogonal
Similarity• Definition: We say that two nn matrix A and B
are similar if we can find an invertible matrix S such that
• Example: and are similar,
• The notion of diagonalization can be phrased in terms of similarity: matrix A is diagonalizable if and only if A is similar to a diagonal matrix.
kshum 14
Application to conic sections
• Ellipse : x2/a + y2/b = 1.• Hyperbola : x2/a – y2/b = 1.• Parabola y = ax2.
kshum ENGG2013 16
Application to conic sections• Is x2 – 4xy +2y2 = 1 a ellipse, or a hyperbola?
Rewrite using symmetric matrix
Find the characteristic polynomial
Solve for the eigenvalues
17kshum
2x2 + 2xy + 2y2 = 1Rewrite using symmetric matrix
Compute the characteristic polynomial
Find the eigenvalues
20kshum
2x2 + 2xy + 2y2 = 1Diagonalize
Change of variables
21kshum
Columns of P are eigenvectors,normalized to norm 1.