| 
|
Quote: gives a fast O(n^2) algorithm for division of multi-precision floating-point numbers; as fast as multiplication; accuracy to machine epsilon
topics >
all references >
references m-o >
Topic:
real numbers and floating point numbers
Topic:
unbounded precision
Quotation Skeleton
A fast O(n^2) algorithm is derived for the … numbers. This algorithm, which is a modification of … than the algorithm based on the Newton method … [p. 356] The experimental results … show that our new algorithm is as fast … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: real numbers and floating point numbers (37 items)
Topic: unbounded precision (9 items)