SOLVING LINEAR SYSTEMS
|
|
- Hannah Wells
- 6 years ago
- Views:
Transcription
1 SOLVING LINEAR SYSTEMS We want to solve the linear system a, x + + a,n x n = b a n, x + + a n,n x n = b n This will be done by the method used in beginning algebra, by successively eliminating unknowns from equations, until eventually we have only one equation in one unknown This process is known as Gaussian elimination To put it onto a computer, however, we must be more precise than is generally the case in high school algebra We begin with the linear system x x x = 6x x + x = 6 9x + 7x + x = (E) (E) (E)
2 x x x = 6x x + x = 6 9x + 7x + x = (E) (E) (E) [] Eliminate x from equations (E) and (E) Subtract times (E) from (E); and subtract times (E) from (E): x x x = x + 4x = 6 x x = (E) (E) (E) [] Eliminate x from equation (E) Subtract times (E) from (E): x x x = x + 4x = 6 4x = 4 Using back substitution, obtain x = x = x = (E) (E) (E)
3 In the computer, we work on the arrays rather than on the equations To illustrate this, we repeat the preceding example using array notation The original system is Ax = b, with A = 6, b = We often write these in combined form as an augmented matrix: [A b] = In step, we eliminate x from equations and We multiply row by and subtract it from row ; and we multiply row by - and subtract it from row This yields 4 6
4 In step, we eliminate x from equation We multiply row by and subtract from row This yields Then we proceed with back substitution as previously
5 For the general case, we reduce [A b] = a (), a (),n a () n, a () n,n b () b () n in n steps to the form a (), a (),n a (n) n,n b () b (n) n
6 More simply, and introducing new notation, this is equivalent to the matrix-vector equation Ux = g: u, u,n x g = u n,n x n g n
7 This is the linear system u, x + u, x + + u,n x n + u,n x n = g u n,n x n + u n,n x n = g n u n,n x n = g n We solve for x n, then x n, and backwards to x This process is called back substitution x n = g n u n,n x k = g k (u k,k+ x k+ + + u k,n x n ) u k,k for k = n,, What we have done here is simply a more carefully defined and methodical version of what you have done in high school algebra
8 How do we carry out the conversion of to a (), a (),n a () n, a () n,n a (), a (),n a (n) n,n b () b () n b () b (n) n
9 To help us keep track of the steps of this process, we will denote the initial system by a (), a (),n b () [A () b () ] = a () n, a n,n () b n () Initially we will make the assumption that every pivot element will be nonzero; and later we remove this assumption
10 Step We will eliminate x from equations thru n Begin by defining the multipliers m i, = a() i, a (),, i =,, n Here we are assuming the pivot element a (), Then in succession, multiply m i, times row (called the pivot row) and subtract the result from row i This yields new matrix elements a () i,j = a () i,j m i, a (),j, j =,, n b () i = b () i m i, b () for i =,, n Note that the index j does not include j = The reason is that with the definition of the multiplier m i,, it is automatic that a () i, = a() i, m i,a (), =, i =,, n
11 The augmented matrix now is [A () b () ] = a (), a (), a (),n a (), a (),n a () n, a () n,n b () b () b () n
12 Step k: Assume that for i =,, k the unknown x i has been eliminated from equations i + thru n We have the augmented matrix [A (k) b (k) ] = a (), a (), a (),n a (), a (),n a (k) k,k a (k) k,n a (k) n,k a n,n (k) b () b () b (k) k b (k) n We want to eliminate unknown x k from equations k + thru n Begin by defining the multipliers m i,k = a(k) i,k a (k) k,k, i = k +,, n
13 The pivot element is a (k) k,k, and we assume it is nonzero Using these multipliers, we eliminate x k from equations k + thru n Multiply m i,k times row k (the pivot row) and subtract from row i, for i = k + through n: a (k+) i,j = a (k) i,j m i,k a (k) k,j, j = k +,, n b (k+) i = b (k) i m i,k b (k) k This yields the augmented matrix [A (k+) b (k+) ]: a (), a (),n a (k) k,k a (k+) k+,k+ a (k) k,k+ a (k) k,n a (k+) k+,n a (k+) n,k+ a n,n (k+) b () b (k) k b (k+) k+ b (k+) n
14 Doing this for k =,,, n leads to the upper triangular system with the augmented matrix a (), a (),n a (n) n,n We later remove the assumption b () b (n) n a (k) k,k, k =,,, n
15 QUESTIONS How do we remove the assumption on the pivot elements? How many operations are involved in this procedure? How much error is there in the computed solution due to rounding errors in the calculations? How does the machine architecture affect the implementation of this algorithm?
16 PARTIAL PIVOTING Recall the reduction of to [A () b () ] = [A () b () ] = a (), a (),n a () n, a () n,n a (), a (), a (),n a (), a (),n a () n, a () n,n b () b () n b () b () b () n What if a (), =? In that case we look for an equation in which the x is present To do this in such a way as to avoid zero the maximum extant possible, we do the following
17 Look at all the elements in the first column, a () pick the largest in size Say it is = max a () a () k, j=,,n j,,, a(),,, a() n,, and Then interchange equations and k, which means interchanging rows and k in the augmented matrix [A () b () ] Then proceed with the elimination of x from equations thru n as before Having obtained [A () b () ] = a (), a (), a (),n a (), a (),n a () n, a () n,n what if a (), =? Then we proceed as before b () b () b () n
18 Among the elements a (),, a(), a () k, =,, a() n,, pick the one of largest size: max a () j=,,n Interchange rows and k Then proceed as before to eliminate x from equations through n, thus obtaining a (), a (), a (), a (),n b () a (), a (), a (),n b () [A () b () ] = a (), a (),n b () a () n, a n,n () b n () This is done at every stage of the elimination process This technique is called partial pivoting, and it is a part of most Gaussian elimination programs (including the one in the text) j,
19 Consequences of partial pivoting Recall the definition of the elements obtained in the process of eliminating x from equations through n: m i, = a() i, a (),, a () i,j = a () b () i = b () i m i, b () i,j m i, a (),j, j =,, n for i =,, n By our definition of the pivot element a (),, we have m i,, i =,, n Thus in the calculation of a () i,j and b () i, we have that the elements do not grow rapidly in size This is in comparison to what might happen otherwise, in which the multipliers m i, might have been very large This property is true of the multipliers at very step of the elimination process: m i,k, i = k +,, n, k =,, n
20 The property m i,k, i = k +,, n leads to good error propagation properties in Gaussian elimination with partial pivoting The only error in Gaussian elimination is that derived from the rounding errors in the arithmetic operations For example, at the first elimination step (eliminating x from equations thru n), a () i,j = a () i,j m i, a (),j, j =,, n b () i = b () i m i, b () The above property on the size of the multipliers prevents these numbers and the errors in their calculation from growing as rapidly as they might if no partial pivoting was used As an example of the improvement in accuracy obtained with partial pivoting, see the example on pages 6 6
21 OPERATION COUNTS One of the major ways in which we compare the efficiency of different numerical methods is to count the number of needed arithmetic operations For solving the linear system a, x + + a,n x n = b a n, x + + a n,n x n = b n using Gaussian elimination, we have the following operation counts A U, where we are converting Ax = b to Ux = g: Divisions Additions Multiplications n(n ) n(n )(n ) 6 n(n )(n ) 6
22 b g: Additions Multiplications Solving Ux = g: Divisions Additions Multiplications n(n ) n(n ) n n(n ) n(n )
23 On some machines, the cost of a division is much more than that of a multiplication; whereas on others there is not any important difference We assume the latter; and then the operation costs are as follows MD(A U) = n ( n ) n(n ) MD(b g) = n(n + ) MD(Find x) = n(n )(n ) AS(A U) = 6 n(n ) AS(b g) = n(n ) AS(Find x) =
24 Thus the total number of operations is Additions ( Multiplications and Divisions ) n + n 5n 6 n + n n Both are around n, and thus the total operations account is approximately n What happens to the cost when n is doubled?
25 Solving Ax = b and Ax = c What is the cost? Only the modification of the right side is different in these two cases Thus the additional cost is ( ) MD(b g) = n MD(Find x) ( ) AS(b g) = n(n ) AS(Find x) The total is around n operations, which is quite a bit smaller than n when n is even moderately large, say n = Thus one can solve the linear system Ax = c at little additional cost to that for solving Ax = b This has important consequences when it comes to estimation of the error in computed solutions
26 CALCULATING THE MATRIX INVERSE Consider finding the inverse of a matrix a, a, a, A = a, a, a, = [A,, A,, A, ] a, a, a, We want to find a matrix for which This means we want to solve X = [X,, X,, X, ] AX = I A [X,, X,, X, ] = [e, e, e ] [AX,, AX,, AX, ] = [e, e, e ] AX, = e, AX, = e, AX, = e We want to solve three linear systems, all with the same matrix of coefficients A
27 In augmented matrix notation, we want to work with [A I ] a, a, a, a, a, a, a, a, a, Then we proceed as before with a single linear system, only now we have three right hand sides We first introduce zeros into positions and of column ; and then we introduce zero into position of column Following that, we will need to solve three upper triangular linear systems by back substitution
28 MATRIX INVERSE EXAMPLE A = m, = m, =
29 Then by using back substitution to solve for each column of the inverse, we obtain A = 6 6 Alternatively, we can continue to perform elementary row operations to transform the left half of the augmented matrix to an identity This is shown next
30 MATRIX INVERSE EXAMPLE (cont) 6
31 MATRIX INVERSE EXAMPLE (cont) Thus, A =
32 COST OF MATRIX INVERSION In calculating A, we solve A [X,, X,,, X,n ] = [e, e,, e n ] for the matrix X = [X,, X,,, X,n ], where e j is column j of the identity matrix Thus we solve n linear systems AX, = e, AX, = e,, AX,n = e n () all with the same coefficient matrix Returning to the earlier operation counts for solving a single linear system, we have: cost of triangulating A: cost of solving Ax = b: approx n operations n operations Thus solving the n linear systems in () costs approximately n + n ( n ) = 8 n operations, approximately It costs approximately four times as many operations to invert A as to solve a single system With attention to the form of the right-hand sides in () this can be reduced to n operations
33 MATLAB MATRIX OPERATIONS To solve the linear system Ax = b in Matlab, use In Matlab, the command will calculate the inverse of A x = A \ b inv(a) There are many matrix operations built into Matlab, both for general matrices and for special classes of matrices We do not discuss those here, but recommend the student to investigate these thru the MATLAB help options
2.1 Gaussian Elimination
2. Gaussian Elimination A common problem encountered in numerical models is the one in which there are n equations and n unknowns. The following is a description of the Gaussian elimination method for
More informationDirect Methods for Solving Linear Systems. Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le
Direct Methods for Solving Linear Systems Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le 1 Overview General Linear Systems Gaussian Elimination Triangular Systems The LU Factorization
More informationSolving Linear Systems Using Gaussian Elimination. How can we solve
Solving Linear Systems Using Gaussian Elimination How can we solve? 1 Gaussian elimination Consider the general augmented system: Gaussian elimination Step 1: Eliminate first column below the main diagonal.
More informationMATRICES. a m,1 a m,n A =
MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of
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 informationGaussian Elimination and Back Substitution
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 4 Notes These notes correspond to Sections 31 and 32 in the text Gaussian Elimination and Back Substitution The basic idea behind methods for solving
More informationThe Solution of Linear Systems AX = B
Chapter 2 The Solution of Linear Systems AX = B 21 Upper-triangular Linear Systems We will now develop the back-substitution algorithm, which is useful for solving a linear system of equations that has
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationGaussian Elimination -(3.1) b 1. b 2., b. b n
Gaussian Elimination -() Consider solving a given system of n linear equations in n unknowns: (*) a x a x a n x n b where a ij and b i are constants and x i are unknowns Let a n x a n x a nn x n a a a
More informationLecture 12 (Tue, Mar 5) Gaussian elimination and LU factorization (II)
Math 59 Lecture 2 (Tue Mar 5) Gaussian elimination and LU factorization (II) 2 Gaussian elimination - LU factorization For a general n n matrix A the Gaussian elimination produces an LU factorization if
More informationCHAPTER 6. Direct Methods for Solving Linear Systems
CHAPTER 6 Direct Methods for Solving Linear Systems. Introduction A direct method for approximating the solution of a system of n linear equations in n unknowns is one that gives the exact solution to
More informationCS412: Lecture #17. Mridul Aanjaneya. March 19, 2015
CS: Lecture #7 Mridul Aanjaneya March 9, 5 Solving linear systems of equations Consider a lower triangular matrix L: l l l L = l 3 l 3 l 33 l n l nn A procedure similar to that for upper triangular systems
More informationCOURSE Numerical methods for solving linear systems. Practical solving of many problems eventually leads to solving linear systems.
COURSE 9 4 Numerical methods for solving linear systems Practical solving of many problems eventually leads to solving linear systems Classification of the methods: - direct methods - with low number of
More informationLinear Systems of n equations for n unknowns
Linear Systems of n equations for n unknowns In many application problems we want to find n unknowns, and we have n linear equations Example: Find x,x,x such that the following three equations hold: x
More informationMATH 3511 Lecture 1. Solving Linear Systems 1
MATH 3511 Lecture 1 Solving Linear Systems 1 Dmitriy Leykekhman Spring 2012 Goals Review of basic linear algebra Solution of simple linear systems Gaussian elimination D Leykekhman - MATH 3511 Introduction
More informationA Review of Matrix Analysis
Matrix Notation Part Matrix Operations Matrices are simply rectangular arrays of quantities Each quantity in the array is called an element of the matrix and an element can be either a numerical value
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.1 SYSTEMS OF LINEAR EQUATIONS LINEAR EQUATION x 1,, x n A linear equation in the variables equation that can be written in the form a 1 x 1 + a 2 x 2 + + a n x n
More informationLinear System of Equations
Linear System of Equations Linear systems are perhaps the most widely applied numerical procedures when real-world situation are to be simulated. Example: computing the forces in a TRUSS. F F 5. 77F F.
More informationAMS 209, Fall 2015 Final Project Type A Numerical Linear Algebra: Gaussian Elimination with Pivoting for Solving Linear Systems
AMS 209, Fall 205 Final Project Type A Numerical Linear Algebra: Gaussian Elimination with Pivoting for Solving Linear Systems. Overview We are interested in solving a well-defined linear system given
More informationGAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511)
GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511) D. ARAPURA Gaussian elimination is the go to method for all basic linear classes including this one. We go summarize the main ideas. 1.
More informationMatrix decompositions
Matrix decompositions How can we solve Ax = b? 1 Linear algebra Typical linear system of equations : x 1 x +x = x 1 +x +9x = 0 x 1 +x x = The variables x 1, x, and x only appear as linear terms (no powers
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationMath 1314 Week #14 Notes
Math 3 Week # Notes Section 5.: A system of equations consists of two or more equations. A solution to a system of equations is a point that satisfies all the equations in the system. In this chapter,
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.1 SYSTEMS OF LINEAR EQUATIONS LINEAR EQUATION,, 1 n A linear equation in the variables equation that can be written in the form a a a b 1 1 2 2 n n a a is an where
More informationMAC1105-College Algebra. Chapter 5-Systems of Equations & Matrices
MAC05-College Algebra Chapter 5-Systems of Equations & Matrices 5. Systems of Equations in Two Variables Solving Systems of Two Linear Equations/ Two-Variable Linear Equations A system of equations is
More informationMODULE 7. where A is an m n real (or complex) matrix. 2) Let K(t, s) be a function of two variables which is continuous on the square [0, 1] [0, 1].
Topics: Linear operators MODULE 7 We are going to discuss functions = mappings = transformations = operators from one vector space V 1 into another vector space V 2. However, we shall restrict our sights
More informationLinear Algebraic Equations
Linear Algebraic Equations 1 Fundamentals Consider the set of linear algebraic equations n a ij x i b i represented by Ax b j with [A b ] [A b] and (1a) r(a) rank of A (1b) Then Axb has a solution iff
More informationLectures on Linear Algebra for IT
Lectures on Linear Algebra for IT by Mgr. Tereza Kovářová, Ph.D. following content of lectures by Ing. Petr Beremlijski, Ph.D. Department of Applied Mathematics, VSB - TU Ostrava Czech Republic 2. Systems
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University February 6, 2018 Linear Algebra (MTH
More informationLinear Algebra and Matrix Inversion
Jim Lambers MAT 46/56 Spring Semester 29- Lecture 2 Notes These notes correspond to Section 63 in the text Linear Algebra and Matrix Inversion Vector Spaces and Linear Transformations Matrices are much
More informationHani Mehrpouyan, California State University, Bakersfield. Signals and Systems
Hani Mehrpouyan, Department of Electrical and Computer Engineering, Lecture 26 (LU Factorization) May 30 th, 2013 The material in these lectures is partly taken from the books: Elementary Numerical Analysis,
More informationNumerical Linear Algebra
Numerical Linear Algebra Direct Methods Philippe B. Laval KSU Fall 2017 Philippe B. Laval (KSU) Linear Systems: Direct Solution Methods Fall 2017 1 / 14 Introduction The solution of linear systems is one
More informationReview of matrices. Let m, n IN. A rectangle of numbers written like A =
Review of matrices Let m, n IN. A rectangle of numbers written like a 11 a 12... a 1n a 21 a 22... a 2n A =...... a m1 a m2... a mn where each a ij IR is called a matrix with m rows and n columns or an
More informationMath 4377/6308 Advanced Linear Algebra
3.1 Elementary Matrix Math 4377/6308 Advanced Linear Algebra 3.1 Elementary Matrix Operations and Elementary Matrix Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 12: Gaussian Elimination and LU Factorization Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 10 Gaussian Elimination
More informationCSE 160 Lecture 13. Numerical Linear Algebra
CSE 16 Lecture 13 Numerical Linear Algebra Announcements Section will be held on Friday as announced on Moodle Midterm Return 213 Scott B Baden / CSE 16 / Fall 213 2 Today s lecture Gaussian Elimination
More informationGaussian Elimination without/with Pivoting and Cholesky Decomposition
Gaussian Elimination without/with Pivoting and Cholesky Decomposition Gaussian Elimination WITHOUT pivoting Notation: For a matrix A R n n we define for k {,,n} the leading principal submatrix a a k A
More informationSolving Linear Systems Using Gaussian Elimination
Solving Linear Systems Using Gaussian Elimination DEFINITION: A linear equation in the variables x 1,..., x n is an equation that can be written in the form a 1 x 1 +...+a n x n = b, where a 1,...,a n
More informationComputational Linear Algebra
Computational Linear Algebra PD Dr. rer. nat. habil. Ralf Peter Mundani Computation in Engineering / BGU Scientific Computing in Computer Science / INF Winter Term 2017/18 Part 2: Direct Methods PD Dr.
More informationMatrices and systems of linear equations
Matrices and systems of linear equations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T.
More informationMatrix decompositions
Matrix decompositions How can we solve Ax = b? 1 Linear algebra Typical linear system of equations : x 1 x +x = x 1 +x +9x = 0 x 1 +x x = The variables x 1, x, and x only appear as linear terms (no powers
More informationNUMERICAL MATHEMATICS & COMPUTING 7th Edition
NUMERICAL MATHEMATICS & COMPUTING 7th Edition Ward Cheney/David Kincaid c UT Austin Engage Learning: Thomson-Brooks/Cole wwwengagecom wwwmautexasedu/cna/nmc6 October 16, 2011 Ward Cheney/David Kincaid
More information9.1 - Systems of Linear Equations: Two Variables
9.1 - Systems of Linear Equations: Two Variables Recall that a system of equations consists of two or more equations each with two or more variables. A solution to a system in two variables is an ordered
More informationTopics. Vectors (column matrices): Vector addition and scalar multiplication The matrix of a linear function y Ax The elements of a matrix A : A ij
Topics Vectors (column matrices): Vector addition and scalar multiplication The matrix of a linear function y Ax The elements of a matrix A : A ij or a ij lives in row i and column j Definition of a matrix
More informationLinear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4
Linear Algebra Section. : LU Decomposition Section. : Permutations and transposes Wednesday, February 1th Math 01 Week # 1 The LU Decomposition We learned last time that we can factor a invertible matrix
More informationHandout 1 EXAMPLES OF SOLVING SYSTEMS OF LINEAR EQUATIONS
22M:33 J. Simon page 1 of 7 22M:33 Summer 06 J. Simon Example 1. Handout 1 EXAMPLES OF SOLVING SYSTEMS OF LINEAR EQUATIONS 2x 1 + 3x 2 5x 3 = 10 3x 1 + 5x 2 + 6x 3 = 16 x 1 + 5x 2 x 3 = 10 Step 1. Write
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
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 informationAck: 1. LD Garcia, MTH 199, Sam Houston State University 2. Linear Algebra and Its Applications - Gilbert Strang
Gaussian Elimination CS6015 : Linear Algebra Ack: 1. LD Garcia, MTH 199, Sam Houston State University 2. Linear Algebra and Its Applications - Gilbert Strang The Gaussian Elimination Method The Gaussian
More informationIntroduction to Mathematical Programming
Introduction to Mathematical Programming Ming Zhong Lecture 6 September 12, 2018 Ming Zhong (JHU) AMS Fall 2018 1 / 20 Table of Contents 1 Ming Zhong (JHU) AMS Fall 2018 2 / 20 Solving Linear Systems A
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA2501 Numerical Methods Spring 2015 Solutions to exercise set 3 1 Attempt to verify experimentally the calculation from class that
More informationNext topics: Solving systems of linear equations
Next topics: Solving systems of linear equations 1 Gaussian elimination (today) 2 Gaussian elimination with partial pivoting (Week 9) 3 The method of LU-decomposition (Week 10) 4 Iterative techniques:
More informationChapter 4. Solving Systems of Equations. Chapter 4
Solving Systems of Equations 3 Scenarios for Solutions There are three general situations we may find ourselves in when attempting to solve systems of equations: 1 The system could have one unique solution.
More information7.5 Operations with Matrices. Copyright Cengage Learning. All rights reserved.
7.5 Operations with Matrices Copyright Cengage Learning. All rights reserved. What You Should Learn Decide whether two matrices are equal. Add and subtract matrices and multiply matrices by scalars. Multiply
More informationFundamentals of Engineering Analysis (650163)
Philadelphia University Faculty of Engineering Communications and Electronics Engineering Fundamentals of Engineering Analysis (6563) Part Dr. Omar R Daoud Matrices: Introduction DEFINITION A matrix is
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Michaelmas Term 2015 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Michaelmas Term 2015 1 / 15 From equations to matrices For example, if we consider
More information4 Elementary matrices, continued
4 Elementary matrices, continued We have identified 3 types of row operations and their corresponding elementary matrices. If you check the previous examples, you ll find that these matrices are constructed
More informationChapter 7. Tridiagonal linear systems. Solving tridiagonal systems of equations. and subdiagonal. E.g. a 21 a 22 a A =
Chapter 7 Tridiagonal linear systems The solution of linear systems of equations is one of the most important areas of computational mathematics. A complete treatment is impossible here but we will discuss
More information4 Elementary matrices, continued
4 Elementary matrices, continued We have identified 3 types of row operations and their corresponding elementary matrices. To repeat the recipe: These matrices are constructed by performing the given row
More informationSolving Consistent Linear Systems
Solving Consistent Linear Systems Matrix Notation An augmented matrix of a system consists of the coefficient matrix with an added column containing the constants from the right sides of the equations.
More informationRoundoff Analysis of Gaussian Elimination
Jim Lambers MAT 60 Summer Session 2009-0 Lecture 5 Notes These notes correspond to Sections 33 and 34 in the text Roundoff Analysis of Gaussian Elimination In this section, we will perform a detailed error
More informationHomework 1.1 and 1.2 WITH SOLUTIONS
Math 220 Linear Algebra (Spring 2018) Homework 1.1 and 1.2 WITH SOLUTIONS Due Thursday January 25 These will be graded in detail and will count as two (TA graded) homeworks. Be sure to start each of these
More information1 - Systems of Linear Equations
1 - Systems of Linear Equations 1.1 Introduction to Systems of Linear Equations Almost every problem in linear algebra will involve solving a system of equations. ü LINEAR EQUATIONS IN n VARIABLES We are
More informationMAC Learning Objectives. Learning Objectives (Cont.) Module 10 System of Equations and Inequalities II
MAC 1140 Module 10 System of Equations and Inequalities II Learning Objectives Upon completing this module, you should be able to 1. represent systems of linear equations with matrices. 2. transform a
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 13
STAT 309: MATHEMATICAL COMPUTATIONS I FALL 208 LECTURE 3 need for pivoting we saw that under proper circumstances, we can write A LU where 0 0 0 u u 2 u n l 2 0 0 0 u 22 u 2n L l 3 l 32, U 0 0 0 l n l
More informationChapter 1: Systems of Linear Equations
Chapter : Systems of Linear Equations February, 9 Systems of linear equations Linear systems Lecture 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
More information1.Chapter Objectives
LU Factorization INDEX 1.Chapter objectives 2.Overview of LU factorization 2.1GAUSS ELIMINATION AS LU FACTORIZATION 2.2LU Factorization with Pivoting 2.3 MATLAB Function: lu 3. CHOLESKY FACTORIZATION 3.1
More informationPOLI270 - Linear Algebra
POLI7 - Linear Algebra Septemer 8th Basics a x + a x +... + a n x n b () is the linear form where a, b are parameters and x n are variables. For a given equation such as x +x you only need a variable and
More informationChapter 2. Solving Systems of Equations. 2.1 Gaussian elimination
Chapter 2 Solving Systems of Equations A large number of real life applications which are resolved through mathematical modeling will end up taking the form of the following very simple looking matrix
More information14.2 QR Factorization with Column Pivoting
page 531 Chapter 14 Special Topics Background Material Needed Vector and Matrix Norms (Section 25) Rounding Errors in Basic Floating Point Operations (Section 33 37) Forward Elimination and Back Substitution
More informationMatrix Arithmetic. j=1
An m n matrix is an array A = Matrix Arithmetic a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn of real numbers a ij An m n matrix has m rows and n columns a ij is the entry in the i-th row and j-th column
More informationIntroduction. Vectors and Matrices. Vectors [1] Vectors [2]
Introduction Vectors and Matrices Dr. TGI Fernando 1 2 Data is frequently arranged in arrays, that is, sets whose elements are indexed by one or more subscripts. Vector - one dimensional array Matrix -
More informationLinear System of Equations
Linear System of Equations Linear systems are perhaps the most widely applied numerical procedures when real-world situation are to be simulated. Example: computing the forces in a TRUSS. F F 5. 77F F.
More informationMath 2331 Linear Algebra
1.1 Linear System Math 2331 Linear Algebra 1.1 Systems of Linear Equations Shang-Huan Chiu Department of Mathematics, University of Houston schiu@math.uh.edu math.uh.edu/ schiu/ Shang-Huan Chiu, University
More informationMath 471 (Numerical methods) Chapter 3 (second half). System of equations
Math 47 (Numerical methods) Chapter 3 (second half). System of equations Overlap 3.5 3.8 of Bradie 3.5 LU factorization w/o pivoting. Motivation: ( ) A I Gaussian Elimination (U L ) where U is upper triangular
More informationSolving Linear Systems of Equations
November 6, 2013 Introduction The type of problems that we have to solve are: Solve the system: A x = B, where a 11 a 1N a 12 a 2N A =.. a 1N a NN x = x 1 x 2. x N B = b 1 b 2. b N To find A 1 (inverse
More informationLecture 9: Elementary Matrices
Lecture 9: Elementary Matrices Review of Row Reduced Echelon Form Consider the matrix A and the vector b defined as follows: 1 2 1 A b 3 8 5 A common technique to solve linear equations of the form Ax
More information1 GSW Sets of Systems
1 Often, we have to solve a whole series of sets of simultaneous equations of the form y Ax, all of which have the same matrix A, but each of which has a different known vector y, and a different unknown
More informationMAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to :
MAC 0 Module Systems of Linear Equations and Matrices II Learning Objectives Upon completing this module, you should be able to :. Find the inverse of a square matrix.. Determine whether a matrix is invertible..
More informationLinear Algebra. James Je Heon Kim
Linear lgebra James Je Heon Kim (jjk9columbia.edu) If you are unfamiliar with linear or matrix algebra, you will nd that it is very di erent from basic algebra or calculus. For the duration of this session,
More informationPH1105 Lecture Notes on Linear Algebra.
PH05 Lecture Notes on Linear Algebra Joe Ó hógáin E-mail: johog@mathstcdie Main Text: Calculus for the Life Sciences by Bittenger, Brand and Quintanilla Other Text: Linear Algebra by Anton and Rorres Matrices
More informationLecture 12: Solving Systems of Linear Equations by Gaussian Elimination
Lecture 12: Solving Systems of Linear Equations by Gaussian Elimination Winfried Just, Ohio University September 22, 2017 Review: The coefficient matrix Consider a system of m linear equations in n variables.
More informationMATH 612 Computational methods for equation solving and function minimization Week # 6
MATH 612 Computational methods for equation solving and function minimization Week # 6 F.J.S. Spring 2014 University of Delaware FJS MATH 612 1 / 58 Plan for this week Discuss any problems you couldn t
More informationNumerical Linear Algebra
Chapter 3 Numerical Linear Algebra We review some techniques used to solve Ax = b where A is an n n matrix, and x and b are n 1 vectors (column vectors). We then review eigenvalues and eigenvectors and
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationSection Gaussian Elimination
Section. - Gaussian Elimination A matrix is said to be in row echelon form (REF) if it has the following properties:. The first nonzero entry in any row is a. We call this a leading one or pivot one..
More informationChapter 1 Linear Equations. 1.1 Systems of Linear Equations
Chapter Linear Equations. Systems of Linear Equations A linear equation in the n variables x, x 2,..., x n is one that can be expressed in the form a x + a 2 x 2 + + a n x n = b where a, a 2,..., a n and
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
More information. =. a i1 x 1 + a i2 x 2 + a in x n = b i. a 11 a 12 a 1n a 21 a 22 a 1n. i1 a i2 a in
Vectors and Matrices Continued Remember that our goal is to write a system of algebraic equations as a matrix equation. Suppose we have the n linear algebraic equations a x + a 2 x 2 + a n x n = b a 2
More informationMAC Module 1 Systems of Linear Equations and Matrices I
MAC 2103 Module 1 Systems of Linear Equations and Matrices I 1 Learning Objectives Upon completing this module, you should be able to: 1. Represent a system of linear equations as an augmented matrix.
More informationMODEL ANSWERS TO THE THIRD HOMEWORK
MODEL ANSWERS TO THE THIRD HOMEWORK 1 (i) We apply Gaussian elimination to A First note that the second row is a multiple of the first row So we need to swap the second and third rows 1 3 2 1 2 6 5 7 3
More informationMatrix & Linear Algebra
Matrix & Linear Algebra Jamie Monogan University of Georgia For more information: http://monogan.myweb.uga.edu/teaching/mm/ Jamie Monogan (UGA) Matrix & Linear Algebra 1 / 84 Vectors Vectors Vector: A
More informationSection 1.1: Systems of Linear Equations
Section 1.1: Systems of Linear Equations Two Linear Equations in Two Unknowns Recall that the equation of a line in 2D can be written in standard form: a 1 x 1 + a 2 x 2 = b. Definition. A 2 2 system of
More informationNumerical Methods I Solving Square Linear Systems: GEM and LU factorization
Numerical Methods I Solving Square Linear Systems: GEM and LU factorization Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 18th,
More informationNumerical Analysis FMN011
Numerical Analysis FMN011 Carmen Arévalo Lund University carmen@maths.lth.se Lecture 4 Linear Systems Ax = b A is n n matrix, b is given n-vector, x is unknown solution n-vector. A n n is non-singular
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 3 Chapter 10 LU Factorization PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
More informationTopic 15 Notes Jeremy Orloff
Topic 5 Notes Jeremy Orloff 5 Transpose, Inverse, Determinant 5. Goals. Know the definition and be able to compute the inverse of any square matrix using row operations. 2. Know the properties of inverses.
More informationElementary Linear Algebra
Matrices J MUSCAT Elementary Linear Algebra Matrices Definition Dr J Muscat 2002 A matrix is a rectangular array of numbers, arranged in rows and columns a a 2 a 3 a n a 2 a 22 a 23 a 2n A = a m a mn We
More information(Mathematical Operations with Arrays) Applied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB (Mathematical Operations with Arrays) Contents Getting Started Matrices Creating Arrays Linear equations Mathematical Operations with Arrays Using Script
More informationLU Factorization. Marco Chiarandini. DM559 Linear and Integer Programming. Department of Mathematics & Computer Science University of Southern Denmark
DM559 Linear and Integer Programming LU Factorization Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark [Based on slides by Lieven Vandenberghe, UCLA] Outline
More information