EXTENSION. a 1 b 1 c 1 d 1. Rows l a 2 b 2 c 2 d 2. a 3 x b 3 y c 3 z d 3. This system can be written in an abbreviated form as

Similar documents
10/26/ Solving Systems of Linear Equations Using Matrices. Objectives. Matrices

3. Replace any row by the sum of that row and a constant multiple of any other row.

Linear Equation Systems Iterative Methods

6.3 Notes O Brien F15

Matrix Inverse 2 ( 2) 1 = 2 1 2

Section 3.1 Gaussian Elimination Method (GEM) Key terms

MATH 2000 Gauss-Jordan Elimination and the TI-83 [Underlined bold terms are defined in the glossary]

For example, the system. 22 may be represented by the augmented matrix

2. Use elementary row operations to rewrite the augmented matrix in a simpler form (i.e., one whose solutions are easy to find).

Solving Systems Using Row Operations 1 Name

Matrices and Systems of Equations

Exercise Set Decide whether each matrix below is an elementary matrix. (a) (b) (c) (d) Answer:

Solving Systems of Equations Using Matrices With the TI-83 or TI-84

x = 12 x = 12 1x = 16

0_PreCNotes17 18.notebook May 16, Chapter 12

How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program

Linear Equations in Linear Algebra

Chapter 2 Systems of Linear Equations and Matrices

Math 13 Chapter 3 Handout Helene Payne. Name: 1. Assign the value to the variables so that a matrix equality results.

Lesson 11: Duality in linear programming

Optimization of Design. Lecturer:Dung-An Wang Lecture 8

Paul's Online Math Notes. Online Notes / Algebra (Notes) / Systems of Equations / Augmented Matricies

LARP / 2018 ACK : 1. Linear Algebra and Its Applications - Gilbert Strang 2. Autar Kaw, Transforming Numerical Methods Education for STEM Graduates

MA 162: Finite Mathematics - Sections 2.6

WEEK 4 REVIEW. Graphing Systems of Linear Inequalities (3.1)

A Poorly Conditioned System. Matrix Form

3-8 Solving Systems of Equations Using Inverse Matrices. Determine whether each pair of matrices are inverses of each other. 13.

Computational Methods CMSC/AMSC/MAPL 460. Vectors, Matrices, Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science

6-2 Matrix Multiplication, Inverses and Determinants

CHAPTER HERE S WHERE YOU LL FIND THESE APPLICATIONS:

Basic Matrix Manipulation with a TI-89/TI-92/Voyage 200

Precalculus Notes: Unit 7 Systems of Equations and Matrices

Numerical Linear Algebra

Finite Math Section 2_2 Solutions and Hints

Identity Matrix: >> eye(3) ans = Matrix of Ones: >> ones(2,3) ans =

AP Calculus Problems with HP Prime

Numerical Methods 5633

Exploration Assignment #1. (Linear Systems)

Independent systems consist of x

CS6015 / LARP ACK : Linear Algebra and Its Applications - Gilbert Strang

Performing Matrix Operations on the TI-83/84

A Study of Numerical Methods for Simultaneous Equations

Matrices and Determinants

Computational Methods CMSC/AMSC/MAPL 460. Vectors, Matrices, Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science

Now, start over with a smarter method. But it is still heavily relied on the power of matlab. But we can see the pattern of the matrix elements.

Math 355: Linear Algebra: Midterm 1 Colin Carroll June 25, 2011

Methods of solving sparse linear systems. Soldatenko Oleg SPbSU, Department of Computational Physics

Chapter Introduction

1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).

Chapter 1: Number and Operations

Teachers Teaching with Technology (Scotland) Teachers Teaching with Technology. Scotland T 3. Matrices. Teachers Teaching with Technology (Scotland)

CE 601: Numerical Methods Lecture 5. Course Coordinator: Dr. Suresh A. Kartha, Associate Professor, Department of Civil Engineering, IIT Guwahati.

MA/CSSE 473 Day 20. Recap: Josephus Problem

13.4 Case Study: vector<t>-based Matrices

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.

FreeMat Tutorial. 3x + 4y 2z = 5 2x 5y + z = 8 x x + 3y = -1 xx

Lecture 5: Matrices. Dheeraj Kumar Singh 07CS1004 Teacher: Prof. Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur

Addition/Subtraction flops. ... k k + 1, n (n k)(n k) (n k)(n + 1 k) n 1 n, n (1)(1) (1)(2)

5. GENERALIZED INVERSE SOLUTIONS

