
(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 9 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 k -0.5) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return pow(k, -0.5) * pow(((2.0 * ((double) M_PI)) * n), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.pow(((2.0 * Math.PI) * n), ((1.0 - k) / 2.0));
}
def code(k, n): return math.pow(k, -0.5) * math.pow(((2.0 * math.pi) * n), ((1.0 - k) / 2.0))
function code(k, n) return Float64((k ^ -0.5) * (Float64(Float64(2.0 * pi) * n) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * (((2.0 * pi) * n) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[Power[k, -0.5], $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}
\\
{k}^{-0.5} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Initial program 99.5%
expm1-log1p-u96.0%
expm1-udef74.1%
inv-pow74.1%
sqrt-pow274.1%
metadata-eval74.1%
Applied egg-rr74.1%
expm1-def96.0%
expm1-log1p99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* PI (* 2.0 n))))
(if (<= k 6.8e-38)
(* (pow k -0.5) (sqrt t_0))
(sqrt (/ 1.0 (* k (pow t_0 (+ k -1.0))))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
double tmp;
if (k <= 6.8e-38) {
tmp = pow(k, -0.5) * sqrt(t_0);
} else {
tmp = sqrt((1.0 / (k * pow(t_0, (k + -1.0)))));
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
double tmp;
if (k <= 6.8e-38) {
tmp = Math.pow(k, -0.5) * Math.sqrt(t_0);
} else {
tmp = Math.sqrt((1.0 / (k * Math.pow(t_0, (k + -1.0)))));
}
return tmp;
}
def code(k, n): t_0 = math.pi * (2.0 * n) tmp = 0 if k <= 6.8e-38: tmp = math.pow(k, -0.5) * math.sqrt(t_0) else: tmp = math.sqrt((1.0 / (k * math.pow(t_0, (k + -1.0))))) return tmp
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) tmp = 0.0 if (k <= 6.8e-38) tmp = Float64((k ^ -0.5) * sqrt(t_0)); else tmp = sqrt(Float64(1.0 / Float64(k * (t_0 ^ Float64(k + -1.0))))); end return tmp end
function tmp_2 = code(k, n) t_0 = pi * (2.0 * n); tmp = 0.0; if (k <= 6.8e-38) tmp = (k ^ -0.5) * sqrt(t_0); else tmp = sqrt((1.0 / (k * (t_0 ^ (k + -1.0))))); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 6.8e-38], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(1.0 / N[(k * N[Power[t$95$0, N[(k + -1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(2 \cdot n\right)\\
\mathbf{if}\;k \leq 6.8 \cdot 10^{-38}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{k \cdot {t_0}^{\left(k + -1\right)}}}\\
\end{array}
\end{array}
if k < 6.8000000000000004e-38Initial program 99.3%
expm1-log1p-u92.4%
expm1-udef92.4%
inv-pow92.4%
sqrt-pow292.4%
metadata-eval92.4%
Applied egg-rr92.4%
expm1-def92.4%
expm1-log1p99.5%
Simplified99.5%
Taylor expanded in k around 0 99.3%
expm1-log1p-u96.4%
expm1-udef44.7%
sqrt-unprod44.7%
*-commutative44.7%
Applied egg-rr44.7%
expm1-def96.6%
expm1-log1p99.5%
*-commutative99.5%
associate-*r*99.5%
Simplified99.5%
if 6.8000000000000004e-38 < k Initial program 99.6%
*-commutative99.6%
*-commutative99.6%
associate-*r*99.6%
div-inv99.6%
add-sqr-sqrt98.8%
sqrt-unprod98.8%
frac-times98.9%
Applied egg-rr98.8%
pow-sub99.2%
pow199.2%
associate-*r*99.2%
*-commutative99.2%
associate-*l*99.2%
associate-*r*99.2%
*-commutative99.2%
associate-*l*99.2%
Applied egg-rr99.2%
pow199.2%
pow-sub98.8%
clear-num98.8%
inv-pow98.8%
div-inv98.9%
pow-sub99.2%
pow199.2%
clear-num99.2%
pow199.2%
pow-div98.9%
Applied egg-rr98.9%
unpow-198.9%
*-commutative98.9%
sub-neg98.9%
metadata-eval98.9%
Simplified98.9%
Final simplification99.2%
(FPCore (k n) :precision binary64 (if (<= k 5.5e-38) (* (pow k -0.5) (sqrt (* PI (* 2.0 n)))) (sqrt (/ (pow (* 2.0 (* PI n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 5.5e-38) {
tmp = pow(k, -0.5) * sqrt((((double) M_PI) * (2.0 * n)));
} 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 <= 5.5e-38) {
tmp = Math.pow(k, -0.5) * Math.sqrt((Math.PI * (2.0 * n)));
} 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 <= 5.5e-38: tmp = math.pow(k, -0.5) * math.sqrt((math.pi * (2.0 * n))) 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 <= 5.5e-38) tmp = Float64((k ^ -0.5) * sqrt(Float64(pi * Float64(2.0 * n)))); 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 <= 5.5e-38) tmp = (k ^ -0.5) * sqrt((pi * (2.0 * n))); else tmp = sqrt((((2.0 * (pi * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5.5e-38], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(Pi * N[(2.0 * n), $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 5.5 \cdot 10^{-38}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{\pi \cdot \left(2 \cdot n\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 < 5.50000000000000005e-38Initial program 99.3%
expm1-log1p-u92.4%
expm1-udef92.4%
inv-pow92.4%
sqrt-pow292.4%
metadata-eval92.4%
Applied egg-rr92.4%
expm1-def92.4%
expm1-log1p99.5%
Simplified99.5%
Taylor expanded in k around 0 99.3%
expm1-log1p-u96.4%
expm1-udef44.7%
sqrt-unprod44.7%
*-commutative44.7%
Applied egg-rr44.7%
expm1-def96.6%
expm1-log1p99.5%
*-commutative99.5%
associate-*r*99.5%
Simplified99.5%
if 5.50000000000000005e-38 < k Initial program 99.6%
*-commutative99.6%
*-commutative99.6%
associate-*r*99.6%
div-inv99.6%
add-sqr-sqrt98.8%
sqrt-unprod98.8%
frac-times98.9%
Applied egg-rr98.8%
Final simplification99.2%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (/ (- 1.0 k) 2.0)) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), ((1.0 - k) / 2.0)) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (2.0 * n)), ((1.0 - k) / 2.0)) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (2.0 * n)), ((1.0 - k) / 2.0)) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(Float64(1.0 - k) / 2.0)) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (2.0 * n)) ^ ((1.0 - k) / 2.0)) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(\frac{1 - k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
*-commutative99.5%
associate-*l*99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (sqrt (* PI (* 2.0 n)))))
double code(double k, double n) {
return pow(k, -0.5) * sqrt((((double) M_PI) * (2.0 * n)));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.sqrt((Math.PI * (2.0 * n)));
}
def code(k, n): return math.pow(k, -0.5) * math.sqrt((math.pi * (2.0 * n)))
function code(k, n) return Float64((k ^ -0.5) * sqrt(Float64(pi * Float64(2.0 * n)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * sqrt((pi * (2.0 * n))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot \sqrt{\pi \cdot \left(2 \cdot n\right)}
\end{array}
Initial program 99.5%
expm1-log1p-u96.0%
expm1-udef74.1%
inv-pow74.1%
sqrt-pow274.1%
metadata-eval74.1%
Applied egg-rr74.1%
expm1-def96.0%
expm1-log1p99.5%
Simplified99.5%
Taylor expanded in k around 0 54.4%
expm1-log1p-u52.9%
expm1-udef25.8%
sqrt-unprod25.8%
*-commutative25.8%
Applied egg-rr25.8%
expm1-def53.0%
expm1-log1p54.5%
*-commutative54.5%
associate-*r*54.5%
Simplified54.5%
Final simplification54.5%
(FPCore (k n) :precision binary64 (/ (sqrt 2.0) (sqrt (/ k (* PI n)))))
double code(double k, double n) {
return sqrt(2.0) / sqrt((k / (((double) M_PI) * n)));
}
public static double code(double k, double n) {
return Math.sqrt(2.0) / Math.sqrt((k / (Math.PI * n)));
}
def code(k, n): return math.sqrt(2.0) / math.sqrt((k / (math.pi * n)))
function code(k, n) return Float64(sqrt(2.0) / sqrt(Float64(k / Float64(pi * n)))) end
function tmp = code(k, n) tmp = sqrt(2.0) / sqrt((k / (pi * n))); end
code[k_, n_] := N[(N[Sqrt[2.0], $MachinePrecision] / N[Sqrt[N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{2}}{\sqrt{\frac{k}{\pi \cdot n}}}
\end{array}
Initial program 99.5%
*-commutative99.5%
*-commutative99.5%
associate-*r*99.5%
div-inv99.5%
add-sqr-sqrt98.9%
sqrt-unprod88.9%
frac-times88.9%
Applied egg-rr89.0%
Taylor expanded in k around 0 44.3%
*-commutative44.3%
Simplified44.3%
associate-/l*44.3%
sqrt-div44.7%
Applied egg-rr44.7%
Final simplification44.7%
(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.5%
*-commutative99.5%
*-commutative99.5%
associate-*r*99.5%
div-inv99.5%
add-sqr-sqrt98.9%
sqrt-unprod88.9%
frac-times88.9%
Applied egg-rr89.0%
Taylor expanded in k around 0 44.3%
*-commutative44.3%
Simplified44.3%
sqrt-div54.5%
*-commutative54.5%
sqrt-unprod54.4%
div-inv54.3%
sqrt-unprod54.4%
*-commutative54.4%
Applied egg-rr54.4%
associate-*r/54.5%
*-rgt-identity54.5%
*-commutative54.5%
associate-*r*54.5%
Simplified54.5%
Final simplification54.5%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (/ k (* PI (* 2.0 n))))))
double code(double k, double n) {
return 1.0 / sqrt((k / (((double) M_PI) * (2.0 * n))));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt((k / (Math.PI * (2.0 * n))));
}
def code(k, n): return 1.0 / math.sqrt((k / (math.pi * (2.0 * n))))
function code(k, n) return Float64(1.0 / sqrt(Float64(k / Float64(pi * Float64(2.0 * n))))) end
function tmp = code(k, n) tmp = 1.0 / sqrt((k / (pi * (2.0 * n)))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(k / N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{\frac{k}{\pi \cdot \left(2 \cdot n\right)}}}
\end{array}
Initial program 99.5%
*-commutative99.5%
*-commutative99.5%
associate-*r*99.5%
div-inv99.5%
add-sqr-sqrt98.9%
sqrt-unprod88.9%
frac-times88.9%
Applied egg-rr89.0%
Taylor expanded in k around 0 44.3%
*-commutative44.3%
Simplified44.3%
clear-num44.3%
sqrt-div44.7%
metadata-eval44.7%
Applied egg-rr44.7%
*-commutative44.7%
associate-*r*44.7%
Simplified44.7%
Final simplification44.7%
(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%
*-commutative99.5%
*-commutative99.5%
associate-*r*99.5%
div-inv99.5%
add-sqr-sqrt98.9%
sqrt-unprod88.9%
frac-times88.9%
Applied egg-rr89.0%
Taylor expanded in k around 0 44.3%
*-commutative44.3%
Simplified44.3%
*-commutative44.3%
*-un-lft-identity44.3%
times-frac44.3%
metadata-eval44.3%
*-commutative44.3%
Applied egg-rr44.3%
Taylor expanded in n around 0 44.3%
associate-/l*44.3%
associate-/r/44.3%
Simplified44.3%
Final simplification44.3%
herbie shell --seed 2023240
(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))))