A fast dot-product algorithm with minimal rounding errors (Q1332688): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast dot-product algorithm with minimal rounding errors |
scientific article |
Statements
A fast dot-product algorithm with minimal rounding errors (English)
0 references
1 September 1994
0 references
The author presents a new algorithm which computes dot-products of arbitrary length with minimal rounding errors, independent of the number of addends. 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-point operations. A slight modification yields an algorithm which computes the dot-product in machine precision. Due to its simplicity, the algorithm can easily be implemented in hardware.
0 references
fast dot-product algorithm
0 references
inner product
0 references
floating-point arithmetic
0 references
minimal rounding errors
0 references
