
(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 11 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)) (+ 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.2%
associate-*l/99.3%
*-lft-identity99.3%
*-commutative99.3%
associate-*l*99.3%
div-sub99.3%
sub-neg99.3%
distribute-frac-neg99.3%
metadata-eval99.3%
neg-mul-199.3%
associate-/l*99.3%
associate-/r/99.3%
metadata-eval99.3%
Simplified99.3%
Final simplification99.3%
(FPCore (k n) :precision binary64 (if (<= k 1.55e-110) (/ (sqrt (* 2.0 (* PI n))) (sqrt k)) (sqrt (/ (pow (* n (* PI 2.0)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 1.55e-110) {
tmp = sqrt((2.0 * (((double) M_PI) * n))) / sqrt(k);
} else {
tmp = sqrt((pow((n * (((double) M_PI) * 2.0)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.55e-110) {
tmp = Math.sqrt((2.0 * (Math.PI * n))) / Math.sqrt(k);
} else {
tmp = Math.sqrt((Math.pow((n * (Math.PI * 2.0)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.55e-110: tmp = math.sqrt((2.0 * (math.pi * n))) / math.sqrt(k) else: tmp = math.sqrt((math.pow((n * (math.pi * 2.0)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.55e-110) tmp = Float64(sqrt(Float64(2.0 * Float64(pi * n))) / sqrt(k)); else tmp = sqrt(Float64((Float64(n * Float64(pi * 2.0)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.55e-110) tmp = sqrt((2.0 * (pi * n))) / sqrt(k); else tmp = sqrt((((n * (pi * 2.0)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.55e-110], N[(N[Sqrt[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.55 \cdot 10^{-110}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\pi \cdot n\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.55000000000000004e-110Initial program 99.2%
associate-*l/99.4%
*-lft-identity99.4%
*-commutative99.4%
associate-*l*99.4%
div-sub99.4%
sub-neg99.4%
distribute-frac-neg99.4%
metadata-eval99.4%
neg-mul-199.4%
associate-/l*99.4%
associate-/r/99.4%
metadata-eval99.4%
Simplified99.4%
+-commutative99.4%
unpow-prod-up99.4%
associate-*r*99.4%
*-commutative99.4%
associate-*l*99.4%
*-commutative99.4%
pow1/299.4%
associate-*r*99.4%
*-commutative99.4%
associate-*l*99.4%
Applied egg-rr99.4%
Taylor expanded in k around 0 99.4%
if 1.55000000000000004e-110 < k Initial program 99.2%
add-sqr-sqrt98.4%
sqrt-unprod98.6%
associate-*l/98.6%
*-un-lft-identity98.6%
associate-*l/98.6%
*-un-lft-identity98.6%
frac-times98.6%
Applied egg-rr98.6%
Simplified98.7%
Final simplification98.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%
add-sqr-sqrt98.6%
sqrt-unprod87.5%
associate-*l/87.5%
*-un-lft-identity87.5%
associate-*l/87.6%
*-un-lft-identity87.6%
frac-times87.5%
Applied egg-rr87.5%
Simplified87.7%
Taylor expanded in k around 0 42.3%
associate-*r/42.3%
*-commutative42.3%
associate-/l*42.3%
Simplified42.3%
div-inv42.3%
clear-num42.3%
associate-*l*42.3%
Applied egg-rr42.3%
sqrt-prod53.6%
associate-*r/53.6%
*-commutative53.6%
*-un-lft-identity53.6%
times-frac53.6%
metadata-eval53.6%
Applied egg-rr53.6%
associate-*r/53.6%
associate-*l/53.6%
Simplified53.6%
Final simplification53.6%
(FPCore (k n) :precision binary64 (* (sqrt (* PI n)) (sqrt (/ 2.0 k))))
double code(double k, double n) {
return sqrt((((double) M_PI) * n)) * sqrt((2.0 / k));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * n)) * Math.sqrt((2.0 / k));
}
def code(k, n): return math.sqrt((math.pi * n)) * math.sqrt((2.0 / k))
function code(k, n) return Float64(sqrt(Float64(pi * n)) * sqrt(Float64(2.0 / k))) end
function tmp = code(k, n) tmp = sqrt((pi * n)) * sqrt((2.0 / k)); end
code[k_, n_] := N[(N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot n} \cdot \sqrt{\frac{2}{k}}
\end{array}
Initial program 99.2%
add-sqr-sqrt98.6%
sqrt-unprod87.5%
associate-*l/87.5%
*-un-lft-identity87.5%
associate-*l/87.6%
*-un-lft-identity87.6%
frac-times87.5%
Applied egg-rr87.5%
Simplified87.7%
Taylor expanded in k around 0 42.3%
associate-*r/42.3%
*-commutative42.3%
associate-/l*42.3%
Simplified42.3%
div-inv42.3%
sqrt-prod53.6%
*-commutative53.6%
clear-num53.6%
Applied egg-rr53.6%
Final simplification53.6%
(FPCore (k n) :precision binary64 (/ (sqrt n) (sqrt (/ (* 0.5 k) PI))))
double code(double k, double n) {
return sqrt(n) / sqrt(((0.5 * k) / ((double) M_PI)));
}
public static double code(double k, double n) {
return Math.sqrt(n) / Math.sqrt(((0.5 * k) / Math.PI));
}
def code(k, n): return math.sqrt(n) / math.sqrt(((0.5 * k) / math.pi))
function code(k, n) return Float64(sqrt(n) / sqrt(Float64(Float64(0.5 * k) / pi))) end
function tmp = code(k, n) tmp = sqrt(n) / sqrt(((0.5 * k) / pi)); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] / N[Sqrt[N[(N[(0.5 * k), $MachinePrecision] / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{n}}{\sqrt{\frac{0.5 \cdot k}{\pi}}}
\end{array}
Initial program 99.2%
add-sqr-sqrt98.6%
sqrt-unprod87.5%
associate-*l/87.5%
*-un-lft-identity87.5%
associate-*l/87.6%
*-un-lft-identity87.6%
frac-times87.5%
Applied egg-rr87.5%
Simplified87.7%
Taylor expanded in k around 0 42.3%
associate-*r/42.3%
*-commutative42.3%
associate-/l*42.3%
Simplified42.3%
associate-/l*42.3%
sqrt-div53.7%
div-inv53.7%
metadata-eval53.7%
Applied egg-rr53.7%
Final simplification53.7%
(FPCore (k n) :precision binary64 (pow (* k (/ (/ 0.5 PI) n)) -0.5))
double code(double k, double n) {
return pow((k * ((0.5 / ((double) M_PI)) / n)), -0.5);
}
public static double code(double k, double n) {
return Math.pow((k * ((0.5 / Math.PI) / n)), -0.5);
}
def code(k, n): return math.pow((k * ((0.5 / math.pi) / n)), -0.5)
function code(k, n) return Float64(k * Float64(Float64(0.5 / pi) / n)) ^ -0.5 end
function tmp = code(k, n) tmp = (k * ((0.5 / pi) / n)) ^ -0.5; end
code[k_, n_] := N[Power[N[(k * N[(N[(0.5 / Pi), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(k \cdot \frac{\frac{0.5}{\pi}}{n}\right)}^{-0.5}
\end{array}
Initial program 99.2%
add-sqr-sqrt98.6%
sqrt-unprod87.5%
associate-*l/87.5%
*-un-lft-identity87.5%
associate-*l/87.6%
*-un-lft-identity87.6%
frac-times87.5%
Applied egg-rr87.5%
Simplified87.7%
Taylor expanded in k around 0 42.3%
associate-*r/42.3%
*-commutative42.3%
associate-/l*42.3%
Simplified42.3%
clear-num42.3%
sqrt-div42.6%
metadata-eval42.6%
div-inv42.6%
metadata-eval42.6%
*-un-lft-identity42.6%
times-frac42.6%
/-rgt-identity42.6%
*-commutative42.6%
Applied egg-rr42.6%
pow1/242.6%
pow-flip42.6%
associate-/r*42.6%
metadata-eval42.6%
Applied egg-rr42.6%
Final simplification42.6%
(FPCore (k n) :precision binary64 (sqrt (* n (* PI (/ 2.0 k)))))
double code(double k, double n) {
return sqrt((n * (((double) M_PI) * (2.0 / k))));
}
public static double code(double k, double n) {
return Math.sqrt((n * (Math.PI * (2.0 / k))));
}
def code(k, n): return math.sqrt((n * (math.pi * (2.0 / k))))
function code(k, n) return sqrt(Float64(n * Float64(pi * Float64(2.0 / k)))) end
function tmp = code(k, n) tmp = sqrt((n * (pi * (2.0 / k)))); end
code[k_, n_] := N[Sqrt[N[(n * N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \left(\pi \cdot \frac{2}{k}\right)}
\end{array}
Initial program 99.2%
add-sqr-sqrt98.6%
sqrt-unprod87.5%
associate-*l/87.5%
*-un-lft-identity87.5%
associate-*l/87.6%
*-un-lft-identity87.6%
frac-times87.5%
Applied egg-rr87.5%
Simplified87.7%
Taylor expanded in k around 0 42.3%
associate-*r/42.3%
*-commutative42.3%
associate-/l*42.3%
Simplified42.3%
div-inv42.3%
clear-num42.3%
associate-*l*42.3%
Applied egg-rr42.3%
Final simplification42.3%
(FPCore (k n) :precision binary64 (sqrt (* PI (* n (/ 2.0 k)))))
double code(double k, double n) {
return sqrt((((double) M_PI) * (n * (2.0 / k))));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (n * (2.0 / k))));
}
def code(k, n): return math.sqrt((math.pi * (n * (2.0 / k))))
function code(k, n) return sqrt(Float64(pi * Float64(n * Float64(2.0 / k)))) end
function tmp = code(k, n) tmp = sqrt((pi * (n * (2.0 / k)))); end
code[k_, n_] := N[Sqrt[N[(Pi * N[(n * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \left(n \cdot \frac{2}{k}\right)}
\end{array}
Initial program 99.2%
add-sqr-sqrt98.6%
sqrt-unprod87.5%
associate-*l/87.5%
*-un-lft-identity87.5%
associate-*l/87.6%
*-un-lft-identity87.6%
frac-times87.5%
Applied egg-rr87.5%
Simplified87.7%
Taylor expanded in k around 0 42.3%
associate-*r/42.3%
*-commutative42.3%
associate-/l*42.3%
Simplified42.3%
div-inv42.3%
*-commutative42.3%
clear-num42.3%
associate-*l*42.3%
Applied egg-rr42.3%
Final simplification42.3%
(FPCore (k n) :precision binary64 (sqrt (* (/ n k) (/ PI 0.5))))
double code(double k, double n) {
return sqrt(((n / k) * (((double) M_PI) / 0.5)));
}
public static double code(double k, double n) {
return Math.sqrt(((n / k) * (Math.PI / 0.5)));
}
def code(k, n): return math.sqrt(((n / k) * (math.pi / 0.5)))
function code(k, n) return sqrt(Float64(Float64(n / k) * Float64(pi / 0.5))) end
function tmp = code(k, n) tmp = sqrt(((n / k) * (pi / 0.5))); end
code[k_, n_] := N[Sqrt[N[(N[(n / k), $MachinePrecision] * N[(Pi / 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{n}{k} \cdot \frac{\pi}{0.5}}
\end{array}
Initial program 99.2%
add-sqr-sqrt98.6%
sqrt-unprod87.5%
associate-*l/87.5%
*-un-lft-identity87.5%
associate-*l/87.6%
*-un-lft-identity87.6%
frac-times87.5%
Applied egg-rr87.5%
Simplified87.7%
Taylor expanded in k around 0 42.3%
associate-*r/42.3%
*-commutative42.3%
associate-/l*42.3%
Simplified42.3%
div-inv42.3%
metadata-eval42.3%
times-frac42.3%
Applied egg-rr42.3%
Final simplification42.3%
(FPCore (k n) :precision binary64 (sqrt (* (/ PI k) (/ n 0.5))))
double code(double k, double n) {
return sqrt(((((double) M_PI) / k) * (n / 0.5)));
}
public static double code(double k, double n) {
return Math.sqrt(((Math.PI / k) * (n / 0.5)));
}
def code(k, n): return math.sqrt(((math.pi / k) * (n / 0.5)))
function code(k, n) return sqrt(Float64(Float64(pi / k) * Float64(n / 0.5))) end
function tmp = code(k, n) tmp = sqrt(((pi / k) * (n / 0.5))); end
code[k_, n_] := N[Sqrt[N[(N[(Pi / k), $MachinePrecision] * N[(n / 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi}{k} \cdot \frac{n}{0.5}}
\end{array}
Initial program 99.2%
add-sqr-sqrt98.6%
sqrt-unprod87.5%
associate-*l/87.5%
*-un-lft-identity87.5%
associate-*l/87.6%
*-un-lft-identity87.6%
frac-times87.5%
Applied egg-rr87.5%
Simplified87.7%
Taylor expanded in k around 0 42.3%
associate-*r/42.3%
*-commutative42.3%
associate-/l*42.3%
Simplified42.3%
*-commutative42.3%
div-inv42.3%
metadata-eval42.3%
times-frac42.3%
Applied egg-rr42.3%
Final simplification42.3%
(FPCore (k n) :precision binary64 (sqrt (/ (* PI n) (/ k 2.0))))
double code(double k, double n) {
return sqrt(((((double) M_PI) * n) / (k / 2.0)));
}
public static double code(double k, double n) {
return Math.sqrt(((Math.PI * n) / (k / 2.0)));
}
def code(k, n): return math.sqrt(((math.pi * n) / (k / 2.0)))
function code(k, n) return sqrt(Float64(Float64(pi * n) / Float64(k / 2.0))) end
function tmp = code(k, n) tmp = sqrt(((pi * n) / (k / 2.0))); end
code[k_, n_] := N[Sqrt[N[(N[(Pi * n), $MachinePrecision] / N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi \cdot n}{\frac{k}{2}}}
\end{array}
Initial program 99.2%
add-sqr-sqrt98.6%
sqrt-unprod87.5%
associate-*l/87.5%
*-un-lft-identity87.5%
associate-*l/87.6%
*-un-lft-identity87.6%
frac-times87.5%
Applied egg-rr87.5%
Simplified87.7%
Taylor expanded in k around 0 42.3%
associate-*r/42.3%
*-commutative42.3%
associate-/l*42.3%
Simplified42.3%
Final simplification42.3%
herbie shell --seed 2023322
(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))))