COLLEGE OF ENGINEERING

CHAPTER 6: ROOTS OF NONLINEAR EQUATIONS

OPEN METHODS

For the bracketing methods presented earlier, the root is located within an interval prescribed by a lower
and an upper bound. Repeated application of these methods always results in closer estimates of the true
value of the root. Such methods are said to be convergent because they move closer to the truth as the
computation progresses.

In contrast, the open methods described in this part of the chapter 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, they
sometimes diverge or move away from the true root as the computation progresses. However, when the
open methods converge, they usually do so much more quickly than the bracketing methods.

FIXED POINT METHOD

Open methods employ a formula to predict the root. Such a formula can be developed for simple fixed-
point iteration (or, as it is also called, one-point iteration or successive substitution) by rearranging the
function 𝑓(𝑥) = 0 so that x is on the left-hand side of the equation:

𝑥 = 𝑔(𝑥) EQ. 6.8

This transformation can be accomplished either by algebraic manipulation or by simply adding x to both
sides of the original equation. For example,

𝑥 2 − 2𝑥 + 3 = 0

can be simply manipulated to yield

𝑥2 + 3
𝑥=
2

whereas sin 𝑥 = 0 could be put into the form of Eq. 6.8 by adding x to both sides to yield

𝑥 = sin 𝑥 + 𝑥

The utility of Eq. 6.8 is that it provides a formula to predict a new value of x as a function of an old value of x.
Thus, given an initial guess at the root 𝑥𝑖 , Eq. 6.8 can be used to compute a new estimate 𝑥𝑖+1 as expressed
by the iterative formula

𝑥𝑖+1 = 𝑔(𝑥𝑖 ) EQ. 6.9

As with other iterative formulas, the approximate error for this equation can be determined using the error
estimator:

𝑥𝑖+1 − 𝑥𝑖
𝜀𝑎 = | | × 100% EQ. 6.10
𝑥𝑖+1

MATH 131 – NUMERICAL SOLUTIONS TO ENG’G PROBLEMS 1

 COLLEGE OF ENGINEERING

FIGURE 6.6

FIGURE 6.7

NEWTON–RAPHSON METHOD

Newton’s method is the most commonly used open method to solve 𝑓(𝑥) = 0, where 𝑓′ is continuous.
Consider the graph of 𝑓(𝑥) in Figure 6.8. Start with an initial point 𝑥1 and locate the point (𝑥1 , 𝑓(𝑥1 )) on the
curve. Draw the tangent line to the curve at that point and let its x-intercept be 𝑥2 . The equation of this
tangent line is

𝑦 − 𝑓(𝑥1 ) = 𝑓 ′ (𝑥1 )(𝑥 − 𝑥1 )

Therefore, its x-intercept is found by setting y = 0 and solving for x:

𝑓(𝑥1 )
𝑥2 = 𝑥1 −
𝑓 ′ (𝑥1 )

Once 𝑥2 is available, locate the point (𝑥2 , 𝑓(𝑥2 )), draw the tangent line to the curve at that point, and let 𝑥3
be its x-intercept, which is found as

𝑓(𝑥2 )
𝑥3 = 𝑥2 −
𝑓 ′ (𝑥2 )

Continue this process until the sequence {𝑥𝑛 } converges to the intended root 𝑟. In general, two consecutive
elements 𝑥𝑖 and 𝑥𝑖+1 are related via

MATH 131 – NUMERICAL SOLUTIONS TO ENG’G PROBLEMS 2

 COLLEGE OF ENGINEERING

𝑓(𝑥𝑖 )
𝑥𝑖+1 = 𝑥𝑖 − , 𝑛 = 1, 2, 3, … , 𝑥1 = 𝑖𝑛𝑖𝑡𝑖𝑎𝑙 𝑝𝑜𝑖𝑛𝑡
𝑓 ′ (𝑥𝑖 ) EQ. 6.11

which is called the Newton-Raphson formula.

FIGURE 6.8

Termination Criteria and Error Estimates

As with other root-location methods, Eq. 6.5 can be used as a termination criterion. In addition, however, the
Taylor series derivation of the method provides theoretical insight regarding the rate of convergence. Thus,
the error should be roughly proportional to the square of the previous error. In other words, the number of
significant figures of accuracy approximately doubles with each iteration.

DERIVATION AND ERROR ANALYSIS OF THE

NEWTON-RAPHSON METHOD

