AdMath 2. Matrix 2

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 30

ADVANCED MATHEMATICS

BSME-2ND YEAR
TOPIC FOR DISCUSSION:
MATRICES
Elementary Row Operations
Systems of Linear Equation, Augmented
Matrix
Gaussian Elimination
Reduced Row Echelon Form
OBJECTIVES:
(Continuation of Matrices)
By the end of this module, you must be able to:
• Evaluate Elementary Row Operations
• Identify Systems of Linear Equation,
Augmented Matrix
• Perform Gaussian Elimination
• Perform Reduced Row Echelon Form of the
Matrix
ELEMENTARY ROW OPERATIONS
ELEMENTARY ROW OPERATIONS
ELEMENTARY ROW OPERATIONS
ELEMENTARY ROW OPERATIONS
ELEMENTARY ROW OPERATIONS
SYSTEM OF LINEAR EQUATIONS
SYSTEM OF LINEAR EQUATIONS
SYSTEM OF LINEAR EQUATIONS
SYSTEM OF LINEAR EQUATIONS
SYSTEM OF LINEAR EQUATIONS
GAUSSIAN ELIMINATION
The standard numerical algorithm used to solve a system of linear
equations is called GAUSSIAN ELIMINATION. We first form the
augmented matrix followed by row reduction by the following
operations:

1. Switching any two rows


2. Multiplying any row by a non-zero (constant)
3. Adding one row to another.

The three operations do not change the solution of the original


equations. The goal is to convert the matrix into an UPPER
TRIANGULAR FORM, then use this to quickly solve for the unknowns.
GAUSSIAN ELIMINATION – EXAMPLE NO. 1
GAUSSIAN ELIMINATION – EXAMPLE NO. 1
GAUSSIAN ELIMINATION – EXAMPLE NO. 1
GAUSSIAN ELIMINATION – EXAMPLE NO. 1
GAUSSIAN ELIMINATION – EXAMPLE NO. 2
GAUSSIAN ELIMINATION – EXAMPLE NO. 2
GAUSSIAN ELIMINATION – EXAMPLE NO. 2
GAUSSIAN ELIMINATION – EXAMPLE NO. 2
GAUSSIAN ELIMINATION
• When performing Gaussian elimination, the
matrix element that is used during the
elimination procedure is called the pivot.
REDUCED ROW ECHELON FORM
• A matrix is said to be in reduced row echelon form
if the first non-zero entry in every row is a one, all
the entries below and above the one is zero, and
any zero rows occur at the bottom of the matrix.
• The row elimination procedure of Gaussian
elimination can be continued to bring a matrix to
reduced row echelon form. We notate the reduced
row echelon form of a matrix A as rref(A).
REDUCED ROW ECHELON FORM –
EXAMPLE NO. 1
REDUCED ROW ECHELON FORM –
EXAMPLE NO. 1
REDUCED ROW ECHELON FORM –
EXAMPLE NO. 1
REDUCED ROW ECHELON FORM –
EXAMPLE NO. 1
• We may say that the matrix A has two pivot
columns, that is, two columns that contain a
pivot position with a one in the reduced row
echelon form.
• Note that rows may need to be exchanged
when computing the reduced row echelon
form. Also, the reduced row echelon form of a
matrix A is unique, and if A is a square invertible
matrix, then rref(A) is the identity matrix.
REDUCED ROW ECHELON FORM –
EXAMPLE NO. 2
REDUCED ROW ECHELON FORM –
EXAMPLE NO. 2
REDUCED ROW ECHELON FORM –
EXAMPLE NO. 2

You might also like