# Numerical Analysis Lecture Notes

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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, the eigenvectors indicate the directions of pure stretch and the eigenvalues the extent of stretching. Most matrices are complete, meaning that their (complex) eigenvectors form a basis of the underlying vector space. A particularly important class are the symmetric matrices, whose eigenvectors form an orthogonal basis of R n. A non-square matrix A does not have eigenvalues. In their place, one uses the square roots of the eigenvalues of the associated square Gram matrix K = A T A, which are called singular values of the original matrix. The numerical computation of eigenvalues and eigenvectors is a challenging issue, and must be be deferred until later. 6.. Eigenvalues and Eigenvectors. We inaugurate our discussion of eigenvalues and eigenvectors with the basic definition. Definition 6.. Let A be an n n matrix. A scalar λ is called an eigenvalue of A if there is a non-zero vector v, called an eigenvector, such that Av = λv. (6.) In other words, the matrix A stretches the eigenvector v by an amount specified by the eigenvalue λ. Remark: The odd-looking terms eigenvalue and eigenvector are hybrid German English words. In the original German, they are Eigenwert and Eigenvektor, which can be fully translated as proper value and proper vector. For some reason, the halftranslated terms have acquired a certain charm, and are now standard. The alternative English terms characteristic value and characteristic vector can be found in some (mostly older) texts. Oddly, the term characteristic equation, to be defined below, is still used. The requirement that the eigenvector v be nonzero is important, since v = is a trivial solution to the eigenvalue equation (6.) for any scalar λ. Moreover, as far as solving linear ordinary differential equations goes, the zero vector v = gives u(t), which is certainly a solution, but one that we already knew. The eigenvalue equation (6.) is a system of linear equations for the entries of the eigenvector v provided that the eigenvalue λ is specified in advance but is mildly 5/8/8 86 c 8 Peter J. Olver

2 nonlinear as a combined system for λ and v. Gaussian Elimination per se will not solve the problem, and we are in need of a new idea. Let us begin by rewriting the equation in the form (A λ I )v =, (6.) where I is the identity matrix of the correct size. Now, for given λ, equation (6.) is a homogeneous linear system for v, and always has the trivial zero solution v =. But we are specifically seeking a nonzero solution! A homogeneous linear system has a nonzero solution v if and only if its coefficient matrix, which in this case is A λ I, is singular. This observation is the key to resolving the eigenvector equation. Theorem 6.. A scalar λ is an eigenvalue of the n n matrix A if and only if the matrix A λ I is singular, i.e., of rank < n. The corresponding eigenvectors are the nonzero solutions to the eigenvalue equation (A λ I )v =. Proposition 6.3. A scalar λ is an eigenvalue of the matrix A if and only if λ is a solution to the characteristic equation det(a λ I ) =. (6.3) In practice, when finding eigenvalues and eigenvectors by hand, one first solves the characteristic equation (6.3). Then, for each eigenvalue λ one uses standard linear algebra methods, i.e., Gaussian Elimination, to solve the corresponding linear system (6.) for the eigenvector v. Example 6.4. Consider the matrix A = ( 3 3 We compute the determinant in the characteristic equation using formula (3.8): 3 λ det(a λ I ) = det = (3 λ) = λ 6λ λ Thus, the characteristic equation is a quadratic polynomial equation, and can be solved by factorization: λ 6λ + 8 = (λ 4) (λ ) =. We conclude that A has two eigenvalues: λ = 4 and λ =. For each eigenvalue, the corresponding eigenvectors are found by solving the associated homogeneous linear system (6.). For the first eigenvalue, the eigenvector equation is (A 4 I )v = ( ) ( x y ) = ( ). ), or x + y =, x y =. Note that it is not legal to write (6.) in the form (A λ)v = since we do not know how to subtract a scalar λ from a matrix A. Worse, if you type A λ in Matlab or Mathematica, the result will be to subtract λ from all the entries of A, which is not what we are after! 5/8/8 87 c 8 Peter J. Olver

3 The general solution is x = y = a, so v = a = a a, where a is an arbitrary scalar. Only the nonzero solutions count as eigenvectors, and so the eigenvectors for the eigenvalue λ = 4 must have a, i.e., they are all nonzero scalar multiples of the basic eigenvector v = (, ) T. Remark: In general, if v is an eigenvector of A for the eigenvalue λ, then so is any nonzero scalar multiple of v. In practice, we only distinguish linearly independent eigenvectors. Thus, in this example, we shall say v = (, ) T is the eigenvector corresponding to the eigenvalue λ = 4, when we really mean that the eigenvectors for λ = 4 consist of all nonzero scalar multiples of v. Similarly, for the second eigenvalue λ =, the eigenvector equation is x (A I )v = =. y The solution ( a, a ) T = a (, ) T is the set of scalar multiples of the eigenvector v = (, ) T. Therefore, the complete list of eigenvalues and eigenvectors (up to scalar multiple) for this particular matrix is λ = 4, v =, λ =, v =. Example 6.5. Consider the 3 3 matrix A =. Using the formula for a 3 3 determinant, we compute the characteristic equation λ = det(a λ I ) = det λ λ = ( λ)( λ) + ( ) + ( ) = λ 3 + 4λ 5λ +. The resulting cubic polynomial can be factored: ( λ)( ) ( λ) ( λ) ( ) λ 3 + 4λ 5λ + = (λ ) (λ ) =. If, at this stage, you end up with a linear system with only the trivial zero solution, you ve done something wrong! Either you don t have a correct eigenvalue maybe you made a mistake setting up and/or solving the characteristic equation or you ve made an error solving the homogeneous eigenvector system. 5/8/8 88 c 8 Peter J. Olver

