By Topic

Algorithms for arbitrary precision floating point arithmetic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
D. M. Priest ; Dept. of Math., California Univ., Berkeley, CA, USA

The author presents techniques for performing computations of very high accuracy using only straightforward floating-point arithmetic operations of limited precision. The validity of these techniques is proved under very general hypotheses satisfied by most implementations of floating-point arithmetic. To illustrate the applications of these techniques, an algorithm is presented which computes the intersection of a line and a line segment. The algorithm is guaranteed to correctly decide whether an intersection exists and, if so, to produce the coordinates of the intersection point accurate to full precision. The algorithm is usually quite efficient; only in a few cases does guaranteed accuracy necessitate an expensive computation

Published in:

Computer Arithmetic, 1991. Proceedings., 10th IEEE Symposium on

Date of Conference:

26-28 Jun 1991