Gauss Elimination.

Slides:



Advertisements
Similar presentations
Section 2.2 Systems of Liner Equations: Unique Solutions.
Advertisements

4.3 Matrix Approach to Solving Linear Systems 1 Linear systems were solved using substitution and elimination in the two previous section. This section.
Chapter 1: Linear Equations
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
1.2 Row Reduction and Echelon Forms
Linear Equations in Linear Algebra
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.
Matrices. Special Matrices Matrix Addition and Subtraction Example.
Chapter 1 Systems of Linear Equations
Row Reduction and Echelon Forms (9/9/05) A matrix is in echelon form if: All nonzero rows are above any all-zero rows. Each leading entry of a row is in.
10.1 Gaussian Elimination Method
Section 8.1 – Systems of Linear Equations
Elementary Linear Algebra Howard Anton Copyright © 2010 by John Wiley & Sons, Inc. All rights reserved. Chapter 1.
Matrices Write and Augmented Matrix of a system of Linear Equations Write the system from the augmented matrix Solve Systems of Linear Equations using.
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.
Systems of Linear Equations and Row Echelon Form.
SYSTEMS OF LINEAR EQUATIONS
Elementary Linear Algebra Howard Anton Copyright © 2010 by John Wiley & Sons, Inc. All rights reserved. Chapter 1.
Math Dept, Faculty of Applied Science, HCM University of Technology
Linear Equations in Linear Algebra
System of Linear Equations Nattee Niparnan. LINEAR EQUATIONS.
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.
Section 1.1 Introduction to Systems of Linear Equations.
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.
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.
Row rows A matrix is a rectangular array of numbers. We subscript entries to tell their location in the array Matrices are identified by their size.
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.
A matrix equation has the same solution set as the vector equation which has the same solution set as the linear system whose augmented matrix is Therefore:
We will use Gauss-Jordan elimination to determine the solution set of this linear system.
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,
4.6: Rank. Definition: Let A be an mxn matrix. Then each row of A has n entries and can therefore be associated with a vector in The set of all linear.
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
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.
Sullivan Algebra and Trigonometry: Section 12.3 Objectives of this Section Write the Augmented Matrix of a System of Linear Equations Write the System.
10.3 Systems of Linear Equations: Matrices. A matrix is defined as a rectangular array of numbers, Column 1Column 2 Column jColumn n Row 1 Row 2 Row 3.
Matrices and Systems of Equations
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.
Arab Open University Faculty of Computer Studies M132: Linear Algebra
1 1.2 Linear Equations in Linear Algebra Row Reduction and Echelon Forms © 2016 Pearson Education, Ltd.
Linear Algebra Engineering Mathematics-I. Linear Systems in Two Unknowns Engineering Mathematics-I.
1 SYSTEM OF LINEAR EQUATIONS BASE OF VECTOR SPACE.
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
Gaussian Elimination and Gauss-Jordan Elimination
Solving Systems of Equations Using Matrices
Linear Algebra Lecture 4.
Chapter 8: Lesson 8.1 Matrices & Systems of Equations
Chapter 1 Systems of Linear Equations and Matrices
Linear Equations in Linear Algebra
4.6: Rank.
Elementary Row Operations Gaussian Elimination Method
Systems of Linear Equations
Chapter 1: Linear Equations in Linear Algebra
College Algebra Chapter 6 Matrices and Determinants and Applications
Section 8.1 – Systems of Linear Equations
Matrices are identified by their size.
Linear Equations in Linear Algebra
Linear Equations in Linear Algebra
Presentation transcript:

Gauss Elimination

A System of Linear Equations

Two Equations, Two Unknowns: Lines in a Plane

Three Possible Types of Solutions 1. No solution

Three Possible Types of Solutions 1. A unique solution

Three Possible Types of Solutions 1. Infinitely many solutions

Three Equations, Three Unknowns: Planes in Space

Intesections of Planes What type of solution sets are represented?

Solve the System

Elementary Operations Interchange the order in which the equations are listed. Multiply any equation by a nonzero number. Replace any equation with itself added to a multiple of another equation.

Augmented Matrix

Row Operations Switch two rows. Multiply any row by a nonzero number. Replace any row by a multiple of another row added to it.

Solve the System

Echelon Form A rectangular matrix is in echelon form if it has the following properties: 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry of a row is in a column to the right of the leading entry of the row above it.

Echelon Form

Echelon Form

Pivot Positions and Pivot Columns The positions of the first nonzero entry in each row are called the pivot positions. The columns containing a pivot position are called the pivot columns.

Types of Solutions 1. No solution – the augmented column is a pivot column. 2. A unique solution – every column except the augmented column is a pivot column. 3. An infinite number of solutions – some column of the coefficient matrix is not a pivot column. The variables corresponding to the columns that are not pivot columns are assigned parameters. These variables are called the free variables. The other variables may be solved in terms of the parameters and are called basic variables or leading variables.

Example

Example

Example

Solve the System

Solve the System

Echelon Form A rectangular matrix is in row reduced echelon form if it has the following properties: 1. It is in echelon form. 2. All entries in a column above and below a leading entry are zero. 3. Each leading entry is a 1, the only nonzero entry in its column.

Reduced Row Echelon Form

Reduced Row Echelon Form

Solve the System

Solve the System

Example Estimate the temperatures T1, T2, T3, T4, T5, and T6 at the six points on the steel plate below. The value Tk is approximated by the average value of the temperature at the four closest points. 20 20 20 T1 T2 T3 T4 T5 T6 20 20 20

Number of free variable = n – rank(A) The rank of a matrix is the number of nonzero rows in its row echelon form. Rank Theorem Let A be the coefficient matrix of a system of linear equations with n variables. If the system is consistent, then Number of free variable = n – rank(A)

Homogeneous System

Theorem