\sqrt{-\log \left(1 - u1\right)} \cdot \cos \left(\left(2 \cdot \pi\right) \cdot u2\right)
\begin{array}{l}
t_0 := \sqrt{-\mathsf{log1p}\left(-u1\right)}\\
t_1 := \cos \left(\left(2 \cdot \pi\right) \cdot u2\right)\\
\sqrt[3]{\left(t_0 \cdot \left(t_0 \cdot t_0\right)\right) \cdot \left(t_1 \cdot \left(t_1 \cdot t_1\right)\right)}
\end{array}
(FPCore (cosTheta_i u1 u2) :precision binary32 (* (sqrt (- (log (- 1.0 u1)))) (cos (* (* 2.0 PI) u2))))
(FPCore (cosTheta_i u1 u2) :precision binary32 (let* ((t_0 (sqrt (- (log1p (- u1))))) (t_1 (cos (* (* 2.0 PI) u2)))) (cbrt (* (* t_0 (* t_0 t_0)) (* t_1 (* t_1 t_1))))))
float code(float cosTheta_i, float u1, float u2) {
return sqrtf(-logf(1.0f - u1)) * cosf((2.0f * ((float) M_PI)) * u2);
}
float code(float cosTheta_i, float u1, float u2) {
float t_0 = sqrtf(-log1pf(-u1));
float t_1 = cosf((2.0f * ((float) M_PI)) * u2);
return cbrtf((t_0 * (t_0 * t_0)) * (t_1 * (t_1 * t_1)));
}



Bits error versus cosTheta_i



Bits error versus u1



Bits error versus u2
Results
Initial program 13.6
Simplified0.3
Applied add-cbrt-cube_binary320.3
Applied add-cbrt-cube_binary320.3
Applied cbrt-unprod_binary320.3
Final simplification0.3
herbie shell --seed 2022125
(FPCore (cosTheta_i u1 u2)
:name "Beckmann Sample, near normal, slope_x"
:precision binary32
:pre (and (and (and (> cosTheta_i 0.9999) (<= cosTheta_i 1.0)) (and (<= 2.328306437e-10 u1) (<= u1 1.0))) (and (<= 2.328306437e-10 u2) (<= u2 1.0)))
(* (sqrt (- (log (- 1.0 u1)))) (cos (* (* 2.0 PI) u2))))