7 Gaussian Elimination and LU Factorization

Size: px
Start display at page:

Transcription

1 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 for solving systems of linear equations) The basic idea is to use left-multiplication of A C m m by (elementary) lower triangular matrices, L, L,, L m to convert A to upper triangular form, ie, L m L m L L } {{ } A = U = e L Note that the product of lower triangular matrices is a lower triangular matrix, and the inverse of a lower triangular matrix is also lower triangular Therefore, LA = U A = LU, where L = L This approach can be viewed as triangular triangularization 7 Why Would We Want to Do This? Consider the system Ax = b with LU factorization A = LU Then we have L }{{} Ux = b =y Therefore we can perform (a now familiar) -step solution procedure: Solve the lower triangular system Ly = b for y by forward substitution Solve the upper triangular system Ux = y for x by back substitution Moreover, consider the problem AX = B (ie, many different right-hand sides that are associated with the same system matrix) In this case we need to compute the factorization A = LU only once, and then and we proceed as before: AX = B LUX = B, Solve LY = B by many forward substitutions (in parallel) Solve UX = Y by many back substitutions (in parallel) In order to appreciate the usefulness of this approach note that the operations count for the matrix factorization is O( 3 m3 ), while that for forward and back substitution is O(m ) Example Take the matrix A =

2 and compute its LU factorization by applying elementary lower triangular transformation matrices We choose L such that left-multiplication corresponds to subtracting multiples of row from the rows below such that the entries in the first column of A are zeroed out (cf the first homework assignment) Thus L A = = Next, we repeat this operation analogously for L (in order to zero what is left in column of the matrix on the right-hand side above): 0 0 L (L A) = = 0 3 = U Now L = (L L ) = L so that L = L with L = and L = Remark Note that L always is a unit lower triangular matrix, ie, it has ones on the diagonal Moreover, L is always obtained as above, ie, the multipliers are accumulated into the lower triangular part with a change of sign The claims made above can be verified as follows First, we note that the multipliers in L k are of the form l jk = a jk, j = k +,, m, a kk so that Now, let L k = l k+,k l m,k l k = 0 0 l k+,k 60 l m,k,

3 Then L k = I l k e k, and therefore (I l k e k } {{ } ) (I + l k ek ) = I l } {{ } k e k l ke k = I, =L k L k since the inner product e k l k = 0 because the only nonzero entry in e k (the in the k-th position) does not hit any nonzero entries in l k which start in the k + -st position So, for any k we have L k = l k+,k l m,k as claimed In addition, L k L k+ = (I + l k e k ) ( I + l k+ e ) k+ = I + l k e k + l k+e k+ + l k e k l k+ } {{ } =0 and in general we have = L = L L m = l k+,k We can summarize the factorization in Algorithm (LU Factorization) Initialize U = A, L = I for k = : m for j = k + : m e k+ l k+,k+ l m,k l m,k+ l, l 3, l m, l m, l m,m, 6

4 end L(j, k) = U(j, k)/u(k, k) U(j, k : m) = U(j, k : m) L(j, k)u(k, k : m) end Remark In practice one can actually store both L and U in the original matrix A since it is known that the diagonal of L consists of all ones The LU factorization is the cheapest factorization algorithm Its operations count can be verified to be O( 3 m3 ) However, LU factorization cannot be guaranteed to be stable The following examples illustrate this fact Example A fundamental problem is given if we encounter a zero pivot as in A = 5 = L A = Now the (,) position contains a zero and the algorithm will break down since it will attempt to divide by zero Example A more subtle example is the following backward instability Take A = + ε 5 with small ε If ε = then we have the initial example in this chapter, and for ε = 0 we get the previous example LU factorization will result in and The multipliers were L A = L L A = L = 0 ε ε ε ε Now we assume that a right-hand side b is given as b = 0 0 and we attempt to solve Ax = b via 6 = U

5 Solve Ly = b Solve Ux = y If ε is on the order of machine accuracy, then the 4 in the entry 4 6 ε insignificant Therefore, we have Ũ = 0 ε 3 and L = L, ε in U is which leads to LŨ = + ε A In fact, the product is significantly different from A Thus, using L and Ũ we are not able to solve a nearby problem, and thus the LU factorization method is not backward stable If we use the factorization based on L and Ũ with the above right-hand side b, then we obtain 3 ε x = 3 ε 3 3 Whereas if we were to use the exact factorization A = LU, then we get the exact answer 7 3 x = 3 3 4ε 7 ε 3 ε 3 ε ε 3 Remark Even though L and Ũ are close to L and U, the product LŨ is not close to LU = A and the computed solution x is worthless 7 Pivoting Example The breakdown of the algorithm in our earlier example with L A = can be prevented by simply swapping rows, ie, instead of trying to apply L to L A we first create 0 0 P L A = 0 0 L A = and are done 63

6 More generally, stability problems can be avoided by swapping rows before applying L k, ie, we perform L m P m L P L P A = U The strategy we use for swapping rows in step k is to find the largest element in column k below (and including) the diagonal the so-called pivot element and swap its row with row k This process is referred to as partial (row) pivoting Partial column pivoting and complete (row and column) pivoting are also possible, but not very popular Example Consider again the matrix A = + ε 5 The largest element in the first column is the 4 in the (3, ) position This is our first pivot, and we swap rows and 3 Therefore 0 0 P A = ε 5 = + ε 5, 0 0 and then L P A = ε 5 = 0 ε 0 Now we need to pick the second pivot element For sufficiently small ε (in fact, unless < ε < 3 ), we pick ε as the largest element in the second column below the first row Therefore, the second permutation matrix is just the identity, and we have 0 0 P L P A = ε = 0 ε To complete the elimination phase, we need to perform the elimination in the second column: 0 0 L P L P A = ε = 0 ε = U 0 (ε ) 0 3 ε 0 0 (ε ) The lower triangular matrix L is given by L = L L = and assuming that ε we get 0 0 L = 0 and Ũ = 4 64 (ε ),

7 If we now check the computed factorization LŨ, then we see LŨ = 5 = P Ã, which is just a permuted version of the original matrix A with permutation matrix 0 0 P = P P = Thus, this approach was backward stable Finally, since we have the factorization P A = LU, we can solve the linear system Ax = b as P Ax = P b LUx = P b, and apply the usual two-step procedure Solve the lower triangular system Ly = P b for y Solve the upper triangular system Ux = y for x This yields x = 7+4ε 3+ε ε 3 ε ε 3 If we use the rounded factors L and Ũ instead, then the computed solution is 7 3 x = 3, 3 which is the exact answer to the problem (see also the Maple worksheet 473 LUmws) In general, LU factorization with pivoting results in P A = LU, where P = P m P m P P, and L = (L m L m L L ) with L k = P m P k+ L k P k+ P m, ie, L k is the same as L k except that the entries below the diagonal are appropriately permuted In particular, L k is still lower triangular Remark Since the permutation matrices used here involve only a single row swap each we have P k = P k (while in general, of course, P = P T ) In the example above L = L, and L = P L P = L since P = I 65

8 Remark Due to the pivoting strategy the multipliers will always satisfy l ij A possible interpretation of the pivoting strategy is that the matrix P is determined so that it would yield a permuted matrix A whose standard LU factorization is backward stable Of course, we do not know how to do this in advance, and so the P is determined as the algorithm progresses An algorithm for the factorization of an m m matrix A is given by Algorithm (LU Factorization with Partial Pivoting) Initialize U = A, L = I, P = I for k = : m end find i k to maximize U(i, k) U(k, k : m) U(i, k : m) L(k, : k ) L(i, : k ) P (k, :) P (i, :) for j = k + : m end L(j, k) = U(j, k)/u(k, k) U(j, k : m) = U(j, k : m) L(j, k)u(k, k : m) The operations count for this algorithm is also O( 3 m ) However, while the swaps for partial pivoting require O(m ) operations, they would require O(m 3 ) operations in the case of complete pivoting Remark The algorithm above is not really practical since one would usually not physically swap rows Instead one would use pointers to the swapped rows and store the permutation operations instead 73 Stability We saw earlier that Gaussian elimination without pivoting is can be unstable According to our previous example the algorithm with pivoting seems to be stable What can be proven theoretically? Since the entries of L are at most in absolute value, the LU factorization becomes unstable if the entries of U are unbounded relative to those of A (we need L U = O( P A ) Therefore we define a growth factor One can show ρ = max i,j U(i, j) max i,j A(i, j) Theorem 7 Let A C m m Then LU factorization with partial pivoting guarantees that ρ m 66

9 This bound is unacceptably high, and indicates that the algorithm (with pivoting) can be unstable The following (contrived) example illustrates this Example Take A = Then LU factorization produces the following sequence of matrices: and we see that the largest element in U is 6 = m = U, Remark BUT in practice it turns out that matrices which such large growth factors almost never arise For most practical cases a realistic bound on ρ seems to be m This is still an active area of research and some more details can be found in the [Trefethen/Bau] book In summary we can say that for most practical purposes LU factorization with partial pivoting is considered to be a stable algorithm 74 Cholesky Factorization In the case when the matrix A is Hermitian (or symmetric) positive definite we can devise a faster (and more stable) algorithm Recall that A C m m is Hermitian if A = A This implies x Ay = y Ax for any x, y C m (see homework for details) If we let y = x then we see that x Ax is real Now, if x Ax > 0 for any x 0 then A is called Hermitian positive definite Remark Symmetric positive definite matrices are defined analogously with replaced by T 74 Some Properties of Positive Definite Matrices Assume A C m m is positive definite If X C m n has full rank, then X AX C n n is positive definite 67

10 Any principal submatrix (ie, the intersection of a set of rows and the corresponding columns) of A is positive definite 3 All diagonal entries of A are positive and real 4 The maximum element of A is on the diagonal 5 All eigenvalues of A are positive 74 How Does Cholesky Factorization Work? Consider the Hermitian positive definite A C m m in block form [ ] w A = w K and apply the first step of the LU factorization algorithm Then [ ] [ ] 0 T w A = w I 0 K ww The main idea of the Cholesky factorization algorithms is to take advantage of the fact that A is Hermitian and perform operations symmetrically, ie, also zero the first row Thus [ ] [ ] [ ] 0 T 0 T w A = w I 0 K ww 0 I Note that the three matrices are lower triangular, block-diagonal, and upper triangular (in fact the adjoint of the lower triangular factor) Now we continue iteratively However, in general A will not have a in the upper left-hand corner We will have to be able to deal with an arbitrary (albeit positive) entry in the (,) position Therefore we reconsider the first step with slightly more general notation, ie, [ a w A = ] w K so that A = [ a 0 T a w I ] [ 0 T 0 K a ww ] [ a a w 0 I ] = R A R Now we can iterate on the inner matrix A Note that the (,) entry of K ww /a has to be positive since A was positive definite and R is nonsingular This guarantees that A = R AR is positive definite and therefore has positive diagonal entries The iteration yields A = RA R so that and eventually A = R R A R R, A = RR Rm R } {{ } m R R, } {{ } =R =R 68

11 the Cholesky factorization of A Note that R is upper triangular and its diagonal is positive (because of the square roots) Thus we have proved Theorem 7 Every Hermitian positive definite matrix A has a unique Cholesky factorization A = R R with R an upper triangular matrix with positive diagonal entries Example Consider A = Cholesky factorization as explained above yields the sequence A = = Distributing copies of the identity matrix in the middle we arrive at 0 0 R = Algorithm (Cholesky Factorization) initialize R = upper triangular part of A (including the diagonal) for k = : m end for j = k + : m end R(j, j : m) = R(j, j : m) R(k, j : m) R(k,j) R(k,k) R(k, k : m) = R(k, k : m)/ R(k, k) The operations count for the Cholesky algorithm can be computed as m m (m k + ) + ((m j + ) + ) = 3 m3 + m m k= j=k+ Thus the count is O( 3 m3 ), which is half the amount needed for the LU factorization Another nice feature of Cholesky factorization is that it is always stable even without pivoting 69

12 Remark The simplest (and cheapest) way to test whether a matrix is positive definite is to run Cholesky factorization it If the algorithm works it is, if not, it isn t The solution of Ax = b with Hermitian positive definite A is given by: Compute Cholesky factorization A = R R Solve the lower triangular system R y = b for y 3 Solve the upper triangular system Rx = y for x 70

Abstract: 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

Direct 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

7. LU factorization. factor-solve method. LU factorization. solving Ax = b with A nonsingular. the inverse of a nonsingular matrix

7. LU factorization EE103 (Fall 2011-12) factor-solve method LU factorization solving Ax = b with A nonsingular the inverse of a nonsingular matrix LU factorization algorithm effect of rounding error sparse

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

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

SOLVING LINEAR SYSTEMS

SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis

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 +

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

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

Lecture 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

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

Elementary Matrices and The LU Factorization

lementary Matrices and The LU Factorization Definition: ny matrix obtained by performing a single elementary row operation (RO) on the identity (unit) matrix is called an elementary matrix. There are three

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

Solving 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

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.

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

Solving Linear Systems of Equations. Gerald Recktenwald Portland State University Mechanical Engineering Department gerry@me.pdx.

Solving Linear Systems of Equations Gerald Recktenwald Portland State University Mechanical Engineering Department gerry@me.pdx.edu These slides are a supplement to the book Numerical Methods with Matlab:

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

13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms

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

1.2 Solving a System of Linear Equations

1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables

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

Linear Programming. March 14, 2014

Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1

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

Unit 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

Row Echelon Form and Reduced Row Echelon Form

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

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

Similar 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

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

Lecture 1: Systems of Linear Equations

MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables

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

Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

Solution to Homework 2

Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if

Methods for Finding Bases

Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,

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

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

Operation 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

MATRICES WITH DISPLACEMENT STRUCTURE A SURVEY

MATRICES WITH DISPLACEMENT STRUCTURE A SURVEY PLAMEN KOEV Abstract In the following survey we look at structured matrices with what is referred to as low displacement rank Matrices like Cauchy Vandermonde

Solving 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

[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:

Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices

Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices Solving square systems of linear equations; inverse matrices. Linear algebra is essentially about solving systems of linear equations,

Numerical 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)

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

DETERMINANTS 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

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

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. September 23, 2010

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

Linear Programming in Matrix Form

Linear Programming in Matrix Form Appendix B We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm,

Solving Systems of Linear Equations Using Matrices

Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections

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

Using row reduction to calculate the inverse and the determinant of a square matrix

Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible

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

Linear Algebra: Determinants, Inverses, Rank

D Linear Algebra: Determinants, Inverses, Rank D 1 Appendix D: LINEAR ALGEBRA: DETERMINANTS, INVERSES, RANK TABLE OF CONTENTS Page D.1. Introduction D 3 D.2. Determinants D 3 D.2.1. Some Properties of

DATA 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

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

Solutions 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

SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA

SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA This handout presents the second derivative test for a local extrema of a Lagrange multiplier problem. The Section 1 presents a geometric motivation for the

Linear 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

2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system

1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables

Suk-Geun Hwang and Jin-Woo Park

Bull. Korean Math. Soc. 43 (2006), No. 3, pp. 471 478 A NOTE ON PARTIAL SIGN-SOLVABILITY Suk-Geun Hwang and Jin-Woo Park Abstract. In this paper we prove that if Ax = b is a partial signsolvable linear

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

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,

Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

Continuity 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

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

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

Chapter 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

1 Review of Least Squares Solutions to Overdetermined Systems

cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares

MAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =

MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the

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

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

A note on companion matrices

Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod

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

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

Math 2270 - Lecture 33 : Positive Definite Matrices

Math 2270 - Lecture 33 : Positive Definite Matrices Dylan Zwick Fall 2012 This lecture covers section 6.5 of the textbook. Today we re going to talk about a special type of symmetric matrix, called a positive

Linear Programming. April 12, 2005

Linear Programming April 1, 005 Parts of this were adapted from Chapter 9 of i Introduction to Algorithms (Second Edition) /i by Cormen, Leiserson, Rivest and Stein. 1 What is linear programming? The first

1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S

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

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.

Orthogonal Bases and the QR Algorithm

Orthogonal Bases and the QR Algorithm Orthogonal Bases by Peter J Olver University of Minnesota Throughout, we work in the Euclidean vector space V = R n, the space of column vectors with n real entries

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

The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression The SVD is the most generally applicable of the orthogonal-diagonal-orthogonal type matrix decompositions Every

General 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,

OPRE 6201 : 2. Simplex Method

OPRE 6201 : 2. Simplex Method 1 The Graphical Method: An Example Consider the following linear program: Max 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2

Linear Equations ! 25 30 35\$ & " 350 150% & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development

MathsTrack (NOTE Feb 2013: This is the old version of MathsTrack. New books will be created during 2013 and 2014) Topic 4 Module 9 Introduction Systems of to Matrices Linear Equations Income = Tickets!

UNCOUPLING THE PERRON EIGENVECTOR PROBLEM

UNCOUPLING THE PERRON EIGENVECTOR PROBLEM Carl D Meyer INTRODUCTION Foranonnegative irreducible matrix m m with spectral radius ρ,afundamental problem concerns the determination of the unique normalized

CHAPTER 5 Round-off errors

CHAPTER 5 Round-off errors In the two previous chapters we have seen how numbers can be represented in the binary numeral system and how this is the basis for representing numbers in computers. Since any

Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following

Math 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)(

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

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

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

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column

The Graphical Method: An Example

The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,

Numerical 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,

Lecture Notes 2: Matrices as Systems of Linear Equations

2: Matrices as Systems of Linear Equations 33A Linear Algebra, Puck Rombach Last updated: April 13, 2016 Systems of Linear Equations Systems of linear equations can represent many things You have probably

1 Determinants and the Solvability of Linear Systems

1 Determinants and the Solvability of Linear Systems In the last section we learned how to use Gaussian elimination to solve linear systems of n equations in n unknowns The section completely side-stepped