Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-08T16:47:50.323Z Has data issue: false hasContentIssue false

Fast and correctly rounded logarithmsin double-precision

Published online by Cambridge University Press:  24 April 2007

Florent de Dinechin
Affiliation:
LIP, projet Arénaire, École normale supérieure de Lyon, 46 allée d'Italie, 69364 Lyon Cedex 07, France; florent.de.dinechin@ens-lyon.fr; christoph.lauter@ens-lyon.fr; Jean-Michel.Muller@ens-lyon.fr
Christoph Lauter
Affiliation:
LIP, projet Arénaire, École normale supérieure de Lyon, 46 allée d'Italie, 69364 Lyon Cedex 07, France; florent.de.dinechin@ens-lyon.fr; christoph.lauter@ens-lyon.fr; Jean-Michel.Muller@ens-lyon.fr
Jean-Michel Muller
Affiliation:
LIP, projet Arénaire, École normale supérieure de Lyon, 46 allée d'Italie, 69364 Lyon Cedex 07, France; florent.de.dinechin@ens-lyon.fr; christoph.lauter@ens-lyon.fr; Jean-Michel.Muller@ens-lyon.fr
Get access

Abstract

This article is a case study in the implementation of a portable, proven and efficient correctly rounded elementary function in double-precision. We describe the methodology used to achieve these goals in the crlibm library. There are two novel aspects to this approach. The first is the proof framework, and in general the techniques used to balance performance and provability. The second is the introduction of processor-specific optimization to get performance equivalent to the best current mathematical libraries, while trying to minimize the proof work. The implementation of the natural logarithm is detailed to illustrate these questions.

Information

Type
Research Article
Copyright
© EDP Sciences, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable