Worst Cases and Lattice Reduction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Worst Cases and Lattice Reduction

Abstract

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 coefficients. Then we show that this second problem can be solved efficiently, by extending Coppersmith's work on the Integer Small Value Problem --- for polynomials with integer coefficients --- using lattice reduction. For floating-point numbers with a mantissa less than N, and a polynomial approximation of degree d, our algorithm finds all worst cases at distance $
Not file

Dates and versions

inria-00099572 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099572 , version 1

Cite

Damien Stehlé, Vincent Lefèvre, Paul Zimmermann. Worst Cases and Lattice Reduction. 16th IEEE Symposium on Computer Arithmetic 2003 - ARITH-16'03, 2003, Santiago de Compostela, Espagne, pp.142-147. ⟨inria-00099572⟩
99 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More