HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [11 references]  Display  Hide  Download

Contributor : Jean-Michel Muller Connect in order to contact the contributor
Submitted on : Tuesday, June 23, 2009 - 10:43:11 AM
Last modification on : Friday, February 4, 2022 - 3:18:58 AM
Long-term archiving on: : Tuesday, June 15, 2010 - 6:21:15 PM


Publisher files allowed on an open archive


  • HAL Id : ensl-00397749, version 1



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⟩



Record views


Files downloads