4 Most 3 3 matrices have three different eigenvalues, but this particular one has only two: λ =, which is called a double eigenvalue since it is a double root of the characteristic equation, along with a simple eigenvalue λ =. The eigenvector equation (6.) for the double eigenvalue λ = is (A I )v = x y z = The general solution to this homogeneous linear system v = a b a = a + b b depends upon two free variables: y = a and z = b. Any nonzero solution forms a valid eigenvector for the eigenvalue λ =, and so the general eigenvector is any non-zero linear combination of the two basis eigenvectors v = (,, ) T, v = (,, ) T. On the other hand, the eigenvector equation for the simple eigenvalue λ = is The general solution (A I )v = v = a a a = a x y z =.. consists of all scalar multiples of the eigenvector v = (,, ) T. In summary, the eigenvalues and (basis) eigenvectors for this matrix are λ =, v =, v =, (6.4) λ =, v =. In general, given a real eigenvalue λ, the corresponding eigenspace V λ R n is the subspace spanned by all its eigenvectors. Equivalently, the eigenspace is the kernel V λ = ker(a λ I ). (6.5) In particular, λ R is an eigenvalue if and only if V λ {} is a nontrivial subspace, and then every nonzero element of V λ is a corresponding eigenvector. The most economical way to indicate each eigenspace is by writing out a basis, as in (6.4) with v, v giving a basis for V, while v is a basis for V. 5/8/8 89 c 8 Peter J. Olver

5 Example 6.6. The characteristic equation of the matrix A = is = det(a λ I ) = λ 3 + λ + 5λ + 3 = (λ + ) (λ 3). Again, there is a double eigenvalue λ = and a simple eigenvalue λ = 3. However, in this case the matrix A λ I = A + I = has only a one-dimensional kernel, spanned by v = (,, ) T. Thus, even though λ is a double eigenvalue, it only admits a one-dimensional eigenspace. The list of eigenvalues and eigenvectors is, in a sense, incomplete: λ =, v =, λ = 3, v =. Example 6.7. Finally, consider the matrix A =. The characteristic equation is = det(a λ I ) = λ 3 + λ 3λ 5 = (λ + ) (λ λ + 5). The linear factor yields the eigenvalue. The quadratic factor leads to two complex roots, + i and i, which can be obtained via the quadratic formula. Hence A has one real and two complex eigenvalues: λ =, λ = + i, λ 3 = i. Solving the associated linear system, the real eigenvalue is found to have corresponding eigenvector v = (,, ) T. Complex eigenvalues are as important as real eigenvalues, and we need to be able to handle them too. To find the corresponding eigenvectors, which will also be complex, we need to solve the usual eigenvalue equation (6.), which is now a complex homogeneous linear system. For example, the eigenvector(s) for λ = + i are found by solving [ A ( + i ) I ] v = i i i x y z =. This linear system can be solved by Gaussian Elimination (with complex pivots). A simpler strategy is to work directly: the first equation i x + y = tells us that y = i x, while the second equation i y z = says z = iy = x. If we trust our calculations so far, we do not need to solve the final equation x + y + ( i )z =, since we know that the coefficient matrix is singular and hence this equation must be a consequence of 5/8/8 9 c 8 Peter J. Olver

6 the first two. (However, it does serve as a useful check on our work.) So, the general solution v = ( x, i x, x ) T is an arbitrary constant multiple of the complex eigenvector v = (, i, ) T. The eigenvector equation for λ 3 = i is similarly solved for the third eigenvector v 3 = (, i,) T. Summarizing, the matrix under consideration has three complex eigenvalues and three corresponding eigenvectors, each unique up to (complex) scalar multiple: λ =, λ = + i, λ 3 = i, v =, v = i, v 3 = i. Note that the third complex eigenvalue is the complex conjugate of the second, and the eigenvectors are similarly related. This is indicative of a general fact for real matrices: Proposition 6.8. If A is a real matrix with a complex eigenvalue λ = µ + i ν and corresponding complex eigenvector v = x + iy, then the complex conjugate λ = µ i ν is also an eigenvalue with complex conjugate eigenvector v = x iy. Proof : First take complex conjugates of the eigenvalue equation (6.): A v = Av = λv = λ v. Using the fact that a real matrix is unaffected by conjugation, so A = A, we conclude Av = λ v, which is the equation for the eigenvalue λ and eigenvector v. Q.E.D. As a consequence, when dealing with real matrices, we only need to compute the eigenvectors for one of each complex conjugate pair of eigenvalues. This observation effectively halves the amount of work in the unfortunate event that we are confronted with complex eigenvalues. The eigenspace associated with a complex eigenvalue λ is the subspace V λ C n spanned by the associated eigenvectors. One might also consider complex eigenvectors associated with a real eigenvalue, but this doesn t add anything to the picture they are merely complex linear combinations of the real eigenvalues. Thus, we only introduce complex eigenvectors when dealing with genuinely complex eigenvalues. Remark: The reader may recall that we said one should never use determinants in practical computations. So why have we reverted to using determinants to find eigenvalues? The truthful answer is that the practical computation of eigenvalues and eigenvectors never resorts to the characteristic equation! The method is fraught with numerical traps and inefficiencies when (a) computing the determinant leading to the characteristic equation, then (b) solving the resulting polynomial equation, which is itself a nontrivial numerical problem, [7, 47], and, finally, (c) solving each of the resulting linear eigenvector systems. In fact, one effective numerical strategy for finding the roots of a polynomial is to turn the procedure on its head, and calculate the eigenvalues of a matrix whose characteristic equation is the polynomial in question! See [47] for details. 5/8/8 9 c 8 Peter J. Olver

