Generalized Eigenvectors and Jordan Form
|
|
- Jasmin Barton
- 6 years ago
- Views:
Transcription
1 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 one eigenvalue with a geometric multiplicity (dimension of its eigenspace) which is strictly less than its algebraic multiplicity. In this handout, we will discuss how one can make up for this deficiency of eigenvectors by finding what are called generalized eigenvectors, which can in turn be used to find the Jordan form of the matrix A. First consider the following non-diagonalizable system. Example. The matrix A = [ ] 3 3 has characteristic polynomial (λ 3) ([ 2, so ]) it has only one eigenvalue λ = 3, and the corresponding eigenspace is E 3 = span. Since dim(e 3 ) = < 3, the matrix A is not diagonalizable. Nevertheless, it is still possible to solve the system dy = Ay without much difficulty. Writing out the two equations dy = 3y + y 2 dy 2 = 3y 2 we see that the second equation has general solution y 2 = c e 3t. Plugging this into the first equation gives dy = 3y + c e 3t This is a first order linear equation that can be solved by the method of integrating factors. Its solution is y = c te 3t + c 2 e 3t. Thus the general solution of the system is [ ] [ ] ( [ ] [ ]) [ ] y c te y = = 3t + c 2 e 3t c 2 e 3t = c e 3t t + + c 2 e 3t y 2 The matrix A in the previous example is said to be in Jordan form. Definition. A 2 2 matrix of the form J = [ ] λ λ for some number λ is called a Jordan form matrix.
2 The following theorem generalizes the calculations of the previous example. Theorem. The general solution of the system dy = Jy, J = [ ] λ λ is y = c e λt (t [ ] + [ ]) [ ] + c 2 e λt In general, suppose A is a 2 2 matrix with a single repeated eigenvalue λ with dim(e λ ) =. Then, as we have seen before, making the change of variables y = Cx transforms the system dy = Ay into the system dx = C ACx. We now want to find a matrix C such that the coefficient matrix C AC for the new system is a Jordan form matrix J. That is, we want AC = CJ. Writing we have Therefore the columns of C must satisfy C = v v 2, J = [ ] λ, λ AC = Av Av 2, CJ = λv λv 2 + v Av = λv Av 2 = λv 2 + v Thus the vector v is an eigenvector with eigenvalue λ. Rewriting these equations (A λi)v = (A λi)v 2 = v it follows that (A λi) 2 v 2 = (A λi)v =. Thus the vector v 2 must be in ker(a λi) 2. 2
3 Definition 2. A nonzero vector v which satisfies (A λi) p v = for some positive integer p is called a generalized eigenvector of A with eigenvalue λ. The vectors v and v 2 form a generalized eigenvector chain, as the following diagram illustrates: v 2 v A λi A λi Therefore, to find the columns of the matrix C that puts A in Jordan form, we must find a chain of generalized eigenvectors, as follows: Find a nonzero vector v 2 in ker(a λi) 2 that is not in ker(a λi). Set v = (A λi)v 2. Having found such vectors, we can then write down the solution of the system dy From above, we know that the solution of the system dx = Jx is [ ] [ ]) [ ] x = c e (t λt + + c 2 e λt so multiplying this by C we get In summary, we have the following result. y = Cx = c e λt (tv + v 2 ) + c 2 e λt v. = Ay. Theorem 2. Let A be a 2 2 matrix and suppose v 2 v is a chain of generalized eigenvectors of A with eigenvalue λ. Then the general solution of the system dy = Ay is y(t) = c e λt (tv + v 2 ) + c 2 e λt v. Example 2. Let A = [ 2 ] 4 The characteristic polynomial of A is λ 2 6λ + 9 = (λ 3) 2, so λ = 3 is the only eigenvalue of A. Next, we compute [ ] [ ] A 3I =, (A 3I) 2 = Now we choose[ v] 2 to be any vector in ker(a 3I) 2 that is not in ker(a [ ] 3I). One such vector is v 2 =. With this choice, we than have v = (A 3I)v 2 =. The solution of the system dy = Ay is therefore [ ] [ ]) [ ] y = c e (t 3t + + c 2 e 3t. 3
4 For larger systems it turns out that any chain of generalized eigenvectors of the coefficient matrix can be used to write down a linearly independent set of solutions. Theorem 3. Suppose {v, v 2,..., v k } is a chain of generalized eigenvectors of A with eigenvalue λ. That is, v k v k v k 2 v 2 v. A λi A λi A λi A λi A λi A λi Then y (t) = e λt v y 2 (t) = e λt (v 2 + tv ) [ ] y 3 (t) = e λt v 3 + tv 2 + t2 2! v. [ ] y k (t) = e λt v k + tv k + t2 2! v k tk 2 (k 2)! v 2 + tk (k )! v is a linearly independent set of solutions of dy = Ay. Proof. We show that y k is a solution. The proof that the others are solutions is similar. Differentiating gives dy k = e λt [ (λv k + v k ) + t(λv k + v k 2 ) + t2 + tk 2 (k 2)! (λv 2 + v ) + tk (k )! (λv ) 2! (λv k 2 + v k 3 ) + ]. Multiplying by A gives [ ] Ay k = e λt (Av k ) + t(av k ) + t2 2! (Av k 2) + + tk 2 (k 2)! (Av 2) + tk (k )! (Av ). The two expressions above are equal, since Av = λv, Av 2 = λv 2 + v, and so on. Next we show that the chain {v, v 2,..., v k } is necessarily linearly independent. Suppose c v + c 2 v c k v k =. () The multiplying by (A λi) k sends v through v k to zero, and v k to v, so we are left with c k v =. Since v is nonzero, this implies c k =. Similar reasoning shows that the remaining coefficients must also be zero. Thus the chain of generalized eigenvectors is linearly independent. Now suppose c y (t) + c 2 y 2 (t) + + c n y n (t) = for all t. Then since y j () = v j, at t = this equation is precisely equation () above, which we just showed implies c = c 2 = = c k =. 4
5 The next theorem guarantees that we can always find enough solutions of this form to generate a fundamental set of solutions. Theorem 4. Let A be an n n matrix, and suppose λ is an eigenvalue of A with algebraic multiplicity m. Then there is some integer p m such that dim(ker(a λi) p ) = m. Example 3. Let 5 4 A = The characteristic polynomial of A is p A (λ) = (λ 2) 3. Since 3 4 A 2I = 4 5, rref 3 4 the eigenspace E 2 = ker(a 2I) has dimension. Next, since (A 2I) 2 =, rref the space ker(a 2I) 2 has dimension 2. Finally, since (A 2I) 3 =, the space ker(a 2I) 3 has dimension 3, which matches the algebraic multiplicity of the eigenvalue λ = 2. We can now form a chain of 3 generalized eigenvectors by choosing a vector v 3 in ker(a 2I) 3 and defining v 2 = (A 2I)v 3 and v = (A 2I)v 2 = (A 2I) 2 v 3. To ensure that v 2 and v are both non-zero, we need v 3 to not be in ker(a 2I) 2 (which in turn implies that v 3 is not in ker(a 2I)). Since ker(a 2I) 3 = R 3, we can choose v 3 to be any vector not in ker(a 2I) 2. Since the first column of (A 2I) 2 is non-zero, we may choose 3 v 3 = = v 2 = (A 2I)v 3 = 4 = v = (A 2I)v 2 =. 3 5
6 Then y (t) = e 2t 3 y 2 (t) = e 2t t y 3 (t) = e 2t t2 + t 4 + 2! 3 is a fundamental set of solutions of dy = Ay. There may in general be more than one chain of generalized eigenvectors corresponding to a given eigenvalue. Since the last vector in each chain is an eigenvector, the number of chains corresponding to an eigenvalue λ is equal to the dimension of the eigenspace E λ. Example 4. Let 4 A = The characteristic polynomial of A is p A (λ) = (λ 3) 3. Since A 3I = 2 2 2, rref the eigenspace E 3 = ker(a 3I) has dimension 2, so there will be two chains. Next, since (A 3I) 2 =, the space ker(a 3I) 2 has dimension 3, which matches the algebraic multiplicity of λ = 3. Thus one of the chains will have length 2, so the other must have length. We now form a chain of 2 generalized eigenvectors by choosing v 2 in ker(a 3I) 2 such that v 2 is not in ker(a 3I). Since every vector is in ker(a 3I) 2 and the first column of A 3I is non-zero,we may again choose v 2 = = v = (A 3I)v 2 = To form a basis for R 3, we now need one additional chain of one generalized eigenvector. This vector must be an eigenvector independent from v. Since E 3 = span,, 6 2
7 and neither of these spanning vectors is itself a scalar multiple of v, we may choose either one of them. So let w = Then we have the two chains v 2 v w. The first chain generates the two solutions y (t) = e 3t 2 y 2 (t) = e 3t t 2 + and the second chain generates a third solution y 3 (t) = e 3t and together y, y 2 and y 3 form a fundamental set of solutions of dy = Ay. Example 5. Let A = The characteristic polynomial of A is (λ 5) 4. Since 3 2 A 5I = 3 rref 3, the eigenspace E 5 = ker(a 5I) has dimension 2, and there are two chains. Since (A 5I) 2 = the dimension of the space ker(a 5I) 2 is 4, matching the algebraic multiplicity of λ = 5. 7
8 To form a chain of length 2, we first choose a vector v 2 in ker(a 5I) 2 which is not in ker(a 5I). Let v 2 = = v = (A 5I)v 2 =. We now need one more chain of length 2. To find a second chain, we need to choose another vector w 2 in ker(a 5I) 2 which is not in ker(a 5I), in such a way that w 2 is independent of v 2 and w = (A 5I)w 2 is independent of v. One such choice is w 2 = = w = (A 5I)w 2 = 2 3. Thus y (t) = e 5t y 2 (t) = e 5t t + y 3 (t) = e 5t 2 3 y 4 (t) = e 5t t is a fundamental set of solutions of dy = Ay. Jordan Form for n n Matrices Definition 3. A matrix of the form λ λ λ consisting of λ in each entry along the main diagonal, in each entry directly above the main diagonal, and elsewhere, is called an elementary Jordan block. A matrix of the form J J 2... J k 8
9 where each J i is an elementary Jordan block (with possibly different values of λ) is called a Jordan form matrix. Example 6. The following are examples of Jordan form matrices: , 2, 3, Theorem 5. For any n n matrix A, there is a matrix C and a Jordan form matrix J such that C AC = J. The Jordan matrix J is determined by the number and length of the generalized eigenvector chains for A. Example 7. Let A be the matrix in Example 3. Since Av = 2v Av 2 = v + 2v 2 Av 2 = v 2 + 2v 3, letting implies C = v v 2 v 3 2 AC = 2v v + 2v 2 v 2 + 2v 3 = v v 2 v 3 2 = CJ, 2 so C AC = J consists of a single elementary Jordan block. Example 8. Let A be the matrix in Example 4. Since Av = 3v Av 2 = v + 3v 2 Aw = 3w, letting implies C = v v 2 w 3 AC = 3v v + 3v 2 w = v v 2 w 3 = CJ, 3 so C AC = J consists of 2 elementary Jordan blocks, one 2 2 and one. 9
Remark 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 240 Calculus III
Generalized Calculus III Summer 2015, Session II Thursday, July 23, 2015 Agenda 1. 2. 3. 4. Motivation Defective matrices cannot be diagonalized because they do not possess enough eigenvectors to make
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 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 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 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 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 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 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 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 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 informationDefinitions for Quizzes
Definitions for Quizzes Italicized text (or something close to it) will be given to you. Plain text is (an example of) what you should write as a definition. [Bracketed text will not be given, nor does
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 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 informationMATH 1553 PRACTICE MIDTERM 3 (VERSION B)
MATH 1553 PRACTICE MIDTERM 3 (VERSION B) Name Section 1 2 3 4 5 Total Please read all instructions carefully before beginning. Each problem is worth 10 points. The maximum score on this exam is 50 points.
More 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 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 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 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 informationSection 8.2 : Homogeneous Linear Systems
Section 8.2 : Homogeneous Linear Systems Review: Eigenvalues and Eigenvectors Let A be an n n matrix with constant real components a ij. An eigenvector of A is a nonzero n 1 column vector v such that Av
More informationMATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.
MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. Diagonalization Let L be a linear operator on a finite-dimensional vector space V. Then the following conditions are equivalent:
More 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 informationMath 2331 Linear Algebra
5. Eigenvectors & Eigenvalues Math 233 Linear Algebra 5. Eigenvectors & Eigenvalues Shang-Huan Chiu Department of Mathematics, University of Houston schiu@math.uh.edu math.uh.edu/ schiu/ Shang-Huan Chiu,
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 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 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 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 informationMAC Module 12 Eigenvalues and Eigenvectors. Learning Objectives. Upon completing this module, you should be able to:
MAC Module Eigenvalues and Eigenvectors Learning Objectives Upon completing this module, you should be able to: Solve the eigenvalue problem by finding the eigenvalues and the corresponding eigenvectors
More informationMAC Module 12 Eigenvalues and Eigenvectors
MAC 23 Module 2 Eigenvalues and Eigenvectors Learning Objectives Upon completing this module, you should be able to:. Solve the eigenvalue problem by finding the eigenvalues and the corresponding eigenvectors
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationDiagonalization of Matrices
LECTURE 4 Diagonalization of Matrices Recall that a diagonal matrix is a square n n matrix with non-zero entries only along the diagonal from the upper left to the lower right (the main diagonal) Diagonal
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 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 informationLinear Algebra - Part II
Linear Algebra - Part II Projection, Eigendecomposition, SVD (Adapted from Sargur Srihari s slides) Brief Review from Part 1 Symmetric Matrix: A = A T Orthogonal Matrix: A T A = AA T = I and A 1 = A T
More informationDefinition: An n x n matrix, "A", is said to be diagonalizable if there exists a nonsingular matrix "X" and a diagonal matrix "D" such that X 1 A X
DIGONLIZTION Definition: n n x n matrix, "", is said to be diagonalizable if there exists a nonsingular matrix "X" and a diagonal matrix "D" such that X X D. Theorem: n n x n matrix, "", is diagonalizable
More informationSystems of Linear Differential Equations Chapter 7
Systems of Linear Differential Equations Chapter 7 Doreen De Leon Department of Mathematics, California State University, Fresno June 22, 25 Motivating Examples: Applications of Systems of First Order
More informationLinear Algebra Practice Final
. Let (a) First, Linear Algebra Practice Final Summer 3 3 A = 5 3 3 rref([a ) = 5 so if we let x 5 = t, then x 4 = t, x 3 =, x = t, and x = t, so that t t x = t = t t whence ker A = span(,,,, ) and a basis
More informationEigenspaces and Diagonalizable Transformations
Chapter 2 Eigenspaces and Diagonalizable Transformations As we explored how heat states evolve under the action of a diffusion transformation E, we found that some heat states will only change in amplitude.
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 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 informationAnnouncements Monday, November 06
Announcements Monday, November 06 This week s quiz: covers Sections 5 and 52 Midterm 3, on November 7th (next Friday) Exam covers: Sections 3,32,5,52,53 and 55 Section 53 Diagonalization Motivation: Difference
More informationMATH 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 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 informationFinal Exam Practice Problems Answers Math 24 Winter 2012
Final Exam Practice Problems Answers Math 4 Winter 0 () The Jordan product of two n n matrices is defined as A B = (AB + BA), where the products inside the parentheses are standard matrix product. Is the
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 250B Midterm III Information Fall 2018 SOLUTIONS TO PRACTICE PROBLEMS
Math 25B Midterm III Information Fall 28 SOLUTIONS TO PRACTICE PROBLEMS Problem Determine whether the following matrix is diagonalizable or not If it is, find an invertible matrix S and a diagonal matrix
More informationAnnouncements Wednesday, November 7
Announcements Wednesday, November 7 The third midterm is on Friday, November 16 That is one week from this Friday The exam covers 45, 51, 52 53, 61, 62, 64, 65 (through today s material) WeBWorK 61, 62
More 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 informationSolutions to Final Exam
Solutions to Final Exam. Let A be a 3 5 matrix. Let b be a nonzero 5-vector. Assume that the nullity of A is. (a) What is the rank of A? 3 (b) Are the rows of A linearly independent? (c) Are the columns
More 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 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 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 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 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, 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 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 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 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 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 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 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 informationSpectral radius, symmetric and positive matrices
Spectral radius, symmetric and positive matrices Zdeněk Dvořák April 28, 2016 1 Spectral radius Definition 1. The spectral radius of a square matrix A is ρ(a) = max{ λ : λ is an eigenvalue of A}. For an
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 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 informationEigenvalues and Eigenvectors
November 3, 2016 1 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
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 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 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 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 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 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 informationAfter we have found an eigenvalue λ of an n n matrix A, we have to find the vectors v in R n such that
7.3 FINDING THE EIGENVECTORS OF A MATRIX After we have found an eigenvalue λ of an n n matrix A, we have to find the vectors v in R n such that A v = λ v or (λi n A) v = 0 In other words, we have to find
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
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 informationJordan Normal Form and Singular Decomposition
University of Debrecen Diagonalization and eigenvalues Diagonalization We have seen that if A is an n n square matrix, then A is diagonalizable if and only if for all λ eigenvalues of A we have dim(u λ
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 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 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 informationAnnouncements Monday, October 29
Announcements Monday, October 29 WeBWorK on determinents due on Wednesday at :59pm. The quiz on Friday covers 5., 5.2, 5.3. My office is Skiles 244 and Rabinoffice hours are: Mondays, 2 pm; Wednesdays,
More informationEigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization
Eigenvalues for Triangular Matrices ENGI 78: Linear Algebra Review Finding Eigenvalues and Diagonalization Adapted from Notes Developed by Martin Scharlemann The eigenvalues for a triangular matrix are
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 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 informationMAT1302F Mathematical Methods II Lecture 19
MAT302F Mathematical Methods II Lecture 9 Aaron Christie 2 April 205 Eigenvectors, Eigenvalues, and Diagonalization Now that the basic theory of eigenvalues and eigenvectors is in place most importantly
More information33A Linear Algebra and Applications: Practice Final Exam - Solutions
33A Linear Algebra and Applications: Practice Final Eam - Solutions Question Consider a plane V in R 3 with a basis given by v = and v =. Suppose, y are both in V. (a) [3 points] If [ ] B =, find. (b)
More informationMATH 115A: SAMPLE FINAL SOLUTIONS
MATH A: SAMPLE FINAL SOLUTIONS JOE HUGHES. Let V be the set of all functions f : R R such that f( x) = f(x) for all x R. Show that V is a vector space over R under the usual addition and scalar multiplication
More informationEXAM. Exam #3. Math 2360, Spring April 24, 2001 ANSWERS
EXAM Exam #3 Math 2360, Spring 200 April 24, 200 ANSWERS i 40 pts Problem In this problem, we will work in the vectorspace P 3 = { ax 2 + bx + c a, b, c R }, the space of polynomials of degree less than
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 informationEigenvalue and Eigenvector Homework
Eigenvalue and Eigenvector Homework Olena Bormashenko November 4, 2 For each of the matrices A below, do the following:. Find the characteristic polynomial of A, and use it to find all the eigenvalues
More informationModeling and Simulation with ODE for MSE
Zentrum Mathematik Technische Universität München Prof. Dr. Massimo Fornasier WS 6/7 Dr. Markus Hansen Sheet 7 Modeling and Simulation with ODE for MSE The exercises can be handed in until Wed, 4..6,.
More informationChapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form
Chapter 5. Linear Algebra A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are real numbers. 1
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 informationAgenda: Understand the action of A by seeing how it acts on eigenvectors.
Eigenvalues and Eigenvectors If Av=λv with v nonzero, then λ is called an eigenvalue of A and v is called an eigenvector of A corresponding to eigenvalue λ. Agenda: Understand the action of A by seeing
More informationMatrices related to linear transformations
Math 4326 Fall 207 Matrices related to linear transformations We have encountered several ways in which matrices relate to linear transformations. In this note, I summarize the important facts and formulas
More informationLecture 1: Review of linear algebra
Lecture 1: Review of linear algebra Linear functions and linearization Inverse matrix, least-squares and least-norm solutions Subspaces, basis, and dimension Change of basis and similarity transformations
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
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 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 informationc Igor Zelenko, Fall
c Igor Zelenko, Fall 2017 1 18: Repeated Eigenvalues: algebraic and geometric multiplicities of eigenvalues, generalized eigenvectors, and solution for systems of differential equation with repeated eigenvalues
More informationLINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS
LINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More information