Scribd
Upload
9 views2 pages

Nonlinear Equations III Problem Sheet

The document is a problem sheet for MATH2033, focusing on methods for solving nonlinear equations. It includes problems that require the application of Newton's method, the secant method, and the method of false position to find approximations to the roots of the function f(x) = x² - 6. Additionally, it discusses the derivation of Newton's method and provides a theoretical framework for error analysis in iterative methods.

Uploaded by

王健
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
9 views2 pages

Nonlinear Equations III Problem Sheet

The document is a problem sheet for MATH2033, focusing on methods for solving nonlinear equations. It includes problems that require the application of Newton's method, the secant method, and the method of false position to find approximations to the roots of the function f(x) = x² - 6. Additionally, it discusses the derivation of Newton's method and provides a theoretical framework for error analysis in iterative methods.

Uploaded by

王健
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

MATH2033 (2023–2024)

Introduction to Scientific Computation

Nonlinear Equations III

PROBLEM SHEET

Problem 1
Let f be given by f (x) = x2 − 6. Use Newton’s method, with an initial ap-
proximation of 1, to find the approximation p2 to the zero of f that is positive,
where p2 is the approximation obtained after performing 2 iterations of Newton’s
method.
Problem 2
Let f be given by f (x) = x2 − 6.
a Use the secant method, with initial approximations of p−1 = 3 and p0 = 2,
to find an approximation p2 to the zero of f that is positive, where p2 is an
approximation obtained after performing 2 iterations of the secant method.

b Use the method of false position, with initial approximations of 3 and 2, to


find the approximation p2 to the zero of f that is positive, where p2 is the
approximation obtained after performing 2 iterations of the method of false
position.
√
c Which method resulted in the approximation that is closer to 6?

Problem 3
Suppose that a ∈ R, that b ∈ R and that a < b. Suppose that f is a function
that is real-valued and twice differentiable on [a, b], that p ∈ [a, b] is such that
f (p) = 0 and that pn−1 ∈ [a, b] for all positive integers n. For all positive integers
n such that pn−1 6= p, by Taylor’s Theorem, there exists ξ between p and pn−1
such that
1
f (p) = f (pn−1 ) + f 0 (pn−1 )(p − pn−1 ) + f 00 (ξ)(p − pn−1 )2 .
2
Derive the formula for Newton’s method by assuming that |p − pn−1 | is small
enough that 12 f 00 (ξ)(p − pn−1 )2 can be neglected.

Problem 4
Suppose that a ∈ R, that b ∈ R and that a < b. Suppose that f ∈ C 2 [a, b] and
that p ∈ (a, b) is such that f (p) = 0 and f 0 (p) 6= 0. Let pn be the approximation

Page 1 of 2
to p obtained after performing n iterations of Newton’s method, starting from the
initial approximation p0 . There exists δ > 0 such that [p − δ, p + δ] ⊂ [a, b],
f 0 (x) 6= 0 for all x ∈ [p − δ, p + δ] and pn ∈ [p − δ, p + δ] for all positive integers
n for any initial approximation p0 ∈ [p − δ, p + δ]. Show that, for all nonnegative
integers n,
M
|p − pn+1 | ≤ |p − pn |2
2
where
max |f 00 (x)|
x∈[p−δ,p+δ]
M= .
min |f 0 (x)|
x∈[p−δ,p+δ]

References

• Burden, Faires & Burden, Numerical Analysis, 10E

– Section 2.3

Page 2 of 2

You might also like