
(FPCore (a b) :precision binary64 (* (* (/ PI 2.0) (/ 1.0 (- (* b b) (* a a)))) (- (/ 1.0 a) (/ 1.0 b))))
double code(double a, double b) {
return ((((double) M_PI) / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
public static double code(double a, double b) {
return ((Math.PI / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
def code(a, b): return ((math.pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b))
function code(a, b) return Float64(Float64(Float64(pi / 2.0) * Float64(1.0 / Float64(Float64(b * b) - Float64(a * a)))) * Float64(Float64(1.0 / a) - Float64(1.0 / b))) end
function tmp = code(a, b) tmp = ((pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b)); end
code[a_, b_] := N[(N[(N[(Pi / 2.0), $MachinePrecision] * N[(1.0 / N[(N[(b * b), $MachinePrecision] - N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / a), $MachinePrecision] - N[(1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\frac{\pi}{2} \cdot \frac{1}{b \cdot b - a \cdot a}\right) \cdot \left(\frac{1}{a} - \frac{1}{b}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (* (* (/ PI 2.0) (/ 1.0 (- (* b b) (* a a)))) (- (/ 1.0 a) (/ 1.0 b))))
double code(double a, double b) {
return ((((double) M_PI) / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
public static double code(double a, double b) {
return ((Math.PI / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
def code(a, b): return ((math.pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b))
function code(a, b) return Float64(Float64(Float64(pi / 2.0) * Float64(1.0 / Float64(Float64(b * b) - Float64(a * a)))) * Float64(Float64(1.0 / a) - Float64(1.0 / b))) end
function tmp = code(a, b) tmp = ((pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b)); end
code[a_, b_] := N[(N[(N[(Pi / 2.0), $MachinePrecision] * N[(1.0 / N[(N[(b * b), $MachinePrecision] - N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / a), $MachinePrecision] - N[(1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\frac{\pi}{2} \cdot \frac{1}{b \cdot b - a \cdot a}\right) \cdot \left(\frac{1}{a} - \frac{1}{b}\right)
\end{array}
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (/ (/ PI (/ a 0.5)) b) (+ a b)))
assert(a < b);
double code(double a, double b) {
return ((((double) M_PI) / (a / 0.5)) / b) / (a + b);
}
assert a < b;
public static double code(double a, double b) {
return ((Math.PI / (a / 0.5)) / b) / (a + b);
}
[a, b] = sort([a, b]) def code(a, b): return ((math.pi / (a / 0.5)) / b) / (a + b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(pi / Float64(a / 0.5)) / b) / Float64(a + b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = ((pi / (a / 0.5)) / b) / (a + b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(Pi / N[(a / 0.5), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{\frac{\pi}{\frac{a}{0.5}}}{b}}{a + b}
\end{array}
Initial program 79.7%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
difference-of-squaresN/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.6%
Taylor expanded in a around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6499.7%
Simplified99.7%
associate-*r/N/A
associate-/r*N/A
associate-*l/N/A
/-lowering-/.f64N/A
clear-numN/A
associate-*l/N/A
*-un-lft-identityN/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f6499.6%
Applied egg-rr99.6%
Final simplification99.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -4.4e-104) (/ (/ PI (* a b)) (/ a 0.5)) (* (/ (/ PI b) a) (/ 0.5 b))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -4.4e-104) {
tmp = (((double) M_PI) / (a * b)) / (a / 0.5);
} else {
tmp = ((((double) M_PI) / b) / a) * (0.5 / b);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -4.4e-104) {
tmp = (Math.PI / (a * b)) / (a / 0.5);
} else {
tmp = ((Math.PI / b) / a) * (0.5 / b);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -4.4e-104: tmp = (math.pi / (a * b)) / (a / 0.5) else: tmp = ((math.pi / b) / a) * (0.5 / b) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -4.4e-104) tmp = Float64(Float64(pi / Float64(a * b)) / Float64(a / 0.5)); else tmp = Float64(Float64(Float64(pi / b) / a) * Float64(0.5 / b)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -4.4e-104)
tmp = (pi / (a * b)) / (a / 0.5);
else
tmp = ((pi / b) / a) * (0.5 / b);
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -4.4e-104], N[(N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision] / N[(a / 0.5), $MachinePrecision]), $MachinePrecision], N[(N[(N[(Pi / b), $MachinePrecision] / a), $MachinePrecision] * N[(0.5 / b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -4.4 \cdot 10^{-104}:\\
\;\;\;\;\frac{\frac{\pi}{a \cdot b}}{\frac{a}{0.5}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{b}}{a} \cdot \frac{0.5}{b}\\
\end{array}
\end{array}
if a < -4.40000000000000023e-104Initial program 80.7%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6472.1%
Simplified72.1%
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-commutativeN/A
*-lowering-*.f6483.8%
Applied egg-rr83.8%
*-commutativeN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6483.9%
Applied egg-rr83.9%
if -4.40000000000000023e-104 < a Initial program 79.2%
Taylor expanded in b around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6460.3%
Simplified60.3%
associate-/l/N/A
*-commutativeN/A
times-fracN/A
associate-/r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6467.1%
Applied egg-rr67.1%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6467.1%
Applied egg-rr67.1%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -4.4e-104) (/ (/ 0.5 a) (* b (/ a PI))) (* (/ (/ PI b) a) (/ 0.5 b))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -4.4e-104) {
tmp = (0.5 / a) / (b * (a / ((double) M_PI)));
} else {
tmp = ((((double) M_PI) / b) / a) * (0.5 / b);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -4.4e-104) {
tmp = (0.5 / a) / (b * (a / Math.PI));
} else {
tmp = ((Math.PI / b) / a) * (0.5 / b);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -4.4e-104: tmp = (0.5 / a) / (b * (a / math.pi)) else: tmp = ((math.pi / b) / a) * (0.5 / b) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -4.4e-104) tmp = Float64(Float64(0.5 / a) / Float64(b * Float64(a / pi))); else tmp = Float64(Float64(Float64(pi / b) / a) * Float64(0.5 / b)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -4.4e-104)
tmp = (0.5 / a) / (b * (a / pi));
else
tmp = ((pi / b) / a) * (0.5 / b);
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -4.4e-104], N[(N[(0.5 / a), $MachinePrecision] / N[(b * N[(a / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(Pi / b), $MachinePrecision] / a), $MachinePrecision] * N[(0.5 / b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -4.4 \cdot 10^{-104}:\\
\;\;\;\;\frac{\frac{0.5}{a}}{b \cdot \frac{a}{\pi}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{b}}{a} \cdot \frac{0.5}{b}\\
\end{array}
\end{array}
if a < -4.40000000000000023e-104Initial program 80.7%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6472.1%
Simplified72.1%
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-commutativeN/A
*-lowering-*.f6483.8%
Applied egg-rr83.8%
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6483.9%
Applied egg-rr83.9%
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6483.9%
Applied egg-rr83.9%
if -4.40000000000000023e-104 < a Initial program 79.2%
Taylor expanded in b around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6460.3%
Simplified60.3%
associate-/l/N/A
*-commutativeN/A
times-fracN/A
associate-/r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6467.1%
Applied egg-rr67.1%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6467.1%
Applied egg-rr67.1%
Final simplification73.0%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -4.4e-104) (* (/ PI (* a b)) (/ 0.5 a)) (* (/ (/ PI b) a) (/ 0.5 b))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -4.4e-104) {
tmp = (((double) M_PI) / (a * b)) * (0.5 / a);
} else {
tmp = ((((double) M_PI) / b) / a) * (0.5 / b);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -4.4e-104) {
tmp = (Math.PI / (a * b)) * (0.5 / a);
} else {
tmp = ((Math.PI / b) / a) * (0.5 / b);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -4.4e-104: tmp = (math.pi / (a * b)) * (0.5 / a) else: tmp = ((math.pi / b) / a) * (0.5 / b) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -4.4e-104) tmp = Float64(Float64(pi / Float64(a * b)) * Float64(0.5 / a)); else tmp = Float64(Float64(Float64(pi / b) / a) * Float64(0.5 / b)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -4.4e-104)
tmp = (pi / (a * b)) * (0.5 / a);
else
tmp = ((pi / b) / a) * (0.5 / b);
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -4.4e-104], N[(N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(Pi / b), $MachinePrecision] / a), $MachinePrecision] * N[(0.5 / b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -4.4 \cdot 10^{-104}:\\
\;\;\;\;\frac{\pi}{a \cdot b} \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{b}}{a} \cdot \frac{0.5}{b}\\
\end{array}
\end{array}
if a < -4.40000000000000023e-104Initial program 80.7%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6472.1%
Simplified72.1%
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-commutativeN/A
*-lowering-*.f6483.8%
Applied egg-rr83.8%
if -4.40000000000000023e-104 < a Initial program 79.2%
Taylor expanded in b around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6460.3%
Simplified60.3%
associate-/l/N/A
*-commutativeN/A
times-fracN/A
associate-/r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6467.1%
Applied egg-rr67.1%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6467.1%
Applied egg-rr67.1%
Final simplification73.0%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (let* ((t_0 (/ PI (* a b)))) (if (<= a -1.2e-104) (* t_0 (/ 0.5 a)) (* t_0 (/ 0.5 b)))))
assert(a < b);
double code(double a, double b) {
double t_0 = ((double) M_PI) / (a * b);
double tmp;
if (a <= -1.2e-104) {
tmp = t_0 * (0.5 / a);
} else {
tmp = t_0 * (0.5 / b);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double t_0 = Math.PI / (a * b);
double tmp;
if (a <= -1.2e-104) {
tmp = t_0 * (0.5 / a);
} else {
tmp = t_0 * (0.5 / b);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): t_0 = math.pi / (a * b) tmp = 0 if a <= -1.2e-104: tmp = t_0 * (0.5 / a) else: tmp = t_0 * (0.5 / b) return tmp
a, b = sort([a, b]) function code(a, b) t_0 = Float64(pi / Float64(a * b)) tmp = 0.0 if (a <= -1.2e-104) tmp = Float64(t_0 * Float64(0.5 / a)); else tmp = Float64(t_0 * Float64(0.5 / b)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
t_0 = pi / (a * b);
tmp = 0.0;
if (a <= -1.2e-104)
tmp = t_0 * (0.5 / a);
else
tmp = t_0 * (0.5 / b);
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := Block[{t$95$0 = N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -1.2e-104], N[(t$95$0 * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(0.5 / b), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
t_0 := \frac{\pi}{a \cdot b}\\
\mathbf{if}\;a \leq -1.2 \cdot 10^{-104}:\\
\;\;\;\;t\_0 \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \frac{0.5}{b}\\
\end{array}
\end{array}
if a < -1.2e-104Initial program 80.7%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6472.1%
Simplified72.1%
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-commutativeN/A
*-lowering-*.f6483.8%
Applied egg-rr83.8%
if -1.2e-104 < a Initial program 79.2%
Taylor expanded in b around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6460.3%
Simplified60.3%
associate-/l/N/A
*-commutativeN/A
times-fracN/A
associate-/r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6467.1%
Applied egg-rr67.1%
Final simplification72.9%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (* 0.5 (/ PI (* a b))) (+ a b)))
assert(a < b);
double code(double a, double b) {
return (0.5 * (((double) M_PI) / (a * b))) / (a + b);
}
assert a < b;
public static double code(double a, double b) {
return (0.5 * (Math.PI / (a * b))) / (a + b);
}
[a, b] = sort([a, b]) def code(a, b): return (0.5 * (math.pi / (a * b))) / (a + b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(0.5 * Float64(pi / Float64(a * b))) / Float64(a + b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (0.5 * (pi / (a * b))) / (a + b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(0.5 * N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{0.5 \cdot \frac{\pi}{a \cdot b}}{a + b}
\end{array}
Initial program 79.7%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
difference-of-squaresN/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.6%
Taylor expanded in a around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6499.7%
Simplified99.7%
Final simplification99.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ 0.5 (* (+ a b) (/ a (/ PI b)))))
assert(a < b);
double code(double a, double b) {
return 0.5 / ((a + b) * (a / (((double) M_PI) / b)));
}
assert a < b;
public static double code(double a, double b) {
return 0.5 / ((a + b) * (a / (Math.PI / b)));
}
[a, b] = sort([a, b]) def code(a, b): return 0.5 / ((a + b) * (a / (math.pi / b)))
a, b = sort([a, b]) function code(a, b) return Float64(0.5 / Float64(Float64(a + b) * Float64(a / Float64(pi / b)))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = 0.5 / ((a + b) * (a / (pi / b)));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(0.5 / N[(N[(a + b), $MachinePrecision] * N[(a / N[(Pi / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{0.5}{\left(a + b\right) \cdot \frac{a}{\frac{\pi}{b}}}
\end{array}
Initial program 79.7%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
difference-of-squaresN/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.6%
Taylor expanded in a around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6499.7%
Simplified99.7%
associate-*r/N/A
associate-/r*N/A
associate-*l/N/A
/-lowering-/.f64N/A
clear-numN/A
associate-*l/N/A
*-un-lft-identityN/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f6499.6%
Applied egg-rr99.6%
associate-/r/N/A
associate-*l/N/A
associate-/r*N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6499.1%
Applied egg-rr99.1%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ PI (* a b)) (/ 0.5 a)))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) / (a * b)) * (0.5 / a);
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI / (a * b)) * (0.5 / a);
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi / (a * b)) * (0.5 / a)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi / Float64(a * b)) * Float64(0.5 / a)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi / (a * b)) * (0.5 / a);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi}{a \cdot b} \cdot \frac{0.5}{a}
\end{array}
Initial program 79.7%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6456.9%
Simplified56.9%
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-commutativeN/A
*-lowering-*.f6464.4%
Applied egg-rr64.4%
Final simplification64.4%
herbie shell --seed 2024161
(FPCore (a b)
:name "NMSE Section 6.1 mentioned, B"
:precision binary64
(* (* (/ PI 2.0) (/ 1.0 (- (* b b) (* a a)))) (- (/ 1.0 a) (/ 1.0 b))))