A performance enhancement of the Payne-Hanek range reduction algorithm

DOI10.48550/arXiv.2609.35015MaRDI QIDQ7360674arXivFDO

Authors Tue Ly

Publication date 28 September 2026

Published in arXiv

Tldr This paper analyzes the Payne--Hanek range reduction algorithm used for evaluating trigonometric functions with large floating-point inputs and presents a branch-free variation using only floating-point arithmetic to reduce latency and improve SIMD vectorization. This new method operates directly over double-precision inputs ($|x| \ge 2^{16}$) and is well-suited for hardware with FMA instructions, improving both latency and throughput compared to existing implementations.

Full work available at URL https://doi.org/10.48550/arXiv.2609.35015

arXiv classification

cs.MSmath.NA

Cites work

• A floating-point technique for extending the available precision
• A new range-reduction algorithm
• Accurate Floating-Point Summation Part I: Faithful Rounding
• Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions
• Formally Verified Argument Reduction with a Fused Multiply-Add
• Handbook of floating-point arithmetic

This page was built for publication: A performance enhancement of the Payne-Hanek range reduction algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7360674)