17th IEEE Symposium on Computer Arithmetic (ARITH'05) New Results on the Distance between a Segment and Z?. Application to the Exact Rounding Cape Cod, Massachusetts, USA June 27-June 29 ISBN: 0-7695-2366-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.2005.32
This paper presents extensions to Lefèvre?s algorithm that computes a lower bound on the distance between a segment and a regular grid Z². This algorithm and, in particular, the extensions are useful in the search for worst cases for the exact rounding of unary elementary functions or base-conversion functions. The proof that is presented here is simpler and less technical than the original proof. This paper also gives benchmark results with various optimization parameters, explanations of these results, and an application to base conversion.
Citation:
Vincent Lefèvre, "New Results on the Distance between a Segment and Z?. Application to the Exact Rounding," arith, pp.68-75, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||