Scribd
Upload
9 views2 pages

Nonlinear Equations I Problem Sheet

The document is a problem sheet for MATH2033, focusing on nonlinear equations and the bisection method. It contains six problems that require students to find approximations to zeros of given functions, prove the existence of zeros, and analyze the error bounds of the bisection method. The problems also address the careful application of stopping criteria 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 I Problem Sheet

The document is a problem sheet for MATH2033, focusing on nonlinear equations and the bisection method. It contains six problems that require students to find approximations to zeros of given functions, prove the existence of zeros, and analyze the error bounds of the bisection method. The problems also address the careful application of stopping criteria 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 I

PROBLEM SHEET

Problem 1
Use the bisection method to find the approximations p1 , p2 and p3 to the zero
√
of f that lies in the interval [0, 1] for f given by f (x) = x − cos(x), where
pn is the approximation obtained after performing n iterations of the bisection
method, starting from the initial interval [0, 1].

Problem 2
Let f be given by f (x) = 2 tan(x) − 3x.
π π

a Prove that f has a zero in the interval ,
6 3
.

b Use the error bound for the bisection method to determine a number of
iterations that will guarantee that the absolute error in the approximation pn
is less than or equal to 10−6 , where pn is the approximation to the zero of
f that lies in π6 , π3 obtained after performing n iterations of the bisection
 

method, starting from the initial interval π6 , π3 .


 

Problem 3
Use the error bound for the bisection method to determine a number of iterations
that will guarantee that the absolute error in the approximation pn is less than or
equal to 10−2 , where pn is the approximation to the solution p of p3 − p − 1 = 0
that lies in [1, 2] obtained after performing n iterations of the bisection method,
starting from the initial interval [1, 2]. Use the bisection method to obtain an
approximation to p which is such that the absolute value of the error in the
approximation is less than or equal to 10−2 .

Problem 4
Can the bisection method be used to find approximations to zeros of f when f
is given by

−1 if x ≤ 0
a f (x) = ?
1 if x > 0

b f (x) = | cos(x)|?

Page 1 of 2
Problem 5 n
X 1
a Let pn = for all positive integers n. Note that the sequence {pi }∞
i=1
k=1
k
diverges. What is lim |pi+1 − pi |?
i→∞

b Explain why one must be careful when using |pi+1 − pi | ≤ ε as a stopping


criterion for an iterative method.

Problem 6
Suppose that a ∈ R, that b ∈ R and that a < b. Suppose that f is a function
that is real-valued and continuous on [a, b] and that f (a)f (b) < 0. Let pn be the
approximation obtained after performing n iterations of the bisection method,
starting from the initial interval [a, b]. Prove that, for all positive integers n,

|p − pn+1 | ≤ |pn+1 − pn |

for at least one p ∈ [a, b] satisfying f (p) = 0.

References

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

– Section 2.1

Page 2 of 2

You might also like