Question 2: How do you solve a linear programming problem with a graph?

CS Elementary Graph Algorithms & Transform-and-Conquer

3.1 Solving Systems Using Tables and Graphs

Computational Methods CMSC/AMSC/MAPL 460. Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science

AH Matrices.notebook November 28, 2016

hp calculators hp 39g+ & hp 39g/40g Using Matrices How are matrices stored? How do I solve a system of equations? Quick and easy roots of a polynomial

Maths for Signals and Systems Linear Algebra in Engineering. Some problems by Gilbert Strang

LINPACK Benchmark. on the Fujitsu AP The LINPACK Benchmark. Assumptions. A popular benchmark for floating-point performance. Richard P.

Generalized Network Flow Programming

College Algebra Exam File - Fall Test #1

Recreational Mathematics:

Systems of Inequalities and Linear Programming 5.7 Properties of Matrices 5.8 Matrix Inverses

CS Data Structures and Algorithm Analysis

Autar Kaw Benjamin Rigsby. Transforming Numerical Methods Education for STEM Undergraduates

Curriculum Map: Mathematics

SML: Specialized Matrix Language White Paper

MA 323 Geometric Modelling Course Notes: Day 28 Data Fitting to Surfaces

MA/CSSE 473 Day 20. Student Questions

Therefore, after becoming familiar with the Matrix Method, you will be able to solve a system of two linear equations in four different ways.

Chapter LU Decomposition More Examples Electrical Engineering

Finite Math - J-term Homework. Section Inverse of a Square Matrix

SCIE 4101, Spring Math Review Packet #4 Algebra II (Part 1) Notes

Put the following equations to slope-intercept form then use 2 points to graph

4. Linear Algebra. In maple, it is first necessary to call in the linear algebra package. This is done by the following maple command

Robot Mapping. Least Squares Approach to SLAM. Cyrill Stachniss

Graphbased. Kalman filter. Particle filter. Three Main SLAM Paradigms. Robot Mapping. Least Squares Approach to SLAM. Least Squares in General

Parallel Implementations of Gaussian Elimination

Levitin second pages 2002/9/9 12:52 p. 192 (chap06) Windfall Software, PCA ZzTeX v8.7

Matrices. Chapter Matrix A Mathematical Definition Matrix Dimensions and Notation

Practice Test - Chapter 6

Solving Algebraic Equations

D-BAUG Informatik I. Exercise session: week 5 HS 2018

TUTORIAL 10: ARRAYS AND MATRICES. 1. Welcome. Hello. My name is Dr. Christopher Raridan (Dr. R). I want to welcome you to the L A TEX Tutorial Series.

Fundamental Matrix & Structure from Motion

6B Quiz Review Learning Targets ,

WJEC MATHEMATICS INTERMEDIATE GRAPHS STRAIGHT LINE GRAPHS (PLOTTING)

Uppsala University Department of Information technology. Hands-on 1: Ill-conditioning = x 2

Pre-Calculus. Slide 1 / 192. Slide 2 / 192. Slide 3 / 192. Matrices

Pre-Calculus Matrices

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

AMS527: Numerical Analysis II

Transcription:

EXTENSION Using Matrix Row Operations to Solve Systems The elimination method used to solve systems introduced in the previous section can be streamlined into a systematic method by using matrices (singular: matrix). Matrices can be used to solve linear systems and matrix methods are particularly suitable for computer solutions of large systems of equations having many unknowns. To begin, consider a system of three equations and three unknowns such as a x b y c z d a 2 x b 2 y c 2 z d 2 a x b y c z d. This system can be written in an abbreviated form as a b c d a 2 b 2 c 2 d 2 a b c d. Such a rectangular array of numbers enclosed by brackets is called a matrix. Each number in the array is an element or entry. The matrix above has three rows (horizontal) and four columns (vertical) of entries, and is called a 4 (read by 4 ) matrix. The constants in the last column of the matrix can be set apart from the coefficients of the variables by using a vertical line, as shown in the following augmented matrix. la b c d Rows l a 2 b 2 c 2 d 2 l a b c d a a a a Columns The rows of this augmented matrix can be treated the same as the equations of a system of equations, since the augmented matrix is actually a short form of the system. Any transformation of the matrix that will result in an equivalent system is permitted. The following matrix row operations produce such transformations.

