3/6/2016 1 Gauss-Siedel Method Major: All Engineering Majors Author: دکتر ابوالفضل رنجبر نوعی

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.
Civil Engineering Majors Author(s): Autar Kaw, Jai Paul
Simultaneous Linear Equations
Major: All Engineering Majors Authors: Autar Kaw
1 Direct Method of Interpolation Electrical Engineering Majors Authors: Autar Kaw, Jai Paul
Major: All Engineering Majors Author(s): Autar Kaw
7/2/ Backward Divided Difference Major: All Engineering Majors Authors: Autar Kaw, Sri Harsha Garapati
8/8/ Euler Method Major: All Engineering Majors Authors: Autar Kaw, Charlie Barker
8/8/ Gauss Quadrature Rule of Integration Major: All Engineering Majors Authors: Autar Kaw, Charlie Barker
8/15/ Differentiation-Continuous Functions Major: All Engineering Majors Authors: Autar Kaw, Sri Harsha Garapati.
Major: All Engineering Majors Author(s): Autar Kaw
8/30/ Secant Method Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
Computer Engineering Majors Authors: Autar Kaw
9/7/ Gauss-Siedel Method Chemical Engineering Majors Authors: Autar Kaw Transforming.
Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul Transforming Numerical Methods Education.
Newton-Raphson Method
9/20/ Secant Method Civil Engineering Majors Authors: Autar Kaw, Jai Paul
10/8/ Propagation of Errors Major: All Engineering Majors Authors: Autar Kaw, Matthew Emmons
10/17/ Gauss-Siedel Method Industrial Engineering Majors Authors: Autar Kaw
Chapter 3 Solution of Algebraic Equations 1 ChE 401: Computational Techniques for Chemical Engineers Fall 2009/2010 DRAFT SLIDES.
Chemical Engineering Majors Author(s): Autar Kaw
1 Lagrangian Interpolation Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
10/21/ Bisection Method Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
Newton-Raphson Method Chemical Engineering Majors Authors: Autar Kaw, Jai Paul Transforming Numerical Methods Education.
10/26/ Gauss-Siedel Method Civil Engineering Majors Authors: Autar Kaw Transforming.
10/27/ Differentiation-Continuous Functions Computer Engineering Majors Authors: Autar Kaw, Sri Harsha Garapati.
11/17/ Shooting Method Major: All Engineering Majors Authors: Autar Kaw, Charlie Barker
11/30/ Secant Method Industrial Engineering Majors Authors: Autar Kaw, Jai Paul
Gaussian Elimination Electrical Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for.
Linear Systems – Iterative methods
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.
Gaussian Elimination Mechanical Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for.
1/18/ LU Decomposition Industrial Engineering Majors Authors: Autar Kaw Transforming.
1/29/ Bisection Method Computer Engineering Majors Authors: Autar Kaw, Jai Paul
2/2/ Secant Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul
Newton-Raphson Method Computer Engineering Majors Authors: Autar Kaw, Jai Paul Transforming Numerical Methods Education.
Mechanical Engineering Majors Authors: Autar Kaw
2/26/ Gauss-Siedel Method Electrical Engineering Majors Authors: Autar Kaw
Linear Systems Numerical Methods. 2 Jacobi Iterative Method Choose an initial guess (i.e. all zeros) and Iterate until the equality is satisfied. No guarantee.
3/1/ LU Decomposition Computer Engineering Majors Authors: Autar Kaw Transforming.
Gaussian Elimination Civil Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for STEM.
3/7/ Bisection Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul
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
Newton-Raphson Method
Newton-Raphson Method
Gauss-Siedel Method.
Differentiation-Continuous Functions
Differentiation-Discrete Functions
Autar Kaw Benjamin Rigsby
Spline Interpolation Method
Secant Method – Derivation
Chemical Engineering Majors Authors: Autar Kaw, Jai Paul
Chemical Engineering Majors Authors: Autar Kaw
Civil Engineering Majors Authors: Autar Kaw, Charlie Barker
Newton-Raphson Method
Bisection Method.
Newton-Raphson Method
Chemical Engineering Majors Authors: Autar Kaw, Jai Paul
Major: All Engineering Majors Authors: Autar Kaw
Electrical Engineering Majors Authors: Autar Kaw, Charlie Barker
Newton-Raphson Method
Mechanical Engineering Majors Authors: Autar Kaw, Jai Paul
Chemical Engineering Majors Authors: Autar Kaw, Charlie Barker
Industrial Engineering Majors Authors: Autar Kaw, Jai Paul
Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
Lagrangian Interpolation
Presentation transcript:

3/6/ Gauss-Siedel Method Major: All Engineering Majors Author: دکتر ابوالفضل رنجبر نوعی Transforming Numerical Methods Education for STEM Undergraduates

Gauss-Seidel Method

Gauss-Seidel Method An iterative method. Basic Procedure : -Algebraically solve each linear equation for x i -Assume an initial guess solution array -Solve for each x i and repeat -Use absolute relative approximate error after each iteration to check if error is within a pre-specified tolerance.

Gauss-Seidel Method Why? The Gauss-Seidel Method allows the user to control round-off error. Elimination methods such as Gaussian Elimination and LU Decomposition are prone to prone to round-off error. Also: If the physics of the problem are understood, a close initial guess can be made, decreasing the number of iterations needed.

