Question: 2 0 7 2 U ASSIGNMENT 2 , 2 0 2 4 Iteration and recursion Due: February 2 nd , 1 7 : 0 0

2
0
7
2
U
ASSIGNMENT
2
,
2
0
2
4
Iteration and recursion
Due: February
2
nd
,
1
7
:
0
0
.
Push the function for Steffenson's iteration for
2
(
a
)
and a script for
2
(
b
)
to your assignmment repository. Make sure to use the input
/
output specified in the templates and check the result of the autograder. Typset your solution for question
1
in LaTeX and push botht the
.
tex and the
.
pdf file to your repository.
Make sure all files submitted include a comment line with your name and student number, e
.
g
.
# Peter Peterson
1
0
0
4
5
6
7
8
9
and list the names and student numbers of class mates you collaborated with, if any.
Also, be a good programmer and include comments with a brief description of the functionality, input and output arguments and usage of each function or script. Also, add some comments that explain what steps are taken. Marks will be awarded or subtracted based on the readability and transparency of your code.
A discussion thread for this assignment is available on Slack. Pose your questions there before approaching the lecturer or TA
.
Question
1
5
0
marks
You wish you use bisection for finding a root of the continuous functions below. For each function, use tools from calculus to find a domain
(
a
,
b
)
that contains precisely one root
(
so that you satisfy the sufficient condition for bisection to converge
)
.
if the function has more than one root, select the one closest the to origin.
Note that, while looking at a graph is a good starting point, it is not sufficient.
(
a
)
f
(
x
)
=
(
x
1
)
cos
(
x
)
+
1
/
2
(
b
)
f
(
x
)
=
x
2
+
1
x
3
(
c
)
f
(
x
)
=
xln
(
x
)
2
x
+
x
2
+
1
(
d
)
f
(
x
)
=
1
/
(
x
+
1
)
2
+
4
/
(
x
+
2
)
2
-
1
(
e
)
f
(
x
)
=
exp
(
x
3
+
x
2
)
1
/
1
0
Question
2
(
a
)
Write a function that implements the following pseudo
-
code: Input: f
,
f
'
,
x
,
,
N
.
Output: x
*
.
1
.
Repeat N times:
(
a
)
Set y
1
=
x
.
(
b
)
Take one Newton step, starting from y
1
.
Call the result y
2
.
(
c
)
Take one Newton step, starting from y
2
.
Call the result y
.
(
d
)
Set
5
0
marks
x
=
y
(
2
3
1
)
Y
3
-
2
y
2
+
Y
1
(
e
)
Display
|
f
(
x
)
|
.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!