LECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book]
|
|
- Domenic French
- 6 years ago
- Views:
Transcription
1 LECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO [See also Appendix B in the book] 1 Introduction In Lecture IV we have introduced the concept of eigenvalue and eigenvector of a linear operator on a real vector space (or equivalently for square matrices) Denition Let A M n (R) and λ R; we say that λ is an eigenvalue of A if there exists a non-zero vector x R n such that Ax = λx Such vector is called eigenvector associated to λ The set of eigenvalues of A is called spectrum of A and it is usually denoted by Λ(A) We call eigenspace of λ, the vector subspace dened by Null(A λi n ) (Null denotes the nullspace) This vector subspace is denoted by E λ [or E λ (A)] We have: E λ = {x R n : Ax = λx} The dimension of E λ is called geometric multiplicity of λ and it will be denoted by d λ We also showed a way for computing eigenvalues: Proposition 1 Let A M n (R) We have that λ is an eigenvalue of A, if and only if λ is a root of the characteristic polynomial P (λ) = det(a λi n ) The multiplicity of λ as root of the characteristic polynomial P of T is called algebraic multiplicity of λ and it will be denoted h λ (or h(λ)) In particular: Proposition 2 Let A M n (R) A has at most n distinct eigenvalues If we denote by λ 1,, λ s R such eigenvalues (with s n), let E λ1,, E λs be the relative eigenspaces and d λ1,, d λs the geometric multeplicities We have: i) s s i=1 d λ i n ii) s i=1 d λ i = dim ( s i=1 E λ i ) Denition Let A M n (R) We say that A is diagonalizable, if it is similar to a diagonal matrix; ie, there exists C GL n (R) and D diagonal matrix of order n, such that: A = C 1 DC The importance of introducing these concepts, derived from the following result, ie, the possibility of obtaining a simpler (diagonal) representation for our matrix/linear operator (up to similarity), in the special case that the matrix had n linearly independent eigenvectors (ie, a basis of eigenvectors) Proposition 3 Let A M n (R) If A has at n linearly independent eigenvectors, then it is diagonalizable In particular, if we denote by λ 1,, λ s R its eigenvalues (with s n) and with d λ1,, d λs their geometric multiplicities, then: s A is diagonalizable d λi = n 1 i=1
2 2 ALFONSO SORRENTINO Unfortunately, it is not always possible to nd n independent eigenvectors For instance, consider: 1 1 A = 0 1 ( 1 This has one only eigenvalue λ = 1, with eigenspace E 1 = 0 hence, it cannot be diagonalized ) [Exercise]; Even though a diagonal form is not possible, one would like to nd a simpler form for the matrix, that is as close as possible to the diagonal one The Jordan Canonical form provides this form and is essentially the simplest possible representation, after a similar transformation Moreover, this form provides a complete representation of the eigenstructure of the matrix and has important implications in study of dynamical systems and dierential equations (see Lecture VIII) 2 Complex eigenvalues and eigenvectors Note: We refer to 55 in the book (or any other Complex analysis textbook) for a review of the complex numbers Let A M n (R) and consider its characteristic polynomial P (λ) = det(a λi n ) The main problem we pointed out at the end of last section, is that in general this polynomial might not have enough solutions in R (for instance, x has NO solutions over the real number!) Things change completely when we consider complex solutions (ie, in C) The Fundamental theorem of Algebra states that any polynomial can be linearly factorized over C, ie, it has as many roots (counted each with its multiplicity) as its degree [this is sometimes referred to, saying that C is an algebraically closed] Let us consider not only the real root of our characteristic polynomial, but also its complex ones We need to notice that, since P has real coeents, then if µ C is a root, also µ is a root In fact (using the properties of conjugation and the fact that the coecients of P are real): 0 = P (µ) = P (µ) = P (µ) = P (µ) we can divide its roots in two categories: λ 1,, λ s real roots (possibly repeated), µ 1, µ 1,, µ r, µ r non-real (couple of) roots (possible repeated), with n = s + 2r We can consider A as acting on C n = R n ir n (instead of R n ) and dene analogously complex eigenvectors Denition Let A M n (R) and µ C; we say that µ is an eigenvalue of A if there exists a non-zero vector z = x + iy C n such that Az = µz Observe, that the eigenvectors corresponding to a couple of eigenvalues µ, µ C are complex conjugated In fact, if Az = µz, since A has real entries, then A = A and: Az = Az = Az = µz = µz Let us start to consider the following lemma
3 LECTURE VII: THE JORDAN CANONICAL FORM 3 Lemma 1 Let A M 2 (R) with two non-real eigenvalues µ, µ, where µ = a + ib Then, there exist C GL 2 (R) such that C 1 a b AC = Proof Consider the complex (conjugate) eigenvectors ϕ, ϕ C 2, where ϕ = u+iv with u, v R 2 First of all observe that ϕ and ϕ are linearly independent in C 2 (since they are eigenvectors with distinct eigenvalues; see lecture IV) and consequently also u and v are linearly indipendent (as vectors of R 2 ) [Exercise] We know that: Au + iav = Aϕ = µϕ = (a + ib)(u + iv) = (au bv) + i(av + bu), and this implies: b Au = (v u) ( a) a Av = (v u) b Consider the matrix C = (v u) [placed in the columns]; C GL 2 (R) [since v, u form a basis] and from what written above: a b AC = A(v u) = (Au Av) = (v u) = C, or equivalently: C 1 a b AC = This results immediately implies a generalization of proposition 3 Proposition 4 Let A M n (R) If A has at n = r + 2s distinct eigenvalues λ 1,, λ r (real ones) and µ 1, µ 1,, µ r, µ r (non-real ones) [with µ j = a j + ib j ], then A is similar to a matrix of the form (the empty entries are zeros): λ 1 λ r a 1 b 1 b 1 a 1 a s b s Proof We proceed similarly to what already done in the previous lemma Let x 1,, x r R n are the eigenvectors corresponding to λ 1,, λ r (real ones) and ϕ 1, ϕ 1,, ϕ s, ϕ s C n the ones corresponding to µ 1, µ 1,, µ s, µ s (non-real ones), with ϕ i = u i + iv i (u i, v i R n ) It is sucient to consider the matrix C = (x 1 x r v 1 u 1 v s u s ) GL n (R), and show that C 1 AC is in the above form Obviously everything generalizes to the case that A has not all distinct eigenvalues, but one can nd anyway a basis of linearly independent eigenvectors (both for the real and non-real eigenspaces) Our next goal is to nd a canonical form for any matrix A M n (R) b s a s
4 4 ALFONSO SORRENTINO 3 The Jordan Canonical Form The main result of this section (without proof) provides a canonical form for any real square matrix Denition [Elementary Jordan block] Let λ C The matrix λ λ J λ,r = M r (C) λ λ is called elementary Jordan block of order r, corresponding to the eigenvalue λ If r = 1, then J λ,1 = λ Denition A matrix A M n (C) is said to be in complex Jordan canonical form if it is made of elementary Jordan blocks (along the diagonal) Namely, J λ1,r 1 J λ2,r2 J λs,r s One example might be, for instance: λ λ 1 0 ; it is made of two blocks J λ1,2 and J λ2,1 One can prove the following theorem Theorem 1 (Complex Jordan Canonical form) Let A M n (C) Then A is similar to a matrix in Jordan canonical form, such that the λ's that appear in the elementary Jordan block's correspond to the eigenvalues of A When we work with a real matrix, we would like to have blocks made of real numbers In the spirit of lemma 1, one can prove what follows Lemma 2 Let µ = a + ib (with b 0) an eigenvalue of a real matrix A We know that µ = a ib is also an eigenvalue Then A is similar to a matrix in Jordan canonical form, where the blocks corresponding to couple µ, µ have the form: D I O O O O D I O O where Ĵ µ,s = ( a b D = If s = 1, then Ĵµ,s = D O O O D I O O O O D ) ( 1 0, I = 0 1 ) M 2s (R), and O = Finally, we can state our main result for real matrices ( Denition A matrix A M n (R) is said to be in real Jordan canonical form, if it is made of elementary Jordan blocks of the forms J λ,r, with λ R, and Ĵµ,s, with µ = a + ib C (b 0) )
5 LECTURE VII: THE JORDAN CANONICAL FORM 5 Theorem 2 (Real Jordan Canonical form) Let A M n (R) Then A is similar to a matrix in real Jordan canonical form, made of blocks of the form J λ,r, corresponding to real eigenvalues λ and of elementary Jordan blocks of the form Ĵ µ,r, corresponding to (non-real) complex conjugate (couple of) eigenvalues µ, µ The proof of these results goes further beyond the goal of this course However, what one denitely needs is a description of the algorithm for nding the matrix C GL n (R), such that C 1 AC is in this form Unfortunately, the general algorithm might sound quite complicated (actually more than it actually is) because of the notation and would require some preparatory lemmata we will try to provide a complete description of it, restricting ourselves only to the two dimensional and three dimensional cases (ie, n = 2 and n = 3) This would be enough to get an idea of how it works and for future applications to (planar) dynamical systems (see Lecture VIII) Case n=2 (two-by-two real matrices) Let us consider A M 2 (R) and its characteristic polynomial p(λ) = det(a λi 2 ) This is a quadratic polynomial with real coecients We already know that there are always two solutions (maybe coinciding) in C and that if there is one non-real solution, then also its conjugate is a solution Therefore the only possibilities we may have are: a) two distinct real roots: λ 1 λ 2 R; b) two complex conjugate roots: µ, µ C, where µ = a + ib (b 0); c) only one real solution (with algebraic multiplicity 2): λ R There may not be other possibilities (this is a peculiarity of the two dimensional case) Let us analyze these cases singularly a) In this case, we already know that the matrix is diagonalizable In fact, we can nd two eigenvectors v 1 and v 2 (corresponding respectively to λ 1 and λ 2 ): Av 1 = λ 1 v 1 and Av 2 = λ 2 v 2 ; we have already proved in lecture IV that they are linearly independent Consider the matrix C = (v 1 v 2 ) GL 2 (R) (this is invertible because v 1, v 2 form a basis); one has: AC = A(v 1 v 2 ) = (Av 1 Av 2 ) = (λ 1 v 1 λ 2 v 2 ) = λ1 0 λ1 0 = (v 1 v 2 ) = C 0 λ 2 0 λ 2 λ1 0 0 λ 2 The corresponding Jordan Form is: λ1 0, 0 λ 2 made of two elementary Jordan blocks J λ1,1 and J λ2,1 b) This is exactly the content of lemma 1 We can nd two complex (conjugate) eigenvectors ϕ, ϕ C 2, where ϕ = u + iv with u, v R 2 As already observed u and v are linearly indipendent
6 6 ALFONSO SORRENTINO and if we consider the matrix C = (v u), then C GL 2 (R) [since v, u form a basis] and C 1 a b AC = In this case, the Jordan Form is: ( a b made of one elementary Jordan block Ĵµ,1 c) In this case we have only one eigenvalue λ, with algebraic multiplicity h λ = 2 We can consider the associated eigenspace E λ = {x R 2 : Ax = λx} We need to distinguish two cases, according to the dimension of this eigenspace: 1 d λ 2] (namely, the geometric multiplicity of λ) c1) If d λ = 2, then one can nd two linearly independent eigenvectors v 1 and v 2, that will form a basis and proceed as in case a) [with λ 1 = λ 2 = λ] there will exist C = (v 1 v 2 ) GL 2 (R) such that: C 1 λ 0 AC = 0 λ The corresponding Jordan Form is: λ 0, 0 λ ), made of two equal elementary Jordan blocks J λ,1 c2) if d λ = 1, then E λ is spanned by only one vector v 1 it is not possible to nd a basis of eigenvectors Remember that E λ = Null(A λi 2 ); instead, one could consider Null ( (A λi 2 ) 2) (it will be called generalized eigenspace) It is possible to show that (the rst inclusion is easy, while the second equality is less trivial): E λ Null ( (A λi 2 ) 2) = R 2 one can nd a basis for this, rather than for E λ One vector of this basis will be v 1 (the eigenvalue) and the other (that we will denote v 2 ) will be chosen in order to satisfy: (A λi 2 )v 2 = v 1 Let us show that such a vector always exists In fact, take any vector v E λ (ie, (A λi 2 )v 0) We know from above that (A λi 2 ) 2 v = 0, therefore: 0 = (A λi 2 ) 2 v = (A λi 2 )(Av λv) = 0 (Av λv) E λ Hence, Av λv = cv 1, where c 0 If we take v 2 = 1 c v, we have found the desired vector! Now, if we dene the matrix C = (v 1 v 2 ), then C GL 2 (R) [since v 1, v 2 form a basis]; moreover: AC = A(v 1 v 2 ) = (Av 1 Av 2 ) = (λv 1 v 1 + λv 2 ) = λ 1 λ 1 = (v 1 v 2 ) = C 0 λ 0 λ ( λ 1 0 λ )
7 LECTURE VII: THE JORDAN CANONICAL FORM 7 The corresponding Jordan Form consists of only one elementary jordan block J λ,2 : λ 1 0 λ Case n=3 (three-by-three real matrices) Let us consider A M 3 (R) and its characteristic polynomial [Exercise]: p(λ) = det(a λi 3 ) = λ 3 + Tr (A)λ 2 αλ + det(a) where α R Usually Tr (A) := Trace(A) and det(a) are not dicult to nd; therefore, one only needs to determine α; this could be done, for instance, choosing any c 0 and computing det(a ci 3 ), obtaining an equation in α: αc + ( c 3 + Tr (A)c 2 + det(a)) = det(a ci 3 ) Now that we know how to compute (eciently) this polynomial, we can start our analysis This is a cubic polynomial with real coecients We already know that there are always three solutions (maybe coinciding) in C and that if there is one non-real solution, then also its conjugate is a solution Moreover, as a peculiarity of the cubic case, there is always at least one real solution This is quite easy to explain In fact, if one sees this polynomial P (λ) as a function on R, then lim P (λ) = + and lim P (λ) = λ λ + [the sign depends on the sign of the leading term; in our specic case λ 3 ] By continuity (or by the Intermediate value theorem), there must be a point λ 0, where the function crosses che real axis, ie, a solution of P (λ) = 0 An other plausibile explanation is that there cannot be three non-real roots, since everytime there is a non-real one, also its complex conjugate is a root; therefore, the number of non-real solutions is always even We need to distinguish several cases depending on whether there are three real solutions, two real solutions or one real solution a) three distinct real roots: λ 1, λ 2, λ 3 R; b) two distinct real roots: λ 1, λ 2 R; c) only one real solution (with algebraic multiplicity 3): λ 0 R; d) only one real solution and a couple of non-real conjugate ones: λ 0 R and µ, µ C, where µ = a + ib (b 0) Let us analyze these cases singularly a) In this case, we already know that the matrix is diagonalizable In fact, we can nd three eigenvectors v 1, v 2 and v 3 (corresponding respectively to λ 1, λ 2 and λ 3 ): Av 1 = λ 1 v 1 Av 2 = λ 2 v 2 and Av 3 = λ 3 v 3 ; we have already proved in lecture IV that they are linearly independent Consider the matrix C = (v 1 v 2 v 3 ) GL 3 (R) (this is invertible because v 1, v 2, v 3 form a basis); one has: AC = A(v 1 v 2 v 3 ) = (Av 1 Av 2 Av 3 ) = (λ 1 v 1 λ 2 v 2 λ 3 v 3 ) = = (v 1 v 2 v 3 ) λ λ 2 0 = C λ λ λ λ 3
8 8 ALFONSO SORRENTINO λ λ λ 3 The corresponding Jordan Form is: λ λ 2 0, 0 0 λ 3 made of three elementary Jordan blocks: J λ1,1, J λ2,1 and J λ3,1 b) Since there are only two real roots, necessarily one of them must have algebraic multiplicity equal to 2 (assume, without any loss of generality, that this root is λ 1 ); namely, the characteristic polynomial can be factorized as follows: P (λ) = (λ λ 1 ) 2 (λ λ 2 ) Let us denote by E λ1 and E λ2 the two eigenspaces We can easily deduce that dim E λ2 = 1 (since the algebraic multiplicity is 1); let us call v 2 one eigenvector that spans this space (it forms a basis): E λ2 = v 2 What can we say about E λ1? We need to distinguish two cases, according to whether its dimension d λ1 is 1 or 2 b1) If d λ1 = 2, then I can nd two linearly independent eigenvectors u 1 and u 2, that will form a basis for E λ1 and proceed as in case a) [with λ 1 = λ 2 = λ and λ 3 = λ 2 ] there exists C = (u 1 u 2 v 2 ) GL 3 (R) such that: λ λ 1 0 The corresponding Jordan Form is: λ λ 1 0, made of three elementary Jordan blocks: J λ1,1, J λ1,1 and J λ2,1 b2) if d λ1 = 1, then E λ is spanned by only one vector u 1 it is not possible to nd a basis of eigenvectors We proceed as we have already done in case c2) of n = 2 Remember that E λ1 = Null(A λ 1 I 3 ); instead, one could consider Null ( (A λ 1 I 2 ) 2) (it will be called generalized eigenspace) It is possible to show that this generalized eigenspace has dimension 2 and: E λ1 Null ( (A λ 1 I 3 ) 2) one can nd a basis for this, rather than for E λ1 One vector of this basis will be u 1 (the eigenvector) and the other (that we will denote u 2 ) will be chosen in order to satisfy: (A λ 1 I 3 )u 2 = u 1 Let us show that such a vector always exist In fact, take any vector v E λ1 (ie, (A λ 1 I 3 )v 0) We know from above that (A λ 1 I 3 ) 2 v = 0, therefore: 0 = (A λ 1 I 3 ) 2 v = (A λ 1 I 3 )(Av λ 1 v) = 0 (Av λ 1 v) E λ1 Hence, Av λ 1 v = cu 1, where c 0 If we take u 2 = 1 c v, we have found the desired vector!
9 LECTURE VII: THE JORDAN CANONICAL FORM 9 Now, if we dene the matrix C = (u 1 u 2 v 2 ), then C GL 3 (R) [since u 1, u 2, v 2 form a basis]; moreover: AC = A(u 1 u 2 v 2 ) = (Au 1 Au 2 Av 2 ) = (λ 1 u 1 u 1 + λ 2 u 2 λ 2 v 2 ) = = (u 1 u 2 v 2 ) λ λ 1 0 = C λ λ 1 0 λ λ 1 0 The corresponding Jordan Form consists of two elementary jordan blocks J λ1,2 and J λ2,1 c) In this case, the characteristic polynomial can be factorized as follows: P (λ) = (λ λ 0 ) 3 Let us denote by E λ0 the eigenspace and with d λ0 its dimension From what already seen (see Lecture IV), 1 d λ0 3 We need to distinguish three cases, according to whether its dimension d λ0 is 1, 2 or 3 c1) If d λ0 = 3, then I can nd three linearly independent eigenvectors v 1, v 2, v 3, that will form a basis for E λ0 and proceed as in case a) [with λ 1 = λ 2 = λ 3 = λ 0 ] there exists C = (v 1 v 2 v 3 ) GL 3 (R) such that: λ λ 0 0 The corresponding Jordan Form is: λ λ 0 0, made of three elementary Jordan blocks: J λ0,1, J λ0,1 and J λ0,1 c2) If d λ0 = 2, then E λ0 has dimension 2 Let us denote by {w 1, w 2 } a basis for this space We would like to complete to a basis for R 3 ; but obviously, it cannot be done just considering eigenvectors we have to consider - in the same spirit as we have already done in case b2) - generalized eigenvectors It is possible to show that (the rst inclusion is easy, the second less trivial): E λ0 Null ( (A λ 0 I) 2) = R 3 one can nd a basis for this, rather than for E λ0 Let us proceed as follows Choose a vector v E λ0 Since Null ( (A λ 0 I) 2) = R 3 = v Null ( (A λ 0 I 3 ) 2) Hence, 0 = (A λ 0 I 3 ) 2 v = (A λ 0 I 3 )(Av λ 0 v) We can denote v 2 = Av λ 0 v (hence, Av = v 2 + λ 0 v) It is easy to verify that v 2 E λ0 We can take now any other vector v 1 in E λ0, that is linearly independent of v 2 (since d λ0 = 2, this is always possible)
10 10 ALFONSO SORRENTINO The three vectors {v 1, v 2, v} form a basis of R 3 (they are linearly independent by construction) Now, if we dene the matrix C = (v 1 v 2 v), then C GL 3 (R) [since v 1, v 2, v form a basis]; moreover: AC = A(v 1 v 2 v) = (Av 1 Av 2 Av) = (λ 0 v 1 λ 0 v 2 v 2 + λ 0 v) = = (v 1 v 2 v) λ λ 0 1 = C λ λ 0 1 λ λ 0 1 The corresponding Jordan Form consists of two elementary jordan blocks J λ0,1 and J λ0,2 c3) If d λ0 = 1, then E λ1 has dimension 1; suppose that it is spanned by a vector v 1 (it is a basis) We would like to complete to a basis for R 3 ; but obviously, it cannot be done just considering eigenvectors we have to consider - in the same spirit as we have already done in case b2) - generalized eigenvectors It is possible to show that (the rst two inclusions are easy, the latter less trivial): E λ0 Null ( (A λ 0 I 3 ) 2) Null ( (A λ 0 I 3 ) 3) = R 3 In particular, one can show that dim Null ( (A λ 0 I 3 ) 2) = 2 Let us choose a vector v 3 Null ( (A λ 0 I 3 ) 2) Dene: v 3 Null ( (A λ 0 I 3 ) 2) v 2 = (A λ 0 I 3 )v 3 v 1 = (A λ 0 I 3 ) 2 v 3 = (A λ 0 I 3 )v 2 In particular, these three vectors are linearly indipendent and (using that (A λ 0 I 3 ) 3 v 1 = (A λ 0 I 3 ) 3 v 3 = 0): (A λ 0 I 3 )v 3 = v 2 = Av 3 = v 2 + λ 0 v 3 (A λ 0 I 3 )v 2 = v 1 = Av 2 = v 1 + λ 0 v 2 (A λ 0 I 3 )v 1 = 0 = Av 1 = λ 0 v 1 (v 1 E λ0 ) The three vectors {v 1, v 2, v 3 } form a basis of R 3 and, if we dene the matrix C = (v 1 v 2 v 3 ), then C GL 3 (R) [since v 1, v 2, v 3 form a basis]; moreover: AC = A(v 1 v 2 v 3 ) = (Av 1 Av 2 Av 3 ) = (λ 0 v 1 v 1 + λ 0 v 2 v 2 + λ 0 v 3 ) = = (v 1 v 2 v 3 ) λ λ 0 1 = C λ λ 0 1 λ λ 0 1 The corresponding Jordan Form consists of only one elementary jordan block: J λ0,3
11 LECTURE VII: THE JORDAN CANONICAL FORM 11 d) In this case, the characteristic polynomial can be factorized as follows: P (λ) = (λ λ 0 )Q(λ), where Q(λ) is a quadratic polynomial with no real roots (ie, its discriminant is negative) [Exercise: one can check that Q(λ) = λ 2 2aλ+(a 2 +b 2 )] Let us denote by E λ0 the eigenspace corresponding to the real eigenvalue λ 0 ; its dimension d λ0 = 1, therefore, it is spanned by only one vector v 1 Now, let us consider the non-real part We proceed as already done for case b) [n = 2] (see also lemma 1) We can nd two complex (conjugate) eigenvectors ϕ, ϕ C 3, where ϕ = u+iv with u, v R 3 As already observed u and v are linearly indipendent Moreover also v 1, v, u are linearly independent [Exercise] and they form a basis for R 3 Consider the matrix C = (v 1 v u), then C GL 3 (R) [since v 1, v, u form a basis] One can check that λ a b 0 (this is essentially due to the fact that A leaves invariant the subspace corresponding to non-real eigenvectors and the one corresponding to the real ones) In this case, the Jordan Form is: λ a b 0 made of two elementary Jordan blocks J λ0,1 and Ĵµ,1 Department of Mathematics, Princeton University address: asorrent@mathprincetonedu
LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT FALL 2006 PRINCETON UNIVERSITY
LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT 204 - FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO 1 Adjoint of a linear operator Note: In these notes, V will denote a n-dimensional euclidean vector
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 information4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial
Linear Algebra (part 4): Eigenvalues, Diagonalization, and the Jordan Form (by Evan Dummit, 27, v ) Contents 4 Eigenvalues, Diagonalization, and the Jordan Canonical Form 4 Eigenvalues, Eigenvectors, and
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 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 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 informationDiagonalization of Matrix
of Matrix King Saud University August 29, 2018 of Matrix Table of contents 1 2 of Matrix Definition If A M n (R) and λ R. We say that λ is an eigenvalue of the matrix A if there is X R n \ {0} such that
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 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 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 informationChapter 5. Eigenvalues and Eigenvectors
Chapter 5 Eigenvalues and Eigenvectors Section 5. Eigenvectors and Eigenvalues Motivation: Difference equations A Biology Question How to predict a population of rabbits with given dynamics:. half of the
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 informationLecture 15, 16: Diagonalization
Lecture 15, 16: Diagonalization Motivation: Eigenvalues and Eigenvectors are easy to compute for diagonal matrices. Hence, we would like (if possible) to convert matrix A into a diagonal matrix. Suppose
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 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 informationLecture 12: Diagonalization
Lecture : Diagonalization A square matrix D is called diagonal if all but diagonal entries are zero: a a D a n 5 n n. () Diagonal matrices are the simplest matrices that are basically equivalent to vectors
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 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 information1. In this problem, if the statement is always true, circle T; otherwise, circle F.
Math 1553, Extra Practice for Midterm 3 (sections 45-65) Solutions 1 In this problem, if the statement is always true, circle T; otherwise, circle F a) T F If A is a square matrix and the homogeneous equation
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 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 informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - 4 (Alberto Bressan, Spring 27) Review of complex numbers In this chapter we shall need to work with complex numbers z C These can be written in the form z = a+ib,
More informationEigenvectors. Prop-Defn
Eigenvectors Aim lecture: The simplest T -invariant subspaces are 1-dim & these give rise to the theory of eigenvectors. To compute these we introduce the similarity invariant, the characteristic polynomial.
More informationEigenvalues, Eigenvectors, and Diagonalization
Math 240 TA: Shuyi Weng Winter 207 February 23, 207 Eigenvalues, Eigenvectors, and Diagonalization The concepts of eigenvalues, eigenvectors, and diagonalization are best studied with examples. We will
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 information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationLecture 10 - Eigenvalues problem
Lecture 10 - Eigenvalues problem Department of Computer Science University of Houston February 28, 2008 1 Lecture 10 - Eigenvalues problem Introduction Eigenvalue problems form an important class of problems
More informationNotes on the matrix exponential
Notes on the matrix exponential Erik Wahlén erik.wahlen@math.lu.se February 14, 212 1 Introduction The purpose of these notes is to describe how one can compute the matrix exponential e A when A is not
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 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 information6 Inner Product Spaces
Lectures 16,17,18 6 Inner Product Spaces 6.1 Basic Definition Parallelogram law, the ability to measure angle between two vectors and in particular, the concept of perpendicularity make the euclidean space
More informationJordan Canonical Form Homework Solutions
Jordan Canonical Form Homework Solutions For each of the following, put the matrix in Jordan canonical form and find the matrix S such that S AS = J. [ ]. A = A λi = λ λ = ( λ) = λ λ = λ =, Since we have
More informationAnnouncements Wednesday, November 01
Announcements Wednesday, November 01 WeBWorK 3.1, 3.2 are due today at 11:59pm. The quiz on Friday covers 3.1, 3.2. My office is Skiles 244. Rabinoffice hours are Monday, 1 3pm and Tuesday, 9 11am. Section
More informationThe Jordan Normal Form and its Applications
The and its Applications Jeremy IMPACT Brigham Young University A square matrix A is a linear operator on {R, C} n. A is diagonalizable if and only if it has n linearly independent eigenvectors. What happens
More informationAnnouncements Wednesday, November 01
Announcements Wednesday, November 01 WeBWorK 3.1, 3.2 are due today at 11:59pm. The quiz on Friday covers 3.1, 3.2. My office is Skiles 244. Rabinoffice hours are Monday, 1 3pm and Tuesday, 9 11am. Section
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 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 informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
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 informationLinear Algebra 2 More on determinants and Evalues Exercises and Thanksgiving Activities
Linear Algebra 2 More on determinants and Evalues Exercises and Thanksgiving Activities 2. Determinant of a linear transformation, change of basis. In the solution set of Homework 1, New Series, I included
More informationEigenvalues and Eigenvectors
Sec. 6.1 Eigenvalues and Eigenvectors Linear transformations L : V V that go from a vector space to itself are often called linear operators. Many linear operators can be understood geometrically by identifying
More informationEIGENVALUES AND EIGENVECTORS
EIGENVALUES AND EIGENVECTORS Diagonalizable linear transformations and matrices Recall, a matrix, D, is diagonal if it is square and the only non-zero entries are on the diagonal This is equivalent to
More informationEcon Slides from Lecture 7
Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for
More informationJordan Canonical Form
Jordan Canonical Form Massoud Malek Jordan normal form or Jordan canonical form (named in honor of Camille Jordan) shows that by changing the basis, a given square matrix M can be transformed into a certain
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 informationSummer Session Practice Final Exam
Math 2F Summer Session 25 Practice Final Exam Time Limit: Hours Name (Print): Teaching Assistant This exam contains pages (including this cover page) and 9 problems. Check to see if any pages are missing.
More informationChapter 6. Eigenvalues. Josef Leydold Mathematical Methods WS 2018/19 6 Eigenvalues 1 / 45
Chapter 6 Eigenvalues Josef Leydold Mathematical Methods WS 2018/19 6 Eigenvalues 1 / 45 Closed Leontief Model In a closed Leontief input-output-model consumption and production coincide, i.e. V x = x
More informationEE5120 Linear Algebra: Tutorial 6, July-Dec Covers sec 4.2, 5.1, 5.2 of GS
EE0 Linear Algebra: Tutorial 6, July-Dec 07-8 Covers sec 4.,.,. of GS. State True or False with proper explanation: (a) All vectors are eigenvectors of the Identity matrix. (b) Any matrix can be diagonalized.
More informationThe minimal polynomial
The minimal polynomial Michael H Mertens October 22, 2015 Introduction In these short notes we explain some of the important features of the minimal polynomial of a square matrix A and recall some basic
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 informationMath 205, Summer I, Week 4b: Continued. Chapter 5, Section 8
Math 205, Summer I, 2016 Week 4b: Continued Chapter 5, Section 8 2 5.8 Diagonalization [reprint, week04: Eigenvalues and Eigenvectors] + diagonaliization 1. 5.8 Eigenspaces, Diagonalization A vector v
More information5 Eigenvalues and Diagonalization
Linear Algebra (part 5): Eigenvalues and Diagonalization (by Evan Dummit, 27, v 5) Contents 5 Eigenvalues and Diagonalization 5 Eigenvalues, Eigenvectors, and The Characteristic Polynomial 5 Eigenvalues
More informationNONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction
NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
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 informationLinear algebra II Tutorial solutions #1 A = x 1
Linear algebra II Tutorial solutions #. Find the eigenvalues and the eigenvectors of the matrix [ ] 5 2 A =. 4 3 Since tra = 8 and deta = 5 8 = 7, the characteristic polynomial is f(λ) = λ 2 (tra)λ+deta
More informationWhat is on this week. 1 Vector spaces (continued) 1.1 Null space and Column Space of a matrix
Professor Joana Amorim, jamorim@bu.edu What is on this week Vector spaces (continued). Null space and Column Space of a matrix............................. Null Space...........................................2
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 304 Linear Algebra Lecture 33: Bases of eigenvectors. Diagonalization.
MATH 304 Linear Algebra Lecture 33: Bases of eigenvectors. Diagonalization. Eigenvalues and eigenvectors of an operator Definition. Let V be a vector space and L : V V be a linear operator. A number λ
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 informationLec 2: Mathematical Economics
Lec 2: Mathematical Economics to Spectral Theory Sugata Bag Delhi School of Economics 24th August 2012 [SB] (Delhi School of Economics) Introductory Math Econ 24th August 2012 1 / 17 Definition: Eigen
More informationLecture Notes: Eigenvalues and Eigenvectors. 1 Definitions. 2 Finding All Eigenvalues
Lecture Notes: Eigenvalues and Eigenvectors Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Definitions Let A be an n n matrix. If there
More informationREVIEW FOR EXAM II. The exam covers sections , the part of 3.7 on Markov chains, and
REVIEW FOR EXAM II The exam covers sections 3.4 3.6, the part of 3.7 on Markov chains, and 4.1 4.3. 1. The LU factorization: An n n matrix A has an LU factorization if A = LU, where L is lower triangular
More informationMATH 1553-C MIDTERM EXAMINATION 3
MATH 553-C MIDTERM EXAMINATION 3 Name GT Email @gatech.edu Please read all instructions carefully before beginning. Please leave your GT ID card on your desk until your TA scans your exam. Each problem
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 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial.
MATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial. Geometric properties of determinants 2 2 determinants and plane geometry
More informationMath 4A Notes. Written by Victoria Kala Last updated June 11, 2017
Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...
More informationLinear Algebra. Rekha Santhanam. April 3, Johns Hopkins Univ. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, / 7
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
More informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
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 informationLecture 3 Eigenvalues and Eigenvectors
Lecture 3 Eigenvalues and Eigenvectors Eivind Eriksen BI Norwegian School of Management Department of Economics September 10, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 3 Eigenvalues and Eigenvectors
More information2 Eigenvectors and Eigenvalues in abstract spaces.
MA322 Sathaye Notes on Eigenvalues Spring 27 Introduction In these notes, we start with the definition of eigenvectors in abstract vector spaces and follow with the more common definition of eigenvectors
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 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 informationLinear Algebra 2 Spectral Notes
Linear Algebra 2 Spectral Notes In what follows, V is an inner product vector space over F, where F = R or C. We will use results seen so far; in particular that every linear operator T L(V ) has a complex
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 informationMATRICES ARE SIMILAR TO TRIANGULAR MATRICES
MATRICES ARE SIMILAR TO TRIANGULAR MATRICES 1 Complex matrices Recall that the complex numbers are given by a + ib where a and b are real and i is the imaginary unity, ie, i 2 = 1 In what we describe below,
More informationLinear Algebra. Christos Michalopoulos. September 24, NTU, Department of Economics
Linear Algebra Christos Michalopoulos NTU, Department of Economics September 24, 2011 Christos Michalopoulos Linear Algebra September 24, 2011 1 / 93 Linear Equations Denition A linear equation in n-variables
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 informationLinear Algebra Highlights
Linear Algebra Highlights Chapter 1 A linear equation in n variables is of the form a 1 x 1 + a 2 x 2 + + a n x n. We can have m equations in n variables, a system of linear equations, which we want to
More informationRemarks on Definitions
Remarks on Definitions 1. Bad Definitions Definitions are the foundation of mathematics. Linear algebra bulges with definitions and one of the biggest challenge for students is to master them. It is difficult.
More informationFinal Review Written by Victoria Kala SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015
Final Review Written by Victoria Kala vtkala@mathucsbedu SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015 Summary This review contains notes on sections 44 47, 51 53, 61, 62, 65 For your final,
More informationLinear Algebra- Final Exam Review
Linear Algebra- Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.
More informationGeneralized eigenspaces
Generalized eigenspaces November 30, 2012 Contents 1 Introduction 1 2 Polynomials 2 3 Calculating the characteristic polynomial 5 4 Projections 7 5 Generalized eigenvalues 10 6 Eigenpolynomials 15 1 Introduction
More information1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)
1 A linear system of equations of the form Sections 75, 78 & 81 a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2 a m1 x 1 + a m2 x 2 + + a mn x n = b m can be written in matrix
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 informationHomework sheet 4: EIGENVALUES AND EIGENVECTORS. DIAGONALIZATION (with solutions) Year ? Why or why not? 6 9
Bachelor in Statistics and Business Universidad Carlos III de Madrid Mathematical Methods II María Barbero Liñán Homework sheet 4: EIGENVALUES AND EIGENVECTORS DIAGONALIZATION (with solutions) Year - Is
More informationPROBLEM SET. Problems on Eigenvalues and Diagonalization. Math 3351, Fall Oct. 20, 2010 ANSWERS
PROBLEM SET Problems on Eigenvalues and Diagonalization Math 335, Fall 2 Oct. 2, 2 ANSWERS i Problem. In each part, find the characteristic polynomial of the matrix and the eigenvalues of the matrix by
More informationMATH 304 Linear Algebra Lecture 34: Review for Test 2.
MATH 304 Linear Algebra Lecture 34: Review for Test 2. Topics for Test 2 Linear transformations (Leon 4.1 4.3) Matrix transformations Matrix of a linear mapping Similar matrices Orthogonality (Leon 5.1
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 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 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 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 informationLinear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.
Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationDiagonalisierung. Eigenwerte, Eigenvektoren, Mathematische Methoden der Physik I. Vorlesungsnotizen zu
Eigenwerte, Eigenvektoren, Diagonalisierung Vorlesungsnotizen zu Mathematische Methoden der Physik I J. Mark Heinzle Gravitational Physics, Faculty of Physics University of Vienna Version /6/29 2 version
More informationLecture 11: Eigenvalues and Eigenvectors
Lecture : Eigenvalues and Eigenvectors De nition.. Let A be a square matrix (or linear transformation). A number λ is called an eigenvalue of A if there exists a non-zero vector u such that A u λ u. ()
More informationAnnouncements Wednesday, November 7
Announcements Wednesday, November 7 The third midterm is on Friday, November 6 That is one week from this Friday The exam covers 45, 5, 52 53, 6, 62, 64, 65 (through today s material) WeBWorK 6, 62 are
More informationEigenvalues and Eigenvectors
LECTURE 3 Eigenvalues and Eigenvectors Definition 3.. Let A be an n n matrix. The eigenvalue-eigenvector problem for A is the problem of finding numbers λ and vectors v R 3 such that Av = λv. If λ, v are
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 information