Linear Algebra. Rekha Santhanam. April 3, Johns Hopkins Univ. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, / 7

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

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

Math 3191 Applied Linear Algebra

ICS 6N Computational Linear Algebra Eigenvalues and Eigenvectors

Definition (T -invariant subspace) Example. Example

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

Diagonalization of Matrix

Jordan Canonical Form Homework Solutions

Recall : Eigenvalues and Eigenvectors

Therefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.

Eigenvalues and Eigenvectors

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

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

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

Homework sheet 4: EIGENVALUES AND EIGENVECTORS. DIAGONALIZATION (with solutions) Year ? Why or why not? 6 9

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

Study Guide for Linear Algebra Exam 2

235 Final exam review questions

City Suburbs. : population distribution after m years

MATH 304 Linear Algebra Lecture 34: Review for Test 2.

Math Final December 2006 C. Robinson

Math 205, Summer I, Week 4b:

Diagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Dimension. Eigenvalue and eigenvector

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

MAT 1302B Mathematical Methods II

Eigenvalues, Eigenvectors, and Diagonalization

Eigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization

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

Lecture 12: Diagonalization

Definition: An n x n matrix, "A", is said to be diagonalizable if there exists a nonsingular matrix "X" and a diagonal matrix "D" such that X 1 A X

Chapter 5. Eigenvalues and Eigenvectors

4. Linear transformations as a vector space 17

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS

Linear Algebra Final Exam Solutions, December 13, 2008

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

Linear Algebra- Final Exam Review

Warm-up. True or false? Baby proof. 2. The system of normal equations for A x = y has solutions iff A x = y has solutions

2. Every linear system with the same number of equations as unknowns has a unique solution.

LINEAR ALGEBRA REVIEW

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

Eigenspaces. (c) Find the algebraic multiplicity and the geometric multiplicity for the eigenvaules of A.

Glossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB

PRACTICE FINAL EXAM. why. If they are dependent, exhibit a linear dependence relation among them.

Calculating determinants for larger matrices

Eigenvalue and Eigenvector Homework

MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.

MATH 1553 PRACTICE MIDTERM 3 (VERSION B)

Linear Algebra Practice Final

Family Feud Review. Linear Algebra. October 22, 2013

Properties of Linear Transformations from R n to R m

Solving Homogeneous Systems with Sub-matrices

Jordan Normal Form and Singular Decomposition

Math 21b Final Exam Thursday, May 15, 2003 Solutions

LU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU

Review Notes for Linear Algebra True or False Last Updated: January 25, 2010

Eigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization

Diagonalization. Hung-yi Lee

MATH 221, Spring Homework 10 Solutions

EIGENVALUES AND EIGENVECTORS

Lecture 3 Eigenvalues and Eigenvectors

MAC Module 12 Eigenvalues and Eigenvectors. Learning Objectives. Upon completing this module, you should be able to:

MAC Module 12 Eigenvalues and Eigenvectors

(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).

Exercise Set 7.2. Skills

MA 265 FINAL EXAM Fall 2012

Final Exam. Linear Algebra Summer 2011 Math S2010X (3) Corrin Clarkson. August 10th, Solutions

Spring 2019 Exam 2 3/27/19 Time Limit: / Problem Points Score. Total: 280

CS 246 Review of Linear Algebra 01/17/19

Announcements Monday, November 06

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors 7.2 Diagonalization

Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015

Math 315: Linear Algebra Solutions to Assignment 7

Lecture 15, 16: Diagonalization

Generalized Eigenvectors and Jordan Form

The Jordan Normal Form and its Applications

Final Exam Practice Problems Answers Math 24 Winter 2012

PROBLEM SET. Problems on Eigenvalues and Diagonalization. Math 3351, Fall Oct. 20, 2010 ANSWERS

Eigenvalues and Eigenvectors A =

Linear Algebra II Lecture 13

(the matrix with b 1 and b 2 as columns). If x is a vector in R 2, then its coordinate vector [x] B relative to B satisfies the formula.

Solutions to Final Exam

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

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

Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?

c c c c c c c c c c a 3x3 matrix C= has a determinant determined by

The eigenvalues are the roots of the characteristic polynomial, det(a λi). We can compute

3 Matrix Algebra. 3.1 Operations on matrices

Lecture Notes: Eigenvalues and Eigenvectors. 1 Definitions. 2 Finding All Eigenvalues

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION

Unit 5. Matrix diagonaliza1on

Mathematical Methods for Engineers 1 (AMS10/10A)

Math 1553 Worksheet 5.3, 5.5

Linear Algebra II Lecture 22

