A Domain Splitting Algorithm for the Mathematical Functions Code Generator - Sorbonne Université Access content directly
Conference Papers Year : 2014

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.
Fichier principal
Vignette du fichier
VersionSoumise.pdf (255.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01118915 , version 1 (20-02-2015)

Identifiers

Cite

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⟩
136 View
318 Download

Altmetric

Share

Gmail Facebook X LinkedIn More