Short Division of Long Integers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Short Division of Long Integers

David Harvey
  • Function : Author


We consider the problem of short division --- division without remainder --- of multiple-precision integers. We present ready-to-be-implemented algorithms that yield an approximation of the quotient, with tight and rigorous error bounds. We exhibit speedups of up to 30% with respect to GMP division with remainder, and up to 10% with respect to GMP short division, with room for further improvements. This work enables one to implement fast correctly rounded division routines in multiple-precision software tools.

Dates and versions

inria-00612232 , version 1 (28-07-2011)



David Harvey, Paul Zimmermann. Short Division of Long Integers. 20th IEEE Symposium on Computer Arithmetic (ARITH-20), Jul 2011, Tuebingen, Germany. pp.7-14, ⟨10.1109/ARITH.2011.11⟩. ⟨inria-00612232⟩
300 View
0 Download



Gmail Mastodon Facebook X LinkedIn More