MATH 131 – NUMERICAL SOLUTIONS TO ENG’G PROBLEMS 3

 COLLEGE OF ENGINEERING

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, as in

𝑓(𝑥𝑖−1 ) − 𝑓(𝑥𝑖 )
𝑓 ′ (𝑥𝑖 ) ≅
𝑥𝑖−1 − 𝑥𝑖

This approximation can be substituted into Eq. 6.11 to yield the following iterative equation:

𝑓(𝑥𝑖 )(𝑥𝑖−1 − 𝑥𝑖 )
𝑥𝑖+1 = 𝑥𝑖 − EQ. 6.12
𝑓(𝑥𝑖−1 ) − 𝑓(𝑥𝑖 )

Equation 6.12 is the formula for the secant method. Notice that the approach requires two initial estimates
of x. However, because 𝑓(𝑥) is not required to change signs between the estimates, it is not classified as a
bracketing method.

FIGURE 6.8

The Difference Between the Secant and False-Position Methods

Note the similarity between the secant method and the false-position method. For example, Eqs. 6.12 and
6.7 are identical on a term-by-term basis. Both use two initial estimates to compute an approximation of the
slope of the function that is used to project to the x axis for a new estimate of the root. However, a critical
difference between the methods is how one of the initial values is replaced by the new estimate. Recall that
in the false-position method the latest estimate of the root replaces whichever of the original values yielded
a function value with the same sign as 𝑓(𝑥𝑟 ). 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 𝑥𝑖+1
replacing 𝑥𝑖 and 𝑥𝑖 replacing 𝑥𝑖−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.

SAMPLE PROBLEMS:

1. Determine the highest real root of 𝒇(𝒙) = 𝒙𝟑 − 𝟔𝒙𝟐 + 𝟏𝟏𝒙 − 𝟔. 𝟏:

(a) Using the Newton-Raphson method (three iterations, 𝑥𝑖 = 3.5)
(b) Using the Secant method (three iterations, 𝑥𝑖−1 = 2.5 and 𝑥𝑖 = 3.5)

Solution:

(a) Using the Newton-Raphson method (three iterations, 𝒙𝒊 = 𝟑. 𝟓)

The formula for the Newton-Raphson is given by

𝑓(𝑥)
𝑥𝑖+1 = 𝑥𝑖 −
𝑓 ′ (𝑥)

𝑓(𝑥) = 𝑥 3 − 6𝑥 2 + 11𝑥 − 6.1

MATH 131 – NUMERICAL SOLUTIONS TO ENG’G PROBLEMS 4

 COLLEGE OF ENGINEERING

Note that:

𝑑(𝑥 𝑛 )
= 𝑛𝑥 𝑛−1 (𝑃𝑜𝑤𝑒𝑟 𝑅𝑢𝑙𝑒)
𝑑𝑥

Therefore, the derivative can be evaluated as:

𝑓 ′ (𝑥) = 3𝑥 2 − 12𝑥 + 11

Substituting to the Newton-Raphson Formula gives

𝑥𝑖3 − 6𝑥𝑖2 + 11𝑥𝑖 − 6.1

𝑥𝑖+1 = 𝑥𝑖 −
3𝑥𝑖2 − 12𝑥𝑖 + 11

Using an initial guess of 3.5, the first iteration yields

(3.5)3 − 6(3.5)2 + 11(3.5) − 6.1 1.775

𝑥1 = 3.5 − 2
= 3.5 − = 3.1913
3(3.5) − 12(3.5) + 11 5.75

3.1913 − 3.5
𝜀𝑎 = | | × 100% = 9.6730%
3.1913

Second iteration:

(3.1913)3 − 6(3.1913)2 + 11(3.1913) − 6.1 0.3994

𝑥2 = 3.1913 − = 3.1913 − = 3.0687
3(3.1913)2 − 12(3.1913) + 11 3.2576

3.0687 − 3.1913
𝜀𝑎 = | | × 100% = 3.9953%
3.0687

Third iteration:

(3.0687)3 − 6(3.0687)2 + 11(3.0687) − 6.1 0.0519

𝑥3 = 3.0687 − 2
= 3.0687 − = 3.0473
3(3.0687) − 12(3.0687) + 11 2.4264

3.0473 − 3.0687
𝜀𝑎 = | | × 100% = 0.7017%
3.0473

The iterations can be summarized as:

ITERATION 𝒙𝒊 𝒇(𝒙𝒊 ) 𝒇′(𝒙𝒊 ) 𝒙𝒊+𝟏 𝜺𝒂

