Gaussian Elimination Mechanical Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for.

Slides:



Advertisements
Similar presentations
4/22/ LU Decomposition Electrical Engineering Majors Authors: Autar Kaw Transforming.
Advertisements

4/26/ LU Decomposition Civil Engineering Majors Authors: Autar Kaw Transforming.
Simultaneous Linear Equations
Major: All Engineering Majors Authors: Autar Kaw
Differentiation-Discrete Functions
5/19/ Runge 4 th Order Method Mechanical Engineering Majors Authors: Autar Kaw, Charlie Barker
Major: All Engineering Majors Author(s): Autar Kaw
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 15 Solution of Systems of Equations.
Algorithm for Gauss elimination 1) first eliminate for each eq. j, j=1 to n-1 for all eq.s k greater than j a) multiply eq. j by a kj /a jj b) subtract.
8/8/ Gauss Quadrature Rule of Integration Major: All Engineering Majors Authors: Autar Kaw, Charlie Barker
Major: All Engineering Majors Author(s): Autar Kaw
Computer Engineering Majors Authors: Autar Kaw
9/7/ Gauss-Siedel Method Chemical Engineering Majors Authors: Autar Kaw Transforming.
9/14/ Trapezoidal Rule of Integration Major: All Engineering Majors Authors: Autar Kaw, Charlie Barker
9/19/2015http://numericalmethods.eng.usf.edu1 Introduction to Scientific Computing Major: All Engineering Majors Authors: Autar Kaw, Luke Snyder
10/8/ Propagation of Errors Major: All Engineering Majors Authors: Autar Kaw, Matthew Emmons
ΑΡΙΘΜΗΤΙΚΕΣ ΜΕΘΟΔΟΙ ΜΟΝΤΕΛΟΠΟΙΗΣΗΣ 4. Αριθμητική Επίλυση Συστημάτων Γραμμικών Εξισώσεων Gaussian elimination Gauss - Jordan 1.
10/17/ Gauss-Siedel Method Industrial Engineering Majors Authors: Autar Kaw
Chemical Engineering Majors Author(s): Autar Kaw
10/26/ Gauss-Siedel Method Civil Engineering Majors Authors: Autar Kaw Transforming.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3 - Chapter 9 Linear Systems of Equations: Gauss Elimination.
11/30/ Romberg Rule of Integration Mechanical Engineering Majors Authors: Autar Kaw, Charlie Barker
Gaussian Elimination Electrical Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for.
1 Direct Method of Interpolation Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
Gaussian Elimination Industrial Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for.
1/18/ LU Decomposition Industrial Engineering Majors Authors: Autar Kaw Transforming.
Mechanical Engineering Majors Authors: Autar Kaw
1 Direct Method of Interpolation Mechanical Engineering Majors Authors: Autar Kaw, Jai Paul
2/26/ Gauss-Siedel Method Electrical Engineering Majors Authors: Autar Kaw
3/1/ LU Decomposition Computer Engineering Majors Authors: Autar Kaw Transforming.
3/6/ Gauss-Siedel Method Major: All Engineering Majors Author: دکتر ابوالفضل رنجبر نوعی
Gaussian Elimination Civil Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for STEM.
1 Newton’s Divided Difference Polynomial Method of Interpolation Mechanical Engineering Majors Authors: Autar Kaw,
1 Spline Interpolation Method Mechanical Engineering Majors Authors: Autar Kaw, Jai Paul
3/12/ Trapezoidal Rule of Integration Computer Engineering Majors Authors: Autar Kaw, Charlie Barker
Autar Kaw Benjamin Rigsby Transforming Numerical Methods Education for STEM Undergraduates.
Autar Kaw Benjamin Rigsby Transforming Numerical Methods Education for STEM Undergraduates.
6/13/ Secant Method Computer Engineering Majors Authors: Autar Kaw, Jai Paul
6/13/ Linear Regression Civil Engineering Majors Authors: Autar Kaw, Luke Snyder
Numerical Methods. Introduction Prof. S. M. Lutful Kabir, BRAC University2  One of the most popular techniques for solving simultaneous linear equations.
Numerical Methods. Prof. S. M. Lutful Kabir, BRAC University2  One of the most popular techniques for solving simultaneous linear equations is the Gaussian.
Newton-Raphson Method
Simultaneous Linear Equations
Gaussian Elimination.
Gauss Quadrature Rule of Integration
Differentiation-Discrete Functions
Naïve Gauss Elimination Pitfalls
Autar Kaw Benjamin Rigsby
Mechanical Engineering Majors Authors: Autar Kaw, Charlie Barker
Direct Method of Interpolation
Chemical Engineering Majors Authors: Autar Kaw
Civil Engineering Majors Authors: Autar Kaw, Charlie Barker
Trapezoidal Rule of Integration
Simultaneous Linear Equations
Lagrangian Interpolation
Major: All Engineering Majors Author(s): Autar Kaw
Gauss Quadrature Rule of Integration
Direct Method of Interpolation
Lagrangian Interpolation
Simpson’s 1/3rd Rule of Integration
Simultaneous Linear Equations
Simpson’s 1/3rd Rule of Integration
Simpson’s 1/3rd Rule of Integration
Mechanical Engineering Majors Authors: Autar Kaw, Luke Snyder
Major: All Engineering Majors Authors: Autar Kaw
Electrical Engineering Majors Authors: Autar Kaw, Charlie Barker
Mechanical Engineering Majors Authors: Autar Kaw, Jai Paul
Simultaneous Linear Equations Gaussian Elimination with Partial Pivoting
Chemical Engineering Majors Authors: Autar Kaw, Charlie Barker
Naïve Gauss Elimination Pitfalls
Presentation transcript:

