Abstract
Evaluating a function by approximating it in a rather large domain may require polynomial or rational functions of large degrees. This may lead to long 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 of a low-degree approximation that is valid in that interval. Such a method is not new (a PDP-9 implementation is reported in [7]), but it becomes very attractive nowadays, since memory is less and less expensive.
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
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Muller, JM. (1997). Table-Based Methods. In: Elementary Functions. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-2646-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2646-6_4
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