A new range-reduction algorithm

@article{Brisebarre2001ANR,
  title={A new range-reduction algorithm},
  author={Nicolas Brisebarre and David Defour and Peter Kornerup and Jean-Michel Muller and Nathalie Revol},
  journal={Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256)},
  year={2001},
  volume={2},
  pages={1656-1660 vol.2}
}
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new algorithm that is fast for input arguments belonging to the most common domains, yet accurate over the full double-precision range. 

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Elementary Functions

  • J.-M. Muller
  • Algorithms and Implementation. Boston: Birkhäuser
  • 1997

Minimizing q*m-n, http://http.cs.berkeley.edu/ wkahan/ at the beginning of the file “nearpi.c,

  • W. Kahan
  • 1983
2 Excerpts

The Art of Computer Programming

  • D. Knuth
  • vol. 2. Reading, Mass.: Addison Wesley
  • 1973

Continued Fractions

  • A. Ya Khintchine
  • Chicago, London: Univ. of Chicago Press
  • 1964
1 Excerpt

Similar Papers

Loading similar papers…