
(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 7 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 (/ 1.0 (/ (sqrt k) (pow (* 2.0 (* PI n)) (+ 0.5 (* k -0.5))))))
double code(double k, double n) {
return 1.0 / (sqrt(k) / pow((2.0 * (((double) M_PI) * n)), (0.5 + (k * -0.5))));
}
public static double code(double k, double n) {
return 1.0 / (Math.sqrt(k) / Math.pow((2.0 * (Math.PI * n)), (0.5 + (k * -0.5))));
}
def code(k, n): return 1.0 / (math.sqrt(k) / math.pow((2.0 * (math.pi * n)), (0.5 + (k * -0.5))))
function code(k, n) return Float64(1.0 / Float64(sqrt(k) / (Float64(2.0 * Float64(pi * n)) ^ Float64(0.5 + Float64(k * -0.5))))) end
function tmp = code(k, n) tmp = 1.0 / (sqrt(k) / ((2.0 * (pi * n)) ^ (0.5 + (k * -0.5)))); end
code[k_, n_] := N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] / N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(0.5 + N[(k * -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{\sqrt{k}}{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(0.5 + k \cdot -0.5\right)}}}
\end{array}
Initial program 99.5%
associate-/r/99.6%
*-commutative99.6%
associate-*r*99.6%
div-sub99.6%
metadata-eval99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
sub-neg99.6%
div-inv99.6%
metadata-eval99.6%
distribute-rgt-neg-in99.6%
metadata-eval99.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 8e-34) (* (sqrt (/ PI k)) (sqrt (* 2.0 n))) (sqrt (/ (pow (* n (* 2.0 PI)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 8e-34) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
} else {
tmp = sqrt((pow((n * (2.0 * ((double) M_PI))), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 8e-34) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
} else {
tmp = Math.sqrt((Math.pow((n * (2.0 * Math.PI)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 8e-34: tmp = math.sqrt((math.pi / k)) * math.sqrt((2.0 * n)) else: tmp = math.sqrt((math.pow((n * (2.0 * math.pi)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 8e-34) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))); else tmp = sqrt(Float64((Float64(n * Float64(2.0 * pi)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 8e-34) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); else tmp = sqrt((((n * (2.0 * pi)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 8e-34], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 8 \cdot 10^{-34}:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 7.99999999999999942e-34Initial program 99.4%
add-sqr-sqrt99.0%
pow299.0%
Applied egg-rr99.0%
Taylor expanded in k around 0 69.8%
*-commutative69.8%
associate-/l*69.9%
associate-/r/69.8%
Simplified69.8%
sqrt-unprod70.1%
associate-/r/70.1%
associate-*r/70.1%
div-inv70.0%
clear-num70.1%
associate-*r*70.1%
Applied egg-rr70.1%
pow1/270.1%
associate-*r*70.1%
unpow-prod-down99.4%
pow1/299.4%
Applied egg-rr99.4%
*-commutative99.4%
unpow1/299.4%
*-commutative99.4%
Simplified99.4%
if 7.99999999999999942e-34 < k Initial program 99.6%
Applied egg-rr99.0%
Simplified99.0%
Taylor expanded in n around 0 98.4%
exp-prod98.3%
remove-double-neg98.3%
log-rec98.3%
mul-1-neg98.3%
+-commutative98.3%
exp-prod98.4%
Simplified99.0%
Final simplification99.2%
(FPCore (k n) :precision binary64 (if (<= k 1.45e+186) (* (sqrt (/ PI k)) (sqrt (* 2.0 n))) (pow (* (pow (* n (/ PI k)) 2.0) 4.0) 0.25)))
double code(double k, double n) {
double tmp;
if (k <= 1.45e+186) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
} else {
tmp = pow((pow((n * (((double) M_PI) / k)), 2.0) * 4.0), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.45e+186) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
} else {
tmp = Math.pow((Math.pow((n * (Math.PI / k)), 2.0) * 4.0), 0.25);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.45e+186: tmp = math.sqrt((math.pi / k)) * math.sqrt((2.0 * n)) else: tmp = math.pow((math.pow((n * (math.pi / k)), 2.0) * 4.0), 0.25) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.45e+186) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))); else tmp = Float64((Float64(n * Float64(pi / k)) ^ 2.0) * 4.0) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.45e+186) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); else tmp = (((n * (pi / k)) ^ 2.0) * 4.0) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.45e+186], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[Power[N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * 4.0), $MachinePrecision], 0.25], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.45 \cdot 10^{+186}:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}\\
\mathbf{else}:\\
\;\;\;\;{\left({\left(n \cdot \frac{\pi}{k}\right)}^{2} \cdot 4\right)}^{0.25}\\
\end{array}
\end{array}
if k < 1.45e186Initial program 99.4%
add-sqr-sqrt99.1%
pow299.1%
Applied egg-rr99.1%
Taylor expanded in k around 0 45.8%
*-commutative45.8%
associate-/l*45.8%
associate-/r/45.8%
Simplified45.8%
sqrt-unprod45.9%
associate-/r/45.9%
associate-*r/45.9%
div-inv45.9%
clear-num45.9%
associate-*r*45.9%
Applied egg-rr45.9%
pow1/245.9%
associate-*r*45.9%
unpow-prod-down62.4%
pow1/262.4%
Applied egg-rr62.4%
*-commutative62.4%
unpow1/262.4%
*-commutative62.4%
Simplified62.4%
if 1.45e186 < k Initial program 100.0%
add-sqr-sqrt100.0%
pow2100.0%
Applied egg-rr100.0%
Taylor expanded in k around 0 2.8%
*-commutative2.8%
associate-/l*2.8%
associate-/r/2.8%
Simplified2.8%
sqrt-unprod2.8%
associate-/r/2.8%
pow1/22.8%
metadata-eval2.8%
pow-prod-up2.8%
pow-prod-down17.2%
associate-/r/17.2%
*-commutative17.2%
associate-/r/17.2%
*-commutative17.2%
swap-sqr17.2%
pow217.2%
associate-/r/17.2%
div-inv17.2%
clear-num17.2%
metadata-eval17.2%
Applied egg-rr17.2%
Final simplification53.0%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (2.0 * n)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (2.0 * n)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (2.0 * n)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-lft-identity99.6%
sqr-pow99.4%
pow-sqr99.6%
*-commutative99.6%
associate-*l*99.6%
associate-*r/99.6%
*-commutative99.6%
associate-/l*99.6%
metadata-eval99.6%
/-rgt-identity99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (* (sqrt (/ PI k)) (sqrt (* 2.0 n))))
double code(double k, double n) {
return sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
}
def code(k, n): return math.sqrt((math.pi / k)) * math.sqrt((2.0 * n))
function code(k, n) return Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))) end
function tmp = code(k, n) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); end
code[k_, n_] := N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}
\end{array}
Initial program 99.5%
add-sqr-sqrt99.3%
pow299.3%
Applied egg-rr99.3%
Taylor expanded in k around 0 36.9%
*-commutative36.9%
associate-/l*36.9%
associate-/r/36.9%
Simplified36.9%
sqrt-unprod37.0%
associate-/r/37.0%
associate-*r/37.0%
div-inv37.0%
clear-num37.0%
associate-*r*37.0%
Applied egg-rr37.0%
pow1/237.0%
associate-*r*37.0%
unpow-prod-down50.1%
pow1/250.1%
Applied egg-rr50.1%
*-commutative50.1%
unpow1/250.1%
*-commutative50.1%
Simplified50.1%
Final simplification50.1%
(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 99.5%
add-sqr-sqrt99.3%
pow299.3%
Applied egg-rr99.3%
Taylor expanded in k around 0 36.9%
*-commutative36.9%
associate-/l*36.9%
associate-/r/36.9%
Simplified36.9%
sqrt-unprod37.0%
associate-/r/37.0%
associate-*r/37.0%
div-inv37.0%
clear-num37.0%
associate-*r*37.0%
Applied egg-rr37.0%
Final simplification37.0%
(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 99.5%
add-sqr-sqrt99.3%
pow299.3%
Applied egg-rr99.3%
Taylor expanded in k around 0 36.9%
*-commutative36.9%
associate-/l*36.9%
associate-/r/36.9%
Simplified36.9%
sqrt-unprod37.0%
associate-/r/37.0%
associate-*r/37.0%
div-inv37.0%
clear-num37.0%
associate-*r*37.0%
Applied egg-rr37.0%
Taylor expanded in n around 0 37.0%
associate-/l*37.0%
Simplified37.0%
Final simplification37.0%
herbie shell --seed 2024024
(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))))