An Algorithm that Computes a Lower Bound on the Distance Between a Segment and $Z^2$

Abstract : We give a fast algorithm for computing a lower bound on the distance between a straight line and the points of a regular grid. This algorithm is used to find worst cases when trying to round the elementary functions correctly in floating-point arithmetic, which consists in returning the machine number that is the closest (there are other rounding modes) to the exact result.
Document type :
Reports
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02101812
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:06:58 AM
Last modification on : Wednesday, May 22, 2019 - 1:32:16 AM

File

RR1997-18.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101812, version 1

Collections

Citation

Vincent Lefevre. An Algorithm that Computes a Lower Bound on the Distance Between a Segment and $Z^2$. [Research Report] LIP RR-1997-18, Laboratoire de l'informatique du parallélisme. 1997, 2+9p. ⟨hal-02101812⟩

Share

Metrics

Record views

9

Files downloads

9