University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 13, 2014
|
|
- Amber Newton
- 6 years ago
- Views:
Transcription
1 University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra PhD Preliminary Exam June 3, 24 Name: Exam Rules: This is a closed book exam Once the exam begins, you have 4 hours to do your best Submit as many solutions as you can All solutions will be graded and your final grade will be based on your six best solutions Each problem is worth 2 points Justify your solutions: cite theorems that you use, provide counter-examples for disproof, give explanations, and show calculations for numerical problems If you are asked to prove a theorem, do not merely quote that theorem as your proof; instead, produce an independent proof Begin each solution on a new page and use additional paper, if necessary Write only on one side of paper Write legibly using a dark pencil or pen Ask the proctor if you have any questions Good luck! Total DO NOT TURN THE PAGE UNTIL TOLD TO DO SO Applied Linear Algebra Preliminary Exam Committee: Joshua French (Chair), Julien Langou, Anatolii Puhalskii
2 Assume the following general definition for a real positive semidefinite matrix: an n n real matrix A is said to be positive semidefinite if and only if, for all vector x in R n, x T Ax In particular, this definition allows real matrices which are not symmetric to be positive semidefinite (a) Prove that if A and B are real symmetric positive semidefinite matrices and matrix A is nonsingular, then AB has only real nonnegative eigenvalues ( pts) (b) Provide a counterexample showing that the requirement that the matrices are symmetric cannot be dropped ( pts) (a) Since A is symmetric positive definite, A /2 and A /2 are well defined The matrix AB has the same eigenvalues as the matrix A /2 ABA /2 = A /2 BA /2 The latter matrix is selfadjoint and positive semidefinite, so it has real nonnegative eigenvalues Note: The result also holds if we remove the assumption of A to be nonsingular In other words, A and B only need to be two n by n symmetric positive semidefinite matrices The proof gets a little trickier though (b) One needs to provide positive semidefinite matrices A and B, A nonsingular, such that AB has an eigenvalue which is not real and nonnegative Given question (a) we understand that either A or B (or both) have to be nonsymmetric To create a positive semidefinite matrix A, one simply takes a symmetric positive definite matrix H and then add an antisymmetric matrix S, then A = H +S is positive semidefinite matrix ( ) ( ) In our case, we can take A = and B = In this case A is positive semidefinite nonsingular, B is positive semidefinite, and AB does not have real nonnegative eigenvalues
3 2 (a) Suppose A and B are real-valued symmetric n n matrices Show that trace (AB) trace (A 2 ) trace (B 2 ) What are the conditions for equality to hold? ( pts) (b) Let A be a real m n matrix Show that ) trace(aa T ) trace( AA T When does equality hold? ( pts) (a) By the Cauchy-Schwarz Theorem, trace (AB) = a ij b ij i,j i,j ij b 2 ij = trace (A 2 ) trace (B 2 ) For equality to hold, one of the matrices has to be a scalar multiple of the other (b) Let AA T = P T DP, where D represents a nonnegative diagonal matrix and P represents an orthogonal matrix Then trace(aa T ) = trace(d) = λ i ( λi ) 2 = (trace(d /2 )) 2 = (trace((aa T ) /2 )) 2 i i i,j The fact that i λ i ( i λi ) 2 comes from developing the square on the right side Equality holds if and only if D has at most one nonzero entry, so AA T has at most one nonzero eigenvalue, so A has at most one nonzero singular value
4 3 Let f : M n (R) M n (R) A A T (a) What are the eigenvalues of f? ( pts) (b) Is f diagonalizable? If yes, give a basis of eigenvectors If no, give as many linearly independent eigenvectors as possible ( pts) It is clear that f 2 = I, therefore p(x) = (x )(x+) is such that p(f) = This implies that the eigenvalues of f are part of the set {, } Also p(f) = implies that f is diagonalizable since p only has single roots Now it is clear that any symmetric matric is eigenvector associated with eigenvalue, andthatan eigenvector associated witheigenvalue isasymmetricmatrix Ifwe call the subspace of symmetric matrices, S n, and E the eigenspace of f associated with eigenvalue, we have S n = E It is also clear that any antisymmetric matric is eigenvector associated with eigenvalue -, and that an eigenvector associated with eigenvalue - is an antisymmetric matrix If we call the subspace of antisymmetric matrices, A n, and E the eigenspace of f associated with eigenvalue, we have A n = E We know that M n = S n A n Therefore we can diagonalize f by taking a basis of S n and a basis of A n to form a basis of M n
5 4 Define the n n matrix a+b b b b b a a+b b b b A n = a a a+b b b a a a a+b b a a a a a+b (a) Compute D n = det(a n ) ( pts) (b) Give the value of D n for n =, a = 2, and b = ( pts) We perform (in this order) L n L n L n, then L n L n L n 2, and finally L 2 L 2 L (These transformations do not change the value of the determinant) We get a+b b b b b b a D n = b a a b a We develop with respect to last column and get D n = ( ) n b b a b a a b +a a+b b b b b a b a b a And so, we get D n = b n +ad n We have D = a+b (Note: We could get D from D = b+ad if we define D to be )
6 So we get D 2 = b 2 +ad = b 2 +ab+ Quick check: D 2 = a+b a b a+b = (a+b)2 ab = b 2 +ab+ So we get D 3 = b 3 +ad 2 = b 3 +ab 2 + b+a 3 Pursuing in an identical manner, we get D n = b n +ab n ++a n b+a n = We can simplify by noticing that So, if a b, we have And, if a = b, we get n a k b n k k= (a b)(b n +ab n ++a n b+a n ) = a n+ b n+ D n = an+ b n+ a b D n = (n+)a n (And we check that the latter expression for a = b is the limit of the expression for a b when b goes to a) For n =, a =, and b = 2, we get ( ) (2) ( ) 2 = = 683
7 5 Suppose that u and v are vectors in a real inner product space V (a) Prove that ( u + v ) u,v u v (b) Prove or disprove the following identity: ( u + v ) u,v u v u+v ( pts) u+v ( pts) (a) Case: u,v Theinequalityfollowstriviallysinceanormisnonnegative Thus, the leftside is no more than while the right side is no less than Case 2: u,v > Squaring the left side we have ( u + v ) 2 u,v u,v u 2 v 2 ( u 2 + v 2 +2 u v ) u,v u v u 2 v 2 () = u v u,v + u,v +2 u,v v u (2) = u v u v + u v +2 u,v v u (3) = u+v 2 (4) Both () and (3) are obtained by applying the Cauchy-Schwarz inequality to u,v, while (2) and (4) are obtained by simplifying (b) Let u = (,), v = (,), and use a Euclidean inner product (dot product) Then the left side of the inequality becomes (+)()() = while the right side is (Note: one can also use one-dimensional vector: u = (), v = ( ))
8 6 Let V be a vector space Let f L(V) Let p be a projection (so p L(V) and is such that p 2 = p) Prove that Null(f p) = Null(p) (Null(f) Range(p)) (2 pts) Firstly, we would like to prove that Null(p) (Null(f) Range(p)) Null(f p) Note: We recall that if A, B and C are subspaces, to prove that A +B C, we just need to prove that A C and B C Null(p) Null(f p) Let x Null(p), then p(x) =, so (f p)(x) =, so x Null(f p) Null(f) Range(p) Null(f p) Letx Null(f) Range(p) Sincex Range(p), there exists y such that x = p(y) Since x Null(f), we have f(x) = Now let us look at (f p)(x) (Note: we want to prove that (f p)(x) = ) We have (f p)(x) = (f p)(p(y)) = f(p 2 (y)) = f(p(y)) = f(x) =, We have used the facts that 2: x = p(y), 3 4: p 2 = p, 4 5: p(y) = x, 5 6: f(x) = This proves that x Null(f p) We proved that (Null(p)+(Null(f) Range(p))) Null(f p) Secondly, we would like to prove that Null(f p) Null(p) (Null(f) Range(p)) Let x Null(f p), we can write x as where x = (x p(x))+p(x), (a) (x p(x)) Null(p) Indeed, p(x p(x)) = p(x) p 2 (x), but p = p 2 so p(x p(x)) =, so (x p(x)) Null(p) (b) p(x) Null(f) Range(p) Itisafactthatp(x) Range(p) Moreover, since x Null(f p), we have that (f p)(x) =, which proves that p(x) Null(f) So p(x) Null(f) Range(p)
9 Therefore we have that At this point, we proved that Null(f p) Null(p)+(Null(f) Range(p)) Null(f p) = Null(p)+(Null(f) Range(p)) It remains to prove that the sum is direct Let x Null(p) (Null(f) Range(p)), then x Range(p), so there exits u V such that x = p(u), but x Null(p), so p(x) =, so p 2 (u) =, but p 2 = p, so p(u) =, so x = We proved that Null(p) (Null(f) Range(p)) = {} so the sum in the previous paragraph is direct We are done and we can conclude that Null(f p) = Null(p) (Null(f) Range(p))
10 7 (a) Let n N\{,} (so n 2) and A M n (C) such that rank(a) = Prove that A is diagonalizable if and only if trace(a) ( pts) (b) Let a,a n C\{}, (so the a i s are nonzero complex numbers,) and A such ( ) ai a j that A = (This means that the entry (i,j) of A is a i i,j n a j ) Show that A is diagonalizable Give a basis of eigenvectors (with the associated eigenvalues) for A ( pts) (a) First we note that rank(a) = dim(null(a)) = n (by the rank theorem) So, if rank(a) = and n 2, then dim(null(a)) and so is an eigenvalue of A We call ν the geometric multiplicity of the eigenvalue, and µ the algebraic multiplicity of the eigenvalue We call E the eigenspace associated with the eigenvalue Now, since dim(null(a)) = n, we have that dim(e ) = n, or in other words, the geometric multiplicity of the eigenvalue, ν, is n We know that, for a given eigenvalue, the algebraic multiplicity is always greater than or equal to the geometric multiplicity For the eigenvalue, this reads: ν µ For a rank matrix, there are therefore only two cases: either ν = µ = n, or ν = n, µ = n case ν = µ = n In this case, since µ = n, there has to exist another eigenvalue λ different from zero (Because the sum of the algebraic multiplicities of the eigenvalues has to sum to n) For that eigenvalue λ, the geometric multiplicity, ν λ, is at least, but can be no more than (because ν = n and the sum of the algebraic multiplicities of two distinct eigenvalues has to be less than n) So ν λ = So we have ν λ = and ν = n, so A is diagonalizable We also note that, in this case, trace(a) = λ, (the trace is the sum of the eigenvalues counted with their multiplicities,) and so, in this case, trace(a) case ν = n,µ = n In this case, since µ = n, A only has the eigenvalue We also have that A is not diagonaliable and that trace(a) = Starting from a rank matrix, we found two possibilities Either ν = µ = n, in which case, A is diagonaliable and trace(a) Or ν = n,µ = n, in which case, A is not diagonaliable and trace(a) = This enables us to conclude that for a rank matrix A is diagonalizable trace(a)
11 (b) We observe that the matrix is of rank Indeed a A = a n a n ( a a n a n ) We also have trace(a) = n So by the previous question, we see that A is diagonalizable (since trace(a) We also see that A has eigenvalue with geometric multiplicity n and eigenvalue n with geometric multiplicity eigenvalue To find n linearly independent eigenvectors associated with eigenvalue, we want to find a basis for the null space of A, which is same as null space of ( ) a a n a n We have (for example) that x is a leading variable, and that x 2, x 3,, x n are free variables This gives for a general solution: a a a 3 a x 2 a a 3 x 3 a a n x n a a nx n x 2 x 3 x n x n = x 2 +x 3 ++x n a a n +x n a a n v = So a basis for E is for example a a a 3, v 2 =, v n 2 = a a n, v n = a a n eigenvalue n We see that an eigenvector for eigenvalue n is for example a v n = a n a n Answer: The above given (v,,v n ) is a basis of C n made of eigenvectors of A
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam January 13, 2014
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam January 13, 2014 Name: Exam Rules: This is a closed book exam. Once the exam
More informationUniversity of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012 Name: Exam Rules: This is a closed book exam. Once the exam
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 informationUniversity of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 10, 2011
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra PhD Preliminary Exam June 2 Name: Exam Rules: This is a closed book exam Once the exam begins you
More informationUniversity of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam January 23, 2015
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra PhD Preliminary Exam January 23, 2015 Name: Exam Rules: This exam lasts 4 hours and consists of
More informationUniversity of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam January 22, 2016
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra PhD Preliminary Exam January 22, 216 Name: Exam Rules: This exam lasts 4 hours There are 8 problems
More informationUniversity of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam May 25th, 2018
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam May 25th, 2018 Name: Exam Rules: This exam lasts 4 hours. There are 8 problems.
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 information80 min. 65 points in total. The raw score will be normalized according to the course policy to count into the final score.
This is a closed book, closed notes exam You need to justify every one of your answers unless you are asked not to do so Completely correct answers given without justification will receive little credit
More informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationMath 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 informationMATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018
Homework #1 Assigned: August 20, 2018 Review the following subjects involving systems of equations and matrices from Calculus II. Linear systems of equations Converting systems to matrix form Pivot entry
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 informationGlossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the
More information1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)
1 A linear system of equations of the form Sections 75, 78 & 81 a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2 a m1 x 1 + a m2 x 2 + + a mn x n = b m can be written in matrix
More informationMA 265 FINAL EXAM Fall 2012
MA 265 FINAL EXAM Fall 22 NAME: INSTRUCTOR S NAME:. There are a total of 25 problems. You should show work on the exam sheet, and pencil in the correct answer on the scantron. 2. No books, notes, or calculators
More 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 informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationMath 314/ Exam 2 Blue Exam Solutions December 4, 2008 Instructor: Dr. S. Cooper. Name:
Math 34/84 - Exam Blue Exam Solutions December 4, 8 Instructor: Dr. S. Cooper Name: Read each question carefully. Be sure to show all of your work and not just your final conclusion. You may not use your
More informationMATH 1553 SAMPLE FINAL EXAM, SPRING 2018
MATH 1553 SAMPLE FINAL EXAM, SPRING 2018 Name Circle the name of your instructor below: Fathi Jankowski Kordek Strenner Yan Please read all instructions carefully before beginning Each problem is worth
More informationMath 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam
Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system
More information5.) For each of the given sets of vectors, determine whether or not the set spans R 3. Give reasons for your answers.
Linear Algebra - Test File - Spring Test # For problems - consider the following system of equations. x + y - z = x + y + 4z = x + y + 6z =.) Solve the system without using your calculator..) Find the
More informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationMath Final December 2006 C. Robinson
Math 285-1 Final December 2006 C. Robinson 2 5 8 5 1 2 0-1 0 1. (21 Points) The matrix A = 1 2 2 3 1 8 3 2 6 has the reduced echelon form U = 0 0 1 2 0 0 0 0 0 1. 2 6 1 0 0 0 0 0 a. Find a basis for the
More 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 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 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 informationRecall the convention that, for us, all vectors are column vectors.
Some linear algebra Recall the convention that, for us, all vectors are column vectors. 1. Symmetric matrices Let A be a real matrix. Recall that a complex number λ is an eigenvalue of A if there exists
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationDIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix
DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that
More informationMATH 304 Linear Algebra Lecture 34: Review for Test 2.
MATH 304 Linear Algebra Lecture 34: Review for Test 2. Topics for Test 2 Linear transformations (Leon 4.1 4.3) Matrix transformations Matrix of a linear mapping Similar matrices Orthogonality (Leon 5.1
More 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 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 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 informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationDefinitions for Quizzes
Definitions for Quizzes Italicized text (or something close to it) will be given to you. Plain text is (an example of) what you should write as a definition. [Bracketed text will not be given, nor does
More 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 informationElementary Linear Algebra Review for Exam 2 Exam is Monday, November 16th.
Elementary Linear Algebra Review for Exam Exam is Monday, November 6th. The exam will cover sections:.4,..4, 5. 5., 7., the class notes on Markov Models. You must be able to do each of the following. Section.4
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 information1. Select the unique answer (choice) for each problem. Write only the answer.
MATH 5 Practice Problem Set Spring 7. Select the unique answer (choice) for each problem. Write only the answer. () Determine all the values of a for which the system has infinitely many solutions: x +
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 informationProblem # Max points possible Actual score Total 120
FINAL EXAMINATION - MATH 2121, FALL 2017. Name: ID#: Email: Lecture & Tutorial: Problem # Max points possible Actual score 1 15 2 15 3 10 4 15 5 15 6 15 7 10 8 10 9 15 Total 120 You have 180 minutes to
More informationMath 554 Qualifying Exam. You may use any theorems from the textbook. Any other claims must be proved in details.
Math 554 Qualifying Exam January, 2019 You may use any theorems from the textbook. Any other claims must be proved in details. 1. Let F be a field and m and n be positive integers. Prove the following.
More informationHomework 11 Solutions. Math 110, Fall 2013.
Homework 11 Solutions Math 110, Fall 2013 1 a) Suppose that T were self-adjoint Then, the Spectral Theorem tells us that there would exist an orthonormal basis of P 2 (R), (p 1, p 2, p 3 ), consisting
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 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 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 informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationThe value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.
Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class
More informationDEPARTMENT OF MATHEMATICS
Name(Last/First): GUID: DEPARTMENT OF MATHEMATICS Ma322005(Sathaye) - Final Exam Spring 2017 May 3, 2017 DO NOT TURN THIS PAGE UNTIL YOU ARE INSTRUCTED TO DO SO. Be sure to show all work and justify your
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 informationExercise Sheet 1.
Exercise Sheet 1 You can download my lecture and exercise sheets at the address http://sami.hust.edu.vn/giang-vien/?name=huynt 1) Let A, B be sets. What does the statement "A is not a subset of B " mean?
More informationft-uiowa-math2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST
me me ft-uiowa-math255 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 2/3/2 at :3pm CST. ( pt) Library/TCNJ/TCNJ LinearSystems/problem3.pg Give a geometric description of the following
More informationMath 205, Summer I, Week 4b: Continued. Chapter 5, Section 8
Math 205, Summer I, 2016 Week 4b: Continued Chapter 5, Section 8 2 5.8 Diagonalization [reprint, week04: Eigenvalues and Eigenvectors] + diagonaliization 1. 5.8 Eigenspaces, Diagonalization A vector v
More information6 Inner Product Spaces
Lectures 16,17,18 6 Inner Product Spaces 6.1 Basic Definition Parallelogram law, the ability to measure angle between two vectors and in particular, the concept of perpendicularity make the euclidean space
More informationHW2 - Due 01/30. Each answer must be mathematically justified. Don t forget your name.
HW2 - Due 0/30 Each answer must be mathematically justified. Don t forget your name. Problem. Use the row reduction algorithm to find the inverse of the matrix 0 0, 2 3 5 if it exists. Double check your
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
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 informationFinal A. Problem Points Score Total 100. Math115A Nadja Hempel 03/23/2017
Final A Math115A Nadja Hempel 03/23/2017 nadja@math.ucla.edu Name: UID: Problem Points Score 1 10 2 20 3 5 4 5 5 9 6 5 7 7 8 13 9 16 10 10 Total 100 1 2 Exercise 1. (10pt) Let T : V V be a linear transformation.
More informationMATH 369 Linear Algebra
Assignment # Problem # A father and his two sons are together 00 years old. The father is twice as old as his older son and 30 years older than his younger son. How old is each person? Problem # 2 Determine
More informationChapter 3. Matrices. 3.1 Matrices
40 Chapter 3 Matrices 3.1 Matrices Definition 3.1 Matrix) A matrix A is a rectangular array of m n real numbers {a ij } written as a 11 a 12 a 1n a 21 a 22 a 2n A =.... a m1 a m2 a mn The array has m rows
More informationSummer Session Practice Final Exam
Math 2F Summer Session 25 Practice Final Exam Time Limit: Hours Name (Print): Teaching Assistant This exam contains pages (including this cover page) and 9 problems. Check to see if any pages are missing.
More informationExample: Filter output power. maximization. Definition. Eigenvalues, eigenvectors and similarity. Example: Stability of linear systems.
Lecture 2: Eigenvalues, eigenvectors and similarity The single most important concept in matrix theory. German word eigen means proper or characteristic. KTH Signal Processing 1 Magnus Jansson/Emil Björnson
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 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 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 information(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =
. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)
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 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 informationLinear Algebra problems
Linear Algebra problems 1. Show that the set F = ({1, 0}, +,.) is a field where + and. are defined as 1+1=0, 0+0=0, 0+1=1+0=1, 0.0=0.1=1.0=0, 1.1=1.. Let X be a non-empty set and F be any field. Let X
More informationMATH 260 LINEAR ALGEBRA EXAM III Fall 2014
MAH 60 LINEAR ALGEBRA EXAM III Fall 0 Instructions: the use of built-in functions of your calculator such as det( ) or RREF is permitted ) Consider the table and the vectors and matrices given below Fill
More informationFamily Feud Review. Linear Algebra. October 22, 2013
Review Linear Algebra October 22, 2013 Question 1 Let A and B be matrices. If AB is a 4 7 matrix, then determine the dimensions of A and B if A has 19 columns. Answer 1 Answer A is a 4 19 matrix, while
More informationq n. Q T Q = I. Projections Least Squares best fit solution to Ax = b. Gram-Schmidt process for getting an orthonormal basis from any basis.
Exam Review Material covered by the exam [ Orthogonal matrices Q = q 1... ] q n. Q T Q = I. Projections Least Squares best fit solution to Ax = b. Gram-Schmidt process for getting an orthonormal basis
More informationMATH 223 FINAL EXAM APRIL, 2005
MATH 223 FINAL EXAM APRIL, 2005 Instructions: (a) There are 10 problems in this exam. Each problem is worth five points, divided equally among parts. (b) Full credit is given to complete work only. Simply
More informationThe Singular Value Decomposition
The Singular Value Decomposition Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) SVD Fall 2015 1 / 13 Review of Key Concepts We review some key definitions and results about matrices that will
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 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION
MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether
More informationSolutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015
Solutions to Final Practice Problems Written by Victoria Kala vtkala@math.ucsb.edu Last updated /5/05 Answers This page contains answers only. See the following pages for detailed solutions. (. (a x. See
More informationMATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003
MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003 1. True or False (28 points, 2 each) T or F If V is a vector space
More informationMathematical Methods for Engineers 1 (AMS10/10A)
Mathematical Methods for Engineers 1 (AMS10/10A) Quiz 5 - Friday May 27th (2016) 2:00-3:10 PM AMS 10 AMS 10A Name: Student ID: Multiple Choice Questions (3 points each; only one correct answer per question)
More 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 informationMidterm 2 Solutions, MATH 54, Linear Algebra and Differential Equations, Fall 2014
Name (Last, First): Student ID: Circle your section: 2 Shin 8am 7 Evans 22 Lim pm 35 Etcheverry 22 Cho 8am 75 Evans 23 Tanzer 2pm 35 Evans 23 Shin 9am 5 Latimer 24 Moody 2pm 8 Evans 24 Cho 9am 254 Sutardja
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 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 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 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 informationNotes on Linear Algebra and Matrix Theory
Massimo Franceschet featuring Enrico Bozzo Scalar product The scalar product (a.k.a. dot product or inner product) of two real vectors x = (x 1,..., x n ) and y = (y 1,..., y n ) is not a vector but a
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 informationDEPARTMENT OF MATHEMATICS
DEPARTMENT OF MATHEMATICS Ma322 - Final Exam Spring 2011 May 3,4, 2011 DO NOT TURN THIS PAGE UNTIL YOU ARE INSTRUCTED TO DO SO. Be sure to show all work and justify your answers. There are 8 problems and
More informationLinear Algebra- Final Exam Review
Linear Algebra- Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.
More informationSTAT200C: Review of Linear Algebra
Stat200C Instructor: Zhaoxia Yu STAT200C: Review of Linear Algebra 1 Review of Linear Algebra 1.1 Vector Spaces, Rank, Trace, and Linear Equations 1.1.1 Rank and Vector Spaces Definition A vector whose
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 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 informationMATH 1553 PRACTICE FINAL EXAMINATION
MATH 553 PRACTICE FINAL EXAMINATION Name Section 2 3 4 5 6 7 8 9 0 Total Please read all instructions carefully before beginning. The final exam is cumulative, covering all sections and topics on the master
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 information2 Eigenvectors and Eigenvalues in abstract spaces.
MA322 Sathaye Notes on Eigenvalues Spring 27 Introduction In these notes, we start with the definition of eigenvectors in abstract vector spaces and follow with the more common definition of eigenvectors
More informationMATH 235. Final ANSWERS May 5, 2015
MATH 235 Final ANSWERS May 5, 25. ( points) Fix positive integers m, n and consider the vector space V of all m n matrices with entries in the real numbers R. (a) Find the dimension of V and prove your
More informationThe eigenvalues are the roots of the characteristic polynomial, det(a λi). We can compute
A. [ 3. Let A = 5 5 ]. Find all (complex) eigenvalues and eigenvectors of The eigenvalues are the roots of the characteristic polynomial, det(a λi). We can compute 3 λ A λi =, 5 5 λ from which det(a λi)
More information