Scribd
Upload
141 views2 pages

Gauss Elimination

1. The Gauss-Elimination Method is a method to solve systems of linear equations in two steps: converting the matrix to upper triangular form through elimination, then back substitution to solve for the variables. 2. Pivoting may be necessary during elimination to avoid a zero pivot or division by very small numbers. No pivoting is needed if the matrix is diagonally dominant, symmetric, and positive definite. 3. Two examples demonstrate applying the Gauss-Elimination Method to solve systems of 3 equations in 3 unknowns, showing the elimination and back substitution steps.

Uploaded by

शशि शंकर
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
141 views2 pages

Gauss Elimination

1. The Gauss-Elimination Method is a method to solve systems of linear equations in two steps: converting the matrix to upper triangular form through elimination, then back substitution to solve for the variables. 2. Pivoting may be necessary during elimination to avoid a zero pivot or division by very small numbers. No pivoting is needed if the matrix is diagonally dominant, symmetric, and positive definite. 3. Two examples demonstrate applying the Gauss-Elimination Method to solve systems of 3 equations in 3 unknowns, showing the elimination and back substitution steps.

Uploaded by

शशि शंकर
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/ 2

1.

Gauss-Elimination Method
1.1 Algorithm

Step 1. Convert nxn matrix into an nxn upper triangular matrix


Step 2. Back substitution to get the solution

Note: (i) In the elimination process, if any one of pivot elements 𝑎 ( ) , 𝑎 ( ) , … . , 𝑎 ( )


vanishes or becomes very small compared to other elements in that row so as to obtain a non-
vanishing pivot or to avoid multiplication by large number.
(ii) If the matrix A is diagonally dominant or real, symmetric and +ve definite, then there is no
pivoting is necessary.

1.2 Numerical Examples


Ex 1. Apply Gauss-Elimination method to solve the equations

𝑥+𝑦+𝑧 =9
2𝑥 − 3𝑦 + 4𝑧 = 13
3𝑥 + 4𝑦 + 5𝑧 = 40
Solun. We have

𝑥+𝑦+𝑧 =9 … (i)
2𝑥 − 3𝑦 + 4𝑧 = 13 …. (ii)
3𝑥 + 4𝑦 + 5𝑧 = 40 … (iii)
() ()
Step 1. To Eliminate x from (ii) and (iii) operating (ii) – and (iii) – we get

𝑥+𝑦+𝑧 =9 … (iv)
−5𝑦 + 2𝑧 = −5 … (v)
𝑦 + 2𝑧 = 13 … (vi)

( )
Step 2. To Eliminate y from (vi) operating (vi) + we get
𝑥+𝑦+𝑧 =9 … (vii)
−5𝑦 + 2𝑧 = −5 … (viii)
2 + 𝑧 = 13 − 1 … (ix)

On back substitution, we get the solution 𝑧 = 5, 𝑦 = 3 𝑎𝑛𝑑 𝑥 = 1

Ex 2. Solve the equations


𝑥+𝑦+𝑧 =6
3𝑥 + 3𝑦 + 4𝑧 = 20
2𝑥 + 1𝑦 + 3𝑧 = 13
Using Gauss elimination method.
Solun.
Step1. Elimination x from last two equations, we get

𝑥+𝑦+𝑧 =6
𝑧=2
−𝑦 + 𝑧 = 1
Here the pivot in the second equation is zero and so we cannot proceed as usual. We interchange
2nd and 3rd equations before the 2nd step

Step 2.
𝑥+𝑦+𝑧 =6
−𝑦 + 𝑧 = 1
𝑧=2
On back substitution, we get the solution 𝑧 = 2, 𝑦 = 1 𝑎𝑛𝑑 𝑥 = 3

You might also like