Gaussian Elimination Mechanical Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for STEM Undergraduates

Naïve Gauss Elimination

Naïve Gaussian Elimination A method to solve simultaneous linear equations of the form [A][X]=[C] Two steps 1. Forward Elimination 2. Back Substitution

Forward Elimination The goal of forward elimination is to transform the coefficient matrix into an upper triangular matrix

Forward Elimination A set of n equations and n unknowns.. (n-1) steps of forward elimination

Forward Elimination Step 1 For Equation 2, divide Equation 1 by and multiply by.

Forward Elimination Subtract the result from Equation 2. − _________________________________________________ or

Forward Elimination Repeat this procedure for the remaining equations to reduce the set of equations as... End of Step 1

Step 2 Repeat the same procedure for the 3 rd term of Equation 3. Forward Elimination.. End of Step 2

Forward Elimination At the end of (n-1) Forward Elimination steps, the system of equations will look like.. End of Step (n-1)

Matrix Form at End of Forward Elimination

Back Substitution Solve each equation starting from the last equation Example of a system of 3 equations

Back Substitution Starting Eqns..

Back Substitution Start with the last equation because it has only one unknown

Back Substitution

THE END

Naïve Gauss Elimination Example

Example: Thermal Coefficient A trunnion of diameter ” has to be cooled from a room temperature of 80°F before it is shrink fit into a steel hub. The equation that gives the diametric contraction, ΔD, of the trunnion in dry-ice/alcohol mixture (boiling temperature is −108°F) is given by: Figure 1 Trunnion to be slid through the hub after contracting.

Example: Thermal Coefficient The expression for the thermal expansion coefficient, is obtained using regression analysis and hence solving the following simultaneous linear equations: Find the values of using Naïve Gauss Elimination.

Example: Thermal Coefficient Forward Elimination: Step 1 Yields

Example: Thermal Coefficient Yields Forward Elimination: Step 1

Example: Thermal Coefficient Yields This is now ready for Back Substitution Forward Elimination: Step 2

Example: Thermal Coefficient Back Substitution: Solve for a 3 using the third equation

Example: Thermal Coefficient Back Substitution: Solve for a 2 using the second equation

Example: Thermal Coefficient Back Substitution: Solve for a 1 using the first equation

Example: Thermal Coefficient Solution: The solution vector is The polynomial that passes through the three data points is then:

THE END

Naïve Gauss Elimination Pitfalls

Pitfall#1. Division by zero

Is division by zero an issue here?

Is division by zero an issue here? YES Division by zero is a possibility at any step of forward elimination

Pitfall#2. Large Round-off Errors Exact Solution

Pitfall#2. Large Round-off Errors Solve it on a computer using 6 significant digits with chopping

Pitfall#2. Large Round-off Errors Solve it on a computer using 5 significant digits with chopping Is there a way to reduce the round off error?

Avoiding Pitfalls Increase the number of significant digits Decreases round-off error Does not avoid division by zero

Avoiding Pitfalls Gaussian Elimination with Partial Pivoting Avoids division by zero Reduces round off error

THE END

Gauss Elimination with Partial Pivoting

Pitfalls of Naïve Gauss Elimination Possible division by zero Large round-off errors

Avoiding Pitfalls Increase the number of significant digits Decreases round-off error Does not avoid division by zero

Avoiding Pitfalls Gaussian Elimination with Partial Pivoting Avoids division by zero Reduces round off error

