Scribd
Upload
1K views4 pages

Open Methods (Newton-Raphson Secant Methods)

Open methods like the Newton-Raphson method and secant method can find roots of equations using a single starting value or two starting values, respectively. While they may diverge from the true root, they usually converge faster than bracketing methods. The Newton-Raphson method uses the tangent line to estimate the next root, while the secant method approximates the derivative using finite differences. Both methods iteratively calculate new estimates until the change is within a tolerance of the root. However, convergence depends on the initial guess being close to the root and on the nature of the function.

Uploaded by

Maria Therese
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
1K views4 pages

Open Methods (Newton-Raphson Secant Methods)

Open methods like the Newton-Raphson method and secant method can find roots of equations using a single starting value or two starting values, respectively. While they may diverge from the true root, they usually converge faster than bracketing methods. The Newton-Raphson method uses the tangent line to estimate the next root, while the secant method approximates the derivative using finite differences. Both methods iteratively calculate new estimates until the change is within a tolerance of the root. However, convergence depends on the initial guess being close to the root and on the nature of the function.

Uploaded by

Maria Therese
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/ 4

Open Methods:

Open methods are based on formulas that require only a single starting value of x or
two starting values that do not necessary bracket the root. As such, they sometimes diverge or
move away from the true value root as the computation progresses. However, when the open
methods converge, they usually do so much more quickly than the bracketing methods.

1. The Newton-raphson Method:

Newton-Raphson Method is the most widely used of all root-locating formulas. Only
one initial guess of the root is needed to get the iterative process started to find the root of
an equation.

Newton-Raphson method is based on the principle that if the initial guess of the root
of f(x)=0 is at xi, then if one draws the tangent to the curve at f(xi), the point xi+1 where the
tangent crosses the x-axis is an improved estimate of the root as shown in the figure shown
below.

Using the definition of the slope of a function, at x=xi

( )

( )
( )
which gives

( )
Newton-Raphson formula
( )

Algorithm of Newton-Raphson Method:


The steps to apply Newton-Raphson method to find the root of an equation
f(x)=0 are
1. Evaluate ( ) symbolically.
2. Use an initial guess of the root xi, to estimate the new value of the root xi+1 as

( )
( )
3. Find the absolute relative approximate error, | | as

| | | |
4. Compute the absolute relative approximate error, | | with the pre-specified
relative error tolerance, . If | | , then go to step 2, else stop the algorithm.
Also, check if the number of iterations has exceeded the maximum number of
iterations.

Illustrative Example:

Use the Newton-Raphson method to estimate the root of ( ) ,


employing an initial guess of xi=0.

Solution:

( )

Substitute to Newton-Raphson formula

Starting with an initial guess of xi=0, this iterative equation can be applied to compute

Therefore, the root is 0.56714317 if stopping criterion is n=2.

Pitfalls of the Newton-Raphson Method

Cases where convergence is slow.


a. An inflection point i.e., ( ) occurs in the vicinity of root.
b. Initial guess encounters near zero slope, ( ) .

The convergence of Newton-Raphson method depends on the nature of the


function and on the accuracy of the initial guess. The only remedy is to have an initial
guess that is “sufficiently” close to the root. Good guesses are usually predicated on
knowledge of the physical problem setting or on devices such as graphs that provide
insight into the behavior of the solution.
2. The Secant Method:

A potential problem in implementing the Newton-Raphson method is the


evaluation of the derivative. Although this is not inconvenient for polynomials and
many other functions, there are certain functions whose derivatives may be
extremely difficult or inconvenient to evaluate. For these cases, the derivative can
be approximated by a backward finite divided difference,

( ) ( )
( )
This approximation can be substituted into the Newton-Raphson formula:

( )( )
( )
Secant formula.
( )

The secant formula requires two initial estimates of x.


Algorithm of Secant Method:
The steps to apply Secant method to find the root of an equation f(x)=0 are

1. Begin with any two points [xi, xi-1].


2. Calculate xi+1 using the secant method formula
( )( )
( ) ( )
3. Replace xi with xi-1, replace xi-1 with xi+1 and repeat from step 2 until convergence
is reached.

Use the two most recently generated points in subsequent iterations.

Illustrative Example:

Use the Secant method to estimate the root of ( ) , employing an


initial guess of xi=0 and xi-1=1.

Solution:

Therefore, the root is 0.56714331

You might also like