Numerical Calculation Part 1: Equations &Roots Dr.Entesar Ganash (Bisection's Method)

Slides:



Advertisements
Similar presentations
By: Nahdir Austin Honors Physics Period 2
Advertisements

What is Projectile Motion?
CSE 330: Numerical Methods
Regula-Falsi Method. Type of Algorithm (Equation Solver) The Regula-Falsi Method (sometimes called the False Position Method) is a method used to find.
Bisection Method (Midpoint Method for Equations).
Projectile Motion Problems
Root-Finding Algorithm Bisection method Suppose we want to solve the equation f(x) = 0. Given two points a and b such that f(a) and f(b) have opposite.
Lectures on Numerical Methods 1 Numerical Methods Charudatt Kadolkar Copyright 2000 © Charudatt Kadolkar.
NUMERICAL METHODS WITH C++ PROGRAMMING
Fin500J: Mathematical Foundations in Finance Topic 3: Numerical Methods for Solving Non-linear Equations Philip H. Dybvig Reference: Numerical Methods.
Section 5.5 – The Real Zeros of a Rational Function
2.5 Descartes’ Rule of Signs To apply theorems about the zeros of polynomial functions To approximate zeros of polynomial functions.
Theorems on continuous functions. Weierstrass’ theorem Let f(x) be a continuous function over a closed bounded interval [a,b] Then f(x) has at least one.
Derivative of an Inverse AB Free Response 3.
Scientific Computing Algorithm Convergence and Root Finding Methods.
Solving Non-Linear Equations (Root Finding)
Continuity ( Section 1.8) Alex Karassev. Definition A function f is continuous at a number a if Thus, we can use direct substitution to compute the limit.
Intermediate Value Theorem If f is continuous on [ a,b ] and k is any number between f(a) and f(b), inclusive, then there is at least one number c in the.
Introduction This chapter gives you several methods which can be used to solve complicated equations to given levels of accuracy These are similar to.
Using Technology to Approximate Roots of Polynomial Equations.
Introduction to Projectile Motion
Projectiles calculations Calculating the components of a vector using trigonometry and vertical and horizontal problems.
Physics Lesson 6 Projectile Motion Eleanor Roosevelt High School Mr. Chin-Sung Lin.
Physics Lesson 6 Projectile Motion
Solving Inequalities Algebraically Section P.6 – the last section of the chapter!!!
Solving equations numerically The sign - change rule If the function f(x) is continuous for an interval a  x  b of its domain, if f(a) and f(b) have.
1.4 Continuity  f is continuous at a if 1. is defined. 2. exists. 3.
The Bisection Method. Introduction Bisection Method: Bisection Method = a numerical method in Mathematics to find a root of a given function.
ME 142 Engineering Computation I Root Finding & Iterative Solutions.
Solving Non-Linear Equations (Root Finding)
Numerical Methods Solution of Equation.
Sullivan Algebra and Trigonometry: Section 5.2 Objectives Use the Remainder and Factor Theorems Use Descartes’ Rule of Signs Use the Rational Zeros Theorem.
1/29/ Bisection Method Computer Engineering Majors Authors: Autar Kaw, Jai Paul
Recursive Methods for Finding Roots of Functions Bisection & Newton’s Method.
Jonathon Vanderhorst & Callum Gilchrist Period 1.
AP Calc AB IVT. Introduction Intermediate Value Theorem If a function is continuous between a and b, then it takes on every value between and. Because.
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.
MATH342: Numerical Analysis Sunjae Kim.
Chapter 5 Numerical Root Findings
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Hypothesis: Conclusion:
Some exercises Dr.Entesar Ganash.
Numerical Calculations Part 5: Solving differential equations
Solution of Nonlinear Equations (Root finding Problems
3.7 The Real Zeros of a Polynomial Function
Locating Real Zeros of Polynomials
What is Projectile Motion?
Lesson 48 – Area Between Curves
Read Chapters 5 and 6 of the textbook
The Sky is the Limit! Or is it?
3.7 The Real Zeros of a Polynomial Function
Important Values for Continuous functions
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Projectile motion Projectile Motion Subject to Gravity Assumptions:
Bellringer What is the difference between the words vertical and horizontal? What does the word projectile mean? How is one dimensional (1D), two dimensional.
Projectile Motion AP Physics B.
Intermediate Value Theorem
Intermediate Value Theorem
1.4 Continuity and One-Sided Limits (Part 2)
A projectile launched at an angle
Continuity Alex Karassev.
3.8: Newton’s Method Greg Kelly, Hanford High School, Richland, Washington.
3.8: Newton’s Method Greg Kelly, Hanford High School, Richland, Washington.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Intermediate Value Theorem
Copyright © Cengage Learning. All rights reserved.
MATH 1910 Chapter 3 Section 8 Newton’s Method.
Projectile Motion.
Solutions for Nonlinear Equations
Presentation transcript:

Numerical Calculation Part 1: Equations &Roots Dr.Entesar Ganash (Bisection's Method)

Bisection's Method A general idea: This is another numerical method, which could be used to solve a general equation f(x)=0. The method depends on the intermediate value theorem for continuous functions. If a function f(x) is continuous on the interval [a, b] and sign of f(a) ≠ sign of f(b), then: there is a value c ∈ [a..b] such that: f(c) = 0 i.e., there is a root c in the interval [a, b] It is a successive approximation method that makes an interval, which has a root of the function f(x) narrow. It will bisect the interval in two parts and test which one has a function root. It will continue bisect the interval until the resulting interval becomes really small. Then the root is approximately equal to any value in the final interval. f(x) x In [a,b] From:

A Structure Plan: A structure plan to execute Bisection's method: 1.Estimate a required accuracy (Epsilon). 2.try to find two initial values of x ( and ) such that that means both functions have different signs. So, at least one root must lie some where between them. 3.Calculate maximum bisection N from inequality 4.Repeat N times (a) & (b) steps a) Find the mid point, call it, which is the estimated root of the interval [, ]. It is given by, also Find. b) Test whether if this condition is right..then let otherwise let 5. Print root and then end a program. The efficient thing of Bisection's method is number of bisections, which is needed for getting a good accuracy can be calculated before beginning as will be seen below.

Example Write a program using Bisection’s method to solve this equation starting with two guesses repetitions. PROGRAM BISECTION IMPLICIT NONE Integer::k,N ! a counter & a maximum bisection Real :: eps,XL,XR !required accuracy (epsilon)& two initial guesses Real :: xm ! a mid point Eps=1E-6 xL=1.0 ; xR=2.0 N=log(ABS(XL-XR)/eps)/log(2.0)+1 !N must exceed formula value DO K=1,N XM=(XL+XR)/2.0 If(F(XL)*F(XM) <0.0)THEN XR=XM Else XL=XM END IF END DO Solving

Write(*,*)'Number of bisection:‘ N Write(*,*)'The root is approximately =',XM Contains ! !Function Subprogram f is to solve f(x)=0 ! REAL FUNCTION f(x) Implicit none Real::f,x f=x**3+x-3 End FUNCTION f ! END PROGRAM BISECTION continue Solving 1

The result:

Exercise Write a program compute the position( x & y co-ordinate) and the velocity (magnitude &direction) of projectile, given t, the time since launch, u, the launch velocity, a, the initial angle of launch(in degrees) and g, the acceleration due gravity. The horizontal & vertical displacement are given by the formulae The velocity has magnitude V such that Where its horizontal & vertical components And V makes an angle with the ground such that

References Hahn, B.D., 1994, Fortran 90 For Scientists and Engineers, Elsevier. %20methods/bisection/bisection.html Univ.,