Scribd
Upload
2 views

Assignment4-cse330_Fall2023

The document outlines Assignment-4 for CSE 330, which consists of three main problems related to finding roots of functions using various methods such as the Bisection Method and Newton's method. It includes tasks such as computing iterations, showing convergence rates, and applying Aitken's acceleration. The assignment is structured to evaluate understanding of numerical methods with specific error bounds and significant figures.

Uploaded by

mbkauser
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
2 views

Assignment4-cse330_Fall2023

The document outlines Assignment-4 for CSE 330, which consists of three main problems related to finding roots of functions using various methods such as the Bisection Method and Newton's method. It includes tasks such as computing iterations, showing convergence rates, and applying Aitken's acceleration. The assignment is structured to evaluate understanding of numerical methods with specific error bounds and significant figures.

Uploaded by

mbkauser
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

CSE 330: Fall 2023

Assignment-4 [CO4]
Total Marks: 30
3 2
1. Consider a function f(x) = 𝑥 + 𝑥 − 4𝑥 − 4.

(a) (1 marks) Compute the minimum number of iterations required to find the root within the
interval [-10, -1.5] if the machine epsilon(error bound) is 1 × 10^−2.

(b) (4 marks) Show 5 iterations using the Bisection Method to find the root of the above function
within the interval [-10, -1.5].

(c) (2 marks) State the exact roots of f(x) and construct two different fixed point functions g(x)
such that f(x) = 0.

(d) (3 marks) Compute the convergence rate of each fixed point function g(x) obtained in the
previous part, and state which root it is converging to or diverging.

𝑥
2. Consider the following function: f(x) = 𝑥𝑒 − 1.
(a) (5 marks) Find solution of f(x) = 0 up to 5 iterations using Newton’s method starting with
x0 = 1.5. Keep up to four significant figures.

2𝑥+1
(b) (5 marks) Consider the fixed point function, g(x) = . Show that to be super-linearly
𝑥+1
−3
convergent, the root must satisfy x* = 2
.

2
3. (a) (4 marks) Consider the function f(x) = 𝑥 − 𝑥 + 1 and starting point x0 = 0. Show that the
sequence using Newton’s method x1, x2, · · · fails to approach a root of f(x).

(b) (6 marks) Consider the function f(x) = cos(2x) − sin(x). Compute the root of the function
using Newton’s method with Aitken’s acceleration and starting point, x0 = 0. Consider up to five
decimal places.[Error bound is 1 × 10^−3] [Must use Radian Mode of calculator]

You might also like