Sheet I

Chapter I : Solution of Non-Linear Equations

(The Bisection Method – The Fixed-Point Iteration Method – Newton Raphson
Method False Position Method and Secant Method)

Q1 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Consider the equation 𝒇(𝒙) = 𝒙𝟑 + 𝟒 𝒙𝟐 − 𝟏𝟎 = 𝟎. Discuss the existence of a real root of
this equation in the interval [1, 2] and determine the number of iterations necessary to solve
this equation by the bisection method with accuracy 𝟏𝟎−𝟕 .

Q2 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
For the equation, 5 x – cos(2x) =0
(i) Discuss the existence of a real root in the interval [0, 1].
(ii) Use the bisection method find P4.
(iii) Determine the number of iterations necessary to solve this equation with
accuracy 10-8 .

Q3 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
If the sequences generated by:
5 2 +5
𝑥𝑛
(ii) 𝑥𝑛+1 = 6 − 𝑥𝑛+1 =
𝑥𝑛 6
Both converge, show that they do so to different roots of the same equation.
Q4 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Consider the equation x − cos (x) = 𝟎. Discuss the existence of a real root of this equation
in the interval [0, 1]. Prove that this equation has exactly one real root in the interval [0, 1].
Perform four iterations of the Newton Raphson method choose the initial point on the bases
of the bisection method.
Q5 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Consider the equation x − 𝑒 −𝑥 = 𝟎. Discuss the existence of a real root of this equation in
the interval [0, 1]. Prove that this equation has exactly one real root in the interval [0, 1].
Perform four iterations of the fixed-point iteration method choose the initial point on the
bases of the bisection method.
Q6 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Let f(x) be a continuous function on the interval [a, b], f(a) f(b) < 0, and let c be a number
calculated by using the false position method such that f(a) and f(c) have the same sign,
show that the length of the next interval "for the false position method" is:
𝑓(𝑏)
(𝑏 − 𝑎)
𝑓(𝑏) − 𝑓(𝑎)
Q7 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
For the equation, 5x – cos(3x) =0 , P0 =/4

Use Newton's method, Find a root for this equation correct to three digits.

Q8 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
For the equation, 4 x – cos(x) =0 , 𝒑𝟎 = 𝝅/𝟒
Use the fixed-point iteration method, find a root for this equation correct to three digits.
(Check that your choices! satisfy the required conditions)
Q9 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

Show that the equation 𝒙𝟐 + 𝐥𝐧(𝒙) = 𝟎 , has exactly one real root in the interval [0.5, 1].

Perform three iterations of the false position method.

 Sheet I
Chapter I : Solution of Non-Linear Equations

Q10 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

Show that the equation, 𝟐 𝒙 − 𝐜𝐨𝐬(𝐱) = 𝟎 , has exactly one real root in the interval [𝟎, 𝝅/𝟒].

Perform three iterations of the Secant method.

Q11 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
If the sequences generated by:
14 2 +14
𝑥𝑛
(ii) 𝑥𝑛+1 = 9 − 𝑥𝑛+1 =
𝑥𝑛 9
Both converge, show that they do so to different roots of the same equation.
Q12 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Newton Raphson method for approximating solutions of nonlinear equations 𝑓(𝑥) = 0, fails
when

(a) 𝑓 ′ (𝑥) = 0 (b) 𝑓 ′ (𝑥) < 0

(c) 𝑓(𝑥) is an increasing function (d) 𝑓 ′ ′ (𝑥) = 0

Q13 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
The Newton-Raphson method formula for finding the square root of a real number R
from the equation
x2 – R = 0 is,
1 𝑅
(a) 𝑥𝑖+1 = 2 (𝑥𝑖 + 𝑥 ) (b) 𝑥𝑖+1 = 2 𝑥𝑖 − 𝑥𝑖2 𝑅
𝑖
1 𝑅 𝑥𝑖
(c) 𝑥𝑖+1 = 2 (3𝑥𝑖 − 𝑥 ) (d) 𝑥𝑖+1 =
𝑖
2

Q14 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
The Newton-Raphson method formula for finding the reciprocal of a real number R is
1
(Hint you can use the equation 𝑥 = 𝑅 ).
1 𝑅
(a) 𝑥𝑖+1 = 2 (𝑥𝑖 + 𝑥 ) (b) 𝑥𝑖+1 = 2 𝑥𝑖 − 𝑥𝑖2 𝑅
𝑖
1 𝑅 𝑥𝑖
(c) 𝑥𝑖+1 = 2 (3𝑥𝑖 − 𝑥 ) (d) 𝑥𝑖+1 =
𝑖
2

Q15 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
The condition of convergence of the fixed-point iteration 𝑥𝑖+1 = 𝑔(𝑥𝑖 ) , is

(a) |𝑔′ (𝑥)| < 1 (b) |𝑔′ (𝑥)| ≥ 1

(c) |𝑔′ (𝑥)| > 1 (d) |𝑔′ (𝑥)| ≤ 1

Q16 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
The Newton Raphson method may be called ⋯ ⋯.

(a) Tangent Method (b) Secant Method

(c) Diameter Method (d) Chord Method

 Sheet I
Chapter I : Solution of Non-Linear Equations

Q17 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
One of the drawbacks of the Bisection method is.

(a) The number of the iterations required to (b) the condition of convergence may
obtain certain accuracy cannot be estimated. be not satisfied after few iterations.

(c) it does not consider the function values (d) the difficulty in the choice of the
at end points of the considered interval. iteration function.

Q18 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
The Secant method is used to solve,

(a) second order differential equations. (b) non-linear algebraic equations.

(c) systems of linear equations. (d) first order initial value problems.

Q19 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
ln ((𝑏−𝑎) 10𝑘 )
The formula 𝑛 ≥ , can be used to approximate the number of
ln 2
iterations required to approximate a root located in the interval [a, b] correct to k
digits using

(a) Newton Raphson method. (b) bisection method.

(c) fixed point iteration method. (d) false position method.

Q20 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Both the equation1: 𝒙𝟑 + 𝟒 𝒙𝟐 − 𝟏𝟎 = 𝟎 and equation2 : x − 𝑒 −𝑥 − 1 = 𝟎 have a
root in the interval [1, 2] the number of iteration required to obtain the root of
equation1 correct to five digits by using the bisection method is ⋯ the number of
iterations for equation2 correct to five digits by using the bisection method also.

(a) equal (b) greater than

(c) smaller than (d) ) not comparable with

Q21 xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Both the equation1: 𝒙𝟑 + 𝟒 𝒙𝟐 − 𝟏𝟎 = 𝟎 and equation2 : x − 𝑒 −𝑥 − 1 = 𝟎 have a
root in the interval [1, 2] the number of iteration required to obtain the root of
equation1 correct to five digits by using the bisection method ⋯ the number of
iterations for equation2 correct to seven digits by using the bisection method also.

(a) is equal to (b) is greater than

(c) is smaller than (d) not comparable with