IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-017-1247-7_16.html
   My bibliography  Save this book chapter

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

In: Developments in Reliable Computing

Author

Listed:
  • Vincent Lefèvre

    (École Normale Supérieure de Lyon, Laboratoire LIP, Project Arénaire)

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.

Suggested Citation

  • Vincent Lefèvre, 1999. "An Algorithm that Computes a Lower Bound on the Distance Between a Segment and ℤ2," Springer Books, in: Tibor Csendes (ed.), Developments in Reliable Computing, pages 203-212, Springer.
    • Handle: RePEc:spr:sprchp:978-94-017-1247-7_16
    DOI: 10.1007/978-94-017-1247-7_16
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-94-017-1247-7_16. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.