Scribd
Upload
9 views12 pages

Numerical Solutions: Bisection & Roots

The document discusses numerical solutions and bracketing methods, specifically the bisection and false position methods. It provides an introduction and definition of bracketing methods, and describes the bisection method process of dividing the interval in half and determining the root location. A sample problem is also presented to demonstrate solving for a drag coefficient using an equation.

Uploaded by

John Reyes Pagcaliwangan
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views12 pages

Numerical Solutions: Bisection & Roots

The document discusses numerical solutions and bracketing methods, specifically the bisection and false position methods. It provides an introduction and definition of bracketing methods, and describes the bisection method process of dividing the interval in half and determining the root location. A sample problem is also presented to demonstrate solving for a drag coefficient using an equation.

Uploaded by

John Reyes Pagcaliwangan
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Numerical Solutions

Engr. Ian Chris L. Tumulak


Objectives
At the end of this topic, the student will be able to

• Learn to analyze and solve numerical solutions by bracketing method: Bisection


Method and False Position Method
Introduction
• Bracketing Method
― This chapter on roots of equations deals with methods that exploit the fact that a function
typically changes signs in the vicinity of a root.

― These techniques are called bracketing methods because two initial guesses for the root are
required.

Source: Numerical Methods for Engineers by Chapra and Canale


Introduction
• Bisection Method
― alternatively called binary chopping, interval halving, or Bolzano’s method, is one type of
incremental search method in which the interval is always divided in half.

― If a function changes sign over an interval, the function value at the midpoint is evaluated.

― The location of the root is then determined as lying at the midpoint of the subinterval within
which the sign change occurs.

― The process is repeated to obtain refined estimates.

Source: Numerical Methods for Engineers by Chapra and Canale


Introduction
• Bisection Method

Source: Numerical Methods for Engineers by Chapra and Canale


Sample Problem
Problem Statement: Determine the drag coefficient c needed for a parachutist of
mass m = 68.1 kg to have a velocity of 40 m/s after free-falling for time t = 10 s.
Note: The acceleration due to gravity is 9.8 m/s2
𝑐
𝑚𝑔 − 10
Use the equation to solve c: 𝑓 𝑐 = 1−𝑒 𝑚 −𝑣
𝑐

Source: Numerical Methods for Engineers by Chapra and Canale


Sample Problem

Source: Numerical Methods for Engineers by Chapra and Canale


Sample Problem

Source: Numerical Methods for Engineers by Chapra and Canale


Sample Problem

Source: Numerical Methods for Engineers by Chapra and Canale


Sample Problem

Source: Numerical Methods for Engineers by Chapra and Canale


Sample Problem

Source: Numerical Methods for Engineers by Chapra and Canale


END

You might also like