Announcements Wednesday, November 7

Similar documents
Announcements Wednesday, November 7

Section 5.5. Complex Eigenvalues

Section 5.5. Complex Eigenvalues

Announcements Wednesday, November 01

Announcements Monday, November 13

Section 5.5. Complex Eigenvalues

Announcements Wednesday, November 01

Announcements Monday, November 26

Announcements Monday, November 06

Announcements Monday, November 13

Announcements Monday, November 26

Announcements Monday, October 29

MATH 1553-C MIDTERM EXAMINATION 3

Announcements Wednesday, October 25

1. In this problem, if the statement is always true, circle T; otherwise, circle F.

MATH 1553 PRACTICE MIDTERM 3 (VERSION B)

Announcements: Nov 10

Chapter 5. Eigenvalues and Eigenvectors

Announcements Monday, September 18

Announcements Wednesday, September 05

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix

Announcements Monday, November 20

Math Matrix Algebra

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Announcements Monday, September 25

Announcements Wednesday, September 27

Announcements Wednesday, September 20

235 Final exam review questions

Announcements Wednesday, October 04

4. Linear transformations as a vector space 17

Eigenvalues, Eigenvectors, and Diagonalization

ft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST

Math 205, Summer I, Week 4b: Continued. Chapter 5, Section 8

Generalized Eigenvectors and Jordan Form

Announcements Wednesday, October 10

Remark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Announcements September 19

MATH 1553 PRACTICE MIDTERM 3 (VERSION A)

18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in

Announcements Monday, September 17

Computationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity:

Announcements Monday, October 02

MAT 1302B Mathematical Methods II

Lecture 15, 16: Diagonalization

Math 205, Summer I, Week 4b:

Study Guide for Linear Algebra Exam 2

Mon Mar matrix eigenspaces. Announcements: Warm-up Exercise:

Calculating determinants for larger matrices

Chapter 5 Eigenvalues and Eigenvectors

Math Final December 2006 C. Robinson

MAT188H1S LINEAR ALGEBRA: Course Information as of February 2, Calendar Description:

Computational Methods CMSC/AMSC/MAPL 460. Eigenvalues and Eigenvectors. Ramani Duraiswami, Dept. of Computer Science

Linear Algebra II Lecture 22

A = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,

Linear Algebra II Lecture 13

Math 315: Linear Algebra Solutions to Assignment 7

Jordan Canonical Form Homework Solutions

Diagonalization of Matrix

The minimal polynomial

Math 304 Fall 2018 Exam 3 Solutions 1. (18 Points, 3 Pts each part) Let A, B, C, D be square matrices of the same size such that

EIGENVALUES AND EIGENVECTORS 3

Review problems for MA 54, Fall 2004.

TMA Calculus 3. Lecture 21, April 3. Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013

Eigenvalues and Eigenvectors

City Suburbs. : population distribution after m years

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

MATH 304 Linear Algebra Lecture 33: Bases of eigenvectors. Diagonalization.

Math 3191 Applied Linear Algebra

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

Section Instructors: by now you should be scheduled into one of the following Sections:

and let s calculate the image of some vectors under the transformation T.

Announcements Wednesday, August 30

Announcements Monday, November 19

Lecture 3 Eigenvalues and Eigenvectors

Eigenpairs and Diagonalizability Math 401, Spring 2010, Professor David Levermore

Definition (T -invariant subspace) Example. Example

MA 265 FINAL EXAM Fall 2012

Math 21b. Review for Final Exam

MATH 221, Spring Homework 10 Solutions

MTH 464: Computational Linear Algebra

Diagonalization. Hung-yi Lee

33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM

Math 1553 Worksheet 5.3, 5.5

Eigenvalues and Eigenvectors A =

Section 5.5. Complex Eigenvalues (Part II)

Symmetric and anti symmetric matrices

Announcements Monday, November 19

1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)

ICS 6N Computational Linear Algebra Eigenvalues and Eigenvectors

MATH 1553 PRACTICE FINAL EXAMINATION

P3.C8.COMPLEX NUMBERS

Chapter 2 Formulas and Definitions:

Announcements Wednesday, August 30

Maths for Signals and Systems Linear Algebra in Engineering

AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)

Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Calculus II. Monday, March 13th. WebAssign 7 due Friday March 17 Problem Set 6 due Wednesday March 15 Midterm 2 is Monday March 20

Announcements August 31

Transcription:

Announcements Wednesday, November 7 The third midterm is on Friday, November 16 That is one week from this Friday The exam covers 45, 51, 52 53, 61, 62, 64, 65 (through today s material) WeBWorK 61, 62 are due today at 11:59pm The quiz on Friday covers 61, 62 My office is Skiles 244 and Rabinoffice hours are: Mondays, 12 1pm; Wednesdays, 1 3pm