1 3.5 1.775 5.75 3.1913 9.6730%

2 3.1913 0.3994 3.2576 3.0687 3.9953%
3 3.0687 0.0519 2.4264 𝟑. 𝟎𝟒𝟕𝟑 0.7017%

After three iterations, we can conclude that the value (approximated) of the root is 3.0473.

(b) Using the Secant method (three iterations, 𝒙𝒊−𝟏 = 𝟐. 𝟓 and 𝒙𝒊 = 𝟑. 𝟓)

The formula for the Secant method is given by

𝑓(𝑥𝑖 )(𝑥𝑖−1 − 𝑥𝑖 )
𝑥𝑖+1 = 𝑥𝑖 −
𝑓(𝑥𝑖−1 ) − 𝑓(𝑥𝑖 )

The first iteration yields:

𝑥𝑖−1 = 2.5 𝑓(𝑥𝑖−1 ) = 2.53 − 6(2.5)2 + 11(2.5) − 6.1 = −0.475

𝑥𝑖 = 3.5 𝑓(𝑥𝑖 ) = 3.53 − 6(3.5)2 + 11(3.5) − 6.1 = 1.775

(1.775)(2.5 − 3.5)
𝑥1 = 3.5 − = 2.7111
(−0.475) − (1.775)

MATH 131 – NUMERICAL SOLUTIONS TO ENG’G PROBLEMS 5

 COLLEGE OF ENGINEERING

2.7111 − 3.5
𝜀𝑎 = | | × 100% = 29.0984%
2.7111

Second iteration:

𝑥𝑖−1 = 3.5 𝑓(𝑥𝑖−1 ) = 3.53 − 6(3.5)2 + 11(3.5) − 6.1 = 1.775

𝑥𝑖 = 2.7111 𝑓(𝑥𝑖 ) = 2.71113 − 6(2.7111)2 + 11(2.7111) − 6.1 = −0.4515

(−0.4515)(3.5 − 2.7111)
𝑥2 = 2.7111 − = 2.8711
(1.775) − (−0.4515)

2.8711 − 2.7111
𝜀𝑎 = | | × 100% = 5.5722%
2.8711

Third iteration:

𝑥𝑖−1 = 2.7111 𝑓(𝑥𝑖−1 ) = 2.71113 − 6(2.7111)2 + 11(2.7111) − 6.1 = −0.4515

𝑥𝑖 = 2.8711 𝑓(𝑥𝑖 ) = 2.87113 − 6(2.8711)2 + 11(2.8711) − 6.1 = −0.3101

(−0.3101)(2.7111 − 2.8711)
𝑥3 = 2.8711 − = 3.2219
(−0.4515) − (−0.3101)

3.2219 − 2.8711
𝜀𝑎 = | | × 100% = 10.8885%
3.2219

The iterations can be summarized as:

ITERATION 𝒙𝒊−𝟏 𝒙𝒊 𝒇(𝒙𝒊−𝟏 ) 𝒇(𝑥𝑖 ) 𝒙𝒊+𝟏 𝜺𝒂

1 2.5 3.5 −0.475 1.775 2.7111 29.0984%

2 3.5 2.7111 1.775 −0.4515 2.8711 5.5722%
3 2.7111 2.8711 −0.4515 −0.3101 𝟑. 𝟐𝟐𝟏𝟗 10.8885%

After three iterations, we can conclude that the value (approximated) of the root is 3.2219.

2. Determine the lowest positive root of 𝒇(𝒙) = 𝟕 𝐬𝐢𝐧(𝒙) 𝒆−𝒙 − 𝟏:

(a) Using the Newton-Raphson method (three iterations, 𝑥𝑖 = 0.3)
(b) Using the Secant method (three iterations, 𝑥𝑖−1 = 0.5 and 𝑥𝑖 = 0.4)

Solution:

(a) Using the Newton-Raphson method (three iterations, 𝒙𝒊 = 𝟎. 𝟑)

The formula for the Newton-Raphson is given by

𝑓(𝑥)
𝑥𝑖+1 = 𝑥𝑖 −
𝑓 ′ (𝑥)

𝑓(𝑥) = 7 sin(𝑥) 𝑒 −𝑥 − 1

Note that:

𝑑(𝑢 ± 𝑣) 𝑑𝑢 𝑑𝑣 𝑑(𝑢𝑣) 𝑑𝑣 𝑑𝑢 𝑑(𝑐) 𝑑(𝑒 𝑢 ) 𝑑𝑢

