A FAST DOT-PRODUCT ALGORITHM WITH MINIMAL ROUNDING ERRORS

Authors
KOBBELT L
Citation
L. Kobbelt, A FAST DOT-PRODUCT ALGORITHM WITH MINIMAL ROUNDING ERRORS, Computing, 52(4), 1994, pp. 355-369
Citations number
7
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Computing → ACNP
ISSN journal
0010485X
Volume
52
Issue
4
Year of publication
1994
Pages
355 - 369
Database
ISI
SICI code
0010-485X(1994)52:4<355:AFDAWM>2.0.ZU;2-3
Abstract
We present a new algorithm which computes dot-products of arbitrary le ngth with minimal rounding errors, independent of the number of addend s. The algorithm has an O(n) time and O(1) memory complexity and does not need extensions of the arithmetic kernel, i.e., usual floating-poi nt operations. A slight modification yields an algorithm which compute s the dot-product in machine precision. Due to its simplicity, the alg orithm can easily be implemented in hardware.