
(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(2.0 * Float64(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[(2.0 * N[(Pi * n), $MachinePrecision]), $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 := 2 \cdot \left(\pi \cdot n\right)\\
\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.7%
*-un-lft-identity99.7%
associate-*r*99.7%
div-sub99.7%
metadata-eval99.7%
pow-div99.8%
pow1/299.8%
associate-/l/99.8%
div-inv99.8%
metadata-eval99.8%
Applied egg-rr99.8%
(FPCore (k n) :precision binary64 (if (<= k 1.06e-16) (/ (sqrt (* n (* 2.0 PI))) (sqrt k)) (sqrt (/ (pow (* 2.0 (* PI n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 1.06e-16) {
tmp = sqrt((n * (2.0 * ((double) M_PI)))) / 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 <= 1.06e-16) {
tmp = Math.sqrt((n * (2.0 * Math.PI))) / 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 <= 1.06e-16: tmp = math.sqrt((n * (2.0 * math.pi))) / 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 <= 1.06e-16) tmp = Float64(sqrt(Float64(n * Float64(2.0 * pi))) / 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 <= 1.06e-16) tmp = sqrt((n * (2.0 * pi))) / sqrt(k); else tmp = sqrt((((2.0 * (pi * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.06e-16], N[(N[Sqrt[N[(n * N[(2.0 * Pi), $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 1.06 \cdot 10^{-16}:\\
\;\;\;\;\frac{\sqrt{n \cdot \left(2 \cdot \pi\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 < 1.06e-16Initial program 99.3%
Taylor expanded in k around 0 99.0%
associate-*l/99.1%
*-un-lft-identity99.1%
*-commutative99.1%
*-commutative99.1%
sqrt-prod99.5%
Applied egg-rr99.5%
associate-*r*99.5%
*-commutative99.5%
Simplified99.5%
if 1.06e-16 < k Initial program 99.8%
Applied egg-rr99.8%
distribute-lft-in99.8%
metadata-eval99.8%
*-commutative99.8%
associate-*r*99.8%
metadata-eval99.8%
neg-mul-199.8%
sub-neg99.8%
*-commutative99.8%
Simplified99.8%
Final simplification99.7%
(FPCore (k n) :precision binary64 (if (<= k 3.1) (/ (sqrt (* n (* 2.0 PI))) (sqrt k)) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 3.1) {
tmp = sqrt((n * (2.0 * ((double) M_PI)))) / sqrt(k);
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 3.1) {
tmp = Math.sqrt((n * (2.0 * Math.PI))) / Math.sqrt(k);
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 3.1: tmp = math.sqrt((n * (2.0 * math.pi))) / math.sqrt(k) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 3.1) tmp = Float64(sqrt(Float64(n * Float64(2.0 * pi))) / sqrt(k)); else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 3.1) tmp = sqrt((n * (2.0 * pi))) / sqrt(k); else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.1], N[(N[Sqrt[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.1:\\
\;\;\;\;\frac{\sqrt{n \cdot \left(2 \cdot \pi\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 3.10000000000000009Initial program 99.1%
Taylor expanded in k around 0 96.9%
associate-*l/96.9%
*-un-lft-identity96.9%
*-commutative96.9%
*-commutative96.9%
sqrt-prod97.3%
Applied egg-rr97.3%
associate-*r*97.3%
*-commutative97.3%
Simplified97.3%
if 3.10000000000000009 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
pow12.6%
*-commutative2.6%
sqrt-unprod2.6%
Applied egg-rr2.6%
unpow12.6%
*-commutative2.6%
*-commutative2.6%
associate-*l*2.6%
Simplified2.6%
expm1-log1p-u2.6%
expm1-undefine24.5%
associate-*l/24.5%
associate-/l*24.5%
Applied egg-rr24.5%
sub-neg24.5%
metadata-eval24.5%
+-commutative24.5%
log1p-undefine24.5%
rem-exp-log24.5%
+-commutative24.5%
associate-*r/24.5%
*-rgt-identity24.5%
times-frac24.5%
/-rgt-identity24.5%
associate-*l*24.5%
*-commutative24.5%
associate-*l*24.5%
*-commutative24.5%
fma-define24.5%
associate-*r/24.5%
*-commutative24.5%
associate-/l*24.5%
Simplified24.5%
Taylor expanded in n around 0 48.2%
Final simplification71.4%
(FPCore (k n) :precision binary64 (if (<= k 3.2) (* (sqrt n) (sqrt (* 2.0 (/ PI k)))) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 3.2) {
tmp = sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 3.2) {
tmp = Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 3.2: tmp = math.sqrt(n) * math.sqrt((2.0 * (math.pi / k))) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 3.2) tmp = Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))); else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 3.2) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.2], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.2:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 3.2000000000000002Initial program 99.1%
Taylor expanded in k around 0 73.9%
associate-/l*73.9%
Simplified73.9%
pow173.9%
*-commutative73.9%
sqrt-unprod74.1%
Applied egg-rr74.1%
unpow174.1%
*-commutative74.1%
*-commutative74.1%
associate-*l*74.1%
Simplified74.1%
Taylor expanded in k around 0 74.0%
associate-*r/74.0%
*-commutative74.0%
associate-*l/74.0%
associate-/l*74.1%
associate-*l*74.1%
*-commutative74.1%
associate-*r/74.1%
*-commutative74.1%
associate-/l*74.1%
Simplified74.1%
sqrt-prod97.0%
Applied egg-rr97.0%
associate-*r/97.1%
*-commutative97.1%
associate-*r/97.1%
Simplified97.1%
if 3.2000000000000002 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
pow12.6%
*-commutative2.6%
sqrt-unprod2.6%
Applied egg-rr2.6%
unpow12.6%
*-commutative2.6%
*-commutative2.6%
associate-*l*2.6%
Simplified2.6%
expm1-log1p-u2.6%
expm1-undefine24.5%
associate-*l/24.5%
associate-/l*24.5%
Applied egg-rr24.5%
sub-neg24.5%
metadata-eval24.5%
+-commutative24.5%
log1p-undefine24.5%
rem-exp-log24.5%
+-commutative24.5%
associate-*r/24.5%
*-rgt-identity24.5%
times-frac24.5%
/-rgt-identity24.5%
associate-*l*24.5%
*-commutative24.5%
associate-*l*24.5%
*-commutative24.5%
fma-define24.5%
associate-*r/24.5%
*-commutative24.5%
associate-/l*24.5%
Simplified24.5%
Taylor expanded in n around 0 48.2%
Final simplification71.3%
(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.7%
*-lft-identity99.7%
associate-*l*99.7%
div-sub99.7%
metadata-eval99.7%
Simplified99.7%
(FPCore (k n) :precision binary64 (if (<= k 3.6) (pow (/ (/ k PI) (* 2.0 n)) -0.5) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 3.6) {
tmp = pow(((k / ((double) M_PI)) / (2.0 * n)), -0.5);
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 3.6) {
tmp = Math.pow(((k / Math.PI) / (2.0 * n)), -0.5);
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 3.6: tmp = math.pow(((k / math.pi) / (2.0 * n)), -0.5) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 3.6) tmp = Float64(Float64(k / pi) / Float64(2.0 * n)) ^ -0.5; else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 3.6) tmp = ((k / pi) / (2.0 * n)) ^ -0.5; else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.6], N[Power[N[(N[(k / Pi), $MachinePrecision] / N[(2.0 * n), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.6:\\
\;\;\;\;{\left(\frac{\frac{k}{\pi}}{2 \cdot n}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 3.60000000000000009Initial program 99.1%
Taylor expanded in k around 0 73.9%
associate-/l*73.9%
Simplified73.9%
pow173.9%
*-commutative73.9%
sqrt-unprod74.1%
Applied egg-rr74.1%
unpow174.1%
*-commutative74.1%
*-commutative74.1%
associate-*l*74.1%
Simplified74.1%
Taylor expanded in k around 0 74.0%
associate-*r/74.0%
*-commutative74.0%
associate-*l/74.0%
associate-/l*74.1%
associate-*l*74.1%
*-commutative74.1%
associate-*r/74.1%
*-commutative74.1%
associate-/l*74.1%
Simplified74.1%
associate-*r*74.1%
associate-*r/74.0%
*-commutative74.0%
associate-*r*74.0%
*-commutative74.0%
*-commutative74.0%
clear-num74.0%
inv-pow74.0%
sqrt-pow175.5%
associate-/r*75.5%
*-commutative75.5%
metadata-eval75.5%
Applied egg-rr75.5%
if 3.60000000000000009 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
pow12.6%
*-commutative2.6%
sqrt-unprod2.6%
Applied egg-rr2.6%
unpow12.6%
*-commutative2.6%
*-commutative2.6%
associate-*l*2.6%
Simplified2.6%
expm1-log1p-u2.6%
expm1-undefine24.5%
associate-*l/24.5%
associate-/l*24.5%
Applied egg-rr24.5%
sub-neg24.5%
metadata-eval24.5%
+-commutative24.5%
log1p-undefine24.5%
rem-exp-log24.5%
+-commutative24.5%
associate-*r/24.5%
*-rgt-identity24.5%
times-frac24.5%
/-rgt-identity24.5%
associate-*l*24.5%
*-commutative24.5%
associate-*l*24.5%
*-commutative24.5%
fma-define24.5%
associate-*r/24.5%
*-commutative24.5%
associate-/l*24.5%
Simplified24.5%
Taylor expanded in n around 0 48.2%
Final simplification61.1%
(FPCore (k n) :precision binary64 (if (<= k 3.15) (pow (* k (/ 0.5 (* PI n))) -0.5) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 3.15) {
tmp = pow((k * (0.5 / (((double) M_PI) * n))), -0.5);
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 3.15) {
tmp = Math.pow((k * (0.5 / (Math.PI * n))), -0.5);
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 3.15: tmp = math.pow((k * (0.5 / (math.pi * n))), -0.5) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 3.15) tmp = Float64(k * Float64(0.5 / Float64(pi * n))) ^ -0.5; else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 3.15) tmp = (k * (0.5 / (pi * n))) ^ -0.5; else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.15], N[Power[N[(k * N[(0.5 / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.15:\\
\;\;\;\;{\left(k \cdot \frac{0.5}{\pi \cdot n}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 3.14999999999999991Initial program 99.1%
Taylor expanded in k around 0 73.9%
associate-/l*73.9%
Simplified73.9%
pow173.9%
*-commutative73.9%
sqrt-unprod74.1%
Applied egg-rr74.1%
unpow174.1%
*-commutative74.1%
*-commutative74.1%
associate-*l*74.1%
Simplified74.1%
Taylor expanded in k around 0 74.0%
associate-*r/74.0%
*-commutative74.0%
associate-*l/74.0%
associate-/l*74.1%
associate-*l*74.1%
*-commutative74.1%
associate-*r/74.1%
*-commutative74.1%
associate-/l*74.1%
Simplified74.1%
associate-*r*74.1%
associate-*r/74.0%
*-commutative74.0%
associate-*r*74.0%
*-commutative74.0%
*-commutative74.0%
clear-num74.0%
inv-pow74.0%
sqrt-pow175.5%
associate-/r*75.5%
*-commutative75.5%
metadata-eval75.5%
Applied egg-rr75.5%
*-lft-identity75.5%
associate-*l/75.5%
associate-/r*75.5%
metadata-eval75.5%
times-frac75.5%
associate-*l/75.5%
*-commutative75.5%
Simplified75.5%
if 3.14999999999999991 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
pow12.6%
*-commutative2.6%
sqrt-unprod2.6%
Applied egg-rr2.6%
unpow12.6%
*-commutative2.6%
*-commutative2.6%
associate-*l*2.6%
Simplified2.6%
expm1-log1p-u2.6%
expm1-undefine24.5%
associate-*l/24.5%
associate-/l*24.5%
Applied egg-rr24.5%
sub-neg24.5%
metadata-eval24.5%
+-commutative24.5%
log1p-undefine24.5%
rem-exp-log24.5%
+-commutative24.5%
associate-*r/24.5%
*-rgt-identity24.5%
times-frac24.5%
/-rgt-identity24.5%
associate-*l*24.5%
*-commutative24.5%
associate-*l*24.5%
*-commutative24.5%
fma-define24.5%
associate-*r/24.5%
*-commutative24.5%
associate-/l*24.5%
Simplified24.5%
Taylor expanded in n around 0 48.2%
Final simplification61.1%
(FPCore (k n) :precision binary64 (if (<= k 3.15) (sqrt (* (/ PI k) (* 2.0 n))) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 3.15) {
tmp = sqrt(((((double) M_PI) / k) * (2.0 * n)));
} else {
tmp = sqrt(0.0);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 3.15) {
tmp = Math.sqrt(((Math.PI / k) * (2.0 * n)));
} else {
tmp = Math.sqrt(0.0);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 3.15: tmp = math.sqrt(((math.pi / k) * (2.0 * n))) else: tmp = math.sqrt(0.0) return tmp
function code(k, n) tmp = 0.0 if (k <= 3.15) tmp = sqrt(Float64(Float64(pi / k) * Float64(2.0 * n))); else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 3.15) tmp = sqrt(((pi / k) * (2.0 * n))); else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.15], N[Sqrt[N[(N[(Pi / k), $MachinePrecision] * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.15:\\
\;\;\;\;\sqrt{\frac{\pi}{k} \cdot \left(2 \cdot n\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 3.14999999999999991Initial program 99.1%
Taylor expanded in k around 0 73.9%
associate-/l*73.9%
Simplified73.9%
pow173.9%
*-commutative73.9%
sqrt-unprod74.1%
Applied egg-rr74.1%
unpow174.1%
*-commutative74.1%
*-commutative74.1%
associate-*l*74.1%
Simplified74.1%
if 3.14999999999999991 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
pow12.6%
*-commutative2.6%
sqrt-unprod2.6%
Applied egg-rr2.6%
unpow12.6%
*-commutative2.6%
*-commutative2.6%
associate-*l*2.6%
Simplified2.6%
expm1-log1p-u2.6%
expm1-undefine24.5%
associate-*l/24.5%
associate-/l*24.5%
Applied egg-rr24.5%
sub-neg24.5%
metadata-eval24.5%
+-commutative24.5%
log1p-undefine24.5%
rem-exp-log24.5%
+-commutative24.5%
associate-*r/24.5%
*-rgt-identity24.5%
times-frac24.5%
/-rgt-identity24.5%
associate-*l*24.5%
*-commutative24.5%
associate-*l*24.5%
*-commutative24.5%
fma-define24.5%
associate-*r/24.5%
*-commutative24.5%
associate-/l*24.5%
Simplified24.5%
Taylor expanded in n around 0 48.2%
Final simplification60.5%
(FPCore (k n) :precision binary64 (if (<= k 3.5) (sqrt (* n (* PI (/ 2.0 k)))) (sqrt 0.0)))
double code(double k, double n) {
double tmp;
if (k <= 3.5) {
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 <= 3.5) {
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 <= 3.5: 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 <= 3.5) tmp = sqrt(Float64(n * Float64(pi * Float64(2.0 / k)))); else tmp = sqrt(0.0); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 3.5) tmp = sqrt((n * (pi * (2.0 / k)))); else tmp = sqrt(0.0); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.5], N[Sqrt[N[(n * N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[0.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.5:\\
\;\;\;\;\sqrt{n \cdot \left(\pi \cdot \frac{2}{k}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0}\\
\end{array}
\end{array}
if k < 3.5Initial program 99.1%
Taylor expanded in k around 0 73.9%
associate-/l*73.9%
Simplified73.9%
pow173.9%
*-commutative73.9%
sqrt-unprod74.1%
Applied egg-rr74.1%
unpow174.1%
*-commutative74.1%
*-commutative74.1%
associate-*l*74.1%
Simplified74.1%
Taylor expanded in k around 0 74.0%
associate-*r/74.0%
*-commutative74.0%
associate-*l/74.0%
associate-/l*74.1%
associate-*l*74.1%
*-commutative74.1%
associate-*r/74.1%
*-commutative74.1%
associate-/l*74.1%
Simplified74.1%
if 3.5 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
pow12.6%
*-commutative2.6%
sqrt-unprod2.6%
Applied egg-rr2.6%
unpow12.6%
*-commutative2.6%
*-commutative2.6%
associate-*l*2.6%
Simplified2.6%
expm1-log1p-u2.6%
expm1-undefine24.5%
associate-*l/24.5%
associate-/l*24.5%
Applied egg-rr24.5%
sub-neg24.5%
metadata-eval24.5%
+-commutative24.5%
log1p-undefine24.5%
rem-exp-log24.5%
+-commutative24.5%
associate-*r/24.5%
*-rgt-identity24.5%
times-frac24.5%
/-rgt-identity24.5%
associate-*l*24.5%
*-commutative24.5%
associate-*l*24.5%
*-commutative24.5%
fma-define24.5%
associate-*r/24.5%
*-commutative24.5%
associate-/l*24.5%
Simplified24.5%
Taylor expanded in n around 0 48.2%
Final simplification60.5%
(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.6%
Taylor expanded in k around 0 36.3%
associate-/l*36.3%
Simplified36.3%
pow136.3%
*-commutative36.3%
sqrt-unprod36.4%
Applied egg-rr36.4%
unpow136.4%
*-commutative36.4%
*-commutative36.4%
associate-*l*36.4%
Simplified36.4%
expm1-log1p-u34.6%
expm1-undefine37.3%
associate-*l/37.3%
associate-/l*37.3%
Applied egg-rr37.3%
sub-neg37.3%
metadata-eval37.3%
+-commutative37.3%
log1p-undefine37.3%
rem-exp-log39.1%
+-commutative39.1%
associate-*r/39.1%
*-rgt-identity39.1%
times-frac39.1%
/-rgt-identity39.1%
associate-*l*39.1%
*-commutative39.1%
associate-*l*39.1%
*-commutative39.1%
fma-define39.1%
associate-*r/39.1%
*-commutative39.1%
associate-/l*39.1%
Simplified39.1%
Taylor expanded in n around 0 26.7%
Final simplification26.7%
herbie shell --seed 2024186
(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))))