Abstract
The algorithms presented in the previous chapters for evaluating the elementary functions only give a correct result if the argument is within a given bounded interval. To evaluate an elementary function f(x) for any x, one must find some “transformation” that makes it possible to deduce f(x) from some value g(x*), where
-
x*, called the reduced argument, is deduced from x;
-
x* belongs to the convergence domain of the algorithm implemented for the evaluation of g.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Muller, JM. (1997). Range Reduction. In: Elementary Functions. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-2646-6_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2646-6_8
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4757-2648-0
Online ISBN: 978-1-4757-2646-6
eBook Packages: Springer Book Archive