Lecture 4: Numerical Methods

Slides:



Advertisements
Similar presentations
Lecture 5 Newton-Raphson Method
Advertisements

CSE 330: Numerical Methods
Roots of Equations Our first real numerical method – Root finding
ROOTS OF EQUATIONS Student Notes ENGR 351 Numerical Methods for Engineers Southern Illinois University Carbondale College of Engineering Dr. L.R. Chevalier.
Regula-Falsi Method. Type of Algorithm (Equation Solver) The Regula-Falsi Method (sometimes called the False Position Method) is a method used to find.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 7 Roots of Equations Bracketing Methods.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 51.
Roots of Equations Open Methods (Part 2).
Second Term 05/061 Roots of Equations Bracketing Methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 6 Roots of Equations Bracketing Methods.
Roots of Equations Bracketing Methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 19 Solution of Linear System of Equations - Iterative Methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 9 Roots of Equations Open Methods.
Curve Fitting and Interpolation: Lecture (II)
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.
NUMERICAL METHODS WITH C++ PROGRAMMING
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 8 Roots of Equations Open Methods.
EXAMPLE 2 Find all zeros of f (x) = x 5 – 4x 4 + 4x x 2 – 13x – 14. SOLUTION STEP 1 Find the rational zeros of f. Because f is a polynomial function.
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
Introduction This chapter gives you several methods which can be used to solve complicated equations to given levels of accuracy These are similar to.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Numerical Methods Applications of Loops: The power of MATLAB Mathematics + Coding 1.
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
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.
ME 142 Engineering Computation I Root Finding & Iterative Solutions.
Solving Non-Linear Equations (Root Finding)
Today’s class Numerical differentiation Roots of equation Bracketing methods Numerical Methods, Lecture 4 1 Prof. Jinbo Bi CSE, UConn.
4 Numerical Methods Root Finding Secant Method Modified Secant
Linearization, Newton’s Method
SOLVING NONLINEAR EQUATIONS. SECANT METHOD MATH-415 Numerical Analysis 1.
Polynomial and Synthetic Division. What you should learn How to use long division to divide polynomials by other polynomials How to use synthetic division.
Quadratic Formula Finding solutions to quadratic equations can be done in two ways : 1. Factoring – it’s a short cut. Use it if you can 2. Using the Quadratic.
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.
Numerical Methods and Optimization C o u r s e 1 By Bharat R Chaudhari.
Solution of Nonlinear Equations ( Root Finding Problems ) Definitions Classification of Methods  Analytical Solutions  Graphical Methods  Numerical.
7/11/ Bisection Method Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
Answers for Review Questions for Lectures 1-4. Review Lectures 1-4 Problems Question 2. Derive a closed form for the estimate of the solution of the equation.
CSE 330: Numerical Methods. Introduction The bisection and false position method require bracketing of the root by two guesses Such methods are called.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 / Chapter 5.
Solution of Nonlinear Equations ( Root Finding Problems )
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
4 Numerical Methods Root Finding Secant Method Modified Secant
Numerical Analysis Lecture 5.
Bracketing Methods (Bisection Method)
Newton’s Method for Systems of Non Linear Equations
~ Roots of Equations ~ Bracketing Methods Chapter 5
Read Chapters 5 and 6 of the textbook
Chemical Engineering Majors Authors: Autar Kaw, Jai Paul
MATH 2140 Numerical Methods
Part 2 / Chapter 5.
Numerical Analysis Lecture 7.
Numerical Analysis Lecture 45.
Chapter 1: False-Position Method of Solving a Nonlinear Equation
Computers in Civil Engineering 53:081 Spring 2003
Bisection Method.
MATH 175: Numerical Analysis II
Roots: Bracketing Methods
ROOTS OF EQUATIONS.
Mechanical Engineering Majors Authors: Autar Kaw, Jai Paul
Roots: Bracketing Methods
Industrial Engineering Majors Authors: Autar Kaw, Jai Paul
ME 142 Engineering Computation I
Interpolation with unequal intervals
Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
Presentation transcript:

Lecture 4: Numerical Methods False Position (Regula Falsi)

Review of Bisection Method At bisection method, the new position of the estimated root is determined at the middle of the given interval. The interval is divided into two parts and the parts are evaluated to determined where the root is located by checking the change of function signs. Only the interval containing the next root is considered and it is then divided into two to get the estimated root in the middle The outlined step is repeated until the interval is small enough and the consecutive results have no different more then the prescribed tolerance

y Bisection Method f(x) The estimated root + + - - + x

False Position Method The given interval is divided into two parts But the division point is calculated using congruent triangle formula, The new intervals may not be the same The calculation involves the lower and upper limits as well as the function value of the lower and upper limits The checking of the parts is still required to determine where the root exist

f(x) y f(xu) xl x xu f(xl) False Position Method It uses linear interpolation equation. f(xu) The new root position is estimated using the following equation. Note: A check for sign change is still required to determine where the interval that contain the root The estimated root (xr) xl x xu f(xl)

Example Problem A root of f(x) = 3x – 2 e 0.5 x is known to exist between x = 1 and x = 2. Calculate the guessed location of the root using false position method. Answer: Given xl = 1 and xu = 2, therefore: 1st Iteration f(xl ) = 3 – 2 e 0.5 = -0.2974 and f(xu ) = 3*2 – 2 e 0.5 *2= 0.5634 And and f(xr ) = 0.1173

Since f(xl). f(xr)< 0, the new interval is xl =1 and xu = 1 Since f(xl)*f(xr)< 0, the new interval is xl =1 and xu = 1.3455 2nd Iteration It is obtain from the 1st iteration that xl =1 and xu = 1.3455 f(xl ) = -0.2974 and f(xu ) = 0.1173, therefore: f(xr ) = 0.0110 Since f(xl)*f(xr)< 0, the new interval is xl =1 and xu = 1.2478 3rd Iteration It is obtain from the 1st iteration that xl =1 and xu = 1.2478 f(xl ) = -0.2974 and f(xu ) = 0.0110, therefore: and f(xr ) = 9.4635 x 10-4

The complete result for 10 iteration F(xl) F(xu) xroot f(xroot) 1 -0.29744 0.56344 1.34551 0.11727 2 1.247807 0.01102 3 1.238951 0.00095 4 1.238193 0.00008 5 1.238129 0.00001 6 1.238123 0.00000 7 8 9 10

Comparison with Bisection Iteration   Root Convergence False Position Bisection 1 1.345510323 1.5 0.11727 0.26600 2 1.247807131 1.25 0.01102 0.01351 3 1.238950941 1.125 0.00095 -0.13511 4 1.238193098 1.1875 0.00008 -0.05903 5 1.238128575 1.21875 0.00001 -0.02231 6 1.238123084 1.234375 0.00000 -0.00429 7 1.238122617 1.242188 0.00464 8 1.238122577 1.238281 0.00018 9 1.238122574 1.236328 -0.00205 10 1.238122573 1.237305 -0.00094

Comparison with Bisection

Assignment A root is known to exist between x = 0 and x = 1 for the function f(x) = x3 – 4.5 x2 + 5.75 x – 1.875 = 0. Find out the root using Bisection Method for the tolerance of 0. 001. A root is known to exist between x = 1 and x = 3 for the function f(x) = 3 x3 + 2 x2 - x – 30 = 0. Find out the root using False Position Method for the tolerance of 0. 001.

Thank you