Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3- Chapter 12 Iterative Methods.

Slides:



Advertisements
Similar presentations
Numerical Solution of Linear Equations
Advertisements

Part 2 Chapter 6 Roots: Open Methods
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 One-Dimensional Unconstrained Optimization Chapter.
Linear Systems of Equations
Rayan Alsemmeri Amseena Mansoor. LINEAR SYSTEMS Jacobi method is used to solve linear systems of the form Ax=b, where A is the square and invertible.
Numerical Algorithms Matrix multiplication
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 61.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 51.
Special Matrices and Gauss-Siedel
1 Systems of Linear Equations Iterative Methods. 2 B. Iterative Methods 1.Jacobi method and Gauss Seidel 2.Relaxation method for iterative methods.
1 Systems of Linear Equations Iterative Methods. 2 B. Direct Methods 1.Jacobi method and Gauss Seidel 2.Relaxation method for iterative methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 20 Solution of Linear System of Equations - Iterative Methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 19 Solution of Linear System of Equations - Iterative Methods.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Martin Mendez UASLP Chapter 61 Unit II.
Special Matrices and Gauss-Siedel
Systems of Non-Linear Equations
Copyright © The McGraw-Hill Companies, Inc
Partial differential equations Function depends on two or more independent variables This is a very simple one - there are many more complicated ones.
Iterative Methods for Solving Linear Systems of Equations ( part of the course given for the 2 nd grade at BGU, ME )
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 171 Least.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Part 31 Chapter.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 2 Image Slides.
Chapter 8 Traffic-Analysis Techniques. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 8-1.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Linear Algebraic Equations ~ Gauss Elimination Chapter.
Chapter 8 Objectives Understanding matrix notation.
ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 Roots of Equations Why? But.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Part 31 Linear.
Iterative Methods for Solving Linear Systems Leo Magallon & Morgan Ulloa.
Chapter 6 Finding the Roots of Equations
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 111.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 11.
10/17/ Gauss-Siedel Method Industrial Engineering Majors Authors: Autar Kaw
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Roots of Equations ~ Open Methods Chapter 6 Credit:
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 Chapter 7.
Boundary-Value Problems Boundary-value problems are those where conditions are not known at a single point but rather are given at different values of.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3 - Chapter 9 Linear Systems of Equations: Gauss Elimination.
Linear Systems – Iterative methods
Newton’s Method, Root Finding with MATLAB and Excel
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 4 Chapter 15 General Least Squares and Non- Linear.
Part 3 Chapter 12 Iterative Methods
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.
Special Matrices Banded matrices Solutions to problems that depend on their neighbours eg 1D T i = f(T i-1,T i+1 ) 2D T i,j = f(T i-1,j,T i+1,j,T i,j -1,T.
3/6/ Gauss-Siedel Method Major: All Engineering Majors Author: دکتر ابوالفضل رنجبر نوعی
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter Fifteen Approximate Analysis of Indeterminate Structures.
Chapter 13 Transportation Demand Analysis. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display
Copyright © 2014, The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Copyright © 2014, The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.
1 Gauss-Seidel Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis Applied Numerical Method for Engineers Chapter 11.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3 - Chapter 9.
Part 3 Chapter 12 Iterative Methods
Solving Systems of Linear Equations: Iterative Methods
Gauss-Siedel Method.
Numerical Analysis Lecture12.
Iterative Methods Good for sparse matrices Jacobi Iteration
Autar Kaw Benjamin Rigsby
Metode Eliminasi Pertemuan – 4, 5, 6 Mata Kuliah : Analisis Numerik
Matrix Solutions to Linear Systems
Applied Numerical Methods
Numerical Analysis Lecture13.
Numerical Analysis Lecture10.
Engineering Analysis ENG 3420 Fall 2009
Chapter 11 Chapter 11.
Numerical Analysis Lecture11.
Linear Algebra Lecture 16.
Pivoting, Perturbation Analysis, Scaling and Equilibration
Presentation transcript:

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3- Chapter 12 Iterative Methods

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2 Iterative Methods Iterative or approximate methods provide an alternative to the elimination methods – like Gaussian Elimination (Chapter 9). The Gauss-Seidel method is the most commonly used iterative method for linear systems

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Gauss - Seidel The system [A]{X}={B} is reshaped by solving the first equation for x 1, the second equation for x 2, and the third for x 3, …and n th equation for x n. 3

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4 Next, choose guesses for the x’s. (A simple way to obtain initial guesses is to assume that they are zero.) Substitute the guesses into the x 1 equation to calculate a new x 1. (If we choose zeros for our guesses x 1 =b 1 /a 11 )

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5 New x 1 is substituted to calculate x 2 …. The updated x 1 and x 2 are used to calculate x 3 The procedure is repeated until the convergence criterion is satisfied for each x For all i, where j and j-1 are the present and previous iterations.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Gauss Seidel Jacobi

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 7

8

Reformulate 9

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 10

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 11 Gauss-Seidel Left-Division

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Convergence and diagonal dominance The Gauss-Seidel technique does not always converge. The following criteria is sufficient to guarantee convergence, but not necessary 12 If you meet this criteria you converge If don’t, it still might converge

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 13 The absolute value of the numbers on the diagonal should be bigger than the sum of the absolute value of the other numbers on the same row.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Consider the system of equations from Example The big numbers go on the diagonal

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Relaxation A weighting factor can enhance the rate of convergence 15 λ=0 to 2 λ=0 to 1 underrelaxation λ=1 to 2 overrelaxation Used to make a nonconvergent system converge Used to make a slowly converging system converge more quickly

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 16

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Example 12.2 with Relaxation 17 Is not diagonally dominant

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 18 Result from Gauss Seidel Result from Left Division

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 19 diagonally dominant

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 20 Result from Gauss Seidel Result from Left Division

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Non-linear systems We can approach non-linear systems in a very similar manner Successive Substitution 21

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Example 12.3 Use successive substitution to solve the following set of non-linear simultaneous equations. 22

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Solve for x’s 23 It turns out that for initial guesses of 1.5 and 3.5 this technique diverges If you set it up differently, you can get it to converge This technique is so tempermental that it has limited utility

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 24

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 25

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 26

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. An alternative is to use a variation on the Newton Raphson technique Uses partial differential equations We do not have time to cover this approach 27