
(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 (if (<= k 5.5e-9) (* (sqrt n) (sqrt (/ 2.0 (/ k PI)))) (sqrt (/ (pow (* n (* 2.0 PI)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 5.5e-9) {
tmp = sqrt(n) * sqrt((2.0 / (k / ((double) M_PI))));
} else {
tmp = sqrt((pow((n * (2.0 * ((double) M_PI))), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5.5e-9) {
tmp = Math.sqrt(n) * Math.sqrt((2.0 / (k / Math.PI)));
} else {
tmp = Math.sqrt((Math.pow((n * (2.0 * Math.PI)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 5.5e-9: tmp = math.sqrt(n) * math.sqrt((2.0 / (k / math.pi))) else: tmp = math.sqrt((math.pow((n * (2.0 * math.pi)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 5.5e-9) tmp = Float64(sqrt(n) * sqrt(Float64(2.0 / Float64(k / pi)))); else tmp = sqrt(Float64((Float64(n * Float64(2.0 * pi)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 5.5e-9) tmp = sqrt(n) * sqrt((2.0 / (k / pi))); else tmp = sqrt((((n * (2.0 * pi)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5.5e-9], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 / N[(k / Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(n * N[(2.0 * Pi), $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^{-9}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{\frac{2}{\frac{k}{\pi}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 5.4999999999999996e-9Initial program 98.3%
Taylor expanded in k around 0 98.2%
expm1-log1p-u92.4%
expm1-udef77.9%
associate-*l/77.9%
*-un-lft-identity77.9%
sqrt-unprod77.9%
*-commutative77.9%
*-commutative77.9%
associate-*r*77.9%
*-commutative77.9%
sqrt-undiv55.7%
*-commutative55.7%
associate-*r*55.7%
Applied egg-rr55.7%
expm1-def70.2%
expm1-log1p74.1%
associate-/l*74.0%
*-commutative74.0%
Simplified74.0%
Taylor expanded in k around 0 74.1%
associate-*r/74.1%
associate-*l*74.1%
*-commutative74.1%
associate-*l*74.1%
Simplified74.1%
sqrt-prod98.9%
Applied egg-rr98.9%
associate-*r/98.9%
associate-/l*98.8%
Simplified98.8%
if 5.4999999999999996e-9 < k Initial program 99.8%
add-sqr-sqrt99.8%
sqrt-unprod99.8%
*-commutative99.8%
*-commutative99.8%
associate-*r*99.8%
div-sub99.8%
metadata-eval99.8%
div-inv99.8%
*-commutative99.8%
Applied egg-rr99.8%
Simplified99.8%
Final simplification99.3%
(FPCore (k n) :precision binary64 (* (pow (* 2.0 (* PI n)) (- 0.5 (* 0.5 k))) (pow k -0.5)))
double code(double k, double n) {
return pow((2.0 * (((double) M_PI) * n)), (0.5 - (0.5 * k))) * pow(k, -0.5);
}
public static double code(double k, double n) {
return Math.pow((2.0 * (Math.PI * n)), (0.5 - (0.5 * k))) * Math.pow(k, -0.5);
}
def code(k, n): return math.pow((2.0 * (math.pi * n)), (0.5 - (0.5 * k))) * math.pow(k, -0.5)
function code(k, n) return Float64((Float64(2.0 * Float64(pi * n)) ^ Float64(0.5 - Float64(0.5 * k))) * (k ^ -0.5)) end
function tmp = code(k, n) tmp = ((2.0 * (pi * n)) ^ (0.5 - (0.5 * k))) * (k ^ -0.5); end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(0.5 * k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Power[k, -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(0.5 - 0.5 \cdot k\right)} \cdot {k}^{-0.5}
\end{array}
Initial program 99.1%
associate-*l/99.1%
*-lft-identity99.1%
sqr-pow99.0%
pow-sqr99.1%
*-commutative99.1%
associate-*l*99.1%
associate-*r/99.1%
*-commutative99.1%
associate-/l*99.1%
metadata-eval99.1%
/-rgt-identity99.1%
div-sub99.1%
metadata-eval99.1%
Simplified99.1%
div-inv99.1%
associate-*r*99.1%
*-commutative99.1%
associate-*l*99.1%
div-inv99.1%
metadata-eval99.1%
pow1/299.1%
pow-flip99.2%
metadata-eval99.2%
Applied egg-rr99.2%
Final simplification99.2%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (2.0 * n)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (2.0 * n)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (2.0 * n)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.1%
associate-*l/99.1%
*-lft-identity99.1%
sqr-pow99.0%
pow-sqr99.1%
*-commutative99.1%
associate-*l*99.1%
associate-*r/99.1%
*-commutative99.1%
associate-/l*99.1%
metadata-eval99.1%
/-rgt-identity99.1%
div-sub99.1%
metadata-eval99.1%
Simplified99.1%
Final simplification99.1%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (/ 2.0 (/ k PI)))))
double code(double k, double n) {
return sqrt(n) * sqrt((2.0 / (k / ((double) M_PI))));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((2.0 / (k / Math.PI)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((2.0 / (k / math.pi)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(2.0 / Float64(k / pi)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((2.0 / (k / pi))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 / N[(k / Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{\frac{2}{\frac{k}{\pi}}}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0 48.6%
expm1-log1p-u45.8%
expm1-udef47.1%
associate-*l/47.1%
*-un-lft-identity47.1%
sqrt-unprod47.1%
*-commutative47.1%
*-commutative47.1%
associate-*r*47.1%
*-commutative47.1%
sqrt-undiv36.5%
*-commutative36.5%
associate-*r*36.5%
Applied egg-rr36.5%
expm1-def35.2%
expm1-log1p37.1%
associate-/l*37.0%
*-commutative37.0%
Simplified37.0%
Taylor expanded in k around 0 37.1%
associate-*r/37.1%
associate-*l*37.1%
*-commutative37.1%
associate-*l*37.1%
Simplified37.1%
sqrt-prod48.9%
Applied egg-rr48.9%
associate-*r/48.9%
associate-/l*48.9%
Simplified48.9%
Final simplification48.9%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (/ (/ k n) (* 2.0 PI)))))
double code(double k, double n) {
return 1.0 / sqrt(((k / n) / (2.0 * ((double) M_PI))));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt(((k / n) / (2.0 * Math.PI)));
}
def code(k, n): return 1.0 / math.sqrt(((k / n) / (2.0 * math.pi)))
function code(k, n) return Float64(1.0 / sqrt(Float64(Float64(k / n) / Float64(2.0 * pi)))) end
function tmp = code(k, n) tmp = 1.0 / sqrt(((k / n) / (2.0 * pi))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(N[(k / n), $MachinePrecision] / N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{\frac{\frac{k}{n}}{2 \cdot \pi}}}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0 48.6%
expm1-log1p-u45.8%
expm1-udef47.1%
associate-*l/47.1%
*-un-lft-identity47.1%
sqrt-unprod47.1%
*-commutative47.1%
*-commutative47.1%
associate-*r*47.1%
*-commutative47.1%
sqrt-undiv36.5%
*-commutative36.5%
associate-*r*36.5%
Applied egg-rr36.5%
expm1-def35.2%
expm1-log1p37.1%
associate-/l*37.0%
*-commutative37.0%
Simplified37.0%
clear-num37.0%
sqrt-div38.1%
metadata-eval38.1%
div-inv38.1%
associate-/r*38.3%
metadata-eval38.3%
Applied egg-rr38.3%
associate-*l/38.3%
associate-/l*38.3%
metadata-eval38.3%
associate-/l*38.3%
*-commutative38.3%
/-rgt-identity38.3%
Simplified38.3%
Final simplification38.3%
(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.1%
Taylor expanded in k around 0 48.6%
expm1-log1p-u45.8%
expm1-udef47.1%
associate-*l/47.1%
*-un-lft-identity47.1%
sqrt-unprod47.1%
*-commutative47.1%
*-commutative47.1%
associate-*r*47.1%
*-commutative47.1%
sqrt-undiv36.5%
*-commutative36.5%
associate-*r*36.5%
Applied egg-rr36.5%
expm1-def35.2%
expm1-log1p37.1%
associate-/l*37.0%
*-commutative37.0%
Simplified37.0%
Taylor expanded in k around 0 37.1%
associate-*r/37.1%
associate-*l*37.1%
*-commutative37.1%
associate-*l*37.1%
Simplified37.1%
Taylor expanded in n around 0 37.1%
*-commutative37.1%
associate-*r/37.1%
Simplified37.1%
Final simplification37.1%
(FPCore (k n) :precision binary64 (sqrt (* n (* 2.0 (/ PI k)))))
double code(double k, double n) {
return sqrt((n * (2.0 * (((double) M_PI) / k))));
}
public static double code(double k, double n) {
return Math.sqrt((n * (2.0 * (Math.PI / k))));
}
def code(k, n): return math.sqrt((n * (2.0 * (math.pi / k))))
function code(k, n) return sqrt(Float64(n * Float64(2.0 * Float64(pi / k)))) end
function tmp = code(k, n) tmp = sqrt((n * (2.0 * (pi / k)))); end
code[k_, n_] := N[Sqrt[N[(n * N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \left(2 \cdot \frac{\pi}{k}\right)}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0 48.6%
expm1-log1p-u45.8%
expm1-udef47.1%
associate-*l/47.1%
*-un-lft-identity47.1%
sqrt-unprod47.1%
*-commutative47.1%
*-commutative47.1%
associate-*r*47.1%
*-commutative47.1%
sqrt-undiv36.5%
*-commutative36.5%
associate-*r*36.5%
Applied egg-rr36.5%
expm1-def35.2%
expm1-log1p37.1%
associate-/l*37.0%
*-commutative37.0%
Simplified37.0%
Taylor expanded in k around 0 37.1%
associate-*r/37.1%
associate-*l*37.1%
*-commutative37.1%
associate-*l*37.1%
Simplified37.1%
Final simplification37.1%
(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(Float64(2.0 * Float64(pi * n)) / k)) end
function tmp = code(k, n) tmp = sqrt(((2.0 * (pi * n)) / k)); end
code[k_, n_] := N[Sqrt[N[(N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{2 \cdot \left(\pi \cdot n\right)}{k}}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0 48.6%
expm1-log1p-u45.8%
expm1-udef47.1%
associate-*l/47.1%
*-un-lft-identity47.1%
sqrt-unprod47.1%
*-commutative47.1%
*-commutative47.1%
associate-*r*47.1%
*-commutative47.1%
sqrt-undiv36.5%
*-commutative36.5%
associate-*r*36.5%
Applied egg-rr36.5%
expm1-def35.2%
expm1-log1p37.1%
associate-/l*37.0%
*-commutative37.0%
Simplified37.0%
Taylor expanded in k around 0 37.1%
associate-*r/37.1%
associate-*l*37.1%
*-commutative37.1%
associate-*l*37.1%
Simplified37.1%
*-commutative37.1%
associate-*r*37.1%
associate-/r/37.0%
associate-*r/37.0%
div-inv37.0%
clear-num37.1%
associate-*r/37.1%
associate-*r*37.1%
Applied egg-rr37.1%
Final simplification37.1%
herbie shell --seed 2024019
(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))))