Eigenvalues and Eigenvectors
|
|
- Fay Wilson
- 5 years ago
- Views:
Transcription
1 November 3, 2016
2 1
3 Definition () The (complex) number λ is called an eigenvalue of the n n matrix A provided there exists a nonzero (complex) vector v such that Av = λv, in which case the vector v is called an eigenvector of A.
4 Example Consider We have ( 2 A 1 ) = A = ( ( ) ( 2 1 ) = ). ( 4 2 ) ( 2 = 2 1 Thus λ = 2 is an eigenvalue of A and (2, 1) T is an eigenvector of A associated with the eigenvalue λ = 2. We also have ( ) ( ) ( ) ( ) A = = Thus λ = 1 is an eigenvalue of A and (3, 2) T is an eigenvector of A associated with the eigenvalue λ = 1. ).
5 Remarks 1 An eigenvalue may be zero but an eigenvector is by definition a nonzero vector. 2 If v 1 and v 2 are eigenvectors of A associated with eigenvalue λ, then for any scalars c 1 and c 2, c 1 v 1 + c 2 v 2 is also an eigenvector of A associated with eigenvalue λ if it is non-zero. 3 If λ is an eigenvalue of an n n matrix A, then the set of all eigenvectors associated with eigenvalue λ together with the zero vector 0 form a vector subspace of R n. It is called the eigenspace of A associated with eigenvalue λ.
6 Definition (Characteristic equation) Let A be an n n matrix. The polynomial equation det(a xi) = 0 of degree n is called the characteristic equation of A.
7 Theorem Let A be an n n matrix. The following statements for scalar λ are equivalent. 1 λ is an eigenvalue of A. 2 The equation (A λi)v = 0 has nontrivial solution for v. 3 Null(A λi) {0}. 4 The matrix A λi is singular. 5 λ is a root of the characteristic equation det(a xi) = 0
8 Example Find the eigenvalues and associated eigenvectors of the matrix ( ) 3 2 A =. 3 2 Solution: Solving the characteristic equation, we have det(a λi) = 0 3 λ λ = 0 λ 2 λ 12 = 0 λ = 4, 3
9 When λ = 4, (A 4I)v = 0 ( ) 1 2 v = Thus v = (2, 1) T is an eigenvector associated with λ = 4. When λ = 3, (A + 3I)v = 0 ( ) 6 2 v = Thus v = (1, 3) T is an eigenvector associated with λ = 3.
10 Example Find the eigenvalues and associated eigenvectors of the matrix ( ) 0 8 A =. 2 0 Solution: Solving the characteristic equation, we have λ 8 2 λ = 0 λ = 0 λ = ±4i
11 When λ = 4i, (A 4iI)v = 0 ( ) 4i 8 v = 0 2 4i Thus v = (2, i) T is an eigenvector associated with λ = 4i. When λ = 4i, (A + 4iI)v = 0 ( ) 4i 8 v = 0 2 4i Thus v = (2, i) T is an eigenvector associated with λ = 4i.
12 Remark For any square matrix A with real entries, the characteristic polynomial of A has real coefficients. Thus if λ = ρ + µi, where ρ, µ R, is a complex eigenvalue of A, then λ = ρ µi is also an eigenvalue of A. Furthermore, if v = a + bi is an eigenvector associated with complex eigenvalue λ, then v = a bi is an eigenvector associated with eigenvalue λ.
13 Example Find the eigenvalues and associated eigenvectors of the matrix A = Solution: Solving the characteristic equation, we have 2 λ λ = 0 (λ 2) 2 = 0 λ = 2, 2 ( ). When λ = 2, ( ) v = 0 Thus v = (1, 0) T is an eigenvector associated with λ = 2. In this example, we call only find one linearly independent eigenvector.
14 Example Find the eigenvalues and associated eigenvectors of the matrix A = Solution: Solving the characteristic equation, we have 2 λ λ 1 = λ λ(λ 1) 2 = 0 λ = 1, 1, 0
15 For λ 1 = λ 2 = 1, v = 0 Thus v 1 = (3, 1, 0) T and v 2 = ( 1, 0, 1) are two linearly independent eigenvectors associated with λ = 1. For λ 3 = 0, v = Thus v 3 = (1, 1, 1) T is an eigenvector associated with λ = 0.
16 Example Find the eigenvalues and associated eigenvectors of the matrix A = Solution: Solving the characteristic equation, we have 1 λ λ 0 = λ (λ 2)(λ 1) 2 = 0 λ = 2, 1, 1
17 For λ 1 = 2, v = 0 Thus v = (0, 0, 1) T is an eigenvector associated with λ = 2. For λ 2 = λ 3 = 1, v = Thus ( 1, 2, 1) T is an eigenvectors associated with λ = 1. Note that here λ = 1 is a double root but we can only find one linearly independent eigenvector associated with λ = 1.
18 Definition (Similar matrices) Two n n matrices A and B are said to be similar if there exists an invertible matrix P such that Proposition B = P 1 AP. Similarity of square matrices is an equivalence relation, that is, 1 For any square matrix A, we have A is similar to A; 2 If A is similar to B, then B is similar to A; 3 If A is similar to B and B is similar to C, then A is similar to C.
19 Proof. 1 Since I is a non-singular matrix and A = I 1 AI, we have A is similar to A. 2 If A is similar to B, then there exists non-singular matrix P such that B = P 1 AP. Now P 1 is a non-singular matrix and (P 1 ) 1 = P. There exists non-singular matrix P 1 such that (P 1 ) 1 BP 1 = PBP 1 = A. Therefore B is similar to A. 3 If A is similar to B and B is similar to C, then there exists non-singular matrices P and Q such that B = P 1 AP and C = Q 1 BQ. Now PQ is a non-singular matrix and (PQ) 1 = Q 1 P 1. There exists non-singular matrix PQ such that (PQ) 1 A(PQ) = Q 1 (P 1 AP)Q = Q 1 BQ = C. Therefore A is similar to C.
20 Proposition 1 The only matrix similar to the zero matrix 0 is the zero matrix. 2 The only matrix similar to the identity matrix I is the identity matrix. 3 If A is similar to B, then aa is similar to ab for any real number a. 4 If A is similar to B, then A k is similar to B k for any non-negative integer k. 5 If A and B are similar non-singular matrices, then A 1 is similar to B 1. 6 If A is similar to B, then A T is similar to B T. 7 If A is similar to B, then det(a) = det(b). 8 If A is similar to B, then tr(a) = tr(b) where tr(a) = a 11 + a a nn is the trace, i.e., the sum of the entries in the diagonal, of A. 9 If A is similar to B, then A and B have the same characteristic equation.
21 Proof. (1) Suppose A is similar to 0, then there exists non-singular matrix P such that 0 = P 1 AP. Hence A = P0P 1 = 0. (4) If A is similar to B, then there exists non-singular matrix P such that B = P 1 AP. We have B k = k copies {}}{ (P 1 AP)(P 1 AP) (P 1 AP) = P 1 A(PP 1 )AP P 1 A(PP 1 )AP = P 1 AIAI IAIAP = P 1 A k P Therefore A k is similar to B k.
22 Proof. (7) If A is similar to B, then there exists non-singular matrix P such that B = P 1 AP. Thus det(b) = det(p 1 AP) = det(p 1 ) det(a) det(p) = det(a) since det(p 1 ) = det(p) 1. (8) If A is similar to B, then there exists non-singular matrix P such that B = P 1 AP. Thus tr(b) = tr((p 1 A)P) = tr(p(p 1 A)) = tr(a). (Note: It is well-known that tr(pq) = tr(qp) for any square matrices P and Q. But in general, it is not always true that tr(pqr) = tr(qpr).)
23 Definition An n n matrix A is said to be diagonalizable if there exists a nonsingular (may be complex) matrix P such that P 1 AP = D is a diagonal matrix. We say that P diagonalizes A. In other words, A is diagonalizable if it is similar to a diagonal matrix.
24 Theorem Let A be an n n matrix. Then A is diagonalizable if and only if A has n linearly independent eigenvectors. Proof. Let P be an n n matrix and write P = [ v 1 v 2 v n ]. where v 1, v 2,, v n are the column vectors of P. First observe that P is nonsingular if and only if v 1, v 2,, v n are linearly independent.
25 Furthermore λ P 1 0 λ 2 0 AP = D =. is a diagonal matrix λ n λ λ 2 0 AP = PD for some diagonal matrix D = λ n A [ ] [ ] v 1 v 2 v n = λ1v 1 λ 2v 2 λ nv n. [ ] [ ] Av 1 Av 2 Av n = λ1v 1 λ 2v 2 λ nv n. v k is an eigenvector of A associated with eigenvalue λ k for k = 1, 2,, n. Therefore P diagonalizes A if and only if v 1, v 2,, v n are linearly independent eigenvectors of A.
26 Example Diagonalize the matrix A = ( ). Solution: We have seen in Example 8 that A has eigenvalues λ 1 = 4 and λ 2 = 3 associated with linearly independent eigenvectors v 1 = (2, 1) T and v 2 = (1, 3) T respectively. Thus the matrix ( ) 2 1 P = 1 3 diagonalizes A and P 1 AP = = ( ) 1 ( ( ) ) ( )
27 Example Diagonalize the matrix A = ( ). Solution: We have seen in Example 10 that A has eigenvalues λ 1 = 4i and λ 2 = 4i associated with linearly independent eigenvectors v 1 = (2, i) T and v 2 = (2, i) T respectively. Thus the matrix ( ) 2 2 P = i i diagonalizes A and P 1 AP = ( 4i 0 0 4i ).
28 Example We have seen in Example 14 that ( ) 2 3 A = 0 2 has only one linearly independent eigenvector. Therefore it is not diagonalizable.
29 Example Diagonalize the matrix A = Solution: We have seen in Example 10 that A has eigenvalues λ 1 = λ 2 = 1 and λ 3 = 0. For λ 1 = λ 2 = 1, there are two linearly independent eigenvectors v 1 = (3, 1, 0) T and v 2 = ( 1, 0, 1) T. For λ 3 = 0, there associated one linearly independent eigenvector v 3 = (1, 1, 1) T. The three vectors v 1, v 2, v 3 are linearly independent eigenvectors. Thus the matrix diagonalizes A and P = P 1 AP =
30 Example Show that the matrix A = ( ) is not diagonalizable. Solution: One can show that there is at most one linearly independent eigenvector. Alternatively, one can argue in the following way. The characteristic equation of A is (r 1) 2 = 0. Thus λ = 1 is the only eigenvalue of A. Hence if A is diagonalizable by P, then P 1 AP = I. But then A = PIP 1 = I which leads to a contradiction.
31 Theorem Suppose that eigenvectors v 1, v 2,, v k are associated with the distinct eigenvalues λ 1, λ 2,, λ k of a matrix A. Then v 1, v 2,, v k are linearly independent. Proof. We prove the theorem by induction on k. The theorem is obviously true when k = 1. Now assume that the theorem is true for any set of k 1 eigenvectors. Suppose c 1 v 1 + c 2 v c k v k = 0. Multiplying A λ k I to the left on both sides, we have c 1 (A λ k I)v 1 + c 2 (A λ k I)v c k 1 (A λ k I)v k 1 + c k (A λ k I)v k = 0 c 1 (λ 1 λ k )v 1 + c 2 (λ 2 λ k )v c k 1 (λ k 1 λ k )v k 1 = 0
32 Note that (A λ k I)v k = 0 since v k is an eigenvector associated with λ k. From the induction hypothesis, v 1, v 2,, v k 1 are linearly independent. Thus c 1 (λ 1 λ k ) = c 2 (λ 2 λ k ) = = c k 1 (λ k 1 λ k ) = 0. Since λ 1, λ 2,, λ k are distinct, λ 1 λ k, λ 2 λ k,, λ k 1 λ k are all nonzero. Hence c 1 = c 2 = = c k 1 = 0. It follows then that c k is also equal to zero because v k is a nonzero vector. Therefore v 1, v 2,, v k are linearly independent.
33 Theorem If the n n matrix A has n distinct eigenvalues, then it is diagonalizable. Theorem Let A be an n n matrix and λ 1, λ 2,, λ k be the roots of the characteristic equation of A of multiplicity n 1, n 2,, n k respectively, i.e., the characteristic equation of A is (x λ 1 ) n 1 (x λ 2 ) n2 (x λ n ) n k = 0. Then A is diagonalizable if and only if for each 1 i k, there exists n i linearly independent eigenvectors associated with eigenvalue λ i.
34 Remark Let A be a square matrix. A (complex) number λ is an eigenvalue of A if and only if λ is a root of the characteristic equation of A. The multiplicity of λ being a root of the characteristic equation is called the algebraic multiplicity of λ. The dimension of the eigenspace associated to eigenvalue λ, that is, the maximum number of linearly independent eigenvectors associated with eigenvalue λ, is called the geometric multiplicity of λ. It can be shown that for each eigenvalue λ, we have 1 m g m a where m g and m a are the geometric and algebraic multiplicity of λ respectively. Therefore we have A is diagonalizable if and only if the algebraic multiplicity and the geometric multiplicity are equal for all eigenvalues of A.
35 Theorem A square matrix is diagonlizable if and only if its minimal polynomial has no repeated factor. Theorem All eigenvalues of a symmetric matrix are real. Theorem Any symmetric matrix is diagonalizable (by orthogonal matrix).
36 Exercise Diagonalize the following matrices. ( ) ( ) (a) (b) (c) (d) Exercise Show that that following matrices arenot diagonalizable. ( ) (a) (b) (c)
37 Suggested answer ( ) ( ) (a) P =, D =, ( ) ( ) 1 + i 1 i 1 + i 0 (b) P =, D =, i (c) P = 1 2 3, D = 0 2 0, (d) P = , D =
38 Suggested answer 2(a) The characteristic equation of the matrix is (λ 2) 2 = 0. There is only one eigenvalue λ = 2. For eigenvalue λ = 2, the eigenspace is span((1, 1) T ) which is of dimension 1. Therefore the matrix is not diagonalizable. 2(b) There are two eigenvalues 2 and 1. The algebraic multiplicity of eigenvalue λ = 1 is 2 but the geometric multiplicity of it is 1. Therefore the matrix is not diagonalizable. 2(c) There are two eigenvalues 2 and 1. The algebraic multiplicity of eigenvalue λ = 2 is 2 but the geometric multiplicity of it is 1. Therefore the matrix is not diagonalizable.
39 Let A be an n n matrix and P be a matrix diagonalizes A, i.e., P 1 AP = D is a diagonal matrix. Then A k = ( PDP 1) k = PD k P 1
40 Example Find A 5 if A = ( ). Solution: From Example 26, ( ) P AP = D = where P = 0 3 Thus ( ). A 5 = PD 5 P 1 ( ) ( ) 5 ( ) = ( ) ( ) ( ) = ( ) =
41 Example Find A 5 if A = Solution: Diagonalizing A, we have P 1 AP = D = where P = Thus A 5 = = =
42 Example Consider a metropolitan area with a constant total population of 1 million individuals. This area consists of a city and its suburbs, and we want to analyze the changing urban and suburban populations. Let C k denote the city population and S k the suburban population after k years. Suppose that each year 15% of the people in the city move to the suburbs, whereas 10% of the people in the suburbs move to the city. Then it follows that C k+1 = 0.85C k + 0.1S k S k+1 = 0.15C k + 0.9S k Find the urban and suburban populations after a long time.
43 Solution: Let x k = (C k, S k ) T be the population vector after k years. Then x k = Ax k 1 = A 2 x k 2 = = A k x 0, where A = ( ). Solving the characteristic equation, we have 0.85 λ λ = 0 λ λ = 0 λ = 1, 0.75 Hence the eigenvalues are λ 1 = 1 and λ 2 = By solving A λi = 0, the associated eigenvectors are v 1 = (2, 3) T and v 2 = ( 1, 1) T respectively.
44 Thus where When k is very large P 1 AP = D = P = ( ( ). ), A k = PD k P 1 ( ) ( ) k ( ) = ( ) ( ) ( ) = k ( ) ( ) ( ) = 1 ( )
45 Therefore x k = A k x ( 0 ) ( C S 0 ( ) 0.4 = (C 0 + S 0 ) 0.6 ( ) 0.4 = 0.6 ) That mean whatever the initial distribution of population is, the long-term distribution consists of 40% in the city and 60% in the suburbs.
46 An n n matrix is called a stochastic matrix if it has nonnegative entries and the sum of the elements in each column is one. A Markov process is a stochastic process having the property that given the present state, future states are independent of the past states. A Markov process can be described by a Morkov chain which consists of a sequence of vectors x k, k = 0, 1, 2,, satisfying x k = Ax k 1 = Ax 0. The vector x k is called the state vector and A is called the transition matrix.
47 PageRank The PageRank algorithm was developed by Larry Page and Sergey Brin and is used to rank the web sites in the Google search engine. It is a probability distribution used to represent the likelihood that a person randomly clicking links will arrive at any particular page. The linkage of the web sites in the web can be represented by a linkage matrix A. The probability distribution of a person to arrive the web sites are given by A k x 0 for a sufficiently large k and is independent of the initial distribution x 0.
48 Example Consider a small web consisting of three pages P, Q and R, where page P links to the pages Q and R, page Q links to page R and page R links to page P and Q. Assume that a person has a probability of 0.5 to stay on each page and the probability of going to other pages are evenly distributed to the pages which are linked to it. Find the page rank of the three web pages. R P Q
49 Solution: Let p k, q k and r k be the number of people arrive the web pages P, Q and R respectively after k iteration. Then p k p k 1 q k = q k 1. r k r k 1 Thus where A = x k = Ax k 1 = = A k x 0, and x 0 = p 0 q 0 r 0 are the linkage matrix and the initial state.
50 Solving the characteristic equation of A, we have 0.5 λ λ λ = 0 λ 3 1.5λ λ = 0 λ = 1 or 0.25 For λ 1 = 1, we solve v = 0 and v 1 = (2, 3, 4) T is an eigenvector of A associated with λ 1 = 1. For λ 2 = λ 3 = 0.25, we solve v = 0 and there associates only one linearly independent eigenvector v 2 = (1, 0, 1) T.
51 Thus A is not diagonalizable. However we have P = where P 1 AP = J = (J is called the Jordan normal form of A.) When k is sufficiently large, we have A k = PJ k P k = /9 2/9 2/9 = 3/9 3/9 3/9 4/9 4/9 4/ /9 1/9 1/9 4/9 4/9 5/9 1/12 1/6 1/12. 1
52 Thus after sufficiently many iteration, the number of people arrive the web pages are given by 2/9 2/9 2/9 p 0 2/9 A k x 0 3/9 3/9 3/9 q 0 = (p 0 + q 0 + r 0 ) 3/9. 4/9 4/9 4/9 r 0 4/9 Note that the ratio does not depend on the initial state. The PageRank of the web pages P, Q and R are 2/9, 3/9 and 4/9 respectively.
53 Fibonacci sequence The Fibonacci sequence is defined by { F k+2 = F k+1 + F k, for k 0 F 0 = 0, F 1 = 1. The recursive equation can be written as ( ) ( ) ( ) Fk Fk+1 =. F k F k If we let then A = ( ) and x k = ( Fk+1 x k+1 = ( Ax k ), for k 0 1 x 0 =. 0 F k ),
54 It follows that x k = A k x 0. To find A k, we can diagonalize A and obtain ( Hence A k = = ( ) 1 ( ( ( ) ) k+1 ( ) k ( ( ) ( ) k ( ) k+1 ( ) k ( ) ( = ( 1+ 5 ) k ) k ( ) k 1 ( ) k ) k 1 ) ) 1
55 Now we have x k = A k x 0 = 1 5 ( F k = 1 5 ( ( ) k+1 ( ) k ( 1 + ) k ( ) k ) k ) k 5. 2, We also have F k+1 ((1 + 5)/2) k+1 ((1 5)/2) k+1 lim = lim k F k k ((1 + 5)/2) k ((1 = )/2) k 2 which links the Fibonacci sequence with the celebrated golden ratio.
56 One of the most notable and important theorems in linear algebra is the. Definition Let A be an n n matrix. The minimal polynomial of A is a nonzero polynomial m(x) of minimum degree with leading coefficient 1 satisfying m(a) = 0. Theorem () Let A be an n n matrix and p(x) = det(a xi) be its characteristic polynomial. Then p(a) = 0. In other words, the minimal polynomial of A always divides the characteristic polynomial of A.
57 Proof Let B = A xi and p(x) = det(b) = c nx n + c n 1x n c 1x + c 0 be the characteristic polynomial of A. Consider B = A xi as an n n matrix whose entries are polynomial in x. Write the adjoint adj(b) of B as a polynomial of degree n 1 in x with matrix coefficients adj(b) = B n 1x n B 1x + B 0 where the coefficients B i are n n constant matrices. On one hand, we have det(b)i = (c nx n + c n 1x n c 1x + c 0)I On the other hand, we have = (c ni)x n + (c n 1I)x n (c 1I)x + c 0I Badj(B) = (A xi)(b n 1x n B 1x + B 0) = B n 1x n + (AB n 1 B n 2)x n (AB 1 B 0)x + AB 0
58 Proof. Comparing the coefficients of we get det(b)i = Badj(B), c ni = B n 1 c n 1 I = AB n 1 B n 2. c 1 I = AB 1 B 0 c 0 I = AB 0 If we multiply the first equation by A n, second by A n 1,, the last by I and add up the resulting equations, we obtain p(a) = c na n + c n 1A n c 1A + c 0I = A n B n 1 + (A n B n 1 A n 1 B n 2) + + (A 2 B 1 AB 0) + AB 0 = 0
59 Example Let The characteristic equation is A = p(x) = x 3 + 7x 2 16x So A 3 + 7A 2 16A + 12I = 0.
60 Example Now We have A 2 = A 3 = 7A 2 16A + 12I = =
61 Example Multiplying by A gives A 4 = 7A 3 16A A = 7(7A 2 16A + 12) 16A A = 33A 2 100A + 84I = =
62 Example Thus we can use Cayley-Hamilton theorem to express power of A in terms of A and A 2. We can also use Cayley-Hamilton theorem to find A 1 as follow 12I = A 3 7A A A 1 = 1 12 (A2 7A + 16I) = =
63 Example Find the minimal polynomial of A = Solution: The characteristic polynomial of A is p(x) = x(x 1) 2. It can be proved that every root of the characteristic polynomial must also be a root of the minimal polynomial. Thus the minimal polynomial must be one of the following polynomials x(x 1) or x(x 1) 2. By direct calculation A(A I) = = 0. Hence the minimal polynomial of A is x(x 1).
64 Definition Let A be an n n matrix. The matrix exponential of A is defined as exp(a) = k=0 A k k!. Theorem (Properties of matrix exponential) Let A and B be two n n matrix and a, b be any scalars. Then 1 exp(0) = I; 2 exp( A) = exp(a) 1 ; 3 exp((a + b)a) = exp(aa) exp(ba); 4 If AB = BA, then exp(a + B) = exp(a) exp(b); 5 If A is nonsingular, then exp(a 1 BA) = A 1 exp(b)a; 6 det(exp(a)) = e tr(a). (tr(a) = a 11 + a a nn is the trace of A.)
65 Theorem If D = λ λ is a diagonal matrix, then λ n e λ e λ2 0 exp(d) = e λn Moreover, for any n n matrix A, if there exists nonsingular matrix P such that P 1 AP = D is a diagonal matrix. Then exp(a) = P exp(d)p 1.
66 Example Find exp(at) where A = ( Solution: Diagonalizing A, we have ( ) 1 ( ). ) ( ) = ( Therefore ( ) ( ) ( 1 2 e 2t exp(at) = e 5t 3 1 = 1 ( ) e 2t + 6e 5t 2e 2t + 2e 5t 7 3e 2t + 3e 5t 6e 2t + e 5t ). ) 1
67 Example Find exp(at) where A = Solution: First compute Therefore A 2 = and A 3 = exp(at) = I + At A2 t 2 = = t 3t + 2t t t t 2
68 Example Find exp(at) where A = ( Solution: ( ) 4t t exp(at) = exp 0 4t (( 4t 0 = exp 0 4t ( 4t 0 = exp 0 4t = = ( 4t 0 (since 0 4t ( e 4t 0 0 e 4t ( ) e 4t te 4t 0 e 4t ). ) ( 0 t ) exp ) ( I + )) ( ) 0 t 0 0 ) ( ) 0 t = 0 0 ( )) 0 t 0 0 ( 0 t 0 0 ) ( 4t 0 0 4t ) )
69 Example Find exp(at) where A = ( ). Solution: Solving the characteristic equation 5 λ λ = 0 (5 λ)(3 λ) + 1 = 0 λ 2 8λ + 16 = 0 (λ 4) 2 = 0 λ = 4, 4 we see that A has only one eigenvalue λ = 4.
70 det(a 4I)v = 0 ( ) 1 1 v = we can find only one linearly independent eigenvector v = (1, 1) T. Thus A is not diagonalizable. To find exp(at), we may take ( ) 1 1 T = 1 0 and let (J is called the Jordan normal form of A.) J = T 1 AT ( ) 1 ( ) ( ) = ( ) ( ) ( ) = ( ) 4 1 = 0 4
71 Consider det(a 4I)v = 0 ( ) 1 1 v = we can find only one linearly independent eigenvector v = (1, 1) T. Thus A is not diagonalizable. To find exp(at), we may use the so called generalized eigenvector. A vector v is called a generalized eigenvector of rank 2 associated with eigenvalue λ if it satisfies { (A λi)v 0, (A λi) 2 v = 0.
72 Now if we take v 0 = then ( 1 0 ), v 1 = (A 4I)v 0 = ( ) ( 1 0 ) = ( 1 1 ), ( ) ( ) ( ) (A 4I)v 0 = = 0, 1 1 ( 0 ) 1 ( ) (A 4I) 2 v 0 = (A 4I)v 1 = = So v 0 is a generalized eigenvector of rank 2 associated with eigenvalue λ = 4.
73 We may let and T = [v 1 v 0 ] = ( ), J = T 1 AT ( ) 1 ( ) ( ) = ( ) ( ) ( ) = ( ) 4 1 = 0 4 (J is called the Jordan normal form of A.)
74 Then exp(at) = exp(tjt 1 t) = T exp(jt)t 1 ( ) ( 1 1 e 4t te = 4t ) ( e 4t 1 1 ( e = 4t + te 4t te 4t ) te 4t e 4t te 4t ) (By above Example)
75 Exercise Find exp(at) for each of the following matrices A. ( ) ( )
76 Answer ( 1 1 3e 5t + 4e 2t 3e 5t 3e 2t 7 4e 5t 4e 2t 4e 5t + 3e 2t ( ) t t e 2t t 1 t t t 6t t e 3t te 3t 1 2 t2 e 3t 0 e 3t te 3t 0 0 e 3t )
Diagonalization. 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 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 informationTMA Calculus 3. Lecture 21, April 3. Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013
TMA4115 - Calculus 3 Lecture 21, April 3 Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013 www.ntnu.no TMA4115 - Calculus 3, Lecture 21 Review of last week s lecture Last week
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 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 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 informationa 11 a 12 a 11 a 12 a 13 a 21 a 22 a 23 . a 31 a 32 a 33 a 12 a 21 a 23 a 31 a = = = = 12
24 8 Matrices Determinant of 2 2 matrix Given a 2 2 matrix [ ] a a A = 2 a 2 a 22 the real number a a 22 a 2 a 2 is determinant and denoted by det(a) = a a 2 a 2 a 22 Example 8 Find determinant of 2 2
More informationMath 489AB Exercises for Chapter 2 Fall Section 2.3
Math 489AB Exercises for Chapter 2 Fall 2008 Section 2.3 2.3.3. Let A M n (R). Then the eigenvalues of A are the roots of the characteristic polynomial p A (t). Since A is real, p A (t) is a polynomial
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 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 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 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 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 informationICS 6N Computational Linear Algebra Eigenvalues and Eigenvectors
ICS 6N Computational Linear Algebra Eigenvalues and Eigenvectors Xiaohui Xie University of California, Irvine xhx@uci.edu Xiaohui Xie (UCI) ICS 6N 1 / 34 The powers of matrix Consider the following dynamic
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 informationTherefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.
Similar Matrices and Diagonalization Page 1 Theorem If A and B are n n matrices, which are similar, then they have the same characteristic equation and hence the same eigenvalues. Proof Let A and B be
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 informationSymmetric and anti symmetric matrices
Symmetric and anti symmetric matrices In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, matrix A is symmetric if. A = A Because equal matrices have equal
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 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 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 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 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 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 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 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 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 II Homework #1 solutions A = This means that every eigenvector with eigenvalue λ = 1 must have the form
Linear algebra II Homework # solutions. Find the eigenvalues and the eigenvectors of the matrix 4 6 A =. 5 Since tra = 9 and deta = = 8, the characteristic polynomial is f(λ) = λ (tra)λ+deta = λ 9λ+8 =
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 informationEigenvalues and Eigenvectors
CHAPTER Eigenvalues and Eigenvectors CHAPTER CONTENTS. Eigenvalues and Eigenvectors 9. Diagonalization. Complex Vector Spaces.4 Differential Equations 6. Dynamical Systems and Markov Chains INTRODUCTION
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 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 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 369 Linear Algebra
Assignment # Problem # A father and his two sons are together 00 years old. The father is twice as old as his older son and 30 years older than his younger son. How old is each person? Problem # 2 Determine
More informationUnit 5. Matrix diagonaliza1on
Unit 5. Matrix diagonaliza1on Linear Algebra and Op1miza1on Msc Bioinforma1cs for Health Sciences Eduardo Eyras Pompeu Fabra University 218-219 hlp://comprna.upf.edu/courses/master_mat/ We have seen before
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 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 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 informationUniversity of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm
University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm Name: The proctor will let you read the following conditions
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
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 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. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true?
. Let m and n be two natural numbers such that m > n. Which of the following is/are true? (i) A linear system of m equations in n variables is always consistent. (ii) A linear system of n equations in
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. 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 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 informationGlossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the
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 informationEigenvalues and Eigenvectors 7.2 Diagonalization
Eigenvalues and Eigenvectors 7.2 Diagonalization November 8 Goals Suppose A is square matrix of order n. Provide necessary and sufficient condition when there is an invertible matrix P such that P 1 AP
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 informationAMS10 HW7 Solutions. All credit is given for effort. (-5 pts for any missing sections) Problem 1 (20 pts) Consider the following matrix 2 A =
AMS1 HW Solutions All credit is given for effort. (- pts for any missing sections) Problem 1 ( pts) Consider the following matrix 1 1 9 a. Calculate the eigenvalues of A. Eigenvalues are 1 1.1, 9.81,.1
More informationSolutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015
Solutions to Final Practice Problems Written by Victoria Kala vtkala@math.ucsb.edu Last updated /5/05 Answers This page contains answers only. See the following pages for detailed solutions. (. (a x. See
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 informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
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 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 informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationChapter 3. Determinants and Eigenvalues
Chapter 3. Determinants and Eigenvalues 3.1. Determinants With each square matrix we can associate a real number called the determinant of the matrix. Determinants have important applications to the theory
More informationSUPPLEMENT TO CHAPTERS VII/VIII
SUPPLEMENT TO CHAPTERS VII/VIII The characteristic polynomial of an operator Let A M n,n (F ) be an n n-matrix Then the characteristic polynomial of A is defined by: C A (x) = det(xi A) where I denotes
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationMathematical Methods for Engineers 1 (AMS10/10A)
Mathematical Methods for Engineers 1 (AMS10/10A) Quiz 5 - Friday May 27th (2016) 2:00-3:10 PM AMS 10 AMS 10A Name: Student ID: Multiple Choice Questions (3 points each; only one correct answer per question)
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 informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
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 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 304 Fall 2018 Exam 3 Solutions 1. (18 Points, 3 Pts each part) Let A, B, C, D be square matrices of the same size such that
Math 304 Fall 2018 Exam 3 Solutions 1. (18 Points, 3 Pts each part) Let A, B, C, D be square matrices of the same size such that det(a) = 2, det(b) = 2, det(c) = 1, det(d) = 4. 2 (a) Compute det(ad)+det((b
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationEigenvalues and Eigenvectors
MATH 307 Eigenvalues and Eigenvectors Dr. Neal, WKU Let T : R n R n be a linear transformation with n n matrix representation A. A non-zero vector x R n is called an eigenvector of T if there exists a
More informationav 1 x 2 + 4y 2 + xy + 4z 2 = 16.
74 85 Eigenanalysis The subject of eigenanalysis seeks to find a coordinate system, in which the solution to an applied problem has a simple expression Therefore, eigenanalysis might be called the method
More informationvibrations, light transmission, tuning guitar, design buildings and bridges, washing machine, Partial differential problems, water flow,...
6 Eigenvalues Eigenvalues are a common part of our life: vibrations, light transmission, tuning guitar, design buildings and bridges, washing machine, Partial differential problems, water flow, The simplest
More informationApplication. Stochastic Matrices and PageRank
Application Stochastic Matrices and PageRank Stochastic Matrices Definition A square matrix A is stochastic if all of its entries are nonnegative, and the sum of the entries of each column is. We say A
More informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) Eigenvalues and Eigenvectors Fall 2015 1 / 14 Introduction We define eigenvalues and eigenvectors. We discuss how to
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 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 information(the matrix with b 1 and b 2 as columns). If x is a vector in R 2, then its coordinate vector [x] B relative to B satisfies the formula.
4 Diagonalization 4 Change of basis Let B (b,b ) be an ordered basis for R and let B b b (the matrix with b and b as columns) If x is a vector in R, then its coordinate vector x B relative to B satisfies
More informationOnline Exercises for Linear Algebra XM511
This document lists the online exercises for XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Lecture 02 ( 1.1) Online Exercises for Linear Algebra XM511 1) The matrix [3 2
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 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 informationContents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2
Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition
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 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 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 informationEE263: Introduction to Linear Dynamical Systems Review Session 5
EE263: Introduction to Linear Dynamical Systems Review Session 5 Outline eigenvalues and eigenvectors diagonalization matrix exponential EE263 RS5 1 Eigenvalues and eigenvectors we say that λ C is an eigenvalue
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 informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationc c c c c c c c c c a 3x3 matrix C= has a determinant determined by
Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.
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 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 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 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 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 informationLinear Algebra 1. M.T.Nair Department of Mathematics, IIT Madras. and in that case x is called an eigenvector of T corresponding to the eigenvalue λ.
Linear Algebra 1 M.T.Nair Department of Mathematics, IIT Madras 1 Eigenvalues and Eigenvectors 1.1 Definition and Examples Definition 1.1. Let V be a vector space (over a field F) and T : V V be a linear
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
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 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 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 informationExercise Sheet 1.
Exercise Sheet 1 You can download my lecture and exercise sheets at the address http://sami.hust.edu.vn/giang-vien/?name=huynt 1) Let A, B be sets. What does the statement "A is not a subset of B " mean?
More informationeigenvalues, markov matrices, and the power method
eigenvalues, markov matrices, and the power method Slides by Olson. Some taken loosely from Jeff Jauregui, Some from Semeraro L. Olson Department of Computer Science University of Illinois at Urbana-Champaign
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 information