SlideShare a Scribd company logo
2
Most read
5
Most read
7
Most read
GAUSSIAN ELIMINATION
  METHOD

Presented By Andi Firdaus Sudarma
Student ID No. 432107963

M-505 Linear Algebra
DR. Rizwan Butt
Gaussian Elimination Method

 • Simple elimination without pivoting

 • Partial pivoting

 • Total pivoting
I. Simple Elimination Without Pivoting
Let say we have a system (size 3x3)with
augmented matrix form as:


               a11 a12 a13 b1
       A       a21 a22 a23 b2
               a31 a32         a33 b3
Procedure to get the solution:
1. The basic idea is to convert the system of A
   into upper-triangular matrix (U) form.

                 a11 a12        a13
        U         0     a22     a23
                  0       0     a33
2. Eliminate the element a21 and a31 using multiple
  factor of
             a21    and            a31
       m 21                  m 31
             a11                   a11
Hence, our matrix should be like this

               a11 a12 a13 b1
       A        0 a22 a23 b2
                0     a32     a33 b3
3. Eliminate the element a32 using multiple factor
   of         a32 to convert A into U
        m 32
              a22

4. The possible diagonal element (pivot element)
   should be non-zero. If it become zero at any
   stage, then interchange that row with any below
   row with non-zero element at that pivoting
   position.
5. After getting upper triangular matrix form, then
   use backward substitution to get the solution of
   the given linear system.


         a11x 1 a12 x 2 a13x 3     b1
                 a22 x 2 a23x 3    b2
                          a33x 3   b3
II. Pivoting Strategies
The basic idea of pivoting strategies is;
• To prevent diagonal (pivoting) element from
  becoming zero
• To make diagonal element larger in magnitude
  than any other coefficient below it, that is, to
  decrease round-off errors.
• After interchanging the system, use the same
  procedure that we discussed to get the solution.
• Partial Pivoting

Interchange the largest absolute coefficient of
variable X1
Example:
        Before                        After
    2      2     2                4      2    2
     4      2    2                2     2     2
     2     3     9                2     3     9
• Total Pivoting

Search the largest number in absolute, then
interchange this as the pivot
Example:
        Before                       After
    2      2     2              9      3      2
     4      2    2              2       2     4
     2     3     9               2     2      2
Thank You

More Related Content

PPTX
Numerical solution of system of linear equations
PPTX
Echelon and reduced echelon form & Filters
PPTX
system linear equations and matrices
PPTX
Gauss jordan and Guass elimination method
PPT
Null space, Rank and nullity theorem
PPTX
System of linear equations
PPTX
Gauss Elimination & Gauss Jordan Methods in Numerical & Statistical Methods
Numerical solution of system of linear equations
Echelon and reduced echelon form & Filters
system linear equations and matrices
Gauss jordan and Guass elimination method
Null space, Rank and nullity theorem
System of linear equations
Gauss Elimination & Gauss Jordan Methods in Numerical & Statistical Methods

What's hot (20)

PPTX
GAUSS ELIMINATION METHOD
PPTX
lagrange interpolation
PPTX
Bisection method
PPTX
Differential equations
PDF
Study Material Numerical Differentiation and Integration
PPTX
Differential equations
PPT
numerical methods
PPTX
Numerical analysis ppt
PPTX
Differential equations of first order
PPTX
newton raphson method
PPTX
Vector space
PPTX
Lu Decomposition
PDF
Numerical Methods - Power Method for Eigen values
PPTX
Ordinary differential equations
PPT
Gauss sediel
PPTX
Homogeneous Linear Differential Equations
PPTX
Bisection method
PPTX
Lagrange’s interpolation formula
PPTX
Newton’s Forward & backward interpolation
PPTX
Vector Spaces,subspaces,Span,Basis
GAUSS ELIMINATION METHOD
lagrange interpolation
Bisection method
Differential equations
Study Material Numerical Differentiation and Integration
Differential equations
numerical methods
Numerical analysis ppt
Differential equations of first order
newton raphson method
Vector space
Lu Decomposition
Numerical Methods - Power Method for Eigen values
Ordinary differential equations
Gauss sediel
Homogeneous Linear Differential Equations
Bisection method
Lagrange’s interpolation formula
Newton’s Forward & backward interpolation
Vector Spaces,subspaces,Span,Basis
Ad

Viewers also liked (20)