Diagonalizable Matrices Review Recall: an n n matrix A is diagonalizable if it is similar to a diagonal matrix: λ 1 0 0 A = CDC 1 0 λ 2 0 for D = 0 0 λ n It is easy to take powers of diagonalizable matrices: λ i 1 0 0 A i = CD i C 1 0 λ i 2 0 = C C 1 0 0 λ i n We begin today by discussing the geometry of diagonalizable matrices

Geometry of Diagonal Matrices A diagonal matrix D = ( ) 2 0 0 1 just scales the coordinate axes: ( ) ( ) ( ) ( ) ( ) ( ) 2 0 1 1 2 0 0 0 = 2 = 1 0 1 0 0 0 1 1 1 This is easy to visualize: x v 2 D v 1 Dv 1 Dx Dv 2 x = ( ) 1 1 = Dx = ( ) 2 1

Geometry of Diagonalizable Matrices We had this example last time: A = CDC 1 for ( ) ( ) 1/2 3/2 2 0 A = D = 3/2 1/2 0 1 C = ( 1 1 ) 1 1 The eigenvectors of A are v 1 = ( ) 1 1 and v2 = ( 1 1) with eigenvalues 2 and 1 The eigenvectors form a basis for R 2 because they re linearly independent Any vector can be written as a linear combination of basis vectors: x = a 1v 1 + a 2v 2 = Ax = Conclusion: A scales the v 1-direction by 2 and the v 2-direction by 1 v 1 A Av 2 Av 1 v 2 [interactive]

Geometry of Diagonalizable Matrices Continued Example: x = ( 0 2) = 1v1 + 1v 2 Ax = 1Av 1 + 1Av 2 = 2v 1 + 1v 2 v 1 A Av2 Av 1 x v 2 Ax ( Example: y = 1 5 ) 2 3 = 1 v1 + 2v2 2 Ay = 1 Av1 + 2Av2 = 1v1 + 2v2 2 v 1 A Ay Av 2 Av 1 v 2 y

Dynamics of Diagonalizable Matrices We motivated diagonalization by taking powers: λ i 1 0 0 A i = CD i C 1 0 λ i 2 0 = C C 1 0 0 λ i n This lets us compute powers of matrices easily How to visualize this? A n v = A(A(A (Av)) ) Multiplying a vector v by A n means repeatedly multiplying by A

Dynamics of Diagonalizable Matrices Example A = 1 10 ( ) 11 6 = CDC 1 for C = 9 14 ( 2/3 ) 1 1 1 D = ( ) 2 0 0 1/2 Eigenvectors of A are v 1 = ( ) 2/3 1 and v2 = ( 1 1) with eigenvalues 2 and 1/2 A(a 1v 1 + a 2v 2) = 2a 1v 1 + 1 2 a2v2 A 2 (a 1v 1 + a 2v 2) = 4a 1v 1 + 1 4 a2v2 A 3 (a 1v 1 + a 2v 2) = 8a 1v 1 + 1 8 a2v2 A n (a 1v 1 + a 2v 2) = 2 n a 1v 1 + 1 2 n a2v2 What does repeated application of A do geometrically? It makes the v 1-coordinate very big, and the v 2-coordinate very small [interactive]

Dynamics of Diagonalizable Matrices Another Example A = 1 6 ( ) 5 1 = CDC 1 for C = 2 4 ( ) 1 1/2 1 1 D = ( ) 1 0 0 1/2 Eigenvectors of A are v 1 = ( 1 1 ) and v2 = ( ) 1/2 with eigenvalues 1 and 1/2 A(a 1v 1 + a 2v 2) = a 1v 1 + 1 2 a2v2 1 A 2 (a 1v 1 + a 2v 2) = a 1v 1 + 1 4 a2v2 A 3 (a 1v 1 + a 2v 2) = a 1v 1 + 1 8 a2v2 A n (a 1v 1 + a 2v 2) = a 1v 1 + 1 2 n a2v2 What does repeated application of A do geometrically? It sucks everything into the 1-eigenspace [interactive]

Dynamics of Diagonalizable Matrices Poll A = 1 30 ( ) 12 2 = CDC 1 for C = 3 13 ( ) 2/3 1 1 1 D = ( ) 1/2 0 0 1/3

Section 65 Complex Eigenvalues

A Matrix with No Eigenvectors Consider the matrix for the linear transformation for rotation by π/4 in the plane The matrix is: A = 1 ( ) 1 1 2 1 1 This matrix has no eigenvectors, as you can see geometrically: [interactive] A no nonzero vector x is collinear with Ax or algebraically: f (λ) = λ 2 Tr(A) λ + det(a) = λ 2 2 ± 2 2 λ + 1 = λ = 2

