A performance enhancement of the Payne-Hanek range reduction algorithm (Q7360674)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A performance enhancement of the Payne-Hanek range reduction algorithm |
No description defined |
Statements
A performance enhancement of the Payne-Hanek range reduction algorithm (English)
0 references
28 September 2026
0 references
cs.MS
0 references
math.NA
0 references
Tue Ly
0 references
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.
0 references
Payne-Hanek
0 references
Range Reduction
0 references
Floating Point
0 references
Trigonometric Functions
0 references
1 reference
1 reference
1 reference