
(FPCore (k n) :precision binary64 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return (1.0 / sqrt(k)) * pow(((2.0 * ((double) M_PI)) * n), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return (1.0 / Math.sqrt(k)) * Math.pow(((2.0 * Math.PI) * n), ((1.0 - k) / 2.0));
}
def code(k, n): return (1.0 / math.sqrt(k)) * math.pow(((2.0 * math.pi) * n), ((1.0 - k) / 2.0))
function code(k, n) return Float64(Float64(1.0 / sqrt(k)) * (Float64(Float64(2.0 * pi) * n) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (1.0 / sqrt(k)) * (((2.0 * pi) * n) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (k n) :precision binary64 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return (1.0 / sqrt(k)) * pow(((2.0 * ((double) M_PI)) * n), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return (1.0 / Math.sqrt(k)) * Math.pow(((2.0 * Math.PI) * n), ((1.0 - k) / 2.0));
}
def code(k, n): return (1.0 / math.sqrt(k)) * math.pow(((2.0 * math.pi) * n), ((1.0 - k) / 2.0))
function code(k, n) return Float64(Float64(1.0 / sqrt(k)) * (Float64(Float64(2.0 * pi) * n) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (1.0 / sqrt(k)) * (((2.0 * pi) * n) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (/ (- 1.0 k) 2.0)) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), ((1.0 - k) / 2.0)) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (2.0 * n)), ((1.0 - k) / 2.0)) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (2.0 * n)), ((1.0 - k) / 2.0)) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(Float64(1.0 - k) / 2.0)) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (2.0 * n)) ^ ((1.0 - k) / 2.0)) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(\frac{1 - k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.2%
associate-*l/99.3%
*-lft-identity99.3%
*-commutative99.3%
associate-*l*99.3%
Simplified99.3%
Final simplification99.3%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* PI (* 2.0 n))))
(if (<= k 2.6e-48)
(/ (sqrt t_0) (sqrt k))
(sqrt (/ (pow t_0 (- 1.0 k)) k)))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
double tmp;
if (k <= 2.6e-48) {
tmp = sqrt(t_0) / sqrt(k);
} else {
tmp = sqrt((pow(t_0, (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
double tmp;
if (k <= 2.6e-48) {
tmp = Math.sqrt(t_0) / Math.sqrt(k);
} else {
tmp = Math.sqrt((Math.pow(t_0, (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): t_0 = math.pi * (2.0 * n) tmp = 0 if k <= 2.6e-48: tmp = math.sqrt(t_0) / math.sqrt(k) else: tmp = math.sqrt((math.pow(t_0, (1.0 - k)) / k)) return tmp
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) tmp = 0.0 if (k <= 2.6e-48) tmp = Float64(sqrt(t_0) / sqrt(k)); else tmp = sqrt(Float64((t_0 ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) t_0 = pi * (2.0 * n); tmp = 0.0; if (k <= 2.6e-48) tmp = sqrt(t_0) / sqrt(k); else tmp = sqrt(((t_0 ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 2.6e-48], N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[t$95$0, N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(2 \cdot n\right)\\
\mathbf{if}\;k \leq 2.6 \cdot 10^{-48}:\\
\;\;\;\;\frac{\sqrt{t_0}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{t_0}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 2.59999999999999987e-48Initial program 99.3%
*-commutative99.3%
*-commutative99.3%
associate-*r*99.3%
div-inv99.5%
expm1-log1p-u93.2%
expm1-udef73.1%
Applied egg-rr51.9%
expm1-def72.0%
expm1-log1p76.0%
*-commutative76.0%
associate-*r*76.0%
*-commutative76.0%
Simplified76.0%
Taylor expanded in k around 0 76.0%
*-commutative76.0%
Simplified76.0%
sqrt-div99.5%
associate-*r*99.5%
*-commutative99.5%
associate-*r*99.5%
Applied egg-rr99.5%
if 2.59999999999999987e-48 < k Initial program 99.2%
*-commutative99.2%
*-commutative99.2%
associate-*r*99.2%
div-inv99.2%
expm1-log1p-u98.8%
expm1-udef86.9%
Applied egg-rr86.9%
expm1-def98.2%
expm1-log1p98.6%
*-commutative98.6%
associate-*r*98.6%
*-commutative98.6%
Simplified98.6%
Final simplification99.0%
(FPCore (k n) :precision binary64 (if (<= k 1.18e+219) (/ (sqrt (* PI (* 2.0 n))) (sqrt k)) (pow (* (pow (* PI (/ n k)) 2.0) 4.0) 0.25)))
double code(double k, double n) {
double tmp;
if (k <= 1.18e+219) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
} else {
tmp = pow((pow((((double) M_PI) * (n / k)), 2.0) * 4.0), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.18e+219) {
tmp = Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
} else {
tmp = Math.pow((Math.pow((Math.PI * (n / k)), 2.0) * 4.0), 0.25);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.18e+219: tmp = math.sqrt((math.pi * (2.0 * n))) / math.sqrt(k) else: tmp = math.pow((math.pow((math.pi * (n / k)), 2.0) * 4.0), 0.25) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.18e+219) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)); else tmp = Float64((Float64(pi * Float64(n / k)) ^ 2.0) * 4.0) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.18e+219) tmp = sqrt((pi * (2.0 * n))) / sqrt(k); else tmp = (((pi * (n / k)) ^ 2.0) * 4.0) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.18e+219], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[Power[N[(Pi * N[(n / k), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * 4.0), $MachinePrecision], 0.25], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.18 \cdot 10^{+219}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left({\left(\pi \cdot \frac{n}{k}\right)}^{2} \cdot 4\right)}^{0.25}\\
\end{array}
\end{array}
if k < 1.18e219Initial program 99.1%
*-commutative99.1%
*-commutative99.1%
associate-*r*99.1%
div-inv99.2%
expm1-log1p-u95.8%
expm1-udef78.3%
Applied egg-rr67.3%
expm1-def84.4%
expm1-log1p86.7%
*-commutative86.7%
associate-*r*86.7%
*-commutative86.7%
Simplified86.7%
Taylor expanded in k around 0 50.1%
*-commutative50.1%
Simplified50.1%
sqrt-div62.3%
associate-*r*62.3%
*-commutative62.3%
associate-*r*62.3%
Applied egg-rr62.3%
if 1.18e219 < k Initial program 100.0%
*-commutative100.0%
*-commutative100.0%
associate-*r*100.0%
div-inv100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
Applied egg-rr100.0%
expm1-def100.0%
expm1-log1p100.0%
*-commutative100.0%
associate-*r*100.0%
*-commutative100.0%
Simplified100.0%
Taylor expanded in k around 0 2.7%
*-commutative2.7%
Simplified2.7%
Taylor expanded in n around 0 2.7%
associate-/l*2.7%
associate-/r/2.7%
Simplified2.7%
pow1/22.7%
metadata-eval2.7%
associate-*l/2.7%
*-commutative2.7%
times-frac2.7%
*-un-lft-identity2.7%
metadata-eval2.7%
pow-prod-up2.7%
pow-prod-down24.8%
Applied egg-rr24.8%
Final simplification58.5%
(FPCore (k n) :precision binary64 (/ (sqrt (* PI (* 2.0 n))) (sqrt k)))
double code(double k, double n) {
return sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((math.pi * (2.0 * n))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((pi * (2.0 * n))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}
\end{array}
Initial program 99.2%
*-commutative99.2%
*-commutative99.2%
associate-*r*99.2%
div-inv99.3%
expm1-log1p-u96.2%
expm1-udef80.5%
Applied egg-rr70.6%
expm1-def86.0%
expm1-log1p88.1%
*-commutative88.1%
associate-*r*88.1%
*-commutative88.1%
Simplified88.1%
Taylor expanded in k around 0 45.3%
*-commutative45.3%
Simplified45.3%
sqrt-div56.2%
associate-*r*56.2%
*-commutative56.2%
associate-*r*56.2%
Applied egg-rr56.2%
Final simplification56.2%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (* 0.5 (/ k (* PI n))))))
double code(double k, double n) {
return 1.0 / sqrt((0.5 * (k / (((double) M_PI) * n))));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt((0.5 * (k / (Math.PI * n))));
}
def code(k, n): return 1.0 / math.sqrt((0.5 * (k / (math.pi * n))))
function code(k, n) return Float64(1.0 / sqrt(Float64(0.5 * Float64(k / Float64(pi * n))))) end
function tmp = code(k, n) tmp = 1.0 / sqrt((0.5 * (k / (pi * n)))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(0.5 * N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{0.5 \cdot \frac{k}{\pi \cdot n}}}
\end{array}
Initial program 99.2%
*-commutative99.2%
*-commutative99.2%
associate-*r*99.2%
div-inv99.3%
expm1-log1p-u96.2%
expm1-udef80.5%
Applied egg-rr70.6%
expm1-def86.0%
expm1-log1p88.1%
*-commutative88.1%
associate-*r*88.1%
*-commutative88.1%
Simplified88.1%
Taylor expanded in k around 0 45.3%
*-commutative45.3%
Simplified45.3%
Taylor expanded in n around 0 45.3%
associate-/l*45.4%
associate-/r/45.3%
Simplified45.3%
metadata-eval45.3%
associate-*l/45.3%
*-commutative45.3%
times-frac45.3%
*-un-lft-identity45.3%
clear-num45.3%
sqrt-div45.8%
metadata-eval45.8%
*-un-lft-identity45.8%
times-frac45.8%
metadata-eval45.8%
*-commutative45.8%
Applied egg-rr45.8%
Final simplification45.8%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (* 0.5 (/ (/ k n) PI)))))
double code(double k, double n) {
return 1.0 / sqrt((0.5 * ((k / n) / ((double) M_PI))));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt((0.5 * ((k / n) / Math.PI)));
}
def code(k, n): return 1.0 / math.sqrt((0.5 * ((k / n) / math.pi)))
function code(k, n) return Float64(1.0 / sqrt(Float64(0.5 * Float64(Float64(k / n) / pi)))) end
function tmp = code(k, n) tmp = 1.0 / sqrt((0.5 * ((k / n) / pi))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(0.5 * N[(N[(k / n), $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{0.5 \cdot \frac{\frac{k}{n}}{\pi}}}
\end{array}
Initial program 99.2%
*-commutative99.2%
*-commutative99.2%
associate-*r*99.2%
div-inv99.3%
expm1-log1p-u96.2%
expm1-udef80.5%
Applied egg-rr70.6%
expm1-def86.0%
expm1-log1p88.1%
*-commutative88.1%
associate-*r*88.1%
*-commutative88.1%
Simplified88.1%
Taylor expanded in k around 0 45.3%
*-commutative45.3%
Simplified45.3%
Taylor expanded in n around 0 45.3%
associate-/l*45.4%
associate-/r/45.3%
Simplified45.3%
metadata-eval45.3%
associate-*l/45.3%
*-commutative45.3%
times-frac45.3%
*-un-lft-identity45.3%
clear-num45.3%
sqrt-div45.8%
metadata-eval45.8%
*-un-lft-identity45.8%
times-frac45.8%
metadata-eval45.8%
*-commutative45.8%
Applied egg-rr45.8%
associate-/r*45.8%
Simplified45.8%
Final simplification45.8%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (* PI (/ n k)))))
double code(double k, double n) {
return sqrt((2.0 * (((double) M_PI) * (n / k))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (Math.PI * (n / k))));
}
def code(k, n): return math.sqrt((2.0 * (math.pi * (n / k))))
function code(k, n) return sqrt(Float64(2.0 * Float64(pi * Float64(n / k)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (pi * (n / k)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(Pi * N[(n / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(\pi \cdot \frac{n}{k}\right)}
\end{array}
Initial program 99.2%
*-commutative99.2%
*-commutative99.2%
associate-*r*99.2%
div-inv99.3%
expm1-log1p-u96.2%
expm1-udef80.5%
Applied egg-rr70.6%
expm1-def86.0%
expm1-log1p88.1%
*-commutative88.1%
associate-*r*88.1%
*-commutative88.1%
Simplified88.1%
Taylor expanded in k around 0 45.3%
*-commutative45.3%
Simplified45.3%
Taylor expanded in n around 0 45.3%
associate-/l*45.4%
associate-/r/45.3%
Simplified45.3%
Final simplification45.3%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (/ PI (/ k n)))))
double code(double k, double n) {
return sqrt((2.0 * (((double) M_PI) / (k / n))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (Math.PI / (k / n))));
}
def code(k, n): return math.sqrt((2.0 * (math.pi / (k / n))))
function code(k, n) return sqrt(Float64(2.0 * Float64(pi / Float64(k / n)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (pi / (k / n)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(Pi / N[(k / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{\pi}{\frac{k}{n}}}
\end{array}
Initial program 99.2%
*-commutative99.2%
*-commutative99.2%
associate-*r*99.2%
div-inv99.3%
expm1-log1p-u96.2%
expm1-udef80.5%
Applied egg-rr70.6%
expm1-def86.0%
expm1-log1p88.1%
*-commutative88.1%
associate-*r*88.1%
*-commutative88.1%
Simplified88.1%
Taylor expanded in k around 0 45.3%
*-commutative45.3%
Simplified45.3%
Taylor expanded in n around 0 45.3%
associate-/l*45.4%
associate-/r/45.3%
Simplified45.3%
*-commutative45.3%
clear-num45.3%
un-div-inv45.4%
Applied egg-rr45.4%
Final simplification45.4%
herbie shell --seed 2023217
(FPCore (k n)
:name "Migdal et al, Equation (51)"
:precision binary64
(* (/ 1.0 (sqrt k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))