Complex Numbers It makes us sad that 1 has no square root If it did, then 2 = 2 1 Mathematician s solution: we re just not using enough numbers! We re going to declare by fiat that there exists a square root of 1 Definition The number i is defined such that i 2 = 1 Once we have i, we have to allow numbers like a + bi for real numbers a, b Definition A complex number is a number of the form a + bi for a, b in R The set of all complex numbers is denoted C Note R is contained in C: they re the numbers a + 0i We can identify C with R 2 by a + bi ( a b) So when we draw a picture of C, we draw the plane: real axis imaginary axis i 1 1 i

Operations on Complex Numbers Addition: Multiplication: Complex conjugation: a + bi = a bi is the complex conjugate of a + bi Check: z + w = z + w and zw = z w Absolute value: a + bi = a 2 + b 2 This is a real number Note: (a + bi)(a + bi) = (a + bi)(a bi) = a 2 (bi) 2 = a 2 + b 2 So z = zz Check: zw = z w a + bi Division by a nonzero real number: = a c c + b c i z Division by a nonzero complex number: w = zw ww = zw w 2 Example: 1 + i 1 i = Real and imaginary part: Re(a + bi) = a Im(a + bi) = b

The Fundamental Theorem of Algebra The whole point of using complex numbers is to solve polynomial equations It turns out that they are enough to find all solutions of all polynomial equations: Fundamental Theorem of Algebra Every polynomial of degree n has exactly n complex roots, counted with multiplicity Equivalently, if f (x) = x n + a n 1x n 1 + + a 1x + a 0 is a polynomial of degree n, then f (x) = (x λ 1)(x λ 2) (x λ n) for (not necessarily distinct) complex numbers λ 1, λ 2,, λ n Important If f is a polynomial with real coefficients, and if λ is a complex root of f, then so is λ: 0 = f (λ) = λ n + a n 1λ n 1 + + a 1λ + a 0 = λ n + a n 1λ n 1 + + a 1λ + a 0 = f ( λ ) Therefore complex roots of real polynomials come in conjugate pairs

The Fundamental Theorem of Algebra Examples Degree 2: The quadratic formula gives you the (real or complex) roots of any degree-2 polynomial: f (x) = x 2 + bx + c = x = b ± b 2 4c 2 For instance, if f (λ) = λ 2 2λ + 1 then λ = Note the roots are complex conjugates if b, c are real

The Fundamental Theorem of Algebra Examples Degree 3: A real cubic polynomial has either three real roots, or one real root and a conjugate pair of complex roots The graph looks like: or respectively

A Matrix with an Eigenvector Every matrix is guaranteed to have complex eigenvalues and eigenvectors Using rotation by π/4 from before: A = 1 ( ) 1 1 has eigenvalues λ = 1 ± i 2 1 1 2 Let s compute an eigenvector for λ = (1 + i)/ 2: A similar computation shows that an eigenvector for λ = (1 i)/ 2 is ( ) ( ) i 1 So is i = (you can scale by complex numbers) 1 i ( ) i 1

Conjugate Eigenvectors For A = 1 ( ) 1 1, 2 1 1 the eigenvalue 1 + i 2 the eigenvalue 1 i 2 ( ) i has eigenvector 1 ( i has eigenvector 1 ) Do you notice a pattern? Fact Let A be a real square matrix If λ is a complex eigenvalue with eigenvector v, then λ is an eigenvalue with eigenvector v Why? Av = λ = Av = Av = λv = λv Both eigenvalues and eigenvectors of real square matrices occur in conjugate pairs

A 3 3 Example Find the eigenvalues and eigenvectors of 4 3 0 5 5 A = 3 4 0 5 5 0 0 2 The characteristic polynomial is We computed the roots of this polynomial (times 5) before: λ = 2, 4 + 3i, 5 4 3i 5 We eyeball an eigenvector with eigenvalue 2 as (0, 0, 1)

A 3 3 Example Continued 4 3 0 5 5 A = 3 4 0 5 5 0 0 2 To find the other eigenvectors, we row reduce:

Summary Diagonal matrices are easy to understand geometrically Diagonalizable matrices behave like diagonal matrices, except with respect to a basis of eigenvectors Repeatedly multiplying by a matrix leads to fun pictures One can do arithmetic with complex numbers just like real numbers: add, subtract, multiply, divide An n n matrix always exactly has complex n eigenvalues, counted with (algebraic) multiplicity The complex eigenvalues and eigenvectors of a real matrix come in complex conjugate pairs: Av = λv = Av = λv