
(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 8 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 (* PI (* 2.0 n)))) (/ (sqrt t_0) (sqrt (* k (pow t_0 k))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
return sqrt(t_0) / sqrt((k * pow(t_0, k)));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
return Math.sqrt(t_0) / Math.sqrt((k * Math.pow(t_0, k)));
}
def code(k, n): t_0 = math.pi * (2.0 * n) return math.sqrt(t_0) / math.sqrt((k * math.pow(t_0, k)))
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) return Float64(sqrt(t_0) / sqrt(Float64(k * (t_0 ^ k)))) end
function tmp = code(k, n) t_0 = pi * (2.0 * n); tmp = sqrt(t_0) / sqrt((k * (t_0 ^ k))); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Sqrt[N[(k * N[Power[t$95$0, k], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(2 \cdot n\right)\\
\frac{\sqrt{t\_0}}{\sqrt{k \cdot {t\_0}^{k}}}
\end{array}
\end{array}
Initial program 99.6%
*-commutativeN/A
un-div-invN/A
div-subN/A
metadata-evalN/A
pow-subN/A
associate-/l/N/A
/-lowering-/.f64N/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
pow-lowering-pow.f64N/A
Applied egg-rr99.7%
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
associate-/r/N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
associate-/r/N/A
metadata-evalN/A
*-lowering-*.f64N/A
pow-unpowN/A
unpow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
Applied egg-rr99.7%
(FPCore (k n) :precision binary64 (if (<= k 1.0) (* (sqrt (/ PI k)) (sqrt (* 2.0 n))) (/ (pow (* PI (* 2.0 n)) (* k -0.5)) (sqrt k))))
double code(double k, double n) {
double tmp;
if (k <= 1.0) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
} else {
tmp = pow((((double) M_PI) * (2.0 * n)), (k * -0.5)) / sqrt(k);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.0) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
} else {
tmp = Math.pow((Math.PI * (2.0 * n)), (k * -0.5)) / Math.sqrt(k);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.0: tmp = math.sqrt((math.pi / k)) * math.sqrt((2.0 * n)) else: tmp = math.pow((math.pi * (2.0 * n)), (k * -0.5)) / math.sqrt(k) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.0) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))); else tmp = Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(k * -0.5)) / sqrt(k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.0) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); else tmp = ((pi * (2.0 * n)) ^ (k * -0.5)) / sqrt(k); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.0], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(k * -0.5), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(k \cdot -0.5\right)}}{\sqrt{k}}\\
\end{array}
\end{array}
if k < 1Initial program 99.2%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6475.3
Simplified75.3%
sqrt-unprodN/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
associate-/r/N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
associate-/r/N/A
metadata-evalN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6498.4
Applied egg-rr98.4%
sqrt-prodN/A
pow1/2N/A
associate-*l/N/A
sqrt-divN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6498.5
Applied egg-rr98.5%
if 1 < k Initial program 100.0%
Taylor expanded in k around inf
*-lowering-*.f64100.0
Simplified100.0%
*-commutativeN/A
un-div-invN/A
/-lowering-/.f64N/A
associate-*r*N/A
pow-lowering-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
associate-/r/N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
associate-/r/N/A
metadata-evalN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64100.0
Applied egg-rr100.0%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (fma k -0.5 0.5)) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), fma(k, -0.5, 0.5)) / sqrt(k);
}
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ fma(k, -0.5, 0.5)) / sqrt(k)) end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(k * -0.5 + 0.5), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(\mathsf{fma}\left(k, -0.5, 0.5\right)\right)}}{\sqrt{k}}
\end{array}
Initial program 99.6%
*-commutativeN/A
un-div-invN/A
div-subN/A
metadata-evalN/A
pow-subN/A
associate-/l/N/A
/-lowering-/.f64N/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
pow-lowering-pow.f64N/A
Applied egg-rr99.7%
*-commutativeN/A
associate-/r*N/A
Applied egg-rr99.6%
(FPCore (k n) :precision binary64 (if (<= k 0.5) (* (sqrt (/ PI k)) (sqrt (* 2.0 n))) (sqrt (sqrt (* (/ 1.0 k) (/ 1.0 k))))))
double code(double k, double n) {
double tmp;
if (k <= 0.5) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
} else {
tmp = sqrt(sqrt(((1.0 / k) * (1.0 / k))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 0.5) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
} else {
tmp = Math.sqrt(Math.sqrt(((1.0 / k) * (1.0 / k))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 0.5: tmp = math.sqrt((math.pi / k)) * math.sqrt((2.0 * n)) else: tmp = math.sqrt(math.sqrt(((1.0 / k) * (1.0 / k)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 0.5) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))); else tmp = sqrt(sqrt(Float64(Float64(1.0 / k) * Float64(1.0 / k)))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 0.5) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); else tmp = sqrt(sqrt(((1.0 / k) * (1.0 / k)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 0.5], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[Sqrt[N[(N[(1.0 / k), $MachinePrecision] * N[(1.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 0.5:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\sqrt{\frac{1}{k} \cdot \frac{1}{k}}}\\
\end{array}
\end{array}
if k < 0.5Initial program 99.2%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6475.3
Simplified75.3%
sqrt-unprodN/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
associate-/r/N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
associate-/r/N/A
metadata-evalN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6498.4
Applied egg-rr98.4%
sqrt-prodN/A
pow1/2N/A
associate-*l/N/A
sqrt-divN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6498.5
Applied egg-rr98.5%
if 0.5 < k Initial program 100.0%
Taylor expanded in k around inf
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in k around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f643.3
Simplified3.3%
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6429.2
Applied egg-rr29.2%
(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.6%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6439.8
Simplified39.8%
sqrt-unprodN/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
associate-/r/N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
associate-/r/N/A
metadata-evalN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6451.7
Applied egg-rr51.7%
sqrt-prodN/A
pow1/2N/A
associate-*l/N/A
sqrt-divN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6451.8
Applied egg-rr51.8%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (* 2.0 (/ PI k)))))
double code(double k, double n) {
return sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((2.0 * (math.pi / k)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}
\end{array}
Initial program 99.6%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6439.8
Simplified39.8%
sqrt-unprodN/A
associate-/l*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6451.8
Applied egg-rr51.8%
Final simplification51.8%
(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(Float64(pi * 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[(N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi \cdot \left(2 \cdot n\right)}{k}}
\end{array}
Initial program 99.6%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6439.8
Simplified39.8%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
associate-/r/N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
associate-/r/N/A
metadata-evalN/A
*-lowering-*.f6439.9
Applied egg-rr39.9%
(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.6%
Taylor expanded in k around inf
*-lowering-*.f6452.6
Simplified52.6%
Taylor expanded in k around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f645.4
Simplified5.4%
herbie shell --seed 2024201
(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))))