Table-Based Methods

  • Jean-Michel Muller

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.

Keywords

Double Precision Minimax Approximation Machine Number Target Precision Representable Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Jean-Michel Muller
    • 1
  1. 1.CNRS-Laboratoire LIPEcole Normale Superieure de LyonLyon Cedex 07France

Personalised recommendations