Scribd
Upload
77 views

CS3113 Numerical Methods Assignment 2

This document provides instructions for Numerical Methods Assignment 2. It lists 5 problems to solve involving the Bisection Method, finding fixed points, and applying Newton's Method. Students are reminded to show all work to receive full credit and the assignment is due on October 19 by 8:30 am.

Uploaded by

TianyuLiu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
77 views

CS3113 Numerical Methods Assignment 2

This document provides instructions for Numerical Methods Assignment 2. It lists 5 problems to solve involving the Bisection Method, finding fixed points, and applying Newton's Method. Students are reminded to show all work to receive full credit and the assignment is due on October 19 by 8:30 am.

Uploaded by

TianyuLiu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS3113 Numerical Methods

Assignment 2
Remember to include all sub steps to show your work. Not doing so will result in a penalty!
Due Date: October 19, 8:30 am

1
Consider the equation x4 = x3 + 10
(a) Find an interval [a,b] of length one inside which the equation has a solution.
(b) Starting with [a,b], how many steps of the Bisection Method are required to calculate the solution within
1010 ? Answer with an integer and show how you compute your response.

2
Use the Bisection Method to find the root to eight correct decimal places. (You will need a calculator.)
(a) x5 + x = 1

(b) sin(x) = 6x + 5

(c) ln(x) + x2 = 3

3
Find all fixed points of the following g(x)
(a)

3
x

(b) x2 2x + 2

(c)

8+2x
2+x2

4
Find each fixed point and decide whether Fixed-Point Iteration is locally convergent to it
(a) g(x) = x2 32 x +

3
2

(b) g(x) = x2 + 21 x

1
2

5
Apply two steps of Newtons Method with initial guess x0 = 1.
(a) x4 x2 + x 1 = 0

(b) x2 +

1
x+1

3x = 0

(c) x3 + x2 1 = 0

You might also like