\sqrt{-\log \left(1 - u1\right)} \cdot \cos \left(\left(2 \cdot \pi\right) \cdot u2\right)
\begin{array}{l}
t_0 := \left(2 \cdot \pi\right) \cdot u2\\
\mathbf{if}\;1 - u1 \leq 0.9740946292877197:\\
\;\;\;\;\begin{array}{l}
t_1 := \sqrt{t_0}\\
\sqrt{-\log \left(1 - u1\right)} \cdot \cos \left(t_1 \cdot t_1\right)
\end{array}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{u1 + \left(0.25 \cdot {u1}^{4} + \left(u1 \cdot u1\right) \cdot \left(0.5 + u1 \cdot 0.3333333333333333\right)\right)} \cdot \cos t_0\\
\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 (* (* 2.0 PI) u2)))
(if (<= (- 1.0 u1) 0.9740946292877197)
(let* ((t_1 (sqrt t_0)))
(* (sqrt (- (log (- 1.0 u1)))) (cos (* t_1 t_1))))
(*
(sqrt
(+
u1
(+
(* 0.25 (pow u1 4.0))
(* (* u1 u1) (+ 0.5 (* u1 0.3333333333333333))))))
(cos t_0)))))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 = (2.0f * ((float) M_PI)) * u2;
float tmp;
if ((1.0f - u1) <= 0.9740946292877197f) {
float t_1_1 = sqrtf(t_0);
tmp = sqrtf(-logf(1.0f - u1)) * cosf(t_1_1 * t_1_1);
} else {
tmp = sqrtf(u1 + ((0.25f * powf(u1, 4.0f)) + ((u1 * u1) * (0.5f + (u1 * 0.3333333333333333f))))) * cosf(t_0);
}
return tmp;
}



Bits error versus cosTheta_i



Bits error versus u1



Bits error versus u2
Results
if (-.f32 1 u1) < 0.974094629Initial program 0.9
rmApplied add-sqr-sqrt_binary320.9
if 0.974094629 < (-.f32 1 u1) Initial program 16.2
Taylor expanded in u1 around 0 0.3
Simplified0.3
rmApplied *-commutative_binary320.3
Final simplification0.4
herbie shell --seed 2021206
(FPCore (cosTheta_i u1 u2)
:name "Beckmann Sample, near normal, slope_x"
:precision binary32
:pre (and (> cosTheta_i 0.9999) (<= cosTheta_i 1.0) (<= 2.328306437e-10 u1 1.0) (<= 2.328306437e-10 u2 1.0))
(* (sqrt (- (log (- 1.0 u1)))) (cos (* (* 2.0 PI) u2))))