Theorems on efficient argument reductions

A commonly used argument reduction technique in elementary function computations begins with two positive floating point numbers α and γ that approximate (usually irrational but not necessarily) numbers 1/C and C, e.g., C = 2π for trigonometric functions and ln 2 for e^x. Given an argument to the function of interest it extracts z as defined by xα = z + ς with z = k2^-N and |sigmav;| ≤ 2^-N-1, where k, N are integers and N ≥ 0 is preselected, and then computes u = x - zγ. Usually zγ takes more bits than the working precision provides for storing its significant and thus exact x - zγ may not be represented exactly by a floating point number of the same precision. This will cause performance penalty when the working precision is the highest available on the underlying hardware and thus considerable extra work is needed to get all the bits of x - zγ right. We present theorems that show under mild conditions that can be easily met on today´s computer hardware and still allow α ≈ 1/C and γ ≈ C to almost the full working precision, x - zγ is a floating point number of the same precision. An algorithmic procedure based on the theorems is obtained. The results will enhance performance, in particular on machines that has hardware support for fused multiply-add (fma) instruction(s).