PPTX
Gaussian elimination method & homogeneous linear equation
PPT
Gauss elimination
DOCX
Gauss elimination method
PPTX
Gauss y gauss jordan
PPTX
linear equation and gaussian elimination
PPT
Gauss-Jordan Theory
PPTX
Gauss jordan
PPTX
Direct Methods to Solve Linear Equations Systems
PPT
NUMERICAL METHODS -Iterative methods(indirect method)
PDF
Gauss elimination & Gauss Jordan method
PDF
Gauss Jordan Method
PPTX
Independence, basis and dimension
PDF
Met num 6
PDF
An implicit partial pivoting gauss elimination algorithm for linear system of...
PDF
12X1 T09 06 probability & counting techniques
PPT
Automated Diagnostic system for strength of metal transmission towers
PPT
81 systems of linear equations 1
PPTX
Gauss jordan
PPTX
Linear Systems - Expansion and Movement Joints
PPTX
Chapter 3 linear systems
Gaussian elimination method & homogeneous linear equation
Gauss elimination
Gauss elimination method
Gauss y gauss jordan
linear equation and gaussian elimination
Gauss-Jordan Theory
Gauss jordan
Direct Methods to Solve Linear Equations Systems
NUMERICAL METHODS -Iterative methods(indirect method)
Gauss elimination & Gauss Jordan method
Gauss Jordan Method
Independence, basis and dimension
Met num 6
An implicit partial pivoting gauss elimination algorithm for linear system of...
12X1 T09 06 probability & counting techniques
Automated Diagnostic system for strength of metal transmission towers
81 systems of linear equations 1
Gauss jordan
Linear Systems - Expansion and Movement Joints
Chapter 3 linear systems
Ad

Similar to Gaussian Elimination Method (20)

DOCX
Gauss jordan elimination through pivoting
 
PPTX
Gauss Elimination and Gauss Jordan.pptx
PPTX
Gauss Elimination (With Partial Pivot)
PPTX
Row Reducing
PDF
Slide_Chapter1_st.pdf
PDF
Numerical Method Pivoting Problems solving
PDF
Applied numerical methods lec6
PDF
Numerical Methods
PDF
GaussElimination .pdf
PPTX
budget optimization using gaussian elimination ppt
PDF
S1 Dualsimplex
PPTX
Direct Methods For The Solution Of Systems Of
PDF
Echelon or not
PPT
Sisteme de ecuatii
PPTX
06. Gaussian Elimination.pptx
PPT
Linear-Algebra.ppt
PPT
Linear-Algebra.ppt
PDF
Gauss Elimination Method With Partial Pivoting
PDF
Numerical Methods in Civil engineering for problem solving
PDF
Numerical Solution of Linear algebraic Equation
Gauss jordan elimination through pivoting
 
Gauss Elimination and Gauss Jordan.pptx
Gauss Elimination (With Partial Pivot)
Row Reducing
Slide_Chapter1_st.pdf
Numerical Method Pivoting Problems solving
Applied numerical methods lec6
Numerical Methods
GaussElimination .pdf
budget optimization using gaussian elimination ppt
S1 Dualsimplex
Direct Methods For The Solution Of Systems Of
Echelon or not
Sisteme de ecuatii
06. Gaussian Elimination.pptx
Linear-Algebra.ppt
Linear-Algebra.ppt
Gauss Elimination Method With Partial Pivoting
Numerical Methods in Civil engineering for problem solving
Numerical Solution of Linear algebraic Equation

Gaussian Elimination Method

  • 1. GAUSSIAN ELIMINATION METHOD Presented By Andi Firdaus Sudarma Student ID No. 432107963 M-505 Linear Algebra DR. Rizwan Butt
  • 2. Gaussian Elimination Method • Simple elimination without pivoting • Partial pivoting • Total pivoting
  • 3. I. Simple Elimination Without Pivoting Let say we have a system (size 3x3)with augmented matrix form as: a11 a12 a13 b1 A a21 a22 a23 b2 a31 a32 a33 b3
  • 4. Procedure to get the solution: 1. The basic idea is to convert the system of A into upper-triangular matrix (U) form. a11 a12 a13 U 0 a22 a23 0 0 a33
  • 5. 2. Eliminate the element a21 and a31 using multiple factor of a21 and a31 m 21 m 31 a11 a11 Hence, our matrix should be like this a11 a12 a13 b1 A 0 a22 a23 b2 0 a32 a33 b3
  • 6. 3. Eliminate the element a32 using multiple factor of a32 to convert A into U m 32 a22 4. The possible diagonal element (pivot element) should be non-zero. If it become zero at any stage, then interchange that row with any below row with non-zero element at that pivoting position.
  • 7. 5. After getting upper triangular matrix form, then use backward substitution to get the solution of the given linear system. a11x 1 a12 x 2 a13x 3 b1 a22 x 2 a23x 3 b2 a33x 3 b3
  • 8. II. Pivoting Strategies The basic idea of pivoting strategies is; • To prevent diagonal (pivoting) element from becoming zero • To make diagonal element larger in magnitude than any other coefficient below it, that is, to decrease round-off errors. • After interchanging the system, use the same procedure that we discussed to get the solution.
  • 9. • Partial Pivoting Interchange the largest absolute coefficient of variable X1 Example: Before After 2 2 2 4 2 2 4 2 2 2 2 2 2 3 9 2 3 9
  • 10. • Total Pivoting Search the largest number in absolute, then interchange this as the pivot Example: Before After 2 2 2 9 3 2 4 2 2 2 2 4 2 3 9 2 2 2