ES361 Spring 2014-2015 Homework 1

Due: April 15 (section 5)-16 (section 1), 2015

You must turn your work in the class (20% / day reduction after the class for any reason
except legal reasons)
Homework must be your work. Disciplinary action will be taken for those who submit
copied homeworks.
Present your work in print and in a clear format with tables and figures, where necessary.
1. Derive the following backward and centered finite-divided-dierence formulas for the
third derivative:
( ) 3 (1 ) + 3(2 ) (3 )

3
(+2 ) 2(+1 ) + 2 (1 ) (2 )

000 ( ) =
23

000 ( ) =

Guesstimate and derive forward dierence formula for the third derivative as well.
Find the order of the approximation for each one of them. Comment which one is
more accurate.
2. Fixed-Point Iteration: Consider the simple nonlinear equation () = 2 3 + 1 = 0
Knowing that this equation has two roots 26180 or 0382.
(a) First consider the following iterative formula: +1 = ( ) = 13 (2 + 1)
(b) Now consider the following iterative formula: +1 = ( ) = 3 1
with the initial points 0 = 02, 0 = 1, and 0 = 3.
(c) Discuss and investigate the practicability of the fixed-point iteration showing
graphically for each case.
3. The following three methods are proposed to compute 2113 :
1 () =

20 +
21

21
2

2 () =

3 21

32

3 () =

6 213
2 21

(a) Show that each of the functions () ( = 1 3) has a fixed point at = 2113
i.e. = ( )
(b) Perform the iterations, +1 = ( ) numerically using the initial guess of 0 =
15
(c) Explain the convergence behavior, obtained above, analytically.
Note: Recall that the scheme +1 = ( ) is convergent when |()| 1 and is
said to have order of convergence when () () = 0
for
= 1 2 1
()
while () 6= 0 ( is the fixed point).
4. Given () = sin (2)2 = 0; sketch the function, find its positive root correct to
5 significant digits by bisection and secant methods.
1

5. For finding a simple root of () = 0, consider the recursion formula

0

+1 = (1+1 + 2+1 ) with 1+1 = ; 2+1 =

0

where = () ()Prove that if the sequence {0 1 } suggested converges, then

the convergence would be cubic.
6. Find the positive root of () = sin (2)2 correct to 5 significant digits by (i)
the regular Newtons method (ii) the formulas given in question 5; take the initial
approximation as 0 = 15 and compare the number iterations in (i) and (ii).
7. Solve the system = using (a) standard Gauss elimination method, (b) using
decomposition of the coecient matrix ; where

-1
2 -1 0 0 0
-2
-1 2 -1 0 0

=
0 -1 2 -1 0 and = -3
-2
0 0 -1 2 -1
-1
0 0 0 -1 2
8. Show that the use Newtons method for finding 1 (where "" and "" are some
positive given numbers) leads to
+1 =

( 1) + +1

; = 0 1

Using this recursion formula compute 1613 correct to 4 significant digits.

9. Determine roughly an interval which contains the first positive root of
sin + cos(2 + 1) 1 = 0
Compute the root so that % relative error0.0005.
10. Consider the equation: () = cos ln = 0 Graphically estimate the root in the
interval [01 16] Determine the root by: bisection method and Newtons method for
4 significant digits accuracy