
(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}
Herbie found 5 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 (* (+ PI PI) n) (fma -0.5 k 0.5)) (sqrt k)))
double code(double k, double n) {
return pow(((((double) M_PI) + ((double) M_PI)) * n), fma(-0.5, k, 0.5)) / sqrt(k);
}
function code(k, n) return Float64((Float64(Float64(pi + pi) * n) ^ fma(-0.5, k, 0.5)) / sqrt(k)) end
code[k_, n_] := N[(N[Power[N[(N[(Pi + Pi), $MachinePrecision] * n), $MachinePrecision], N[(-0.5 * k + 0.5), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\left(\pi + \pi\right) \cdot n\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
+-commutativeN/A
lower-fma.f6499.5
Applied rewrites99.5%
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-PI.f64N/A
lift-sqrt.f6499.5
Applied rewrites99.5%
lift-*.f64N/A
*-lft-identity99.5
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f6499.5
Applied rewrites99.5%
lift-PI.f64N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
lower-+.f64N/A
lift-PI.f64N/A
lift-PI.f6499.5
Applied rewrites99.5%
(FPCore (k n) :precision binary64 (/ (sqrt (* (* 2.0 n) PI)) (sqrt k)))
double code(double k, double n) {
return sqrt(((2.0 * n) * ((double) M_PI))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt(((2.0 * n) * Math.PI)) / Math.sqrt(k);
}
def code(k, n): return math.sqrt(((2.0 * n) * math.pi)) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(Float64(2.0 * n) * pi)) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt(((2.0 * n) * pi)) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{\left(2 \cdot n\right) \cdot \pi}}{\sqrt{k}}
\end{array}
Initial program 99.5%
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites99.5%
Taylor expanded in k around 0
*-lft-identityN/A
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
sqr-powN/A
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
sqrt-unprodN/A
*-commutativeN/A
*-commutativeN/A
Applied rewrites48.8%
(FPCore (k n) :precision binary64 (sqrt (* (/ (* PI n) k) 2.0)))
double code(double k, double n) {
return sqrt((((((double) M_PI) * n) / k) * 2.0));
}
public static double code(double k, double n) {
return Math.sqrt((((Math.PI * n) / k) * 2.0));
}
def code(k, n): return math.sqrt((((math.pi * n) / k) * 2.0))
function code(k, n) return sqrt(Float64(Float64(Float64(pi * n) / k) * 2.0)) end
function tmp = code(k, n) tmp = sqrt((((pi * n) / k) * 2.0)); end
code[k_, n_] := N[Sqrt[N[(N[(N[(Pi * n), $MachinePrecision] / k), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi \cdot n}{k} \cdot 2}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-PI.f6437.7
Applied rewrites37.7%
(FPCore (k n) :precision binary64 (sqrt (* (* PI (/ n k)) 2.0)))
double code(double k, double n) {
return sqrt(((((double) M_PI) * (n / k)) * 2.0));
}
public static double code(double k, double n) {
return Math.sqrt(((Math.PI * (n / k)) * 2.0));
}
def code(k, n): return math.sqrt(((math.pi * (n / k)) * 2.0))
function code(k, n) return sqrt(Float64(Float64(pi * Float64(n / k)) * 2.0)) end
function tmp = code(k, n) tmp = sqrt(((pi * (n / k)) * 2.0)); end
code[k_, n_] := N[Sqrt[N[(N[(Pi * N[(n / k), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\pi \cdot \frac{n}{k}\right) \cdot 2}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-PI.f6437.7
Applied rewrites37.7%
lift-/.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lift-PI.f64N/A
lower-/.f6437.7
Applied rewrites37.7%
(FPCore (k n) :precision binary64 (sqrt (* (* n (/ PI k)) 2.0)))
double code(double k, double n) {
return sqrt(((n * (((double) M_PI) / k)) * 2.0));
}
public static double code(double k, double n) {
return Math.sqrt(((n * (Math.PI / k)) * 2.0));
}
def code(k, n): return math.sqrt(((n * (math.pi / k)) * 2.0))
function code(k, n) return sqrt(Float64(Float64(n * Float64(pi / k)) * 2.0)) end
function tmp = code(k, n) tmp = sqrt(((n * (pi / k)) * 2.0)); end
code[k_, n_] := N[Sqrt[N[(N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(n \cdot \frac{\pi}{k}\right) \cdot 2}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-PI.f6437.7
Applied rewrites37.7%
lift-/.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f6437.7
Applied rewrites37.7%
herbie shell --seed 2025091
(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))))