7 Worse, if we only know an approximation λ to the true eigenvalue λ, the approximate eigenvector system (A λ )v = will almost certainly have a nonsingular coefficient matrix, and hence only admits the trivial solution v = which does not even qualify as an eigenvector! Nevertheless, the characteristic equation does give us important theoretical insight into the structure of the eigenvalues of a matrix, and can be used when dealing with small matrices, e.g., and 3 3, presuming exact arithmetic is employed. Numerical algorithms for computing eigenvalues and eigenvectors are based on completely different ideas. Proposition 6.9. A matrix A is singular if and only if is an eigenvalue. Proof : By definition, is an eigenvalue of A if and only if there is a nonzero solution to the eigenvector equation Av = v =. Thus, is an eigenvector of A if and only if it has a non-zero vector in its kernel, ker A {}, and hence A is necessarily singular. Q.E.D. Basic Properties of Eigenvalues If A is an n n matrix, then its characteristic polynomial is p A (λ) = det(a λ I ) = c n λ n + c n λ n + + c λ + c. (6.6) The fact that p A (λ) is a polynomial of degree n is a consequence of the general determinantal formula. Indeed, every term is prescribed by a permutation π of the rows of the matrix, and equals plus or minus a product of n distinct matrix entries including one from each row and one from each column. The term corresponding to the identity permutation is obtained by multiplying the diagonal entries together, which, in this case, is (a λ) (a λ) (a nn λ) = ( ) n λ n +( ) n ( a + a + + a nn ) λ n +. (6.7) All of the other terms have at most n diagonal factors a ii λ, and so are polynomials of degree n in λ. Thus, (6.7) is the only summand containing the monomials λ n and λ n, and so their respective coefficients are c n = ( ) n, c n = ( ) n (a + a + + a nn ) = ( ) n tra, (6.8) where tra, the sum of its diagonal entries, is called the trace of the matrix A. The other coefficients c n,..., c, c in (6.6) are more complicated combinations of the entries of A. However, setting λ = implies p A () = det A = c, and hence the constant term in the ( characteristic ) polynomial equals the determinant of a b the matrix. In particular, if A = is a matrix, its characteristic polynomial c d has the explicit form a λ b p A (λ) = det(a λ I ) = det c d λ (6.9) = λ (a + d)λ + (ad bc) = λ (tra)λ + (deta). 5/8/8 9 c 8 Peter J. Olver

8 As a result of these considerations, the characteristic equation of an n n matrix A is a polynomial equation of degree n. According to the Fundamental Theorem of Algebra, [7], every (complex) polynomial of degree n can be completely factored, and so we can write the characteristic polynomial in factored form: p A (λ) = ( ) n (λ λ )(λ λ ) (λ λ n ). (6.) The complex numbers λ,..., λ n, some of which may be repeated, are the roots of the characteristic equation p A (λ) =, and hence the eigenvalues of the matrix A. Therefore, we immediately conclude: Theorem 6.. An n n matrix A has at least one and at most n distinct complex eigenvalues. Most n n matrices meaning those for which the characteristic polynomial factors into n distinct factors have exactly n complex eigenvalues. More generally, an eigenvalue λ j is said to have multiplicity m if the factor (λ λ j ) appears exactly m times in the factorization (6.) of the characteristic polynomial. An eigenvalue is simple if it has multiplicity. In particular, A has n distinct eigenvalues if and only if all its eigenvalues are simple. In all cases, when the repeated eigenvalues are counted in accordance with their multiplicity, every n n matrix has a total of n, possibly repeated, eigenvalues. An example of a matrix with just one eigenvalue, of multiplicity n, is the n n identity matrix I, whose only eigenvalue is λ =. In this case, every nonzero vector in R n is an eigenvector of the identity matrix, and so the eigenspace is all of R n. At the other extreme, the bidiagonal Jordan block matrix J a = a a a a a (6.) also has only one eigenvalue, λ = a, again of multiplicity n. But in this case, J a has only one eigenvector (up to scalar multiple), which is the first standard basis vector e, and so its eigenspace is one-dimensional. Remark: If λ is a complex eigenvalue of multiplicity k for the real matrix A, then its complex conjugate λ also has multiplicity k. This is because complex conjugate roots of a real polynomial necessarily appear with identical multiplicities. If we explicitly multiply out the factored product (6.) and equate the result to the characteristic polynomial (6.6), we find that its coefficients c, c,...c n can be written All non-displayed entries are zero. 5/8/8 93 c 8 Peter J. Olver

