MTH 464: Computational Linear Algebra
|
|
- Dylan Lester
- 5 years ago
- Views:
Transcription
1 MTH 464: Computational Linear Algebra Lecture Outlines Exam 4 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University April 15, 2018 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Contents I 1 Lecture 1 2 Lecture 2 3 Lecture 3 4 Lecture 4 5 Lecture 5 6 Review Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
2 Lecture 1 Overview Goal for today: Learn to diagonalize a matrix [section 5.3] Outline: 1 Diagonalization: What and Why? 2 Diagonalization: How? 3 Diagonalization: When? Assignment (5.3): Read: section 5.5 (skip 5.4) Work: section 5.3 (p. 288) #1, 5, 7, 11, 14, 17, 21, 22, 23, 25 Extra practice: #3, 9, 13, 15, 19, 27 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 1 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
3 Lecture 1 Diagonalization: What and Why? What is diagonalization? Represent eigenvalues/vectors with a matrix factorization: A = PDP 1 D = P 1 AP where D records eigenvalues and P records eigenvectors of A Why diagonalize a matrix? Computing powers of matrices Decouple a discrete dynamical system Decouple a system of differential equations Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 1 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
4 Diagonalization: How? Lecture 1 Method (page ): To diagonalize an n n matrix A 1 Find the eigenvalues λ 1,..., λ n of A 2 Find corresponding eigenvectors v 1,..., v n [ v1... v 3 Construct P from the eigenvectors: P = n ] 4 Construct a diagonal matrix D from the eigenvalues: λ D = λ n 5 If P is invertible (the eigenvectors are linearly independent) then A = PDP 1 D = P 1 AP 6 To check the calculation, verify that AP = PD and P is invertible. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 1 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
5 Diagonalization: When? Theorem 5 (page 284) Lecture 1 An n n matrix A is diagonalizable if and only if A has n linearly independent eigenvectors. In more detail: A = PDP 1 with D diagonal if and only if the columns of P are n linearly independent eigenvectors of A; then the diagonal entries of D are the corresponding eigenvalues of A. Theorem 6 (page 286) If A is n n and has n distinct eigenvalues, then A is diagonalizable. Warning: The inverse of this statement is not true (in general): If a matrix has a repeated eigenvalue, it may still be diagonalizable (to find out whether it is, you must check the eigenvectors). Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 1 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
6 Lecture 1 Examples Determine if the following matrices are diagonalizable. If so, determine D and P A = [ ] 5 1 A = 5 1 [ ] 3 2 A = 0 3 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 1 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
7 Lecture 1 Diagonalization: More Precise Characterization Theorem 7 (page 287 slightly modified) Let A be an n n matrix A whose distinct eigenvalues are λ 1,..., λ p with p n. For each k let: m(λ k ) denote the algebraic multiplicity of λ k d(λ k ) denote the dimension of the eigenspace for λ k. (This is called the geometric multiplicity of eigenvalue λ k ) Then: a. For 1 k p, d(λ k ) m(λ k ) b. A is diagonalizable iff for 1 k p, d(λ k ) = m(λ k ) (and the characteristic polynomial factors completely into linear factors) p c. A is diagonalizable iff d(λ k ) = n k=1 d. If A is diagonalizable and for each k, B k is a basis for the eigenspace for λ k, then the total collection of vectors in the sets B 1,..., B p forms an eigenvector basis for R n. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 1 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
8 Lecture 2 Overview Goal for today: Outline: Learn to find and interpret complex eigenvalues/eigenvectors [section 5.5] 1 Diagonalization (review) 2 Complex Eigenvalues and Eigenvectors 3 Interpretation of Complex Eigenvalues and Eigenvectors Assignment (5.5): Read: section 5.6 Work: section 5.5 (p. 302) #3, 5, 7, 10, 13, 16, 21 Extra practice: #1, 9, 11, 15, 17 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 2 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
9 Lecture 2 Diagonalization (review) To diagonalize an n n matrix A: Find eigenvalues λ 1,..., λ n and eigenvectors v 1,..., v n If eigenvectors are linearly independent then [ ] λ A = PDP 1 v1... v where P = n, D = λ n Theorem 7 Let A be a real n n matrix whose distinct eigenvalues are λ 1,..., λ p. For each eigenvalue λ k : dim(eigenspace for λ k ) multiplicity of λ k and A is diagonalizable if and only if equality holds for each k = 1,..., p. [See text for other parts of this theorem.] Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 2 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
10 Lecture 2 Observations Suppose a matrix A is diagonalizable. A is similar to a diagonal matrix D of its eigenvalues. Remember that A can be viewed as a linear transformation. The diagonal matrix D is also a linear transformation matrix. If λ i are real then it describes dilation in the v i eigenvector direction. The eigenvector matrix P is a basis for which the linear transformation A can be described in. Question: What happens if the eigenvalues are complex? Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 2 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
11 Lecture 2 Example Consider a mass-spring (m = k = 1) with no damping. Let the initial displacement be y(0) = 1 and velocity be zero. This is modeled by, y (t) + y(t) = 0. The solution is y(t) = cos(t). Hence the displacement oscillates. Notice the differential equation can be modeled by a linear system, [ ] [ ] [ ] d y(t) 0 1 y(t) = dt v(t) 1 0 v(t) Compactly, v = A v. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 2 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
12 Example - continued Lecture 2 What type of transformation is A? [ 0 1 A e 1 = 1 0 [ 0 1 A e 2 = 1 0 ] e 1 = e 2 ] e 2 = e 1 So the matrix A describes a clockwise rotation by π/2. What are the eigenvalues? λ = ±i Using A = PDP 1 the solution in matrix form is [ ] e it 0 v = P 0 e it P 1 v(0) So complex eigenvalues are related to rotation. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 2 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
13 Lecture 2 Complex Eigenvalues and Eigenvectors Methods: Same as real case Fact: If matrix is real, then eigenvalues/eigenvectors are conjugate pairs: Av = λv A v = λ v where the bar denotes the complex conjugate Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 2 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
14 Lecture 2 Interpretation: Simple Case The matrix [ ] a b C = b a (where a and b are real numbers) has eigenvalues λ = a ± bi. Set r = λ = a 2 + b 2 and φ = arg(λ) so that a = r cos(φ) and b = r sin(φ) Then [ ] cos(φ) sin(φ) C = r sin(φ) cos(φ) Interpretation: C represents rotation by φ and scaling by r Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 2 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
15 Lecture 2 Simple Example Example 8 Let A = [ A = ]. This can diagonalized as [ ] [ ] [ ] i i 1 + 2i 0 i/2 1/ i i/2 1/2 This does not help provide a geometric interpretation of the matrix mapping between R 2 and R 2. The eigenvalue does. It indicates the matrix rotates vectors contour clockwise by arctan(2) and stretches by 5. Question: What if the matrix A has complex eigenvalues but is not in this special form? How can we interpret the matrix transformation? Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 2 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
16 Lecture 2 Interpretation: General Case Recall diagonalization of an n n matrix A: [ A = PDP 1 v1... v where P = n ] λ , D = λ n Interpretation: P represents change of basis, D represents scaling Theorem 9 (page 299) Let A be a real 2 2 matrix with a complex eigenvalue λ = a bi (b 0) and an associated eigenvector v in C 2. Then A may be factored as [ ] [ ] A = PCP 1 Re v Im v a b where P =, C = b a Interpretation: P represents change of basis, C rotation and scaling. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 2 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
17 Lecture 2 Example 10 Let A = [ ]. This has eigenvalues and vectors of [ 5 λ = 3 ± i, v + = 2 i [ ] A = PCP 1 = [ ] [ 5, v = ] 2 + i [ 1/5 0 2/5 1 This provides a geometric interpretation. Let x R 2. Then A x: [ ] [ ] Maps x into the basis and Rotates the vector by arctan(1/3) Stretches it by 10 4 Maps transformed vector back into the standard (euclidean) basis. ] ] Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 2 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
18 Lecture 3 Overview Goal for today: Learn to solve discrete dynamical systems [section 5.6] Outline: 1 Complex Eigenvalues and Eigenvectors (review) 2 Discrete Dynamical Systems 3 Solutions from Eigenvalues and Eigenvectors 4 Behavior of Solutions Assignment (5.6): Read: section 5.7 Work: section 5.6 (p. 311) #1, 3, 7, 11, 14, 15 Extra practice: #5, 9, 13 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 3 Complex Eigenvalues and Eigenvectors (review) Simple case: This matrix has eigenvalues λ = a ± bi: [ ] [ ] a b cos(φ) sin(φ) C = = r b a sin(φ) cos(φ) where r = λ = a 2 + b 2 and φ = arg(λ) [a = r cos(φ), b = r sin(φ)] Interpretation: C represents rotation by φ and scaling by r General case (Theorem 9): If A is a real 2 2 matrix with a complex eigenvalue λ = a bi (b 0) and an associated eigenvector v in C 2, then A may be factored as [ ] [ ] A = PCP 1 Re v Im v a b where P =, C = b a Interpretation: P represents change of basis, C rotation and scaling Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
19 Lecture 3 Discrete Dynamical Systems Formulation: Given an n n matrix A and a vector x 0 in R n, solve x k+1 = Ax k, k = 0, 1, 2,... (also known as a difference equation) This is the simplest such problem: Homogeneous (no forcing term) Constant coefficients (A does not depend on k) Linear (so solutions may be superimposed) Solution: x k = A k x 0, k = 0, 1, 2,... (but this provides no insight into the long-term behavior) Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 3 Solving a Discrete Dynamical System Method: To solve x k+1 = Ax k (A is n n) 1 Find the eigenvalues λ 1,..., λ n of A 2 Find corresponding eigenvectors v 1,..., v n 3 The general solution has the form x k = c 1 λ k 1 v c n λ k nv n 4 Solve for c 1,..., c n from the initial vector x 0 : x 0 = c 1 v c n v n Note: This works when A has n linearly independent eigenvectors (i.e., when A is diagonalizable). If that is not the case, then the solution involves generalized eigenvectors. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
20 Lecture 3 Discrete Dynamical Systems: Behavior of Solutions As k, λ k = λ k { 0, if λ < 1, if λ > 1 For the 2 2 problem with general solution x k = c 1 λ k 1 v 1 + c 2 λ k 2 v 2 λ 1 < 1, λ 2 < 1: origin is an attractor: x k 0 as k λ 1 > 1, λ 2 > 1: origin is a repeller: x k as k λ 1 < 1, λ 2 > 1 (or vice-versa): origin is a saddle point Remark: Complex eigenvalues result in rotation (stable/unstable spirals or centers) Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Overview Lecture 4 Goal for today: Learn to solve continuous dynamical systems (ODEs) [section 5.7] Outline: 1 Discrete Dynamical Systems: Phase Plane 2 ODE Systems 3 Solving ODE Systems 4 Continuous Dynamical Systems: Phase Plane Assignment (5.7): Read: section 5.7 (again) Work: section 5.7 (p. 319) #1, 2, 3, 5 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
21 Lecture 4 Discrete Dynamical Systems: Phase Plane For the discrete dynamical system x k+1 = Ax k when A is 2 2: General solution in terms of eigenvalues and eigenvectors: x k = c 1 λ k 1 v 1 + c 2 λ k 2 v 2 where c 1 and c 2 are determined by the initial condition x 0 Long-term behavior (as k ) depends on eigenvalues To visualize, plot the trajectory x 0, x 1, x 2,... in the phase plane Classification of the fixed point at the origin: λ 1 < 1, λ 2 < 1: origin is an attractor: x k 0 as k λ 1 > 1, λ 2 > 1: origin is a repeller: x k as k λ 1 < 1, λ 2 > 1 (or vice-versa): origin is a saddle point Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 A remark Lecture 4 Not just a remark buta Huge Remark: The long-term behavior of discrete dynamical system is completely determined by the absolute values of the eigenvalues and NOT the sign of the real part of the eigenvalues. Don t be confused by your differential equations background. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
22 Lecture 4 Continuous Dynamical Systems (ODEs) Variables: x 1 (t),..., x n (t) Equations (ordinary differential equations): x 1 = a 11x a 1n x n. x n = a n1 x a nn x n This is the simplest form: homogeneous, constant coefficients, linear Matrix form: x (t) = Ax(t), x(0) = x 0 where: x 1 (t) x 1 x(t) =, x (t) (t) =, A =.. x n (t). x n(t) a 11 a n1... a 1n.... a nn Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Solving ODE Systems Lecture 4 Method: To solve x (t) = Ax(t), x(0) = x 0 1 Find the eigenvalues λ 1,..., λ n of A (where A is n n) 2 Find corresponding eigenvectors v 1,..., v n 3 The general solution has the form x(t) = c 1 e λ 1t v c n e λ nt v n 4 Solve for c 1,..., c n from the initial vector x 0 : x 0 = c 1 v c n v n Note: This works when A has n linearly independent eigenvectors (i.e., when A is diagonalizable). If that is not the case, then the solution involves generalized eigenvectors. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
23 Lecture 4 Continuous Dynamical Systems (ODEs): Phase Plane For the ODE system x (t) = Ax(t) when A is 2 2: General solution in terms of eigenvalues and eigenvectors: x(t) = c 1 e λ1t v 1 + c 2 e λ2t v 2 where c 1 and c 2 are determined by the initial condition x(0) = x 0 Long-term behavior (as k ) depends on eigenvalues To visualize, plot the trajectory x(t) as a curve in the phase plane Classification of the fixed point at the origin (when λ 1, λ 2 are real): λ 1 < 0, λ 2 < 0: origin is an attractor: x(t) 0 as t λ 1 > 0, λ 2 > 0: origin is a repeller: x(t) as t λ 1 < 0, λ 2 > 0 (or vice-versa): origin is a saddle point Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Example Lecture 4 [ ] 2 3 Consider x (t) = x(t). Classify the fixed point at the origin. 1 2 What is the direction of the greatest repulsion/attraction? [ ] [ ] x(t) = c 1 e t 3 + c 1 2 e t 1 1 [ ] 3 λ 1 = 1 repels orbits away from the origin in the direction of v 1 = 1 [ ] 1 λ 1 = 1 attracts orbits to the origin in the direction of v 2 = 1 [ ] 1 Given x(0) =. How do we determine c 2 1 and c 2? c 1 = 3/4 and c 2 = 5/4. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
24 Lecture 5 Overview Goal for today: Outline: Learn more about continuous dynamical systems (ODEs) [section 5.7] 1 Phase Plane 2 Complex Eigenvalues 3 Review of Dynamical Systems: Discrete vs. Continuous Assignment: Read: review chapters 3 and 5 Work: section 5.7 (p. 319) #7, 9, 11, 13 Review: Supp. Exercise #1 for Chapters 3 and 5 for next class Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Lecture 5 Continuous Dynamical Systems (ODEs): Phase Plane For the ODE system x (t) = Ax(t) when A is 2 2: General solution in terms of eigenvalues and eigenvectors: x(t) = c 1 e λ 1t v 1 + c 2 e λ 2t v 2 where c 1 and c 2 are determined by the initial condition x(0) = x 0 Long-term behavior (as k ) depends on eigenvalues To visualize, plot the trajectory x(t) as a curve in the phase plane Classification of the fixed point at the origin (when λ 1, λ 2 are real): λ 1 < 0, λ 2 < 0: origin is an attractor: x(t) 0 as t λ 1 > 0, λ 2 > 0: origin is a repeller: x(t) as t λ 1 < 0, λ 2 > 0 (or vice-versa): origin is a saddle point Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
25 Lecture 5 ODE Systems with Complex Eigenvalues For complex eigenvalues λ = a ± ib (where a and b are real): e λt = e (a±ib)t = e at e ±ibt = e at [cos(bt) ± i sin(bt)] Real part a = Re(λ) determines amplitude: a > 0: amplitude grows (trajectory spirals out from origin) a < 0: amplitude decays (trajectory spirals in toward origin) a = 0: amplitude constant (trajectory is an ellipse) Imaginary part b = Im(λ) determines frequency of oscillation Solutions corresponding to eigenvalue λ = a + bi and eigenvector v: Complex form: Real form (see box, page 316): x(t) = c 1 x 1 (t) + c 2 x 1 (t) = c 1 e λt v + c 2 e λt v y 1 (t) = Re x 1 (t) = e at [(Re v) cos(bt) (Im v) sin(bt)] y 2 (t) = Im x 1 (t) = e at [(Re v) sin(bt) + (Im v) cos(bt)] Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Example Lecture 5 Consider x (t) = [ ] 3 2 x(t). Determine the solution x(t). 1 1 x(t) = c 1 e ( 2+i)t [ = e 2t ( c 1 e it [ i i ] [ ] + c 2 e ( 2 i)t 2 1 i ] [ ]) + c 2 e it 2 1 i In real form, x(t) = e 2t ( a 1 [ cos(t) + sin(t) cos(t) ] + a 2 [ sin(t) cos(t) sin(t) ]) What happens as t? Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
26 Lecture 5 Dynamical Systems: Discrete vs. Continuous For a 2 2 matrix A with eigen(values,vectors) (λ 1, v 1 ) and (λ 2, v 2 ): Discrete Continuous Equation: x k+1 = Ax k x (t) = Ax(t) Solution: x k = c 1 λ k 1 v 1 + c 2 λ k 2 v 2 x(t) = c 1 e λ1t v 1 + c 2 e λ2t v 2 Attractor: λ 1 < 1, λ 2 < 1 Re λ 1 < 0, Re λ 2 < 0 Repeller: λ 1 > 1, λ 2 > 1 Re λ 1 > 0, Re λ 2 > 0 Saddle point: λ 1 < 1, λ 2 > 1 Re λ 1 < 0, Re λ 2 > 0 Key: size of λ sign of Re λ Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Review Goal for today: Review Outline: 1 Diagonalization (review) 2 Diagonalization and Dynamical Systems 3 True/False Questions Assignment: Read: 6.1 Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
27 Review Diagonalization (review) To diagonalize an n n matrix A: Find eigenvalues λ 1,..., λ n and eigenvectors v 1,..., v n If eigenvectors are linearly independent then [ ] λ A = PDP 1 v1... v where P = n, D = λ n An n n matrix A is diagonalizable: Thm 5: if and only if A has n linearly independent eigenvectors Thm 6: if A has n distinct eigenvalues (converse not true!) Thm 7: if and only if for each eigenvalue λ: dim(eigenspace for λ) = multiplicity of λ Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Review Dynamical Systems (Review) For a 2 2 matrix A with eigen(values,vectors) (λ 1, v 1 ) and (λ 2, v 2 ): Discrete Continuous Equation: x k+1 = Ax k x (t) = Ax(t) Solution: x k = c 1 λ k 1 v 1 + c 2 λ k 2 v 2 x(t) = c 1 e λ1t v 1 + c 2 e λ2t v 2 Attractor: λ 1 < 1, λ 2 < 1 Re λ 1 < 0, Re λ 2 < 0 Repeller: λ 1 > 1, λ 2 > 1 Re λ 1 > 0, Re λ 2 > 0 Saddle point: λ 1 < 1, λ 2 > 1 Re λ 1 < 0, Re λ 2 > 0 Key: size of λ sign of Re λ Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
28 Review Chapter 5 Supplemental Exercise 1 (a) If A is invertible and 1 is an eigenvalue for A, then 1 is also an eigenvalue for A 1. (b) If A is row-equivalent to the identity matrix I, then A is diagonalizable. (c) If A contains a row or column of zeros, then 0 is an eigenvalue of A. (d) Each eigenvalue of A is also an eigenvalue of A 2. (e) Each eigenvector of A is also an eigenvector of A 2. (f) Each eigenvector of an invertible matrix A is also an eigenvector of A 1. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Review Chapter 5 Supplemental Exercise (g) Eigenvalues must be nonzero scalars. (h) Eigenvectors must be nonzero vectors. (i) Two eigenvectors corresponding to the same eigenvalue are always linearly dependent. (j) Similar matrices always have exactly the same eigenvalues. (k) Similar matrices always have exactly the same eigenvectors. (l) The sum of two eigenvectors of a matrix A is also an eigenvector of A. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
29 Review Chapter 5 Supplemental Exercise (m) The eigenvalues of an upper-triangular matrix A are exactly the nonzero entries on the diagonal of A. (n) The matrices A and A T have the same eigenvalues, counting multiplicities. (o) If a 5 5 matrix A has fewer than 5 distinct eigenvalues, then A is not diagonalizable. (p) There exists a 2 2 matrix that has no eigenvectors in R 2. (q) If A is diagonalizable, then the columns of A are linearly independent. (r) A nonzero vector cannot be an eigenvector corresponding to two different eigenvalues of A. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40 Review Chapter 5 Supplemental Exercise (s) A square matrix A is invertible if and only if there is a coordinate system in which the transformation x Ax is represented by a diagonal matrix. (t) If each vector e j in the standard basis for R n is an eigenvector of A, then A is a diagonal matrix. (u) If A is similar to a diagonalizable matrix B, then A is also diagonalizable. (v) If A and B are invertible n n matrices, then AB is similar to BA. (w) An n n matrix with n linearly independent eigenvectors is invertible. (x) If A is an n n diagonalizable matrix, then each vector in R n can be written as a linear combination of eigenvectors of A. Linear Algebra (MTH 464) Lecture Outlines April 15, / 40
MAT 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 informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University March 2, 2018 Linear Algebra (MTH 464)
More informationAnnouncements Monday, November 13
Announcements Monday, November 13 The third midterm is on this Friday, November 17. The exam covers 3.1, 3.2, 5.1, 5.2, 5.3, and 5.5. About half the problems will be conceptual, and the other half computational.
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 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 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 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 informationDepartment of Mathematics IIT Guwahati
Stability of Linear Systems in R 2 Department of Mathematics IIT Guwahati A system of first order differential equations is called autonomous if the system can be written in the form dx 1 dt = g 1(x 1,
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 informationExamples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling
1 Introduction Many natural processes can be viewed as dynamical systems, where the system is represented by a set of state variables and its evolution governed by a set of differential equations. Examples
More informationMath 1553, Introduction to Linear Algebra
Learning goals articulate what students are expected to be able to do in a course that can be measured. This course has course-level learning goals that pertain to the entire course, and section-level
More informationConstant coefficients systems
5.3. 2 2 Constant coefficients systems Section Objective(s): Diagonalizable systems. Real Distinct Eigenvalues. Complex Eigenvalues. Non-Diagonalizable systems. 5.3.. Diagonalizable Systems. Remark: We
More informationUnderstand the existence and uniqueness theorems and what they tell you about solutions to initial value problems.
Review Outline To review for the final, look over the following outline and look at problems from the book and on the old exam s and exam reviews to find problems about each of the following topics.. Basics
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 informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University February 6, 2018 Linear Algebra (MTH
More informationDIAGONALIZABLE LINEAR SYSTEMS AND STABILITY. 1. Algebraic facts. We first recall two descriptions of matrix multiplication.
DIAGONALIZABLE LINEAR SYSTEMS AND STABILITY. 1. Algebraic facts. We first recall two descriptions of matrix multiplication. Let A be n n, P be n r, given by its columns: P = [v 1 v 2... v r ], where the
More informationsystems of linear di erential If the homogeneous linear di erential system is diagonalizable,
G. NAGY ODE October, 8.. Homogeneous Linear Differential Systems Section Objective(s): Linear Di erential Systems. Diagonalizable Systems. Real Distinct Eigenvalues. Complex Eigenvalues. Repeated Eigenvalues.
More informationHomogeneous Linear Systems of Differential Equations with Constant Coefficients
Objective: Solve Homogeneous Linear Systems of Differential Equations with Constant Coefficients dx a x + a 2 x 2 + + a n x n, dx 2 a 2x + a 22 x 2 + + a 2n x n,. dx n = a n x + a n2 x 2 + + a nn x n.
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 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 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 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 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 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 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 informationSystems of Linear ODEs
P a g e 1 Systems of Linear ODEs Systems of ordinary differential equations can be solved in much the same way as discrete dynamical systems if the differential equations are linear. We will focus here
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 informationName: Final Exam MATH 3320
Name: Final Exam MATH 3320 Directions: Make sure to show all necessary work to receive full credit. If you need extra space please use the back of the sheet with appropriate labeling. (1) State the following
More 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 informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 1 Material Dr. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University January 9, 2018 Linear Algebra (MTH 464)
More informationDiagonalization. P. Danziger. u B = A 1. B u S.
7., 8., 8.2 Diagonalization P. Danziger Change of Basis Given a basis of R n, B {v,..., v n }, we have seen that the matrix whose columns consist of these vectors can be thought of as a change of basis
More informationWI1403-LR Linear Algebra. Delft University of Technology
WI1403-LR Linear Algebra Delft University of Technology Year 2013 2014 Michele Facchinelli Version 10 Last modified on February 1, 2017 Preface This summary was written for the course WI1403-LR Linear
More informationMATH 1553, C. JANKOWSKI MIDTERM 3
MATH 1553, C JANKOWSKI MIDTERM 3 Name GT Email @gatechedu Write your section number (E6-E9) here: Please read all instructions carefully before beginning Please leave your GT ID card on your desk until
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 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 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 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 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 informationSection 5.5. Complex Eigenvalues
Section 5.5 Complex Eigenvalues A Matrix with No Eigenvectors Consider the matrix for the linear transformation for rotation by π/4 in the plane. The matrix is: A = 1 ( ) 1 1. 2 1 1 This matrix has no
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 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 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 informationTopic # /31 Feedback Control Systems
Topic #7 16.30/31 Feedback Control Systems State-Space Systems What are the basic properties of a state-space model, and how do we analyze these? Time Domain Interpretations System Modes Fall 2010 16.30/31
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 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 informationThird In-Class Exam Solutions Math 246, Professor David Levermore Thursday, 3 December 2009 (1) [6] Given that 2 is an eigenvalue of the matrix
Third In-Class Exam Solutions Math 26, Professor David Levermore Thursday, December 2009 ) [6] Given that 2 is an eigenvalue of the matrix A 2, 0 find all the eigenvectors of A associated with 2. Solution.
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 information7. Symmetric Matrices and Quadratic Forms
Linear Algebra 7. Symmetric Matrices and Quadratic Forms CSIE NCU 1 7. Symmetric Matrices and Quadratic Forms 7.1 Diagonalization of symmetric matrices 2 7.2 Quadratic forms.. 9 7.4 The singular value
More informationSection 5.5. Complex Eigenvalues
Section 55 Complex Eigenvalues A Matrix with No Eigenvectors In recitation you discussed the linear transformation for rotation by π/4 in the plane The matrix is: A = 1 ( ) 1 1 2 1 1 This matrix has no
More informationComplex Dynamic Systems: Qualitative vs Quantitative analysis
Complex Dynamic Systems: Qualitative vs Quantitative analysis Complex Dynamic Systems Chiara Mocenni Department of Information Engineering and Mathematics University of Siena (mocenni@diism.unisi.it) Dynamic
More informationSection 5.5. Complex Eigenvalues (Part II)
Section 5.5 Complex Eigenvalues (Part II) Motivation: Complex Versus Two Real Eigenvalues Today s decomposition is very analogous to diagonalization. Theorem Let A be a 2 2 matrix with linearly independent
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 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 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 informationIn these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation.
1 2 Linear Systems In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation 21 Matrix ODEs Let and is a scalar A linear function satisfies Linear superposition ) Linear
More 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 informationSolutions of the Sample Problems for the Third In-Class Exam Math 246, Fall 2017, Professor David Levermore
Solutions of the Sample Problems for the Third In-Class Exam Math 6 Fall 07 Professor David Levermore Compute the Laplace transform of ft t e t ut from its definition Solution The definition of the Laplace
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 informationELEC 3035, Lecture 3: Autonomous systems Ivan Markovsky
ELEC 3035, Lecture 3: Autonomous systems Ivan Markovsky Equilibrium points and linearization Eigenvalue decomposition and modal form State transition matrix and matrix exponential Stability ELEC 3035 (Part
More informationMultiplying matrices by diagonal matrices is faster than usual matrix multiplication.
7-6 Multiplying matrices by diagonal matrices is faster than usual matrix multiplication. The following equations generalize to matrices of any size. Multiplying a matrix from the left by a diagonal matrix
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 informationSolving a system by back-substitution, checking consistency of a system (no rows of the form
MATH 520 LEARNING OBJECTIVES SPRING 2017 BROWN UNIVERSITY SAMUEL S. WATSON Week 1 (23 Jan through 27 Jan) Definition of a system of linear equations, definition of a solution of a linear system, elementary
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 informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
More informationEigenvalues and Eigenvectors
5 Eigenvalues and Eigenvectors 5.2 THE CHARACTERISTIC EQUATION DETERMINANATS n n Let A be an matrix, let U be any echelon form obtained from A by row replacements and row interchanges (without scaling),
More information5.3.5 The eigenvalues are 3, 2, 3 (i.e., the diagonal entries of D) with corresponding eigenvalues. Null(A 3I) = Null( ), 0 0
535 The eigenvalues are 3,, 3 (ie, the diagonal entries of D) with corresponding eigenvalues,, 538 The matrix is upper triangular so the eigenvalues are simply the diagonal entries, namely 3, 3 The corresponding
More informationSection 9.3 Phase Plane Portraits (for Planar Systems)
Section 9.3 Phase Plane Portraits (for Planar Systems) Key Terms: Equilibrium point of planer system yꞌ = Ay o Equilibrium solution Exponential solutions o Half-line solutions Unstable solution Stable
More information7 Planar systems of linear ODE
7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution
More informationAutonomous system = system without inputs
Autonomous system = system without inputs State space representation B(A,C) = {y there is x, such that σx = Ax, y = Cx } x is the state, n := dim(x) is the state dimension, y is the output Polynomial representation
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 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 informationLinear Planar Systems Math 246, Spring 2009, Professor David Levermore We now consider linear systems of the form
Linear Planar Systems Math 246, Spring 2009, Professor David Levermore We now consider linear systems of the form d x x 1 = A, where A = dt y y a11 a 12 a 21 a 22 Here the entries of the coefficient matrix
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 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 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 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 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 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 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 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 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 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 informationExam in TMA4110 Calculus 3, June 2013 Solution
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 8 Exam in TMA4 Calculus 3, June 3 Solution Problem Let T : R 3 R 3 be a linear transformation such that T = 4,
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 informationAPPM 2360: Midterm exam 3 April 19, 2017
APPM 36: Midterm exam 3 April 19, 17 On the front of your Bluebook write: (1) your name, () your instructor s name, (3) your lecture section number and (4) a grading table. Text books, class notes, cell
More informationEven-Numbered Homework Solutions
-6 Even-Numbered Homework Solutions Suppose that the matric B has λ = + 5i as an eigenvalue with eigenvector Y 0 = solution to dy = BY Using Euler s formula, we can write the complex-valued solution Y
More informationPart II Problems and Solutions
Problem 1: [Complex and repeated eigenvalues] (a) The population of long-tailed weasels and meadow voles on Nantucket Island has been studied by biologists They measure the populations relative to a baseline,
More informationMIT Final Exam Solutions, Spring 2017
MIT 8.6 Final Exam Solutions, Spring 7 Problem : For some real matrix A, the following vectors form a basis for its column space and null space: C(A) = span,, N(A) = span,,. (a) What is the size m n of
More informationLinear Algebra (MATH ) Spring 2011 Final Exam Practice Problem Solutions
Linear Algebra (MATH 4) Spring 2 Final Exam Practice Problem Solutions Instructions: Try the following on your own, then use the book and notes where you need help. Afterwards, check your solutions with
More 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 informationChapter 4 & 5: Vector Spaces & Linear Transformations
Chapter 4 & 5: Vector Spaces & Linear Transformations Philip Gressman University of Pennsylvania Philip Gressman Math 240 002 2014C: Chapters 4 & 5 1 / 40 Objective The purpose of Chapter 4 is to think
More informationCopyright (c) 2006 Warren Weckesser
2.2. PLANAR LINEAR SYSTEMS 3 2.2. Planar Linear Systems We consider the linear system of two first order differential equations or equivalently, = ax + by (2.7) dy = cx + dy [ d x x = A x, where x =, and
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 informationEigenvalues and Eigenvectors
5 Eigenvalues and Eigenvectors 5.2 THE CHARACTERISTIC EQUATION DETERMINANATS nn Let A be an matrix, let U be any echelon form obtained from A by row replacements and row interchanges (without scaling),
More informationCalculus and Differential Equations II
MATH 250 B Second order autonomous linear systems We are mostly interested with 2 2 first order autonomous systems of the form { x = a x + b y y = c x + d y where x and y are functions of t and a, b, c,
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 informationEIGENVALUES AND EIGENVECTORS 3
EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices
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 information