= ± (𝑆𝑢𝑚 𝑅𝑢𝑙𝑒); =𝑢 +𝑣 (𝑃𝑟𝑜𝑑𝑢𝑐𝑡 𝑅𝑢𝑙𝑒); = 0 (𝐶𝑜𝑛𝑠𝑡𝑎𝑛𝑡 𝑅𝑢𝑙𝑒) 𝑎𝑛𝑑 = 𝑒𝑢 ( )
𝑑𝑥 𝑑𝑥 𝑑𝑥 𝑑𝑥 𝑑𝑥 𝑑𝑥 𝑑𝑥 𝑑𝑥 𝑑𝑥

Therefore, the derivative can be evaluated as:

𝑓 ′ (𝑥) = 7𝑒 −𝑥 (𝑐𝑜𝑠𝑥 − 𝑠𝑖𝑛𝑥)

Substituting to the Newton-Raphson Formula gives

7 sin(𝑥𝑖 ) 𝑒 −𝑥𝑖 − 1
𝑥𝑖+1 = 𝑥𝑖 − −𝑥
7𝑒 𝑖 (𝑐𝑜𝑠(𝑥𝑖 ) − 𝑠𝑖𝑛(𝑥𝑖 ))
MATH 131 – NUMERICAL SOLUTIONS TO ENG’G PROBLEMS 6
 COLLEGE OF ENGINEERING

Using an initial guess of 0.3, the first iteration yields

7 sin(0.3) 𝑒 −0.3 − 1 0.5325

𝑥1 = 0.3 − −0.3
= 0.3 − = 0.1444
7𝑒 (cos(0.3) − sin(0.3)) 3.4216

0.1444 − 0.3
𝜀𝑎 = | | × 100% = 107.7907%
0.1444

Second iteration:

7 sin(0.1444) 𝑒 −0.1444 − 1 −0.1281

𝑥2 = 0.1444 − = 0.1444 − = 0.1694
7𝑒 −0.1444 (cos(0.1444) − sin(0.1444)) 5.1239

0.1694 − 0.1444
𝜀𝑎 = | | × 100% = 14.7630%
0.1694

Third iteration:

7 sin(0.1694) 𝑒 −0.1694 − 1 0.0038

𝑥3 = 0.1694 − −0.1694
= 0.1694 − = 0.1702
7𝑒 (cos(0.1694) − sin(0.1694)) 4.8284

0.1702 − 0.1694
𝜀𝑎 = | | × 100% = 0.4579%
0.1702

The iterations can be summarized as:

ITERATION 𝒙𝒊 𝒇(𝒙𝒊 ) 𝒇′(𝒙𝒊 ) 𝒙𝒊+𝟏 𝜺𝒂

1 0.3 0.5325 3.4216 0.1444 107.7907%

2 0.1444 −0.1281 5.1239 0.1694 14.7630%
3 0.1694 0.0038 4.8284 𝟎. 𝟏𝟕𝟎𝟐 0.4579%

After three iterations, we can conclude that the value (approximated) of the root is 𝟎. 𝟏𝟕𝟎𝟐.

(b) Using the Secant method (three iterations, 𝒙𝒊−𝟏 = 𝟎. 𝟒 and 𝒙𝒊 = 𝟎. 𝟑)

The formula for the Secant method is given by

𝑓(𝑥𝑖 )(𝑥𝑖−1 − 𝑥𝑖 )
𝑥𝑖+1 = 𝑥𝑖 −
𝑓(𝑥𝑖−1 ) − 𝑓(𝑥𝑖 )

The first iteration yields:

𝑥𝑖−1 = 0.4 𝑓(𝑥𝑖−1 ) = 7 sin(0.4) 𝑒 −0.4 − 1 = 0.8272

𝑥𝑖 = 0.3 𝑓(𝑥𝑖 ) = 7 sin(0.3) 𝑒 −0.3 − 1 = 0.5325

(0.5325)(0.4 − 0.3)
𝑥1 = 0.3 − = 0.1193
(0.8272) − (0.5325)

0.1193 − 0.3
𝜀𝑎 = | | × 100% = 151.3676%
0.1193

Second iteration:

𝑥𝑖−1 = 0.3 𝑓(𝑥𝑖−1 ) = 7 sin(0.3) 𝑒 −0.3 − 1 = 0.5325

𝑥𝑖 = 0.1193 𝑓(𝑥𝑖 ) = 7 sin(0.1193) 𝑒 −0.1193 − 1 = −0.2606