9 as certain polynomials of the roots, known as the elementary symmetric polynomials. The first and last are of particular importance: c = λ λ λ n, c n = ( ) n (λ + λ + + λ n ). (6.) Comparison with our previous formulae for the coefficients c and c n leads to the following useful result. Proposition 6.. The sum of the eigenvalues of a matrix equals its trace: λ + λ + + λ n = tr A = a + a + + a nn. (6.3) The product of the eigenvalues equals its determinant: λ λ λ n = det A. (6.4) Remark: For repeated eigenvalues, one must add or multiply them in the formulae (6.3 4) according to their multiplicity. Example 6.. The matrix A = considered in Example 6.6 has trace and determinant tra =, det A = 3, which fix, respectively, the coefficient of λ and the constant term in its characteristic equation. This matrix has two distinct eigenvalues:, which is a double eigenvalue, and 3, which is simple. For this particular matrix, formulae (6.3 4) become = tr A = ( ) + ( ) + 3, 3 = det A = ( )( ) 3. Note that the double eigenvalue contributes twice to the sum and to the product. 6.. Completeness. Most of the vector space bases that play a distinguished role in applications are assembled from the eigenvectors of a particular matrix. In this section, we show that the eigenvectors of any complete matrix automatically form a basis for R n or, in the complex case, C n. In the following subsection, we use the eigenvector basis to rewrite the linear transformation determined by the matrix in a simple diagonal form. The most important cases symmetric and positive definite matrices will be treated in the following section. The first task is to show that eigenvectors corresponding to distinct eigenvalues are automatically linearly independent. Lemma 6.3. If λ,..., λ k are distinct eigenvalues of the same matrix A, then the corresponding eigenvectors v,...,v k are linearly independent. 5/8/8 94 c 8 Peter J. Olver

10 Proof : The result is proved by induction on the number of eigenvalues. The case k = is immediate since an eigenvector cannot be zero. Assume that we know the result is valid for k eigenvalues. Suppose we have a vanishing linear combination: Let us multiply this equation by the matrix A: c v + + c k v k + c k v k =. (6.5) A ( c v + + c k v k + c k v k ) = c Av + + c k Av k + c k Av k = c λ v + + c k λ k v k + c k λ k v k =. On the other hand, if we multiply the original equation (6.5) by λ k, we also have c λ k v + + c k λ k v k + c k λ k v k =. Subtracting this from the previous equation, the final terms cancel and we are left with the equation c (λ λ k )v + + c k (λ k λ k )v k =. This is a vanishing linear combination of the first k eigenvectors, and so, by our induction hypothesis, can only happen if all the coefficients are zero: c (λ λ k ) =,... c k (λ k λ k ) =. The eigenvalues were assumed to be distinct, so λ j λ k when j k. Consequently, c = = c k =. Substituting these values back into (6.5), we find c k v k =, and so c k = also, since the eigenvector v k. Thus we have proved that (6.5) holds if and only if c = = c k =, which implies the linear independence of the eigenvectors v,...,v k. This completes the induction step. Q.E.D. The most important consequence of this result is when a matrix has the maximum allotment of eigenvalues. Theorem 6.4. If the n n real matrix A has n distinct real eigenvalues λ,..., λ n, then the corresponding real eigenvectors v,...,v n form a basis of R n. If A (which may now be either a real or a complex matrix) has n distinct complex eigenvalues, then the corresponding eigenvectors v,...,v n form a basis of C n. For instance, the matrix in Example 6.4 has two distinct real eigenvalues, and its two independent eigenvectors form a basis of R. The 3 3 matrix in Example 6.7 has three distinct complex eigenvalues, and its eigenvectors form a basis for C 3. If a matrix has multiple eigenvalues, then there may or may not be an eigenvector basis of R n (or C n ). The matrix in Example 6.5 admits an eigenvector basis, whereas the matrix in Example 6.6 does not. In general, it can be proved that the dimension of the eigenspace is less than or equal to the eigenvalue s multiplicity. In particular, every simple eigenvalue has a one-dimensional eigenspace, and hence, up to scalar multiple, only one associated eigenvector. Definition 6.5. An eigenvalue λ of a matrix A is called complete if the corresponding eigenspace V λ = ker(a λ I ) has the same dimension as its multiplicity. The matrix A is complete if all its eigenvalues are. 5/8/8 95 c 8 Peter J. Olver

11 Note that a simple eigenvalue is automatically complete, since its eigenspace is the one-dimensional subspace spanned by the corresponding eigenvector. Thus, only multiple eigenvalues can cause a matrix to be incomplete. Remark: The multiplicity of an eigenvalue λ i is sometimes referred to as its algebraic multiplicity. The dimension of the eigenspace V λ is its geometric multiplicity, and so completeness requires that the two multiplicities are equal. The word complete is not completely standard; other common terms for such matrices are perfect, semi-simple and, as discussed shortly, diagonalizable. Theorem 6.6. An n n real or complex matrix A is complete if and only if its eigenvectors span C n. In particular, any n n matrix that has n distinct eigenvalues is complete. Or, stated another way, a matrix is complete if and only if its eigenvectors can be used to form a basis of C n. Most matrices are complete. Incomplete n n matrices, which have fewer than n linearly independent complex eigenvectors, are considerably less pleasant to deal with Eigenvalues of Symmetric Matrices. Fortunately, the matrices that arise in most applications are complete and, in fact, possess some additional structure that ameliorates the calculation of their eigenvalues and eigenvectors. The most important class are the symmetric, including positive definite, matrices. In fact, not only are the eigenvalues of a symmetric matrix necessarily real, the eigenvectors always form an orthogonal basis of the underlying Euclidean space. In fact, this is by far the most common way for orthogonal bases to appear as the eigenvector bases of symmetric matrices. Let us state this important result, but defer its proof until the end of the section. Theorem 6.7. Let A = A T be a real symmetric n n matrix. Then (a) All the eigenvalues of A are real. (b) Eigenvectors corresponding to distinct eigenvalues are orthogonal. (c) There is an orthonormal basis of R n consisting of n eigenvectors of A. In particular, all symmetric matrices are complete. 3 Example 6.8. The matrix A = considered in Example 6.4 is symmetric, and so has real eigenvalues λ = 4 and λ =. You can easily check that the 3 corresponding eigenvectors v = (, ) T and v = (, ) T are orthogonal: v v =, and hence form an orthogonal basis of R. The orthonormal eigenvector basis promised by Theorem 6.7 is obtained by dividing each eigenvector by its Euclidean norm: ( ) u =, u =. 5/8/8 96 c 8 Peter J. Olver