(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.

MATH 1553-C MIDTERM EXAMINATION 3

Eigenvalues and Eigenvectors

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

Definitions for Quizzes

Transcription:

Linear Algebra Rekha Santhanam Johns Hopkins Univ. April 3, 2009 Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 1 / 7

Dynamical Systems Denote owl and wood rat populations at time k by O k and R k respectively. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 2 / 7

Dynamical Systems Denote owl and wood rat populations at time k by O k and R k respectively. The owl preys on the wood rat, so if there are no wood rats the population of owls will go down by 50%. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 2 / 7

Dynamical Systems Denote owl and wood rat populations at time k by O k and R k respectively. The owl preys on the wood rat, so if there are no wood rats the population of owls will go down by 50%. If there are no owls to prey on the rats, then the rat population will increase by 10%. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 2 / 7

Dynamical Systems Denote owl and wood rat populations at time k by O k and R k respectively. The owl preys on the wood rat, so if there are no wood rats the population of owls will go down by 50%. If there are no owls to prey on the rats, then the rat population will increase by 10%. In particular, the rat and owl populations dependence is as follows. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 2 / 7

Dynamical Systems Denote owl and wood rat populations at time k by O k and R k respectively. The owl preys on the wood rat, so if there are no wood rats the population of owls will go down by 50%. If there are no owls to prey on the rats, then the rat population will increase by 10%. In particular, the rat and owl populations dependence is as follows. O k+1 = 0.5O k + 0.4R k R k+1 = po k + 1.1R k Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 2 / 7

Dynamical Systems Denote owl and wood rat populations at time k by O k and R k respectively. The owl preys on the wood rat, so if there are no wood rats the population of owls will go down by 50%. If there are no owls to prey on the rats, then the rat population will increase by 10%. In particular, the rat and owl populations dependence is as follows. O k+1 = 0.5O k + 0.4R k R k+1 = po k + 1.1R k The term p calculates the rats preyed by the owls. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 2 / 7

Dynamical Systems Denote owl and wood rat populations at time k by O k and R k respectively. The owl preys on the wood rat, so if there are no wood rats the population of owls will go down by 50%. If there are no owls to prey on the rats, then the rat population will increase by 10%. In particular, the rat and owl populations dependence is as follows. O k+1 = 0.5O k + 0.4R k R k+1 = po k + 1.1R k The term p calculates the rats preyed by the owls. If we start with a certain initial population of owls and rats, how many will be there in, say, 50 years.? Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 2 / 7

Dynamical Systems Examples More generally, we are trying to solve systems of the form x k+1 = A x k, Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 3 / 7

Dynamical Systems Examples More generally, we are trying to solve systems of the form x k+1 = A x k, where A is a n n matrix and x R n. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 3 / 7

Dynamical Systems Examples More generally, we are trying to solve systems of the form x k+1 = A x k, where A is a n n matrix and x R n. Let us consider the examples when [ ] 2 0 A =. 0 0.5 Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 3 / 7

Dynamical Systems Examples More generally, we are trying to solve systems of the form x k+1 = A x k, where A is a n n matrix and x R n. Let us consider the examples when [ ] 2 0 A =. 0 0.5 [ ] 0.5 0 A =. 0 0.2 Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 3 / 7

Dynamical Systems Examples More generally, we are trying to solve systems of the form x k+1 = A x k, where A is a n n matrix and x R n. Let us consider the examples when [ ] 2 0 A =. 0 0.5 [ ] 0.5 0 A =. 0 0.2 [ ] 2 0 A =. 0 1.5 Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 3 / 7

Let A be a n n matrix. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 4 / 7

Let A be a n n matrix. Then a real number λ is said to be an eigenvalue of A if there exists a non-zero vector x R n such that A x = λ x. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 4 / 7

Let A be a n n matrix. Then a real number λ is said to be an eigenvalue of A if there exists a non-zero vector x R n such that A x = λ x. The non-zero vector x corresponding to λ is called an eigenvector. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 4 / 7

Let A be a n n matrix. Then a real number λ is said to be an eigenvalue of A if there exists a non-zero vector x R n such that A x = λ x. The non-zero vector x corresponding to λ is called an eigenvector. Note there are infinitely many eigenvectors corresponding to λ. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 4 / 7

To compute an eigenvalue λ of A, we note that having a nonzero vector x, A x = λ x. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 5 / 7

To compute an eigenvalue λ of A, we note that having a nonzero vector x, A x = λ x. Then this means we need a λ such that the Kernel of the transformation described by A λi n is non-trivial. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 5 / 7

To compute an eigenvalue λ of A, we note that having a nonzero vector x, A x = λ x. Then this means we need a λ such that the Kernel of the transformation described by A λi n is non-trivial. This implies we want to find λ such that det(a λi n ) = 0. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 5 / 7

To compute an eigenvalue λ of A, we note that having a nonzero vector x, A x = λ x. Then this means we need a λ such that the Kernel of the transformation described by A λi n is non-trivial. This implies we want to find λ such that det(a λi n ) = 0. This is known as the characteristic equations and the solutions to this equation are the eigenvalues of A. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 5 / 7

To compute an eigenvalue λ of A, we note that having a nonzero vector x, A x = λ x. Then this means we need a λ such that the Kernel of the transformation described by A λi n is non-trivial. This implies we want to find λ such that det(a λi n ) = 0. This is known as the characteristic equations and the solutions to this equation are the eigenvalues of A. The algebraic multiplicity of λ is its multplicity as a root of the characteristic equation. Note a matrix A is invertible if and only if 0 is not an eigenvalue of A. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 5 / 7

Example Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 6 / 7

Eigenspace Let A be an n n matrix and λ be an eigenvalue of A. Then the eigenspace corresponding to λ is defined to be Ker (A λi n ). Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 7 / 7

Eigenspace Let A be an n n matrix and λ be an eigenvalue of A. Then the eigenspace corresponding to λ is defined to be Ker (A λi n ). Note any two similar matrices have the same eigenvalues. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 7 / 7

Eigenspace Let A be an n n matrix and λ be an eigenvalue of A. Then the eigenspace corresponding to λ is defined to be Ker (A λi n ). Note any two similar matrices have the same eigenvalues. A matrix A is said to be diagonalizable if it is similar to a diagonal matrix. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 7 / 7

Eigenspace Let A be an n n matrix and λ be an eigenvalue of A. Then the eigenspace corresponding to λ is defined to be Ker (A λi n ). Note any two similar matrices have the same eigenvalues. A matrix A is said to be diagonalizable if it is similar to a diagonal matrix. A n n matrix A is diagonalizable if it has n linearly independent eigenvectors. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 7 / 7