Homework #1

Due on Feb 20, 2018 (in class)

Problem 1 (15 points)

Find the solution of 𝑓(𝑥) = 𝑥 2 − 10 = 0 using the Newton-Raphson method (by hand). Assume that the
initial guess is 𝑥0 = 0 and the desired convergence tolerance 𝜀 = 0.01.

Problem 2 (15 points)

Re-solve Problem 1 without updating the value of 𝑓 ′ (𝑥𝑘 ) at every iteration. Instead of 𝑓 ′ (𝑥𝑘 ) use
𝑓 ′ (𝑥0 ). How does it affect the number of iteration and the achieved tolerance?

Problem 3 (15 points)

Given the admittance matrix below, recover the network configuration and draw its diagram. Use the
matrix below to identify as many branch admittances as possible.

−𝑗14.5 𝑗8.3 0
𝑌 = [ 𝑗8.3 −𝑗5 𝑗2.5].
0 𝑗2.5 −𝑗9

Problem 4 (15 points)

For the network diagram given below, list all non-zero elements of the admittance matrix.

Problem 5 (40 points)

Given the network below (we considered this example in Lecture 3), solve the first three iterations of the
Newton-Raphson method (by hand). Compare the first three iterations of the Newton-Raphson method
with the first three iterations of the Dishonest Newton-Raphson method and outline the main differences.