
(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 2.5e-48) (* (pow k -0.5) (sqrt (* n (* 2.0 PI)))) (sqrt (/ (pow (* 2.0 (* PI n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 2.5e-48) {
tmp = pow(k, -0.5) * sqrt((n * (2.0 * ((double) M_PI))));
} else {
tmp = sqrt((pow((2.0 * (((double) M_PI) * n)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 2.5e-48) {
tmp = Math.pow(k, -0.5) * Math.sqrt((n * (2.0 * Math.PI)));
} else {
tmp = Math.sqrt((Math.pow((2.0 * (Math.PI * n)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 2.5e-48: tmp = math.pow(k, -0.5) * math.sqrt((n * (2.0 * math.pi))) else: tmp = math.sqrt((math.pow((2.0 * (math.pi * n)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 2.5e-48) tmp = Float64((k ^ -0.5) * sqrt(Float64(n * Float64(2.0 * pi)))); else tmp = sqrt(Float64((Float64(2.0 * Float64(pi * n)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 2.5e-48) tmp = (k ^ -0.5) * sqrt((n * (2.0 * pi))); else tmp = sqrt((((2.0 * (pi * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 2.5e-48], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 2.5 \cdot 10^{-48}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{n \cdot \left(2 \cdot \pi\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 2.4999999999999999e-48Initial program 99.3%
Taylor expanded in k around 0 74.0%
associate-/l*74.0%
Simplified74.0%
pow174.0%
sqrt-unprod74.2%
Applied egg-rr74.2%
unpow174.2%
*-commutative74.2%
associate-*r/74.3%
*-commutative74.3%
associate-/l*74.3%
Simplified74.3%
associate-*r/74.3%
*-commutative74.3%
associate-/l*74.3%
div-inv74.2%
*-commutative74.2%
sqrt-prod99.3%
inv-pow99.3%
sqrt-pow199.4%
metadata-eval99.4%
Applied egg-rr99.4%
*-commutative99.4%
associate-*r*99.4%
rem-exp-log99.1%
rem-exp-log92.0%
exp-sum91.8%
+-commutative91.8%
exp-sum92.0%
rem-exp-log99.1%
rem-exp-log99.4%
*-commutative99.4%
Simplified99.4%
if 2.4999999999999999e-48 < k Initial program 99.7%
Applied egg-rr99.7%
distribute-lft-in99.7%
metadata-eval99.7%
*-commutative99.7%
associate-*r*99.7%
metadata-eval99.7%
neg-mul-199.7%
sub-neg99.7%
*-commutative99.7%
Simplified99.7%
Final simplification99.6%
(FPCore (k n) :precision binary64 (* (pow (* 2.0 (* PI n)) (+ 0.5 (* k -0.5))) (pow k -0.5)))
double code(double k, double n) {
return pow((2.0 * (((double) M_PI) * n)), (0.5 + (k * -0.5))) * pow(k, -0.5);
}
public static double code(double k, double n) {
return Math.pow((2.0 * (Math.PI * n)), (0.5 + (k * -0.5))) * Math.pow(k, -0.5);
}
def code(k, n): return math.pow((2.0 * (math.pi * n)), (0.5 + (k * -0.5))) * math.pow(k, -0.5)
function code(k, n) return Float64((Float64(2.0 * Float64(pi * n)) ^ Float64(0.5 + Float64(k * -0.5))) * (k ^ -0.5)) end
function tmp = code(k, n) tmp = ((2.0 * (pi * n)) ^ (0.5 + (k * -0.5))) * (k ^ -0.5); end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(0.5 + N[(k * -0.5), $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 + k \cdot -0.5\right)} \cdot {k}^{-0.5}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
associate-*l*99.5%
div-sub99.5%
metadata-eval99.5%
Simplified99.5%
metadata-eval99.5%
div-sub99.5%
associate-*r*99.5%
div-inv99.5%
associate-*r*99.5%
div-sub99.5%
metadata-eval99.5%
sub-neg99.5%
div-inv99.5%
metadata-eval99.5%
distribute-rgt-neg-in99.5%
metadata-eval99.5%
pow1/299.5%
pow-flip99.6%
metadata-eval99.6%
Applied egg-rr99.6%
(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.5%
associate-*l/99.5%
*-lft-identity99.5%
associate-*l*99.5%
div-sub99.5%
metadata-eval99.5%
Simplified99.5%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (sqrt (* n (* 2.0 PI)))))
double code(double k, double n) {
return pow(k, -0.5) * sqrt((n * (2.0 * ((double) M_PI))));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.sqrt((n * (2.0 * Math.PI)));
}
def code(k, n): return math.pow(k, -0.5) * math.sqrt((n * (2.0 * math.pi)))
function code(k, n) return Float64((k ^ -0.5) * sqrt(Float64(n * Float64(2.0 * pi)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * sqrt((n * (2.0 * pi))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot \sqrt{n \cdot \left(2 \cdot \pi\right)}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 37.7%
associate-/l*37.7%
Simplified37.7%
pow137.7%
sqrt-unprod37.8%
Applied egg-rr37.8%
unpow137.8%
*-commutative37.8%
associate-*r/37.8%
*-commutative37.8%
associate-/l*37.8%
Simplified37.8%
associate-*r/37.8%
*-commutative37.8%
associate-/l*37.8%
div-inv37.8%
*-commutative37.8%
sqrt-prod48.0%
inv-pow48.0%
sqrt-pow148.0%
metadata-eval48.0%
Applied egg-rr48.0%
*-commutative48.0%
associate-*r*48.0%
rem-exp-log47.8%
rem-exp-log44.6%
exp-sum44.5%
+-commutative44.5%
exp-sum44.6%
rem-exp-log47.8%
rem-exp-log48.0%
*-commutative48.0%
Simplified48.0%
Final simplification48.0%
(FPCore (k n) :precision binary64 (/ (sqrt (* n (* 2.0 PI))) (sqrt k)))
double code(double k, double n) {
return sqrt((n * (2.0 * ((double) M_PI)))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((n * (2.0 * Math.PI))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((n * (2.0 * math.pi))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(n * Float64(2.0 * pi))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((n * (2.0 * pi))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{n \cdot \left(2 \cdot \pi\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 37.7%
associate-/l*37.7%
Simplified37.7%
pow137.7%
sqrt-unprod37.8%
Applied egg-rr37.8%
unpow137.8%
*-commutative37.8%
associate-*r/37.8%
*-commutative37.8%
associate-/l*37.8%
Simplified37.8%
associate-*r/37.8%
*-commutative37.8%
associate-/l*37.8%
*-commutative37.8%
sqrt-div47.9%
Applied egg-rr47.9%
associate-*r*47.9%
rem-exp-log47.8%
rem-exp-log44.7%
exp-sum44.5%
+-commutative44.5%
exp-sum44.7%
rem-exp-log47.8%
rem-exp-log47.9%
*-commutative47.9%
Simplified47.9%
Final simplification47.9%
(FPCore (k n) :precision binary64 (pow (* (/ k PI) (/ 0.5 n)) -0.5))
double code(double k, double n) {
return pow(((k / ((double) M_PI)) * (0.5 / n)), -0.5);
}
public static double code(double k, double n) {
return Math.pow(((k / Math.PI) * (0.5 / n)), -0.5);
}
def code(k, n): return math.pow(((k / math.pi) * (0.5 / n)), -0.5)
function code(k, n) return Float64(Float64(k / pi) * Float64(0.5 / n)) ^ -0.5 end
function tmp = code(k, n) tmp = ((k / pi) * (0.5 / n)) ^ -0.5; end
code[k_, n_] := N[Power[N[(N[(k / Pi), $MachinePrecision] * N[(0.5 / n), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{k}{\pi} \cdot \frac{0.5}{n}\right)}^{-0.5}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 37.7%
associate-/l*37.7%
Simplified37.7%
pow137.7%
sqrt-unprod37.8%
Applied egg-rr37.8%
unpow137.8%
*-commutative37.8%
associate-*r/37.8%
*-commutative37.8%
associate-/l*37.8%
Simplified37.8%
clear-num37.8%
un-div-inv37.8%
Applied egg-rr37.8%
div-inv37.8%
clear-num37.8%
associate-/l*37.8%
clear-num37.8%
*-commutative37.8%
associate-/l/37.8%
un-div-inv37.8%
sqrt-undiv37.9%
clear-num37.9%
inv-pow37.9%
sqrt-undiv37.9%
sqrt-pow238.0%
div-inv38.0%
associate-/l/38.0%
*-commutative38.0%
metadata-eval38.0%
metadata-eval38.0%
Applied egg-rr38.0%
associate-*l/38.0%
times-frac38.0%
Simplified38.0%
(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(Float64(pi * 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[(N[(Pi * n), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{\pi \cdot n}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 37.7%
associate-/l*37.7%
Simplified37.7%
pow137.7%
sqrt-unprod37.8%
Applied egg-rr37.8%
unpow137.8%
*-commutative37.8%
associate-*r/37.8%
*-commutative37.8%
associate-/l*37.8%
Simplified37.8%
associate-*r/37.8%
Applied egg-rr37.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.5%
Taylor expanded in k around 0 37.7%
associate-/l*37.7%
Simplified37.7%
pow137.7%
sqrt-unprod37.8%
Applied egg-rr37.8%
unpow137.8%
*-commutative37.8%
associate-*r/37.8%
*-commutative37.8%
associate-/l*37.8%
Simplified37.8%
herbie shell --seed 2024136
(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))))