


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Solutions to problem 1 and 3 from writing assignment 03 of the che/cosc/math 4340-01 numerical analysis course. It explains how to find the reciprocal of a number using newton's method without division or exponentiation and derives an algorithm for it. Additionally, it discusses the number of steps required to obtain the root with accuracy 10−8 when applying newton's method to find the square root of 1. Furthermore, it explains how to find a fixed point of a function using newton's method.
Typology: Assignments
1 / 4
This page cannot be seen from the preview
Don't miss anything!
Solution of Writing Assignment 03 Due Date: Tuesday, 02/12/
To compute reciprocals without division, we can solve x = 1/R by finding a zero of the function f (x) = x^1 − R. Derive a short algorithm to find 1/R by applying Newton’s method applied to f (x). Do not use division or exponentiation in your algorithm. For positive R, what initial iterates are suitable?
Answer: Notice that f ′(x) = −x−^2. Newton’s method for this function reads
xn+ 1 = xn − x
− n 1 − R −x− n^2 = xn + x^2 n(x− n 1 − R) = 2 xn − Rx n^2.
Thus the Newton’s method is simplified as xn+ 1 = xn( 2 − Rxn). Now suppose R is a positive number.
If Newton’s method is used with f (x) = x^2 − 1 and x 0 = 1010 , how many steps are required to obtain the root with accuracy 10−^8? Answer: Newton’s method applied to this f reads
xn+ 1 = xn − x
(^2) n − 1 2 xn^ =^
x^2 n + 1 2 xn^.
We know that there are r = −1 and r = 1 are zeros of f (x) that are simple, so we may expect that if the iterates are close enough to the neighborhood of one of the zero, then Newton method will exhibit a quadratic convergence, namely |en+ 1 | ≤ C|en|^2 ,
where C = 12 f^
′′(r) f ′(r). Suppose now that x 0 = 1010. Since this is a positive number, we may expect that Newton’s method will converge to r = 1. However, initially it will not exhibit a quadratic convergence because x 0 is clearly much far away from r = 1. In particular, writing en = xn − 1, we have
en+ 1 = x
(^2) n + 1 2 xn^ −^1 =^
x^2 n + 1 − 2 xn 2 xn^ =
(xn − 1 )^2 2 xn^ =^
e^2 n 2 xn^.
At the initial stage when the iterates are still very large, we know that en ≈ xn and thus,
|en+ 1 | = |en|
2 2 |xn| ≤
|en| 2 ,^ (0.1)
i.e., we only have a first order convergence. The question is how close xn should be when it will gain quadratic convergence. We think that xn is close enough already if |en| < 1. Thus before |en| < 1, we should expect the method to have first order convergence. By induction argument we see that (0.1) yields
|en| < |e 20 n|.
Setting this inequality to be less than 2, yields
|e 0 | 2 n^ <^1 ,
which gives 1010 < 2 n.
If we attempt to find a fixed point of F(x) by using Newton’s method, what iteration formula would you get? Answer: A number x is a fixed point of F if x = F(x). Now choose G(x) = x − F(x). Then finding a fixed point of F is equivalent to finding a zero of G. Notice that G′(x) = 1 − F′(x). Application of Newton’s method gives xn+ 1 = xn − x 1 n −^ − F^ F′((xxnn)) = xn^ −^ xnF
′(xn) − xn + F(xn) 1 − F′(xn) = F(xn)^ −^ xnF
′(xn) 1 − F′(xn)