This last inequality is just the condition of equation (7.131) given by the geometric analysis. Finally, we discuss, for the computation of reciprocals, the choice of the initial value yo. Our selection process must be such that the condition of equation (7.131) is always satisfied. Let the number x be written in binary format; i.e., Cx = 2"r1, (7.140) where m is an integer and < x1 < 1. (7.141) Then select yo to have the value Yo = 2-m (7.142) For this choice of yo, we have = 0hx (2"x1)(2¬m) = = x1, (7.143) and < xyo < 1. (7.144) Therefore, the iteration scheme will always converge. In fact, using equation (7.144), we have from equation (7.137) the result Yk < 2yo 2 (7.145) which has extremely fast convergence. Next, we will calculate approximations to the square root of a positive number x. Putting m = 2 into equation (7.129) gives () Yk + Yk (7.146) Yk+1 = Again, the geometric methods of Section 2.7 may be used to analyze the behavior of the iteration scheme of equation (7.146). Examination of the graph in Figure 7.3 leads to the following conclusions: (i) Yk+1 has the same sign as yk-

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter7: Analytic Trigonometry
Section7.3: The Addition And Subtraction Formulas
Problem 79E
icon
Related questions
icon
Concept explainers
Topic Video
Question

Explain the determine red and the eqautions are here

This last inequality is just the condition of equation (7.131) given by the
geometric analysis.
Finally, we discuss, for the computation of reciprocals, the choice of the
initial value yo. Our selection process must be such that the condition of
equation (7.131) is always satisfied. Let the number x be written in binary
format; i.e.,
Cx = 2" x1,
(7.140)
where m is an integer and
< x1 < 1.
(7.141)
Then select yo to have the value
Yo = 2-m
(7.142)
For this choice of yo, we have
(2" x1)(2-m) = X1,
(7.143)
XYO =
and
< xyo < 1.
(7.144)
Therefore, the iteration scheme will always converge. In fact, using equation
(7.144), we have from equation (7.137) the result
2k
Yk < 2y0
(7.145)
which has extremely fast convergence.
Next, we will calculate approximations to the square root of a positive
number x. Putting m = 2 into equation (7.129) gives
() ►
Yk +
Yk
(7.146)
Yk+1 =
Again, the geometric methods of Section 2.7 may be used to analyze the
behavior of the iteration scheme of equation (7.146).
Examination of the graph in Figure 7.3 leads to the following conclusions:
(i) Yk+1 has the same sign as yk.
(ii) The two fixed points are located at (Va, V) and (-Va, - V®).
(iii) Both fixed points are stable.
(iv) For yo > 0, the iterates yk converge to +Vx; i.e.,
lim yk =
+Vx, yo > 0.
(7.147)
For yo < 0, the iterates yk converge to – Vx; i.e.,
lim yk =
-Væ, yo < 0.
(7.148)
Transcribed Image Text:This last inequality is just the condition of equation (7.131) given by the geometric analysis. Finally, we discuss, for the computation of reciprocals, the choice of the initial value yo. Our selection process must be such that the condition of equation (7.131) is always satisfied. Let the number x be written in binary format; i.e., Cx = 2" x1, (7.140) where m is an integer and < x1 < 1. (7.141) Then select yo to have the value Yo = 2-m (7.142) For this choice of yo, we have (2" x1)(2-m) = X1, (7.143) XYO = and < xyo < 1. (7.144) Therefore, the iteration scheme will always converge. In fact, using equation (7.144), we have from equation (7.137) the result 2k Yk < 2y0 (7.145) which has extremely fast convergence. Next, we will calculate approximations to the square root of a positive number x. Putting m = 2 into equation (7.129) gives () ► Yk + Yk (7.146) Yk+1 = Again, the geometric methods of Section 2.7 may be used to analyze the behavior of the iteration scheme of equation (7.146). Examination of the graph in Figure 7.3 leads to the following conclusions: (i) Yk+1 has the same sign as yk. (ii) The two fixed points are located at (Va, V) and (-Va, - V®). (iii) Both fixed points are stable. (iv) For yo > 0, the iterates yk converge to +Vx; i.e., lim yk = +Vx, yo > 0. (7.147) For yo < 0, the iterates yk converge to – Vx; i.e., lim yk = -Væ, yo < 0. (7.148)
(-)
т — 1
Ук+1
Yk +
(7.129)
m(yk)m
m-1
m
1
Yk =
() u
:) [1- ayo)2".
Zk
(7.137)
2
0 < yo <
(7.131)
||
||
Transcribed Image Text:(-) т — 1 Ук+1 Yk + (7.129) m(yk)m m-1 m 1 Yk = () u :) [1- ayo)2". Zk (7.137) 2 0 < yo < (7.131) || ||
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Sample space, Events, and Basic Rules of Probability
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning