Scribd
Upload
81 views4 pages

Gauss Elimination Method: To An Upper Triangular Form

Gaussian elimination is a method of solving a linear system equations in unknowns) by bringing the augmented matrix to an upper triangular form. The first part (forward elimination) reduces a given system to either triangular or echelon form, or results in a degenerate equation with no solution. The second part uses back substitution to find the solution of the system above.

Uploaded by

Soumik Saha
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
81 views4 pages

Gauss Elimination Method: To An Upper Triangular Form

Gaussian elimination is a method of solving a linear system equations in unknowns) by bringing the augmented matrix to an upper triangular form. The first part (forward elimination) reduces a given system to either triangular or echelon form, or results in a degenerate equation with no solution. The second part uses back substitution to find the solution of the system above.

Uploaded by

Soumik Saha
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Gauss Elimination Method

Gaussian elimination is a method of solving a linear system equations in unknowns) by bringing the augmented matrix (consisting of

to an upper triangular form

The process of Gaussian elimination has two parts. The first part (Forward Elimination) reduces a given system to either triangular or echelon form, or results in a degenerate equation with no solution, indicating the system has no solution. This is accomplished through the use of elementary row operations. The second step uses back substitution to find the solution of the system above. Stated equivalently for matrices, the first part reduces a matrix to row echelon form using elementary row operations while the second reduces it to reduced row echelon form, or row canonical form. Another point of view, which turns out to be very useful to analyze the algorithm, is that Gaussian elimination computes a matrix decomposition. The three elementary row operations used in the Gaussian elimination (multiplying rows, switching rows, and adding multiples of rows to other rows) amount to multiplying the original matrix with invertible matrices from the left. The first part of the algorithm computes an LU decomposition, while the second part writes the original matrix as the product of a uniquely determined invertible matrix and a uniquely determined reduced row-echelon matrix. This elimination process is also called the forward elimination method. The following examples illustrate the Gauss elimination procedure.

EXAMPLE 2.2.11 Solve the linear system by Gauss elimination method.

Solution: In this case, the augmented matrix is along the following steps. 1. Interchange and equation (or ).

The method proceeds

2. Divide the

equation by

(or

).

3. Add

times the

equation to the

equation (or

).

4. Add

times the

equation to the

equation (or

).

5. Multiply the

equation by

(or

).

The last equation gives equation gives SOLUTION.

the second equation now gives Hence the set of solutions is

Finally the first A UNIQUE

EXAMPLE 2.2.12 Solve the linear system by Gauss elimination method.

Solution: In this case, the augmented matrix is proceeds as follows: 1. Add times the first equation to the second equation.

and the method

2. Add

times the first equation to the third equation.

3. Add

times the second equation to the third equation

Thus, the set of solutions is with arbitrary. In other words, the system has INFINITE NUMBER OF SOLUTIONS.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy