Generating function approximations at compile time

Jean-Michel Muller 1, 2
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Usually, the mathematical functions used in a numerical programs are decomposed into elementary functions (such as sine, cosine, exponential, logarithm...), and for each of these functions, we use a program from a library. This may have some drawbacks: first in frequent cases, it is a compound function (e.g. log(1 + exp(−x))) that is needed, so that directly building a polynomial or rational approximation for that function (instead of decomposing it) would result in a faster and/or more accurate calculation. Also, at compile-time, we might have some information (e.g., on the range of the input value) that could help to simplify the program. We investigate the possibility of directly building accurate approximations at compile-time.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00397749
Contributor : Jean-Michel Muller <>
Submitted on : Tuesday, June 23, 2009 - 10:43:11 AM
Last modification on : Wednesday, November 20, 2019 - 7:42:10 AM
Long-term archiving on : Tuesday, June 15, 2010 - 6:21:15 PM

File

0000328.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : ensl-00397749, version 1

Collections

Citation

Jean-Michel Muller. Generating function approximations at compile time. 40th Asilomar Conference on signals, systems and computers, USA, Oct 2006, Pacific Grove, California, France. pp.328-331. ⟨ensl-00397749⟩

Share

Metrics

Record views

301

Files downloads

267