
(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 k -0.5) (pow (* PI (* n 2.0)) (+ -0.5 (* k 0.5)))))
double code(double k, double n) {
return pow(k, -0.5) / pow((((double) M_PI) * (n * 2.0)), (-0.5 + (k * 0.5)));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) / Math.pow((Math.PI * (n * 2.0)), (-0.5 + (k * 0.5)));
}
def code(k, n): return math.pow(k, -0.5) / math.pow((math.pi * (n * 2.0)), (-0.5 + (k * 0.5)))
function code(k, n) return Float64((k ^ -0.5) / (Float64(pi * Float64(n * 2.0)) ^ Float64(-0.5 + Float64(k * 0.5)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) / ((pi * (n * 2.0)) ^ (-0.5 + (k * 0.5))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] / N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(-0.5 + N[(k * 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{k}^{-0.5}}{{\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(-0.5 + k \cdot 0.5\right)}}
\end{array}
Initial program 99.2%
associate-/r/99.2%
associate-*r*99.2%
div-sub99.2%
metadata-eval99.2%
sub-neg99.2%
div-inv99.2%
metadata-eval99.2%
distribute-rgt-neg-in99.2%
metadata-eval99.2%
Applied egg-rr99.2%
inv-pow99.2%
div-inv99.1%
unpow-prod-down99.1%
inv-pow99.1%
pow1/299.1%
pow-flip99.2%
metadata-eval99.2%
pow-flip99.2%
+-commutative99.2%
fma-define99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-*r/99.3%
*-commutative99.3%
associate-*l*99.3%
neg-sub099.3%
fma-undefine99.3%
*-commutative99.3%
+-commutative99.3%
metadata-eval99.3%
cancel-sign-sub-inv99.3%
*-commutative99.3%
associate--r-99.3%
metadata-eval99.3%
Simplified99.3%
*-rgt-identity99.3%
Applied egg-rr99.3%
(FPCore (k n) :precision binary64 (if (<= k 3.7e-26) (/ (sqrt (* n (* PI 2.0))) (sqrt k)) (sqrt (/ (pow (* 2.0 (* PI n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 3.7e-26) {
tmp = sqrt((n * (((double) M_PI) * 2.0))) / sqrt(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.7e-26) {
tmp = Math.sqrt((n * (Math.PI * 2.0))) / Math.sqrt(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.7e-26: tmp = math.sqrt((n * (math.pi * 2.0))) / math.sqrt(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.7e-26) tmp = Float64(sqrt(Float64(n * Float64(pi * 2.0))) / sqrt(k)); 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 <= 3.7e-26) tmp = sqrt((n * (pi * 2.0))) / sqrt(k); else tmp = sqrt((((2.0 * (pi * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.7e-26], N[(N[Sqrt[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $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 3.7 \cdot 10^{-26}:\\
\;\;\;\;\frac{\sqrt{n \cdot \left(\pi \cdot 2\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 3.6999999999999999e-26Initial program 98.2%
Taylor expanded in k around 0 98.2%
associate-*l/98.3%
*-un-lft-identity98.3%
sqrt-unprod98.4%
*-commutative98.4%
*-commutative98.4%
associate-*r*98.4%
Applied egg-rr98.4%
if 3.6999999999999999e-26 < k Initial program 99.8%
Applied egg-rr98.6%
*-commutative98.6%
distribute-lft-in98.6%
metadata-eval98.6%
*-commutative98.6%
associate-*r*98.6%
metadata-eval98.6%
neg-mul-198.6%
sub-neg98.6%
Simplified98.6%
Final simplification98.5%
(FPCore (k n) :precision binary64 (if (<= k 5.0) (/ (sqrt (* n (* PI 2.0))) (sqrt k)) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = sqrt((n * (((double) M_PI) * 2.0))) / sqrt(k);
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = Math.sqrt((n * (Math.PI * 2.0))) / Math.sqrt(k);
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 5.0: tmp = math.sqrt((n * (math.pi * 2.0))) / math.sqrt(k) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 5.0) tmp = Float64(sqrt(Float64(n * Float64(pi * 2.0))) / sqrt(k)); else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 5.0) tmp = sqrt((n * (pi * 2.0))) / sqrt(k); else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5.0], N[(N[Sqrt[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5:\\
\;\;\;\;\frac{\sqrt{n \cdot \left(\pi \cdot 2\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 5Initial program 98.2%
Taylor expanded in k around 0 95.2%
associate-*l/95.4%
*-un-lft-identity95.4%
sqrt-unprod95.5%
*-commutative95.5%
*-commutative95.5%
associate-*r*95.5%
Applied egg-rr95.5%
if 5 < k Initial program 100.0%
Taylor expanded in k around 0 2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
pow12.7%
sqrt-unprod2.7%
Applied egg-rr2.7%
unpow12.7%
associate-*r/2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
expm1-log1p-u2.7%
expm1-undefine26.9%
associate-*r/26.9%
Applied egg-rr26.9%
sub-neg26.9%
metadata-eval26.9%
+-commutative26.9%
log1p-undefine26.9%
rem-exp-log26.9%
+-commutative26.9%
associate-/l*26.9%
fma-define26.9%
Simplified26.9%
Taylor expanded in n around 0 53.6%
Final simplification72.3%
(FPCore (k n) :precision binary64 (if (<= k 5.0) (* (sqrt (/ PI k)) (sqrt (* n 2.0))) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((n * 2.0));
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((n * 2.0));
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 5.0: tmp = math.sqrt((math.pi / k)) * math.sqrt((n * 2.0)) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 5.0) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(n * 2.0))); else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 5.0) tmp = sqrt((pi / k)) * sqrt((n * 2.0)); else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5.0], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{n \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 5Initial program 98.2%
Taylor expanded in k around 0 79.9%
*-commutative79.9%
associate-/l*79.9%
Simplified79.9%
*-commutative79.9%
sqrt-prod96.1%
Applied egg-rr96.1%
*-commutative96.1%
sqrt-unprod79.9%
sqrt-unprod80.1%
Applied egg-rr80.1%
associate-*l*80.1%
sqrt-prod95.5%
Applied egg-rr95.5%
if 5 < k Initial program 100.0%
Taylor expanded in k around 0 2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
pow12.7%
sqrt-unprod2.7%
Applied egg-rr2.7%
unpow12.7%
associate-*r/2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
expm1-log1p-u2.7%
expm1-undefine26.9%
associate-*r/26.9%
Applied egg-rr26.9%
sub-neg26.9%
metadata-eval26.9%
+-commutative26.9%
log1p-undefine26.9%
rem-exp-log26.9%
+-commutative26.9%
associate-/l*26.9%
fma-define26.9%
Simplified26.9%
Taylor expanded in n around 0 53.6%
Final simplification72.2%
(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.2%
associate-*l/99.3%
*-lft-identity99.3%
associate-*l*99.3%
div-sub99.3%
metadata-eval99.3%
Simplified99.3%
(FPCore (k n) :precision binary64 (if (<= k 5.0) (/ 1.0 (sqrt (/ (/ k 2.0) (* PI n)))) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = 1.0 / sqrt(((k / 2.0) / (((double) M_PI) * n)));
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = 1.0 / Math.sqrt(((k / 2.0) / (Math.PI * n)));
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 5.0: tmp = 1.0 / math.sqrt(((k / 2.0) / (math.pi * n))) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 5.0) tmp = Float64(1.0 / sqrt(Float64(Float64(k / 2.0) / Float64(pi * n)))); else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 5.0) tmp = 1.0 / sqrt(((k / 2.0) / (pi * n))); else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5.0], N[(1.0 / N[Sqrt[N[(N[(k / 2.0), $MachinePrecision] / N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5:\\
\;\;\;\;\frac{1}{\sqrt{\frac{\frac{k}{2}}{\pi \cdot n}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 5Initial program 98.2%
Taylor expanded in k around 0 79.9%
*-commutative79.9%
associate-/l*79.9%
Simplified79.9%
pow179.9%
sqrt-unprod80.1%
Applied egg-rr80.1%
unpow180.1%
associate-*r/80.2%
*-commutative80.2%
associate-/l*80.1%
Simplified80.1%
metadata-eval80.1%
associate-*r/80.2%
times-frac80.2%
associate-*r*80.2%
*-un-lft-identity80.2%
sqrt-undiv95.5%
clear-num95.4%
associate-*r*95.4%
sqrt-undiv83.2%
Applied egg-rr83.2%
associate-/r*83.2%
*-commutative83.2%
Simplified83.2%
if 5 < k Initial program 100.0%
Taylor expanded in k around 0 2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
pow12.7%
sqrt-unprod2.7%
Applied egg-rr2.7%
unpow12.7%
associate-*r/2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
expm1-log1p-u2.7%
expm1-undefine26.9%
associate-*r/26.9%
Applied egg-rr26.9%
sub-neg26.9%
metadata-eval26.9%
+-commutative26.9%
log1p-undefine26.9%
rem-exp-log26.9%
+-commutative26.9%
associate-/l*26.9%
fma-define26.9%
Simplified26.9%
Taylor expanded in n around 0 53.6%
Final simplification66.8%
(FPCore (k n) :precision binary64 (if (<= k 5.0) (sqrt (/ (* n (* PI 2.0)) k)) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = sqrt(((n * (((double) M_PI) * 2.0)) / k));
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = Math.sqrt(((n * (Math.PI * 2.0)) / k));
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 5.0: tmp = math.sqrt(((n * (math.pi * 2.0)) / k)) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 5.0) tmp = sqrt(Float64(Float64(n * Float64(pi * 2.0)) / k)); else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 5.0) tmp = sqrt(((n * (pi * 2.0)) / k)); else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5.0], N[Sqrt[N[(N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5:\\
\;\;\;\;\sqrt{\frac{n \cdot \left(\pi \cdot 2\right)}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 5Initial program 98.2%
Taylor expanded in k around 0 95.2%
associate-*l/95.4%
*-un-lft-identity95.4%
sqrt-unprod95.5%
*-commutative95.5%
*-commutative95.5%
sqrt-undiv80.2%
associate-*r*80.2%
Applied egg-rr80.2%
if 5 < k Initial program 100.0%
Taylor expanded in k around 0 2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
pow12.7%
sqrt-unprod2.7%
Applied egg-rr2.7%
unpow12.7%
associate-*r/2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
expm1-log1p-u2.7%
expm1-undefine26.9%
associate-*r/26.9%
Applied egg-rr26.9%
sub-neg26.9%
metadata-eval26.9%
+-commutative26.9%
log1p-undefine26.9%
rem-exp-log26.9%
+-commutative26.9%
associate-/l*26.9%
fma-define26.9%
Simplified26.9%
Taylor expanded in n around 0 53.6%
Final simplification65.4%
(FPCore (k n) :precision binary64 (if (<= k 5.0) (sqrt (/ (* PI 2.0) (/ k n))) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = sqrt(((((double) M_PI) * 2.0) / (k / n)));
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = Math.sqrt(((Math.PI * 2.0) / (k / n)));
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 5.0: tmp = math.sqrt(((math.pi * 2.0) / (k / n))) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 5.0) tmp = sqrt(Float64(Float64(pi * 2.0) / Float64(k / n))); else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 5.0) tmp = sqrt(((pi * 2.0) / (k / n))); else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5.0], N[Sqrt[N[(N[(Pi * 2.0), $MachinePrecision] / N[(k / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5:\\
\;\;\;\;\sqrt{\frac{\pi \cdot 2}{\frac{k}{n}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 5Initial program 98.2%
Taylor expanded in k around 0 79.9%
*-commutative79.9%
associate-/l*79.9%
Simplified79.9%
pow179.9%
sqrt-unprod80.1%
Applied egg-rr80.1%
unpow180.1%
associate-*r/80.2%
*-commutative80.2%
associate-/l*80.1%
Simplified80.1%
associate-*r*80.1%
clear-num80.1%
un-div-inv80.2%
Applied egg-rr80.2%
if 5 < k Initial program 100.0%
Taylor expanded in k around 0 2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
pow12.7%
sqrt-unprod2.7%
Applied egg-rr2.7%
unpow12.7%
associate-*r/2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
expm1-log1p-u2.7%
expm1-undefine26.9%
associate-*r/26.9%
Applied egg-rr26.9%
sub-neg26.9%
metadata-eval26.9%
+-commutative26.9%
log1p-undefine26.9%
rem-exp-log26.9%
+-commutative26.9%
associate-/l*26.9%
fma-define26.9%
Simplified26.9%
Taylor expanded in n around 0 53.6%
Final simplification65.4%
(FPCore (k n) :precision binary64 (if (<= k 5.0) (sqrt (* 2.0 (* PI (/ n k)))) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = sqrt((2.0 * (((double) M_PI) * (n / k))));
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5.0) {
tmp = Math.sqrt((2.0 * (Math.PI * (n / k))));
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 5.0: tmp = math.sqrt((2.0 * (math.pi * (n / k)))) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 5.0) tmp = sqrt(Float64(2.0 * Float64(pi * Float64(n / k)))); else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 5.0) tmp = sqrt((2.0 * (pi * (n / k)))); else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5.0], N[Sqrt[N[(2.0 * N[(Pi * N[(n / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5:\\
\;\;\;\;\sqrt{2 \cdot \left(\pi \cdot \frac{n}{k}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 5Initial program 98.2%
Taylor expanded in k around 0 79.9%
*-commutative79.9%
associate-/l*79.9%
Simplified79.9%
pow179.9%
sqrt-unprod80.1%
Applied egg-rr80.1%
unpow180.1%
associate-*r/80.2%
*-commutative80.2%
associate-/l*80.1%
Simplified80.1%
if 5 < k Initial program 100.0%
Taylor expanded in k around 0 2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
pow12.7%
sqrt-unprod2.7%
Applied egg-rr2.7%
unpow12.7%
associate-*r/2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
expm1-log1p-u2.7%
expm1-undefine26.9%
associate-*r/26.9%
Applied egg-rr26.9%
sub-neg26.9%
metadata-eval26.9%
+-commutative26.9%
log1p-undefine26.9%
rem-exp-log26.9%
+-commutative26.9%
associate-/l*26.9%
fma-define26.9%
Simplified26.9%
Taylor expanded in n around 0 53.6%
Final simplification65.4%
(FPCore (k n) :precision binary64 (sqrt 0.0))
double code(double k, double n) {
return sqrt(0.0);
}
real(8) function code(k, n)
real(8), intent (in) :: k
real(8), intent (in) :: n
code = sqrt(0.0d0)
end function
public static double code(double k, double n) {
return Math.sqrt(0.0);
}
def code(k, n): return math.sqrt(0.0)
function code(k, n) return sqrt(0.0) end
function tmp = code(k, n) tmp = sqrt(0.0); end
code[k_, n_] := N[Sqrt[0.0], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{0}
\end{array}
Initial program 99.2%
Taylor expanded in k around 0 37.1%
*-commutative37.1%
associate-/l*37.1%
Simplified37.1%
pow137.1%
sqrt-unprod37.2%
Applied egg-rr37.2%
unpow137.2%
associate-*r/37.2%
*-commutative37.2%
associate-/l*37.2%
Simplified37.2%
expm1-log1p-u35.5%
expm1-undefine37.7%
associate-*r/37.7%
Applied egg-rr37.7%
sub-neg37.7%
metadata-eval37.7%
+-commutative37.7%
log1p-undefine37.7%
rem-exp-log39.4%
+-commutative39.4%
associate-/l*39.4%
fma-define39.4%
Simplified39.4%
Taylor expanded in n around 0 31.0%
Final simplification31.0%
herbie shell --seed 2024145
(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))))