Homework Assignment #2

2-1 Use the Bisection method to find pn , n = 1, 2, ..., 10 for f (x) = x cos x on [0, 1]. (Algorithm 1)

2-2 Find an approximation to 3 correct to within 104 using the Bisection Algorithm. [Hint: Consider
f (x) = x2 3.]

2-3 Use the fixed-point iteration method to find an approximation to 3 that is accurate to within 104 .
Compare your result and the number of iterations required with the answer obtained in the Bisection
Algorithm.
2-4 (i) Use the following algebraic manipulation to show that each has a fixed point at p precisely when
f (p) = 0, where f (x) = x4 + 2x2 x 3.

2 1/4

(a) g1 (x) = (3 + x 2x )

(c) g3 (x) =

x+3
x2 + 2

(b) g2 (x) =

1/2

(d) g4 (x) =

x + 3 x4
2

!1/2

3x4 + 2x2 + 3
4x3 + 4x 1

(ii) Perform four iterations, if possible, on each of the function gi . Let p0 = 1 and pn+1 = g(pn ), for
n = 0, 1, 2, 3. which function do you think gives the best approximation to the solution.
(Algorithm 2)
2-5 (i) Show that if A is any positive number then the sequence defined by
1
A
xn = xn1 +
,
2
2xn1

for n 1,

converges to A whenever x0 > 0.

(ii) What happens if x0 < 0 ?
2-6 Let f (x) = x2 6 and p0 = 1. Use Newtons method to find p2 .
2-7 Let f (x) = x2 6 and p0 = 3, p1 = 2, find p3 .
(a) Use the Secant method.
(b) Use the method of False Position.

(c) Which of (a) or (b) is closer to 6.

2-8 Suppose p is a zero of multiplicity m of f , where f 000 is continuous on an open interval containing p.
Show that the following fixed-point method has g 0 (p) = 0:
g(x) = x

mf (x)
f 0 (x)

2-9 Show that the Bisection Algorithm gives a sequence with an error bound that converges linearly to 0.

2-10 Use Steffensens method with p0 = 2 to compute an approximation to 3 accurate to within 104 .
Compare your result and the numbers of iterations required with the answer obtained in the Bisection
Algorithm and fixed-point iteration method.
2-11 The following sequences converge to 0. Use Aitkens 2 method to generate {pbn } until |pbn |
1
1
5 102 : (a) pn = , n 1.
(b) pn = 2 , n 1.
n
n

Solutions for Homework Assignment #2

2-1

n
1
2
3
4
5

pn
0.5
0.75
0.625
0.6875
0.65626

f (pn )
0.170476
0.134337
0.0203937
0.0563213
0.0178067

n
6
7
8
9
10

pn
0.640625
0.648438
0.644531
0.642578
0.641602

f (pn )
0.00133182
0.00822774
0.00344555
0.00105626
0.000137933

2-2 p13 = 1.7320557, p = 1.732050807568877, and |p p13 | = 4.86 106 .

2-4

(a)
0
1
2
3

pn
1.18921
1.08006
1.14967
1.10782

f (pn )
0.63922
0.386228
0.240826
0.147105

(c)
0
1
2
3

pn
1.1547
1.11643
1.12605
1.12364

f (pn )
0.289744
0.0700688
0.0177429
0.00444148

(b)
0
1
2
3
(d)
0
1
2
3

pn
1.22474
0.993666
1.22857
0.987506

f (pn )
1.02526
1.04402
1.06842
1.08621

pn
1.14286
1.12448
1.1241231639
1.124123029704334

f (pn )
0.175344
0.0032932
1.23208 106
1.72659 1013

Hence the (d) is the best iterative function.

A
> 0. Then xn > 0 for all n. Suppose xn converges to p 0, then
2-5 (i) Since A > 0 and x0 > 0, x1 = 12 x0 + 2x
0

1
A
p = 2 p + 2p p = A.
A
< 0. Then xn < 0 for all n. Then xn converges to p 0, then
(ii) If x0 < 0, then x1 = 12 x0 + 2x
0

A
1
p = A.
p= p+
2
2p

2-6 f (x) = x2 6, f 0 (x) = 2x, and p0 = 1, the Newtons method pn+1 = pn

and p2 = 3.5

f (3.5)
= 2.607. (The exact solution 6 2.4494897)
0
f (3.5)

f (pn )
f (1)
. Then p1 = 1 0
= 3.5
0
f (pn )
f (1)

f (pn1 )(pn1 pn2 )

, p0 = 3, p1 = 2.
f (pn1 ) f (pn2 )
f (p1 )(p1 p0 )
(a) p0 = 3, p1 = 2, f (p0 ) = 3 and f (p1 ) = 2. Then p2 = p1
= 2.4, and f (p2 ) = 0.24.
f (p1 ) f (p0 )
f (p2 )(p2 p1 )
Then we have p3 = p2
= 2.45454.
f (p2 ) f (p1 )
f (p2 )(p2 p0 )
(b) As in the Secant method. Since f (p1 ) < 0 and f (p2 ) < 0, then p3 = p2
= 2.44444.
f (p2 ) f (p0 )

The exact solution 6 2.4494897. Hence (b) is closer to 6.

2-7 The Secant method and False Position is pn = pn1

2-8 f (x) = (x p)m q(x) where lim q(x) 6= 0. Then

xp

m(x p)m q(x)

m(x p)q(x)
g(x) = x
=x
.
m1
m(x p)
q(x) + (x p)m q 0 (x)
mq(x) + (x p)q 0 (x)
mq(p)[mq(p)]
Therefore, g 0 (p) = 1
= 0. If f 000 is continuous, the sequence produces quadratic convergence.
[mq(p)]2
p pn+1
(b a)/2n+1
1
= lim
= . Then the Bisection Algorithm is linearly convergence.
n p pn
n (b a)/2n
2

2-9 lim

2-10 For g(x) = 0.5(x + x3 ) and p0 = 0.5, then p4 = 1.73205.

2-11 (a) p10 = 0.045,

(b) p2 = 0.0363.