Comparison of Accurate Dot Product Algorithms.pdf

IS S N 0 2 4 9 - 6 3 9 9 appor t de r echerche INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Comparison of Accurate Dot Product Algorithms Ju?rgen Wolff v. Gudenberg Institut fu?r Informatik Universita?t Wu?rzburg N? 2413 Octobre 1994 PROGRAMME 6 Comparison of Accurate Dot Product Algorithms Jurgen Wol v. Gudenberg  Institut fur Informatik Universitat Wurzburg Programme 6 | Calcul scientique, modelisation et logiciel numerique Projet Aladin Rapport de recherche n2413 | Octobre 1994 | 25 pages Abstract: A recently proposed algorithm for the accurate computation of the dot product [Kob 94] has been implemented and modied in order to obtain the best possible algorithm for the Aquarels toolbox. It is compared with the other well known algorithms with respect to runtime and intermediate storage space. A considerable improvement of the performance is obtained by a combination of this algorithm with an old one. Key-words: computer arithmetic, dotproduct computation (Resume : tsvp) This work has been prepared during a stay at IRISA Rennes, supported by C.I.E.S Unite? de recherche INRIA Rennes IRISA, Campus universitaire de Beaulieu, 35042 RENNES Cedex (France) Te?le?phone : (33) 99 84 71 00 – Te?le?copie : (33) 99 84 71 71 Comparaison dalgorithmes pour calculer precisement le produit scalaire Resume : Nous etudions ici un nouvel algorithme pour calculer le produit scalaire precis et nous le comparons aux algorithmes connus. Quelques modications de cet algorithme sont mises en uvre dans latelier Aquarels et en ameliorent ainsi les performances. Mots-cle : produit scalaire, arithmetique precise des ordinateurs Comparison of Accurate Dot Product Algorithms 3 1 Introduction The accurate computation of a dot product (or synonymously: scalar product) is essential for many numerical programs. In the next section we sketch several algo- rithms for the exact computation of these dot products s := 2( nX i=1 ai
bi) of oating-point num