Algorithm, Proof and Performances of a new Division of Floating Point Expansions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

Algorithm, Proof and Performances of a new Division of Floating Point Expansions

Marc Daumas
  • Function : Author
Claire Finot
  • Function : Author

Abstract

We present in this work a new algorithm for the division of floating point expansions. Floating expansion is a multiple precision data type developped with arithmetic operators that use the processor floating point unit for core computations instead of the integer unit. Researches on this subject have arised recently from the observation that the floating point unit becomes a more and more efficient part of modern computers. Many simple arithmetic operators and some very usefull geometric operators have already been presented on expansions. Yet previous work presented only a very simple division algorithm. We present in this work a new algorithm. We take this opportunity to extend the set of geometric operators with Bareiss' determinant on a matrix of size between 3 and 10. Running times with different determinant algorithms on different machines are compared with other multiprec- ision packages including GMP, CADNA and a computer geometry package working with modular arithmetic.
Fichier principal
Vignette du fichier
RR-3771.pdf (281 Ko) Télécharger le fichier

Dates and versions

inria-00072890 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072890 , version 1

Cite

Marc Daumas, Claire Finot. Algorithm, Proof and Performances of a new Division of Floating Point Expansions. [Research Report] RR-3771, INRIA. 1999. ⟨inria-00072890⟩
100 View
192 Download

Share

Gmail Facebook X LinkedIn More