Gaussian Elimination and Gauss-Jordan Elimination

Slides:



Advertisements
Similar presentations
Copyright © Cengage Learning. All rights reserved.
Advertisements

Elementary Linear Algebra
Chapter 1: Linear Equations
Gauss Elimination.
Gauss – Jordan Elimination Method: Example 2 Solve the following system of linear equations using the Gauss - Jordan elimination method Slide 1.
Matrices & Systems of Linear Equations
Lesson 8 Gauss Jordan Elimination
Solving Systems of Linear Equations Part Pivot a Matrix 2. Gaussian Elimination Method 3. Infinitely Many Solutions 4. Inconsistent System 5. Geometric.
ENGR-1100 Introduction to Engineering Analysis
Matrices. Special Matrices Matrix Addition and Subtraction Example.
Chapter 1 Systems of Linear Equations
Linear Systems and Matrices
10.1 Gaussian Elimination Method
Chapter 1 Systems of Linear Equations
Lesson 8.1, page 782 Matrix Solutions to Linear Systems
Section 8.1 – Systems of Linear Equations
Introduction Information in science, business, and mathematics is often organized into rows and columns to form rectangular arrays called “matrices” (plural.
Systems of linear equations. Simple system Solution.
Linear Algebra – Linear Equations
1.2 Gaussian Elimination.
Multivariate Linear Systems and Row Operations.
SYSTEMS OF LINEAR EQUATIONS
Chapter 1 Systems of Linear Equations and Matrices
Notes 7.3 – Multivariate Linear Systems and Row Operations.
Matrices King Saud University. If m and n are positive integers, then an m  n matrix is a rectangular array in which each entry a ij of the matrix is.
Copyright © 2011 Pearson, Inc. 7.3 Multivariate Linear Systems and Row Operations.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Sec 3.1 Introduction to Linear System Sec 3.2 Matrices and Gaussian Elemination The graph is a line in xy-plane The graph is a line in xyz-plane.
Matrix Algebra. Quick Review Quick Review Solutions.
Three variables Systems of Equations and Inequalities.
How To Find The Reduced Row Echelon Form. Reduced Row Echelon Form A matrix is said to be in reduced row echelon form provided it satisfies the following.
Chapter 1 Systems of Linear Equations
8.1 Matrices and Systems of Equations. Let’s do another one: we’ll keep this one Now we’ll use the 2 equations we have with y and z to eliminate the y’s.
CHAPTER 2 MATRIX. CHAPTER OUTLINE 2.1 Introduction 2.2 Types of Matrices 2.3 Determinants 2.4 The Inverse of a Square Matrix 2.5 Types of Solutions to.
 Lecture #9: 1.Linear Equations: y=mx +b 2.Solution System: N.S., U.S., I.S. 3.Augmented Matrix 4.Solving a System of Linear Equations  Today: 1.Echelon.
Sec 3.2 Matrices and Gaussian Elemination Coefficient Matrix 3 x 3 Coefficient Matrix 3 x 3 Augmented Coefficient Matrix 3 x 4 Augmented Coefficient Matrix.
Using Matrices A matrix is a rectangular array that can help us to streamline the solving of a system of equations The order of this matrix is 2 × 3 If.
4.3 Gauss Jordan Elimination Any linear system must have exactly one solution, no solution, or an infinite number of solutions. Just as in the 2X2 case,
Copyright © 2011 Pearson Education, Inc. Solving Linear Systems Using Matrices Section 6.1 Matrices and Determinants.
Matrices and Systems of Equations
Matrices and Systems of Linear Equations
Section 1.2 Gaussian Elimination. REDUCED ROW-ECHELON FORM 1.If a row does not consist of all zeros, the first nonzero number must be a 1 (called a leading.
How To Find The Reduced Row Echelon Form. Reduced Row Echelon Form A matrix is said to be in reduced row echelon form provided it satisfies the following.
Section 7-3 Solving 3 x 3 systems of equations. Solving 3 x 3 Systems  substitution (triangular form)  Gaussian elimination  using an augmented matrix.
Linear Equation System Pertemuan 4 Matakuliah: S0262-Analisis Numerik Tahun: 2010.
Chapter 1 Linear Algebra S 2 Systems of Linear Equations.
Matrices and Systems of Equations
Meeting 19 System of Linear Equations. Linear Equations A solution of a linear equation in n variables is a sequence of n real numbers s 1, s 2,..., s.
7.3 & 7.4 – MATRICES AND SYSTEMS OF EQUATIONS. I N THIS SECTION, YOU WILL LEARN TO  Write a matrix and identify its order  Perform elementary row operations.
Chapter 1 Systems of Linear Equations Linear Algebra.
Lecture 1 Systems of Linear Equations
Section 5.3 MatricesAnd Systems of Equations. Systems of Equations in Two Variables.
Gaussian Elimination Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Gaussian elimination with back-substitution.
College Algebra Chapter 6 Matrices and Determinants and Applications
Section 6.1 Systems of Linear Equations
Systems of linear equations
Gaussian Elimination and Gauss-Jordan Elimination
Solving Systems of Equations Using Matrices
Lecture 2 Matrices Lat Time - Course Overview
Chapter 1 Systems of Linear Equations
Chapter 8: Lesson 8.1 Matrices & Systems of Equations
Linear Algebra Lecture 15.
Agenda Textbook / Web Based Resource Basics of Matrices Classwork
Chapter 1 Systems of Linear Equations and Matrices
Matrices and Systems of Equations
Gaussian Elimination and Gauss-Jordan Elimination
Elementary Row Operations Gaussian Elimination Method
College Algebra Chapter 6 Matrices and Determinants and Applications
Section 8.1 – Systems of Linear Equations
Matrices are identified by their size.
Presentation transcript:

Gaussian Elimination and Gauss-Jordan Elimination mn matrix: Notes: (1) Every entry aij in a matrix is a number. (2) A matrix with m rows and n columns is said to be of size mn . (3) If , then the matrix is called square of order n. (4) For a square matrix, the entries a11, a22, …, ann are called the main diagonal entries.

Elementary row operation: (1) Interchange two rows. (2) Multiply a row by a nonzero constant. (3) Add a multiple of a row to another row.

Ex : (Elementary row operation)

Ex : Using elementary row operations to solve a system Linear System Associated Augemented Matrix Elementary Row Operation

Associated Augemented Matrix Elementary Row Operation Linear System

Row-echelon form: Reduced row-echelon form: (1) All row consisting entirely of zeros occur at the bottom of the matrix. (2) For each row that does not consist entirely of zeros, the first nonzero entry is 1 (called a leading 1). (3) For two successive (nonzero) rows, the leading 1 in the higher row is farther to the left than the leading 1 in the lower row. (4) Every column that has a leading 1 has zeros in every position above and below its leading 1.

Ex : (Row-echelon form or reduced row-echelon form)

Gaussian elimination: The procedure for reducing a matrix to a row-echelon form. Gauss-Jordan elimination: The procedure for reducing a matrix to a reduced row-echelon form. Notes: (1) Every matrix has an unique reduced row echelon form. (2) A row-echelon form of a given matrix is not unique. (Different sequences of row operations can produce different row-echelon forms.)

Ex: (Procedure of Gaussian elimination and Gauss-Jordan elimination) Produce leading 1 The first nonzero column leading 1 Produce leading 1 Zeros elements below leading 1 Submatrix The first nonzero column

leading 1 Produce leading 1 Submatrix Zeros elements below leading 1 Zeros elsewhere leading 1

Ex : Solve a system by Gauss-Jordan elimination method (only one solution) Sol:

Ex :Solve a system by Gauss-Jordan elimination method (infinitely many solutions) Sol:

Let So this system has infinitely many solutions.