Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01118915
Contributor : Olga Kupriianova <>
Submitted on : Friday, February 20, 2015 - 12:36:15 PM
Last modification on : Thursday, March 21, 2019 - 2:32:32 PM
Document(s) archivé(s) le : Thursday, May 28, 2015 - 4:17:22 PM

File

VersionSoumise.pdf
Files produced by the author(s)

Identifiers

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. pp.1271-1275, ⟨10.1109/ACSSC.2014.7094664⟩. ⟨hal-01118915⟩

Share

Metrics

Record views

215

Files downloads

319