A Domain Splitting Algorithm for the Mathematical Functions Code Generator

Abstract : The general approach to mathematical function implementation consists of three stages: argument reduction, approximation and reconstruction. The argument reduction step is needed to reduce the degree of the approximation polynomial and to simplify the error analysis. For some particular functions (e.g. exp) it is done using its algebraic properties. In the general case the whole domain is split into small subdomains to get low-degree approximation on each of them. Here we present a novel algorithm for the domain splitting that will be integrated soon to Metalibm code generator.
Type de document :
Communication dans un congrès
ACSSC 2014 - 48th Asilomar Conference on Signals, Systems and Computers, Nov 2014, Pacific Grove, CA, United States. IEEE, pp.1271-1275, 2014, 〈10.1109/ACSSC.2014.7094664〉
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal.sorbonne-universite.fr/hal-01118915
Contributeur : Olga Kupriianova <>
Soumis le : vendredi 20 février 2015 - 12:36:15
Dernière modification le : jeudi 22 novembre 2018 - 14:15:47
Document(s) archivé(s) le : jeudi 28 mai 2015 - 16:17:22

Fichier

VersionSoumise.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Olga Kupriianova, Christoph Lauter. A Domain Splitting Algorithm for the Mathematical Functions Code Generator. ACSSC 2014 - 48th Asilomar Conference on Signals, Systems and Computers, Nov 2014, Pacific Grove, CA, United States. IEEE, pp.1271-1275, 2014, 〈10.1109/ACSSC.2014.7094664〉. 〈hal-01118915〉

Partager

Métriques

Consultations de la notice

143

Téléchargements de fichiers

145