Name
Abstract | ||
|---|---|---|
In this article, we present an efficient algorithm to compute the faithful rounding of the l2-norm of a floating-point vector. This means that the result is accurate to within 1 bit of the underlying floating-point type. This algorithm does not generate overflows or underflows spuriously, but does so when the final result calls for such a numerical exception to be raised. Moreover, the algorithm is well suited for parallel implementation and vectorization. The implementation runs up to 3 times faster than the netlib version on current processors. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2699469 | ACM Trans. Math. Softw. |
Keywords | DocType | Volume |
Floating-point arithmetic,error-free transformations,faithful rounding,2-norm,underflow,overflow | Journal | 41 |
Issue | ISSN | Citations |
4 | 0098-3500 | 2 |
PageRank | References | Authors |
0.41 | 6 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stef Graillat | 1 | 92 | 16.06 |
| Christoph Quirin Lauter | 2 | 84 | 9.74 |
| Ping Tak Peter Tang | 3 | 229 | 12.50 |
| Naoya Yamanaka | 4 | 2 | 0.41 |
| Shin'ichi Oishi | 5 | 280 | 37.14 |