You are on page 1of 15

4.

6 Newton’s Method HW
3. Suppose the tangent line to the curve y = f(x) at the point (2, 5) has the equation y = 9 - 2x. If
Newton’s method is used to locate a root of the equation f(x) = 0 and the initial approximation is
x1 = 2, find the second approximation x2 .

f (la )
-

xn
-

in newton method xuf =

fixn)
x
(
= 2 fix ) 2 f ( x( ) =
5
=


-
x
=
2
25
-
=
29
7. Use Newton’s method with the specified initial approximation x1 = 1 to find x3 , the third
approximation to the root of the equation x5 - x - 1 = 0. Give your answer to four decimal places.
)
f ( cn )
in nenton mcthdxa 디 = Cn
- f ( xn
fx ) = x 머 fk )= 5
x4
- 1

t )=

fxs
u -
=
π= . 4
fiuy
=

) -= 가

)
t) m1
.
finy
K -

-
tn - 45 2807
-
- 11 n
8%
의=
p
5
11. Use Newton’s method to approximate the 20 correct to eight decimal places.

50 : s rootof7 x5
- 20

fn) =
5
)( -

20 fx =
)
57 x
4
21

<≤
, ,

ve suppose x =
2 and use hewton heth인
-

>

xK = 2

x = 1 85
또 -

x
5
= 1 .
8214861369967
x4 8205651358162
-
= 1

52 182056420
.
x -
5 1
82056420307 .

: =

'x
6 ÷ 1 -
820564203026
13. Use Newton’s method to approximate the root of the equation x4 - 2x3 + 5x2 - 6 = 0 in the
interval [1, 2] correct to six decimal places.
. 6xz tloc
x
fi
'
t 5 x≥ 6
4
f (지 =
x -

2x .
) =
4)
3

> we
supposc K 녀 and use newtonmethodto
appgokimateootof )
f


x
(

x2 1 -
25
=

x
3
= 1 .
218214285
xe : 12 1756242 (
(
:ot off ( r ) is 217562
.

565 = 12 ( 175621547 1
23. (a) Apply Newton’s method to the equation x2 - a = 0 to derive the following square-root
p
algorithm (used by the ancient Babylonians to compute a) :
✓ ◆
1 a
xn+1 = xn +
2 xn
p
(b) Use part (a) to compute 1000 correct to six decimal places.
al ) fal =
xza fin) = 2) x -
+ 1u xn
, a

내사t 국가세 -
내 xn
)
=씨 -

=
fikuy -

일차 대관랍대 ) =
코( utpva )
b) 1 ooo et hewton thethodfoappo'roXimatefootoffy
:
a and x = 32 ue
,

L = 32
(

)x =
31 6255
31 6227 매
2
.

31 62217176679 root ot fl)


=
x : :
3
.

xK = 31 62271766 이
.
1 역수
24. (a) Apply Newton’s method to the equation - a = 0 to derive the following reciprocal algorithm :
x -

xn+1 = 2xn - ax2n

(This algorithm enables a computer to find reciprocals without actually dividing.)


1
(b) Use part (a) to compute correct to six decimal places.
1.6984
methd
al) fo =
)
it -
a fdx )
x =
2
b 버 ewton

xnt -

a 로

axa
=

)cuw
x에 xn ~

xnt xn axn 2
-
-

= =


bl ) a = 66984 xi = o
5

x 588239
7
xe
= 0
588989
x2 588465 = 0
.

0 .-
3
-

x5 0 - 588 n 89
=

- 0 .

588789

28. Use Newton’s method to find the absolute minimum value of the function f(x) = x2 + sin x correct
to six decimal places.

지있다
fi 2 )1 tcosx
)
9 v
=
.

= 2) L
-

coscl)

: absolute minimum valve


exist [ ) ]
0
sinx
gK ) 2
-

) 2) ( tcosn
gy
-

, = =

(7 )
and Let fot of y
x
(
t
,
use henton methodto approdimate the
디더
x2 - 0
4862880
iS f (
=
0
∴ absolute minimum 450184 )
.

450418 60
-

0
x
.
=
-

3
-

45018 362
xez
-

0
1 2
.

45018361
232466
0
x 0 .
- -

=
=
-

5
àÌ

3. y = f(x) X ⇣ (2, 5) –⌧X ⌘ D y = 9 - 2x | Xê. f(x) = 0 X ¸D >0 ⌅t t4 )ïD


¨©X‡, 0 ¸¨t| x1 = 2| Xê. P ௠¸¨t x2 D lXÏ|.
7. ) › x5 - x - 1 = 0 X 0 ¸¨t| x1 = 1 t| ` L t4 )ïD ¨©XÏ 8 ௠¸¨t x3 |
lX‹$. å⇠ 7¯ ê¨L¿ ıD lX‹$.
p
5
11. t4 )ïD t©XÏ 20 X ¸ø✓D å⇠ Ï_¯ ê¨L¿ lX‹$.
13. t4 )ïD t©XÏ ) › x4 - 2x3 + 5x2 - 6 = 0 X l⌅ [1, 2] –⌧X ¸¨t| å⇠ Ï/¯
ê¨L¿ UXå lX‹$.
p
23. (a) ) › x2 - a = 0 – t4 )ïD ©XÏ ‰L ⌧Ò¸ L‡¨ò (‡ L\»D ¨å‰t a
| lX0 ⌅XÏ ¨©\) D ƒX‹$.
✓ ◆
1 a
xn+1 = xn +
2 xn
p
(b) (a) X ›D t©XÏ 1000 X ¸ø✓D å⇠ Ï/¯ ê¨L¿ UXå lX‹$.
1
24. (a) ) › - a = 0 – t4 )ïD ©XÏ ‰L Ì⇠ L‡¨òD ƒX‹$.
x
xn+1 = 2xn - ax2n

(t L‡¨òD t©XÏ ÙË0î ¡⌘ ò⌅¿ J‡ƒ Ì⇠| l` ⇠ à‰.)


1
(b) (a) X ›D t©XÏ X ¸ø✓D å⇠ Ï/¯ ê¨L¿ UXå lX‹$.
1.6984
28. t4 )ïD t©XÏ f(x) = x2 + sin x X \ü✓D å⇠ Ï/¯ ê¨L¿ UXå lX‹$.

You might also like