Elementary Functions and Approximate Computing
Jean‐Michel Muller
Abstract
In this article, we review some of the classical methods used for quickly obtaining low-precision approximations to the elementary functions. Then, for each of the three main classes of elementary function algorithms (shift-and-add algorithms, polynomial or rational approximations, and table-based methods) and for the additional, specific to approximate computing, “bit-manipulation” techniques, we examine what can be done for obtaining very fast estimates of a function, at the cost of a (controlled) loss in terms of accuracy.
Topics & Concepts
Elementary functionPolynomialFunction (biology)Rational functionComputer scienceAlgorithmTable (database)Function approximationApplied mathematicsMathematicsMathematical optimizationAlgebra over a fieldArtificial intelligencePure mathematicsMathematical analysisArtificial neural networkData miningBiologyEvolutionary biologyNumerical Methods and AlgorithmsDigital Filter Design and ImplementationPolynomial and algebraic computation