
(FPCore (alpha u0) :precision binary32 (* (* (- alpha) alpha) (log (- 1.0 u0))))
float code(float alpha, float u0) {
return (-alpha * alpha) * logf((1.0f - u0));
}
real(4) function code(alpha, u0)
real(4), intent (in) :: alpha
real(4), intent (in) :: u0
code = (-alpha * alpha) * log((1.0e0 - u0))
end function
function code(alpha, u0) return Float32(Float32(Float32(-alpha) * alpha) * log(Float32(Float32(1.0) - u0))) end
function tmp = code(alpha, u0) tmp = (-alpha * alpha) * log((single(1.0) - u0)); end
\begin{array}{l}
\\
\left(\left(-\alpha\right) \cdot \alpha\right) \cdot \log \left(1 - u0\right)
\end{array}
Sampling outcomes in binary32 precision:
Herbie found 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha u0) :precision binary32 (* (* (- alpha) alpha) (log (- 1.0 u0))))
float code(float alpha, float u0) {
return (-alpha * alpha) * logf((1.0f - u0));
}
real(4) function code(alpha, u0)
real(4), intent (in) :: alpha
real(4), intent (in) :: u0
code = (-alpha * alpha) * log((1.0e0 - u0))
end function
function code(alpha, u0) return Float32(Float32(Float32(-alpha) * alpha) * log(Float32(Float32(1.0) - u0))) end
function tmp = code(alpha, u0) tmp = (-alpha * alpha) * log((single(1.0) - u0)); end
\begin{array}{l}
\\
\left(\left(-\alpha\right) \cdot \alpha\right) \cdot \log \left(1 - u0\right)
\end{array}
(FPCore (alpha u0) :precision binary32 (* (* alpha (- alpha)) (log1p (- u0))))
float code(float alpha, float u0) {
return (alpha * -alpha) * log1pf(-u0);
}
function code(alpha, u0) return Float32(Float32(alpha * Float32(-alpha)) * log1p(Float32(-u0))) end
\begin{array}{l}
\\
\left(\alpha \cdot \left(-\alpha\right)\right) \cdot \mathsf{log1p}\left(-u0\right)
\end{array}
Initial program 54.4%
lift-log.f32N/A
lift--.f32N/A
sub-negN/A
lower-log1p.f32N/A
lower-neg.f3299.0
Applied rewrites99.0%
Final simplification99.0%
(FPCore (alpha u0) :precision binary32 (* alpha (* (- alpha) (log1p (- u0)))))
float code(float alpha, float u0) {
return alpha * (-alpha * log1pf(-u0));
}
function code(alpha, u0) return Float32(alpha * Float32(Float32(-alpha) * log1p(Float32(-u0)))) end
\begin{array}{l}
\\
\alpha \cdot \left(\left(-\alpha\right) \cdot \mathsf{log1p}\left(-u0\right)\right)
\end{array}
Initial program 55.4%
Applied rewrites84.5%
lift-*.f32N/A
lift-*.f32N/A
cube-unmultN/A
sqr-powN/A
unpow-prod-downN/A
sqr-negN/A
lift-neg.f32N/A
lift-neg.f32N/A
unpow-prod-downN/A
sqr-powN/A
unpow3N/A
lift-neg.f32N/A
lift-neg.f32N/A
sqr-negN/A
lift-*.f32N/A
lower-*.f3298.7
Applied rewrites98.7%
lift-*.f32N/A
lift-*.f32N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
Applied rewrites99.0%
Final simplification99.0%
herbie shell --seed 2024228
(FPCore (alpha u0)
:name "Beckmann Distribution sample, tan2theta, alphax == alphay"
:precision binary32
:pre (and (and (<= 0.0001 alpha) (<= alpha 1.0)) (and (<= 2.328306437e-10 u0) (<= u0 1.0)))
(* (* (- alpha) alpha) (log (- 1.0 u0))))