Case Study #1 Finding Roots of Equations ~ CE402 Numerical Methods for Engineers Dr. Fritz Fiedler ~ Andy Abrams David Crosby Zack Munstermann.

Slides:



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

Chapter 6: Roots: Open Methods
Lecture 5 Newton-Raphson Method
Numerical Solution of Nonlinear Equations
CSE 330: Numerical Methods
Roots of Equations Our first real numerical method – Root finding
Open Methods Chapter 6 The Islamic University of Gaza
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
Nonlinear Equations Your nonlinearity confuses me “The problem of not knowing what we missed is that we believe we haven't missed anything” – Stephen Chew.
Roots of Equations Open Methods (Part 2).
Lecture #18 EEE 574 Dr. Dan Tylavsky Nonlinear Problem Solvers.
A few words about convergence We have been looking at e a as our measure of convergence A more technical means of differentiating the speed of convergence.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 6 Roots of Equations Bracketing Methods.
Propagation of error Ignoring higher order terms, the error in function, based on the uncertainty in its inputs, can be estimated by where  is the symbol.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 9 Roots of Equations Open Methods.
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.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 8 Roots of Equations Open Methods.
Roots of Equations Open Methods Second Term 05/06.
Fin500J: Mathematical Foundations in Finance Topic 3: Numerical Methods for Solving Non-linear Equations Philip H. Dybvig Reference: Numerical Methods.
8/30/ Secant Method Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
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
Chapter 6 Finding the Roots of Equations
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Roots of Equations ~ Open Methods Chapter 6 Credit:
Newton-Raphson Method Chemical Engineering Majors Authors: Autar Kaw, Jai Paul Transforming Numerical Methods Education.
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
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 Root Finding 4. Fixed-Point Iteration---- Successive Approximation Many problems also take on the specialized form: g(x)=x, where we.
Newton’s Method, Root Finding with MATLAB and Excel
MECN 3500 Inter - Bayamon Lecture 6 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
Newton-Raphson Method. Figure 1 Geometrical illustration of the Newton-Raphson method. 2.
ROOTS OF EQUATIONS. Bracketing Methods The Bisection Method The False-Position Method Open Methods Simple Fixed-Point Iteration The Secant Method.
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.
4 Numerical Methods Root Finding Secant Method Modified Secant
SOLVING NONLINEAR EQUATIONS. SECANT METHOD MATH-415 Numerical Analysis 1.
4 Numerical Methods Root Finding.
Newton-Raphson Method Computer Engineering Majors Authors: Autar Kaw, Jai Paul Transforming Numerical Methods Education.
6/13/ Secant Method Computer Engineering Majors Authors: Autar Kaw, Jai Paul
Project on Newton’s Iteration Method Presented by Dol Nath Khanal Project Advisor- Professor Dexuan Xie 05/11/2015.
CSE 330: Numerical Methods. What is true error? True error is the difference between the true value (also called the exact value) and the approximate.
Solution of Nonlinear Equations ( Root Finding Problems ) Definitions Classification of Methods  Analytical Solutions  Graphical Methods  Numerical.
CSE 330: Numerical Methods. Introduction The bisection and false position method require bracketing of the root by two guesses Such methods are called.
Solution of Nonlinear Equations ( Root Finding Problems )
Chapter 5 Numerical Root Findings
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Newton-Raphson Method
4 Numerical Methods Root Finding Secant Method Modified Secant
Newton-Raphson Method
Bracketing Methods (Bisection Method)
Secant Method.
Newton’s Method for Systems of Non Linear Equations
Secant Method – Derivation
Newton-Raphson Method
Computers in Civil Engineering 53:081 Spring 2003
Bisection Method.
Newton-Raphson Method
Find: V [ft/s] xL xR b b=5 [ft] xL=3 xR=3 ft3 s
Roots: Bracketing Methods
ROOTS OF EQUATIONS.
3.8 Newton’s Method How do you find a root of the following function without a graphing calculator? This is what Newton did.
Newton’s Method and Its Extensions
Newton-Raphson Method
Roots: Bracketing Methods
MATH 1910 Chapter 3 Section 8 Newton’s Method.
Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
Presentation transcript:

Case Study #1 Finding Roots of Equations ~ CE402 Numerical Methods for Engineers Dr. Fritz Fiedler ~ Andy Abrams David Crosby Zack Munstermann

Introduction Why find roots of equations? Why find roots of equations? Equations are used to model physical systems Equations are used to model physical systems Knowing the roots of these equations helps us understand the physical system Knowing the roots of these equations helps us understand the physical system How do we find the roots? How do we find the roots? Analytically Analytically Numerically Numerically

