2023 IEEE 30th Symposium on Computer Arithmetic (ARITH) 2023
DOI: 10.1109/arith58626.2023.00028
|View full text |Cite
|
Sign up to set email alerts
|

Towards a correctly-rounded and fast power function in binary64 arithmetic

Tom Hubrecht,
Claude-Pierre Jeannerod,
Paul Zimmermann

Abstract: We design algorithms for the correct rounding of the power function x y in the binary64 IEEE 754 format, for all rounding modes, modulo the knowledge of hardest-to-round cases. Our implementation of these algorithms largely outperforms previous correctly-rounded implementations and is not far from the efficiency of current mathematical libraries, which are not correctly-rounded. Still, we expect our algorithms can be further improved for speed. The proofs of correctness are fully detailed and have been formall… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 17 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?