Scribd
Upload
10 views1 page

MA 214 Tutorial 9

Uploaded by

mugdha
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
10 views1 page

MA 214 Tutorial 9

Uploaded by

mugdha
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/ 1

Tutorial Sheet 9

Fixed Point Methods

1. Consider f : [1, 2] → R defined by x4 − x − 10. Using fixed point


iterative method find an approximate root of f in [1, 2].

2. The function ex −sin2 (x)−1 vanishes at x = 0. Compute it’s multiplic-


2

ity and use modified Newton- Raphson method to find the approximate
root after 3 iterations, taking intial value x0 = 0.1.

3. Give an example of a function f : R → R such that the equation


f (x) = 0 has an isolated real root with the condition that the Newton-
Raphson method converges but does not have quadratic convergence.

4. To solve the nonlinear equation e−x − cos x = 0 by fixed-point iteration


method, the following fixed-point formulations may be considered.
(i) x = − ln(cos x) (ii) x = cos−1 (e−x )
Discuss about convergence of the fixed-point iterative sequences gen-
erated by the two formulations.

5. Let α ∈ R and β ∈ R be the roots of x2 +ax+b = 0, and such that |α| >
|β|. Let g and h be two iterating functions satisfying the hypothesis of
the theorem on fixed-point method. Consider the iterative sequences
{xn } and {yn } corresponding to two the iterating functions g and h
given by
axn + b b
xn+1 = − , and yn+1 = −
xn yn + a
respectively. Show that the iterative sequences {xn } and {yn } converge
to α and β respectively.

You might also like