
(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 (let* ((t_0 (* (* 2.0 PI) n))) (/ (sqrt t_0) (* (sqrt k) (pow t_0 (* k 0.5))))))
double code(double k, double n) {
double t_0 = (2.0 * ((double) M_PI)) * n;
return sqrt(t_0) / (sqrt(k) * pow(t_0, (k * 0.5)));
}
public static double code(double k, double n) {
double t_0 = (2.0 * Math.PI) * n;
return Math.sqrt(t_0) / (Math.sqrt(k) * Math.pow(t_0, (k * 0.5)));
}
def code(k, n): t_0 = (2.0 * math.pi) * n return math.sqrt(t_0) / (math.sqrt(k) * math.pow(t_0, (k * 0.5)))
function code(k, n) t_0 = Float64(Float64(2.0 * pi) * n) return Float64(sqrt(t_0) / Float64(sqrt(k) * (t_0 ^ Float64(k * 0.5)))) end
function tmp = code(k, n) t_0 = (2.0 * pi) * n; tmp = sqrt(t_0) / (sqrt(k) * (t_0 ^ (k * 0.5))); end
code[k_, n_] := Block[{t$95$0 = N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] / N[(N[Sqrt[k], $MachinePrecision] * N[Power[t$95$0, N[(k * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(2 \cdot \pi\right) \cdot n\\
\frac{\sqrt{t\_0}}{\sqrt{k} \cdot {t\_0}^{\left(k \cdot 0.5\right)}}
\end{array}
\end{array}
Initial program 99.6%
associate-*l/99.6%
*-un-lft-identity99.6%
associate-*r*99.6%
div-sub99.6%
metadata-eval99.6%
pow-div99.7%
pow1/299.7%
associate-/l/99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
associate-*r*99.7%
associate-*r*99.7%
Simplified99.7%
(FPCore (k n) :precision binary64 (if (<= k 3.4e-22) (* (sqrt (* PI n)) (sqrt (/ 2.0 k))) (sqrt (/ (pow (* (* 2.0 PI) n) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 3.4e-22) {
tmp = sqrt((((double) M_PI) * n)) * sqrt((2.0 / k));
} 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 <= 3.4e-22) {
tmp = Math.sqrt((Math.PI * n)) * Math.sqrt((2.0 / k));
} 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 <= 3.4e-22: tmp = math.sqrt((math.pi * n)) * math.sqrt((2.0 / k)) 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 <= 3.4e-22) tmp = Float64(sqrt(Float64(pi * n)) * sqrt(Float64(2.0 / k))); else tmp = sqrt(Float64((Float64(Float64(2.0 * pi) * n) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 3.4e-22) tmp = sqrt((pi * n)) * sqrt((2.0 / k)); else tmp = sqrt(((((2.0 * pi) * n) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.4e-22], N[(N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.4 \cdot 10^{-22}:\\
\;\;\;\;\sqrt{\pi \cdot n} \cdot \sqrt{\frac{2}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 3.3999999999999998e-22Initial program 99.3%
Taylor expanded in k around 0 75.5%
associate-/l*75.4%
Simplified75.4%
sqrt-unprod75.6%
Applied egg-rr75.6%
sqrt-prod75.4%
associate-*r/75.5%
*-commutative75.5%
*-commutative75.5%
sqrt-div99.3%
div-inv99.2%
associate-*l*99.0%
sqrt-prod99.3%
*-commutative99.3%
*-un-lft-identity99.3%
*-commutative99.3%
sqrt-prod99.0%
associate-*l*99.2%
div-inv99.3%
sqrt-div75.5%
sqrt-prod75.7%
associate-/l*75.6%
Applied egg-rr75.6%
*-lft-identity75.6%
*-commutative75.6%
associate-*r/75.7%
*-commutative75.7%
associate-/l*75.6%
associate-*l*75.6%
associate-*l/75.6%
associate-/l*75.5%
Simplified75.5%
associate-*r*75.6%
sqrt-prod99.4%
*-commutative99.4%
Applied egg-rr99.4%
if 3.3999999999999998e-22 < k Initial program 99.8%
add-sqr-sqrt99.8%
sqrt-unprod99.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.6%
(FPCore (k n) :precision binary64 (if (<= k 8.8e+17) (/ (sqrt (* PI (* 2.0 n))) (sqrt k)) (sqrt (* n (+ -1.0 (fma 2.0 (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 8.8e+17) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
} else {
tmp = sqrt((n * (-1.0 + fma(2.0, (((double) M_PI) / k), 1.0))));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 8.8e+17) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)); else tmp = sqrt(Float64(n * Float64(-1.0 + fma(2.0, Float64(pi / k), 1.0)))); end return tmp end
code[k_, n_] := If[LessEqual[k, 8.8e+17], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(n * N[(-1.0 + N[(2.0 * N[(Pi / k), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 8.8 \cdot 10^{+17}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(-1 + \mathsf{fma}\left(2, \frac{\pi}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 8.8e17Initial program 99.1%
Taylor expanded in k around 0 90.9%
associate-*l/91.1%
*-un-lft-identity91.1%
*-commutative91.1%
*-commutative91.1%
sqrt-prod91.3%
Applied egg-rr91.3%
*-commutative91.3%
associate-*l*91.3%
Simplified91.3%
if 8.8e17 < k Initial program 100.0%
Taylor expanded in k around 0 2.5%
associate-/l*2.5%
Simplified2.5%
sqrt-unprod2.5%
Applied egg-rr2.5%
sqrt-prod2.5%
associate-*r/2.5%
*-commutative2.5%
*-commutative2.5%
sqrt-div2.6%
div-inv2.6%
associate-*l*2.6%
sqrt-prod2.6%
*-commutative2.6%
*-un-lft-identity2.6%
*-commutative2.6%
sqrt-prod2.6%
associate-*l*2.6%
div-inv2.6%
sqrt-div2.5%
sqrt-prod2.5%
associate-/l*2.5%
Applied egg-rr2.5%
*-lft-identity2.5%
*-commutative2.5%
associate-*r/2.5%
*-commutative2.5%
associate-/l*2.5%
associate-*l*2.5%
associate-*l/2.5%
associate-/l*2.5%
Simplified2.5%
expm1-log1p-u2.5%
expm1-undefine50.4%
associate-*r/50.4%
Applied egg-rr50.4%
sub-neg50.4%
metadata-eval50.4%
+-commutative50.4%
log1p-undefine50.4%
rem-exp-log50.4%
+-commutative50.4%
*-commutative50.4%
associate-*r/50.4%
fma-define50.4%
Simplified50.4%
Final simplification71.0%
(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.6%
associate-*l/99.6%
*-lft-identity99.6%
associate-*l*99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
(FPCore (k n) :precision binary64 (/ (sqrt (* PI (* 2.0 n))) (sqrt k)))
double code(double k, double n) {
return sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((math.pi * (2.0 * n))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((pi * (2.0 * n))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}
\end{array}
Initial program 99.6%
Taylor expanded in k around 0 47.1%
associate-*l/47.2%
*-un-lft-identity47.2%
*-commutative47.2%
*-commutative47.2%
sqrt-prod47.3%
Applied egg-rr47.3%
*-commutative47.3%
associate-*l*47.3%
Simplified47.3%
Final simplification47.3%
(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.6%
Taylor expanded in k around 0 36.7%
associate-/l*36.6%
Simplified36.6%
sqrt-unprod36.8%
Applied egg-rr36.8%
sqrt-prod36.6%
associate-*r/36.7%
*-commutative36.7%
*-commutative36.7%
sqrt-div47.2%
div-inv47.2%
associate-*l*47.1%
sqrt-prod47.2%
*-commutative47.2%
*-un-lft-identity47.2%
*-commutative47.2%
sqrt-prod47.1%
associate-*l*47.2%
div-inv47.2%
sqrt-div36.7%
sqrt-prod36.8%
associate-/l*36.8%
Applied egg-rr36.8%
*-lft-identity36.8%
*-commutative36.8%
associate-*r/36.8%
*-commutative36.8%
associate-/l*36.8%
associate-*l*36.8%
associate-*l/36.8%
associate-/l*36.7%
Simplified36.7%
associate-*r*36.7%
sqrt-prod47.3%
*-commutative47.3%
Applied egg-rr47.3%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (* 2.0 (/ PI k)))))
double code(double k, double n) {
return sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((2.0 * (math.pi / k)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}
\end{array}
Initial program 99.6%
Taylor expanded in k around 0 36.7%
associate-/l*36.6%
Simplified36.6%
sqrt-unprod36.8%
Applied egg-rr36.8%
pow1/236.8%
associate-*l*36.8%
unpow-prod-down47.2%
pow1/247.2%
*-commutative47.2%
Applied egg-rr47.2%
unpow1/247.2%
Simplified47.2%
(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.6%
Taylor expanded in k around 0 47.1%
associate-*l/47.2%
*-un-lft-identity47.2%
*-commutative47.2%
*-commutative47.2%
sqrt-prod47.3%
associate-*l*47.3%
sqrt-undiv36.8%
associate-*l*36.8%
Applied egg-rr36.8%
(FPCore (k n) :precision binary64 (sqrt (* PI (* 2.0 (/ n k)))))
double code(double k, double n) {
return sqrt((((double) M_PI) * (2.0 * (n / k))));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (2.0 * (n / k))));
}
def code(k, n): return math.sqrt((math.pi * (2.0 * (n / k))))
function code(k, n) return sqrt(Float64(pi * Float64(2.0 * Float64(n / k)))) end
function tmp = code(k, n) tmp = sqrt((pi * (2.0 * (n / k)))); end
code[k_, n_] := N[Sqrt[N[(Pi * N[(2.0 * N[(n / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \left(2 \cdot \frac{n}{k}\right)}
\end{array}
Initial program 99.6%
Taylor expanded in k around 0 36.7%
associate-/l*36.6%
Simplified36.6%
sqrt-unprod36.8%
Applied egg-rr36.8%
sqrt-prod36.6%
associate-*r/36.7%
*-commutative36.7%
*-commutative36.7%
sqrt-div47.2%
div-inv47.2%
associate-*l*47.1%
sqrt-prod47.2%
*-commutative47.2%
*-un-lft-identity47.2%
*-commutative47.2%
sqrt-prod47.1%
associate-*l*47.2%
div-inv47.2%
sqrt-div36.7%
sqrt-prod36.8%
associate-/l*36.8%
Applied egg-rr36.8%
*-lft-identity36.8%
associate-*r*36.8%
*-commutative36.8%
associate-*l*36.8%
Simplified36.8%
(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.6%
Taylor expanded in k around 0 36.7%
associate-/l*36.6%
Simplified36.6%
sqrt-unprod36.8%
Applied egg-rr36.8%
sqrt-prod36.6%
associate-*r/36.7%
*-commutative36.7%
*-commutative36.7%
sqrt-div47.2%
div-inv47.2%
associate-*l*47.1%
sqrt-prod47.2%
*-commutative47.2%
*-un-lft-identity47.2%
*-commutative47.2%
sqrt-prod47.1%
associate-*l*47.2%
div-inv47.2%
sqrt-div36.7%
sqrt-prod36.8%
associate-/l*36.8%
Applied egg-rr36.8%
*-lft-identity36.8%
*-commutative36.8%
associate-*r/36.8%
*-commutative36.8%
associate-/l*36.8%
associate-*l*36.8%
associate-*l/36.8%
associate-/l*36.7%
Simplified36.7%
herbie shell --seed 2024106
(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))))