
(FPCore (f) :precision binary64 (let* ((t_0 (* (/ PI 4.0) f)) (t_1 (exp t_0)) (t_2 (exp (- t_0)))) (- (* (/ 1.0 (/ PI 4.0)) (log (/ (+ t_1 t_2) (- t_1 t_2)))))))
double code(double f) {
double t_0 = (((double) M_PI) / 4.0) * f;
double t_1 = exp(t_0);
double t_2 = exp(-t_0);
return -((1.0 / (((double) M_PI) / 4.0)) * log(((t_1 + t_2) / (t_1 - t_2))));
}
public static double code(double f) {
double t_0 = (Math.PI / 4.0) * f;
double t_1 = Math.exp(t_0);
double t_2 = Math.exp(-t_0);
return -((1.0 / (Math.PI / 4.0)) * Math.log(((t_1 + t_2) / (t_1 - t_2))));
}
def code(f): t_0 = (math.pi / 4.0) * f t_1 = math.exp(t_0) t_2 = math.exp(-t_0) return -((1.0 / (math.pi / 4.0)) * math.log(((t_1 + t_2) / (t_1 - t_2))))
function code(f) t_0 = Float64(Float64(pi / 4.0) * f) t_1 = exp(t_0) t_2 = exp(Float64(-t_0)) return Float64(-Float64(Float64(1.0 / Float64(pi / 4.0)) * log(Float64(Float64(t_1 + t_2) / Float64(t_1 - t_2))))) end
function tmp = code(f) t_0 = (pi / 4.0) * f; t_1 = exp(t_0); t_2 = exp(-t_0); tmp = -((1.0 / (pi / 4.0)) * log(((t_1 + t_2) / (t_1 - t_2)))); end
code[f_] := Block[{t$95$0 = N[(N[(Pi / 4.0), $MachinePrecision] * f), $MachinePrecision]}, Block[{t$95$1 = N[Exp[t$95$0], $MachinePrecision]}, Block[{t$95$2 = N[Exp[(-t$95$0)], $MachinePrecision]}, (-N[(N[(1.0 / N[(Pi / 4.0), $MachinePrecision]), $MachinePrecision] * N[Log[N[(N[(t$95$1 + t$95$2), $MachinePrecision] / N[(t$95$1 - t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{\pi}{4} \cdot f\\
t_1 := e^{t_0}\\
t_2 := e^{-t_0}\\
-\frac{1}{\frac{\pi}{4}} \cdot \log \left(\frac{t_1 + t_2}{t_1 - t_2}\right)
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 3 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (f) :precision binary64 (let* ((t_0 (* (/ PI 4.0) f)) (t_1 (exp t_0)) (t_2 (exp (- t_0)))) (- (* (/ 1.0 (/ PI 4.0)) (log (/ (+ t_1 t_2) (- t_1 t_2)))))))
double code(double f) {
double t_0 = (((double) M_PI) / 4.0) * f;
double t_1 = exp(t_0);
double t_2 = exp(-t_0);
return -((1.0 / (((double) M_PI) / 4.0)) * log(((t_1 + t_2) / (t_1 - t_2))));
}
public static double code(double f) {
double t_0 = (Math.PI / 4.0) * f;
double t_1 = Math.exp(t_0);
double t_2 = Math.exp(-t_0);
return -((1.0 / (Math.PI / 4.0)) * Math.log(((t_1 + t_2) / (t_1 - t_2))));
}
def code(f): t_0 = (math.pi / 4.0) * f t_1 = math.exp(t_0) t_2 = math.exp(-t_0) return -((1.0 / (math.pi / 4.0)) * math.log(((t_1 + t_2) / (t_1 - t_2))))
function code(f) t_0 = Float64(Float64(pi / 4.0) * f) t_1 = exp(t_0) t_2 = exp(Float64(-t_0)) return Float64(-Float64(Float64(1.0 / Float64(pi / 4.0)) * log(Float64(Float64(t_1 + t_2) / Float64(t_1 - t_2))))) end
function tmp = code(f) t_0 = (pi / 4.0) * f; t_1 = exp(t_0); t_2 = exp(-t_0); tmp = -((1.0 / (pi / 4.0)) * log(((t_1 + t_2) / (t_1 - t_2)))); end
code[f_] := Block[{t$95$0 = N[(N[(Pi / 4.0), $MachinePrecision] * f), $MachinePrecision]}, Block[{t$95$1 = N[Exp[t$95$0], $MachinePrecision]}, Block[{t$95$2 = N[Exp[(-t$95$0)], $MachinePrecision]}, (-N[(N[(1.0 / N[(Pi / 4.0), $MachinePrecision]), $MachinePrecision] * N[Log[N[(N[(t$95$1 + t$95$2), $MachinePrecision] / N[(t$95$1 - t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{\pi}{4} \cdot f\\
t_1 := e^{t_0}\\
t_2 := e^{-t_0}\\
-\frac{1}{\frac{\pi}{4}} \cdot \log \left(\frac{t_1 + t_2}{t_1 - t_2}\right)
\end{array}
\end{array}
(FPCore (f) :precision binary64 (- (fma 0.08333333333333333 (* PI (* f f)) (/ (log (/ 4.0 (* PI f))) (* PI 0.25)))))
double code(double f) {
return -fma(0.08333333333333333, (((double) M_PI) * (f * f)), (log((4.0 / (((double) M_PI) * f))) / (((double) M_PI) * 0.25)));
}
function code(f) return Float64(-fma(0.08333333333333333, Float64(pi * Float64(f * f)), Float64(log(Float64(4.0 / Float64(pi * f))) / Float64(pi * 0.25)))) end
code[f_] := (-N[(0.08333333333333333 * N[(Pi * N[(f * f), $MachinePrecision]), $MachinePrecision] + N[(N[Log[N[(4.0 / N[(Pi * f), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(Pi * 0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])
\begin{array}{l}
\\
-\mathsf{fma}\left(0.08333333333333333, \pi \cdot \left(f \cdot f\right), \frac{\log \left(\frac{4}{\pi \cdot f}\right)}{\pi \cdot 0.25}\right)
\end{array}
Initial program 5.1%
Taylor expanded in f around 0 97.2%
Simplified97.2%
fma-udef97.2%
pow-div97.2%
metadata-eval97.2%
pow197.2%
*-rgt-identity97.2%
div-inv97.2%
*-commutative97.2%
metadata-eval97.2%
Applied egg-rr97.2%
associate-*l*97.2%
associate-*l*97.2%
metadata-eval97.2%
distribute-lft-out97.2%
metadata-eval97.2%
metadata-eval97.2%
Simplified97.2%
Taylor expanded in f around 0 97.3%
Simplified97.3%
Final simplification97.3%
(FPCore (f) :precision binary64 (* 4.0 (/ (- (log (/ 4.0 (* PI f)))) PI)))
double code(double f) {
return 4.0 * (-log((4.0 / (((double) M_PI) * f))) / ((double) M_PI));
}
public static double code(double f) {
return 4.0 * (-Math.log((4.0 / (Math.PI * f))) / Math.PI);
}
def code(f): return 4.0 * (-math.log((4.0 / (math.pi * f))) / math.pi)
function code(f) return Float64(4.0 * Float64(Float64(-log(Float64(4.0 / Float64(pi * f)))) / pi)) end
function tmp = code(f) tmp = 4.0 * (-log((4.0 / (pi * f))) / pi); end
code[f_] := N[(4.0 * N[((-N[Log[N[(4.0 / N[(Pi * f), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / Pi), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
4 \cdot \frac{-\log \left(\frac{4}{\pi \cdot f}\right)}{\pi}
\end{array}
Initial program 5.1%
Taylor expanded in f around 0 97.0%
*-commutative97.0%
associate-/r*97.0%
distribute-rgt-out--97.0%
metadata-eval97.0%
Simplified97.0%
Taylor expanded in f around 0 97.1%
associate-*r/97.1%
neg-mul-197.1%
+-commutative97.1%
log-rec97.1%
log-rec97.1%
+-commutative97.1%
remove-double-neg97.1%
mul-1-neg97.1%
log-rec97.1%
sub-neg97.1%
*-commutative97.1%
associate-*l/97.1%
Simplified97.2%
Final simplification97.2%
(FPCore (f) :precision binary64 (* 0.08333333333333333 (* f (* PI (- f)))))
double code(double f) {
return 0.08333333333333333 * (f * (((double) M_PI) * -f));
}
public static double code(double f) {
return 0.08333333333333333 * (f * (Math.PI * -f));
}
def code(f): return 0.08333333333333333 * (f * (math.pi * -f))
function code(f) return Float64(0.08333333333333333 * Float64(f * Float64(pi * Float64(-f)))) end
function tmp = code(f) tmp = 0.08333333333333333 * (f * (pi * -f)); end
code[f_] := N[(0.08333333333333333 * N[(f * N[(Pi * (-f)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.08333333333333333 \cdot \left(f \cdot \left(\pi \cdot \left(-f\right)\right)\right)
\end{array}
Initial program 5.1%
Taylor expanded in f around 0 97.2%
Simplified97.2%
fma-udef97.2%
pow-div97.2%
metadata-eval97.2%
pow197.2%
*-rgt-identity97.2%
div-inv97.2%
*-commutative97.2%
metadata-eval97.2%
Applied egg-rr97.2%
associate-*l*97.2%
associate-*l*97.2%
metadata-eval97.2%
distribute-lft-out97.2%
metadata-eval97.2%
metadata-eval97.2%
Simplified97.2%
Taylor expanded in f around inf 4.0%
*-commutative4.0%
unpow24.0%
Simplified4.0%
Taylor expanded in f around 0 4.0%
unpow24.0%
associate-*l*4.0%
Simplified4.0%
Final simplification4.0%
herbie shell --seed 2023291
(FPCore (f)
:name "VandenBroeck and Keller, Equation (20)"
:precision binary64
(- (* (/ 1.0 (/ PI 4.0)) (log (/ (+ (exp (* (/ PI 4.0) f)) (exp (- (* (/ PI 4.0) f)))) (- (exp (* (/ PI 4.0) f)) (exp (- (* (/ PI 4.0) f)))))))))