12 Example 6.9. Consider the symmetric matrix A = A straightforward computation produces its eigenvalues and eigenvectors: λ = 9, λ = 3, λ 3 = 3, v =, v =, v 3 =. As the reader can check, the eigenvectors form an orthogonal basis of R 3. An orthonormal basis is provided by the unit eigenvectors u =, u = 3 3 3, u 3 = In particular, the eigenvalues of a symmetric matrix can be used to test its positive definiteness. Theorem 6.. A symmetric matrix K = K T is positive definite if and only if all of its eigenvalues are strictly positive. Example 6.. Consider the symmetric matrix K = 8 8. Its characteristic equation is 7 det(k λ I) = λ 3 + 3λ 74λ + 43 = (λ 9)(λ 8)(λ 6), and so its eigenvalues are 9, 8, and 6. Since they are all positive, K is a positive definite matrix. The associated eigenvectors are λ = 9, v =, λ = 8, v =, λ 3 = 6, v 3 =. Note that the eigenvectors form an orthogonal basis of R 3, as guaranteed by Theorem 6.7. As usual, we can construct an corresponding orthonormal eigenvector basis u = 3 3 3, u = by dividing each eigenvector by its norm., u 3 = 6 6 6, 5/8/8 97 c 8 Peter J. Olver

13 Figure 6.. Gerschgorin Disks and Eigenvalues The Gerschgorin Circle Theorem. In general, precisely computing the eigenvalues is not easy, and, in most cases, must be done through a numerical eigenvalue routine. In applications, though, we may not require their exact numerical values, but only approximate locations. The Gerschgorin Circle Theorem, due to the early twentieth century Russian mathematician Semen Gerschgorin, serves to restrict the eigenvalues to a certain well-defined region in the complex plane. Definition 6.. Let A be an n n matrix, either real or complex. For each i n, define the Gerschgorin disk n D i = { z a ii r i z C }, where r i = a ij. (6.6) The Gerschgorin domain D A = n[ i= j= j i D i C is the union of the Gerschgorin disks. Thus, the i th Gerschgorin disk D i is centered at the i th diagonal entry a ii, and has radius r i equal to the sum of the absolute values of the off-diagonal entries that are in the i th row of A. We can now state the Gerschgorin Circle Theorem. Theorem 6.3. All real and complex eigenvalues of the matrix A lie in its Gerschgorin domain D A. Example 6.4. The matrix A = 4 has Gerschgorin disks 3 D = { z }, D = { z 4 }, D 3 = { z + 3 }, which are plotted in Figure 6.. The eigenvalues of A are λ = 3, λ = = , λ 3 = = Observe that λ belongs to both D and D, while λ lies in D, and λ 3 is in D 3. We thus confirm that all three eigenvalues are in the Gerschgorin domain D A = D D D 3. 5/8/8 98 c 8 Peter J. Olver

14 Proof of Theorem 6.3: Let v be an eigenvector of A with eigenvalue λ. Let u = v/ v be the corresponding unit eigenvector with respect to the norm, so u = max { u,..., u n } =. Let u i be an entry of u that achieves the maximum: u i =. Writing out the i th component of the eigenvalue equation Au = λu, we find n j= a ij u j = λ u i, which we rewrite as Therefore, since all u j while u i =, λ a ii = λ a ii u i = a ij u j j i n j= j i a ij u j = (λ a ii ) u i. a ij u j a ij = r i. j i j i This immediately implies that λ D i D A belongs to the i th Gerschgorin disk. Q.E.D. One application is a simple direct test that guarantees invertibility of a matrix without requiring Gaussian Elimination or computing determinants. According to Proposition 6.9, a matrix A is nonsingular if and only if it does not admit zero as an eigenvalue. Thus, if its Gerschgorin domain does not contain, it cannot be an eigenvalue, and hence A is necessarily invertible. The condition D A requires that the matrix have large diagonal entries, as quantified by the following definition. Definition 6.5. A square matrix A is called strictly diagonally dominant if n a ii > a ij, for all i =,..., n. (6.7) j= j i In other words, strict diagonal dominance requires each diagonal entry to be larger, in absolute value, than the sum of the absolute values of all the other entries in its row. For example, the matrix 3 4 is strictly diagonally dominant since 5 3 > +, 4 > +, 5 > +. Diagonally dominant matrices appear frequently in numerical solution methods for both ordinary and partial differential equations. As we shall see, they are the most common class of matrices to which iterative solution methods can be successfully applied. Theorem 6.6. A strictly diagonally dominant matrix is nonsingular. Proof : The diagonal dominance inequalities (6.7) imply that the radius of the i th Gerschgorin disk is strictly less than the modulus of its center: r i < a ii. Thus, the disk cannot contain ; indeed, if z D i, then, by the triangle inequality, r i > z a ii a ii z > r i z, and hence z >. 5/8/8 99 c 8 Peter J. Olver

15 Thus, D A does not lie in the Gerschgorin domain and so cannot be an eigenvalue. Q.E.D. Warning: The converse to this result is obviously not true; there are plenty of nonsingular matrices that are not diagonally dominant Singular Values. We have already indicated the central role played by the eigenvalues and eigenvectors of a square matrix in both theory and applications. Much more evidence to this effect will appear in the ensuing chapters. Alas, rectangular matrices do not have eigenvalues (why?), and so, at first glance, do not appear to possess any quantities of comparable significance. But you no doubt recall that our earlier treatment of least squares minimization problems, as well as the equilibrium equations for structures and circuits, made essential use of the symmetric, positive semi-definite square Gram matrix K = A T A which can be naturally formed even when A is not square. Perhaps the eigenvalues of K might play a comparably important role for general matrices. Since they are not easily related to the eigenvalues of A which, in the non-square case, don t even exist we shall endow them with a new name. Definition 6.7. The singular values σ,..., σ r of an m n matrix A are the positive square roots, σ i = λ i >, of the nonzero eigenvalues of the associated Gram matrix K = A T A. The corresponding eigenvectors of K are known as the singular vectors of A. Since K is necessarily positive semi-definite, its eigenvalues are always non-negative, λ i, which justifies the positivity of the singular values of A independently of whether A itself has positive, negative, or even complex eigenvalues or is rectangular and has no eigenvalues at all. The standard convention is to label the singular values in decreasing order, so that σ σ σ r >. Thus, σ will always denote the largest or dominant singular value. If K = A T A has repeated eigenvalues, the singular values of A are repeated with the same multiplicities. As we will see, the number r of singular values is always equal to the rank of the matrix. Warning: Many texts include the zero eigenvalues of K as singular values of A. We find this to be somewhat less convenient, but you should be aware of the differences in the two conventions. 3 5 Example 6.8. Let A =. The associated Gram matrix K = A 4 T A = 5 5 has eigenvalues λ 5 5 = 4, λ =, and corresponding eigenvectors v =, v = ( ). Thus, the singular values of A are σ = and σ = 3.63, with v,v being the singular vectors. Note that the singular values are not the same as its eigenvalues, which are λ = (3 + 89) 6.7 and λ = (3 89) 3.7 nor are the singular vectors eigenvectors of A. 5/8/8 c 8 Peter J. Olver

16 Only in the special case of symmetric matrices is there a direct connection between the singular values and the eigenvalues. Proposition 6.9. If A = A T is a symmetric matrix, its singular values are the absolute values of its nonzero eigenvalues: σ i = λ i > ; its singular vectors coincide with the associated non-null eigenvectors. Proof : When A is symmetric, K = A T A = A. So, if Av = λv, then Kv = A v = λ v. Thus, every eigenvector v of A is also an eigenvector of K with eigenvalue λ. Therefore, the eigenvector basis of A is also an eigenvector basis for K, and hence also forms a complete system of singular vectors for A. Q.E.D. Condition Number, Rank, and Principal Component Analysis The singular values not only provide a pretty geometric interpretation of the action of the matrix, they also play a key role in modern computational algorithms. The relative magnitudes of the singular values can be used to distinguish well-behaved linear systems from ill-conditioned systems which are much trickier to solve accurately. Since the number of singular values equals the matrix s rank, an n n matrix with fewer than n singular values is singular. For the same reason, a square matrix with one or more very small singular values should be considered to be close to singular. The potential difficulty of accurately solving a linear algebraic system with coefficient matrix A is traditionally quantified as follows. Definition 6.3. The condition number of a nonsingular n n matrix is the ratio between its largest and smallest singular value: κ(a) = σ /σ n. If A is singular, it is said to have condition number. A matrix with a very large condition number is said to be ill-conditioned; in practice, this occurs when the condition number is larger than the reciprocal of the machine s precision, e.g., 7 for typical single precision arithmetic. As the name implies, it is much harder to solve a linear system Ax = b when its coefficient matrix is ill-conditioned. Determining the rank of a large matrix can be a numerical challenge. Small numerical errors in the entries can have an unpredictable effect. For example, the matrix A =... has rank r =, but a tiny change, e.g., Ã =..., will produce a nonsingular matrix with rank r = 3. The latter matrix, however, is very close to singular, and this is highlighted by its singular values, which are σ while σ σ 3.. The fact that the second and third singular values are very small indicates that Ã is very close to a matrix of rank and should be viewed as a numerical (or experimental) perturbation of such a matrix. Thus, an effective practical method for computing the rank of a matrix is to first assign a threshold, e.g., 5, for singular values, and then treat any small singular value lying below the threshold as if it were zero. This idea underlies the method of Principal Component Analysis that is assuming an increasingly visible role in modern statistics, data mining, imaging, speech recognition, 5/8/8 c 8 Peter J. Olver

17 semantics, and a variety of other fields, [3]. The singular vectors associated with the larger singular values indicate the principal components of the matrix, while small singular values indicate relatively unimportant directions. In applications, the columns of the matrix A represent the data vectors, which are normalized to have mean. The corresponding Gram matrix K = A T A can be identified as the associated covariance matrix, []. Its eigenvectors are the principal components that serve to indicate directions of correlation and clustering in the data. 5/8/8 c 8 Peter J. Olver

### Similarity 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

### Summary of week 8 (Lectures 22, 23 and 24)

WEEK 8 Summary of week 8 (Lectures 22, 23 and 24) This week we completed our discussion of Chapter 5 of [VST] Recall that if V and W are inner product spaces then a linear map T : V W is called an isometry

### MATRIX 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

### MATRIX 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 +

### Au = = = 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

### 1 Eigenvalues and Eigenvectors

Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x

### MATH 240 Fall, Chapter 1: Linear Equations and Matrices

MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS

### Orthogonal 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

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 4. Gaussian Elimination In this part, our focus will be on the most basic method for solving linear algebraic systems, known as Gaussian Elimination in honor

### 1. 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

### by the matrix A results in a vector which is a reflection of the given

Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

### 4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:

### 8 Square matrices continued: Determinants

8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You

### Recall 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 n-dimensional 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?

### Notes 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,

### University of Lille I PC first year list of exercises n 7. Review

University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients

### Chapter 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

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

### Eigenvalues and eigenvectors of a matrix

Eigenvalues and eigenvectors of a matrix Definition: If A is an n n matrix and there exists a real number λ and a non-zero column vector V such that AV = λv then λ is called an eigenvalue of A and V is

### Linear Algebra I. Ronald van Luijk, 2012

Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.

### We call this set an n-dimensional parallelogram (with one vertex 0). We also refer to the vectors x 1,..., x n as the edges of P.

Volumes of parallelograms 1 Chapter 8 Volumes of parallelograms In the present short chapter we are going to discuss the elementary geometrical objects which we call parallelograms. These are going to

### Diagonalisation. 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

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### 17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function

17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):

