\left(\left(-\alpha\right) \cdot \alpha\right) \cdot \log \left(1 - u0\right)
\begin{array}{l}
\mathbf{if}\;1 - u0 \leq 0.9620054960250854:\\
\;\;\;\;\begin{array}{l}
t_0 := \sqrt[3]{\log \left(1 - u0\right)}\\
t_0 \cdot \left(\left(t_0 \cdot t_0\right) \cdot \left(\alpha \cdot \left(-\alpha\right)\right)\right)
\end{array}\\
\mathbf{else}:\\
\;\;\;\;\begin{array}{l}
t_1 := \sqrt{u0 \cdot \left(u0 \cdot \left(0.5 + u0 \cdot 0.3333333333333333\right)\right)}\\
\left(\alpha \cdot \alpha\right) \cdot \left(u0 + \left(t_1 \cdot t_1 + 0.25 \cdot {u0}^{4}\right)\right)
\end{array}\\
\end{array}
(FPCore (alpha u0) :precision binary32 (* (* (- alpha) alpha) (log (- 1.0 u0))))
(FPCore (alpha u0)
:precision binary32
(if (<= (- 1.0 u0) 0.9620054960250854)
(let* ((t_0 (cbrt (log (- 1.0 u0)))))
(* t_0 (* (* t_0 t_0) (* alpha (- alpha)))))
(let* ((t_1 (sqrt (* u0 (* u0 (+ 0.5 (* u0 0.3333333333333333)))))))
(* (* alpha alpha) (+ u0 (+ (* t_1 t_1) (* 0.25 (pow u0 4.0))))))))float code(float alpha, float u0) {
return (-alpha * alpha) * logf(1.0f - u0);
}
float code(float alpha, float u0) {
float tmp;
if ((1.0f - u0) <= 0.9620054960250854f) {
float t_0_1 = cbrtf(logf(1.0f - u0));
tmp = t_0_1 * ((t_0_1 * t_0_1) * (alpha * -alpha));
} else {
float t_1 = sqrtf(u0 * (u0 * (0.5f + (u0 * 0.3333333333333333f))));
tmp = (alpha * alpha) * (u0 + ((t_1 * t_1) + (0.25f * powf(u0, 4.0f))));
}
return tmp;
}



Bits error versus alpha



Bits error versus u0
Results
if (-.f32 1 u0) < 0.962005496Initial program 1.1
rmApplied add-cube-cbrt_binary321.3
Applied associate-*r*_binary321.3
Simplified1.3
if 0.962005496 < (-.f32 1 u0) Initial program 16.3
Taylor expanded around 0 0.4
Simplified0.4
rmApplied add-sqr-sqrt_binary320.4
Simplified0.4
Simplified0.4
Final simplification0.5
herbie shell --seed 2021204
(FPCore (alpha u0)
:name "Beckmann Distribution sample, tan2theta, alphax == alphay"
:precision binary32
:pre (and (<= 0.0001 alpha 1.0) (<= 2.328306437e-10 u0 1.0))
(* (* (- alpha) alpha) (log (- 1.0 u0))))