Scribd
Upload
4 views2 pages

Q1

The document presents a problem involving the intersection of two functions, f1(x) = 3.9x and f2(x) = 7 sin(7x), and formulates it as a nonlinear equation f(x) = 3.9*x - 7*sin(7*x). It discusses the requirements and convergence theory for solving this equation using Newton's method, including the need for a starting value, the evaluation of derivatives, and the proximity of the starting value to a simple root. Additionally, it provides estimates for error in iterations and the number of steps required to achieve a desired error threshold.

Uploaded by

Radwan bu haram
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views2 pages

Q1

The document presents a problem involving the intersection of two functions, f1(x) = 3.9x and f2(x) = 7 sin(7x), and formulates it as a nonlinear equation f(x) = 3.9*x - 7*sin(7*x). It discusses the requirements and convergence theory for solving this equation using Newton's method, including the need for a starting value, the evaluation of derivatives, and the proximity of the starting value to a simple root. Additionally, it provides estimates for error in iterations and the number of steps required to achieve a desired error threshold.

Uploaded by

Radwan bu haram
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

(a) [2 marks]

Consider the problem of finding the points of intersection of f1 (x) = 3.9x and f2 (x) = 7 sin(7x).
Formulate this as a problem of solving a nonlinear equation f(x) = 0 .

f(x) = 3.9*x-7*sin(7*x)

Hint: You can use the functions sin, cos, tan, log (for natural logorithm), and exp (rather than e^x). Use ^
for power Remember to type the multiplication symbol * whenever appropriate. Use the preview to double
check your answer.

(b) [4 marks]
You are asked to solve a nonlinear equation f(x) = 0 on an interval [a, b] using Newton's method.

(i) How many starting values does this iterative method require?

(ii) Does this iterative method require explicit evaluation of derivatives of f ?

No

Yes

(iii) Does this iterative method require the starting value(s) to be close to a simple root?

Yes
No

(iv) What is the convergence theory for this iterative method?

If f ∈ C 2 ([a, b]) and the starting point x 1 is sufficiently close to a


simple root in (a, b) , then this iterative method converges
quadratically.

If f(x) = 0 can be expressed as x = g(x) , where g ∈ C 1 ([a, b])


and there exists K ∈ (0, 1) such that |g ′ (x)| ≤ K for all
x ∈ (a, b) , then this iterative method converges linearly with
asymptotic constant β ≤ K for any starting point x 1 ∈ [a, b] .

If f ∈ C 2 ([a, b]) and the starting points x 1 and x 2 are sufficiently


close to a simple root in (a, b) , then this iterative method converges
superlinearly with order ν ≈ 1.6.

If f ∈ C([a, b]) and f(a)f(b) < 0, then, with the starting point

x1 = a+b , this iterative method converges linearly with asymptotic


2
constant β = 0.5.

(c) [4 marks]
Assume that the nonlinear problem in part (a) has been formulated so that the conditions required for the
convergence theory of Newton's method in part (b) are satisfied.
Let x ∗ denote the target solution, and for each k = 1, 2, … let x k denote the k th iterate and define
ek := |xk − x∗ |. Suppose we know that e2 ≈ 0.95.

(i) Estimate the error e5 . Give your answer to 2 significant figures.

e5 ≈ 0.664

(ii) Estimate the number of further steps required for the error to satisfy e2+m ≤ 10−13 .

m≈ 9.18878

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy