Generating function approximations at compile time - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Generating function approximations at compile time

(1, 2)
1
2

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.
Fichier principal
Vignette du fichier
0000328.pdf (159.68 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

ensl-00397749 , version 1 (23-06-2009)

Identifiers

  • HAL Id : ensl-00397749 , version 1

Cite

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⟩
108 View
319 Download

Share

Gmail Facebook Twitter LinkedIn More