
(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 6 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 (if (<= k 3e-33) (* (sqrt (/ PI k)) (sqrt (* 2.0 n))) (sqrt (* (pow (* PI (* 2.0 n)) (- 1.0 k)) (/ 1.0 k)))))
double code(double k, double n) {
double tmp;
if (k <= 3e-33) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
} else {
tmp = sqrt((pow((((double) M_PI) * (2.0 * n)), (1.0 - k)) * (1.0 / k)));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 3e-33) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
} else {
tmp = Math.sqrt((Math.pow((Math.PI * (2.0 * n)), (1.0 - k)) * (1.0 / k)));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 3e-33: tmp = math.sqrt((math.pi / k)) * math.sqrt((2.0 * n)) else: tmp = math.sqrt((math.pow((math.pi * (2.0 * n)), (1.0 - k)) * (1.0 / k))) return tmp
function code(k, n) tmp = 0.0 if (k <= 3e-33) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))); else tmp = sqrt(Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(1.0 - k)) * Float64(1.0 / k))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 3e-33) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); else tmp = sqrt((((pi * (2.0 * n)) ^ (1.0 - k)) * (1.0 / k))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3e-33], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] * N[(1.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3 \cdot 10^{-33}:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(1 - k\right)} \cdot \frac{1}{k}}\\
\end{array}
\end{array}
if k < 3.0000000000000002e-33Initial program 99.3%
add-sqr-sqrt99.0%
sqrt-unprod71.1%
associate-*l/71.2%
*-un-lft-identity71.2%
associate-*l/71.3%
*-un-lft-identity71.3%
frac-times71.2%
Applied egg-rr71.3%
Simplified71.4%
Taylor expanded in k around 0 71.4%
expm1-log1p-u68.0%
expm1-udef50.4%
associate-/l*50.4%
Applied egg-rr50.4%
expm1-def68.1%
expm1-log1p71.4%
associate-/l*71.4%
associate-*r/71.4%
Simplified71.4%
pow1/271.4%
associate-*r*71.4%
unpow-prod-down99.5%
pow1/299.5%
Applied egg-rr99.5%
*-commutative99.5%
unpow1/299.5%
*-commutative99.5%
Simplified99.5%
if 3.0000000000000002e-33 < k Initial program 99.7%
add-sqr-sqrt99.7%
sqrt-unprod99.7%
associate-*l/99.7%
*-un-lft-identity99.7%
associate-*l/99.7%
*-un-lft-identity99.7%
frac-times99.7%
Applied egg-rr99.7%
Simplified99.7%
div-inv99.7%
Applied egg-rr99.7%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 5.5e-36) (* (sqrt (/ PI k)) (sqrt (* 2.0 n))) (sqrt (/ (pow (* PI (* 2.0 n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 5.5e-36) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
} else {
tmp = sqrt((pow((((double) M_PI) * (2.0 * n)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5.5e-36) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
} else {
tmp = Math.sqrt((Math.pow((Math.PI * (2.0 * n)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 5.5e-36: tmp = math.sqrt((math.pi / k)) * math.sqrt((2.0 * n)) else: tmp = math.sqrt((math.pow((math.pi * (2.0 * n)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 5.5e-36) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))); else tmp = sqrt(Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 5.5e-36) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); else tmp = sqrt((((pi * (2.0 * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5.5e-36], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5.5 \cdot 10^{-36}:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 5.49999999999999984e-36Initial program 99.3%
add-sqr-sqrt99.0%
sqrt-unprod71.1%
associate-*l/71.2%
*-un-lft-identity71.2%
associate-*l/71.3%
*-un-lft-identity71.3%
frac-times71.2%
Applied egg-rr71.3%
Simplified71.4%
Taylor expanded in k around 0 71.4%
expm1-log1p-u68.0%
expm1-udef50.4%
associate-/l*50.4%
Applied egg-rr50.4%
expm1-def68.1%
expm1-log1p71.4%
associate-/l*71.4%
associate-*r/71.4%
Simplified71.4%
pow1/271.4%
associate-*r*71.4%
unpow-prod-down99.5%
pow1/299.5%
Applied egg-rr99.5%
*-commutative99.5%
unpow1/299.5%
*-commutative99.5%
Simplified99.5%
if 5.49999999999999984e-36 < k Initial program 99.7%
add-sqr-sqrt99.7%
sqrt-unprod99.7%
associate-*l/99.7%
*-un-lft-identity99.7%
associate-*l/99.7%
*-un-lft-identity99.7%
frac-times99.7%
Applied egg-rr99.7%
Simplified99.7%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (+ 0.5 (* -0.5 k))) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), (0.5 + (-0.5 * k))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (2.0 * n)), (0.5 + (-0.5 * k))) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (2.0 * n)), (0.5 + (-0.5 * k))) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(0.5 + Float64(-0.5 * k))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (2.0 * n)) ^ (0.5 + (-0.5 * k))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(0.5 + N[(-0.5 * k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(0.5 + -0.5 \cdot k\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*l*99.6%
div-sub99.6%
sub-neg99.6%
distribute-frac-neg99.6%
metadata-eval99.6%
neg-mul-199.6%
associate-/l*99.6%
associate-/r/99.6%
metadata-eval99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (* (sqrt (/ PI k)) (sqrt (* 2.0 n))))
double code(double k, double n) {
return sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
}
def code(k, n): return math.sqrt((math.pi / k)) * math.sqrt((2.0 * n))
function code(k, n) return Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))) end
function tmp = code(k, n) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); end
code[k_, n_] := N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}
\end{array}
Initial program 99.5%
add-sqr-sqrt99.3%
sqrt-unprod86.0%
associate-*l/86.0%
*-un-lft-identity86.0%
associate-*l/86.1%
*-un-lft-identity86.1%
frac-times86.0%
Applied egg-rr86.1%
Simplified86.1%
Taylor expanded in k around 0 38.1%
expm1-log1p-u36.4%
expm1-udef35.2%
associate-/l*35.2%
Applied egg-rr35.2%
expm1-def36.4%
expm1-log1p38.1%
associate-/l*38.1%
associate-*r/38.1%
Simplified38.1%
pow1/238.1%
associate-*r*38.1%
unpow-prod-down51.6%
pow1/251.6%
Applied egg-rr51.6%
*-commutative51.6%
unpow1/251.6%
*-commutative51.6%
Simplified51.6%
Final simplification51.6%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (/ k (* PI (* 2.0 n))))))
double code(double k, double n) {
return 1.0 / sqrt((k / (((double) M_PI) * (2.0 * n))));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt((k / (Math.PI * (2.0 * n))));
}
def code(k, n): return 1.0 / math.sqrt((k / (math.pi * (2.0 * n))))
function code(k, n) return Float64(1.0 / sqrt(Float64(k / Float64(pi * Float64(2.0 * n))))) end
function tmp = code(k, n) tmp = 1.0 / sqrt((k / (pi * (2.0 * n)))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(k / N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{\frac{k}{\pi \cdot \left(2 \cdot n\right)}}}
\end{array}
Initial program 99.5%
add-sqr-sqrt99.3%
sqrt-unprod86.0%
associate-*l/86.0%
*-un-lft-identity86.0%
associate-*l/86.1%
*-un-lft-identity86.1%
frac-times86.0%
Applied egg-rr86.1%
Simplified86.1%
Taylor expanded in k around 0 38.1%
expm1-log1p-u36.4%
expm1-udef35.2%
associate-/l*35.2%
Applied egg-rr35.2%
expm1-def36.4%
expm1-log1p38.1%
associate-/l*38.1%
associate-*r/38.1%
Simplified38.1%
metadata-eval38.1%
associate-*r/38.1%
*-commutative38.1%
times-frac38.1%
*-un-lft-identity38.1%
clear-num38.1%
sqrt-div39.1%
metadata-eval39.1%
associate-*r*39.1%
*-commutative39.1%
associate-*l*39.1%
Applied egg-rr39.1%
Final simplification39.1%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (* n (/ PI k)))))
double code(double k, double n) {
return sqrt((2.0 * (n * (((double) M_PI) / k))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (n * (Math.PI / k))));
}
def code(k, n): return math.sqrt((2.0 * (n * (math.pi / k))))
function code(k, n) return sqrt(Float64(2.0 * Float64(n * Float64(pi / k)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (n * (pi / k)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(n \cdot \frac{\pi}{k}\right)}
\end{array}
Initial program 99.5%
add-sqr-sqrt99.3%
sqrt-unprod86.0%
associate-*l/86.0%
*-un-lft-identity86.0%
associate-*l/86.1%
*-un-lft-identity86.1%
frac-times86.0%
Applied egg-rr86.1%
Simplified86.1%
Taylor expanded in k around 0 38.1%
expm1-log1p-u36.4%
expm1-udef35.2%
associate-/l*35.2%
Applied egg-rr35.2%
expm1-def36.4%
expm1-log1p38.1%
associate-/l*38.1%
associate-*r/38.1%
Simplified38.1%
Final simplification38.1%
herbie shell --seed 2023321
(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))))