\left(\left(-\alpha\right) \cdot \alpha\right) \cdot \log \left(1 - u0\right)
\begin{array}{l}
\mathbf{if}\;1 - u0 \leq 0.9592684507369995:\\
\;\;\;\;\log \left(1 - u0\right) \cdot \left(\alpha \cdot \left(-\alpha\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\alpha \cdot \left(u0 \cdot \alpha + \left(0.25 \cdot \left(\alpha \cdot {u0}^{4}\right) + \left(0.5 \cdot \left(\alpha \cdot {u0}^{2}\right) + 0.3333333333333333 \cdot \left(\alpha \cdot {u0}^{3}\right)\right)\right)\right)\\
\end{array}(FPCore (alpha u0) :precision binary32 (* (* (- alpha) alpha) (log (- 1.0 u0))))
(FPCore (alpha u0)
:precision binary32
(if (<= (- 1.0 u0) 0.9592684507369995)
(* (log (- 1.0 u0)) (* alpha (- alpha)))
(*
alpha
(+
(* u0 alpha)
(+
(* 0.25 (* alpha (pow u0 4.0)))
(+
(* 0.5 (* alpha (pow u0 2.0)))
(* 0.3333333333333333 (* alpha (pow u0 3.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.9592684507369995f) {
tmp = logf(1.0f - u0) * (alpha * -alpha);
} else {
tmp = alpha * ((u0 * alpha) + ((0.25f * (alpha * powf(u0, 4.0f))) + ((0.5f * (alpha * powf(u0, 2.0f))) + (0.3333333333333333f * (alpha * powf(u0, 3.0f))))));
}
return tmp;
}



Bits error versus alpha



Bits error versus u0
Results
if (-.f32 1 u0) < 0.959268451Initial program 1.0
rmApplied *-commutative_binary321.0
if 0.959268451 < (-.f32 1 u0) Initial program 16.5
Taylor expanded around 0 0.4
Simplified0.4
rmApplied associate-*l*_binary320.4
Simplified0.5
Taylor expanded around 0 0.4
Final simplification0.5
herbie shell --seed 2021174
(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))))