What is Different About Partial Pivoting? At the beginning of the k th step of forward elimination, find the maximum of If the maximum of the values is in the p th row,then switch rows p and k.

Matrix Form at Beginning of 2 nd Step of Forward Elimination

Example (2 nd step of FE) Which two rows would you switch?

Example (2 nd step of FE) Switched Rows

Gaussian Elimination with Partial Pivoting A method to solve simultaneous linear equations of the form [A][X]=[C] Two steps 1. Forward Elimination 2. Back Substitution

Forward Elimination Same as naïve Gauss elimination method except that we switch rows before each of the (n-1) steps of forward elimination.

Example: Matrix Form at Beginning of 2 nd Step of Forward Elimination

Matrix Form at End of Forward Elimination

Back Substitution Starting Eqns..

Back Substitution

THE END

Gauss Elimination with Partial Pivoting Example

Example 2 Solve the following set of equations by Gaussian elimination with partial pivoting

Example 2 Cont. 1.Forward Elimination 2.Back Substitution

Forward Elimination

Number of Steps of Forward Elimination Number of steps of forward elimination is ( n  1 )=(3  1)=2

Forward Elimination: Step 1 Examine absolute values of first column, first row and below. Largest absolute value is 144 and exists in row 3. Switch row 1 and row 3.

Forward Elimination: Step 1 (cont.). Divide Equation 1 by 144 and multiply it by 64,. Subtract the result from Equation 2 Substitute new equation for Equation 2

Forward Elimination: Step 1 (cont.). Divide Equation 1 by 144 and multiply it by 25,. Subtract the result from Equation 3 Substitute new equation for Equation 3

Forward Elimination: Step 2 Examine absolute values of second column, second row and below. Largest absolute value is and exists in row 3. Switch row 2 and row 3.

Forward Elimination: Step 2 (cont.). Divide Equation 2 by and multiply it by 2.667, Subtract the result from Equation 3 Substitute new equation for Equation 3

Back Substitution

Solving for a 3

Back Substitution (cont.) Solving for a 2

Back Substitution (cont.) Solving for a 1

Gaussian Elimination with Partial Pivoting Solution

Gauss Elimination with Partial Pivoting Another Example

Partial Pivoting: Example Consider the system of equations In matrix form = Solve using Gaussian Elimination with Partial Pivoting using five significant digits with chopping

Partial Pivoting: Example Forward Elimination: Step 1 Examining the values of the first column |10|, |-3|, and |5| or 10, 3, and 5 The largest absolute value is 10, which means, to follow the rules of Partial Pivoting, we switch row1 with row1. Performing Forward Elimination

Partial Pivoting: Example Forward Elimination: Step 2 Examining the values of the first column |-0.001| and |2.5| or and 2.5 The largest absolute value is 2.5, so row 2 is switched with row 3 Performing the row swap

Partial Pivoting: Example Forward Elimination: Step 2 Performing the Forward Elimination results in:

Partial Pivoting: Example Back Substitution Solving the equations through back substitution

Partial Pivoting: Example Compare the calculated and exact solution The fact that they are equal is coincidence, but it does illustrate the advantage of Partial Pivoting

THE END

Determinant of a Square Matrix Using Naïve Gauss Elimination Example

Theorem of Determinants If a multiple of one row of [A] n x n is added or subtracted to another row of [A] n x n to result in [B] n x n then det(A)=det(B)

Theorem of Determinants The determinant of an upper triangular matrix [A] n x n is given by

Forward Elimination of a Square Matrix Using forward elimination to transform [A] n x n to an upper triangular matrix, [U] n x n.

Example Using naïve Gaussian elimination find the determinant of the following square matrix.

Forward Elimination

Forward Elimination: Step 1. Divide Equation 1 by 25 and multiply it by 64,. Subtract the result from Equation 2 Substitute new equation for Equation 2

Forward Elimination: Step 1 (cont.). Divide Equation 1 by 25 and multiply it by 144,. Subtract the result from Equation 3 Substitute new equation for Equation 3

Forward Elimination: Step 2. Divide Equation 2 by −4.8 and multiply it by −16.8,. Subtract the result from Equation 3 Substitute new equation for Equation 3

Finding the Determinant. After forward elimination

Summary -Forward Elimination -Back Substitution -Pitfalls -Improvements -Partial Pivoting -Determinant of a Matrix

Additional Resources For all resources on this topic such as digital audiovisual lectures, primers, textbook chapters, multiple-choice tests, worksheets in MATLAB, MATHEMATICA, MathCad and MAPLE, blogs, related physical problems, please visit nation.html

THE END