0% found this document useful (0 votes)
75 views

Gauss Elimination and Jordan Method

The document discusses various methods for solving systems of numerical equations including Gauss elimination, Gauss-Jordan elimination, and back substitution. It provides examples of using these methods to solve systems of 2-3 equations and explains the steps involved in Gauss elimination and Gauss-Jordan elimination.

Uploaded by

fictionlight30
Copyright
© © All Rights Reserved
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
0% found this document useful (0 votes)
75 views

Gauss Elimination and Jordan Method

The document discusses various methods for solving systems of numerical equations including Gauss elimination, Gauss-Jordan elimination, and back substitution. It provides examples of using these methods to solve systems of 2-3 equations and explains the steps involved in Gauss elimination and Gauss-Jordan elimination.

Uploaded by

fictionlight30
Copyright
© © All Rights Reserved
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/ 26

Mathematical Structures for Computer

DEPARTMENT OF MATHEMATICS

Science

Programme B.Sc. CT

Solution of Numerical
Unit I
Algebraic and Transcendental
equations
DEPARTMENT OF MATHEMATICS

Text Books
Solution of Numerical Algebraic and Transcendental equations

1. Bisection Method

2. Newton Raphson Method

3. Regular-Falsi Method

4. Gauss Elimination Method

5. Gauss Jordan Method and Gauss Seidal method


Gauss-Elimination and Gauss Jordan Method
DEPARTMENT OF MATHEMATICS

It relies upon three elementary row operations


one can use on a matrix:
1.Swap the positions of two of the rows
2.Multiply one of the rows by a nonzero scalar.
3.Add or subtract the scalar multiple of one
row to another row.
Reduced-row echelon form
DEPARTMENT OF MATHEMATICS

The purpose of Gauss-Jordan


Elimination is to use the three elementary
row operations to convert a matrix into
reduced-row echelon form.
A matrix is in reduced-row echelon
form, also known as row canonical form, if
the following conditions are satisfied:
1.All rows with only zero entries are at the
bottom of the matrix
DEPARTMENT OF MATHEMATICS

2.The first nonzero entry in a row, called the


leading entry or the pivot, of each nonzero
row is to the right of the leading entry of the
row above it.
3.The leading entry, also known as the pivot,
in any nonzero row is 1.
4.All other entries in the column containing a
leading 1 are zeroes.
Steps for Gauss Elimination
DEPARTMENT OF MATHEMATICS

1.Swap the rows so that all rows with all zero


entries are on the bottom
2.Swap the rows so that the row with the
largest, left most nonzero entry is on top.
3.Multiply the top row by a scalar so that top
row's leading entry becomes 1.
DEPARTMENT OF MATHEMATICS

4. Add/subtract multiples of the top row to


the other rows so that all other entries in the
column containing the top row's leading
entry are all zero.
5. Once in this form, we can say that 𝑧 and
use back substitution to solve for y and x.
Steps for Gauss-Jordan Elimination
DEPARTMENT OF MATHEMATICS

To perform Gauss-Jordan Elimination:


1.Swap the rows so that all rows with all zero
entries are on the bottom
2.Swap the rows so that the row with the
largest, leftmost nonzero entry is on top.
3.Multiply the top row by a scalar so that top
row's leading entry becomes 1.
4. Add/subtract multiples of the top row to
the other rows so that all other entries in the
DEPARTMENT OF MATHEMATICS

column containing the top row's leading


entry are all zero.
5. Repeat steps 2-4 for the next left most
nonzero entry until all the leading entries are
1.
6. Swap the rows so that the leading entry of
each nonzero row is to the right of the
leading entry of the row above it.
Solve Equations 2x+3y-z=5,3x+2y+z=10,x-5y+3z=0
using Gauss Elimination Back Substitution
method

Solution:
Total Equations are 3

2x + 3y - z = 5 → (1)

3x + 2y + z = 10 → (2)

x - 5y + 3z = 0 → (3)

Converting given equations into matrix form


2 3 -1 5
3 2 1 10
1 -5 3 0

R 2 ← R 2 - 1.5 × R 1

2 3 -1 5
= 0 - 2.5 2.5 2.5
1 -5 3 0
R 3 ← R 3 - 0.5 × R 1

2 3 -1 5
= 0 - 2.5 2.5 2.5
0 - 6.5 3.5 - 2.5

R 3 ← R 3 - 2.6 × R 2

2 3 -1 5
=
0 - 2.5 2.5 2.5
0 0 -3 -9

i. e.

2x + 3y - z = 5 → (1)

- 2.5y + 2.5z = 2.5 → (2)

- 3z = - 9 → (3)

Now use back substitution method


From (3)
- 3z = - 9

-9
⇒z= =3
-3

From (2)
- 2.5y + 2.5z = 2.5

⇒ - 2.5y + 2.5(3) = 2.5

⇒ - 2.5y + 7.5 = 2.5

⇒ - 2.5y = 2.5 - 7.5 = - 5


2
⇒y= -5× - =2
5

From (1)
2x + 3y - z = 5

⇒ 2x + 3(2) - 1(3) = 5

⇒ 2x + 3 = 5

⇒ 2x = 5 - 3 = 2
2
⇒x= =1
2

Solution using back substitution method.


x = 1, y = 2 and z = 3
Solve Equations x+y+z=3,2x-y-z=3,x-y+z=9 using
Gauss-Jordan Elimination method

Solution:
Total Equations are 3

x + y + z = 3 → (1)

2x - y - z = 3 → (2)

x - y + z = 9 → (3)

Converting given equations into matrix form


1 1 1 3
2 -1 -1 3
1 -1 1 9

R2 ← R2 - 2 × R1

1 1 1 3
= 0 -3 -3 -3
1 -1 1 9
R3 ← R3 - R1

1 1 1 3
= 0 -3 -3 -3
0 -2 0 6

R2 ← R2 ÷ - 3

1 1 1 3
=
0 1 1 1
0 -2 0 6

R1 ← R1 - R2

1 0 0 2
= 0 1 1 1
0 -2 0 6
R3 ← R3 + 2 × R2

1 0 0 2
= 0 1 1 1
0 0 2 8

R3 ← R3 ÷ 2

1 0 0 2
=
0 1 1 1
0 0 1 4

R2 ← R2 - R3

1 0 0 2
= 0 1 0 -3
0 0 1 4

i. e.
x=2

y= -3

z=4

Solution By Gauss jordan elimination method


x = 2, y = - 3 and z = 4
DEPARTMENT OF MATHEMATICS

Summary
DEPARTMENT OF MATHEMATICS

Thank You

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