Gauss-Seidel Method Algorithm A set of n equations and n unknowns:.. If: the diagonal elements are non-zero Rewrite each equation solving for the corresponding unknown ex: First equation, solve for x 1 Second equation, solve for x 2

Gauss-Seidel Method Algorithm Rewriting each equation From Equation 1 From equation 2 From equation n-1 From equation n

Gauss-Seidel Method Algorithm General Form of each equation

Gauss-Seidel Method Algorithm General Form for any row ‘i’ How or where can this equation be used?

Gauss-Seidel Method Solve for the unknowns Assume an initial guess for [X] Use rewritten equations to solve for each value of x i. Important: Remember to use the most recent value of x i. Which means to apply values calculated to the calculations remaining in the current iteration.

Gauss-Seidel Method Calculate the Absolute Relative Approximate Error So when has the answer been found? The iterations are stopped when the absolute relative approximate error is less than a prespecified tolerance for all unknowns.

Gauss-Seidel Method: Example 1 The upward velocity of a rocket is given at three different times Time,Velocity The velocity data is approximated by a polynomial as: Table 1 Velocity vs. Time data.

Gauss-Seidel Method: Example 1 Using a Matrix template of the form The system of equations becomes Initial Guess: Assume an initial guess of

Gauss-Seidel Method: Example 1 Rewriting each equation

Gauss-Seidel Method: Example 1 Applying the initial guess and solving for a i Initial Guess When solving for a 2, how many of the initial guess values were used?

Gauss-Seidel Method: Example 1 Finding the absolute relative approximate error At the end of the first iteration The maximum absolute relative approximate error is %

Gauss-Seidel Method: Example 1 Iteration #2 Using from iteration #1 the values of a i are found:

Gauss-Seidel Method: Example 1 Finding the absolute relative approximate error At the end of the second iteration The maximum absolute relative approximate error is %

Iteration a1a1 a2a2 a3a − − − − − − − − − −14440 −60072 − Gauss-Seidel Method: Example 1 Repeating more iterations, the following values are obtained Notice – The relative errors are not decreasing at any significant rate Also, the solution is not converging to the true solution of

Gauss-Seidel Method: Pitfall What went wrong? Even though done correctly, the answer is not converging to the correct answer This example illustrates a pitfall of the Gauss-Siedel method: not all systems of equations will converge. Is there a fix? One class of system of equations always converges: One with a diagonally dominant coefficient matrix. Diagonally dominant: [A] in [A] [X] = [C] is diagonally dominant if: for all ‘i’ and for at least one ‘i’

Gauss-Seidel Method: Pitfall Diagonally dominant : The coefficient on the diagonal must be at least equal to the sum of the other coefficients in that row and at least one row with a diagonal coefficient greater than the sum of the other coefficients in that row. Which coefficient matrix is diagonally dominant? Most physical systems do result in simultaneous linear equations that have diagonally dominant coefficient matrices.

Gauss-Seidel Method: Example 2 Given the system of equations With an initial guess of The coefficient matrix is: Will the solution converge using the Gauss-Siedel method?

Gauss-Seidel Method: Example 2 Checking if the coefficient matrix is diagonally dominant The inequalities are all true and at least one row is strictly greater than: Therefore: The solution should converge using the Gauss-Siedel Method

Gauss-Seidel Method: Example 2 Rewriting each equationWith an initial guess of

Gauss-Seidel Method: Example 2 The absolute relative approximate error The maximum absolute relative error after the first iteration is 100%

Gauss-Seidel Method: Example 2 After Iteration #1 Substituting the x values into the equations After Iteration #2

Gauss-Seidel Method: Example 2 Iteration #2 absolute relative approximate error The maximum absolute relative error after the first iteration is % This is much larger than the maximum absolute relative error obtained in iteration #1. Is this a problem?

Iterationa1a1 a2a2 a3a Gauss-Seidel Method: Example 2 Repeating more iterations, the following values are obtained The solution obtained is close to the exact solution of.

Gauss-Seidel Method: Example 3 Given the system of equations With an initial guess of Rewriting the equations

Iterationa1a1 A2A2 a3a − − − ×10 5 −2.0579× − − × − − ×10 5 −4.8653× Gauss-Seidel Method: Example 3 Conducting six iterations, the following values are obtained The values are not converging. Does this mean that the Gauss-Seidel method cannot be used?

Gauss-Seidel Method The Gauss-Seidel Method can still be used The coefficient matrix is not diagonally dominant But this is the same set of equations used in example #2, which did converge. If a system of linear equations is not diagonally dominant, check to see if rearranging the equations can form a diagonally dominant matrix.

Gauss-Seidel Method Not every system of equations can be rearranged to have a diagonally dominant coefficient matrix. Observe the set of equations Which equation(s) prevents this set of equation from having a diagonally dominant coefficient matrix?

Gauss-Seidel Method Summary -Advantages of the Gauss-Seidel Method -Algorithm for the Gauss-Seidel Method -Pitfalls of the Gauss-Seidel Method

Gauss-Seidel Method Questions?

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 el.html

THE END