NUMERICAL
SOLUTIONS TO CE
1
PROBLEMS
ENGR. [Link]
BY: ENGR. MARIA YSABELLA MOSCOSO
1 OBJECTIVES
1. Recognizing the difference between bracketing method and open
method for root location.
2. Knowing how to solve a roots problem within the Newton-Raphson
method and appreciating the concept pf quadratic convergence.
3. Knowing how to implement both secant and modified secant
methods.
ENGR. [Link]
1 DIFFERENCE BETWEEN BRACKETING AND OPEN METHOD
Bracketing Methods: Open Methods:
•Concept: These methods start with •Concept: These methods do not require
two guesses that are known to bracket bracketing and use a single initial guess or
(i.e., contain) the root. multiple guesses to find the root.
•Example: If you have two points •Example: They rely on iterative
where the function changes sign (one improvements without needing to enclose
is positive and one is negative), the the root.
root lies between them. •Method: Use techniques based on function
•Method: Refine these guesses to zero values and their derivatives or other criteria
in on the root. to iteratively move closer to the root.
•Examples: Bisection method and •Examples: Newton's method and Secant
Regula Falsi (False Position) method. method.
•Advantage: Guaranteed to converge •Advantage: Can be faster and more
to a root if the initial bracket is correct. efficient but may not converge if the initial
guess is not good.
ENGR. [Link]
1 NEWTON’S-METHOD
Newton’s method (also called as Newton-Raphson Method) is
a scheme for finding numerical solution of an equation of the
form f(x) = 0 where f(x) is continuous and differentiable, and the
equation is known to have a solution near a given point.
In this method, the next value of the root, is in the intersection of
the tangent line to our curve.
ENGR. [Link]
1 NEWTON’S-METHOD
𝒇(𝒙𝒏 )
ENGR. [Link] 𝒙𝒏+𝟏 = 𝒙𝒏 −
𝒇′(𝒙𝒏 )
1 NEWTON’S-METHOD
ALGORITHM FOR NEWTON’S METHOD
1. Choose a point 𝒙𝟏 as an initial guess of the solution.
2. For I = 1,2,…., until the error is smaller than a specified value, calculate 𝒙𝒊+𝟏 by using the
𝒇(𝒙𝒏 )
𝒙𝒏+𝟏 = 𝒙𝒏 −
𝒇′(𝒙𝒏 )
WHEN ARE THE ITERATIONS STOPPED?
Ideally, the iterations should be stopped when as exact is obtained. This means that the
value of x such that f(x) = 0. Generally, as discussed, this exact solution cannot be found
computationally. In practice therefore, the iterations a re stopped when an estimated
error is smaller than some predetermined value. A tolerance in solution, as in the bisection
method, cannot be calculated since bounds are not known.
ENGR. [Link]