Lab1_FixedPointMethod
Lab1_FixedPointMethod
Name:
1 Instructions
• Make a pdf report including the solution to each point of the practice with name
Lab1 name lastname.pdf.
• Send the report and all created files in a zip file with name Lab1 name lastname.zip in the
Moodle.
• You are allowed to use internet, notes, and .m files that you have created before.
• It is PROHIBITED to use Large Language Models (LLMs) or share the code with classmates.
2 Purposes
• To understand the fixed point method
• To apply the fixed point method.
• To implement the fixed point method in Matlab.
3 Practice
3.1 Understanding
Answer with your own words the following questions:
• (0.2 points) What is a fixed point?
1
• (0.2 points) What applications does the fixed point method have?
• (0.2 points) What condition must be satisfied to guarantee that a function has a fixed point?
• (0.2 points) What condition must be satisfied to guarantee that the fixed point is unique?
3.2 Applying
(0.5 points) Use the fixed point iteration to find a fixed point for g(x) = 1 − x2 /4 on [0, 1]. Do five
iterations by hand. Choose the initial point.
Initial point p0 :
k 0 1 2 3 4
pk
g(pk )
3.3 Implementing
• (0.5 points) Create a Matlab function called my fixed point function name lastname() to find
a fixed point of a function over a given range. The arguments of the function must be:
the function to be evaluated g(x) (as an inline function), the initial point of the range a,
the final point of the range b, the initial iteration point p0 , and the desired number of iter-
ations. For instance, the sentences to find the fixed point of the exercise in 3.1 should look like:
fun = @(x) 1 − x.2 /4;
a=0;
b=1;
p0 =0.5;
Iter=5;
P=my fixed point function name lastname(fun,a,b,p0 ,Iter);
• (0.5 points) Create a Matlab function called visual verification name lastname() to visually
show if the function has a fixed point over a range, and if that fixed point is unique. The
arguments of the function must be: the function to be evaluated g(x) (as an inline function),
the initial point of the range a, and the final point of the range b. For instance, the sentences
to visually verify if the function of the exercise in 3.1 has an unique fixed point should look like:
fun = @(x) 1 − x.2 /4;
a=0;
b=1;
P=visual verification name lastname(fun,a,b);
• (0.5 points) Use the created function visual verification name lastname() to visually verify if
2
g(x) = 1 + over [1, 5] has an unique fixed point, and use the created function my fixed point
x
to find the fixed point of g(x) with p0 = 4 and 100 iterations.
3.4 Interpreting
The network bandwidth allocation problem is one of the central issues in modern communication
networks. When a data rate is allocated to a source participating in a network, it derives a utility,
which is modeled as a value of a concave function. The well known utility function of each source s
is given by the following function, which satisfies the strict concavity, for all x ∈ R+ ,
2
where ωs > 0 is the weighted parameter for the source s, and x is the allocated data rate to the
network. The share allocated data rate to each source must be regulated with a control mechanism
to prevent network congestion. A network congestion is generated when the utility of any source in
the network is equal to the allocated data rate in the network.
(1.0 points) Use the created functions to find the allocated data rate x which could generate a
network congestion due to a source with ωs = 4.8, where x ∈ [5, 15]. Choose the initial point p0 .
3.5 Proposing
• (0.5 points) Propose an applicated problem in which the fixed point iteration can be used.
• (0.5 points) Solve the proposed problem using the created functions.