Eigenvectors and Linear Transformations Recall the definition of similar matrices: Let A and C be n  n matrices. We say that A is similar to C in case.

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

8.4 Matrices of General Linear Transformations
Ch 7.7: Fundamental Matrices
Chapter 6 Eigenvalues and Eigenvectors
Linear Algebra Canonical Forms 資料來源: Friedberg, Insel, and Spence, “Linear Algebra”, 2nd ed., Prentice-Hall. (Chapter 7) 大葉大學 資訊工程系 黃鈴玲.
6.1 Eigenvalues and Diagonalization. Definitions A is n x n. is an eigenvalue of A if AX = X has non zero solutions X (called eigenvectors) If is an eigenvalue.
Eigenvalues and Eigenvectors
Linear Transformations
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
Chapter 6 Eigenvalues.
5.II. Similarity 5.II.1. Definition and Examples
Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues
6 1 Linear Transformations. 6 2 Hopfield Network Questions.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 08 Chapter 8: Linear Transformations.
Digital Control Systems Vector-Matrix Analysis. Definitions.
Digital Control Systems
Subspaces, Basis, Dimension, Rank
Boot Camp in Linear Algebra Joel Barajas Karla L Caballero University of California Silicon Valley Center October 8th, 2008.
Matrices CS485/685 Computer Vision Dr. George Bebis.
5.1 Orthogonality.
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka Virginia de Sa (UCSD) Cogsci 108F Linear.
Orthogonal Matrices and Spectral Representation In Section 4.3 we saw that n  n matrix A was similar to a diagonal matrix if and only if it had n linearly.
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
CHAPTER SIX Eigenvalues
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
1 MAC 2103 Module 12 Eigenvalues and Eigenvectors.
Diagonalization Revisted Isabel K. Darcy Mathematics Department Applied Math and Computational Sciences University of Iowa Fig from knotplot.com.
Day 1 Eigenvalues and Eigenvectors
Day 1 Eigenvalues and Eigenvectors
Elementary Linear Algebra Anton & Rorres, 9th Edition
Eigenvalues and Eigenvectors
Matrices. Definitions  A matrix is an m x n array of scalars, arranged conceptually as m rows and n columns.  m is referred to as the row dimension.
Chap. 6 Linear Transformations
Linear algebra: matrix Eigen-value Problems
Domain Range definition: T is a linear transformation, EIGENVECTOR EIGENVALUE.
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
Diagonalization and Similar Matrices In Section 4.2 we showed how to compute eigenpairs (,p) of a matrix A by determining the roots of the characteristic.
LAHW#13 Due December 20, Eigenvalues and Eigenvectors 5. –The matrix represents a rotations of 90° counterclockwise. Obviously, Ax is never.
8.5 Similarity. SIMILARITY The matrix of a linear operator T:V V depends on the basis selected for V that makes the matrix for T as simple as possible.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
7.1 Eigenvalues and Eigenvectors
5.1 Eigenvectors and Eigenvalues 5. Eigenvalues and Eigenvectors.
5.1 Eigenvalues and Eigenvectors
Linear Algebra Chapter 6 Linear Algebra with Applications -Gareth Williams Br. Joel Baumeyer, F.S.C.
A function is a rule f that associates with each element in a set A one and only one element in a set B. If f associates the element b with the element.
1 Chapter 8 – Symmetric Matrices and Quadratic Forms Outline 8.1 Symmetric Matrices 8.2Quardratic Forms 8.3Singular ValuesSymmetric MatricesQuardratic.
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
5 5.1 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
Reduced echelon form Matrix equations Null space Range Determinant Invertibility Similar matrices Eigenvalues Eigenvectors Diagonabilty Power.
Characteristic Polynomial Hung-yi Lee. Outline Last lecture: Given eigenvalues, we know how to find eigenvectors or eigenspaces Check eigenvalues This.
To understand the matrix factorization A=PDP -1 as a statement about linear transformation.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Linear Algebra Lecture 36.
Euclidean Inner Product on Rn
Symmetric Matrices and Quadratic Forms
Maths for Signals and Systems Linear Algebra in Engineering Lecture 18, Friday 18th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
EIGENVECTORS AND EIGENVALUES
Elementary Linear Algebra Anton & Rorres, 9th Edition
Diagonalization of Linear Operator
Linear Algebra Lecture 30.
Linear Algebra Lecture 35.
Eigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
Presentation transcript:

Eigenvectors and Linear Transformations Recall the definition of similar matrices: Let A and C be n  n matrices. We say that A is similar to C in case A = PCP -1 for some invertible matrix P. A square matrix A is diagonalizable if A is similar to a diagonal matrix D. An important idea of this section is to see that the mappings are essentially the same when viewed from the proper perspective. Of course, this is a huge breakthrough since the mapping is quite simple and easy to understand. In some cases, we may have to settle for a matrix C which is simple, but not diagonal.

Similarity Invariants for Similar Matrices A and C Property Description Determinant A and C have the same determinant Invertibility A is invertible C is invertible Rank A and C have the same rank Nullity A and C have the same nullity Trace A and C have the same trace Characteristic Polynomial A and C have the same char. polynomial Eigenvalues A and C have the same eigenvalues Eigenspace dimension If is an eigenvalue of A and C, then the eigenspace of A corresponding to and the eigenspace of C corresponding to have the same dimension.

The Matrix of a Linear Transformation wrt Given Bases Let V and W be n-dimensional and m-dimensional vector spaces, respectively. Let T:V  W be a linear transformation. Let B = {b 1, b 2,..., b n } and B' = {c 1, c 2,..., c m } be ordered bases for V and W, respectively. Then M is the matrix representation of T relative to these bases where Example. Let B be the standard basis for R 2, and let B' be the basis for R 2 given by If T is rotation by 45º counterclockwise, what is M?

Linear Transformations from V into V In the case which often happens when W is the same as V and B' is the same as B, the matrix M is called the matrix for T relative to B or simply, the B-matrix for T and this matrix is denoted by [T] B. Thus, we have Example. Let T: be defined by This is the _____________ operator. Let B = B' = {1, t, t 2, t 3 }.

Similarity of two matrix representations: Here, the basis B of is formed from the columns of P. Multiplication by A Multiplication by C Multiplication by P –1 Multiplication by P

A linear operator: geometric description Let T: be defined as follows: T(x) is the reflection of x in the line y = x. x y x T(x)

Standard matrix representation of T and its eigenvalues Since T(e 1 ) = e 2 and T(e 2 ) = e 1, the standard matrix representation A of T is given by: The eigenvalues of A are solutions of: We have The eigenvalues of A are: +1 and –1.

A basis of eigenvectors of A Let Since Au = u and Av = –v, it follows that B ={u, v} is a basis for consisting of eigenvectors of A. The matrix representation of T with respect to basis B:

Similarity of two matrix representations The change-of-coordinates matrix from B to the standard basis is P where Note that P -1 = P T and that the columns of P are u and v. Next, That is,

A particular choice of input vector w Let w be the vector with E coordinates given by x y u T(w) v w x y

Transforming the chosen vector w by T Let w be the vector chosen on the previous slide. We have The transformation w T(w) can be written as Note that

What can we do if a given matrix A is not diagonalizable? Instead of looking for a diagonal matrix which is similar to A, we can look for some other simple type of matrix which is similar to A. For example, we can consider a type of upper triangular matrix known as a Jordan form (see other textbooks for more information about Jordan forms). If Section 5.5 were being covered, we would look for a matrix of the form