Graphing Graphing the equation over a useful range can identify several points of interest Graphing the equation over a useful range can identify several points of interest Rough estimate of the roots Rough estimate of the roots Continuity Continuity Local minima and maxima Local minima and maxima Graphing is simple, yet rough Graphing is simple, yet rough It is often used to define functions for initial guesses in other methods. It is often used to define functions for initial guesses in other methods.

Bisection Method The bisection method is a “bracketing method” The bisection method is a “bracketing method” Initial guesses must surround the root. Initial guesses must surround the root. Function must be continuous near the root Function must be continuous near the root Bracketing values Xu and Xl are chosen Bracketing values Xu and Xl are chosen New root estimated by Xr = (Xl + Xu)/2 New root estimated by Xr = (Xl + Xu)/2 If f(Xr)f(Xl) < 0 then Xr = Xu…continue… If f(Xr)f(Xl) < 0 then Xr = Xu…continue… If f(Xr)f(Xl) > 0 then Xr = Xl…continue… If f(Xr)f(Xl) > 0 then Xr = Xl…continue…

Bisection Method: continued Bracketing values Xu and Xl are chosen Bracketing values Xu and Xl are chosen New root estimated by Xr = (Xl + Xu)/2 New root estimated by Xr = (Xl + Xu)/2 If f(Xr)f(Xl) < 0 then Xr = Xu…continue… If f(Xr)f(Xl) < 0 then Xr = Xu…continue… If f(Xr)f(Xl) > 0 then Xr = Xl…continue… If f(Xr)f(Xl) > 0 then Xr = Xl…continue… If f(Xr)f(Xl) = 0 then Xr = root…stop. If f(Xr)f(Xl) = 0 then Xr = root…stop. Limitations of the bisection method Limitations of the bisection method Relatively inefficient Relatively inefficient Must know equation well Must know equation well

Newton Raphson Method The Newton-Raphson method is an “open method” The Newton-Raphson method is an “open method” Need only one initial guess Need only one initial guess Must know derivative of function Must know derivative of function Initial guess of root Xi is chosen Initial guess of root Xi is chosen New root estimated by Xr = Xi – f(Xi)/f’(Xi) New root estimated by Xr = Xi – f(Xi)/f’(Xi) If error of Xr is acceptable, stop. If error of Xr is acceptable, stop. If error is too large, Xi = Xr…continue… If error is too large, Xi = Xr…continue…

Newton-Raphson Method: continued Constraints on N.R. Constraints on N.R. Good initial guess (convergence) Good initial guess (convergence) Derivative must be easily evaluated Derivative must be easily evaluated Derivative must be continuous and non-zero near root Derivative must be continuous and non-zero near root Problems from inflection points and local extremes near root Problems from inflection points and local extremes near root

Example To compare these methods we will consider water flowing in a rectangular open channel To compare these methods we will consider water flowing in a rectangular open channel Flow governed by Manning’s equation Flow governed by Manning’s equation Where: Q = volumetric flow rate (m3/s) B = channel width (m) B = channel width (m) H = height of water in channel (m) H = height of water in channel (m) n = Manning’s coefficient of roughness n = Manning’s coefficient of roughness R = hydraulic radius (m) R = hydraulic radius (m) S = channel slope S = channel slope

Example: continued In the design of this channel, we wish to find depth of flow and flow velocity for a range of channel widths In the design of this channel, we wish to find depth of flow and flow velocity for a range of channel widths V = Q/(BH) First we graphed the equation for a given set of parameters First we graphed the equation for a given set of parameters Used bisection and N.R. to solve for depth of flow for a range of channel widths Used bisection and N.R. to solve for depth of flow for a range of channel widths

Example: continued Graphing: S = B = 20 m n = 0.03 Q = 100 m3/s Range: 4< H < 5 Root in this case (by inspection) is approximately 4.82 m

Example: continued Bisection method: S = n = 0.03 Q = 100 m3/s Range: 5m < B < 35m

Example: continued Newton-Raphson: S = n = 0.03 Q = 100 m3/s Range: 5m < B < 35m

Conclusions Results of the two methods being relatively the same shows that they are convergent on the real solution Results of the two methods being relatively the same shows that they are convergent on the real solution Differences between the two Differences between the two N.R. much more efficient (4:1 iterations) N.R. much more efficient (4:1 iterations) N.R. more accurate in this case N.R. more accurate in this case N.R. easier to program N.R. easier to program

Questions?