Abstract
Elementary functions whose argument range is large can often be related to similar functions with diminished arguments, where those functions are more easily, and more accurately, computed. The ultimate accuracy of elementary functions depends critically on how well that argument reduction is carried out, and historically, that has been the weak point in many vendor libraries. Although the argument-reduction problem is usually easy to state, it is not easy to solve, because it often requires access to arithmetic of higher precision than is available.
reduction, n.: (g) the Transformation of an algebraic expression into another of a simpler kind.
— New Century Dictionary (1914).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Beebe, N.H.F. (2017). Argument reduction. In: The Mathematical-Function Computation Handbook. Springer, Cham. https://doi.org/10.1007/978-3-319-64110-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-64110-2_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64109-6
Online ISBN: 978-3-319-64110-2
eBook Packages: Computer ScienceComputer Science (R0)