The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression


 Hillary Cobb
 1 years ago
 Views:
Transcription
1 The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression The SVD is the most generally applicable of the orthogonaldiagonalorthogonal type matrix decompositions Every matrix, even nonsquare, has an SVD The SVD contains a great deal of information and is very useful as a theoretical and practical tool ******************************************************************* 1 Preliminaries Unless otherwise indicated, all vectors are column vectors u 1 u R n u 2 = u =. Rn 1 u n 1
2 Definition 1.1 Let u R n, so that u =(u 1,u 2,...u n ) T. The (Euclidean) norm of u is defined as ( n ) 1/2 u 2 = u u u2 n = u 2 j j=1 Definition 1.2 A vector u R n is a unit vector or normalized if u 2 = 1 Definition 1.3 Let A =(a ij ) R m n. The transpose A T (a ji ) R n m. of A is the matrix Example 1.4 ( ) T =
3 Definition 1.5 (Matrix Multiplication) Let A R m n,b R n p. Then the product AB is defined elementwise as (AB) ij = n a ik b kj k=1 and the matrix AB R m p Definition 1.6 Let u, v R n. Then the inner product of u and v, written u, v is defined as n u, v = u j v j = u T v j=1 Note that this notation permits us to write matrix multiplication as entrywise inner products of the rows and columns of the matrices If we denote the i th row of A by i A and the j th column of B by B j we have (AB) ij = ( i A) T,B j = i AB j 3
4 Example 1.7 ( ) = 1 (2) + 1 (0) + 0 (6) 1 (3) + 1 ( 2)+0 ( 3) 3 (2) + 2 (0) + 1 (6) 3 (3) + 2 ( 2)+1 ( 3) = ( ) Definition 1.8 Two vectors u, v R n are orthogonal if u, v = u T v = ( ) v 2 u 1 u 2 u n. v 1 v n = u 1 v 1 + u 2 v u n v n = 0 If u, v are orthogonal and both u 2 =1and v 2 =1, then we say u and v are orthonormal 4
5 Recall that the ndimensional identity matrix is I n = We ll write I for the identity matrix when the size is clear from the context. Definition 1.9 A square matrix Q R n n is orthogonal if Q T Q = I. This definition means that the columns of an orthogonal matrix A are mutually orthogonal unit vectors in R n Alternatively, the columns of A are an orthonormal basis for R n Now Definition 1.9 shows that Q T is the leftinverse of Q 5
6 But since matrix multiplication is associative, Q T is the rightinverse (and hence the inverse) of Q  indeed, let P be a rightinverse of Q (so that QP = I); then (Q T Q)P = Q T (QP ) IP = Q T I P = Q T The SVD is applicable to even nonsquare matrices with complex entries, but for clarity we will restrict our initial treatment to real square matrices ******************************************************************* 2 Structure of the SVD Definition 2.1 Let A R n n. Then the (full) singular value decomposition of A is σ σ 2 0 (V 1 ) T A = UΣV T (V 2 ) T = U 1 U 2 U m 0 σ n (V n ) T 0 0 where U, V are orthogonal matrices and Σ is diagonal The σ i s are the singular values of A, by convention arranged in nonincreasing order σ 1 σ 2 σ n 0; the columns of U are termed left singular vectors of A; the columns of V are called right singular vectors of A 6
7 Since U and V are orthogonal matrices, the columns of each form orthonormal (mutually orthogonal, all of length 1) bases for R n We can use these bases to illuminate the fundamental property of the SVD: For the equation Ax = b, the SVD makes every matrix diagonal by selecting the right bases for the range and domain Let b, x R n such that Ax = b, and expand b in the columns of U and x in the columns of V to get b = U T b, x = V T x. 7
8 Then we have b = Ax U T b = U T Ax = U T (UΣV T )x = (U T U)Σ(V T x) = IΣx = Σx or b = Ax b =Σx Let y R n, then the action of left multiplication of y by A (computing z = Ay) is decomposed by the SVD into three steps z = Ay = (UΣV T ) y = UΣ(V T y) = UΣ c (c := V T y) = Uw (w := Σ c) 8
9 c = V T y is the analysis step, in which the components of y, in the basis of R n given by the columns of V, are computed w =Σc is the scaling step in which the components c i, i {1, 2,...,n} are dilated z = Uw is the synthesis step, in which z is assembled by scaling each of the R n basis vectors u i by w i and summing 9
10 So how do we find the matrices U, Σ, and V in the SVD of some A R n n? Since V T V = I = U T U, A = UΣV T yields AV = U Σ and (1) U T A = ΣV T or, taking transposes A T U = V Σ (2) Or, for each j {1, 2,...,n}, Av j = σ j u j from Equation 1 (3) A T u j = σ j v j from Equation 2 (4) Now we multiply Equation 3 by A T to get 10
11 A T Av j = A T σ j u j = σ j A T u j = σ 2 j v j So the v j s are the eigenvectors of A T A with corresponding eigenvalues σ 2 j Note that (A T A) ij = i AA j or A T A = 1AA 1 1 AA 2 1AA n 2AA 1 2 AA naa 1 naa n (5) A T A is a matrix of inner products of columns of A  often called the Gram matrix of A We ll see the Gram matrix again when considering applications 11
12 Let s do an example: A = = A T = = A T A = To find the eigenvectors v and the corresponding eigenvalues λ for B := A T A, we solve Bx = λx (B λi)x =0 for λ and x 12
13 The standard technique for finding such λ and v is to first note that we are looking for the λ that make the matrix B λi = λ λ λ = 3 λ λ λ singular This is most easily done by solving det(b λi) =0: 3 λ λ λ = (3 λ)(1 λ)(2 λ) 2+λ = λ 3 +6λ 2 10λ +4 = 0 σ 2 1 = λ 1 = 2+ 2 σ 2 2 = λ 2 = 2 σ 2 3 = λ 3 =
14 Now (for a gentle first step) we ll find a vector v 2 so that A T Av 2 =2v 2 We do this by finding a basis for the nullspace of A T A 2I = = Certainly any vector of the form 0 0, t t R, is mapped to zero by A T A 2I 0 So we can set v 2 =
15 To find v 1 we find a basis for the nullspace of A T A (2 + 2)I = which rowreduces ( R2 (1 + 2)R1+R2, then R3 R2 )to So any vector of the form s ( 1+ 2)s 0 is mapped to zero by A T A (2 + 2)I so v 1 = spans the nullspace of AT A λ 1 I, but v 1 =1 15
16 So we set v 1 = v 1 v 1 = We could find v 3 in a similar manner, but in this particular case there s a quicker way... v 3 = (v 1 ) 2 (v 1 ) 1 0 = Certainly v 3 v 2 and by construction v 3 v 1  recall the theorem from linear algebra symmetric matrices must have orthogonal eigenvectors 16
17 We ve found V = v 1 v 2 v 3 = And of course Σ= Now, how do we find U? 17
18 If σ n > 0, Σ is invertible and U = AV Σ 1 So we have U = = ( 2 1) =
19 Figure 1: The columns of A in the unit sphere 19
20 Figure 2: The columns of U in the unit sphere 20
21 Figure 3: The columns of V in the unit sphere 21
22 Figure 4: The columns of Σ in the ellipse formed by Σ acting on the unit sphere by leftmultiplication Figure 5: The columns of AV = UΣ in the ellipse formed by A acting on the unit sphere by leftmultiplication Note that the columns of U and V are orthogonal (as are, of course, the columns of Σ) 22
23 Note that in practice, the SVD is computed more efficiently than by the direct method we used here; usually by (OK, get ready for the gratuitous mathspeak) reducing A to bidiagonal form U 1 BV T 1 by elementary reflectors or Givens rotations and directly computing the SVD of B (= U 2 ΣV T 2 ) then the SVD of A is ( U 1 U 2 )Σ(V T 2 V T 1 ) If σ n =0, then A is singular and the entire process above must be modified slightly but carefully. If r is the rank of A (the number of nonzero rows of the rowechelon form of A) then n r singular values of A are zero (equivalently if there are n r zero rows in the rowechelon form of A), so Σ 1 is not defined, and we define the pseudoinverse Σ + of Σ as Σ + = diag(σ 1 1,σ 1 2,..., σ 1 r, 0,..., 0) 23
24 Thus we can define the first r columns of U via AV Σ + and to complete U we choose any n r orthonormal vectors which are also orthogonal to span{u 1,u 2,...,u r }, via, for example, GramSchmidt Recall that the SVD is defined for even nonsquare matrices In this case, the above process is modified to permit U and V to have different sizes If A R m n, then U R m m Σ R m n V R n n 24
25 In the case m>n: a 11 a 12 a 1n a 21 a 22 a 2n A =..... a m1 a mn = u 11 u 12 u 1n u 1m u 21 u 22 u 2n u 2m..... u m1 u mn u mm σ σ v 11 v 12 v 1n v 0 σ 21 v 22. n v n1 v nn 0 0 or, in another incarnation of the SVD (the reduced SVD) u 11 u 12 u 1n u 21 u 22. A =.... u m1 u mn σ σ σ n v 11 v 12 v 1n v 21 v v n1 v nn where the matrix U is no longer square (so it can t be orthogonal) but still has orthonormal columns 25
26 If m<n: A = a 11 a 12 a 1m a 1n a 21 a 22 a 2n..... a m1 a mn = u 11 u 12 u 1n u 21 u u n1 u nn σ σ σ n 0 0 v 11 v 12 v 1n v 1m v 21 v 22 v 2n v 2m..... v n1 v n2 v nn v nm..... v m1 v mn v mm 26
27 In which case the reduced SVD is A = u 11 u 12 u 1n u 21 u σ σ v 11 v 12 v 1n v 1m v 21 v 22 v 2n v 2m..... u n1 u nn 0 σ n v n1 v n2 v nn v nm ******************************************************************* 3 Properties of the SVD Recall r is the rank of A; the number of nonzero singular values of A range (A) = span {u 1,u 2,...,u r } range (A T ) = span {v 1,v 2,...,v r } null (A) = span {v r+1,v r+2,..., v n } null (A T ) = span {u r+1,u r+2,..., u m } 27
28 For A R n n, det A = n i=1 σ i The SVD of an m n matrix A leads to an easy proof that the image of the unit sphere S n 1 under leftmultiplication by A is a hyperellipse with semimajor axes of length σ 1,σ 2,...,σ n The condition number of an m n matrix A, with m n, is κ(a) = σ 1 σ n Used in numerics, κ(a) is a measure of how close A is to being singular with respect to floatingpoint computation The 2norm of A is A 2 := sup { } Ax 2 x 2 =1 The Frobenius norm of A is A F := ( m i=1 n j=1 ) 1/2 a 2 ij 28
29 We have A 2 = σ 1 and A F = σ σ σ2 n since both matrix norms are invariant under orthogonal transformations (multiplication by orthogonal matrices) Note that although the singular values of A are uniquely determined, the left and right singular vectors are only determined up to a sequence of sign choices for the columns of either U or V So the SVD is not generally unique, there are 2 (max m,n) possible SVD s for a given matrix A If we fix signs for, say, column 1 of V, then the sign for column 1 of U is determined  recall AV = UΣ 29
30 4 Symmetric Orthogonalization For nonsingular A, the matrix L := UV T is called the symmetric orthogonalization of the matrix A L is unique since any sequence of sign choices for the columns of V determines a sequence of signs for the columns of U L ij = U i1 (V T ) 1j + U i2 (V T ) 2j + U i3 (V T ) 3j + + U in (V T ) ni = U i1 V j1 + U i2 V j2 + U i3 V j3 + + U in V jn Like GramSchmidt orthogonalization, it takes as input a linearly independent set (the columns of A) and outputs an orthonormal set 30
31 (Classical) GramSchmidt is unstable due to repeated subtractions; Modifed GramSchmidt remedies this But occasionally we want to disturb the original set of vectors as little as possible Theorem 4.1 Over all orthogonal matrices Q,, A Q F Q = L. is minimized when 31
32 Figure 6: The columns of L := UV T and the columns of A 32
33 5 Applications of the SVD Symmetric Orthogonalization was invented by a Swedish chemist, PerOlov Löwdin, for the purpose of orthogonalizing hybrid electron orbitals Also has application in 4G wireless communication standard, Orthogonal FrequencyDivision Multiplexing (OFDM) Nonorthogonal carrier waves with ideal properties, good timefrequency localization, orthogonalized in this manner have maximal TFlocalization among all orthogonal carriers Carrier waves are continuous (complexvalued) functions and not matrices, but there is an inner product defined for pairs of carrier waves via integration With that inner product, the Gram matrix of the set of carrier waves can be computed 33
34 The symmetrically orthogonalized Gram matrix is then used to provide coefficients for linear combinations of the carrier waves These linear combinations are orthogonal (hence suitable for OFDM) and optimally TFlocalized The SVD also has a natural application to finding the least squares solution to Ax = b (i.e., a vector x with minimal Ax b 2 ) where Ax = b is inconsistent (e.g., A R m n,m>n,r= n) But perhaps the most visually striking property of the SVD comes from an application in image compression 34
35 We can rewrite Σ as σ σ = 0 σ n σ } 0 {{ 0 } Σ σ } {{ 0 } Σ } {{ σ n } Σ n = Σ 1 + Σ Σ n Now consider the SVD A = U 1 U 2 U n ( Σ 1 + Σ Σ n ) (V 1 ) T (V 2 ) T. (V n ) T 35
36 and focus on, say, the first term U 1 U 2 U n ( Σ 1 ) (V 1 ) T (V 2 ) T. (V n ) T = σ 1U (V 1 ) T (V 2 ) T. (V n ) T = σ 1U (V 1 ) T 0. 0 = σ 1 U 1 (V 1 ) T In general UΣ k V T = σ k U k (V k ) T So A = n σ j U j (V j ) T j=1 which is an expression of A as a sum of rankone matrices 36
37 In this representation of A, we can consider partial sums For any k with 1 k n, define A (k) = k σ j U j (V j ) T j=1 This amounts to discarding the smallest n k singular values and their corresponding singular vectors, and storing only the V j s and the s j U j s Theorem 5.1 Among all rankk matrices P, A P F is minimized for P = A (k) Theorem 5.1 says that the k th partial sum of A (n) captures as much of the energy of A as possible 37
38 Example Consider the 320by200pixel image below This is stored as a matrix of grayscale values, between 0 (black) and 1 (white), denoted by A clown We can take the SVD of A clown 38
39 By Theorem 5.1, A (k) clown is the best rankk approximation to A clown, measured by the Frobenius norm Storage required for A (k) clown is a total of ( ) k bytes for storing σ 1u 1 through σ k u k and v 1 through v k = 64, 000 bytes required to store A clown explicitly Now consider the rank20 approximation to the original image, and the difference between the images 39
40 Figure 7: Rank20 approximation A (20) clown and A A(20) clown 40
41 The original image took 64 kb, while the lowrank approximation required ( ) 20 = 10.4 kb, a compression ratio of.1625 The SVD can also make you rich  but that s a topic for another time... For further investigation, see Numerical Linear Algebra by Trefethen Applied Numerical Linear Algebra by Demmel Matrix Analysis by Horn and Johnson Matrix Computations by Golub and van Loan 41
Linear Algebra Review. Vectors
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 34 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LUdecomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
More informationSimilar matrices and Jordan form
Similar matrices and Jordan form We ve nearly covered the entire heart of linear algebra once we ve finished singular value decompositions we ll have seen all the most central topics. A T A is positive
More informationChapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
More information5. Orthogonal matrices
L Vandenberghe EE133A (Spring 2016) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 51 Orthonormal
More informationNUMERICALLY EFFICIENT METHODS FOR SOLVING LEAST SQUARES PROBLEMS
NUMERICALLY EFFICIENT METHODS FOR SOLVING LEAST SQUARES PROBLEMS DO Q LEE Abstract. Computing the solution to Least Squares Problems is of great importance in a wide range of fields ranging from numerical
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationCS3220 Lecture Notes: QR factorization and orthogonal transformations
CS3220 Lecture Notes: QR factorization and orthogonal transformations Steve Marschner Cornell University 11 March 2009 In this lecture I ll talk about orthogonal matrices and their properties, discuss
More information1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in threespace, we write a vector in terms
More information4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns
L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
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 informationRecall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n.
ORTHOGONAL MATRICES Informally, an orthogonal n n matrix is the ndimensional analogue of the rotation matrices R θ in R 2. When does a linear transformation of R 3 (or R n ) deserve to be called a rotation?
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationFactorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
More informationSection 6.1  Inner Products and Norms
Section 6.1  Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More information1. True/False: Circle the correct answer. No justifications are needed in this exercise. (1 point each)
Math 33 AH : Solution to the Final Exam Honors Linear Algebra and Applications 1. True/False: Circle the correct answer. No justifications are needed in this exercise. (1 point each) (1) If A is an invertible
More informationThe Hadamard Product
The Hadamard Product Elizabeth Million April 12, 2007 1 Introduction and Basic Results As inexperienced mathematicians we may have once thought that the natural definition for matrix multiplication would
More informationSECTION 8.3: THE INVERSE OF A SQUARE MATRIX
(Section 8.3: The Inverse of a Square Matrix) 8.47 SECTION 8.3: THE INVERSE OF A SQUARE MATRIX PART A: (REVIEW) THE INVERSE OF A REAL NUMBER If a is a nonzero real number, then aa 1 = a 1 a = 1. a 1, or
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in twodimensional space (1) 2x y = 3 describes a line in twodimensional space The coefficients of x and y in the equation
More informationLecture 5: Singular Value Decomposition SVD (1)
EEM3L1: Numerical and Analytical Techniques Lecture 5: Singular Value Decomposition SVD (1) EE3L1, slide 1, Version 4: 25Sep02 Motivation for SVD (1) SVD = Singular Value Decomposition Consider the system
More informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 201112 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
More informationAu = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
More informationThe MoorePenrose Inverse and Least Squares
University of Puget Sound MATH 420: Advanced Topics in Linear Algebra The MoorePenrose Inverse and Least Squares April 16, 2014 Creative Commons License c 2014 Permission is granted to others to copy,
More informationLecture 6. Inverse of Matrix
Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationCONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
More informationWHICH LINEARFRACTIONAL TRANSFORMATIONS INDUCE ROTATIONS OF THE SPHERE?
WHICH LINEARFRACTIONAL TRANSFORMATIONS INDUCE ROTATIONS OF THE SPHERE? JOEL H. SHAPIRO Abstract. These notes supplement the discussion of linear fractional mappings presented in a beginning graduate course
More informationOctober 3rd, 2012. Linear Algebra & Properties of the Covariance Matrix
Linear Algebra & Properties of the Covariance Matrix October 3rd, 2012 Estimation of r and C Let rn 1, rn, t..., rn T be the historical return rates on the n th asset. rn 1 rṇ 2 r n =. r T n n = 1, 2,...,
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all ndimensional column
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationSolution. Area(OABC) = Area(OAB) + Area(OBC) = 1 2 det( [ 5 2 1 2. Question 2. Let A = (a) Calculate the nullspace of the matrix A.
Solutions to Math 30 Takehome prelim Question. Find the area of the quadrilateral OABC on the figure below, coordinates given in brackets. [See pp. 60 63 of the book.] y C(, 4) B(, ) A(5, ) O x Area(OABC)
More informationCofactor Expansion: Cramer s Rule
Cofactor Expansion: Cramer s Rule MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Today we will focus on developing: an efficient method for calculating
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More information3 Orthogonal Vectors and Matrices
3 Orthogonal Vectors and Matrices The linear algebra portion of this course focuses on three matrix factorizations: QR factorization, singular valued decomposition (SVD), and LU factorization The first
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationApplied Linear Algebra I Review page 1
Applied Linear Algebra Review 1 I. Determinants A. Definition of a determinant 1. Using sum a. Permutations i. Sign of a permutation ii. Cycle 2. Uniqueness of the determinant function in terms of properties
More information[1] Diagonal factorization
8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More information1 Introduction. 2 Matrices: Definition. Matrix Algebra. Hervé Abdi Lynne J. Williams
In Neil Salkind (Ed.), Encyclopedia of Research Design. Thousand Oaks, CA: Sage. 00 Matrix Algebra Hervé Abdi Lynne J. Williams Introduction Sylvester developed the modern concept of matrices in the 9th
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More informationLecture 2 Matrix Operations
Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrixvector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or
More informationDETERMINANTS. b 2. x 2
DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in
More informationLinear Algebraic Equations, SVD, and the PseudoInverse
Linear Algebraic Equations, SVD, and the PseudoInverse Philip N. Sabes October, 21 1 A Little Background 1.1 Singular values and matrix inversion For nonsmmetric matrices, the eigenvalues and singular
More informationNOTES on LINEAR ALGEBRA 1
School of Economics, Management and Statistics University of Bologna Academic Year 205/6 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura
More informationMAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =
MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationDiagonalisation. Chapter 3. Introduction. Eigenvalues and eigenvectors. Reading. Definitions
Chapter 3 Diagonalisation Eigenvalues and eigenvectors, diagonalisation of a matrix, orthogonal diagonalisation fo symmetric matrices Reading As in the previous chapter, there is no specific essential
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationMATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0
More informationThe Inverse of a Matrix
The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a ( 0) has a reciprocal b written as a or such that a ba = ab =. Some, but not all, square matrices have inverses. If a square
More informationLinear algebra and the geometry of quadratic equations. Similarity transformations and orthogonal matrices
MATH 30 Differential Equations Spring 006 Linear algebra and the geometry of quadratic equations Similarity transformations and orthogonal matrices First, some things to recall from linear algebra Two
More informationLecture 4: Partitioned Matrices and Determinants
Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying
More informationNonlinear Iterative Partial Least Squares Method
Numerical Methods for Determining Principal Component Analysis Abstract Factors Béchu, S., RichardPlouet, M., Fernandez, V., Walton, J., and Fairley, N. (2016) Developments in numerical treatments for
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8
Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus ndimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More information6. Cholesky factorization
6. Cholesky factorization EE103 (Fall 201112) triangular matrices forward and backward substitution the Cholesky factorization solving Ax = b with A positive definite inverse of a positive definite matrix
More informationLinear Algebra: Determinants, Inverses, Rank
D Linear Algebra: Determinants, Inverses, Rank D 1 Appendix D: LINEAR ALGEBRA: DETERMINANTS, INVERSES, RANK TABLE OF CONTENTS Page D.1. Introduction D 3 D.2. Determinants D 3 D.2.1. Some Properties of
More informationMAT188H1S Lec0101 Burbulla
Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More information3. Let A and B be two n n orthogonal matrices. Then prove that AB and BA are both orthogonal matrices. Prove a similar result for unitary matrices.
Exercise 1 1. Let A be an n n orthogonal matrix. Then prove that (a) the rows of A form an orthonormal basis of R n. (b) the columns of A form an orthonormal basis of R n. (c) for any two vectors x,y R
More informationNotes on Orthogonal and Symmetric Matrices MENU, Winter 2013
Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationINTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL
SOLUTIONS OF THEORETICAL EXERCISES selected from INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL Eighth Edition, Prentice Hall, 2005. Dr. Grigore CĂLUGĂREANU Department of Mathematics
More informationMath 215 HW #6 Solutions
Math 5 HW #6 Solutions Problem 34 Show that x y is orthogonal to x + y if and only if x = y Proof First, suppose x y is orthogonal to x + y Then since x, y = y, x In other words, = x y, x + y = (x y) T
More information18.06 Problem Set 4 Solution Due Wednesday, 11 March 2009 at 4 pm in 2106. Total: 175 points.
806 Problem Set 4 Solution Due Wednesday, March 2009 at 4 pm in 206 Total: 75 points Problem : A is an m n matrix of rank r Suppose there are righthandsides b for which A x = b has no solution (a) What
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationIntroduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra  1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
More informationChapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. ( 1 1 5 2 0 6
Chapter 7 Matrices Definition An m n matrix is an array of numbers set out in m rows and n columns Examples (i ( 1 1 5 2 0 6 has 2 rows and 3 columns and so it is a 2 3 matrix (ii 1 0 7 1 2 3 3 1 is a
More informationMATH 551  APPLIED MATRIX THEORY
MATH 55  APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
More information2.5 Elementary Row Operations and the Determinant
2.5 Elementary Row Operations and the Determinant Recall: Let A be a 2 2 matrtix : A = a b. The determinant of A, denoted by det(a) c d or A, is the number ad bc. So for example if A = 2 4, det(a) = 2(5)
More informationInner products on R n, and more
Inner products on R n, and more Peyam Ryan Tabrizian Friday, April 12th, 2013 1 Introduction You might be wondering: Are there inner products on R n that are not the usual dot product x y = x 1 y 1 + +
More informationMatrix Differentiation
1 Introduction Matrix Differentiation ( and some other stuff ) Randal J. Barnes Department of Civil Engineering, University of Minnesota Minneapolis, Minnesota, USA Throughout this presentation I have
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 6. Eigenvalues and Singular Values In this section, we collect together the basic facts about eigenvalues and eigenvectors. From a geometrical viewpoint,
More informationIntroduction to Matrix Algebra I
Appendix A Introduction to Matrix Algebra I Today we will begin the course with a discussion of matrix algebra. Why are we studying this? We will use matrix algebra to derive the linear regression model
More informationCS 5614: (Big) Data Management Systems. B. Aditya Prakash Lecture #18: Dimensionality Reduc7on
CS 5614: (Big) Data Management Systems B. Aditya Prakash Lecture #18: Dimensionality Reduc7on Dimensionality Reduc=on Assump=on: Data lies on or near a low d dimensional subspace Axes of this subspace
More informationEigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
More informationUsing row reduction to calculate the inverse and the determinant of a square matrix
Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible
More information2.1: MATRIX OPERATIONS
.: MATRIX OPERATIONS What are diagonal entries and the main diagonal of a matrix? What is a diagonal matrix? When are matrices equal? Scalar Multiplication 45 Matrix Addition Theorem (pg 0) Let A, B, and
More informationMatrix Algebra, Class Notes (part 1) by Hrishikesh D. Vinod Copyright 1998 by Prof. H. D. Vinod, Fordham University, New York. All rights reserved.
Matrix Algebra, Class Notes (part 1) by Hrishikesh D. Vinod Copyright 1998 by Prof. H. D. Vinod, Fordham University, New York. All rights reserved. 1 Sum, Product and Transpose of Matrices. If a ij with
More information7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
More informationMatrices and Linear Algebra
Chapter 2 Matrices and Linear Algebra 2. Basics Definition 2... A matrix is an m n array of scalars from a given field F. The individual values in the matrix are called entries. Examples. 2 3 A = 2 4 2
More informationMath 313 Lecture #10 2.2: The Inverse of a Matrix
Math 1 Lecture #10 2.2: The Inverse of a Matrix Matrix algebra provides tools for creating many useful formulas just like real number algebra does. For example, a real number a is invertible if there is
More informationDirect Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationSMOOTHING APPROXIMATIONS FOR TWO CLASSES OF CONVEX EIGENVALUE OPTIMIZATION PROBLEMS YU QI. (B.Sc.(Hons.), BUAA)
SMOOTHING APPROXIMATIONS FOR TWO CLASSES OF CONVEX EIGENVALUE OPTIMIZATION PROBLEMS YU QI (B.Sc.(Hons.), BUAA) A THESIS SUBMITTED FOR THE DEGREE OF MASTER OF SCIENCE DEPARTMENT OF MATHEMATICS NATIONAL
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationSolving Systems of Linear Equations Using Matrices
Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.
More information15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationHelpsheet. Giblin Eunson Library MATRIX ALGEBRA. library.unimelb.edu.au/libraries/bee. Use this sheet to help you:
Helpsheet Giblin Eunson Library ATRIX ALGEBRA Use this sheet to help you: Understand the basic concepts and definitions of matrix algebra Express a set of linear equations in matrix notation Evaluate determinants
More information