### 10.3 POWER METHOD FOR APPROXIMATING EIGENVALUES

55 CHAPTER NUMERICAL METHODS. POWER METHOD FOR APPROXIMATING EIGENVALUES In Chapter 7 we saw that the eigenvalues of an n n matrix A are obtained by solving its characteristic equation n c n n c n n...

### Linear Least Squares

Linear Least Squares Suppose we are given a set of data points {(x i,f i )}, i = 1,...,n. These could be measurements from an experiment or obtained simply by evaluating a function at some points. One

### LINEAR ALGEBRA. September 23, 2010

LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................

### Notes on Symmetric Matrices

CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.

### 10.3 POWER METHOD FOR APPROXIMATING EIGENVALUES

58 CHAPTER NUMERICAL METHODS. POWER METHOD FOR APPROXIMATING EIGENVALUES In Chapter 7 you saw that the eigenvalues of an n n matrix A are obtained by solving its characteristic equation n c nn c nn...

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

### MATH 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

### The 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

### Vector and Matrix Norms

Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

### 4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

### Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality week 3-4 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,

### 1 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

### LINEAR 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,

### (January 14, 2009) End k (V ) End k (V/W )

(January 14, 29) [16.1] Let p be the smallest prime dividing the order of a finite group G. Show that a subgroup H of G of index p is necessarily normal. Let G act on cosets gh of H by left multiplication.