Extension Using Matrix Row Operations to Solve Systems 477 Choices C, D, E, and F provide the user of the TI-8 Plus calculator a means of performing row operations on matrices. Matrix Row Operations For any real number k and any augmented matrix of a system of linear equations, the following operations will produce the matrix of an equivalent system:. interchanging any two rows of a matrix, 2. multiplying the elements of any row of a matrix by the same nonzero number k, and. adding a common multiple of the elements of one row to the corresponding elements of another row. If the word row is replaced by equation, it can be seen that the three row operations also apply to a system of equations, so that a system of equations can be solved by transforming its corresponding matrix into the matrix of an equivalent, simpler system. The goal is a matrix in the form b a a or for systems with two or three equations respectively. Notice that on the left of the vertical bar there are ones down the diagonal from upper left to lower right and zeros elsewhere in the matrices. When these matrices are rewritten as systems of equations, the values of the variables are known. The Gauss-Jordan method is a systematic way of using the matrix row operations to change the augmented matrix of a system into the form that shows its solution. The following examples will illustrate this method. c b EXAMPLE Solve the linear system. x 4y 5x 2y 9 The equations should all be in the same form, with the variable terms in the same order on the left, and the constant term on the right. Begin by writing the augmented matrix. 4 5 2 9 The goal is to transform this augmented matrix into one in which the values of the variables will be easy to see. That is, since each column in the matrix represents the coefficients of one variable, the augmented matrix should be transformed so that it is of the form j k (continued)

478 CHAPTER 8 Graphs, Functions, and Systems of Equations and Inequalities for real numbers k and j. Once the augmented matrix is in this form, the matrix can be rewritten as a linear system to get x k y j. The necessary transformations are performed as follows. It is best to work in columns beginning in each column with the element that is to become. In the augmented matrix, 4 5 2 9, there is a in the first row, first column position. Use row operation 2, multiplying each entry in the first row by to get a in this position. (This step is abbreviated as R.) R 4 5 2 9 Introduce in the second row, first column by multiplying each element of the first row by 5 and adding the result to the corresponding element in the second row, using row operation. 4 26 52 5R R2 Obtain in the second row, second column by multiplying each element of the second row by 26, using row operation 2. 4 2 R2 26 Finally, obtain in the first row, second column by multiplying each element of the second row by 4 and adding the result to the corresponding element in the first row. 4 R2 R 2 This last matrix corresponds to the system x y 2, that has the solution set, 2. This solution could have been read directly from the third column of the final matrix. A linear system with three equations is solved in a similar way. Row operations are used to get s down the diagonal from left to right and s above and below each.

Extension Using Matrix Row Operations to Solve Systems 479 EXAMPLE 2 Use the Gauss-Jordan method to solve the system. x y 5z 6 x y z x y 2z 5 Since the system is in proper form, begin by writing the augmented matrix of the linear system. 5 6 5 2 The final matrix is to be of the form m n p, where m, n, and p are real numbers. This final form of the matrix gives the system x m, y n, and z p, so the solution set is m, n, p. There is already a in the first row, first column. Get a in the second row of the first column by multiplying each element in the first row by and adding the result to the corresponding element in the second row, using operation. 5 6 5 6 6 28 R R2 2 Now, to change the last element in the first column to, use operation and multiply each element of the first row by, then add the results to the corresponding elements of the third row. 5 6 6 6 28 4 R R The same procedure is used to transform the second and third columns. For both of these columns, first perform the step of getting in the appropriate position of each column. Do this by multiplying the elements of the row by the reciprocal of the number in that position. 5 6 8 4 6 R2 4 4 7 4 8 4 R2 R (continued)

48 CHAPTER 8 Graphs, Functions, and Systems of Equations and Inequalities 7 4 8 4 2 2 7 4 8 4 8 2 4 8 R R2 4R2 R 2 R 7 R R The linear system associated with this final matrix is x y 2 z, and the solution set is, 2,. EXTENSION EXERCISES Use the Gauss-Jordan method to solve each system of equations.. x y 5 2. x 2y 5. x y 2x y 2 4. x 2y 4 5. 2x y 6. x y 2 2x 2y 5 7. x 7y 8. 5x y 4 9. 2x 4y 8 x 8y. x y 6z 7. 2x y z 2. 2x y 2z x 2y z 5 x y 2z 2y z. x y 4. x y 5. y z 6 2x z x z y 2z 2 x y 2x 5y 6 4x y 5 2x y x y z 6 2x y z 9 x 2y z 4x 2y z 6 x 4y z 4 x 2z 2 2x y 4z x 5y z 5 2x y 2z 6. 5x y 2z 5 2x 2y z 4 4x y z