#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1994

2017

- This year (0)
- Last 5 years (11)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Paul Zimmermann
- ACM Trans. Math. Softw.
- 2007

This article presents a multiple-precision binary floating-point library, written in the ISO C language, and based on the GNU MP library. Its particularity is to extend to arbitrary-precision, ideas… (More)

- Jean-Michel Muller, Nicolas Brisebarre, +6 authors Serge Torres
- 2010

The multiplication by a constant problem consists in generating code to perform a multiplication by an integer constant, using elementary operations, such as left shifts (multiplications by powers of… (More)

- Vincent Lefèvre, Arnaud Tisserand, Jean-Michel Muller
- IEEE Symposium on Computer Arithmetic
- 1997

- Vincent Lefèvre, Jean-Michel Muller
- IEEE Symposium on Computer Arithmetic
- 2001

We give here the results of a four-year search for the worst cases for correct rounding of the major elementary functions in double precision. These results allow the design of reasonably fast… (More)

- Vincent Lefèvre
- 17th IEEE Symposium on Computer Arithmetic (ARITH…
- 2005

This paper presents extensions to Lefevre's algorithm that computes a lower bound on the distance between a segment and a regular grid Zopf2. This algorithm and, in particular, the extensions are… (More)

- Damien Stehlé, Vincent Lefèvre, Paul Zimmermann
- IEEE Transactions on Computers
- 2005

We propose a new algorithm to find worst cases for the correct rounding of a mathematical function of one variable. We first reduce this problem to the real small value problem - i.e., for… (More)

- Kaveh R. Ghazi, Vincent Lefèvre, Philippe Théveny, Paul Zimmermann
- Computing in Science and Engineering
- 2010

Most nowadays floating-point computations are done in double precision, i.e., with a significand (or mantissa, see the “Glossary” sidebar) of 53 bits. However, some applications require more… (More)

- Vincent Lefèvre, Jean-Michel Muller, Arnaud Tisserand
- IEEE Trans. Computers
- 1998

The Table Maker’s Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments… (More)

- Damien Stehlé, Vincent Lefèvre, Paul Zimmermann
- IEEE Symposium on Computer Arithmetic
- 2003

We propose a new algorithm to find worst cases for correct rounding of an analytic function. We first reduce this problem to the real small value problem — i.e. for polynomials with real… (More)