(−0.2606)(0.3 − 0.1193)
𝑥2 = 0.1193 − = 0.1787
(0.5325) − (−0.2606)

2.8711 − 2.7111
𝜀𝑎 = | | × 100% = 33.2295%
2.8711

MATH 131 – NUMERICAL SOLUTIONS TO ENG’G PROBLEMS 7

 COLLEGE OF ENGINEERING

Third iteration:

𝑥𝑖−1 = 0.1193 𝑓(𝑥𝑖−1 ) = 7 sin(0.1193) 𝑒 −0.1193 − 1 = −0.2606

𝑥𝑖 = 0.1787 𝑓(𝑥𝑖 ) = 7 sin(0.1787) 𝑒 −0.1787 − 1 = 0.0406

(0.0406)(0.1193 − 0.1787)
𝑥3 = 0.1787 − = 0.1707
(−0.2606) − (0.0406)

0.1707 − 0.1787
𝜀𝑎 = | | × 100% = 4.6953%
0.1707

The iterations can be summarized as:

ITERATION 𝒙𝒊−𝟏 𝒙𝒊 𝒇(𝒙𝒊−𝟏 ) 𝒇(𝑥𝑖 ) 𝒙𝒊+𝟏 𝜺𝒂

1 0.4 0.3 0.8272 0.5325 0.1193 151.3676%

2 0.3 0.1193 0.5325 −0.2606 0.1787 33.2295%
3 0.1193 0.1787 −0.2606 0.0406 𝟎. 𝟏𝟕𝟎𝟕 4.6953%

After three iterations, we can conclude that the value (approximated) of the root is 0.1707.

3. (a) Apply the Newton-Raphson method to the function 𝑓(𝑥) = tanh(𝑥 2 − 9) to evaluate its known real root
at 𝑥 = 3. Use an initial guess of 𝑥0 = 3.2 and take a minimum of three iterations. (b) Did the method
exhibit convergence onto its real root?

Solution:

(a) Using the Newton-Raphson method (three iterations, 𝒙𝒊 = 𝟑. 𝟐)

The formula for the Newton-Raphson is given by

𝑓(𝑥)
𝑥𝑖+1 = 𝑥𝑖 −
𝑓 ′ (𝑥)

𝑓(𝑥) = tanh(𝑥 2 − 9)

Note that:

𝑑(tanh 𝑢) 𝑑𝑢
= sech2 𝑢 ( )
𝑑𝑥 𝑑𝑥

Therefore, the derivative can be evaluated as:

𝑓 ′ (𝑥) = 2xsech2 (𝑥 2 − 9)

Substituting to the Newton-Raphson Formula gives

tanh(𝑥𝑖2 − 9)
𝑥𝑖+1 = 𝑥𝑖 −
2𝑥𝑖 sech2 (𝑥𝑖2 − 9)

Using an initial guess of 0.3, the first iteration yields

tanh((3.2)2 − 9) 0.8455
𝑥1 = 3.2 − 2 2
= 3.2 − = 2.7368
2(3.2)sech ((3.2) − 9) 1.8253

2.7368 − 3.2
𝜀𝑎 = | | × 100% = 16.9242%
2.7368

Second iteration:

tanh((2.7368)2 − 9) −0.9069
𝑥2 = 2.7368 − = 2.7368 − = 3.6703
2(2.7368)sech2 ((2.7368)2 − 9) 0.9715

MATH 131 – NUMERICAL SOLUTIONS TO ENG’G PROBLEMS 8

 COLLEGE OF ENGINEERING

3.6703 − 2.7368
𝜀𝑎 = | | × 100% = 25.4348%
3.6703

Third iteration:

tanh((3.6703)2 − 9) 0.9997
𝑥3 = 3.6703 − 2 2
= 3.6703 − = −256.8000
2(3.6703)sech ((3.6703) − 9) 0.0038

−256.8000 − 3.6703
𝜀𝑎 = | | × 100% = 101.4292%
−256.8000

The iterations can be summarized as:

ITERATION 𝒙𝒊 𝒇(𝒙𝒊 ) 𝒇′(𝒙𝒊 ) 𝒙𝒊+𝟏 𝜺𝒂

1 3.2 0.8455 1.8253 2.7368 16.9242%

2 2.7368 −0.9069 0.9715 3.6703 25.4348%
3 3.6703 0.9997 0.0038 −256.8000 101.4292%

