October 7, 2018
1
Answers
1)
I we follow this pattern we can see that the total number of multiplication is :
n.(n + 1)
n + (n − 1) + (n − 2) + .... + 1 =
2
In this method, the number of multiplications equal to the biggest power of x since multiplication
by x is applied at each step, so the total number of multiplication is ”n”(first x is applied to the
all of the variables inside the parantheses , we can think that as following: The corresponding x of
a1 is applied to a1 and all of the other higher order terms, and corresponding x2 of a2 , which is
only an x because of the a1 ’s x at the outer paranthesis, is applied to a2 and terms with higher
orders This pattern goes like this and only 1 multipication is necessary at each step total of ”n”
multiplication ).
3−2 1 1
= n+1
= n+1 <
2 2 100
step 1:
b0 + a0 3 + 2 5 5
a0 = 2 b0 = 3 c1 = = = f (c1 ) = ( )2 − 7 < 0 → a1 = c1
2 2 2 2
1
step 2:
5 ( 11
2 ) 11 121
a1 = b1 = 3 c2 = = f (c2 ) = ( ) − 7 > 0 → b2 = c2
2 2 4 16
step 3:
5 11 21 21 2
a2 = b2 = c3 = f (c3 ) = ( ) − 7 = −0.1093 < 0 → a3 = c3
2 4 8 8
step 4:
21 11 43
a3 = b3 = c4 = f (c4 ) = 0.222 > 0 → b4 = c4
8 4 16
step 5:
21 43 85
a4 = b4 = c5 = f (c5 ) = 0.055 > 0 → b5 = c5
8 16 32
2
step 6:
21 85 169
a5 = b5 = c6 = f (c6 ) = −0.027 < 0 → a6 = c6
8 32 64
step 7:
169 85 339
a6 = b6 = c7 = f (c7 ) = 0.014
64 32 128
√
2
So the approximation of 7 = c7 = 2.6484375
3)
√
a)The prediction of the solution in the each step is c = a+b
2 in Bisection Method .For 5 to be the
2
root of the function , function can be choosen as f (x) = x − 5 . Then we can chhose our a0 = 2 to
make the function negative and b0 = 3 to make the function possitive.
step 1:
b0 + a0 3 + 2 5 5
a0 = 2 b0 = 3 c1 = = = f (c1 ) = ( )2 − 5 > 0 → b1 = c1
2 2 2 2
step 2:
5 (
a1 = 2 b1 = c2 = 4 f (c2 ) = 0.06 > 0 → b2 = c2
2 9
step 3:
9 17
a2 = 2 b2 = c3 = f (c3 ) = −0.484 < 0 → a3 = c3
4 8
step 4:
17 9 35
a3 = b3 = c4 = f (c4 ) = −0.214 < 0 → a4 = c4
8 4 16
3
step 5:
35 9 71
a4 = b4 = c5 = f (c5 ) = −0.077
16 4 32
√
So the approximation of 5 = c5 = 2.21875 with Bisection Method.
step 1:
0 4 7 7 4
x0 = 3, f (x0 ) = 4, f (x0 ) = 6 x1 = 3 − = f (x1 ) = ( )2 − 5 =
6 3 3 9
step 2:
4
7 4 0 14 7 9 47 4
x1 = , f (x1 ) = , f (x1 ) = x2 = − 14 = f (x1 ) =
3 9 3 3 3
21 441
step 3:
4
47 4 0 94 47 2207
x2 = , f (x2 ) = , f (x2 ) = x3 = − 441
94 = f (x3 ) = 4.106 × 10−6
21 441 21 21 21
987
step 4:
2207 0 4414 2207 4.106 × 10−6
x3 = , f (x3 ) = 4.106 × 10−6 , f (x3 ) = x4 = − 4414 = 2.23606 f (x4 ) = 8.429 × 10−13
987 987 987 987
step 5:
0 8.429 × 10−13
x4 = 2.23606, f (x4 ) = 8.429 × 10−13 , f (x4 ) = 4.47213 x5 = 2.23606 − = 2.2360679 f (x5 ) ≈ 10−22
4.47213
√
So the approximation of 5 = x5 = 2.2360679 with Newton’s Method. Since the absolute value of
f (c5 ) in Bisection method is bigger than the absolute value of f√(x5 ) in Newton’s method,
Newton’s method’s approximation
√ gived us better solution for 5 (because we want our function
to equals to 0 for finding 5 as a function’s root. And f (x5 ) is closer to zero)
4
4)
(
7 6 5 4 3 2 +∞ if a > 0
lim ax + bx + cx + dx + ex + f x + gx + r =
x→∞ −∞ if a < 0
(
−∞ if a > 0
lim ax7 + bx6 + cx5 + dx4 + ex3 + f x2 + gx + r =
x→−∞ +∞ if a < 0
We can say the same things if sign of ”a” is negative since p(x) goes to −∞ as x → +∞ and goes
to +∞ as x → −∞