
(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 (* (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 98.6%
associate-*l/98.7%
*-lft-identity98.7%
associate-*l*98.7%
div-sub98.7%
metadata-eval98.7%
Simplified98.7%
div-inv98.6%
div-inv98.6%
metadata-eval98.6%
inv-pow98.6%
sqrt-pow298.7%
metadata-eval98.7%
Applied egg-rr98.7%
Final simplification98.7%
(FPCore (k n) :precision binary64 (if (<= k 1.15e-79) (* (sqrt (* 2.0 n)) (sqrt (/ PI k))) (sqrt (/ (pow (* PI (* 2.0 n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 1.15e-79) {
tmp = sqrt((2.0 * n)) * sqrt((((double) M_PI) / k));
} 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 <= 1.15e-79) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((Math.PI / k));
} 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 <= 1.15e-79: tmp = math.sqrt((2.0 * n)) * math.sqrt((math.pi / k)) 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 <= 1.15e-79) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(pi / k))); 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 <= 1.15e-79) tmp = sqrt((2.0 * n)) * sqrt((pi / k)); else tmp = sqrt((((pi * (2.0 * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.15e-79], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $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 1.15 \cdot 10^{-79}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{\frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.15000000000000006e-79Initial program 98.3%
Taylor expanded in k around 0 67.6%
*-commutative67.6%
associate-/l*67.6%
Simplified67.6%
pow167.6%
sqrt-unprod67.7%
associate-*r/67.7%
*-commutative67.7%
associate-/l*67.8%
Applied egg-rr67.8%
unpow167.8%
*-commutative67.8%
associate-*l*67.8%
Simplified67.8%
Taylor expanded in n around 0 67.7%
associate-/l*67.7%
Simplified67.7%
associate-*r*67.7%
*-commutative67.7%
sqrt-prod98.4%
Applied egg-rr98.4%
if 1.15000000000000006e-79 < k Initial program 98.8%
add-sqr-sqrt98.7%
sqrt-unprod98.2%
*-commutative98.2%
associate-*r*98.2%
div-sub98.2%
metadata-eval98.2%
div-inv98.2%
*-commutative98.2%
Applied egg-rr98.3%
Simplified98.3%
Final simplification98.3%
(FPCore (k n) :precision binary64 (if (<= k 3.8e+112) (* (sqrt (* 2.0 n)) (sqrt (/ PI k))) (sqrt (+ 1.0 (fma n (/ (* 2.0 PI) k) -1.0)))))
double code(double k, double n) {
double tmp;
if (k <= 3.8e+112) {
tmp = sqrt((2.0 * n)) * sqrt((((double) M_PI) / k));
} else {
tmp = sqrt((1.0 + fma(n, ((2.0 * ((double) M_PI)) / k), -1.0)));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 3.8e+112) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(pi / k))); else tmp = sqrt(Float64(1.0 + fma(n, Float64(Float64(2.0 * pi) / k), -1.0))); end return tmp end
code[k_, n_] := If[LessEqual[k, 3.8e+112], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(1.0 + N[(n * N[(N[(2.0 * Pi), $MachinePrecision] / k), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.8 \cdot 10^{+112}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{\frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1 + \mathsf{fma}\left(n, \frac{2 \cdot \pi}{k}, -1\right)}\\
\end{array}
\end{array}
if k < 3.80000000000000008e112Initial program 98.0%
Taylor expanded in k around 0 56.6%
*-commutative56.6%
associate-/l*56.6%
Simplified56.6%
pow156.6%
sqrt-unprod56.7%
associate-*r/56.7%
*-commutative56.7%
associate-/l*56.7%
Applied egg-rr56.7%
unpow156.7%
*-commutative56.7%
associate-*l*56.7%
Simplified56.7%
Taylor expanded in n around 0 56.7%
associate-/l*56.7%
Simplified56.7%
associate-*r*56.7%
*-commutative56.7%
sqrt-prod72.3%
Applied egg-rr72.3%
if 3.80000000000000008e112 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
*-commutative2.6%
associate-/l*2.6%
Simplified2.6%
pow12.6%
sqrt-unprod2.6%
associate-*r/2.6%
*-commutative2.6%
associate-/l*2.6%
Applied egg-rr2.6%
unpow12.6%
*-commutative2.6%
associate-*l*2.6%
Simplified2.6%
Taylor expanded in n around 0 2.6%
associate-/l*2.6%
Simplified2.6%
associate-*r*2.6%
*-commutative2.6%
div-inv2.6%
associate-*r*2.6%
associate-*r*2.6%
*-commutative2.6%
associate-*r*2.6%
*-commutative2.6%
div-inv2.6%
associate-*r*2.6%
expm1-log1p-u2.6%
expm1-undefine29.6%
Applied egg-rr29.6%
log1p-undefine29.6%
rem-exp-log29.6%
associate-+r-29.6%
associate-*l*29.6%
fma-neg29.6%
associate-*r/29.6%
metadata-eval29.6%
Simplified29.6%
Final simplification59.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 98.6%
associate-*l/98.7%
*-lft-identity98.7%
associate-*l*98.7%
div-sub98.7%
metadata-eval98.7%
Simplified98.7%
Final simplification98.7%
(FPCore (k n) :precision binary64 (* (sqrt (* 2.0 n)) (sqrt (/ PI k))))
double code(double k, double n) {
return sqrt((2.0 * n)) * sqrt((((double) M_PI) / k));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * n)) * Math.sqrt((Math.PI / k));
}
def code(k, n): return math.sqrt((2.0 * n)) * math.sqrt((math.pi / k))
function code(k, n) return Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(pi / k))) end
function tmp = code(k, n) tmp = sqrt((2.0 * n)) * sqrt((pi / k)); end
code[k_, n_] := N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot n} \cdot \sqrt{\frac{\pi}{k}}
\end{array}
Initial program 98.6%
Taylor expanded in k around 0 40.2%
*-commutative40.2%
associate-/l*40.1%
Simplified40.1%
pow140.1%
sqrt-unprod40.2%
associate-*r/40.2%
*-commutative40.2%
associate-/l*40.3%
Applied egg-rr40.3%
unpow140.3%
*-commutative40.3%
associate-*l*40.3%
Simplified40.3%
Taylor expanded in n around 0 40.2%
associate-/l*40.2%
Simplified40.2%
associate-*r*40.2%
*-commutative40.2%
sqrt-prod51.1%
Applied egg-rr51.1%
Final simplification51.1%
(FPCore (k n) :precision binary64 (pow (/ k (* PI (* 2.0 n))) -0.5))
double code(double k, double n) {
return pow((k / (((double) M_PI) * (2.0 * n))), -0.5);
}
public static double code(double k, double n) {
return Math.pow((k / (Math.PI * (2.0 * n))), -0.5);
}
def code(k, n): return math.pow((k / (math.pi * (2.0 * n))), -0.5)
function code(k, n) return Float64(k / Float64(pi * Float64(2.0 * n))) ^ -0.5 end
function tmp = code(k, n) tmp = (k / (pi * (2.0 * n))) ^ -0.5; end
code[k_, n_] := N[Power[N[(k / N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{k}{\pi \cdot \left(2 \cdot n\right)}\right)}^{-0.5}
\end{array}
Initial program 98.6%
associate-/r/98.7%
associate-*r*98.7%
div-sub98.7%
metadata-eval98.7%
div-inv98.7%
metadata-eval98.7%
Applied egg-rr98.7%
Taylor expanded in k around 0 40.7%
associate-*r/40.7%
*-rgt-identity40.7%
*-commutative40.7%
associate-/r*40.9%
Simplified40.9%
inv-pow40.9%
sqrt-undiv40.9%
sqrt-pow240.9%
associate-/l/40.8%
metadata-eval40.8%
Applied egg-rr40.8%
associate-/r*40.8%
*-commutative40.8%
associate-*l*40.8%
Simplified40.8%
Final simplification40.8%
(FPCore (k n) :precision binary64 (pow (/ (/ (/ k n) PI) 2.0) -0.5))
double code(double k, double n) {
return pow((((k / n) / ((double) M_PI)) / 2.0), -0.5);
}
public static double code(double k, double n) {
return Math.pow((((k / n) / Math.PI) / 2.0), -0.5);
}
def code(k, n): return math.pow((((k / n) / math.pi) / 2.0), -0.5)
function code(k, n) return Float64(Float64(Float64(k / n) / pi) / 2.0) ^ -0.5 end
function tmp = code(k, n) tmp = (((k / n) / pi) / 2.0) ^ -0.5; end
code[k_, n_] := N[Power[N[(N[(N[(k / n), $MachinePrecision] / Pi), $MachinePrecision] / 2.0), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{\frac{\frac{k}{n}}{\pi}}{2}\right)}^{-0.5}
\end{array}
Initial program 98.6%
associate-/r/98.7%
associate-*r*98.7%
div-sub98.7%
metadata-eval98.7%
div-inv98.7%
metadata-eval98.7%
Applied egg-rr98.7%
Taylor expanded in k around 0 40.7%
associate-*r/40.7%
*-rgt-identity40.7%
*-commutative40.7%
associate-/r*40.9%
Simplified40.9%
inv-pow40.9%
sqrt-undiv40.9%
sqrt-pow240.9%
associate-/l/40.8%
metadata-eval40.8%
Applied egg-rr40.8%
associate-/r*40.9%
Simplified40.9%
Final simplification40.9%
(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 98.6%
Taylor expanded in k around 0 40.2%
*-commutative40.2%
associate-/l*40.1%
Simplified40.1%
pow140.1%
sqrt-unprod40.2%
associate-*r/40.2%
*-commutative40.2%
associate-/l*40.3%
Applied egg-rr40.3%
unpow140.3%
*-commutative40.3%
associate-*l*40.3%
Simplified40.3%
Taylor expanded in n around 0 40.2%
associate-/l*40.2%
Simplified40.2%
Final simplification40.2%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (/ n (/ k PI)))))
double code(double k, double n) {
return sqrt((2.0 * (n / (k / ((double) M_PI)))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (n / (k / Math.PI))));
}
def code(k, n): return math.sqrt((2.0 * (n / (k / math.pi))))
function code(k, n) return sqrt(Float64(2.0 * Float64(n / Float64(k / pi)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (n / (k / pi)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(n / N[(k / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{n}{\frac{k}{\pi}}}
\end{array}
Initial program 98.6%
Taylor expanded in k around 0 40.2%
*-commutative40.2%
associate-/l*40.1%
Simplified40.1%
pow140.1%
sqrt-unprod40.2%
associate-*r/40.2%
*-commutative40.2%
associate-/l*40.3%
Applied egg-rr40.3%
unpow140.3%
*-commutative40.3%
associate-*l*40.3%
Simplified40.3%
Taylor expanded in n around 0 40.2%
associate-/l*40.2%
Simplified40.2%
clear-num40.2%
un-div-inv40.2%
Applied egg-rr40.2%
Final simplification40.2%
(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 98.6%
Taylor expanded in k around 0 40.2%
*-commutative40.2%
associate-/l*40.1%
Simplified40.1%
pow140.1%
sqrt-unprod40.2%
associate-*r/40.2%
*-commutative40.2%
associate-/l*40.3%
Applied egg-rr40.3%
unpow140.3%
*-commutative40.3%
associate-*l*40.3%
Simplified40.3%
Taylor expanded in n around 0 40.2%
associate-*r/40.2%
*-commutative40.2%
associate-/l*40.2%
*-commutative40.2%
associate-*r*40.3%
Simplified40.3%
Final simplification40.3%
herbie shell --seed 2024071
(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))))