(b) The solution diverges from its real root of x = 3. Due to the concavity of the slope, the next iteration will
always diverge. The following graph illustrates how the divergence evolves.

4. You are designing a spherical tank to hold water for a small village
in a developing country. The volume of liquid it can hold can be
computed as

[3𝑅 − ℎ]
𝑉 = 𝜋ℎ2
3

where 𝑉 = 𝑣𝑜𝑙𝑢𝑚𝑒 (𝑚3 ), ℎ = 𝑑𝑒𝑝𝑡ℎ 𝑜𝑓 𝑤𝑎𝑡𝑒𝑟 𝑖𝑛 𝑡ℎ𝑒 𝑡𝑎𝑛𝑘 (𝑚) and 𝑅 =

𝑡ℎ𝑒 𝑡𝑎𝑛𝑘 𝑟𝑎𝑑𝑖𝑢𝑠 (𝑚). If 𝑅 = 10 m, what depth must the tank be filled
so that it holds 1000 m3 ? Use three iterations of the most efficient
numerical method possible to determine your answer. Determine
the approximate relative error after each iteration.

Solution:

Since the given equation is easy to differentiate, the Newton-Raphson method is the best choice to achieve
results efficiently.

Using the Newton-Raphson method (three iterations, 𝒙𝒊 = 𝟑. 𝟐)

The formula for the Newton-Raphson is given by

𝑓(𝑥)
𝑥𝑖+1 = 𝑥𝑖 −
𝑓 ′ (𝑥)

[3𝑅 − ℎ]
𝑉 = 𝜋ℎ2
3
MATH 131 – NUMERICAL SOLUTIONS TO ENG’G PROBLEMS 9
 COLLEGE OF ENGINEERING

𝜋ℎ3
𝑓(ℎ) = 𝜋ℎ2 𝑅 − −𝑉
3

Note that:

𝑑(𝑢𝑣) 𝑑𝑣 𝑑𝑢
=𝑢 +𝑣 (𝑃𝑟𝑜𝑑𝑢𝑐𝑡 𝑅𝑢𝑙𝑒)
𝑑𝑥 𝑑𝑥 𝑑𝑥

Therefore, the derivative can be evaluated as:

𝑓 ′ (ℎ) = 2𝜋ℎ𝑅 − 𝜋ℎ2

In this problem, we are going to follow the format of the Newton-Raphson formula but 𝑥𝑖 = ℎ𝑖 . Substituting to
the Newton-Raphson Formula gives

𝜋𝑥𝑖3
𝜋𝑥𝑖2 𝑅 − −𝑉
𝑥𝑖+1 = 𝑥𝑖 − 3
2𝜋𝑥𝑖 𝑅 − 𝜋𝑥𝑖2

Using an initial guess of 0.3, the first iteration yields

𝜋(10)3
𝜋(10)(10) − − 1000 1094.3951
𝑥1 = 10 − 3 = 10 − = 6.5164
2𝜋(10)(10) − 𝜋(10)2 314.1593

6.5164 − 10
𝜀𝑎 = | | × 100% = 53.4582%
6.5164

Second iteration:

𝜋(6.5164)3
𝜋(6.5164)(10) − − 1000 44.2603
𝑥2 = 6.5164 − 3 = 6.5164 − = 6.3561
2𝜋(6.5164)(10) − 𝜋(6.5164)2 276.0346

6.3561 − 6.5164
𝜀𝑎 = | | × 100% = 2.5227%
6.3561

Third iteration:

𝜋(6.3561)3
𝜋(6.3561)(10) − − 1000 0.2975
𝑥3 = 6.3561 − 3 = 6.3561 − = 6.3550
2𝜋(6.3561)(10) − 𝜋(6.3561) 2 272.4452

6.3550 − 6.3561
𝜀𝑎 = | | × 100% = 0.0172%
6.3550

The iterations can be summarized as:

ITERATION 𝒙𝒊 𝒇(𝒙𝒊 ) 𝒇′(𝒙𝒊 ) 𝒙𝒊+𝟏 𝜺𝒂

1 10 1094.3951 314.1593 6.5164 53.4582%

2 6.5164 44.2603 276.0346 6.3561 2.5227%
3 6.3561 0.2975 272.4452 𝟔. 𝟑𝟓𝟓𝟎 0.0172%

Thus, after only three iterations, the root is determined to be 6.3550 with an approximate relative error of
0.0172%.

MATH 131 – NUMERICAL SOLUTIONS TO ENG’G PROBLEMS 10