An Algorithm that Computes a Lower Bound on the Distance Between a Segment and ℤ2

Vincent Lefèvre ()
Additional contact information
Vincent Lefèvre: École Normale Supérieure de Lyon, Laboratoire LIP, Project Arénaire

A chapter in Developments in Reliable Computing, 1999, pp 203-212 from Springer

Abstract: Abstract We give a fast algorithm for computing a lower bound on the distance between a straight line and the points of a bounded regular grid. This algorithm is used to find worst cases when trying to round the elementary functions correctly in floating-point arithmetic. These worst cases are useful to design algorithms that guarantee the exact rounding of the elementary functions.

Keywords: elementary functions; floating-point arithmetic; rounding (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-017-1247-7_16

Ordering information: This item can be ordered from
http://www.springer.com/9789401712477

DOI: 10.1007/978-94-017-1247-7_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().