ECE504: Lecture 6. D. Richard Brown III. Worcester Polytechnic Institute. 07-Oct-2008
|
|
- Hope Farmer
- 5 years ago
- Views:
Transcription
1 D. Richard Brown III Worcester Polytechnic Institute 07-Oct-2008 Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
2 Lecture 6 Major Topics We are still in Part II of ECE504: Quantitative and qualitative analysis of systems mathematical description results about behavior of system Our focus today is on linear time-invariant systems. In this case, recall that the DT-STM is Φ[k, j] = A k j and the CT-STM is Φ(t, s) = exp{(t s)a}. We will discuss 1. Properties of A k and exp{ta}. 2. Eigenvalues and eigenvectors. 3. Computation of A k and exp{ta} when A is diagonalizable. 4. Computation of A k and exp{ta} when A is not diagonalizable. You should be finishing Chen Chapter 4 now (and referring back to Chapter 3 as necessary). You should also look over Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later by Moler and Van Loan (link on course web page). Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
3 Basic Properties of A k and exp{ta} Recall that the matrix exponential exp{ta} is not performed element-by-element. Nevertheless, the matrix exponential has many of the same properties as the usual scalar exponential. Specifically: 1. For any A R n n lim t 0 exp{ta} = I n This can be seen directly from the definition of exp{ta}. 2. For any A R n n exp{(t 1 + t 2 )A} = exp{t 1 A}exp{t 2 A} This is a consequence of the semigroup property of Φ(t,s). 3. Given A R n n and à Rn n, does exp{t(a + Ã)} = exp{ta}exp{tã}? Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
4 Basic Properties of A k and exp{ta} (cont.) 4. Given any A R n n such that 2 a A = a nn 7 5 is diagonal, then exp{ta} = e annt e a 11t This can be seen directly from the definition of exp{ta}. 5. Given any A R n n such that we can find some invertible V C n n satisfying then V 1 AV = Λ = λ λ nn A k = (V ΛV 1 )... (V ΛV 1 ) = V Λ k V 1 }{{} k fold product Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
5 Basic Properties of A k and exp{ta} (cont.) 6. Given any A R n n such that we can find some invertible V C n n satisfying λ V 1 AV = Λ = λ nn then exp{ta} = k=0 t k k! (V ΛV 1 ) k = V [ k=0 = V exp{tλ}v 1 e λ 11t 0 0 = V V e λnnt ] t k k! Λk V 1 Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
6 Diagonalizability of Square Matrices Diagonalizability makes the computation of A k and exp{ta} easy! Question: Is every matrix A R n n diagonalizable? Question: Is there any connection between invertibility and diagonalizability? Question: What procedure can we use to diagonalize square matrices? Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
7 Eigenvalues Definition Given A R n n, λ 0 is an eigenvalue of A if and only if (A I n λ 0 ) is not invertible. Equivalently, based on what we already know about invertibility, we can say λ 0 is an eigenvalue of A det(a I n λ 0 ) 0 Definition The characteristic polynomial of A is det(λi n A) where λ is a variable. What is deg(det(λi n A))? It is not too hard to show that the eigenvalues of A are equivalent to the roots of the characteristic polynomial of A. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
8 Some Consequences of What We Know About Eigenvalues 1. There can be at most n different eigenvalues of A. 2. Even if A is real, its eigenvalues can be complex. 3. If A is real and λ 0 is a complex eigenvalue of A, then λ 0 is also an eigenvalue of A where the notation () means complex conjugate, i.e. z = a + jb z = a jb 4. If λ 0 is an eigenvalue of A, then dim(null(a λ 0 I n )) 1 since A λ 0 I n is not invertible. This last consequence is of particular importance. Let v 0 be any vector (except for the zero vector) in the nullspace of A λ 0 I n. Then we can say that (A λ 0 I n )v 0 = 0 which can be rewritten as Av 0 = λ 0 v 0. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
9 Eigenvectors Definition Given A R n n, v 0 is an eigenvector of A corresponding to the eigenvalue λ 0 if and only if Av 0 = λ 0 v 0. Intuition: The matrix A scales its eigenvectors by its eigenvalues. Note that there is nothing unique about an eigenvector. If v 0 is an eigenvector of A corresponding to the eigenvalue λ 0, then so is αv 0 for any α 0 since A(αv 0 ) = α(av 0 ) = α(λ 0 v 0 ) = λ 0 (αv 0 ) Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
10 Linear Independence of Eigenvectors Fact: If v 1,v 2,...,v s R n are eigenvectors of A R n n corresponding respectively with different eigenvalues λ 1,λ 2,...,λ s C, then {v 1,v 2,...,v s } is a linearly independent set. Intuitively: Eigenvectors corresponding to different eigenvalues are linearly independent. Geometrically: Let V j = null(a λ j I n ). If λ j λ m, then V j Vm = {0}. Important special case: If the matrix A R n n has n distinct eigenvalues, then there must exist n linearly independent eigenvectors {v 1,v 2,...,v n } R n. Let V = [v 1 v 2... v n ]. What can we say about the invertibility of V? Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
11 When is A is Diagonalizable? We now know that, when A has n distinct eigenvalues, A is diagonalizable and we can write A = V ΛV 1 since V = [v 1 v 2... v n ] is invertible in this case. In this case, computing exp{ta} and A k is easy. The main difficulty is finding the eigenvalues (finding the roots of a degree n polynomial). What if A does not have n distinct eigenvalues? Does this mean that A is not diagonalizable? Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
12 Example A = To determine the eigenvalues, we need to compute the roots of the characteristic polynomial, i.e. solve det(λi 3 A) = 0... Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
13 Algebraic Multiplicity of an Eigenvalue We can always write the characteristic polynomial of A in terms of its roots, i.e. det(λi n A) = (λ λ 1 ) r 1 (λ λ 2 ) r2 (λ λ s ) rs where {λ 1,...,λ s } is the set of distinct eigenvalues of A with 1 s n. Definition The algebraic multiplicity of the eigenvalue λ j of the matrix A R n n is the number of times the root λ j appears in the characteristic polynomial of A and is denoted as r j. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
14 Eigenspace and Geometric Multiplicity of an Eigenvalue Definition Given A R n n, if λ 0 C is an eigenvalue of A, then the eigenspace corresponding with λ 0, denoted as E(λ 0 ), is the subspace of C n spanned by the eigenvectors corresponding to the eigenvalue λ 0, i.e. E(λ 0 ) = null(a λ 0 I n ) Definition The geometric multiplicity of the eigenvalue λ j of the matrix A R n n is the dimension of the eigenspace of λ j and is denoted as m j, i.e. m j = dim(null(a λ j I n )) Fact: For each j {1,...,s}, 1 m j r j. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
15 When is A Diagonalizable? Theorem If, for each j {1,...,s}, m j = r j, then A is diagonalizable. This should be obvious when A has distinct eigenvalues since m j = r j = 1 for all j. Proof sketch for the case when A does not have distinct eigenvalues: Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
16 A Procedure to Know When A is Diagonalizable Does A have n distinct eigenvalues? no Compute the algebraic multiplicities of each eigenvalue { r j } yes Compute the geometric multiplicities of each eigenvalue { m j } Does m j = r j for all j? no yes A is diagonalizable A is not diagonalizable Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
17 Summary of Diagonalization 1. Compute the eigenvalues of A and denote the distinct values as {λ 1,...,λ s }. 2. If A is diagonalizable (see procedure on previous slide), then for each j {1,...,s}, find a basis for the eigenspace E(λ j ) = null(a λ j I n ). You can do this with Gaussian elimination and echelon form. Let be a basis for E(λ j ). B j = {v j1,v j2,...,v jrj } 3. Form V by stringing bases together. Note that V will be a square matrix since s j=1 r j = s j=1 m j = n. 4. Now A = V ΛV 1 (you should check it to be sure). Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
18 What Can We Do If A is Not Diagonalizable? Some options: 1. It might be possible to just compute exp{ta} by the definition, e.g. [ ] 0 1 A = You can use the fundamental matrix method to compute the CT-STM Φ(t, s), and hence compute exp{(t s)a}. 3. You can still use the eigenvalue/eigenvector method except you have to work with generalized eigenvectors. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
19 Generalized Eigenvectors Definition Given A R n n and λ 0 C an eigenvalue of A, we say that v 0 C n is a generalized eigenvector corresponding with λ 0 if v 0 0 and for some integer k 1. (A λ 0 I n ) k v 0 = 0 Question: Are all regular eigenvectors also generalized eigenvectors? Question: Are all generalized eigenvectors also regular eigenvectors? Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
20 Generalized Eigenspace Definition The generalized eigenspace of the eigenvalue λ 0 is the subspace of C n spanned by all of the generalized eigenvalues corresponding to λ 0. We will use the notation F(λ 0 ) to denote the generalized eigenspace of the eigenvector λ 0. Examples... Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
21 Some Basic Properties of Generalized Eigenspaces 1. E(λ 0 ) F(λ 0 ), i.e., the regular eigenspace of the eigenvalue λ 0 is a subset of the generalized eigenspace of the eigenvalue λ 0. Why? 2. If {v 1,...,v k } is a set of generalized eigenvectors corresponding to different eigenvalues, then {v 1,...,v k } is a linearly independent set. 3. If v 0 F(λ 0 ), then Av 0 F(λ 0 ). In other words, the subspace F(λ 0 ) is invariant under A. 4. Given the characteristic polynomial of A det(λi n A) = (λ λ 1 ) r 1 (λ λ 2 ) r2 (λ λ s ) rs where λ 1,...,λ s are all distinct and r 1,...,r s are the respective algebraic multiplicities, it can be shown that dim(f(λ j )) = r j. When combined with property #1, this implies that 1 dim(e(λ j )) dim(f(λ j )) = r j. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
22 Some Basic Properties of Generalized Eigenspaces (cont.) 5. A consequence of properties #2 and #4. If {v 11,...,v 1r1 } is a basis for F(λ 1 ). {v s1,...,v 1rs } is a basis for F(λ s ) then we can string all of these sets of generalized eigenvectors together into a big set {v 11,...,v 1r1,...,v s1,...,v 1rs }. How many vectors are in this set? This set of generalized eigenvectors is a basis for C n. Why?.. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
23 Some Basic Properties of Generalized Eigenspaces (cont.) 6. From property #3, if v jk F(λ j ), then Av jk F(λ j ). Av jk can be expressed as a linear combination of the vectors comprising a basis for F(λ j ). If the basis for F(λ j ) is {v j1,...,v jrj } then Av j1 = α 11 v j1 + + α 1r1 v jrj Av jrj. = α j1 v j1 + + α jr1 v jrj We can rewrite these r j equations as one big matrix equation: α 11 α α rj1 A [ ] [ ] α 12 α α rj2 v j1... v jrj = vj1... v jrj }{{}}{{} V j V j α 1rj } α 2rj... {{ α rjr j } Q j Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
24 Some Basic Properties of Generalized Eigenspaces (cont.) Property #6 continued... We now have AV j = V j Q j. What are the dimensions of A, V j, and Q j? Let V = [V 1 V 2... V s ] and Q = Q 1... Q s What are the dimensions of V and Q? (block diagonal form) We now have AV = V Q. From property #5, what can we say about the invertibility of V? Hence, we can write A = V QV 1. Note that Q is not diagonal, but block diagonal. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
25 Some Basic Properties of Generalized Eigenspaces (cont.) 7. By the definition of generalized eigenvectors and generalized eigenspaces, the statement v F(λ j ) is equivalent to (A λ j I n ) k v = 0 (1) for some integer k 1. Note that, if (1) is true when k = k 0, then it is also true for all k k 0. This implies that F(λ j ) = null((a λ j I n ) r j ). In other words, to determine the generalized eigenspace for the eigenvalue λ j, you don t need to compute the nullspace of (A λ j I n ) k for k = 1,2,...,r j. You can just compute the nullspace of the matrix (A λ j I n ) r j by doing the standard Gaussian elimination and putting the result in echelon form. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
26 Some Basic Properties of Generalized Eigenspaces (cont.) 8. From properties #6 and #7, we can say that Why? (Q j λ j I rj ) r j = 0 Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
27 Nilpotent Matrices Definition A nilpotent matrix is a square matrix ˆN with the property that ˆN m = 0 for some positive integer m. An equivalent definition for a nilpotent matrix is a square matrix with eigenvalues all equal to zero. Examples: Which of these matrices are [ ] [ ] A 1 = A = 0 0 A 3 = [ ] nilpotent? Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
28 Some Basic Properties of Generalized Eigenspaces (cont.) 9. From property #8 we know that Q 1 λ 1 I r1... = ˆN is nilpotent. If we let Λ = λ 1 I r1... Q s λ s I rs λ s I rs then we have Q = Λ + ˆN where Λ is diagonal and ˆN is nilpotent. We can show that Λ ˆN = ˆNΛ In other words, ˆN and Λ commute. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
29 Computing A k When A is Not Diagonalizable We now know everything we need to compute A k when A is not diagonalizable. In general, we can always write A = V (Λ + ˆN)V 1 This implies that A k = V (Λ + ˆN) k V 1 By the binomial expansion theorem and property #9, we can write k ( ) A k = V k Λ k j ˆNj V 1 j j=0 But ˆN is nilpotent. Hence, for j max{r 1,...,r s }, ˆNj = 0. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
30 Computing exp{ta} When A is Not Diagonalizable By property #9, we can write exp{ta} 1 = V exp{t(λ + ˆN)}V 1 = V exp{tλ}exp{t ˆN}V The term exp{tλ} is easy to compute because Λ is diagonal. What about the term exp{t ˆN}? Look at the definition: exp{t ˆN} = k=0 t k k! ˆN k. But ˆN is nilpotent. So the sum will only have a finite number of terms: exp{t ˆN} = max{r 1,...,r s} 1 k=0 t k k! ˆN k. In typical cases, there are only a few terms to compute. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
31 Examples Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
32 Putting it All Together A procedure for finding A k and/or exp{ta} for arbitrary A R n n : 1. Find all of the eigenvalues of A. Usually you do this by computing the roots of the characteristic polynomial, i.e. det(λi n A) = (λ λ 1 ) r 1 (λ λ 2 ) r2 (λ λ s ) rs = 0 2. For each j {1,...,s}, find a basis for E(λ j ) = null(a λ j I n ). If dim(e(λj )) = r j then good! Move on to next eigenvalue. If dim(e(λj )) > r j then you ve done something wrong. If dim(e(λj )) < r j then you need to find a basis for the generalized eigenspace F(λ j ) = null(a λ j I n ) rj. This basis must contain r j linearly independent vectors. 3. Form V C n n by stringing together all of the bases. 4. Compute V 1 AV = Q = Λ + ˆN where Λ is diagonal and ˆN is nilpotent. Note that ˆN = 0 when A is diagonalizable. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
33 Putting it All Together (cont.) 5. Compute A k via A k = V k ( ) k Λ k j ˆNj V 1 j j=0 where the nilpotent property of ˆN implies that the sum will have at most max{r 1,...,r s } 1 terms for any k. 6. Compute exp{ta} via 1 exp{ta}v exp{tλ}exp{t ˆN}V where the term exp{tλ} is easy to compute because Λ is diagonal and the term exp{t ˆN} = max{r 1,...,r s} 1 k=0 is also not too difficult since the sum is finite. t k k! ˆN k. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
34 Remarks Note that exp{tλ} will have elements that look like e λ 1t,e λ 2t,... What will the elements of exp{t ˆN} look like? Hence, when A is diagonalizable, exp{ta} will only have terms that look like e λt. When A is not diagonalizable, exp{ta} will also have terms that look like t m e λt. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
35 Conclusions This concludes our quantitative analysis of systems. We will be moving on to qualitative analysis (e.g. stability) after the midterm exam. 1. Solution to LTI or LTV discrete-time state-space difference equations (existence and uniqueness). 2. Solution to LTI or LTV continuous-time state-space differential equations (existence and uniqueness). 3. Important special case: DT LTI systems with Φ[k,j] = A k j and CT LTI systems with Φ(t, s) = exp{(t s)a}. 4. Linear algebraic tools: Subspaces Nullspace, range, rank, nullity Matrix invertibility Eigenvalues, eigenvectors, eigenspaces, and nilpotent matrices 5. Properties of A k and exp{ta}. 6. Computation of A k and exp{ta} when A is diagonalizable. 7. Computation of A k and exp{ta} when A is not diagonalizable. Worcester Polytechnic Institute D. Richard Brown III 07-Oct / 35
ECE504: Lecture 8. D. Richard Brown III. Worcester Polytechnic Institute. 28-Oct-2008
ECE504: Lecture 8 D. Richard Brown III Worcester Polytechnic Institute 28-Oct-2008 Worcester Polytechnic Institute D. Richard Brown III 28-Oct-2008 1 / 30 Lecture 8 Major Topics ECE504: Lecture 8 We are
More informationDIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix
DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that
More informationECE504: Lecture 10. D. Richard Brown III. Worcester Polytechnic Institute. 11-Nov-2008
ECE504: Lecture 10 D. Richard Brown III Worcester Polytechnic Institute 11-Nov-2008 Worcester Polytechnic Institute D. Richard Brown III 11-Nov-2008 1 / 25 Lecture 10 Major Topics We are finishing up Part
More informationDefinition (T -invariant subspace) Example. Example
Eigenvalues, Eigenvectors, Similarity, and Diagonalization We now turn our attention to linear transformations of the form T : V V. To better understand the effect of T on the vector space V, we begin
More informationLinear Algebra II Lecture 13
Linear Algebra II Lecture 13 Xi Chen 1 1 University of Alberta November 14, 2014 Outline 1 2 If v is an eigenvector of T : V V corresponding to λ, then v is an eigenvector of T m corresponding to λ m since
More information235 Final exam review questions
5 Final exam review questions Paul Hacking December 4, 0 () Let A be an n n matrix and T : R n R n, T (x) = Ax the linear transformation with matrix A. What does it mean to say that a vector v R n is an
More informationECE504: Lecture 9. D. Richard Brown III. Worcester Polytechnic Institute. 04-Nov-2008
ECE504: Lecture 9 D. Richard Brown III Worcester Polytechnic Institute 04-Nov-2008 Worcester Polytechnic Institute D. Richard Brown III 04-Nov-2008 1 / 38 Lecture 9 Major Topics ECE504: Lecture 9 We are
More informationDiagonalization. Hung-yi Lee
Diagonalization Hung-yi Lee Review If Av = λv (v is a vector, λ is a scalar) v is an eigenvector of A excluding zero vector λ is an eigenvalue of A that corresponds to v Eigenvectors corresponding to λ
More informationMAT 1302B Mathematical Methods II
MAT 1302B Mathematical Methods II Alistair Savage Mathematics and Statistics University of Ottawa Winter 2015 Lecture 19 Alistair Savage (uottawa) MAT 1302B Mathematical Methods II Winter 2015 Lecture
More informationMath 110 Linear Algebra Midterm 2 Review October 28, 2017
Math 11 Linear Algebra Midterm Review October 8, 17 Material Material covered on the midterm includes: All lectures from Thursday, Sept. 1st to Tuesday, Oct. 4th Homeworks 9 to 17 Quizzes 5 to 9 Sections
More informationDiagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Diagonalization MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Motivation Today we consider two fundamental questions: Given an n n matrix A, does there exist a basis
More informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
More informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors Definition 0 Let A R n n be an n n real matrix A number λ R is a real eigenvalue of A if there exists a nonzero vector v R n such that A v = λ v The vector v is called an eigenvector
More informationSolutions to Final Exam
Solutions to Final Exam. Let A be a 3 5 matrix. Let b be a nonzero 5-vector. Assume that the nullity of A is. (a) What is the rank of A? 3 (b) Are the rows of A linearly independent? (c) Are the columns
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More informationPRACTICE FINAL EXAM. why. If they are dependent, exhibit a linear dependence relation among them.
Prof A Suciu MTH U37 LINEAR ALGEBRA Spring 2005 PRACTICE FINAL EXAM Are the following vectors independent or dependent? If they are independent, say why If they are dependent, exhibit a linear dependence
More informationMA 265 FINAL EXAM Fall 2012
MA 265 FINAL EXAM Fall 22 NAME: INSTRUCTOR S NAME:. There are a total of 25 problems. You should show work on the exam sheet, and pencil in the correct answer on the scantron. 2. No books, notes, or calculators
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More informationRemark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial
More informationMath 314H Solutions to Homework # 3
Math 34H Solutions to Homework # 3 Complete the exercises from the second maple assignment which can be downloaded from my linear algebra course web page Attach printouts of your work on this problem to
More informationMath 3191 Applied Linear Algebra
Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9 Section. Diagonalization The goal here is to develop a useful
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationπ 1 = tr(a), π n = ( 1) n det(a). In particular, when n = 2 one has
Eigen Methods Math 246, Spring 2009, Professor David Levermore Eigenpairs Let A be a real n n matrix A number λ possibly complex is an eigenvalue of A if there exists a nonzero vector v possibly complex
More informationMath Final December 2006 C. Robinson
Math 285-1 Final December 2006 C. Robinson 2 5 8 5 1 2 0-1 0 1. (21 Points) The matrix A = 1 2 2 3 1 8 3 2 6 has the reduced echelon form U = 0 0 1 2 0 0 0 0 0 1. 2 6 1 0 0 0 0 0 a. Find a basis for the
More informationMATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by
MATH 110 - SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER 2009 GSI: SANTIAGO CAÑEZ 1. Given vector spaces V and W, V W is the vector space given by V W = {(v, w) v V and w W }, with addition and scalar
More informationName: Final Exam MATH 3320
Name: Final Exam MATH 3320 Directions: Make sure to show all necessary work to receive full credit. If you need extra space please use the back of the sheet with appropriate labeling. (1) State the following
More informationTest 3, Linear Algebra
Test 3, Linear Algebra Dr. Adam Graham-Squire, Fall 2017 Name: I pledge that I have neither given nor received any unauthorized assistance on this exam. (signature) DIRECTIONS 1. Don t panic. 2. Show all
More informationGeneralized Eigenvectors and Jordan Form
Generalized Eigenvectors and Jordan Form We have seen that an n n matrix A is diagonalizable precisely when the dimensions of its eigenspaces sum to n. So if A is not diagonalizable, there is at least
More informationand let s calculate the image of some vectors under the transformation T.
Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =
More informationChapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015
Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 205. If A is a 3 3 triangular matrix, explain why det(a) is equal to the product of entries on the diagonal. If A is a lower triangular or diagonal
More informationMATH 583A REVIEW SESSION #1
MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),
More informationPractice Problems for the Final Exam
Practice Problems for the Final Exam Linear Algebra. Matrix multiplication: (a) Problem 3 in Midterm One. (b) Problem 2 in Quiz. 2. Solve the linear system: (a) Problem 4 in Midterm One. (b) Problem in
More informationLinear Algebra (MATH ) Spring 2011 Final Exam Practice Problem Solutions
Linear Algebra (MATH 4) Spring 2 Final Exam Practice Problem Solutions Instructions: Try the following on your own, then use the book and notes where you need help. Afterwards, check your solutions with
More informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
More informationMAT1302F Mathematical Methods II Lecture 19
MAT302F Mathematical Methods II Lecture 9 Aaron Christie 2 April 205 Eigenvectors, Eigenvalues, and Diagonalization Now that the basic theory of eigenvalues and eigenvectors is in place most importantly
More informationComputationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity:
Diagonalization We have seen that diagonal and triangular matrices are much easier to work with than are most matrices For example, determinants and eigenvalues are easy to compute, and multiplication
More informationft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST
me me ft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST 1. (1 pt) local/library/ui/eigentf.pg A is n n an matrices.. There are an infinite number
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More informationJordan normal form notes (version date: 11/21/07)
Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let
More informationA = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,
65 Diagonalizable Matrices It is useful to introduce few more concepts, that are common in the literature Definition 65 The characteristic polynomial of an n n matrix A is the function p(λ) det(a λi) Example
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationMAC Module 12 Eigenvalues and Eigenvectors. Learning Objectives. Upon completing this module, you should be able to:
MAC Module Eigenvalues and Eigenvectors Learning Objectives Upon completing this module, you should be able to: Solve the eigenvalue problem by finding the eigenvalues and the corresponding eigenvectors
More informationMAC Module 12 Eigenvalues and Eigenvectors
MAC 23 Module 2 Eigenvalues and Eigenvectors Learning Objectives Upon completing this module, you should be able to:. Solve the eigenvalue problem by finding the eigenvalues and the corresponding eigenvectors
More informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
More informationPractice Final Exam Solutions
MAT 242 CLASS 90205 FALL 206 Practice Final Exam Solutions The final exam will be cumulative However, the following problems are only from the material covered since the second exam For the material prior
More informationMath 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler.
Math 453 Exam 3 Review The syllabus for Exam 3 is Chapter 6 (pages -2), Chapter 7 through page 37, and Chapter 8 through page 82 in Axler.. You should be sure to know precise definition of the terms we
More informationCity Suburbs. : population distribution after m years
Section 5.3 Diagonalization of Matrices Definition Example: stochastic matrix To City Suburbs From City Suburbs.85.03 = A.15.97 City.15.85 Suburbs.97.03 probability matrix of a sample person s residence
More informationMAT224 Practice Exercises - Week 7.5 Fall Comments
MAT224 Practice Exercises - Week 75 Fall 27 Comments The purpose of this practice exercise set is to give a review of the midterm material via easy proof questions You can read it as a summary and you
More informationCheat Sheet for MATH461
Cheat Sheet for MATH46 Here is the stuff you really need to remember for the exams Linear systems Ax = b Problem: We consider a linear system of m equations for n unknowns x,,x n : For a given matrix A
More informationMath 2174: Practice Midterm 1
Math 74: Practice Midterm Show your work and explain your reasoning as appropriate. No calculators. One page of handwritten notes is allowed for the exam, as well as one blank page of scratch paper.. Consider
More informationChapter 5 Eigenvalues and Eigenvectors
Chapter 5 Eigenvalues and Eigenvectors Outline 5.1 Eigenvalues and Eigenvectors 5.2 Diagonalization 5.3 Complex Vector Spaces 2 5.1 Eigenvalues and Eigenvectors Eigenvalue and Eigenvector If A is a n n
More informationft-uiowa-math2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST
me me ft-uiowa-math255 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 2/3/2 at :3pm CST. ( pt) Library/TCNJ/TCNJ LinearSystems/problem3.pg Give a geometric description of the following
More information. = V c = V [x]v (5.1) c 1. c k
Chapter 5 Linear Algebra It can be argued that all of linear algebra can be understood using the four fundamental subspaces associated with a matrix Because they form the foundation on which we later work,
More informationMath 315: Linear Algebra Solutions to Assignment 7
Math 5: Linear Algebra s to Assignment 7 # Find the eigenvalues of the following matrices. (a.) 4 0 0 0 (b.) 0 0 9 5 4. (a.) The characteristic polynomial det(λi A) = (λ )(λ )(λ ), so the eigenvalues are
More informationQuestion: 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?
Section 5. The Characteristic Polynomial 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? Property The eigenvalues
More informationMath 113 Homework 5. Bowei Liu, Chao Li. Fall 2013
Math 113 Homework 5 Bowei Liu, Chao Li Fall 2013 This homework is due Thursday November 7th at the start of class. Remember to write clearly, and justify your solutions. Please make sure to put your name
More informationMATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.
MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. Diagonalization Let L be a linear operator on a finite-dimensional vector space V. Then the following conditions are equivalent:
More informationDM554 Linear and Integer Programming. Lecture 9. Diagonalization. Marco Chiarandini
DM554 Linear and Integer Programming Lecture 9 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. More on 2. 3. 2 Resume Linear transformations and
More informationEigenvalues, Eigenvectors. Eigenvalues and eigenvector will be fundamentally related to the nature of the solutions of state space systems.
Chapter 3 Linear Algebra In this Chapter we provide a review of some basic concepts from Linear Algebra which will be required in order to compute solutions of LTI systems in state space form, discuss
More information4. Linear transformations as a vector space 17
4 Linear transformations as a vector space 17 d) 1 2 0 0 1 2 0 0 1 0 0 0 1 2 3 4 32 Let a linear transformation in R 2 be the reflection in the line = x 2 Find its matrix 33 For each linear transformation
More informationMATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL
MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left
More informationMath 205, Summer I, Week 4b:
Math 205, Summer I, 2016 Week 4b: Chapter 5, Sections 6, 7 and 8 (5.5 is NOT on the syllabus) 5.6 Eigenvalues and Eigenvectors 5.7 Eigenspaces, nondefective matrices 5.8 Diagonalization [*** See next slide
More informationLinear Algebra Practice Problems
Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,
More informationMath 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith
Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. Definition: Let V T V be a linear transformation.
More informationMath 369 Exam #2 Practice Problem Solutions
Math 369 Exam #2 Practice Problem Solutions 2 5. Is { 2, 3, 8 } a basis for R 3? Answer: No, it is not. To show that it is not a basis, it suffices to show that this is not a linearly independent set.
More informationIn these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation.
1 2 Linear Systems In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation 21 Matrix ODEs Let and is a scalar A linear function satisfies Linear superposition ) Linear
More informationMATH 1553 PRACTICE MIDTERM 3 (VERSION A)
MATH 1553 PRACTICE MIDTERM 3 (VERSION A) Name Section 1 2 3 4 5 Total Please read all instructions carefully before beginning. Each problem is worth 10 points. The maximum score on this exam is 50 points.
More informationRecall : Eigenvalues and Eigenvectors
Recall : Eigenvalues and Eigenvectors Let A be an n n matrix. If a nonzero vector x in R n satisfies Ax λx for a scalar λ, then : The scalar λ is called an eigenvalue of A. The vector x is called an eigenvector
More informationPractice problems for Exam 3 A =
Practice problems for Exam 3. Let A = 2 (a) Determine whether A is diagonalizable. If so, find a matrix S such that S AS is diagonal. If not, explain why not. (b) What are the eigenvalues of A? Is A diagonalizable?
More information1. Select the unique answer (choice) for each problem. Write only the answer.
MATH 5 Practice Problem Set Spring 7. Select the unique answer (choice) for each problem. Write only the answer. () Determine all the values of a for which the system has infinitely many solutions: x +
More informationMath 314/ Exam 2 Blue Exam Solutions December 4, 2008 Instructor: Dr. S. Cooper. Name:
Math 34/84 - Exam Blue Exam Solutions December 4, 8 Instructor: Dr. S. Cooper Name: Read each question carefully. Be sure to show all of your work and not just your final conclusion. You may not use your
More informationLinear Algebra Review
Chapter 1 Linear Algebra Review It is assumed that you have had a course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc. I will review some of these terms here, but quite
More informationEigenvalues and Eigenvectors A =
Eigenvalues and Eigenvectors Definition 0 Let A R n n be an n n real matrix A number λ R is a real eigenvalue of A if there exists a nonzero vector v R n such that A v = λ v The vector v is called an eigenvector
More informationMATH 1553 PRACTICE MIDTERM 3 (VERSION B)
MATH 1553 PRACTICE MIDTERM 3 (VERSION B) Name Section 1 2 3 4 5 Total Please read all instructions carefully before beginning. Each problem is worth 10 points. The maximum score on this exam is 50 points.
More informationAnnouncements Monday, November 06
Announcements Monday, November 06 This week s quiz: covers Sections 5 and 52 Midterm 3, on November 7th (next Friday) Exam covers: Sections 3,32,5,52,53 and 55 Section 53 Diagonalization Motivation: Difference
More informationMath 323 Exam 2 Sample Problems Solution Guide October 31, 2013
Math Exam Sample Problems Solution Guide October, Note that the following provides a guide to the solutions on the sample problems, but in some cases the complete solution would require more work or justification
More information5.3.5 The eigenvalues are 3, 2, 3 (i.e., the diagonal entries of D) with corresponding eigenvalues. Null(A 3I) = Null( ), 0 0
535 The eigenvalues are 3,, 3 (ie, the diagonal entries of D) with corresponding eigenvalues,, 538 The matrix is upper triangular so the eigenvalues are simply the diagonal entries, namely 3, 3 The corresponding
More informationMATH 115A: SAMPLE FINAL SOLUTIONS
MATH A: SAMPLE FINAL SOLUTIONS JOE HUGHES. Let V be the set of all functions f : R R such that f( x) = f(x) for all x R. Show that V is a vector space over R under the usual addition and scalar multiplication
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW SPENCER BECKER-KAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for
More informationMATH 221, Spring Homework 10 Solutions
MATH 22, Spring 28 - Homework Solutions Due Tuesday, May Section 52 Page 279, Problem 2: 4 λ A λi = and the characteristic polynomial is det(a λi) = ( 4 λ)( λ) ( )(6) = λ 6 λ 2 +λ+2 The solutions to the
More informationMATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION
MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether
More informationSUMMARY OF MATH 1600
SUMMARY OF MATH 1600 Note: The following list is intended as a study guide for the final exam. It is a continuation of the study guide for the midterm. It does not claim to be a comprehensive list. You
More information18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in
806 Problem Set 8 - Solutions Due Wednesday, 4 November 2007 at 4 pm in 2-06 08 03 Problem : 205+5+5+5 Consider the matrix A 02 07 a Check that A is a positive Markov matrix, and find its steady state
More informationLecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1)
Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1) Travis Schedler Tue, Oct 18, 2011 (version: Tue, Oct 18, 6:00 PM) Goals (2) Solving systems of equations
More information80 min. 65 points in total. The raw score will be normalized according to the course policy to count into the final score.
This is a closed book, closed notes exam You need to justify every one of your answers unless you are asked not to do so Completely correct answers given without justification will receive little credit
More informationEK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016
EK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016 Answer the questions in the spaces provided on the question sheets. You must show your work to get credit for your answers. There will
More informationAnnouncements Wednesday, November 7
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
More informationHW2 - Due 01/30. Each answer must be mathematically justified. Don t forget your name.
HW2 - Due 0/30 Each answer must be mathematically justified. Don t forget your name. Problem. Use the row reduction algorithm to find the inverse of the matrix 0 0, 2 3 5 if it exists. Double check your
More informationGeneralized eigenvector - Wikipedia, the free encyclopedia
1 of 30 18/03/2013 20:00 Generalized eigenvector From Wikipedia, the free encyclopedia In linear algebra, for a matrix A, there may not always exist a full set of linearly independent eigenvectors that
More informationReview problems for MA 54, Fall 2004.
Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on
More informationBASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x
BASIC ALGORITHMS IN LINEAR ALGEBRA STEVEN DALE CUTKOSKY Matrices and Applications of Gaussian Elimination Systems of Equations Suppose that A is an n n matrix with coefficents in a field F, and x = (x,,
More informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors week -2 Fall 26 Eigenvalues and eigenvectors The most simple linear transformation from R n to R n may be the transformation of the form: T (x,,, x n ) (λ x, λ 2,, λ n x n
More informationMIT Final Exam Solutions, Spring 2017
MIT 8.6 Final Exam Solutions, Spring 7 Problem : For some real matrix A, the following vectors form a basis for its column space and null space: C(A) = span,, N(A) = span,,. (a) What is the size m n of
More informationMath 308 Practice Test for Final Exam Winter 2015
Math 38 Practice Test for Final Exam Winter 25 No books are allowed during the exam. But you are allowed one sheet ( x 8) of handwritten notes (back and front). You may use a calculator. For TRUE/FALSE
More informationLinear Algebra Practice Final
. Let (a) First, Linear Algebra Practice Final Summer 3 3 A = 5 3 3 rref([a ) = 5 so if we let x 5 = t, then x 4 = t, x 3 =, x = t, and x = t, so that t t x = t = t t whence ker A = span(,,,, ) and a basis
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More information5.) For each of the given sets of vectors, determine whether or not the set spans R 3. Give reasons for your answers.
Linear Algebra - Test File - Spring Test # For problems - consider the following system of equations. x + y - z = x + y + 4z = x + y + 6z =.) Solve the system without using your calculator..) Find the
More informationDimension. Eigenvalue and eigenvector
Dimension. Eigenvalue and eigenvector Math 112, week 9 Goals: Bases, dimension, rank-nullity theorem. Eigenvalue and eigenvector. Suggested Textbook Readings: Sections 4.5, 4.6, 5.1, 5.2 Week 9: Dimension,
More informationMATH 310, REVIEW SHEET 2
MATH 310, REVIEW SHEET 2 These notes are a very short summary of the key topics in the book (and follow the book pretty closely). You should be familiar with everything on here, but it s not comprehensive,
More informationLinear Algebra II Lecture 22
Linear Algebra II Lecture 22 Xi Chen University of Alberta March 4, 24 Outline Characteristic Polynomial, Eigenvalue, Eigenvector and Eigenvalue, Eigenvector and Let T : V V be a linear endomorphism. We
More information