Scribd
Upload
13 views8 pages

Gauss Elimination and Jordan

Numerical Methods

Uploaded by

Prateek Mishra
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
13 views8 pages

Gauss Elimination and Jordan

Numerical Methods

Uploaded by

Prateek Mishra
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/ 8

Gauss elimination and gauss

jordan
Er. Sudip rana
Linear equation.
 Equation is said to be linear if the highest degree in variable is 1.
 A linear equation can be expressed as 𝑎1 𝑥1 + 𝑎2 𝑥2 + ⋯ + 𝑎𝑛 𝑥𝑛 = 𝑏
 𝑎1 , 𝑎2,…… 𝑎𝑛 are called coefficient and b is constant term.
 If b=0; it is called linear homogeneous equation. Otherwise it is
called non linear homogeneous equation.
 For a homogeneous equation |AX|=0; if the solution Is only zero
then it is called trivial solution. The solution other than zero is called
non trivial solution.
 System of equation may not have solution. It is called inconsistent.
For eg when the lines are parallel.
 When there are infinite solution; it is called consistent. For eg
coincident lines.
 It is also consistent if it has unique solution. For eg intersecting lines.
Solution of system of linear equations
method

direct indirect

Gauss LU
Gauss Jordan Jacobi Gauss seidal
elimination decomposition
Gauss elimination
 It is called direct method since the value can be obtained
directly by elimination technique.
 Given equation is changed into augmented matrix form.
 It can be done by forward as well as backward elimination.
𝑎1 𝑏1 𝑐1 𝑑1
 0 𝑏2 𝑐2 𝑑2 is called upper triangular matrix.
0 0 𝑐3 𝑑3

𝑎1 0 0 𝑑1
 𝑎2 𝑏2 0 𝑑2 is called lower triangular matrix.
𝑎3 𝑏3 𝑐3 𝑑3
Continue…
 There are two technique for solving by gauss elimination.
Pivoting is the process of eliminating the variable
considering one focal pivot element.
 It can be done only if pivot element is non zero.
 Pivoting can be done either by partial or complete
pivoting method.
 In partial pivoting technique, the highest coefficient of
variable in row is kept at top at each step and made the
pivot element.
 In complete pivoting both columns and rows are searched
for highest coefficient. It involves more complexities and
difficult in practice and rarely used.
question

3x+2y+3z=18, x+4y+9z=16, 2x+y+z=10


(ans x=7, y=-9, z=5)
Y+3z+2u=19, 3y+2z+2u=20,
x+4y+2u=17, -2x+2y+z+u=9 (ans x=5,
y=6, z= -10, u=8)
Gauss Jordan method
 It is another technique to solve the system of linear
equations
 Here also elimination of variable is done but the given
matrix is changed into identity matrix i.e all non diagonal
elements are reduced to zero.
 It is also called reduced row echelon form.
1 0 0 𝑑1
 0 1 0 𝑑2 is the form in which we change the
0 0 1 𝑑3
augmented matrix.
 Roughly 50 % more operation is required in this method
than gauss elimination method.
question

1. X+2y+Z=8, 2x+3y+4z=20, 4x+3y+2z=16 (ans x=1,


y=2, z=3)
2. X1+2x2+x3-x4= -2, 2X1+3x2-x3+2x4= 7, X1+x2+3x3-
2x4= -6, X1+x2+x3+x4= 2
(ans 1, 0, -1, 2)

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