Elementary Functions by Jean-Michel Muller

Author:Jean-Michel Muller
Language: eng
Format: epub
Publisher: Birkhäuser Boston, Boston, MA

(8.7)

then for any , the sequences and defined as

(8.8)

satisfy

The proof of this theorem is very similar to the proof of Theorem 16. The nonrestoring algorithm can be viewed as the weighing of t using a pair of scales, and weights (the terms ) which must be put in one of the pans (no weight is unused). Figure 8.5 illustrates this.

Figure 8.5 The nonrestoring algorithm. All the weights are used, and they can be put on both pans. In this example, the weight of the loaf of bread is .

8.2 Simple Algorithms for Exponentials and Logarithms

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.