
(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 10 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 2.8e-62) (* (sqrt (* n 2.0)) (sqrt (/ PI k))) (sqrt (/ (pow (* PI (* n 2.0)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 2.8e-62) {
tmp = sqrt((n * 2.0)) * sqrt((((double) M_PI) / k));
} else {
tmp = sqrt((pow((((double) M_PI) * (n * 2.0)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 2.8e-62) {
tmp = Math.sqrt((n * 2.0)) * Math.sqrt((Math.PI / k));
} else {
tmp = Math.sqrt((Math.pow((Math.PI * (n * 2.0)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 2.8e-62: tmp = math.sqrt((n * 2.0)) * math.sqrt((math.pi / k)) else: tmp = math.sqrt((math.pow((math.pi * (n * 2.0)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 2.8e-62) tmp = Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(pi / k))); else tmp = sqrt(Float64((Float64(pi * Float64(n * 2.0)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 2.8e-62) tmp = sqrt((n * 2.0)) * sqrt((pi / k)); else tmp = sqrt((((pi * (n * 2.0)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 2.8e-62], N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 2.8 \cdot 10^{-62}:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{\frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 2.80000000000000002e-62Initial program 98.5%
Taylor expanded in k around 0 68.5%
*-commutative68.5%
associate-/l*68.4%
Simplified68.4%
*-commutative68.4%
sqrt-unprod68.6%
Applied egg-rr68.6%
associate-*r*68.6%
associate-*l/68.6%
*-commutative68.6%
associate-*r/68.6%
sqrt-undiv98.6%
*-rgt-identity98.6%
associate-*r*98.6%
*-commutative98.6%
sqrt-prod99.0%
*-rgt-identity99.0%
times-frac99.1%
*-rgt-identity99.1%
sqrt-div99.4%
Applied egg-rr99.4%
/-rgt-identity99.4%
*-commutative99.4%
Simplified99.4%
if 2.80000000000000002e-62 < k Initial program 99.8%
associate-*l/99.8%
*-lft-identity99.8%
associate-*l*99.8%
div-sub99.8%
metadata-eval99.8%
Simplified99.8%
div-inv99.8%
metadata-eval99.8%
div-sub99.8%
sqr-pow99.8%
associate-*l*99.8%
div-inv99.8%
metadata-eval99.8%
associate-/l*99.8%
metadata-eval99.8%
Applied egg-rr99.8%
associate-*r*99.8%
pow-sqr99.8%
associate-*r*99.8%
*-commutative99.8%
*-commutative99.8%
associate-*r*99.8%
metadata-eval99.8%
Simplified99.8%
Applied egg-rr99.9%
Final simplification99.7%
(FPCore (k n) :precision binary64 (let* ((t_0 (* PI (* n 2.0)))) (/ (sqrt t_0) (sqrt (* k (pow t_0 k))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (n * 2.0);
return sqrt(t_0) / sqrt((k * pow(t_0, k)));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (n * 2.0);
return Math.sqrt(t_0) / Math.sqrt((k * Math.pow(t_0, k)));
}
def code(k, n): t_0 = math.pi * (n * 2.0) return math.sqrt(t_0) / math.sqrt((k * math.pow(t_0, k)))
function code(k, n) t_0 = Float64(pi * Float64(n * 2.0)) return Float64(sqrt(t_0) / sqrt(Float64(k * (t_0 ^ k)))) end
function tmp = code(k, n) t_0 = pi * (n * 2.0); tmp = sqrt(t_0) / sqrt((k * (t_0 ^ k))); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Sqrt[N[(k * N[Power[t$95$0, k], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(n \cdot 2\right)\\
\frac{\sqrt{t\_0}}{\sqrt{k \cdot {t\_0}^{k}}}
\end{array}
\end{array}
Initial program 99.2%
associate-*l/99.3%
*-lft-identity99.3%
associate-*l*99.3%
div-sub99.3%
metadata-eval99.3%
Simplified99.3%
div-inv99.2%
metadata-eval99.2%
div-sub99.2%
sqr-pow99.1%
associate-*l*99.1%
div-inv99.1%
metadata-eval99.1%
associate-/l*99.1%
metadata-eval99.1%
Applied egg-rr99.1%
associate-*r*99.2%
pow-sqr99.3%
associate-*r*99.3%
*-commutative99.3%
*-commutative99.3%
associate-*r*99.3%
metadata-eval99.3%
Simplified99.3%
*-commutative99.3%
metadata-eval99.3%
pow-flip99.2%
pow1/299.2%
pow-unpow99.2%
pow1/299.2%
pow-sub99.3%
pow199.3%
pow1/299.3%
pow-unpow99.3%
*-commutative99.3%
*-commutative99.3%
associate-*r*99.3%
times-frac99.3%
Applied egg-rr99.3%
*-commutative99.3%
*-commutative99.3%
unpow1/299.3%
*-commutative99.3%
*-commutative99.3%
*-commutative99.3%
Simplified99.3%
(FPCore (k n) :precision binary64 (/ (pow (* 2.0 (* PI n)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((2.0 * (((double) M_PI) * n)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((2.0 * (Math.PI * n)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((2.0 * (math.pi * n)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(2.0 * Float64(pi * n)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((2.0 * (pi * n)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.2%
associate-*l/99.3%
*-lft-identity99.3%
associate-*l*99.3%
div-sub99.3%
metadata-eval99.3%
Simplified99.3%
(FPCore (k n) :precision binary64 (* (sqrt (* n 2.0)) (sqrt (/ PI k))))
double code(double k, double n) {
return sqrt((n * 2.0)) * sqrt((((double) M_PI) / k));
}
public static double code(double k, double n) {
return Math.sqrt((n * 2.0)) * Math.sqrt((Math.PI / k));
}
def code(k, n): return math.sqrt((n * 2.0)) * math.sqrt((math.pi / k))
function code(k, n) return Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(pi / k))) end
function tmp = code(k, n) tmp = sqrt((n * 2.0)) * sqrt((pi / k)); end
code[k_, n_] := N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot 2} \cdot \sqrt{\frac{\pi}{k}}
\end{array}
Initial program 99.2%
Taylor expanded in k around 0 35.7%
*-commutative35.7%
associate-/l*35.7%
Simplified35.7%
*-commutative35.7%
sqrt-unprod35.8%
Applied egg-rr35.8%
associate-*r*35.8%
associate-*l/35.8%
*-commutative35.8%
associate-*r/35.7%
sqrt-undiv48.5%
*-rgt-identity48.5%
associate-*r*48.5%
*-commutative48.5%
sqrt-prod48.7%
*-rgt-identity48.7%
times-frac48.7%
*-rgt-identity48.7%
sqrt-div48.9%
Applied egg-rr48.9%
/-rgt-identity48.9%
*-commutative48.9%
Simplified48.9%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (* PI (/ 2.0 k)))))
double code(double k, double n) {
return sqrt(n) * sqrt((((double) M_PI) * (2.0 / k)));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((Math.PI * (2.0 / k)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((math.pi * (2.0 / k)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(pi * Float64(2.0 / k)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((pi * (2.0 / k))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{\pi \cdot \frac{2}{k}}
\end{array}
Initial program 99.2%
Taylor expanded in k around 0 35.7%
*-commutative35.7%
associate-/l*35.7%
Simplified35.7%
*-commutative35.7%
sqrt-unprod35.8%
Applied egg-rr35.8%
associate-*r*35.8%
sqrt-prod48.8%
*-commutative48.8%
Applied egg-rr48.8%
associate-*r/48.8%
*-commutative48.8%
associate-/l*48.9%
Simplified48.9%
(FPCore (k n) :precision binary64 (pow (/ (/ k (* PI n)) 2.0) -0.5))
double code(double k, double n) {
return pow(((k / (((double) M_PI) * n)) / 2.0), -0.5);
}
public static double code(double k, double n) {
return Math.pow(((k / (Math.PI * n)) / 2.0), -0.5);
}
def code(k, n): return math.pow(((k / (math.pi * n)) / 2.0), -0.5)
function code(k, n) return Float64(Float64(k / Float64(pi * n)) / 2.0) ^ -0.5 end
function tmp = code(k, n) tmp = ((k / (pi * n)) / 2.0) ^ -0.5; end
code[k_, n_] := N[Power[N[(N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{\frac{k}{\pi \cdot n}}{2}\right)}^{-0.5}
\end{array}
Initial program 99.2%
Taylor expanded in k around 0 35.7%
*-commutative35.7%
associate-/l*35.7%
Simplified35.7%
*-commutative35.7%
sqrt-unprod35.8%
Applied egg-rr35.8%
Taylor expanded in n around 0 35.7%
*-commutative35.7%
associate-*r/35.8%
Simplified35.8%
associate-*r/35.7%
associate-*r/35.7%
*-commutative35.7%
associate-*r*35.7%
clear-num35.7%
inv-pow35.7%
sqrt-pow136.2%
associate-*r*36.2%
associate-/r*36.2%
metadata-eval36.2%
Applied egg-rr36.2%
(FPCore (k n) :precision binary64 (pow (* k (/ (/ 0.5 n) PI)) -0.5))
double code(double k, double n) {
return pow((k * ((0.5 / n) / ((double) M_PI))), -0.5);
}
public static double code(double k, double n) {
return Math.pow((k * ((0.5 / n) / Math.PI)), -0.5);
}
def code(k, n): return math.pow((k * ((0.5 / n) / math.pi)), -0.5)
function code(k, n) return Float64(k * Float64(Float64(0.5 / n) / pi)) ^ -0.5 end
function tmp = code(k, n) tmp = (k * ((0.5 / n) / pi)) ^ -0.5; end
code[k_, n_] := N[Power[N[(k * N[(N[(0.5 / n), $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(k \cdot \frac{\frac{0.5}{n}}{\pi}\right)}^{-0.5}
\end{array}
Initial program 99.2%
Taylor expanded in k around 0 35.7%
*-commutative35.7%
associate-/l*35.7%
Simplified35.7%
*-commutative35.7%
sqrt-unprod35.8%
Applied egg-rr35.8%
Taylor expanded in n around 0 35.7%
*-commutative35.7%
associate-*r/35.8%
Simplified35.8%
associate-*r/35.7%
associate-*r/35.7%
*-commutative35.7%
associate-*r*35.7%
clear-num35.7%
inv-pow35.7%
sqrt-pow136.2%
associate-*r*36.2%
associate-/r*36.2%
metadata-eval36.2%
Applied egg-rr36.2%
associate-/r*36.3%
associate-/l/36.3%
*-rgt-identity36.3%
associate-*r/36.3%
associate-*l/36.2%
associate-/l*36.2%
associate-/r*36.2%
metadata-eval36.2%
Simplified36.2%
(FPCore (k n) :precision binary64 (sqrt (/ (* PI 2.0) (/ k n))))
double code(double k, double n) {
return sqrt(((((double) M_PI) * 2.0) / (k / n)));
}
public static double code(double k, double n) {
return Math.sqrt(((Math.PI * 2.0) / (k / n)));
}
def code(k, n): return math.sqrt(((math.pi * 2.0) / (k / n)))
function code(k, n) return sqrt(Float64(Float64(pi * 2.0) / Float64(k / n))) end
function tmp = code(k, n) tmp = sqrt(((pi * 2.0) / (k / n))); end
code[k_, n_] := N[Sqrt[N[(N[(Pi * 2.0), $MachinePrecision] / N[(k / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi \cdot 2}{\frac{k}{n}}}
\end{array}
Initial program 99.2%
Taylor expanded in k around 0 35.7%
*-commutative35.7%
associate-/l*35.7%
Simplified35.7%
*-commutative35.7%
sqrt-unprod35.8%
Applied egg-rr35.8%
Taylor expanded in n around 0 35.7%
*-commutative35.7%
associate-*r/35.8%
Simplified35.8%
associate-*r*35.8%
clear-num35.8%
un-div-inv35.8%
Applied egg-rr35.8%
Final simplification35.8%
(FPCore (k n) :precision binary64 (sqrt (/ (* n 2.0) (/ k PI))))
double code(double k, double n) {
return sqrt(((n * 2.0) / (k / ((double) M_PI))));
}
public static double code(double k, double n) {
return Math.sqrt(((n * 2.0) / (k / Math.PI)));
}
def code(k, n): return math.sqrt(((n * 2.0) / (k / math.pi)))
function code(k, n) return sqrt(Float64(Float64(n * 2.0) / Float64(k / pi))) end
function tmp = code(k, n) tmp = sqrt(((n * 2.0) / (k / pi))); end
code[k_, n_] := N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] / N[(k / Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{n \cdot 2}{\frac{k}{\pi}}}
\end{array}
Initial program 99.2%
Taylor expanded in k around 0 35.7%
*-commutative35.7%
associate-/l*35.7%
Simplified35.7%
*-commutative35.7%
sqrt-unprod35.8%
Applied egg-rr35.8%
Taylor expanded in n around 0 35.7%
*-commutative35.7%
associate-*r/35.8%
Simplified35.8%
associate-*r*35.8%
associate-*r/35.7%
associate-*l/35.8%
associate-*r/35.8%
*-commutative35.8%
associate-*l*35.8%
clear-num35.8%
un-div-inv35.8%
*-commutative35.8%
Applied egg-rr35.8%
Final simplification35.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%
Taylor expanded in k around 0 35.7%
*-commutative35.7%
associate-/l*35.7%
Simplified35.7%
*-commutative35.7%
sqrt-unprod35.8%
Applied egg-rr35.8%
Taylor expanded in n around 0 35.7%
*-commutative35.7%
associate-*r/35.8%
Simplified35.8%
herbie shell --seed 2024131
(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))))