Iterative Methods. Chapter Introduction Simple Iteration Example
|
|
- Blanche Lloyd
- 7 years ago
- Views:
Transcription
1 Chapter Iterative Methods.1 Introduction In this section, we will consider three different iterative methods for solving a sets of equations. First, we consider a series of examples to illustrate iterative methods. To construct an iterative method, we try and rearrange the system of equations such that we generate a sequence..1.1 Simple Iteration Example Example.1.1: Let us consider the equation 1 f(x) = x + e x = 0. (.1) y=e x When solving an equation such as (.1) for α α y= x where f(α) = 0, 0 < α <, we can generate a sequence {x (k) } k=0 x (0) by re-writing the equation as x = e x, from some initial value (guess) i.e. by computing x (k+1) = e x(k) from some x (0). If the series converges, it will converge to the solution. For example, let us consider x (0) = 1 and x (0) = 1: 1
2 k x (k) x (k) In this example, both sequences appear to converge to a value close to the root α = where 0 < α <. Hence, we have constructed a simple algorithm for solving an equation and it appears to be a robust iterative method. However, (.1) has two solutions: a positive root at and a negative root at Why do we only find one root? If f(x) = 0 has a solution x = α then x (k+1) = g(x (k) ) will converge to α, provided g (α) < 1 and x (0) is suitably chosen. The condition g (α) < 1 is a necessary condition. In the above example, and g(x) = e x and g (x) = e x, g (x) < 1 if x > 0. So this method can be used to find the positive root of (.1). However, it will never converge to the negative root. Hence, this kind of approach will not always converge to a solution..1. Linear Systems Let us adopt the same approach for a linear system. Example.1.:
3 Consider the following set of linear equations: Let us re-write these equations as Thus, we can use the following: 10x 1 + x = 1 x x = 1 x 1 = (1 x )/10 x = (1 x 1 )/10. x (k+1) 1 = 1. x (k) /10 x (k+1) =.1 x (k) 1 /10, to generate a sequence of vectors x (k) = (x (k) 1, x(k) )T from some starting vector, x (0). If then where x (0) = ( ) 0, x (1) = 0 x (0) = ( ) 1., x () =.1 x (k) ( ) 1 ( ) 0, 0 ( ) 0.99, x (3) = 1.98 as k, ( ) 1.00, which is indeed the correct answer. So we have generated a convergent sequence. Let us consider the above set of linear equations again. Possibly the more obvious rearrangement was Thus, we can generate a sequence using: x 1 = 1 10x x = 1 10x 1. x (k+1) 1 = 1 10x (k) x (k+1) = 1 10x (k) 1, If, we again use then x (0) = ( ) 0, x (1) = 0 x (0) = ( ) 1, x () = 1 3 ( ) 0, 0 ( ) 99, x (3) = 198 ( ) 1011,
4 Clearly, this sequence is not converging! Why? Example.1.3: Let us consider the above example (.1.) again. Can we find a method that allows the system to converge more quickly? Let us look at the computation more carefully. In the first step x (1) 1 is computed from x (0) and in the second step we compute x (1) from x (0) 1. It seems more natural, from a computational point of view, to use x (1) 1 rather then x (0) 1 in the second step. i.e. to use the latest available value. In effect, we want to compute the following: x (k+1) 1 = 1. x (k) /10 x (k+1) =.1 x (k+1) 1 /10, which gives, x (0) = ( ) 0, x (1) = 0 ( ) 1., x () = 1.98 ( ) ( ) 1, which converges to ( 1 ) much more rapidly! In the following sections, we will consider, in general terms, iterative methods for solving a system Ax = b. First, though we introduce some important results about a sequence of vectors. Sequences of Vectors..1 The Limit of a Sequence Let { x (k)} be a sequence in a Vector Space V. How do we know if this sequence has a limit? k=0 First observe that x = y x = y. i.e. two distinct objects in a Vector Space can have the same size. However, from rule 1 for norms (1.1) we know that if x y = 0, then x y. So if then The vector x is the limit of the sequence. lim k x(k) x = 0 lim k x(k) = x 4
5 .. Convergence of a Sequence Suppose the sequence {x (k) } k=0 converges to x, where x (k+1) = Bx (k) + c. If x (k) x for k, then x satisfies the equation: x = Bx + c, and so we have and thus, taking norms, If B < 1 then x (k+1) x = B(x (k) x), x (k+1) x B x (k) x. x (k+1) x < x (k) x, i.e. we have a monotonically decreasing sequence, or, in other words, the error in the approximations decreases. Say we start from an initial guess x (1) x = B(x (0) x). Then x () x = B(x (1) x) ( ) = B B(x (0) x) = B (x (0) x), and so on, to give x (k) x = B k (x (0) x). Taking norms, and using rule 5 (1.9) for sub-ordinate matrix norms x (k) x B k (x (0) x) B k 1 B (x (0) x) B k B (x (0) x) B k (x (0) x). If B < 1, then B k 0 as k and hence, x (k) x as k. Recall that ρ(b) B ( 1.5) so a necessary condition for convergence is ρ(b) < 1. Furthermore, it is possible to show that if ρ(b) < 1, then B < 1. and if ρ(b) > 1, then B > 1, although we do not prove these results in this course. Hence, ρ(b) < 1 is not only a necessary condition, but it is also sufficient condition. 5
6 ..3 Spectral radius and rate of convergence In numerical analysis, to compare different methods for solving systems of equations we are interested in determining the rate of convergence of the method. As we will see below the spectral radius is a measure of the rate of convergence. Consider the situation where B N N has N linearly independent eigenvectors. As before we have x (k+1) x = B(x (k) x), or substituting in for v (k) = x (k) x, we have v (k+1) = Bv (k). Now write v (0) = N i=1 α ie i where e i are the eigenvectors (with associated eigenvalues λ i ) of B, then continuing this sequence gives ( N ) v (1) = B α i e i = α i Be i = α i λ i e i, i=1 i=1 i=1 i=1 i=1 ( N ) v () = B α i λ i e i = α i λ i Be i = α i λ i e i, v (k) = Now suppose λ 1 > λ i (i =,...,N), then v (k) = α 1 λ k 1 e 1 + = λ k 1 [ α i λ k i e i. i=1 α 1 e 1 + α i λ k i e i i= i= i=1 ( ) ] k λi α i e i. λ 1 Given that λ i /λ 1 < 1, for large k, v (k) α 1 λ k 1e 1. Hence, the error associated with x (k), the kth vector in the sequence, is given by v (k) which varies as the kth power of the largest eigenvalue. In other words, it varies as the kth power of the spectral radius ρ(b) (= λ 1 ). So the spectral radius is a good indication of the rate of convergence...4 Gerschgorin s Theorem The above result means that if we know the magnitude of the largest vector of the iteration matrix we can estimate the rate of convergence of a system of equations for a particular method. However, this 6
7 requires the magnitudes of all eigenvalues to be known, which would probably have to be determined numerically. The Gerschgorin Theorem is a surprisingly simple result concerning eigenvalues that allows us to put bounds on the size of the eigenvalues of a matrix without actually finding the eigenvalues themselves. The equation Ae = λe, where (λ, e) are an eigenvalue, eigenvector pair of the matrix A, can be written in component notation as a ij e j = a ii e i + a ij e j = λe i. j i Rearranging implies and thus, e i (a ii λ) = a ij e j, e i a ii λ j i a ij e j. j i Suppose the component of eigenvector e with the largest absolute value is e l, such that e l e j for j (note e j 0 for all j). Then from above so,dividing by e l gives e l a ll λ a lj e j j l a ll λ a lj. j l a lj e l Each eigenvalue lies inside a circle with centre a ll and radius N a lj with j l. However, we don t know l without finding λ and e. But we can say that the union of all such circles must contain all the eigenvalues. This is Gerschgorin s Theorem. Example.5.1: Determine the bounds on the eigenvalues for the matrix A = j l
8 Gerschgorin s Theorem implies that the union of all circles must contain all eigenvalues. a ll λ a lj. j l For l = 1 and 4 we get the relation λ 1. For l = and 3 we get λ. The matrix is symmetric - the eigenvalues are real so Gerschgorin s Theorem implies 0 λ 4. The eigenvalues of A are λ 1 = 3.618, λ =.618, λ 3 = 1.38, and λ 4 = hence, the largest eigenvalue is indeed less than 4..3 The Jacobi Iterative Method The Jacobi Iterative Method follows the iterative method shown in Example.1.. Consider the linear system Ax = b, A N N = [a ij ], x N = [x i ], b N = [b i ]. Let us try to isolate x i. The ith equation looks like a ij x j = b i. Assuming a ii 0 for all i, we can re-write this as so, giving the recurrence relation a ii x i = b i x i = 1 a ii x (k+1) i = 1 a ii b i b i 8 a ij x j, j i a ij x j j i a ij x (k) j, (.) j i
9 for each x i (i = 1,..., N). This is known as the Jacobi Iterative Method. In matrix form, we have A = D L U, (.3) where D is a diagonal matrix with elements a ii, L is a strictly lower triangular matrix, L = [l ij ] such that a ij, i > j l ij = 0, i j, and U is a strictly upper triangular matrix, U = [u ij ] such that a ij, i < j u ij = 0, i j. The system becomes or, (D L U)x = b, Dx = (L + U)x + b. Dividing each equation by a ii is equivalent to writing x = D 1 (L + U)x + D 1 b where the elements of D 1 are 1/a ii, so we have pre-multiplied by the inverse of D. Hence, the matrix form of the iterative method (.), known as the Jacobi Iteration Method is x (k+1) = D 1 (L + U)x (k) + D 1 b. (.4) The matrix B J = D 1 (L + U) is called the iteration matrix for the Jacobi Iteration method..3.1 Convergence of the Jacobi Iteration Method From.. recall that an iterative method of the form x (k+1) = Bx (k) + c will converge provided B < 1 and that a necessary and sufficient condition for this is to be true is ρ(b) < 1. Thus, for the Jacobi method, we require B J = D 1 (L + U) < 1 for convergence and, hence, ρ(b J ) < 1. 9
10 Example.3.1: Let us return once more to Example.1. and recast it in the form of the Jacobi iterative method. The linear system we wish to solve is Ax = 10 1 x 1 = 1 = b The first thing we need to do is find D and L + U where A = D L U: A = 10 1 D = 10 0 and L + U = hence, D 1 (L + U) = B J = 0 1/10. 1/10 0 Now choosing the matrix norm sub-ordinate to the infinity norm we find B J = 1 10 < 1. Alternatively we can consider the spectral radius of B J. The eigenvalues of B J are given by λ 1/100 = 0 x and so which in this case is equal to B J. ρ(b J ) = 1 10, So if x is the limit to our sequence then x (k+1) x 1 10 x(k) x. In Example.1.. we had so x (0) x = and Remember, so, and indeed, x (0) = ( ) 0 0 and x = ( ) 1, x (1) x 1 10 = 0.. x (1) = x (1) x = ( ) 1.,.1 ( ) x (1) x 0.. Since the size of ρ(b J ) is an indication of the rate of convergence we see here that this system converges at a rate of ρ(b J ) = 0.1. The smaller the spectral radius the more rapid the convergence. So is it possible to modify this method to make it faster? 30
11 .4 The Gauss-Seidel Iterative Method To produce a faster iterative method we amend the Jacobi Method to make use of the new values as they become available (e.g. as in Example...). Expanding out the Jacobi Method (.4) we have x (k+1) = D 1 (L + U)x (k) + D 1 b = D 1 Lx (k) + D 1 Ux (k) + D 1 b. Here D 1 L is a lower triangular matrix so the ith row of D 1 Lx (k) contains the values x (k) 1, x(k), x(k) 3,...,x(k) i 1. (components up to, but not including the diagonal). Likewise, D 1 U is an upper triangular matrix so the ith row contains x (k) i+1, x(k) i+,..., x(k) N. If we compute the x (k+1) i s in the order of increasing i (i.e. from the top of the vector to the bottom) then when computing x (k+1) i, we have available x (k+1) 1, x (k+1),..., x (k+1) i 1. Hence, a more efficient version of the Jacobi Method is to compute (in the order of increasing i) x (k+1) = D 1 Lx (k+1) + D 1 Ux (k) + D 1 b. This is equivalent to finding x (k+1) from (I D 1 L)x (k+1) = D 1 Ux (k) + D 1 b, or, x (k+1) = (I D 1 L) 1 D 1 Ux (k) + (I D 1 L) 1 D 1 b. This is known as the Gauss-Seidel Iterative Method. The iteration matrix becomes B GS = (I D 1 L) 1 D 1 U = [D(I D 1 L)] 1 U = (D L) 1 U. 31
12 The way of deriving the Gauss-Seidel method formally is as follows: A = D L U, so Ax = b becomes and hence, (D L)x = Ux + b, x = (D L) 1 Ux + (D L) 1 b, generating the recurrence relation x (k+1) = (D L) 1 Ux (k) + (D L) 1 b. (.5) The iteration matrix for the Gauss-Seidel method is given by B GS = (D L) 1 U. Thus, for convergence (from..) we require that B GS = (D L) 1 U < 1. Example.4.1: Again we reconsider the linear system used in Examples (.1.,.1.3 &.3.1) and recast it in the form of the Gauss-Seidel Method: A = 10 1, 1 10 and since A = D L U, we have D L = 10 0 and U = Then (D L) 1 = 1/10 0, so (D L) 1 U = 1/10 0 1, 1/100 1/10 1/100 1/ and thus the Gauss-Seidel iteration matrix is B GS = (D L) 1 U = 0 1/ /100 Clearly, the norm of the iteration matrix is B GS = (D L) 1 U = 1 10 < 1, and hence, the method will converge for this example. Let us look at the eigenvalues to get a feel for the rate of convergence. The eigenvalues are given by λ det 1/10 = 0, 0 1/100 λ 3
13 or, ( λ 1 ) λ = 0, 100 so we have and hence, λ = 0 or λ = 1 100, ρ(b GS ) = ρ [ (D L) 1 U ] = Observe that in this example even though B GS = B J we have ρ(b GS ) = [ρ(b J )] (cf Example.3.1), implying that Gauss-Seidel converges twice as fast as Jacobi..5 The Successive Over Relaxation Iterative Method The third iterative method we will consider is a method which accelerates the Gauss-Seidel method. Consider the system Ax = b, with A = D L U as before. When trying to solve Ax = b, we obtain an approximate solution x (k) of the true solution x. The quantity r (k) = b Ax (k) is called a residual and it is a measure of the accuracy of x (k). Clearly, we would like to make the residual r (k) to be as small as possible for each approximate solution x (k). Now remember, when calculating x (k) i, the components x (k+1) 1,..., x (k+1) i 1 are already known. So in the Gauss-Seidel iterative method for the most recent approximation, the residual vector is given by r (k) = b Dx (k) + Lx (k+1) + Ux (k). Ultimately, we wish to make x x (k) as small as possible. However, as we don t know x yet, we instead consider x (k+1) x (k) as a measure for x x (k). We now wish to calculate x (k+1) such that D(x (k+1) x (k) ) = ω(b Dx (k) + Lx (k+1) + Ux (k) ), where ω is called the relaxation parameter. Re-arranging, we get (D ωl)x (k+1) = ((1 ω)d + ωu)x (k) + ωb, and hence, the recurrence relation is given by x (k+1) = (D ωl) 1 ((1 ω)d + ωu)x (k) + (D ωl) 1 ωb. (.6) The process of reducing residuals at each stage is called Successive Relaxation. If 0 < ω < 1, the iterative method is known as a Successive Under Relaxation and they can be used to obtain convergence when the Gauss-Seidel scheme is not convergent. For choices of ω > 1 the scheme 33
14 is a Successive Over-Relaxation and is used to accelerate convergent Gauss-Seidel iterations. Note, ω = 1 is simply the Gauss-Seidel Iterative Method. The iteration matrix for the S.O.R. method - Successive Over-Relaxation with ω > 1 is given by B SOR = (D ωl) 1 [(1 ω)d + ωu]. The iteration matrix B SOR can be derived by splitting A in the following way: ( A = D L U = D 1 1 ) + 1 ω ω D L U, ω > 0. Thus Ax = b can be written as ( ) ( ( 1 ω D L x = 1 1 ) ) D + U x + b ω (D ωl)x = ((1 ω)d + ωu)x + ωb, so, B SOR = (D ωl) 1 [(1 ω)d + ωu] The aim is to choose ω such that the rate of convergence is maximised, that is the spectral radius, ρ(b SOR (ω)), is minimised. How do we find the value of ω that does this? There is no complete answer for general N N systems, but it is known that if, for each, 1 i N, a ii 0 then ρ(b SOR ) 1 ω. This means that for convergence we must have 0 < ω <. Example.6.1: We return once more to the linear system considered throughout this chapter in Examples (.1.1,.1.,.3.1 &.4.1) and recast it here in terms of the SOR iterative method. Recall, A = 10 1, 1 10 and A = D L U such that (1 ω)d + ωu = (1 ω) ω (1 ω) = ω, (1 ω) and Now (D ωl) = 10 0 ω 0 0 = ω 10 (D ωl) 1 = 1/10 0, ω/100 1/10 34
15 thus the iteration matrix B SOR = (D ωl) 1 [(1 ω)d + ωu] = 1 ω ω(1 ω) 10 The eigenvalues of this matrix are given by ( ) ω [(1 ω) λ] ω λ ω (1 ω) = 0, 100 ] ( ) λ λ [(1 ω) + ω ω ω + (1 ω) ω ] λ λ [(1 ω) + ω + (1 ω) = Solving this quadratic for λ gives ( λ = 1 (1 ω) + ω 100 ± = (1 ω) + ω 00 ± 1 [4(1 ω) ω = (1 ω) + ω 00 ± ω 0 [4(1 ω) + 4(1 ω) ω ω ] 1/. [4(1 ω) + ω 100 ] 1/ ω/10. ω ω ω (1 ω) 100 = 0, ] 1/ ) ω4 4(1 ω) When ω = 1 (the Gauss-Seidel Method), one root is 0 and the other is 100. Changing ω changes these roots. Suppose we select ω such that 4(1 ω) + ω 100 = 0, so there are equal roots to the equation. Then this implies, ω = (1 ω) and λ = ω The smallest value of ω (ω > 1) producing equal roots is ω = , which is not very different (ω 1) to Gauss-Seidel! However, the spectral radius of the SOR iteration matrix is just compared with ρ(b GS )=0.01. ρ(b SOR ) = ρ(b) is very sensitive to ω. If you can hit the right value, the improvement in speed of convergence of the iteration method is significant. Although this example is only a matrix, the comments apply in general. For a larger set of equations, convergence of Gauss-Seidel can be slow and SOR with an optimum value of ω (if it can be found) can be a major improvement. 35
16 .6 Convergence of the SOR Method for Consistently Ordered Matrices In general, it is not easy to find an appropriate ω for the SOR method and so an ω is usually chosen which lies in the range 1 < ω < and leads to a spectral radius, ρ(b SOR ) which is as small as reasonably possible. However, there are a set of matrices for which it is relatively easy to find the optimum ω. Consider the linear system Ax = b and let A = D L U. If the eigenvalues of ( αd 1 L + 1 ) α D 1 U, α 0, are independent of α, then the matrix is said to be Consistently Ordered, and the optimum ω for the SOR iterative method is Explanation w = ρ (B J ). First, we note that for such a matrix, consistently ordered (eigenvalues are the same for all α) implies that the eigenvalues of αd 1 L + 1 α D 1 U are the same as those for D 1 L + D 1 U = B J, the Jacobi iterative matrix (i.e. put α = 1). Now consider the eigenvalues of B SOR. They satisfy the polynomial det(b SOR λi) = 0 or det [ (D ωl) 1 ((1 ω)d + ωu) λi ] = 0, and hence, det(d ωl) 1 det[(1 ω)d + ωu λ(d ωl)] = 0, }{{} 0 so λ satisfy det[(1 ω λ)d + ωu + λωl] = 0. Since ω 0, the non-zero eigenvalues satisfy [( (1 ω λ) det ω D + 1 U + ) λl ω ] λ = 0, λ λ 36
17 and thus, [ λd det 1 L + 1 D 1 U λ When consistently ordered, the eigenvalues of are the same as those of D 1 (L + U) = B J. (λ + ω 1) ω λ λd 1 L + 1 λ D 1 U ] I = 0. Let the eigenvalues of B J be µ, then the non-zero eigenvalues of B SOR satisfy µ = λ + ω 1 ω λ If we put ω = 1 (i.e. recover Gauss-Seidel), then µ = λ λ, or λ = µ. (Recall Example.4.1 where this result was also found).. For ω 0, we have or, µ ω λ = λ + λ(ω 1) + (ω 1), λ + λ(ω µ ω ) + (ω 1) = 0. The eigenvalues λ of B SOR are then given by λ = (ω 1) + µ ω ± 1 4(ω 1) 4(ω 1)µ ω 4(ω 1) + µ 4 ω 4 = 1 ω + µ ω ± (1 ω)µ ω + µ4 ω 4 4 = 1 ω + µ ω ± µω (1 ω) + µ ω. 4 For each µ there are values of λ, these may be real or complex. If complex (note ω > 1), then λλ = (ω 1) or λ = ω 1. Hence, ρ(b SOR ) = ω 1. For the fastest convergence we require ρ(b SOR ) to be as small as possible. It can be shown that the best outcome is to make the roots of B SOR equal when µ = ρ(b J ), i.e. when µ is largest. This implies Solving for ω yields µ ω ω + 1 = 0. 4 ω = 1 ± 1 µ µ, / ( ) = 1 (1 µ ) µ 1, 1 µ = 1 1 µ. 37
18 We are looking for the smallest value of ω and so we take the positive root of the above equation. Hence, with µ = ρ(b J ), the best possible choice for ω is ω = (ρ(b J )). Example.6.1: We again return to Example (..1,..,.3.1 &.4.1) and show that it is a consistently ordered matrix and determine the minimum ω, and hence, the fastest rate of convergence for the SOR method. As before we have then A = 10 1, 1 10 αd 1 L + 1 α D 1 U = α, α 10 0 and the eigenvalues are given by ( λ 1 ) ( α ) = 0 10α 10 so λ = 1 100, and hence, the matrix is consistently ordered. Then by applying the above formulae and recalling that the eigenvalues of B J are µ = 1/10 (Example.3.1) we have ω = (ρ(b J )) = (1/100), = This is essentially the same value as we found in Example.5.1. Thus the fastest rate of convergence for this particular system is ρ(b SOR ) = , as shown in Example
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
More informationGeneral Framework for an Iterative Solution of Ax b. Jacobi s Method
2.6 Iterative Solutions of Linear Systems 143 2.6 Iterative Solutions of Linear Systems Consistent linear systems in real life are solved in one of two ways: by direct calculation (using a matrix factorization,
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 informationby 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
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 informationNotes 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
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 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 informationAbstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).
MAT 2 (Badger, Spring 202) LU Factorization Selected Notes September 2, 202 Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix
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 informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
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 informationMATH10212 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
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 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 informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional 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 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 informationIterative Methods for Solving Linear Systems
Chapter 5 Iterative Methods for Solving Linear Systems 5.1 Convergence of Sequences of Vectors and Matrices In Chapter 2 we have discussed some of the main methods for solving systems of linear equations.
More information10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method
578 CHAPTER 1 NUMERICAL METHODS 1. ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS As a numerical technique, Gaussian elimination is rather unusual because it is direct. That is, a solution is obtained after
More informationVieta s Formulas and the Identity Theorem
Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion
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 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 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 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 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 informationUniversity 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
More informationNonlinear Algebraic Equations Example
Nonlinear Algebraic Equations Example Continuous Stirred Tank Reactor (CSTR). Look for steady state concentrations & temperature. s r (in) p,i (in) i In: N spieces with concentrations c, heat capacities
More information1 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.
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationOperation Count; Numerical Linear Algebra
10 Operation Count; Numerical Linear Algebra 10.1 Introduction Many computations are limited simply by the sheer number of required additions, multiplications, or function evaluations. If floating-point
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 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 informationSolutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationIncreasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
More informationNumerical Methods I Eigenvalue Problems
Numerical Methods I Eigenvalue Problems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001, Fall 2010 September 30th, 2010 A. Donev (Courant Institute)
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 informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationLinear 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.
More informationSolving Quadratic Equations
9.3 Solving Quadratic Equations by Using the Quadratic Formula 9.3 OBJECTIVES 1. Solve a quadratic equation by using the quadratic formula 2. Determine the nature of the solutions of a quadratic equation
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 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 informationChapter 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
More informationLinear 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
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
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 informationScalar Valued Functions of Several Variables; the Gradient Vector
Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions vector valued function of n variables: Let us consider a scalar (i.e., numerical, rather than y = φ(x = φ(x 1,
More informationThe Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method
The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method Robert M. Freund February, 004 004 Massachusetts Institute of Technology. 1 1 The Algorithm The problem
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 informationDERIVATIVES AS MATRICES; CHAIN RULE
DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we
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 informationLinear Programming Problems
Linear Programming Problems Linear programming problems come up in many applications. In a linear programming problem, we have a function, called the objective function, which depends linearly on a number
More informationUnit 18 Determinants
Unit 18 Determinants Every square matrix has a number associated with it, called its determinant. In this section, we determine how to calculate this number, and also look at some of the properties of
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 informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More information8 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
More informationThe Method of Partial Fractions Math 121 Calculus II Spring 2015
Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method
More informationa 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
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 informationMAT 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
More information6. Cholesky factorization
6. Cholesky factorization EE103 (Fall 2011-12) triangular matrices forward and backward substitution the Cholesky factorization solving Ax = b with A positive definite inverse of a positive definite matrix
More informationZeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
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 informationTo give it a definition, an implicit function of x and y is simply any relationship that takes the form:
2 Implicit function theorems and applications 21 Implicit functions The implicit function theorem is one of the most useful single tools you ll meet this year After a while, it will be second nature to
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 informationASEN 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
More informationReview of Fundamental Mathematics
Review of Fundamental Mathematics As explained in the Preface and in Chapter 1 of your textbook, managerial economics applies microeconomic theory to business decision making. The decision-making tools
More information7.6 Approximation Errors and Simpson's Rule
WileyPLUS: Home Help Contact us Logout Hughes-Hallett, Calculus: Single and Multivariable, 4/e Calculus I, II, and Vector Calculus Reading content Integration 7.1. Integration by Substitution 7.2. Integration
More information3.2. Solving quadratic equations. Introduction. Prerequisites. Learning Outcomes. Learning Style
Solving quadratic equations 3.2 Introduction A quadratic equation is one which can be written in the form ax 2 + bx + c = 0 where a, b and c are numbers and x is the unknown whose value(s) we wish to find.
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationNumerical 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,
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More information5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
More informationContinued 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
More informationChapter 20. Vector Spaces and Bases
Chapter 20. Vector Spaces and Bases In this course, we have proceeded step-by-step through low-dimensional Linear Algebra. We have looked at lines, planes, hyperplanes, and have seen that there is no limit
More information2.4 Real Zeros of Polynomial Functions
SECTION 2.4 Real Zeros of Polynomial Functions 197 What you ll learn about Long Division and the Division Algorithm Remainder and Factor Theorems Synthetic Division Rational Zeros Theorem Upper and Lower
More informationChapter 19. General Matrices. An n m matrix is an array. a 11 a 12 a 1m a 21 a 22 a 2m A = a n1 a n2 a nm. The matrix A has n row vectors
Chapter 9. General Matrices An n m matrix is an array a a a m a a a m... = [a ij]. a n a n a nm The matrix A has n row vectors and m column vectors row i (A) = [a i, a i,..., a im ] R m a j a j a nj col
More information(Quasi-)Newton methods
(Quasi-)Newton methods 1 Introduction 1.1 Newton method Newton method is a method to find the zeros of a differentiable non-linear function g, x such that g(x) = 0, where g : R n R n. Given a starting
More informationis identically equal to x 2 +3x +2
Partial fractions 3.6 Introduction It is often helpful to break down a complicated algebraic fraction into a sum of simpler fractions. 4x+7 For example it can be shown that has the same value as 1 + 3
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
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 informationZeros of Polynomial Functions
Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of
More informationLinearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation
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 informationLecture 5: Singular Value Decomposition SVD (1)
EEM3L1: Numerical and Analytical Techniques Lecture 5: Singular Value Decomposition SVD (1) EE3L1, slide 1, Version 4: 25-Sep-02 Motivation for SVD (1) SVD = Singular Value Decomposition Consider the system
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationMA106 Linear Algebra lecture notes
MA106 Linear Algebra lecture notes Lecturers: Martin Bright and Daan Krammer Warwick, January 2011 Contents 1 Number systems and fields 3 1.1 Axioms for number systems......................... 3 2 Vector
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 informationSolution 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
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationNetwork Traffic Modelling
University of York Dissertation submitted for the MSc in Mathematics with Modern Applications, Department of Mathematics, University of York, UK. August 009 Network Traffic Modelling Author: David Slade
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationPolynomial and Rational Functions
Polynomial and Rational Functions Quadratic Functions Overview of Objectives, students should be able to: 1. Recognize the characteristics of parabolas. 2. Find the intercepts a. x intercepts by solving
More informationLecture 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
More informationDETERMINANTS TERRY A. LORING
DETERMINANTS TERRY A. LORING 1. Determinants: a Row Operation By-Product The determinant is best understood in terms of row operations, in my opinion. Most books start by defining the determinant via formulas
More informationInner 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,
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More information