Chapter 2
The Solution of Nonlinear
Equations f(x) =0
2.1
1.
Iteration for Solving x = 9(z)
{a) Gleaely, 9(z) € C[0, 1}. Since g(x) = —2/2 <0 on the interval [0,1],
the function g(z) is strictly decreasing on the interval [0,1]. If g is
strictly decreasing on (0,1), then 4(0) = 1 and g(1) = 0 imply that
9{(0,1]) = [0,1] C [0,1]. ‘Thus, by Theorem 2.2, the fimetion g(z)
hhas a fixed point on the interval 0.1}
In addition: |f'(2)| = | - 2/2] = 2/2 < 1/2 < 1 on the interval
(0,1). ‘Thus, by Theorem 2.2, the function g(x) has a unique fixed
point on the interval (0, 1)
(b) Clearly, o(r) € C[0,1}. Since g'(2) = -In(2}2-* <0 on the interval
[0,1], the function g(z) is strictly deereasing on the interval (0,1). Tf
47's strictly decreasing on (0,1), then g(0) = 1 and 9(1) = 1/2 imply
that 9([0,1)) = [1/2,1] ¢ [0,1]. Thus, by Theorem 2.2,the function
9(z) has a fixed point on the interval (0,1)
In addition: |g/() = | -In(2)2-3|
1 on the interval (0,1). Thus, by Theore
an unique fixed point on the interval (0,
In(2)2"2 < ba(2) < Ine)
, the Fimetion g(x) has
Clearly 9(2) is continuous on [0.5,5.2] and 9((0.5,5.2)) ¢ (0.5,5.2)
But, 9((0.5,2]) C (0.5,2). ‘Thus, the hypotheses of the first part of
‘Theorem 2.2 are satisfied and g has a fixed point in (0.5,2). While
(2,1) is the unique fixed point in 0.5,2}, (f"(1)] = 1 ¥ 1, thus the
hypothesee in part (4) of Theorem 2.2 cannot be satisfied
6 AGCHAPTER 2. THE SOLUTION OF NONLINEAR EQUATIONS F(X) = 0
2 (a)
~4t4r—het = 0
sta 6r48 = 0
z= 24
and
g2) = 448-2 = 2
gd) = 4416-8 = 4
(b)
wm = 19
m = 1.795
P2 = 15689875
Pa = 104508911
(e)
Pm = 38
Pr = 398
rr = 39998
Ps = 399999998
(@) Por part (b)
on Ro = 0.95
0.205 R= 0.1025
043110125 Ry = 0.21950625
095491089 Ry = O.A77495444
(©) The sequence in part (b) does not converge to P=
in part (c) converges to P = 4
3. (@) p= V5, pa = VE+ VIS, converges
() m= dpe
© pm
‘The sequence
5.537809, diverges
@ nm = 60.5, diverges
4. The fixed points are P= 2 and P = ~2. Since (2) = 5.and g/(—2) =
fixed- point iteration will net converge to P = 2 and P=
5
3,
2, respectively
2 = ceos(z)
2(1-cos(z)) = 0
= = Onn 21. ITERATION FOR SOLVING X = G(x) Ww
‘Thus g(z) has infinitely many fixed points: P =2nx, where n € Z. Note
lo'(2nm)| = |cos(2n)~2nm in(2nm)] = 1
‘Thus Theorem 2.3 may not be used to fnd the fixed points of g(c),
6. |p2 ~ pal = |9(02) ~ 9(00)| = loca) (Ps ~ Po) < Kips — pal
7. |Eal = |P ~ mi] = |9(P) — 9(po)| = |a'(ee)(P — po)| > |P — pol = |Eol
8. (a) By way of contradiction assume there exists k such that pres =
(Pk) = Pr. It follows that:
0.000173 + pe
> pm
—0.0001p, > 0
m= 0
‘Thus Pk-1 = 0 oF Pe-1 = 10,000. Clearly, py—s # 10,000, since the
maximum value of g(z) is 2500. This, if pe = 0, then pat, Pi =
0. A contradiction to the hypothesis pp = 1. Therefore, po > pi >
*°> Pa > Pret >
(b) By way of contradiction assume there exists & such that ps <0. It
follows that:
ssn) <0
—0.000173_; + 7-1 < 0
(-0.0001p)-1+1)pj-1 <0
From part (a); ifpj1 = 0, then pr #0. Thus pj1 #0. If pj.1 <0,
then
0.00017; +1
Bi
vw
10,000,
‘ contradiction. If pj > 0, then
-0.0001pj-1+1 2 0
Pi S 10,000,
4 contradiction. Therefore, pq > 0 for all n
(©) litt co Pa = 0
9. (a) 9(8) = (0.5)(8) +1.
(6) [P~ pal = [8 1.5 ~05pe-1
$IP = Pn-al
[1.5 ~ 0.5pn—1] = 313 — Pal = ISCHAPTER 2. THE SOLUTION OF NONLINEAR EQUATIONS F(X) = 0
(©) Using mathematical induetion we note that [P—ps| = $/P—po| and
asinine that [P — px| = de|P — pol. Thus
Pomel = 2y
pd
= oa
10. (8) Note: pr = po/2, pa = Po/2*,-.. Pes = po/2***,.... Thus
Wags
IPesal
“preteens eka ay
PH ae
(b) Clearly, the stopping criteria will (theoretically) never be satisfied
11, In inoquality (11): [P ~ pal < K"|P ~ pol, where [g(2)] 0, £(0) <0, and (3) > 0; thus roots lic in the intervals
{-3,0) and 0,3}.
(b)_ S(@/4) > 0 and f(2r/2) < 05 thns a root lies in the interval [n/4, 7/2]
(©) £8) <0 and f(6) > 0; thus a root les iu the interval [3,5].
(@) £(8) > 0, £(5) < 0, and f(7) > 0; thus roots lie in the intervals [3,5]
and (5,7)
[-24,~1.}, [-2.0, 16}, [-2.0, -1.8), [-1.9, ~1.8),[-1.85, -1.80]
(0.8, 1.6}, 1.2, 1.6}, 1.2, 1.4, 1.2,1.3), (1.25, 1.30]
(8.2.4.0), [8.6, 4.0, [3.6,3.8}, 3.6,3.7), (3.65, 3.70]
7. (60,68), (64,68), (6.4, 6.6), 6.5,6.5], (6.40, 6.45) 22. BRACKETING METHODS FOR LOCATING A ROOT 19
8. (a) Starting with ay < bo, then either a = ag and bj = “88%, or
a; = $2540 and by = bo. In either case we have a) 19.89735
Thus N = 30. 20CHAPTER 2. THE SOLUTIGN OF NONLINEAR EQUATIONS F(X) =0
2.
13,
u4
oh Fepltae bat)
= bnlflbn) = (09) = f(bn)(bn = on
On) — Flan.
= =bafldn) + anf (bn
= fla) = Tan)
= Maf ln) ~ ba f (an
Tin) ~ Fn)
Beal <6
n(Bett) < me,
sinc in isa steity nerasing fnetion. hes
In(b—a)—(N-+1)In(2) <_ Ins)
h
‘Therefore, the sinallest value of N is
at (xe =25 8)
‘The bisection method can't converge to 2 = 2, unless e = 2 for some
n>l
N
We refer the reader to "Which Root Does the Bisection Algorithm Fiud?"
by George Corliss, Mathematical Modeling: Classroom Notes in Applied
Mathematics, Murray Klankin Ed, SIAM, 1987.
2.3 Initial Approximation and Convergence Cri-
tel
Approximate root location ~0.7. Computed root —0.7034674225.
Approximate root location 0,7. Computed root 0.7300851382.
Approximate root locations ~1.0 and 0.6. Computed roots ~ 1.002966954
and (.6348668712, 24, NEWTON-RAPHSON AND SECANT METHODS a1
4. Approximate root locations 41.8, Computed roots +1,807375379,
5. Approximate root locations 14 and 3.0, Computed roots 1412391172 and
3.057103550.
6. Approximate root locations 1.2 and 0.
2.4 Newton-Raphson and Secant Methods
1. (8) pe = pen ~ pcre?
©
2 (8) Pe = pana — Pegi?
(b)
©
3. (@) Pe = Pes — H(Pr—1 — 1)
(b)
Po
PL
Po
Ps
Pa
Po
rm
Pa
Ps
“15
0.0625,
1.7743,
0.4505
16
2.52727
2.31521
2.30282
00
3.0
1.7143
1.3416
13410
21
2.075
2.05625
2.421875
2.031640625
(©) Convergence is linear. The error is reduced by a factor of # with each
iteration, 22CHAPTER 2. THE SOLUTION OF NONLINEAR EQUATIONS F(X) = 0
4 (0) m= — Bg?
©)
Ps
mB
(0) Convergenee is quadrstic.
(roughly) doubles with eae
21
2.00606062
2.00002434
= 2.000000
= 2.000000
The number of accurate decimal places
th iteration
‘The sequence {pe} converges to —
‘The sequence {pr} converges to SE.
: aT
1) 3 1.01525.
) a.7ou49
6. (@) pe= mea ~ (149+ k- 19) arctan(py-1)
() i.
Ui, Titn sao Pe = 0.0
© i
po= 1.0
pr = -0.570796327
~0.116859904
Ps = ~0.001061022
Ps = 0.000000001
m=20
p= ~3.535743590
Pa = 13,95095909
Ps = ~279.344667
a = 122016.9990
fi, The sequence is a case of divergent oscillation
1 (a) = pea = Beaty
(b) i
ii Liga Pk = 0.0
Po = 0.20
0.05
—0.002380952
a = ~0.000005655
—0.000000000 24.
10.
L
12,
NEWTON-RAPHSON AND SECANT METHODS 23
(©)
200
21,05263158
22.10250034
23.14988809
24.19503505
SEES
ii, Limp soo Pk = 08
(4) J(p4) = 0.00000000075:155
Pa = 241935484, py = 2.41436464
). pa = 246371308, ps = 2.270278
‘Pa = ~1.52140264, ps = ~1.52137968
Following the procedure outlined in Corollary 2.2, we assume that Ais a
real uumber and find the Newton-Raphson iteration function g(r) for the
function f(z) = 3 — A, Thus
rr)
os
os
Now let pp be an initial approximation to YA. Thus the Newton- Raphson
iteration is defined by
for k= 1,2,
() Va
(b) Following the procedure outlined ir: Corollary 2.2, we assume that A
is an appropriate real number and find the Newton-Raphson iteration
fumetion g(r) for the fianetion f(2) = 2% — A, Thus
a)
Now let po be an initial approximation to YA. Thus the Newton-
Raphson iteration is defined by 24CHAPTER 2. THE SOLUTION OF NONLINEAR EQUATIONS F(X) =
for k= 1,2,
13. No, because f(2) has no real zeros.
14. No, because f"(1) is not continuous at the root 2 = 0.
15, No, because f(r) is not defined on an interval about the root 2 ~ 0.
16. From (12) and (13) we see that (11) is the Newton-Raphson recursive rule
for the function f(x) = x? — A. The zeros of f are VA. It follows from
‘Theorem 2.5 that there is a po such that (11) converges to VA.
17. (a) o(p) = p— p which implies that -7B = 0, which implies
that f(p)
0) gp) =1~ Lease HL — tre 0, Since 9) =
O and g'(p) is a continous function, choose ¢— 1. Then there exists
an interval (p—d,p+d) in which |g'(2)| < c or |g'(2)| < 1. Therefore,
‘Theorem 2.2 implies that ltqsge Pa = P.
18. (a) Given
O= Flow) +S PaN(o— ve) + FI" Day?
then
$00) + FN—m) = Fy" ea)lo~ pe)?
fm) _ Pa)
mit get = - omy
(8) The ast expression in part (a canbe writen as
_fe)) _ _ tte)
~(» FB) = “To Le
FB 0- my
Assuming f"(px) ~ f"ip) and f"(ee) & J"(p) when k is sufficiently
lange yields
PoP =
pom & Ppp?
a LO) pg,
Fa © a7) Pe
i one
aro 24, NEWTON-RAPHSON AND SECANT METHODS 5
19. (a) I1/4
You might also like
