
(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 4 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 * alpha) * Float32(-log1p(Float32(-u0)))) end
\begin{array}{l}
\\
\left(\alpha \cdot \alpha\right) \cdot \left(-\mathsf{log1p}\left(-u0\right)\right)
\end{array}
Initial program 53.9%
distribute-lft-neg-out53.9%
sub-neg53.9%
log1p-def99.1%
Simplified99.1%
Final simplification99.1%
(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\right) \cdot \left(\alpha \cdot \mathsf{log1p}\left(-u0\right)\right)
\end{array}
Initial program 53.9%
associate-*l*53.9%
distribute-lft-neg-out53.9%
distribute-rgt-neg-in53.9%
distribute-rgt-neg-in53.9%
distribute-rgt-neg-in53.9%
distribute-lft-neg-out53.9%
sub-neg53.9%
log1p-def99.0%
Simplified99.0%
Final simplification99.0%
(FPCore (alpha u0) :precision binary32 (* alpha (/ alpha (- (/ 1.0 u0) 0.5))))
float code(float alpha, float u0) {
return alpha * (alpha / ((1.0f / u0) - 0.5f));
}
real(4) function code(alpha, u0)
real(4), intent (in) :: alpha
real(4), intent (in) :: u0
code = alpha * (alpha / ((1.0e0 / u0) - 0.5e0))
end function
function code(alpha, u0) return Float32(alpha * Float32(alpha / Float32(Float32(Float32(1.0) / u0) - Float32(0.5)))) end
function tmp = code(alpha, u0) tmp = alpha * (alpha / ((single(1.0) / u0) - single(0.5))); end
\begin{array}{l}
\\
\alpha \cdot \frac{\alpha}{\frac{1}{u0} - 0.5}
\end{array}
Initial program 53.9%
associate-*l*53.9%
distribute-lft-neg-out53.9%
distribute-rgt-neg-in53.9%
distribute-rgt-neg-in53.9%
distribute-rgt-neg-in53.9%
distribute-lft-neg-out53.9%
sub-neg53.9%
log1p-def99.0%
Simplified99.0%
Taylor expanded in u0 around 0 87.3%
+-commutative87.3%
*-commutative87.3%
associate-*l*87.3%
distribute-lft-out87.3%
Simplified87.3%
flip-+87.1%
associate-*r/86.9%
unpow286.9%
swap-sqr86.9%
pow-sqr86.9%
metadata-eval86.9%
metadata-eval86.9%
*-commutative86.9%
cancel-sign-sub-inv86.9%
metadata-eval86.9%
Applied egg-rr86.9%
associate-/l*87.0%
*-commutative87.0%
*-commutative87.0%
Simplified87.0%
Taylor expanded in u0 around 0 88.9%
Final simplification88.9%
(FPCore (alpha u0) :precision binary32 (* alpha (* alpha u0)))
float code(float alpha, float u0) {
return alpha * (alpha * u0);
}
real(4) function code(alpha, u0)
real(4), intent (in) :: alpha
real(4), intent (in) :: u0
code = alpha * (alpha * u0)
end function
function code(alpha, u0) return Float32(alpha * Float32(alpha * u0)) end
function tmp = code(alpha, u0) tmp = alpha * (alpha * u0); end
\begin{array}{l}
\\
\alpha \cdot \left(\alpha \cdot u0\right)
\end{array}
Initial program 53.9%
associate-*l*53.9%
distribute-lft-neg-out53.9%
distribute-rgt-neg-in53.9%
distribute-rgt-neg-in53.9%
distribute-rgt-neg-in53.9%
distribute-lft-neg-out53.9%
sub-neg53.9%
log1p-def99.0%
Simplified99.0%
Taylor expanded in u0 around 0 75.2%
Final simplification75.2%
herbie shell --seed 2024018
(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))))