Karatsuba Square Root

Paul Zimmermann 1
1 POLKA - Polynomials, Combinatorics, Arithmetic
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We exhibit an algorithm to compute the square-root with remainder of a n-word number in 3\2word operations, where K(n) is the number of words operations to multiply two n-word numbers using Karatsuba's algorithm. If the remainder is not needed, the cost can be reduced to K(n) on average. This algorithm can be used for floating-point or polynomial computations too; although not optimal asymptotically, its simplicity gives a wide range of use, from about 50 to 1,000,000 digits, as shown by computer experiments.
Document type :
Reports
[Research Report] RR-3805, INRIA. 1999, pp.8
Liste complète des métadonnées

https://hal.inria.fr/inria-00072854
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:05:58 AM
Last modification on : Tuesday, October 25, 2016 - 5:02:17 PM
Document(s) archivé(s) le : Sunday, April 4, 2010 - 11:25:18 PM

Identifiers

  • HAL Id : inria-00072854, version 1

Collections

Citation

Paul Zimmermann. Karatsuba Square Root. [Research Report] RR-3805, INRIA. 1999, pp.8. <inria-00072854>

Share

Metrics

Record views

421

Document downloads

1166