Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 / Chapter 5.

Slides:



Advertisements
Similar presentations
Part 2 Chapter 6 Roots: Open Methods
Advertisements

Lecture 5 Newton-Raphson Method
Part 2 Chapter 6 Roots: Open Methods
Roots: Bracketing Methods
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 One-Dimensional Unconstrained Optimization Chapter.
Open Methods Chapter 6 The Islamic University of Gaza
ROOTS OF EQUATIONS Student Notes ENGR 351 Numerical Methods for Engineers Southern Illinois University Carbondale College of Engineering Dr. L.R. Chevalier.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 61.
Open Methods Chapter 6 The Islamic University of Gaza
Chapter 4 Roots of Equations
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 51.
Second Term 05/061 Roots of Equations Bracketing Methods.
Roots of Equations Bracketing Methods.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Martin Mendez UASLP Chapter 61 Unit II.
Open Methods Chapter 6 The Islamic University of Gaza
Dr. Marco A. Arocha Aug,  “Roots” problems occur when some function f can be written in terms of one or more dependent variables x, where the.
Bracketing Methods Chapter 5 The Islamic University of Gaza
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Linear Algebraic Equations ~ Gauss Elimination Chapter.
Solving Non-Linear Equations (Root Finding)
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 Roots of Equations Why? But.
Chapter 6 Finding the Roots of Equations
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Lecture 8 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Part 2 Chapter 5 Roots: Bracketing Methods PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Roots of Equations ~ Open Methods Chapter 6 Credit:
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 71.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 7.
Chapter 3 Roots of Equations. Objectives Understanding what roots problems are and where they occur in engineering and science Knowing how to determine.
Numerical Methods for Engineering MECN 3500
Numerical Methods.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Roots of Equations ~ Bracketing Methods Chapter 5.
Newton’s Method, Root Finding with MATLAB and Excel
Applied Numerical Methods
Today’s class Roots of equation Finish up incremental search
MECN 3500 Inter - Bayamon Lecture 6 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
4 Numerical Methods Root Finding Secant Method Modified Secant
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 5 Bracketing Methods.
Solving Non-Linear Equations (Root Finding)
Numerical Methods Solution of Equation.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Applied Numerical Methods With MATLAB ® for Engineers.
Roots: Bracketing Methods
4 Numerical Methods Root Finding Secant Method Modified Secant
SOLVING NONLINEAR EQUATIONS. SECANT METHOD MATH-415 Numerical Analysis 1.
Copyright © 2014, The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Lecture 4 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
7/11/ Bisection Method Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
CSE 330: Numerical Methods. Introduction The bisection and false position method require bracketing of the root by two guesses Such methods are called.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
4 Numerical Methods Root Finding Secant Method Modified Secant
Newton’s Method for Systems of Non Linear Equations
~ Roots of Equations ~ Bracketing Methods Chapter 5
Part 2 Chapter 6 Roots: Open Methods
Chapter 6.
Part 2 / Chapter 5.
Numerical Analysis Lecture 7.
Computers in Civil Engineering 53:081 Spring 2003
Bisection Method.
SOLUTION OF NONLINEAR EQUATIONS
Roots: Bracketing Methods
ROOTS OF EQUATIONS.
Roots: Bracketing Methods
Chapter 6.
Part 2 Chapter 6 Roots: Open Methods
Industrial Engineering Majors Authors: Autar Kaw, Jai Paul
1 Newton’s Method.
Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
Presentation transcript:

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 / Chapter 5

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2 Part 2 Roots of Equations Why? But

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3 Nonlinear Equation Solvers Bracketing Bisection False Position (Regula-Falsi ) GraphicalOpen Methods Newton Raphson Secant All Iterative

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4 Figure PT2.1

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5 Bracketing Methods (Or, two point methods for finding roots) Chapter 5 Two initial guesses for the root are required. These guesses must “bracket” or be on either side of the root. == > Fig. 5.1 If one root of a real and continuous function, f(x)=0, is bounded by values x=x l, x =x u then f(x l ). f(x u ) <0. ( The function changes sign on opposite sides of the root )

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

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

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 8 Figure 5.4a Figure 5.4b Figure 5.4c

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 9 The Bisection Method For the arbitrary equation of one variable, f(x)=0 1.Pick x l and x u such that they bound the root of interest, check if f(x l ).f(x u ) <0. 2.Estimate the root by evaluating f[(x l +x u )/2]. 3.Find the pair If f(x l ). f[(x l +x u )/2]<0, root lies in the lower interval, then x u =(x l +x u )/2 and go to step 2.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 10 If f(x l ). f[(x l +x u )/2]>0, root lies in the upper interval, then x l = [(x l +x u )/2, go to step 2. If f(x l ). f[(x l +x u )/2]=0, then root is (x l +x u )/2 and terminate. 4.Compare  s with  a 5.If  a <  s, stop. Otherwise repeat the process.

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

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 12 Evaluation of Method Pros Easy Always find root Number of iterations required to attain an absolute error can be computed a priori. Cons Slow Know a and b that bound root Multiple roots No account is taken of f(x l ) and f(x u ), if f(x l ) is closer to zero, it is likely that root is closer to x l.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 13 How Many Iterations will It Take? Length of the first IntervalL o =b-a After 1 iterationL 1 =L o /2 After 2 iterationsL 2 =L o /4 After k iterationsL k =L o /2 k

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 14 If the absolute magnitude of the error is and L o =2, how many iterations will you have to do to get the required accuracy in the solution?

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 15 The False-Position Method (Regula-Falsi) If a real root is bounded by x l and x u of f(x)=0, then we can approximate the solution by doing a linear interpolation between the points [x l, f(x l )] and [x u, f(x u )] to find the x r value such that l(x r )=0, l(x) is the linear approximation of f(x). == > Fig. 5.12

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 16 Procedure 1.Find a pair of values of x, x l and x u such that f l =f(x l ) 0. 2.Estimate the value of the root from the following formula (Refer to Box 5.1) and evaluate f(x r ).

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Use the new point to replace one of the original points, keeping the two points on opposite sides of the x axis. If f(x r ) f l =f(x r ) If f(x r )>0 then x u =x r == > f u =f(x r ) If f(x r )=0 then you have found the root and need go no further!

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display See if the new x l and x u are close enough for convergence to be declared. If they are not go back to step 2. Why this method? –Faster –Always converges for a single root.  See Sec.5.3.1, Pitfalls of the False-Position Method Note: Always check by substituting estimated root in the original equation to determine whether f(x r ) ≈ 0.