Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
19 views17 pages

University of Palestine Gaza Strip Civil Engineering College Numerical Analysis CIVL 3309 Dr. Suhail Lubbad

Uploaded by

Hazem Almasry

This document contains lecture notes on numerical analysis techniques for solving systems of equations. It discusses Gauss elimination and Gauss-Jordan elimination. For Gauss elimination, it covers techniques to improve solutions such as partial pivoting to avoid division by zero when the pivot element is zero. It also discusses scaling to minimize round-off errors and terminating calculations when the system is singular. For determinants, it explains that Gauss elimination can be used to evaluate determinants by applying row operations and noting how they change the determinant value. Examples are provided to demonstrate both techniques.

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt

University of Palestine Gaza Strip Civil Engineering College Numerical Analysis CIVL 3309 Dr. Suhail Lubbad

Uploaded by

Hazem Almasry
19 views17 pages
This document contains lecture notes on numerical analysis techniques for solving systems of equations. It discusses Gauss elimination and Gauss-Jordan elimination. For Gauss elimination, it covers techniques to improve solutions such as partial pivoting to avoid division by zero when the pivot element is zero. It also discusses scaling to minimize round-off errors and terminating calculations when the system is singular. For determinants, it explains that Gauss elimination can be used to evaluate determinants by applying row operations and noting how they change the determinant value. Examples are provided to demonstrate both techniques.

Original Title

9

Copyright

© © All Rights Reserved

Available Formats

PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

This document contains lecture notes on numerical analysis techniques for solving systems of equations. It discusses Gauss elimination and Gauss-Jordan elimination. For Gauss elimination, it covers techniques to improve solutions such as partial pivoting to avoid division by zero when the pivot element is zero. It also discusses scaling to minimize round-off errors and terminating calculations when the system is singular. For determinants, it explains that Gauss elimination can be used to evaluate determinants by applying row operations and noting how they change the determinant value. Examples are provided to demonstrate both techniques.

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
19 views17 pages

University of Palestine Gaza Strip Civil Engineering College Numerical Analysis CIVL 3309 Dr. Suhail Lubbad

Uploaded by

Hazem Almasry
This document contains lecture notes on numerical analysis techniques for solving systems of equations. It discusses Gauss elimination and Gauss-Jordan elimination. For Gauss elimination, it covers techniques to improve solutions such as partial pivoting to avoid division by zero when the pivot element is zero. It also discusses scaling to minimize round-off errors and terminating calculations when the system is singular. For determinants, it explains that Gauss elimination can be used to evaluate determinants by applying row operations and noting how they change the determinant value. Examples are provided to demonstrate both techniques.

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 17

University of Palestine

Gaza Strip

Civil Engineering College


Numerical analysis
CIVL 3309
Formerly CVL 3308

Dr. Suhail Lubbad


Ch 9.4 TECHNIQUES FOR IMPROVING SOLUTIONS

Ch9.7 GAUSS-JORDAN ELIMINATION


Problems and Solution for Gauss Elimination

1- pivot (leading) element a11= 0 or even a11 ~ 0


Possible division by Zero

Solution: Partial pivoting


The row with the largest available leading coefficient in the
columns below the pivot element can then be the pivot row.

(remember: this is done more than once!!)

If columns as well as rows are searched for the largest element and then switched, the
procedure is called complete pivoting which we won't use.
2- Round-off Errors

Solution

● The simplest to do specially for ill-conditioned systems


is to use more significant figures in the computation

● Scaling
Setting the largest coefficient to 1

minimizes round-off errors


where some of the equations in a system have much larger
coefficients than others

Scaling helps determining whether pivoting is necessary or not


Singular Systems determinant =0

Either no Solution or infinitely many, the computer can NOT THINK

Solution
Terminate the calculations
Gauss Eliminations for determinants evaluation

The determinant of a triangular matrix is the product of its


diagonal elements.

WHAT IS DIFFERENT BETWEEN DETERMINANTS and MATRICES ?

&

HOW DIFFERENT IS GAUSS ELIMINATION FOR


DETERMINANTS AND MATRICES ?
THE TOOLS ARE
THREE ROW OPERATIONS

Interchange any two rows.


WHY
POSSIBLE
(BUT HERE YOU MUST CHANGE THE SIGN OF THE DETERMINANT)
?
Multiply a row by a constant.
(BUT HERE YOU MUST DIVIDE THE DETERMINANT BY THAT SAME
CONSTANT)

Multiply a row by a constant1 and add to it,


or subtract from it, another row multiplied by any constant2.
(BUT HERE YOU MUST DIVIDE THE DETERMINANT BY THAT SAME
CONSTANT1)

CONTINUE
REMEMBER: the hummer!!!
Example
Gauss elimination to evaluate determinants

∣ ∣ ∣ ∣ ∣ ∣
1 2 3 1 2 3 1 2 3
EX 1 4
7
5
8
6
9
{ r 2 ' r 2 −4 r 1
r 3 ' r 3 −7 r 1
0 −3
0 −6 −12
−6 r 3 ' r 3−2r 2 0 −3 −6
0 0 0
=0

==================================================

∣ ∣{ ∣ ∣ ∣ ∣
8 2 3 8 2 3 8 2 3
r 2 ' 4r 2−r 1 1 1 1 1
EX 2 2 4 6 × 0 14 21 r3 ' r 2 −r 3 × ×(−1) 0 14 21
r 3 ' 8r 3−r1 4 8 4 8
1 2 1 0 14 5 0 0 16

1 1
= × ×(−1) 8×14×16
4 8

One could perform the last step by

∣ ∣
1 1
8 2 3 1 1
r 3 ' r 3−r 2 × 0 14 21 = × 8×14×−16
4 8
0 0 −16 4 8
Example 9.10
100,000 – 2 = 99,998 ≈ 100,000
Gauss-Jordan Elimination (forward + backward elimination)
Example 9.12:
See page 264 for algorithm for Gauss-Elimination with partial pivoting
Questions?

You might also like