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.
Type de document :
Rapport
[Research Report] RR-3805, INRIA. 1999, pp.8
Liste complète des métadonnées

https://hal.inria.fr/inria-00072854
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:05:58
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:25:18

Fichiers

Identifiants

  • HAL Id : inria-00072854, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

731

Téléchargements de fichiers

2136