(V.C) Complex eigenvalues and other topics
|
|
- Noah Richards
- 5 years ago
- Views:
Transcription
1 V.C Complex eigenvalues and other topics matrix Let s take a closer look at the characteristic polynomial for a 2 2 namely A = a c f A λ = detλi A = λ aλ d bc b d = λ 2 a + dλ + ad bc = λ 2 traλ + det A. More generally, for A M n F one can check by direct calculation that f A λ = λ n traλ n + P 2 Aλ n n det A =: n k=0 k P k Aλ n k where P A = tra, P n A = deta. The P k A so defined are are invariant polynomials of degree k in the entries of A : P k A = P k S AS, as one can see by comparing coefficients of like powers of λ in the end terms of k P k Aλ n k = detλi A = det{s λi AS} = det{λi S AS} = k P k S ASλ n k. If you didn t know tra = trs AS for all invertible S say, by not doing the exercises, now you do.,
2 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 2 In particular, if A is diagonalizable = SDS then P k A = P k SDS = P k D. Now by definition λ λ f D λ = det... = λ λ λ λ n λ λ n and so P k A = { = k P k Dλ n k, coefficient of λ n k in λ λ λ λ n } = λ i λ ik i <...<i k n =: k th elementary symmetric function in the {λ i }. We caution that these are not formulas for the P k A any more than the special cases deta = P n A = λ λ n, tra = P A = λ λ n are formulas for determinant and trace. Decoupling linear PDEs. Frequently in physics and engineering one encounters systems of partial differential equations like u u + a x + a 2 u 2 x = 0, u 2 u + a 2 x + a 22 u 2 x = 0 which are coupled in the sense that the equation for the change in u has a term involving u 2, and vice versa. We can decouple them by a linear change in coordinates. Assume a A = a 2 λ = 0 v v 2 v v 2 a 2 a 22 0 λ 2 = SDS
3 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 3 is diagonalizable, with eigenbasis B = { v, v 2 }, and rewrite the system in matrix form Let c c 2 and write u u + A u x = 0. = c := S u be the coordinates of u with respect to B, + SDS u x = 0 S u + DS u = 0. Since S is a matrix of constants, the differential operators commute with it. The last equation becomes c + D c x = 0 which corresponds to the two PDEs c c + λ x = 0, c 2 c + λ 2 2 x = 0. These are not coupled and may be solved separately to get the traveling waves c x, t = Φ I x λ t, c 2 x, t = Φ II x λ 2 t where Φ I, Φ II are any functions on the real line. To get more specific we must specify the initial conditions of the system. u x, 0 = gx and u 2 x, 0 = hx EXAMPLE. Let s solve the system with initial conditions u + u x + 4 u 2 x = 0, u 2 + u x + u 2 x = 0 u x, 0 = e x, u 2 x, 0 = cos x.
4 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 4 The first step is to diagonalize A = = = S D S. Then we solve for Φ I and Φ II : Φ I x c = x, 0 = S ux, 0 Φ II x c 2 x, 0 = 2 e x, 4 2 cos x i.e. Φ I x = 4 e x + 2 cos x, Φ IIx = 4 e x + 2 cos x ; and so since λ = 3, λ 2 = Φ cx, t = I x λ t 4 e x 3t + = 2 cosx 3t Φ II x λ 2 t 4 e x+t + 2 cosx + t. This is the solution in eigen-coordinates. In terms of the original variables u and u 2 we have u u 2 = ux, t = S cx, t e x 3t + = 2 cosx 3t 4 e x+t + 2 cosx + t 2 e x 3t + cosx 3t + = 2 e x+t cosx + t 4 e x 3t + 2 cosx 3t 4 e x+t + 2 cosx + t. If you are interested in applications of this sort of thing, look in any book on applied PDEs a beautiful subject in itself. Complex diagonalization of real matrices. Let A M n R. In this lecture A always has real entries. If the characteristic polynomial f A λ does not break completely into linear factors over R, then A does not have a complete set of eigenvalues in R. The algebraic
5 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 5 multiplicities d j of the real eigenvalues do not add to n. In this case f A λ = λ σ d λ σ r dr λ 2 + µ λ + ν c λ 2 + µ s λ + ν s c s }{{} irreducible quadratic factors: µ 2 k <4ν k where σ i, µ j, ν j are all real and d j + 2 c k = n. Over C this f A λ factors completely: if we set ξ k = µ k 2, η k = 4ν k µ 2 k since µ2 k < 4ν k by hypothesis, these will be real then 2 the quadratic formula shows λ 2 + µ k λ + ν k = {λ ξ k + iη k } {λ ξ k iη k }. Therefore each irreducible quadratic factor gives rise to a conjugate pair of complex eigenvalues, and the algebraic multiplicities of do add to n. σ,..., σ r ; ξ + iη, ξ iη,..., ξ s + iη s, ξ s iη s Since A is real, if A v = λ v for a real v = 0 then λ is also real. So if we take now v E ξk +iη k A a nonzero eigenvector, v cannot be real since η k = 0 by hypothesis. Therefore we write v = u + i w, where u and w are real and w = 0. We have taking the complex conjugate {ξ k + iη k I A} u + i w = 0 ; {ξ k iη k I A} u i w = 0 where A is unaffected because it is real. That is, v = u i w E ξk iη k A, and so to each conjugate pair of complex eigenvalues of A there is at least one conjugate pair of complex eigenvectors. In fact, i f A is diagonalizable over C, then there is an eigenbasis v,..., v m ; u + i w, u i w,..., u p + i w p, u p i w p
6 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 6 where all v i, u i, w i are real with respective eigenvalues λ,..., λ m ; ξ + iη, ξ iη,..., ξ p + iη p, ξ p iη p λ i, ξ i, η i R where m + 2p = n. Of course one can now write a matrix S with the vectors of the complex eigenbasis as its columns, and get A = SDS where D has the complex eigenvalues as its diagonal entries. Such a diagonalization is old news. The new, beautiful fact is that one can decompose A into real n n matrices A = MBM where M = B = v v m u w u p w p λ 0... λ m ξ η η ξ... ξ 0 p η p η p ξ p, i.e. B is almost diagonal. You can think of the 2 2 blocks along the diagonal as corresponding to the irreducible quadratic factors of f A λ. It will essentially become clear why this works from the following section. The situation for real 2 2 matrices. Let s start by diagonalizing real rotation-dilation matrices over C. The matrix a b A = M 2 R b a
7 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 7 has eigenvalues a ± bi. To obtain the eigenvectors look at bi b E a+bi A = ker{a + bii A} = ker b bi = ker i = span i and bi b E a bi A = ker{a bii A} = ker b bi = ker i = span. i Note that you could also just take the conjugate of i. Instead of S, write i N := ; i i to get N will mean this particular matrix for the remainder of the section. By the usual diagonalization procedure one gets a b = NDN a + bi 0 = i. b a i i 0 a bi 2 i From this we have immediately the useful relation a + bi 0 = N a b N = r N R θ N, 0 a bi b a where R θ is the counterclockwise rotation by θ = arctanb/a and r = b 2 + a 2 the dilation which commutes with everything. These are just the θ and r for which a + bi = re iθ.
8 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 8 More generally, let A = α α 2 α 2 α 22 M 2 R; then there are three possibilities for the roots of f A λ = λ 2 α + α 22 λ + α α 22 α 2 α 2 = λ 2 traλ + det A, based on its discriminant i.e., the quantity under the radical in the quadratic formula: i tra 2 > 4 det A: distinct real roots = A is diagonalizable over R; ii tra 2 = 4 det A: repeated real root =??? A may not be diagonalizable even over C; iii tra 2 < 4 det A: distinct conjugate complex roots = A diagonalizable over C but not over R f A λ is an irreducible quadratic. We are interested in case iii. Call the roots a + bi, a bi noting that b = 0, and let v = u + i w E a+bi A be a nonzero eigenvector in particular, w = 0 as before. Then u i w E a ib A since noting that A is real, so A = Ā A u + i w = a + bi u + i w conjugation A u i w = a bi u i w, and { u + i w, u i w} give an A -eigenbasis for C 2. Taking S = u + i w u i w They are independent because they have distinct eigenvalues; note also that their independence implies independence of u and w why?.
9 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 9 we have using the boxed relation above a + ib 0 A = S S = SN 0 a ib a b b a NS ; if we set M = SN = i u + i w u i w 2 i = { } { } u + i w i u + i w 2 + u i w i u i w = u w, then we have the decomposition A = M a b b a M = r MR θ M, M = u w completely over R!! This plays exactly the same role in solving linear dynamical systems /R when the eigenvalues are conjugate complex, as the decomposition A = SDS diagonalization did in the case of distinct real eigenvalues. EXAMPLE 2. Take A = 3 5, so that λ 3 5 f A λ = det = λ 2 2λ + 2 λ + has conjugate complex roots λ = ± i =: a ± ib, which is to say a = b =. Moreover 2 + i 5 E +i A = ker 2 + i
10 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 0 = ker 2 + i 2 + i = span, and so we have the eigenvector 2 + i 2 v = = + i =: u + i w ; 0 its conjugate u i w is the other one. Set 2 M = u w = 0 and note that M = 0 2 then according to our result above, we have the real decomposition a b A = M M 2 0 =. b a 0 2 One may conceptualize this in terms of transformations as follows: if T : R 2 R 2 is the transformation with matrix [T]ê = A relative to the standard basis {ê, ê 2 } of R 2, then in terms of B = { u, w} [T] B = So T is a sort of skew rotation-dilation. ; = 2 R π/4 =: r R θ. Real dynamical systems with complex eigenvalues. I. A discrete dynamical system. Let A remain the matrix of the above example. We will work out the solution to xτ + = A xτ abstractly and then substitute in the numerical information. let γτ = M xτ, γ 0 = M x 0
11 V.C COMPLEX EIGENVALUES AND OTHER TOPICS be the present analogue of the eigen-coordinates c = S x. These are the coordinates with respect to u and w : that is, x = γ u γ 2 w. Using our real decomposition of A because we want a real solution, xτ = A τ x 0 = rmr θ M τ x 0 = r τ MR θ τ M x 0 = r τ MR τθ M x 0. Multiplying both sides by M, this becomes M xt = r τ R τθ M x 0 or γt = r τ R τθ γ 0. Suppose we start at u, i.e take x 0 = u = 2. Then γ 0 = why? and γt = 2 τ R π 4 τ = 2 τ cos π 4 τ 0 sin π 4 τ, 0 or in ê -coordinates xτ = M γt = 2 τ { cos π 4 t u sinπ 4 τ w }. II. A continuous dynamical system. Again assuming A = the matrix from the example, let s investigate the continuous dynamical system d x dτ = A xτ. This turns out to be unexpectedly complicated; we will employ both sets of coordinates. Put γτ = M xτ, cτ = S xτ where M = u w, S = u + i w u i w.
12 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 2 First use the eigencoordinates c = to d x dτ = S d c dτ = a + bi 0 c c 2 0 a bi a + bi 0 0 a bi The solution to this is just e a+biτ 0 cτ = c 0 e a biτ 0 = e aτ i.e. or S xτ = e aτ to transform e ibτ 0 0 e ibτ S xτ ct. e ibτ 0 0 e ibτ S x 0 c 0, xτ = e aτ e ibτ 0 S 0 e ibτ S x 0 = e aτ cos bτ + i sin bτ 0 S S x 0 0 cos bτ i sin bτ = e aτ SN cos bτ sin bτ NS x 0 = e aτ MR bτ M x 0. sin bτ cos bτ In order to decouple and solve the differential equations we had to diagonalize, but that introduced complex numbers. To then get rid of them, we had to be more clever than in the last three types of dynamical systems discrete with real or complex λ, continuous with real λ. Now all we have to do is transform to { u, w} coordinates: M xτ = e aτ R bτ M x 0 γτ = e aτ R bτ γ 0.
13 V.C COMPLEX EIGENVALUES AND OTHER TOPICS 3 2 Again let x 0 = γ 0 = be the initial state, so that the 0 solution looks like γτ = e aτ cos bτ sin bτ = e aτ cos bτ sin bτ cos bτ 0 sin bτ or xτ = M γτ = e aτ u cos bτ w sin bτ = e aτ {cosbτ u sinbτ w} } = e {cosτ τ 2 sinτ. 0 This corresponds 2 to the picture w u=x 0 Although for this particular matrix there are not dramatic differences between the discrete and continuous systems as far as the qualitative phase diagram goes, note the distinctions in the dilations r τ = a 2 + b 2τ vs. e aτ 2 I make no claims to quantitative correctness here. The spiral probably unfolds at a different rate than what is drawn.
14 EXERCISES 4 and the rotations R τ arctanb/a vs. R t b. This leads to qualitative differences for certain values of a and b. Exercises a Show A = cannot be diagonalized over R. A 90 rotation in 3 space has only one real eigenvector the one it rotates around. b Now diagonalize it over C. 2 Decouple the linear system u + 8 v x = 0 v + 2 u x = 0 of PDEs and find the solution given initial conditions ux, 0 = sin x, vx, 0 = x 2. 3 Let T : R 2 R 2 be the transformation given in the standard basis by A = a Diagonalize A over C b Now show that A is similar A = R BR to a rotationdilation matrix both R and B are supposed to be real. c Give a closed-form solution to the discrete dynamical system xt + = A xt if x0 = 3 2 and draw a phase portrait for the system..
15 4 Partially diagonalize the matrix 3 A = over R: that is, write it as MBM where λ 0 0 B = 0 a b 0 b a with a, b, λ R. EXERCISES 5
EIGENVALUES 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 informationEigenspaces. (c) Find the algebraic multiplicity and the geometric multiplicity for the eigenvaules of A.
Eigenspaces 1. (a) Find all eigenvalues and eigenvectors of A = (b) Find the corresponding eigenspaces. [ ] 1 1 1 Definition. If A is an n n matrix and λ is a scalar, the λ-eigenspace of A (usually denoted
More informationPRACTICE FINAL EXAM. why. If they are dependent, exhibit a linear dependence relation among them.
Prof A Suciu MTH U37 LINEAR ALGEBRA Spring 2005 PRACTICE FINAL EXAM Are the following vectors independent or dependent? If they are independent, say why If they are dependent, exhibit a linear dependence
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
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 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 informationMath 489AB Exercises for Chapter 1 Fall Section 1.0
Math 489AB Exercises for Chapter 1 Fall 2008 Section 1.0 1.0.2 We want to maximize x T Ax subject to the condition x T x = 1. We use the method of Lagrange multipliers. Let f(x) = x T Ax and g(x) = x T
More informationExamples True or false: 3. Let A be a 3 3 matrix. Then there is a pattern in A with precisely 4 inversions.
The exam will cover Sections 6.-6.2 and 7.-7.4: True/False 30% Definitions 0% Computational 60% Skip Minors and Laplace Expansion in Section 6.2 and p. 304 (trajectories and phase portraits) in Section
More informationDef. (a, b) is a critical point of the autonomous system. 1 Proper node (stable or unstable) 2 Improper node (stable or unstable)
Types of critical points Def. (a, b) is a critical point of the autonomous system Math 216 Differential Equations Kenneth Harris kaharri@umich.edu Department of Mathematics University of Michigan November
More informationProblems for M 11/2: A =
Math 30 Lesieutre Problem set # November 0 Problems for M /: 4 Let B be the basis given by b b Find the B-matrix for the transformation T : R R given by x Ax where 3 4 A (This just means the matrix for
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 informationEigenvalues and Eigenvectors: An Introduction
Eigenvalues and Eigenvectors: An Introduction The eigenvalue problem is a problem of considerable theoretical interest and wide-ranging application. For example, this problem is crucial in solving systems
More information88 CHAPTER 3. SYMMETRIES
88 CHAPTER 3 SYMMETRIES 31 Linear Algebra Start with a field F (this will be the field of scalars) Definition: A vector space over F is a set V with a vector addition and scalar multiplication ( scalars
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 informationSystems of Algebraic Equations and Systems of Differential Equations
Systems of Algebraic Equations and Systems of Differential Equations Topics: 2 by 2 systems of linear equations Matrix expression; Ax = b Solving 2 by 2 homogeneous systems Functions defined on matrices
More informationMath 21b Final Exam Thursday, May 15, 2003 Solutions
Math 2b Final Exam Thursday, May 5, 2003 Solutions. (20 points) True or False. No justification is necessary, simply circle T or F for each statement. T F (a) If W is a subspace of R n and x is not in
More informationJORDAN NORMAL FORM NOTES
18.700 JORDAN NORMAL FORM NOTES These are some supplementary notes on how to find the Jordan normal form of a small matrix. First we recall some of the facts from lecture, next we give the general algorithm
More informationAnnouncements Monday, November 13
Announcements Monday, November 13 The third midterm is on this Friday, November 17 The exam covers 31, 32, 51, 52, 53, and 55 About half the problems will be conceptual, and the other half computational
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 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
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 informationMatrices and Deformation
ES 111 Mathematical Methods in the Earth Sciences Matrices and Deformation Lecture Outline 13 - Thurs 9th Nov 2017 Strain Ellipse and Eigenvectors One way of thinking about a matrix is that it operates
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 informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationCAAM 335 Matrix Analysis
CAAM 335 Matrix Analysis Solutions to Homework 8 Problem (5+5+5=5 points The partial fraction expansion of the resolvent for the matrix B = is given by (si B = s } {{ } =P + s + } {{ } =P + (s (5 points
More informationIntroduction to Matrix Algebra
Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p
More informationControl Systems I. Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback. Readings: Emilio Frazzoli
Control Systems I Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 13, 2017 E. Frazzoli (ETH)
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 informationProperties of Linear Transformations from R n to R m
Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation
More informationLecture 19: Polar and singular value decompositions; generalized eigenspaces; the decomposition theorem (1)
Lecture 19: Polar and singular value decompositions; generalized eigenspaces; the decomposition theorem (1) Travis Schedler Thurs, Nov 17, 2011 (version: Thurs, Nov 17, 1:00 PM) Goals (2) Polar decomposition
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 informationKnowledge Discovery and Data Mining 1 (VO) ( )
Knowledge Discovery and Data Mining 1 (VO) (707.003) Review of Linear Algebra Denis Helic KTI, TU Graz Oct 9, 2014 Denis Helic (KTI, TU Graz) KDDM1 Oct 9, 2014 1 / 74 Big picture: KDDM Probability Theory
More informationMath 312 Final Exam Jerry L. Kazdan May 5, :00 2:00
Math 32 Final Exam Jerry L. Kazdan May, 204 2:00 2:00 Directions This exam has three parts. Part A has shorter questions, (6 points each), Part B has 6 True/False questions ( points each), and Part C has
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 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 informationMath 215 HW #9 Solutions
Math 5 HW #9 Solutions. Problem 4.4.. If A is a 5 by 5 matrix with all a ij, then det A. Volumes or the big formula or pivots should give some upper bound on the determinant. Answer: Let v i be the ith
More informationMath 1553 Worksheet 5.3, 5.5
Math Worksheet, Answer yes / no / maybe In each case, A is a matrix whose entries are real a) If A is a matrix with characteristic polynomial λ(λ ), then the - eigenspace is -dimensional b) If A is an
More informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
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 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 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 informationEquality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.
Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read
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 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 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 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 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 informationTopic 2 Quiz 2. choice C implies B and B implies C. correct-choice C implies B, but B does not imply C
Topic 1 Quiz 1 text A reduced row-echelon form of a 3 by 4 matrix can have how many leading one s? choice must have 3 choice may have 1, 2, or 3 correct-choice may have 0, 1, 2, or 3 choice may have 0,
More informationπ 1 = tr(a), π n = ( 1) n det(a). In particular, when n = 2 one has
Eigen Methods Math 246, Spring 2009, Professor David Levermore Eigenpairs Let A be a real n n matrix A number λ possibly complex is an eigenvalue of A if there exists a nonzero vector v possibly complex
More informationj=1 x j p, if 1 p <, x i ξ : x i < ξ} 0 as p.
LINEAR ALGEBRA Fall 203 The final exam Almost all of the problems solved Exercise Let (V, ) be a normed vector space. Prove x y x y for all x, y V. Everybody knows how to do this! Exercise 2 If V is a
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 information33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM
33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM (UPDATED MARCH 17, 2018) The final exam will be cumulative, with a bit more weight on more recent material. This outline covers the what we ve done since the
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 informationYou may use a calculator, but you must show all your work in order to receive credit.
Math 2410-010/015 Exam II April 7 th, 2017 Name: Instructions: Key Answer each question to the best of your ability. All answers must be written clearly. Be sure to erase or cross out any work that you
More informationLinear Systems Notes for CDS-140a
Linear Systems Notes for CDS-140a October 27, 2008 1 Linear Systems Before beginning our study of linear dynamical systems, it only seems fair to ask the question why study linear systems? One might hope
More informationMathematical Methods wk 2: Linear Operators
John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationA = 3 B = A 1 1 matrix is the same as a number or scalar, 3 = [3].
Appendix : A Very Brief Linear ALgebra Review Introduction Linear Algebra, also known as matrix theory, is an important element of all branches of mathematics Very often in this course we study the shapes
More information20D - Homework Assignment 5
Brian Bowers TA for Hui Sun MATH D Homework Assignment 5 November 8, 3 D - Homework Assignment 5 First, I present the list of all matrix row operations. We use combinations of these steps to row reduce
More informationMATH 24 EXAM 3 SOLUTIONS
MATH 4 EXAM 3 S Consider the equation y + ω y = cosω t (a) Find the general solution of the homogeneous equation (b) Find the particular solution of the non-homogeneous equation using the method of Undetermined
More informationREPRESENTATION THEORY WEEK 7
REPRESENTATION THEORY WEEK 7 1. Characters of L k and S n A character of an irreducible representation of L k is a polynomial function constant on every conjugacy class. Since the set of diagonalizable
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 informationA VERY BRIEF LINEAR ALGEBRA REVIEW for MAP 5485 Introduction to Mathematical Biophysics Fall 2010
A VERY BRIEF LINEAR ALGEBRA REVIEW for MAP 5485 Introduction to Mathematical Biophysics Fall 00 Introduction Linear Algebra, also known as matrix theory, is an important element of all branches of mathematics
More informationLECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book]
LECTURE VII: THE JORDAN CANONICAL FORM MAT 204 - 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
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 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(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).
.(5pts) Let B = 5 5. Compute det(b). (a) (b) (c) 6 (d) (e) 6.(5pts) Determine which statement is not always true for n n matrices A and B. (a) If two rows of A are interchanged to produce B, then det(b)
More information1. Matrix multiplication and Pauli Matrices: Pauli matrices are the 2 2 matrices. 1 0 i 0. 0 i
Problems in basic linear algebra Science Academies Lecture Workshop at PSGRK College Coimbatore, June 22-24, 2016 Govind S. Krishnaswami, Chennai Mathematical Institute http://www.cmi.ac.in/~govind/teaching,
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationLecture Notes for Math 251: ODE and PDE. Lecture 27: 7.8 Repeated Eigenvalues
Lecture Notes for Math 25: ODE and PDE. Lecture 27: 7.8 Repeated Eigenvalues Shawn D. Ryan Spring 22 Repeated Eigenvalues Last Time: We studied phase portraits and systems of differential equations with
More informationFind the general solution of the system y = Ay, where
Math Homework # March, 9..3. Find the general solution of the system y = Ay, where 5 Answer: The matrix A has characteristic polynomial p(λ = λ + 7λ + = λ + 3(λ +. Hence the eigenvalues are λ = 3and λ
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationMath 266: Phase Plane Portrait
Math 266: Phase Plane Portrait Long Jin Purdue, Spring 2018 Review: Phase line for an autonomous equation For a single autonomous equation y = f (y) we used a phase line to illustrate the equilibrium solutions
More informationRecitation 8: Graphs and Adjacency Matrices
Math 1b TA: Padraic Bartlett Recitation 8: Graphs and Adjacency Matrices Week 8 Caltech 2011 1 Random Question Suppose you take a large triangle XY Z, and divide it up with straight line segments into
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 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 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 informationSolution: In standard form (i.e. y + P (t)y = Q(t)) we have y t y = cos(t)
Math 380 Practice Final Solutions This is longer than the actual exam, which will be 8 to 0 questions (some might be multiple choice). You are allowed up to two sheets of notes (both sides) and a calculator,
More informationMAT2342 : Introduction to Linear Algebra Mike Newman, 5 October assignment 1
[/8 MAT4 : Introduction to Linear Algebra Mike Newman, 5 October 07 assignment You must show your work. You may use software or solvers of some sort to check calculation of eigenvalues, but you should
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 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 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 informationVectors, matrices, eigenvalues and eigenvectors
Vectors, matrices, eigenvalues and eigenvectors 1 ( ) ( ) ( ) Scaling a vector: 0.5V 2 0.5 2 1 = 0.5 = = 1 0.5 1 0.5 ( ) ( ) ( ) ( ) Adding two vectors: V + W 2 1 2 + 1 3 = + = = 1 3 1 + 3 4 ( ) ( ) a
More informationHomework 3 Solutions Math 309, Fall 2015
Homework 3 Solutions Math 39, Fall 25 782 One easily checks that the only eigenvalue of the coefficient matrix is λ To find the associated eigenvector, we have 4 2 v v 8 4 (up to scalar multiplication)
More informationA PRIMER ON SESQUILINEAR FORMS
A PRIMER ON SESQUILINEAR FORMS BRIAN OSSERMAN This is an alternative presentation of most of the material from 8., 8.2, 8.3, 8.4, 8.5 and 8.8 of Artin s book. Any terminology (such as sesquilinear form
More informationLinear Algebra
. Linear Algebra Final Solutions. (pts) Let A =. (a) Find an orthogonal matrix S a diagonal matrix D such that S AS = D. (b) Find a formula for the entries of A t,wheret is a positive integer. Also find
More informationLinear Algebra Exercises
9. 8.03 Linear Algebra Exercises 9A. Matrix Multiplication, Rank, Echelon Form 9A-. Which of the following matrices is in row-echelon form? 2 0 0 5 0 (i) (ii) (iii) (iv) 0 0 0 (v) [ 0 ] 0 0 0 0 0 0 0 9A-2.
More informationMath Bootcamp An p-dimensional vector is p numbers put together. Written as. x 1 x =. x p
Math Bootcamp 2012 1 Review of matrix algebra 1.1 Vectors and rules of operations An p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
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 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 320, WEEK 11: Eigenvalues and Eigenvectors
MATH 30, WEEK : Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors We have learned about several vector spaces which naturally arise from matrix operations In particular, we have learned about the
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
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 information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
More information(VI.C) Rational Canonical Form
(VI.C) Rational Canonical Form Let s agree to call a transformation T : F n F n semisimple if there is a basis B = { v,..., v n } such that T v = λ v, T v 2 = λ 2 v 2,..., T v n = λ n for some scalars
More informationMath 108b: Notes on the Spectral Theorem
Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator
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 informationPractice problems for Exam 3 A =
Practice problems for Exam 3. Let A = 2 (a) Determine whether A is diagonalizable. If so, find a matrix S such that S AS is diagonal. If not, explain why not. (b) What are the eigenvalues of A? Is A diagonalizable?
More informationTBP MATH33A Review Sheet. November 24, 2018
TBP MATH33A Review Sheet November 24, 2018 General Transformation Matrices: Function Scaling by k Orthogonal projection onto line L Implementation If we want to scale I 2 by k, we use the following: [
More informationMath 21b. Review for Final Exam
Math 21b. Review for Final Exam Thomas W. Judson Spring 2003 General Information The exam is on Thursday, May 15 from 2:15 am to 5:15 pm in Jefferson 250. Please check with the registrar if you have a
More information