### Section 2.1. Section 2.2. Exercise 6: We have to compute the product AB in two ways, where , B =. 2 1 3 5 A =

Section 2.1 Exercise 6: We have to compute the product AB in two ways, where 4 2 A = 3 0 1 3, B =. 2 1 3 5 Solution 1. Let b 1 = (1, 2) and b 2 = (3, 1) be the columns of B. Then Ab 1 = (0, 3, 13) and

### Solution of Linear Systems

Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start

### CS3220 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

### 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

### Eigenvalues and Eigenvectors

Chapter 6 Eigenvalues and Eigenvectors 6. Introduction to Eigenvalues Linear equations Ax D b come from steady state problems. Eigenvalues have their greatest importance in dynamic problems. The solution

### October 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,...,

### Solution based on matrix technique Rewrite. ) = 8x 2 1 4x 1x 2 + 5x x1 2x 2 2x 1 + 5x 2

8.2 Quadratic Forms Example 1 Consider the function q(x 1, x 2 ) = 8x 2 1 4x 1x 2 + 5x 2 2 Determine whether q(0, 0) is the global minimum. Solution based on matrix technique Rewrite q( x1 x 2 = x1 ) =

### NOTES 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

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

### Inner 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

### Systems 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

### NOTES 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

### 1 Orthogonal projections and the approximation

Math 1512 Fall 2010 Notes on least squares approximation Given n data points (x 1, y 1 ),..., (x n, y n ), we would like to find the line L, with an equation of the form y = mx + b, which is the best fit

### Examination paper for TMA4115 Matematikk 3

Department of Mathematical Sciences Examination paper for TMA45 Matematikk 3 Academic contact during examination: Antoine Julien a, Alexander Schmeding b, Gereon Quick c Phone: a 73 59 77 82, b 40 53 99

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### MATH 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

### Iterative Methods for Computing Eigenvalues and Eigenvectors

