lesson 3 . 7 variable linear equation systems

#Lesson 3 . 7 variable linear equation systems how to

The Gaussian elimination rules are the same as the rules for the three elementary row operations, in other words, you can algebraically operate on the rows of a matrix in the next three ways (or combination of): This last step will produce a reduced echelon form of the matrix which in turn provides the general solution to the system of linear equations.

If is possible to obtain solutions for the variables involved in the linear system, then the Gaussian elimination with back substitution stage is carried through. If found that the system has no solution, then there is no reason to continue row reducing the matrix through the next stage. Such stage has the purpose to demonstrate if the system of equations portrayed in the matrix have a unique possible solution, infinitely many solutions or just no solution at all. The forward elimination step refers to the row reduction needed to simplify the matrix in question into its echelon form. These two Gaussian elimination method steps are differentiated not by the operations you can use through them, but by the result they produce. This technique is also called row reduction and it consists of two stages: Forward elimination and back substitution.

Gaussian elimination is the name of the method we use to perform the three types of matrix row operations on an augmented matrix coming from a linear system of equations in order to find the solutions for such system.

#Lesson 3 . 7 variable linear equation systems how to

Solving a linear system with matrices using Gaussian eliminationĪfter a few lessons in which we have repeatedly mentioned that we are covering the basics needed to later learn how to solve systems of linear equations, the time has come for our lesson to focus on the full methodology to follow in order to find the solutions for such systems.