Debrief
发表于 2025-3-25 05:27:37
http://reply.papertrans.cn/31/3074/307385/307385_21.png
诗集
发表于 2025-3-25 08:53:07
Introduction., tan., sinh, cosh, tanh, sinh., cosh., tanh., exponentials, and logarithms. From a purely theoretical point of view, these functions are not much harder to compute than quotients: it was shown by Alt that elementary functions are equivalent to division with respect to Boolean circuit depth. Th
伪书
发表于 2025-3-25 15:03:00
Some Basic Things About Computer Arithmeticut the book. For further information, the reader is referred to Goldberg’s paper , which gives a good survey of the topic, and Kahan’s lecture notes , which offer interesting and useful information. Further information can be found in . Here we m
obscurity
发表于 2025-3-25 17:23:59
Polynomial or Rational Approximationswe add division to the set of available operations, the only functions one can compute are .. Therefore it is natural to try to approximate the elementary functions by polynomials or rational functions. Throughout this chapter we denote by .. the set of the polynomials of degree less than or equal t
interrupt
发表于 2025-3-25 21:48:15
Table-Based Methodsg delays of computation, and this may also make the numerical error control difficult. A natural way to deal with this problem is to split the interval where the function is to be approximated into several smaller subintervals. It suffices to store in a table, for each subinterval, the coefficients
caldron
发表于 2025-3-26 03:07:42
Introduction to Shift-and-Add algorithmsx would be proportional to the exponential of the weight of the bread! Bakers and mathematicians had the same question in mind: how could they quickly compute the price of bread? An old mathematician, called Briggs, found a convenient solution. He said to the King,
commensurate
发表于 2025-3-26 07:34:19
The CORDIC Algorithmute sine, cosine, and arctangent functions) and to multiply or divide numbers using only shift-and-add elementary steps. In 1971, Walther generalized this algorithm to compute logarithms, exponentials, and square roots. CORDIC is not the fastest way to perform multiplications or to compute log
Obstacle
发表于 2025-3-26 12:08:35
Miscellaneousthan with the basic operations +, -, ×, ÷, and the square root. This is due to the high . of the elementary functions: when one obtains +∞ as the result. of a calculation that only contains the four basic operations and the square root, this does not necessarily mean that the exact result is infinit
acquisition
发表于 2025-3-26 15:44:44
Introductionis means that, roughly speaking, a circuit can output . digits of a sine, cosine, or logarithm in a time proportional to log . (see also Okabe et al. , and Beame et al. ). For practical implementations, however, it is quite different, and much care is necessary if we want fast and accurate elementary functions.
sed-rate
发表于 2025-3-26 17:06:19
http://reply.papertrans.cn/31/3074/307385/307385_30.png