
(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.3%
lift-sqrt.f64N/A
frac-2negN/A
metadata-evalN/A
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
associate-*l/N/A
neg-mul-1N/A
frac-2negN/A
Applied egg-rr99.8%
(FPCore (k n) :precision binary64 (if (<= (* (/ 1.0 (sqrt k)) (pow (* n (* 2.0 PI)) (/ (- 1.0 k) 2.0))) 0.0) (pow (* k (* k (* k k))) -0.125) (/ (sqrt (* 2.0 (* PI n))) (sqrt k))))
double code(double k, double n) {
double tmp;
if (((1.0 / sqrt(k)) * pow((n * (2.0 * ((double) M_PI))), ((1.0 - k) / 2.0))) <= 0.0) {
tmp = pow((k * (k * (k * k))), -0.125);
} else {
tmp = sqrt((2.0 * (((double) M_PI) * n))) / sqrt(k);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (((1.0 / Math.sqrt(k)) * Math.pow((n * (2.0 * Math.PI)), ((1.0 - k) / 2.0))) <= 0.0) {
tmp = Math.pow((k * (k * (k * k))), -0.125);
} else {
tmp = Math.sqrt((2.0 * (Math.PI * n))) / Math.sqrt(k);
}
return tmp;
}
def code(k, n): tmp = 0 if ((1.0 / math.sqrt(k)) * math.pow((n * (2.0 * math.pi)), ((1.0 - k) / 2.0))) <= 0.0: tmp = math.pow((k * (k * (k * k))), -0.125) else: tmp = math.sqrt((2.0 * (math.pi * n))) / math.sqrt(k) return tmp
function code(k, n) tmp = 0.0 if (Float64(Float64(1.0 / sqrt(k)) * (Float64(n * Float64(2.0 * pi)) ^ Float64(Float64(1.0 - k) / 2.0))) <= 0.0) tmp = Float64(k * Float64(k * Float64(k * k))) ^ -0.125; else tmp = Float64(sqrt(Float64(2.0 * Float64(pi * n))) / sqrt(k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (((1.0 / sqrt(k)) * ((n * (2.0 * pi)) ^ ((1.0 - k) / 2.0))) <= 0.0) tmp = (k * (k * (k * k))) ^ -0.125; else tmp = sqrt((2.0 * (pi * n))) / sqrt(k); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.0], N[Power[N[(k * N[(k * N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.125], $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{1}{\sqrt{k}} \cdot {\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(\frac{1 - k}{2}\right)} \leq 0:\\
\;\;\;\;{\left(k \cdot \left(k \cdot \left(k \cdot k\right)\right)\right)}^{-0.125}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\pi \cdot n\right)}}{\sqrt{k}}\\
\end{array}
\end{array}
if (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) < 0.0Initial program 100.0%
Taylor expanded in k around inf
lower-*.f64100.0
Simplified100.0%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f643.9
Simplified3.9%
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lower-/.f643.9
Applied egg-rr3.9%
pow1/2N/A
pow-flipN/A
metadata-evalN/A
sqr-powN/A
pow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-sqrN/A
pow-prod-downN/A
lower-pow.f64N/A
associate-*l*N/A
cube-multN/A
lower-*.f64N/A
cube-multN/A
lower-*.f64N/A
lower-*.f64N/A
metadata-eval80.7
Applied egg-rr80.7%
if 0.0 < (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) Initial program 99.1%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6450.4
Simplified50.4%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6466.8
Applied egg-rr66.8%
Final simplification69.8%
(FPCore (k n) :precision binary64 (let* ((t_0 (* 2.0 (* PI n)))) (if (<= k 1.2) (/ (sqrt t_0) (sqrt k)) (/ 1.0 (sqrt (* k (pow t_0 k)))))))
double code(double k, double n) {
double t_0 = 2.0 * (((double) M_PI) * n);
double tmp;
if (k <= 1.2) {
tmp = sqrt(t_0) / sqrt(k);
} else {
tmp = 1.0 / sqrt((k * pow(t_0, k)));
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = 2.0 * (Math.PI * n);
double tmp;
if (k <= 1.2) {
tmp = Math.sqrt(t_0) / Math.sqrt(k);
} else {
tmp = 1.0 / Math.sqrt((k * Math.pow(t_0, k)));
}
return tmp;
}
def code(k, n): t_0 = 2.0 * (math.pi * n) tmp = 0 if k <= 1.2: tmp = math.sqrt(t_0) / math.sqrt(k) else: tmp = 1.0 / math.sqrt((k * math.pow(t_0, k))) return tmp
function code(k, n) t_0 = Float64(2.0 * Float64(pi * n)) tmp = 0.0 if (k <= 1.2) tmp = Float64(sqrt(t_0) / sqrt(k)); else tmp = Float64(1.0 / sqrt(Float64(k * (t_0 ^ k)))); end return tmp end
function tmp_2 = code(k, n) t_0 = 2.0 * (pi * n); tmp = 0.0; if (k <= 1.2) tmp = sqrt(t_0) / sqrt(k); else tmp = 1.0 / sqrt((k * (t_0 ^ k))); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.2], N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sqrt[N[(k * N[Power[t$95$0, k], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 2 \cdot \left(\pi \cdot n\right)\\
\mathbf{if}\;k \leq 1.2:\\
\;\;\;\;\frac{\sqrt{t\_0}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{k \cdot {t\_0}^{k}}}\\
\end{array}
\end{array}
if k < 1.19999999999999996Initial program 98.7%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6471.9
Simplified71.9%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6495.5
Applied egg-rr95.5%
if 1.19999999999999996 < k Initial program 100.0%
Taylor expanded in k around inf
lower-*.f6498.4
Simplified98.4%
lift-sqrt.f64N/A
inv-powN/A
lift-PI.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
pow-unpowN/A
metadata-evalN/A
pow-powN/A
pow-unpowN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-prod-downN/A
lift-*.f64N/A
inv-powN/A
lower-/.f6498.4
Applied egg-rr98.4%
(FPCore (k n) :precision binary64 (/ (pow (* 2.0 (* PI n)) (fma k -0.5 0.5)) (sqrt k)))
double code(double k, double n) {
return pow((2.0 * (((double) M_PI) * n)), fma(k, -0.5, 0.5)) / sqrt(k);
}
function code(k, n) return Float64((Float64(2.0 * Float64(pi * n)) ^ fma(k, -0.5, 0.5)) / sqrt(k)) end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(k * -0.5 + 0.5), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(\mathsf{fma}\left(k, -0.5, 0.5\right)\right)}}{\sqrt{k}}
\end{array}
Initial program 99.3%
lift-sqrt.f64N/A
frac-2negN/A
metadata-evalN/A
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
associate-*l/N/A
neg-mul-1N/A
frac-2negN/A
Applied egg-rr99.8%
Applied egg-rr99.4%
(FPCore (k n) :precision binary64 (if (<= k 0.5) (/ (sqrt (* 2.0 (* PI n))) (sqrt k)) (sqrt (/ 1.0 (sqrt (* k k))))))
double code(double k, double n) {
double tmp;
if (k <= 0.5) {
tmp = sqrt((2.0 * (((double) M_PI) * n))) / sqrt(k);
} else {
tmp = sqrt((1.0 / sqrt((k * k))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 0.5) {
tmp = Math.sqrt((2.0 * (Math.PI * n))) / Math.sqrt(k);
} else {
tmp = Math.sqrt((1.0 / Math.sqrt((k * k))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 0.5: tmp = math.sqrt((2.0 * (math.pi * n))) / math.sqrt(k) else: tmp = math.sqrt((1.0 / math.sqrt((k * k)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 0.5) tmp = Float64(sqrt(Float64(2.0 * Float64(pi * n))) / sqrt(k)); else tmp = sqrt(Float64(1.0 / sqrt(Float64(k * k)))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 0.5) tmp = sqrt((2.0 * (pi * n))) / sqrt(k); else tmp = sqrt((1.0 / sqrt((k * k)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 0.5], N[(N[Sqrt[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(1.0 / N[Sqrt[N[(k * k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 0.5:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\pi \cdot n\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{\sqrt{k \cdot k}}}\\
\end{array}
\end{array}
if k < 0.5Initial program 98.7%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6472.3
Simplified72.3%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6496.2
Applied egg-rr96.2%
if 0.5 < k Initial program 100.0%
Taylor expanded in k around inf
lower-*.f6497.6
Simplified97.6%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f643.3
Simplified3.3%
lift-/.f643.3
rem-square-sqrtN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
frac-timesN/A
metadata-evalN/A
lower-/.f64N/A
lower-*.f643.3
Applied egg-rr3.3%
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f6429.1
Applied egg-rr29.1%
(FPCore (k n) :precision binary64 (if (<= k 0.5) (* (sqrt n) (sqrt (* 2.0 (/ PI k)))) (sqrt (/ 1.0 (sqrt (* k k))))))
double code(double k, double n) {
double tmp;
if (k <= 0.5) {
tmp = sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
} else {
tmp = sqrt((1.0 / sqrt((k * k))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 0.5) {
tmp = Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
} else {
tmp = Math.sqrt((1.0 / Math.sqrt((k * k))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 0.5: tmp = math.sqrt(n) * math.sqrt((2.0 * (math.pi / k))) else: tmp = math.sqrt((1.0 / math.sqrt((k * k)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 0.5) tmp = Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))); else tmp = sqrt(Float64(1.0 / sqrt(Float64(k * k)))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 0.5) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); else tmp = sqrt((1.0 / sqrt((k * k)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 0.5], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(1.0 / N[Sqrt[N[(k * k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 0.5:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{\sqrt{k \cdot k}}}\\
\end{array}
\end{array}
if k < 0.5Initial program 98.7%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6472.3
Simplified72.3%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6496.1
Applied egg-rr96.1%
if 0.5 < k Initial program 100.0%
Taylor expanded in k around inf
lower-*.f6497.6
Simplified97.6%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f643.3
Simplified3.3%
lift-/.f643.3
rem-square-sqrtN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
frac-timesN/A
metadata-evalN/A
lower-/.f64N/A
lower-*.f643.3
Applied egg-rr3.3%
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f6429.1
Applied egg-rr29.1%
Final simplification65.2%
(FPCore (k n) :precision binary64 (if (<= k 0.5) (sqrt (/ (* 2.0 (* PI n)) k)) (sqrt (/ 1.0 (sqrt (* k k))))))
double code(double k, double n) {
double tmp;
if (k <= 0.5) {
tmp = sqrt(((2.0 * (((double) M_PI) * n)) / k));
} else {
tmp = sqrt((1.0 / sqrt((k * k))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 0.5) {
tmp = Math.sqrt(((2.0 * (Math.PI * n)) / k));
} else {
tmp = Math.sqrt((1.0 / Math.sqrt((k * k))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 0.5: tmp = math.sqrt(((2.0 * (math.pi * n)) / k)) else: tmp = math.sqrt((1.0 / math.sqrt((k * k)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 0.5) tmp = sqrt(Float64(Float64(2.0 * Float64(pi * n)) / k)); else tmp = sqrt(Float64(1.0 / sqrt(Float64(k * k)))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 0.5) tmp = sqrt(((2.0 * (pi * n)) / k)); else tmp = sqrt((1.0 / sqrt((k * k)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 0.5], N[Sqrt[N[(N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(1.0 / N[Sqrt[N[(k * k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 0.5:\\
\;\;\;\;\sqrt{\frac{2 \cdot \left(\pi \cdot n\right)}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{\sqrt{k \cdot k}}}\\
\end{array}
\end{array}
if k < 0.5Initial program 98.7%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6472.3
Simplified72.3%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f6472.5
Applied egg-rr72.5%
if 0.5 < k Initial program 100.0%
Taylor expanded in k around inf
lower-*.f6497.6
Simplified97.6%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f643.3
Simplified3.3%
lift-/.f643.3
rem-square-sqrtN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
frac-timesN/A
metadata-evalN/A
lower-/.f64N/A
lower-*.f643.3
Applied egg-rr3.3%
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f6429.1
Applied egg-rr29.1%
(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.3%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6440.2
Simplified40.2%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f6440.3
Applied egg-rr40.3%
(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(Float64(2.0 * n) / k))) end
function tmp = code(k, n) tmp = sqrt((pi * ((2.0 * n) / k))); end
code[k_, n_] := N[Sqrt[N[(Pi * N[(N[(2.0 * n), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \frac{2 \cdot n}{k}}
\end{array}
Initial program 99.3%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6440.2
Simplified40.2%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6453.1
Applied egg-rr53.1%
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-undivN/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
associate-*r/N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
associate-*r*N/A
Applied egg-rr40.3%
Final simplification40.3%
(FPCore (k n) :precision binary64 (sqrt (/ 1.0 k)))
double code(double k, double n) {
return sqrt((1.0 / k));
}
real(8) function code(k, n)
real(8), intent (in) :: k
real(8), intent (in) :: n
code = sqrt((1.0d0 / k))
end function
public static double code(double k, double n) {
return Math.sqrt((1.0 / k));
}
def code(k, n): return math.sqrt((1.0 / k))
function code(k, n) return sqrt(Float64(1.0 / k)) end
function tmp = code(k, n) tmp = sqrt((1.0 / k)); end
code[k_, n_] := N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{1}{k}}
\end{array}
Initial program 99.3%
Taylor expanded in k around inf
lower-*.f6448.9
Simplified48.9%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f645.5
Simplified5.5%
herbie shell --seed 2024208
(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))))