0% found this document useful (0 votes)
11 views10 pages

Eq Roots1

The document discusses root-finding methods for equations. It describes open methods, which use a single starting value or two values that do not necessarily bracket the root. This can sometimes lead to divergence rather than convergence to the true root. Two open methods are then described: fixed-point iteration, which rearranges the equation so x is isolated on one side; and the Newton-Raphson method, which uses successive tangent lines to iteratively estimate the root. The secant method is also discussed, and how it can sometimes diverge by not ensuring its estimates bracket the root.
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
0% found this document useful (0 votes)
11 views10 pages

Eq Roots1

The document discusses root-finding methods for equations. It describes open methods, which use a single starting value or two values that do not necessarily bracket the root. This can sometimes lead to divergence rather than convergence to the true root. Two open methods are then described: fixed-point iteration, which rearranges the equation so x is isolated on one side; and the Newton-Raphson method, which uses successive tangent lines to iteratively estimate the root. The secant method is also discussed, and how it can sometimes diverge by not ensuring its estimates bracket the root.
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
You are on page 1/ 10

Roots of Equations-Part 2

Open Methods
In the Bracketing Methods the root is found within an interval limited by an upper bound and a
lower bound. Repeated application of these methods always results to a closer estimate of the
root so long as the root is found within the limits of the interval. Such methods are convergent
because they move closer to the true value of the root.
In contrast, the Open Methods are based on formulas that require only a single starting value
of x or two starting values that do not necessarily bracket the root. As such, there are instances
that the methods may diverge instead of converging to the true root.

a) Fixed-Point Iteration
Fixed-Point iteration is also called one-point iteration or successive substitution) by
rearranging the function f(x) = 0 so that x is on the left-hand side of the equation: x  g  x  .
This transformation can be accomplished either by algebraic manipulation or by simply adding
x to both sides of the original equation.
f x 
f1  x   x

f 2 x   e x
x
1 1

xr  0.56714329
b) The Newton-Rahpson Method
f(x)
Equation of the Line
 y  y0   mx  x0 
y  f x 
Equation of the Tangent Line
Tangent Line  f xi   0  f ' xi xi  xi1 
f(xi)
f  xi 
 x i 1 xi 
f '  xi 

Iterate until xi 1  xi  rror bound

e.g. rror bound  1x10  4

x
xi
xi+1 Condition for Convergenc e
xroot
if rror  x i 1 xi
then xroot  xi 1

Perhaps the most widely used of all root-locating formulas is the Newton-Raphson equation.
If the initial guess of the root is xi, a tangent can be extended at the point (xi , f(xi)). The point
where this tangent crosses the x-axis usually represents an improved estimate of the root.
one of the initial values is replaced by the new estimate. Recall that in the Regula-Falsi
method the latest estimate of the root replaces whichever of the original values yielded a
function value with the same sign as f(xi). Consequently, the two estimates always bracket the
root. Therefore, for all practical purposes, the method always converges because the root is
kept within the bracket. In contrast, the Secant method replaces the values in strict sequence,
with the new value xi+1 replacing xi and xi replacing xi-1. As a result, the two values can
sometimes lie on the same side of the root. For certain cases, this can lead to divergence.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy