
(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 6 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 PI) n))) (/ (* 1.0 (sqrt t_0)) (* (sqrt k) (pow t_0 (* 0.5 k))))))
double code(double k, double n) {
double t_0 = (((double) M_PI) + ((double) M_PI)) * n;
return (1.0 * sqrt(t_0)) / (sqrt(k) * pow(t_0, (0.5 * k)));
}
public static double code(double k, double n) {
double t_0 = (Math.PI + Math.PI) * n;
return (1.0 * Math.sqrt(t_0)) / (Math.sqrt(k) * Math.pow(t_0, (0.5 * k)));
}
def code(k, n): t_0 = (math.pi + math.pi) * n return (1.0 * math.sqrt(t_0)) / (math.sqrt(k) * math.pow(t_0, (0.5 * k)))
function code(k, n) t_0 = Float64(Float64(pi + pi) * n) return Float64(Float64(1.0 * sqrt(t_0)) / Float64(sqrt(k) * (t_0 ^ Float64(0.5 * k)))) end
function tmp = code(k, n) t_0 = (pi + pi) * n; tmp = (1.0 * sqrt(t_0)) / (sqrt(k) * (t_0 ^ (0.5 * k))); end
code[k_, n_] := Block[{t$95$0 = N[(N[(Pi + Pi), $MachinePrecision] * n), $MachinePrecision]}, N[(N[(1.0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[k], $MachinePrecision] * N[Power[t$95$0, N[(0.5 * k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\pi + \pi\right) \cdot n\\
\frac{1 \cdot \sqrt{t\_0}}{\sqrt{k} \cdot {t\_0}^{\left(0.5 \cdot k\right)}}
\end{array}
\end{array}
Initial program 99.4%
lift-pow.f64N/A
lift-/.f64N/A
lift--.f64N/A
div-subN/A
metadata-evalN/A
pow-subN/A
lower-/.f64N/A
lower-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
count-2-revN/A
lower-+.f64N/A
lower-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
count-2-revN/A
lower-+.f64N/A
mult-flipN/A
metadata-evalN/A
lower-*.f6499.4
Applied rewrites99.4%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6499.5
Applied rewrites99.5%
(FPCore (k n) :precision binary64 (/ (* (sqrt 2.0) (sqrt (* n PI))) (* (sqrt k) (pow (* (+ PI PI) n) (* 0.5 k)))))
double code(double k, double n) {
return (sqrt(2.0) * sqrt((n * ((double) M_PI)))) / (sqrt(k) * pow(((((double) M_PI) + ((double) M_PI)) * n), (0.5 * k)));
}
public static double code(double k, double n) {
return (Math.sqrt(2.0) * Math.sqrt((n * Math.PI))) / (Math.sqrt(k) * Math.pow(((Math.PI + Math.PI) * n), (0.5 * k)));
}
def code(k, n): return (math.sqrt(2.0) * math.sqrt((n * math.pi))) / (math.sqrt(k) * math.pow(((math.pi + math.pi) * n), (0.5 * k)))
function code(k, n) return Float64(Float64(sqrt(2.0) * sqrt(Float64(n * pi))) / Float64(sqrt(k) * (Float64(Float64(pi + pi) * n) ^ Float64(0.5 * k)))) end
function tmp = code(k, n) tmp = (sqrt(2.0) * sqrt((n * pi))) / (sqrt(k) * (((pi + pi) * n) ^ (0.5 * k))); end
code[k_, n_] := N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(n * Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[k], $MachinePrecision] * N[Power[N[(N[(Pi + Pi), $MachinePrecision] * n), $MachinePrecision], N[(0.5 * k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{2} \cdot \sqrt{n \cdot \pi}}{\sqrt{k} \cdot {\left(\left(\pi + \pi\right) \cdot n\right)}^{\left(0.5 \cdot k\right)}}
\end{array}
Initial program 99.4%
lift-pow.f64N/A
lift-/.f64N/A
lift--.f64N/A
div-subN/A
metadata-evalN/A
pow-subN/A
lower-/.f64N/A
lower-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
count-2-revN/A
lower-+.f64N/A
lower-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
count-2-revN/A
lower-+.f64N/A
mult-flipN/A
metadata-evalN/A
lower-*.f6499.4
Applied rewrites99.4%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6499.5
Applied rewrites99.5%
lift-*.f64N/A
*-lft-identity99.5
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
count-2-revN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.5
Applied rewrites99.5%
(FPCore (k n) :precision binary64 (/ (pow (* n (+ PI PI)) (* 0.5 (- 1.0 k))) (sqrt k)))
double code(double k, double n) {
return pow((n * (((double) M_PI) + ((double) M_PI))), (0.5 * (1.0 - k))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((n * (Math.PI + Math.PI)), (0.5 * (1.0 - k))) / Math.sqrt(k);
}
def code(k, n): return math.pow((n * (math.pi + math.pi)), (0.5 * (1.0 - k))) / math.sqrt(k)
function code(k, n) return Float64((Float64(n * Float64(pi + pi)) ^ Float64(0.5 * Float64(1.0 - k))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((n * (pi + pi)) ^ (0.5 * (1.0 - k))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(n * N[(Pi + Pi), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(1.0 - k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(n \cdot \left(\pi + \pi\right)\right)}^{\left(0.5 \cdot \left(1 - k\right)\right)}}{\sqrt{k}}
\end{array}
Initial program 99.4%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6499.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.5
lift-*.f64N/A
count-2-revN/A
lower-+.f6499.5
lift-/.f64N/A
div-flipN/A
associate-/r/N/A
metadata-evalN/A
lower-*.f6499.5
Applied rewrites99.5%
(FPCore (k n) :precision binary64 (if (<= n 4.7e+30) (sqrt (* n (/ (+ PI PI) k))) (* n (sqrt (* 2.0 (/ PI (* k n)))))))
double code(double k, double n) {
double tmp;
if (n <= 4.7e+30) {
tmp = sqrt((n * ((((double) M_PI) + ((double) M_PI)) / k)));
} else {
tmp = n * sqrt((2.0 * (((double) M_PI) / (k * n))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (n <= 4.7e+30) {
tmp = Math.sqrt((n * ((Math.PI + Math.PI) / k)));
} else {
tmp = n * Math.sqrt((2.0 * (Math.PI / (k * n))));
}
return tmp;
}
def code(k, n): tmp = 0 if n <= 4.7e+30: tmp = math.sqrt((n * ((math.pi + math.pi) / k))) else: tmp = n * math.sqrt((2.0 * (math.pi / (k * n)))) return tmp
function code(k, n) tmp = 0.0 if (n <= 4.7e+30) tmp = sqrt(Float64(n * Float64(Float64(pi + pi) / k))); else tmp = Float64(n * sqrt(Float64(2.0 * Float64(pi / Float64(k * n))))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (n <= 4.7e+30) tmp = sqrt((n * ((pi + pi) / k))); else tmp = n * sqrt((2.0 * (pi / (k * n)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[n, 4.7e+30], N[Sqrt[N[(n * N[(N[(Pi + Pi), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(n * N[Sqrt[N[(2.0 * N[(Pi / N[(k * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq 4.7 \cdot 10^{+30}:\\
\;\;\;\;\sqrt{n \cdot \frac{\pi + \pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;n \cdot \sqrt{2 \cdot \frac{\pi}{k \cdot n}}\\
\end{array}
\end{array}
if n < 4.6999999999999999e30Initial program 99.4%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-pow.f64N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
unpow1/2N/A
lower-sqrt.f6449.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6438.4
Applied rewrites38.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6438.4
Applied rewrites38.4%
if 4.6999999999999999e30 < n Initial program 99.4%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-pow.f64N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
unpow1/2N/A
lower-sqrt.f6449.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6438.4
Applied rewrites38.4%
Taylor expanded in n around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
lower-*.f6449.5
Applied rewrites49.5%
(FPCore (k n) :precision binary64 (/ (sqrt (* (+ PI PI) n)) (sqrt k)))
double code(double k, double n) {
return sqrt(((((double) M_PI) + ((double) M_PI)) * n)) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt(((Math.PI + Math.PI) * n)) / Math.sqrt(k);
}
def code(k, n): return math.sqrt(((math.pi + math.pi) * n)) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(Float64(pi + pi) * n)) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt(((pi + pi) * n)) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(N[(Pi + Pi), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{\left(\pi + \pi\right) \cdot n}}{\sqrt{k}}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-pow.f64N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
unpow1/2N/A
lower-sqrt.f6449.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6449.5
Applied rewrites49.5%
(FPCore (k n) :precision binary64 (sqrt (* n (/ (+ PI PI) k))))
double code(double k, double n) {
return sqrt((n * ((((double) M_PI) + ((double) M_PI)) / k)));
}
public static double code(double k, double n) {
return Math.sqrt((n * ((Math.PI + Math.PI) / k)));
}
def code(k, n): return math.sqrt((n * ((math.pi + math.pi) / k)))
function code(k, n) return sqrt(Float64(n * Float64(Float64(pi + pi) / k))) end
function tmp = code(k, n) tmp = sqrt((n * ((pi + pi) / k))); end
code[k_, n_] := N[Sqrt[N[(n * N[(N[(Pi + Pi), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \frac{\pi + \pi}{k}}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-pow.f64N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
unpow1/2N/A
lower-sqrt.f6449.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6438.4
Applied rewrites38.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6438.4
Applied rewrites38.4%
herbie shell --seed 2025149
(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))))