Eigenpairs and Similarity Transformations
|
|
- Emory Morgan
- 5 years ago
- Views:
Transcription
1 CHAPTER 5 Eigenpairs and Similarity Transformations Exercise 56: Characteristic polynomial of transpose we have that A T ( )=det(a T I)=det((A I) T )=det(a I) = A ( ) A ( ) = det(a I) =det(a T I) =det(a T I)= A T ( )= A ( ) Exercise 57: Characteristic polynomial of inverse If Ax = x we have that A ( x) =x, sothata x = x,sothat(, x) is an eigenpair for A A k x = A k Ax = A k A x = A k A x = = k x Exercise 58: The power of the eigenvector expansion If the eigenvectors form a basis we can write x = c j x j for some scalars c,,c n Butthen Ax = c j Ax j = c j j x j Iterating this we obtain A k k x = c j Ax j = c j j x j Exercise 59: Idempotent matrix Suppose that (, x) isaneigenpairofamatrixa satisfying A = A Then x = Ax = A x = Ax = x Since any eigenvector is nonzero, one has =,fromwhichitfollowsthateither =0or = Weconcludethattheeigenvaluesofanyidempotentmatrixcanonly be zero or one 5
2 Exercise 50: Nilpotent matrix Suppose that (, x) isaneigenpairofamatrixa satisfying A k = 0 for some natural number k Then 0 = A k x = A k x = A k x = = k x Since any eigenvector is nonzero, one has k =0,fromwhichitfollowsthat =0 We conclude that any eigenvalue of a nilpotent matrix is zero Exercise 5: Eigenvalues of a unitary matrix Let x be an eigenvector corresponding to ThenAx = x and, as a consequence, x A = x To use that A A = I, itistemptingtomultiplythelefthandsidesof these equations, yielding kxk = x x = x A Ax = x Ix = kxk Since x is an eigenvector, it must be nonzero Nonzero vectors have nonzero norms, and we can therefore divide the above equation by kxk,whichresultsin = Taking square roots we find that =, which is what needed to be shown Apparently the eigenvalues of any unitary matrix reside on the unit circle in the complex plane Exercise 5: Nonsingular approximation of a singular matrix Let,, n be the eigenvalues of the matrix A As the matrix A is singular, its determinant det(a) = n is zero, implying that one of its eigenvalues is zero If all the eigenvalues of A are zero let " 0 := Otherwise, let " 0 := min i 6=0 i be the absolute value of the eigenvalue closest to zero By definition of the eigenvalues, det(a I) iszerofor =,, n, andnonzerootherwise Inparticulardet(A "I) is nonzero for any " (0," 0 ), and A "I will be nonsingular in this interval This is what we needed to prove (a) To show that ( need to compute A ( ) = det(a Exercise 5: Companion matrix ) n f is the characteristic polynomial A of the matrix A, we I) = det 6 4 q n q n q q By the rules of determinant evaluation, we can substract from any column a linear combination of the other columns without changing the value of the determinant Multiply columns,,,n by n n,,, and adding the corresponding linear combination to the final column, we find q n q n q f( ) 0 0 A ( ) = det =( )n f( ),
3 where the second equality follows from cofactor expansion along the final column Multiplying this equation by ( ) n yields the statement of the Exercise (b) Similar to (a), by multiplying rows,,,nby, n,, and adding the corresponding linear combination to the first row Exercise 57: Find eigenpair example As A is a triangular matrix, its eigenvalues correspond to the diagonal entries One finds two eigenvalues =and =,thelatterwithalgebraicmultiplicitytwo Solving Ax = x and Ax = x, one finds (valid choices of) eigenpairs, for instance (, x )=(, 4 05), (, x )=(, 4 5) 0 0 It follows that the eigenvectors span a space of dimension, and this means that A is defective Exercise 5: Jordan example This exercise shows that it matters in which order we solve for the columns of S One would here need to find the second column first before solving for the other two The matrices given are A = , J = , we are asked to find S =[s, s, s ]satisfying [As, As, As ]=AS = SJ =[s, s, s ]J = s, s + s, s The equations for the first and third columns say that s and s are eigenvectors for =,sothattheycanbefoundbyrowreducinga I: A I = (, 0, ) T and (0,, 0) T thus span the set of eigenvectors for = s can be found by solving As = s + s,sothat(a I)s = s This means that (A I) s =(A I)s = 0, sothats ker(a I) A simple computation shows that (A I) =0sothatanys will do, but we must also choose s so that (A I)s = s is an eigenvector of A Since A I has rank one, we may choose any s so that (A I)s is nonzero In particular we can choose s = e,andthen s =(A I)s =(, 4, 4) T We can also choose s =(0,, 0) T,sinceitisaneigenvectornotspannedbythes and s which we just defined All this means that we can set S =
4 Exercise 5: A nilpotent matrix applewe show this by induction For r = the statement is obvious Define E r = 0 Im r Wehavethat 0 0 (E E r ) i,j = X k (E ) i,k (E r ) k,j In the sum on the right hand side only one term can contribute (since any row/column in E and E r contains only one nonzero entry, being a one) This occurs when there is a k so that k = i +,k + r = j, ie whenj = i + r + E r+ has all nonzero entries when j = i + r +,andthisprovesthate r+ = E E r Itnowfollowsthat (J m ( ) I) r+ =(J m ( ) I)(J m ( ) I) r = E E r = E r+, and the result follows Exercise 54: Properties of the Jordan form Let J = S AS be the Jordan form of the matrix A as in Theorem 59 Items are easily shown by induction, making use of the rules of block multiplication in and For Item 4, write E m := J m ( ) I m,withj m ( ) the Jordan block of order m By the binomial theorem, rx r rx r J m ( ) r =(E m + I m ) r = E k k m( I m ) r k r = k E k k m Since E k m = 0 for any k J m ( ) r = min{r,m } X k=0 k=0 m, weobtain r k r k E k m k=0 Exercise 55: Powers of a Jordan block Let S be as in Exercise 5 J is block-diagonal so that we can write (?) J n = 4 0 n apple n 0 05 = = 4 n , n 0 0 where we used property 4 in exercise 54 on the upper left block It follows that A 00 =(SJS ) 00 = SJ 00 S = = =
5 Exercise 56: The minimal polynomial For each i, ( i ) a i = ( i ) P g i m i,j divides A ( ) Since P g i m i,j max applejapplegi m i,j = m i,also( i ) m i divides A ( ) From this it follows that also µ A ( )divides A ( ) We have that µ A (A) = = S ( i I A) m i = ( i I SJS ) m i ( i I J) m i S = Sµ A (J)S It follows that µ A (A) =0 if and only if µ A (J) =0 We have that µ A (J) = = Now we also have ( i I J) m i = (diag( i I U,,( i I U )) m i (diag(( i I U ) m i,,( i I U ) m i ) =diag ( i I U ) m i,, ( i I U k ) m i ( i I U i ) m i =( i I diag(j mi, ( i ),,J mi,gi ( i ))) m i since =diag( i I J mi, ( i ),, ii J mi,gi ( i )) m i =diag(( i I J mi, ( i )) m i,,( i I J mi,gi ( i )) m i )=0, ( i I J mi,j ( i )) m i =( i I J mi,j ( i )) m i,j ( i I J mi, ( i )) m i m i,j We now get that ( i I U j ) m i =( j I U j ) m j so that µ A (J) =diag = 0( i I J mi, ( i )) m i m i,j = 0,i6=j ( i I U ) m i,, ( i I U j ) m i = 0, ( i I U k ) m i = 0 It follows that µ A (A) =0 Suppose now that p(a) =0 We can write p(a) =C Q r (k ii A) s i,wherek i are the zeros of p, withmultiplicitys i As above it follows that p(a) =0 if and only 9
6 if p(j) =0 Factorp(J) asabovetoobtain ry p(j) = diag (k i I U ) s i,, (k i I U k ) s i Note that k i I U j =diag(k i I J mj, ( j ),,k i I J mj,gj ( j )) is upper triangular with k i j on the diagonal If k i 6= j k i I U j must then be invertible, but then also (k i I U j ) s i is invertible In order for p(j) =0 we must then have that, for each j there exists a t so that k t = j The qth diagonal block entry in (k i I U j ) s i are ry ry (k i I J mj,q ( j )) s i =(k t I J mj,q ( j )) st (k i I J mj,q ( j )) s i,i6=t =( j I J mj,q ( j )) st ry,i6=t (k i I J mj,q ( j )) s i The last matrix here is invertible (all k i 6= j wjhen i 6= t), so that we must have that ( j I J mj,q ( j )) st = 0 in order for p(j) =0 We know from the exercises that this happens only when s t m j,q Sinceqwas arbitrary we obtain that s t m j,ie that j is a zero in p of multiplicity m j Since this applied for any j, itfollowsthatthe minimal polynomial divides p, andtheresultfollows 4 We have that A (A) =µ A (A) A (A) =0 Exercise 57: Big Jordan example The matrix A has Jordan form A = SJS,with J = , S = Exercise 50: Schur decomposition example The matrix U is unitary, as U U = U T U = I One directly verifies that apple R := U T AU = 0 4 Since this matrix is upper triangular, A = URU T is a Schur decomposition of A 0
7 Exercise 54: Skew-Hermitian matrix By definition, a matrix C is skew-hermitian if C = C =) : Suppose that C = A + ib, witha, B R m,m, is skew-hermitian Then A ib = C = C =(A + ib) = A T ib T, which implies that A T = A and B = B T (use that two complex numbers coincide if and only if their real parts coincide and their imaginary parts coincide) In other words, A is skew-hermitian and B is real symmetric (= : Suppose that we are given matrices A, B R m,m such that A is skew- Hermitian and B is real symmetric Let C = A + ib Then C =(A + ib) = A T ib T = A ib = (A + ib) = C, meaning that C is skew-hermitian Exercise 55: Eigenvalues of a skew-hermitian matrix Let A be a skew-hermitian matrix and consider a Schur triangularization A = URU of A Then R = U AU = U ( A )U = U A U = (U AU) = R Since R di ers from A by a similary transform, their eigenvalues coincide (use the multiplicative property of the determinant to show that det(a I) =det(u )det(uru I)) det(u) =det(r I)) As R is a triangular matrix, its eigenvalues i appear on its diagonal From the equation R = R it then follows that i = i, implyingthateach i is purely imaginary Exercise 56: Eigenvector expansion using orthogonal eigenvectors If x = P n c ju j and the eigenvectors are orthogonal we get that u i x = c j u i u j = c i u i u i, so that c i = u i x/(u i u i ) Exercise??: Left Eigenpairs If y A = y we get that (y A) = A y = y, sothat(, y) isaneigenpairfor A,sothat is an eigenvalue for A Thereisnoreasontobelieve,however,thatA and A have the same eigenvectors If the matrix is hermitian this is clearly the case Assume that (y, ) isalefteigenpairofa, and(x, ) isarighteigenpairof A, andsothat 6= Wehavethat y x = y Ax = y x, so that ( )y x =0,sothaty x =0,sothatx and y are orthogonal If A has a basis of right eigenvectors then it is diagonalizable, so that A = PDP,wherethecolumnsinPare x i We also have that A =(P ) D P The columns of (P ) are thus right eigenvectors for A,andthuslefteigenvectorsy i for A We now get that yi x j is the ij-entry in the matrix product ((P ) ) P = P P = I, and the result follows
8 The coordinates of v in the basis x j is P vsincetherowsinp are the conjugate of the columns in (P ),thesecoordinatesareyj v This proves that v = (yj v)x j The coordinates of v in the basis y j is P vsincetherowsinp are the conjugate of the columns in P, thesecoordinatesarex kv This proves that v = (x kv)x k, k= and this completes the proof 4 We have that A ( )=( )( ) = 5 +4,sothattheeigenvalues are =4and = Arighteigenvectorfor =4canbefoundfrom, 0 0 so that we can use x =(, ) A right eigenvector for 0 0, so that we can use x =(, ) Alefteigenvectorfor =4canbefoundfrom, 0 0 so that we can use y =(, ) A left eigenvector for 0 0, =canbefoundfrom =canbefoundfrom so that we can use x =(, ) We see that yx ==yx =,sothatthetwoexpansionsare v = yj vx j = y kvx k k= Exercise 546: Eigenvalue perturbation for Hermitian matrices Since a positive semidefinite matrix has no negative eigenvalues, one has n 0 It immediately follows from i + n apple i that in this case i i Exercise 548: Ho man-wielandt The matrix A has eigenvalues 0 and 4, and the matrix B has eigenvalue 0 with algebraic multiplicity two Independently of the choice of the permutation i,,i n,the Ho man-wielandt Theorem would yield 6 = µ ij j apple a ij b ij =,
9 which clearly cannot be valid The Ho man-wielandt Theorem cannot be applied to these matrices, because B is not normal, B H B = 6= = BB H Exercise 55: Biorthogonal expansion The matrix A has characteristic polynomial det(a I) =( 4)( ) and right eigenpairs (, x )=(4,[, ] T )and(, x )=(,[, ] T ) Since the right eigenvectors x, x are linearly independent, there exists vectors y, y satisfying hy i, x j i = ij Avectororthogonaltox must be on the form y = [, ] T, and a vector orthogonal to x =[, ] T must be on the form y = [, ] T These choices secure that hy i, x j i =0wheni6= j Wealsomusthavethat =hy, x i = + = = hy, x i = + =, so that = =/, and we can choose the dual basis as y = [, ]T and y = [, ]T Equation(5)thengivesusthebiorthogonalexpansions v = hv, y ix + hv, y ix = (v + v )x + (v v )x = hv, x iy + hv, x iy =(v + v )y +(v v )y Exercise 554: Generalized Rayleigh quotient Suppose (, x) isarighteigenpairfora, sothatax = x Then the generalized Rayleight quotient for A is R(y, x) := y Ax y x = y x y x =, which is well defined whenever y x 6= 0 Ontheotherhand,if(, y) isalefteigenpair for A, theny A = y and it follows that R(y, x) := y Ax y x = y x y x =
Eigenvalues and eigenvectors
Chapter 6 Eigenvalues and eigenvectors An eigenvalue of a square matrix represents the linear operator as a scaling of the associated eigenvector, and the action of certain matrices on general vectors
More informationNumerical Linear Algebra A Solution Manual. Georg Muntingh and Christian Schulz
Numerical Linear Algebra A Solution Manual Georg Muntingh and Christian Schulz Contents Chapter A Short Review of Linear Algebra Exercise 5: The inverse of a general matrix Exercise 6: The inverse of
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 16: Eigenvalue Problems; Similarity Transformations Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 18 Eigenvalue
More informationComputational Methods CMSC/AMSC/MAPL 460. Eigenvalues and Eigenvectors. Ramani Duraiswami, Dept. of Computer Science
Computational Methods CMSC/AMSC/MAPL 460 Eigenvalues and Eigenvectors Ramani Duraiswami, Dept. of Computer Science Eigen Values of a Matrix Recap: A N N matrix A has an eigenvector x (non-zero) with corresponding
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationEigenvalue and Eigenvector Problems
Eigenvalue and Eigenvector Problems An attempt to introduce eigenproblems Radu Trîmbiţaş Babeş-Bolyai University April 8, 2009 Radu Trîmbiţaş ( Babeş-Bolyai University) Eigenvalue and Eigenvector Problems
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationLecture 10 - Eigenvalues problem
Lecture 10 - Eigenvalues problem Department of Computer Science University of Houston February 28, 2008 1 Lecture 10 - Eigenvalues problem Introduction Eigenvalue problems form an important class of problems
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis (Numerical Linear Algebra for Computational and Data Sciences) Lecture 14: Eigenvalue Problems; Eigenvalue Revealing Factorizations Xiangmin Jiao Stony Brook University Xiangmin
More informationReview problems for MA 54, Fall 2004.
Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on
More informationLecture notes on Quantum Computing. Chapter 1 Mathematical Background
Lecture notes on Quantum Computing Chapter 1 Mathematical Background Vector states of a quantum system with n physical states are represented by unique vectors in C n, the set of n 1 column vectors 1 For
More informationSynopsis of Numerical Linear Algebra
Synopsis of Numerical Linear Algebra Eric de Sturler Department of Mathematics, Virginia Tech sturler@vt.edu http://www.math.vt.edu/people/sturler Iterative Methods for Linear Systems: Basics to Research
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 informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationEIGENVALUE PROBLEMS. Background on eigenvalues/ eigenvectors / decompositions. Perturbation analysis, condition numbers..
EIGENVALUE PROBLEMS Background on eigenvalues/ eigenvectors / decompositions Perturbation analysis, condition numbers.. Power method The QR algorithm Practical QR algorithms: use of Hessenberg form and
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationApplied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.2: Fundamentals 2 / 31 Eigenvalues and Eigenvectors Eigenvalues and eigenvectors of
More informationChapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in
Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationMath 489AB Exercises for Chapter 2 Fall Section 2.3
Math 489AB Exercises for Chapter 2 Fall 2008 Section 2.3 2.3.3. Let A M n (R). Then the eigenvalues of A are the roots of the characteristic polynomial p A (t). Since A is real, p A (t) is a polynomial
More informationContents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2
Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationChapter 3. Determinants and Eigenvalues
Chapter 3. Determinants and Eigenvalues 3.1. Determinants With each square matrix we can associate a real number called the determinant of the matrix. Determinants have important applications to the theory
More informationLinGloss. A glossary of linear algebra
LinGloss A glossary of linear algebra Contents: Decompositions Types of Matrices Theorems Other objects? Quasi-triangular A matrix A is quasi-triangular iff it is a triangular matrix except its diagonal
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 informationUniversity of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm
University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm Name: The proctor will let you read the following conditions
More informationEigenvalues and Eigenvectors
Chapter 1 Eigenvalues and Eigenvectors Among problems in numerical linear algebra, the determination of the eigenvalues and eigenvectors of matrices is second in importance only to the solution of linear
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationDiagonalizing Matrices
Diagonalizing Matrices Massoud Malek A A Let A = A k be an n n non-singular matrix and let B = A = [B, B,, B k,, B n ] Then A n A B = A A 0 0 A k [B, B,, B k,, B n ] = 0 0 = I n 0 A n Notice that A i B
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
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 informationLecture Notes for Inf-Mat 3350/4350, Tom Lyche
Lecture Notes for Inf-Mat 3350/4350, 2007 Tom Lyche August 5, 2007 2 Contents Preface vii I A Review of Linear Algebra 1 1 Introduction 3 1.1 Notation............................... 3 2 Vectors 5 2.1 Vector
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationLinear Algebra Lecture Notes-II
Linear Algebra Lecture Notes-II Vikas Bist Department of Mathematics Panjab University, Chandigarh-64 email: bistvikas@gmail.com Last revised on March 5, 8 This text is based on the lectures delivered
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationLecture Notes in Linear Algebra
Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationMath Homework 8 (selected problems)
Math 102 - Homework 8 (selected problems) David Lipshutz Problem 1. (Strang, 5.5: #14) In the list below, which classes of matrices contain A and which contain B? 1 1 1 1 A 0 0 1 0 0 0 0 1 and B 1 1 1
More informationThe Eigenvalue Problem: Perturbation Theory
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 13 Notes These notes correspond to Sections 7.2 and 8.1 in the text. The Eigenvalue Problem: Perturbation Theory The Unsymmetric Eigenvalue Problem Just
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More information1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true?
. Let m and n be two natural numbers such that m > n. Which of the following is/are true? (i) A linear system of m equations in n variables is always consistent. (ii) A linear system of n equations in
More informationa 11 a 12 a 11 a 12 a 13 a 21 a 22 a 23 . a 31 a 32 a 33 a 12 a 21 a 23 a 31 a = = = = 12
24 8 Matrices Determinant of 2 2 matrix Given a 2 2 matrix [ ] a a A = 2 a 2 a 22 the real number a a 22 a 2 a 2 is determinant and denoted by det(a) = a a 2 a 2 a 22 Example 8 Find determinant of 2 2
More 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 informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationI. Multiple Choice Questions (Answer any eight)
Name of the student : Roll No : CS65: Linear Algebra and Random Processes Exam - Course Instructor : Prashanth L.A. Date : Sep-24, 27 Duration : 5 minutes INSTRUCTIONS: The test will be evaluated ONLY
More informationMatrix Operations: Determinant
Matrix Operations: Determinant Determinants Determinants are only applicable for square matrices. Determinant of the square matrix A is denoted as: det(a) or A Recall that the absolute value of the determinant
More informationG1110 & 852G1 Numerical Linear Algebra
The University of Sussex Department of Mathematics G & 85G Numerical Linear Algebra Lecture Notes Autumn Term Kerstin Hesse (w aw S w a w w (w aw H(wa = (w aw + w Figure : Geometric explanation of the
More informationc c c c c c c c c c a 3x3 matrix C= has a determinant determined by
Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.
More 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 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 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 informationLinear Algebra, part 2 Eigenvalues, eigenvectors and least squares solutions
Linear Algebra, part 2 Eigenvalues, eigenvectors and least squares solutions Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2013 Main problem of linear algebra 2: Given
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 information3 (Maths) Linear Algebra
3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra
More informationLecture notes: Applied linear algebra Part 1. Version 2
Lecture notes: Applied linear algebra Part 1. Version 2 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 1 Notation, basic notions and facts 1.1 Subspaces, range and
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationCheat Sheet for MATH461
Cheat Sheet for MATH46 Here is the stuff you really need to remember for the exams Linear systems Ax = b Problem: We consider a linear system of m equations for n unknowns x,,x n : For a given matrix A
More informationA Brief Outline of Math 355
A Brief Outline of Math 355 Lecture 1 The geometry of linear equations; elimination with matrices A system of m linear equations with n unknowns can be thought of geometrically as m hyperplanes intersecting
More informationLinear Algebra Practice Problems
Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,
More 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 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 information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More informationHomework 1 Elena Davidson (B) (C) (D) (E) (F) (G) (H) (I)
CS 106 Spring 2004 Homework 1 Elena Davidson 8 April 2004 Problem 1.1 Let B be a 4 4 matrix to which we apply the following operations: 1. double column 1, 2. halve row 3, 3. add row 3 to row 1, 4. interchange
More information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More informationControl Systems. Linear Algebra topics. L. Lanari
Control Systems Linear Algebra topics L Lanari outline basic facts about matrices eigenvalues - eigenvectors - characteristic polynomial - algebraic multiplicity eigenvalues invariance under similarity
More informationMATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.
MATH 311-504 Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. Determinant is a scalar assigned to each square matrix. Notation. The determinant of a matrix A = (a ij
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 informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko
More informationHOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION)
HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION) PROFESSOR STEVEN MILLER: BROWN UNIVERSITY: SPRING 2007 1. CHAPTER 1: MATRICES AND GAUSSIAN ELIMINATION Page 9, # 3: Describe
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationMath 215 HW #11 Solutions
Math 215 HW #11 Solutions 1 Problem 556 Find the lengths and the inner product of 2 x and y [ 2 + ] Answer: First, x 2 x H x [2 + ] 2 (4 + 16) + 16 36, so x 6 Likewise, so y 6 Finally, x, y x H y [2 +
More information18.06SC Final Exam Solutions
18.06SC Final Exam Solutions 1 (4+7=11 pts.) Suppose A is 3 by 4, and Ax = 0 has exactly 2 special solutions: 1 2 x 1 = 1 and x 2 = 1 1 0 0 1 (a) Remembering that A is 3 by 4, find its row reduced echelon
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 informationGlossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationlinearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice
3. Eigenvalues and Eigenvectors, Spectral Representation 3.. Eigenvalues and Eigenvectors A vector ' is eigenvector of a matrix K, if K' is parallel to ' and ' 6, i.e., K' k' k is the eigenvalue. If is
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW JC Stuff you should know for the exam. 1. Basics on vector spaces (1) F n is the set of all n-tuples (a 1,... a n ) with a i F. It forms a VS with the operations of + and scalar multiplication
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More information2 b 3 b 4. c c 2 c 3 c 4
OHSx XM511 Linear Algebra: Multiple Choice Questions for Chapter 4 a a 2 a 3 a 4 b b 1. What is the determinant of 2 b 3 b 4 c c 2 c 3 c 4? d d 2 d 3 d 4 (a) abcd (b) abcd(a b)(b c)(c d)(d a) (c) abcd(a
More informationProblem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show
MTH 0: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur Problem Set Problems marked (T) are for discussions in Tutorial sessions (T) If A is an m n matrix,
More informationChapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015
Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 205. If A is a 3 3 triangular matrix, explain why det(a) is equal to the product of entries on the diagonal. If A is a lower triangular or diagonal
More informationSECTIONS 5.2/5.4 BASIC PROPERTIES OF EIGENVALUES AND EIGENVECTORS / SIMILARITY TRANSFORMATIONS
SECINS 5/54 BSIC PRPERIES F EIGENVUES ND EIGENVECRS / SIMIRIY RNSFRMINS Eigenvalues of an n : there exists a vector x for which x = x Such a vector x is called an eigenvector, and (, x) is called an eigenpair
More informationANSWERS. E k E 2 E 1 A = B
MATH 7- Final Exam Spring ANSWERS Essay Questions points Define an Elementary Matrix Display the fundamental matrix multiply equation which summarizes a sequence of swap, combination and multiply operations,
More informationMatrix Algebra: Summary
May, 27 Appendix E Matrix Algebra: Summary ontents E. Vectors and Matrtices.......................... 2 E.. Notation.................................. 2 E..2 Special Types of Vectors.........................
More informationReview of some mathematical tools
MATHEMATICAL FOUNDATIONS OF SIGNAL PROCESSING Fall 2016 Benjamín Béjar Haro, Mihailo Kolundžija, Reza Parhizkar, Adam Scholefield Teaching assistants: Golnoosh Elhami, Hanjie Pan Review of some mathematical
More informationACM 104. Homework Set 5 Solutions. February 21, 2001
ACM 04 Homework Set 5 Solutions February, 00 Franklin Chapter 4, Problem 4, page 0 Let A be an n n non-hermitian matrix Suppose that A has distinct eigenvalues λ,, λ n Show that A has the eigenvalues λ,,
More informationMTH 102: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur. Problem Set
MTH 102: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur Problem Set 6 Problems marked (T) are for discussions in Tutorial sessions. 1. Find the eigenvalues
More informationforms Christopher Engström November 14, 2014 MAA704: Matrix factorization and canonical forms Matrix properties Matrix factorization Canonical forms
Christopher Engström November 14, 2014 Hermitian LU QR echelon Contents of todays lecture Some interesting / useful / important of matrices Hermitian LU QR echelon Rewriting a as a product of several matrices.
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
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 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 informationEIGENVALUE PROBLEMS. EIGENVALUE PROBLEMS p. 1/4
EIGENVALUE PROBLEMS EIGENVALUE PROBLEMS p. 1/4 EIGENVALUE PROBLEMS p. 2/4 Eigenvalues and eigenvectors Let A C n n. Suppose Ax = λx, x 0, then x is a (right) eigenvector of A, corresponding to the eigenvalue
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 informationLinear Algebra Review
Chapter 1 Linear Algebra Review It is assumed that you have had a course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc. I will review some of these terms here, but quite
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 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 information