The Waterloo Mathematics Review 9 Iterative Methods for Computing Eigenvalues and Eigenvectors Maysum Panju University of Waterloo mhpanju@math.uwaterloo.ca Abstract: We examine some numerical iterative

### Solving Sets of Equations. 150 B.C.E., 九章算術 Carl Friedrich Gauss,

Solving Sets of Equations 5 B.C.E., 九章算術 Carl Friedrich Gauss, 777-855 Gaussian-Jordan Elimination In Gauss-Jordan elimination, matrix is reduced to diagonal rather than triangular form Row combinations

### 4.6 Null Space, Column Space, Row Space

NULL SPACE, COLUMN SPACE, ROW SPACE Null Space, Column Space, Row Space In applications of linear algebra, subspaces of R n typically arise in one of two situations: ) as the set of solutions of a linear

### On the general equation of the second degree

On the general equation of the second degree S Kesavan The Institute of Mathematical Sciences, CIT Campus, Taramani, Chennai - 600 113 e-mail:kesh@imscresin Abstract We give a unified treatment of the

### ISOMETRIES OF R n KEITH CONRAD

ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x

### The Determinant: a Means to Calculate Volume

The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are

### Solving 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

### Applied 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

### MATH 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

### DETERMINANTS. 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

### Additional Topics in Linear Algebra Supplementary Material for Math 540. Joseph H. Silverman

Additional Topics in Linear Algebra Supplementary Material for Math 540 Joseph H Silverman E-mail address: jhs@mathbrownedu Mathematics Department, Box 1917 Brown University, Providence, RI 02912 USA Contents

### Chapter 8. Matrices II: inverses. 8.1 What is an inverse?

Chapter 8 Matrices II: inverses We have learnt how to add subtract and multiply matrices but we have not defined division. The reason is that in general it cannot always be defined. In this chapter, we

### Lecture 1: Schur s Unitary Triangularization Theorem

Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections

### Sergei Silvestrov, Christopher Engström, Karl Lundengård, Johan Richter, Jonas Österberg. November 13, 2014

Sergei Silvestrov,, Karl Lundengård, Johan Richter, Jonas Österberg November 13, 2014 Analysis Todays lecture: Course overview. Repetition of matrices elementary operations. Repetition of solvability of

### Introduction 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

### Linear Algebra Notes

Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note

### Numerical Methods I Solving Linear Systems: Sparse Matrices, Iterative Methods and Non-Square Systems

Numerical Methods I Solving Linear Systems: Sparse Matrices, Iterative Methods and Non-Square Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001,

### The determinant of a skew-symmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14

4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with

### Bindel, 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

### 2.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

### 160 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

### Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal

### Factorization 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

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Linear Systems. Singular and Nonsingular Matrices. Find x 1, x 2, x 3 such that the following three equations hold:

Linear Systems Example: Find x, x, x such that the following three equations hold: x + x + x = 4x + x + x = x + x + x = 6 We can write this using matrix-vector notation as 4 {{ A x x x {{ x = 6 {{ b General

### Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.

2 Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Theorem 8: Let A be a square matrix. Then the following statements are equivalent. That is, for a given A, the statements are either all true

### ASEN 3112 - Structures. MDOF Dynamic Systems. ASEN 3112 Lecture 1 Slide 1

19 MDOF Dynamic Systems ASEN 3112 Lecture 1 Slide 1 A Two-DOF Mass-Spring-Dashpot Dynamic System Consider the lumped-parameter, mass-spring-dashpot dynamic system shown in the Figure. It has two point

### 1 Solving LPs: The Simplex Algorithm of George Dantzig

Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.

### Lecture 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

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional 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 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### Lecture 5 - Triangular Factorizations & Operation Counts

LU Factorization Lecture 5 - Triangular Factorizations & Operation Counts We have seen that the process of GE essentially factors a matrix A into LU Now we want to see how this factorization allows us

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### 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.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### 2.5 Gaussian Elimination

page 150 150 CHAPTER 2 Matrices and Systems of Linear Equations 37 10 the linear algebra package of Maple, the three elementary 20 23 1 row operations are 12 1 swaprow(a,i,j): permute rows i and j 3 3

### Chapter 1 - Matrices & Determinants

Chapter 1 - Matrices & Determinants Arthur Cayley (August 16, 1821 - January 26, 1895) was a British Mathematician and Founder of the Modern British School of Pure Mathematics. As a child, Cayley enjoyed

### Bindel, Fall 2012 Matrix Computations (CS 6210) Week 8: Friday, Oct 12

Why eigenvalues? Week 8: Friday, Oct 12 I spend a lot of time thinking about eigenvalue problems. In part, this is because I look for problems that can be solved via eigenvalues. But I might have fewer

### 1 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

### MAT 242 Test 2 SOLUTIONS, FORM T

MAT 242 Test 2 SOLUTIONS, FORM T 5 3 5 3 3 3 3. Let v =, v 5 2 =, v 3 =, and v 5 4 =. 3 3 7 3 a. [ points] The set { v, v 2, v 3, v 4 } is linearly dependent. Find a nontrivial linear combination of these

### 15.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

### THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

### We shall turn our attention to solving linear systems of equations. Ax = b

59 Linear Algebra We shall turn our attention to solving linear systems of equations Ax = b where A R m n, x R n, and b R m. We already saw examples of methods that required the solution of a linear system

### Mathematics of Cryptography

CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter