
(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 10 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 (if (<= b 5e+89) (* (/ 0.5 a) (/ PI (* b (+ a b)))) (* (/ PI b) (/ 0.5 (* a (- b a))))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 5e+89) {
tmp = (0.5 / a) * (((double) M_PI) / (b * (a + b)));
} else {
tmp = (((double) M_PI) / b) * (0.5 / (a * (b - a)));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 5e+89) {
tmp = (0.5 / a) * (Math.PI / (b * (a + b)));
} else {
tmp = (Math.PI / b) * (0.5 / (a * (b - a)));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 5e+89: tmp = (0.5 / a) * (math.pi / (b * (a + b))) else: tmp = (math.pi / b) * (0.5 / (a * (b - a))) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 5e+89) tmp = Float64(Float64(0.5 / a) * Float64(pi / Float64(b * Float64(a + b)))); else tmp = Float64(Float64(pi / b) * Float64(0.5 / Float64(a * Float64(b - a)))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 5e+89)
tmp = (0.5 / a) * (pi / (b * (a + b)));
else
tmp = (pi / b) * (0.5 / (a * (b - a)));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[b, 5e+89], N[(N[(0.5 / a), $MachinePrecision] * N[(Pi / N[(b * N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] * N[(0.5 / N[(a * N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 5 \cdot 10^{+89}:\\
\;\;\;\;\frac{0.5}{a} \cdot \frac{\pi}{b \cdot \left(a + b\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot \frac{0.5}{a \cdot \left(b - a\right)}\\
\end{array}
\end{array}
if b < 4.99999999999999983e89Initial program 81.8%
*-commutative81.8%
associate-*r*81.8%
associate-*r/81.8%
associate-/l*81.8%
/-rgt-identity81.8%
associate-/l*81.8%
difference-of-squares89.6%
associate-/l*89.6%
associate-/l*99.5%
associate-*r/91.0%
sub-neg91.0%
distribute-neg-frac91.0%
metadata-eval91.0%
Simplified91.0%
Taylor expanded in a around 0 61.4%
Taylor expanded in b around inf 96.5%
expm1-log1p-u72.6%
expm1-udef51.1%
frac-times51.1%
*-un-lft-identity51.1%
times-frac51.1%
+-commutative51.1%
Applied egg-rr51.1%
expm1-def72.7%
expm1-log1p96.5%
associate-/l/95.9%
Simplified95.9%
if 4.99999999999999983e89 < b Initial program 51.6%
associate-*r/51.6%
*-rgt-identity51.6%
associate-*l/51.6%
difference-of-squares75.1%
*-commutative75.1%
times-frac99.8%
sub-neg99.8%
distribute-neg-frac99.8%
metadata-eval99.8%
Simplified99.8%
associate-*l/99.8%
div-inv99.8%
metadata-eval99.8%
Applied egg-rr99.8%
Taylor expanded in a around 0 99.8%
associate-/r*99.9%
Simplified99.9%
*-commutative99.9%
add-sqr-sqrt99.9%
sqrt-unprod75.2%
sqr-neg75.2%
sqrt-unprod0.0%
add-sqr-sqrt63.4%
associate-/r*63.4%
associate-*r/63.4%
associate-*l/63.4%
*-commutative63.4%
times-frac63.4%
add-sqr-sqrt0.0%
sqrt-unprod75.2%
sqr-neg75.2%
sqrt-unprod99.7%
add-sqr-sqrt99.8%
Applied egg-rr99.8%
associate-/l/99.8%
Simplified99.8%
Final simplification96.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (* (* PI 0.5) (/ (+ (/ 1.0 a) (/ -1.0 b)) (+ a b))) (- b a)))
assert(a < b);
double code(double a, double b) {
return ((((double) M_PI) * 0.5) * (((1.0 / a) + (-1.0 / b)) / (a + b))) / (b - a);
}
assert a < b;
public static double code(double a, double b) {
return ((Math.PI * 0.5) * (((1.0 / a) + (-1.0 / b)) / (a + b))) / (b - a);
}
[a, b] = sort([a, b]) def code(a, b): return ((math.pi * 0.5) * (((1.0 / a) + (-1.0 / b)) / (a + b))) / (b - a)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(pi * 0.5) * Float64(Float64(Float64(1.0 / a) + Float64(-1.0 / b)) / Float64(a + b))) / Float64(b - a)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = ((pi * 0.5) * (((1.0 / a) + (-1.0 / b)) / (a + b))) / (b - a);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(Pi * 0.5), $MachinePrecision] * N[(N[(N[(1.0 / a), $MachinePrecision] + N[(-1.0 / b), $MachinePrecision]), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\left(\pi \cdot 0.5\right) \cdot \frac{\frac{1}{a} + \frac{-1}{b}}{a + b}}{b - a}
\end{array}
Initial program 75.8%
associate-*r/75.8%
*-rgt-identity75.8%
associate-*l/75.8%
difference-of-squares86.7%
*-commutative86.7%
times-frac99.5%
sub-neg99.5%
distribute-neg-frac99.5%
metadata-eval99.5%
Simplified99.5%
associate-*l/99.6%
div-inv99.6%
metadata-eval99.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 (* (/ (+ (/ 1.0 a) (/ -1.0 b)) (+ a b)) (/ (/ PI 2.0) (- b a))))
assert(a < b);
double code(double a, double b) {
return (((1.0 / a) + (-1.0 / b)) / (a + b)) * ((((double) M_PI) / 2.0) / (b - a));
}
assert a < b;
public static double code(double a, double b) {
return (((1.0 / a) + (-1.0 / b)) / (a + b)) * ((Math.PI / 2.0) / (b - a));
}
[a, b] = sort([a, b]) def code(a, b): return (((1.0 / a) + (-1.0 / b)) / (a + b)) * ((math.pi / 2.0) / (b - a))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(Float64(1.0 / a) + Float64(-1.0 / b)) / Float64(a + b)) * Float64(Float64(pi / 2.0) / Float64(b - a))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (((1.0 / a) + (-1.0 / b)) / (a + b)) * ((pi / 2.0) / (b - a));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(N[(1.0 / a), $MachinePrecision] + N[(-1.0 / b), $MachinePrecision]), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision] * N[(N[(Pi / 2.0), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{1}{a} + \frac{-1}{b}}{a + b} \cdot \frac{\frac{\pi}{2}}{b - a}
\end{array}
Initial program 75.8%
associate-*r/75.8%
*-rgt-identity75.8%
associate-*l/75.8%
difference-of-squares86.7%
*-commutative86.7%
times-frac99.5%
sub-neg99.5%
distribute-neg-frac99.5%
metadata-eval99.5%
Simplified99.5%
Final simplification99.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 5e+102) (/ (/ 0.5 a) (/ (* a b) PI)) (* (/ PI (* a (- b))) (/ 0.5 b))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 5e+102) {
tmp = (0.5 / a) / ((a * b) / ((double) M_PI));
} else {
tmp = (((double) M_PI) / (a * -b)) * (0.5 / b);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 5e+102) {
tmp = (0.5 / a) / ((a * b) / Math.PI);
} else {
tmp = (Math.PI / (a * -b)) * (0.5 / b);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 5e+102: tmp = (0.5 / a) / ((a * b) / math.pi) else: tmp = (math.pi / (a * -b)) * (0.5 / b) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 5e+102) tmp = Float64(Float64(0.5 / a) / Float64(Float64(a * b) / pi)); else tmp = Float64(Float64(pi / Float64(a * Float64(-b))) * Float64(0.5 / b)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 5e+102)
tmp = (0.5 / a) / ((a * b) / pi);
else
tmp = (pi / (a * -b)) * (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[b, 5e+102], N[(N[(0.5 / a), $MachinePrecision] / N[(N[(a * b), $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / N[(a * (-b)), $MachinePrecision]), $MachinePrecision] * N[(0.5 / b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 5 \cdot 10^{+102}:\\
\;\;\;\;\frac{\frac{0.5}{a}}{\frac{a \cdot b}{\pi}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{a \cdot \left(-b\right)} \cdot \frac{0.5}{b}\\
\end{array}
\end{array}
if b < 5e102Initial program 81.8%
associate-*r/81.8%
*-rgt-identity81.8%
associate-*l/81.8%
difference-of-squares89.6%
*-commutative89.6%
times-frac99.5%
sub-neg99.5%
distribute-neg-frac99.5%
metadata-eval99.5%
Simplified99.5%
Taylor expanded in a around inf 67.0%
Taylor expanded in b around 0 65.1%
associate-*r/65.1%
Simplified65.1%
associate-/l*65.1%
associate-/r*65.1%
frac-times65.1%
Applied egg-rr65.1%
associate-*r/65.1%
metadata-eval65.1%
associate-*l/65.1%
associate-/l*65.1%
Simplified65.1%
Taylor expanded in a around 0 65.1%
if 5e102 < b Initial program 51.6%
associate-*r/51.6%
*-rgt-identity51.6%
associate-*l/51.6%
difference-of-squares75.1%
*-commutative75.1%
times-frac99.8%
sub-neg99.8%
distribute-neg-frac99.8%
metadata-eval99.8%
Simplified99.8%
Taylor expanded in a around inf 63.4%
*-commutative63.4%
frac-2neg63.4%
metadata-eval63.4%
frac-times63.4%
*-un-lft-identity63.4%
div-inv63.4%
metadata-eval63.4%
Applied egg-rr63.4%
times-frac63.4%
distribute-rgt-neg-in63.4%
Simplified63.4%
Taylor expanded in b around inf 63.4%
Final simplification64.8%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ 0.5 a) (/ PI (* b (+ a b)))))
assert(a < b);
double code(double a, double b) {
return (0.5 / a) * (((double) M_PI) / (b * (a + b)));
}
assert a < b;
public static double code(double a, double b) {
return (0.5 / a) * (Math.PI / (b * (a + b)));
}
[a, b] = sort([a, b]) def code(a, b): return (0.5 / a) * (math.pi / (b * (a + b)))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(0.5 / a) * Float64(pi / Float64(b * Float64(a + b)))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (0.5 / a) * (pi / (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 / a), $MachinePrecision] * N[(Pi / N[(b * N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{0.5}{a} \cdot \frac{\pi}{b \cdot \left(a + b\right)}
\end{array}
Initial program 75.8%
*-commutative75.8%
associate-*r*75.8%
associate-*r/75.8%
associate-/l*75.8%
/-rgt-identity75.8%
associate-/l*75.8%
difference-of-squares86.7%
associate-/l*86.8%
associate-/l*99.5%
associate-*r/88.2%
sub-neg88.2%
distribute-neg-frac88.2%
metadata-eval88.2%
Simplified88.2%
Taylor expanded in a around 0 64.5%
Taylor expanded in b around inf 92.6%
expm1-log1p-u72.7%
expm1-udef53.6%
frac-times53.6%
*-un-lft-identity53.6%
times-frac53.6%
+-commutative53.6%
Applied egg-rr53.6%
expm1-def72.7%
expm1-log1p92.6%
associate-/l/91.8%
Simplified91.8%
Final simplification91.8%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ PI (* (+ a b) (* 2.0 (* a b)))))
assert(a < b);
double code(double a, double b) {
return ((double) M_PI) / ((a + b) * (2.0 * (a * b)));
}
assert a < b;
public static double code(double a, double b) {
return Math.PI / ((a + b) * (2.0 * (a * b)));
}
[a, b] = sort([a, b]) def code(a, b): return math.pi / ((a + b) * (2.0 * (a * b)))
a, b = sort([a, b]) function code(a, b) return Float64(pi / Float64(Float64(a + b) * Float64(2.0 * Float64(a * b)))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = pi / ((a + b) * (2.0 * (a * b)));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(Pi / N[(N[(a + b), $MachinePrecision] * N[(2.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi}{\left(a + b\right) \cdot \left(2 \cdot \left(a \cdot b\right)\right)}
\end{array}
Initial program 75.8%
*-commutative75.8%
associate-*r*75.8%
associate-*r/75.8%
associate-/l*75.8%
/-rgt-identity75.8%
associate-/l*75.8%
difference-of-squares86.7%
associate-/l*86.8%
associate-/l*99.5%
associate-*r/88.2%
sub-neg88.2%
distribute-neg-frac88.2%
metadata-eval88.2%
Simplified88.2%
Taylor expanded in a around 0 64.5%
associate-*r/71.4%
associate-/l/71.4%
frac-times71.5%
*-un-lft-identity71.5%
+-commutative71.5%
Applied egg-rr71.5%
associate-/l/71.3%
*-commutative71.3%
Simplified71.3%
Taylor expanded in a around 0 99.2%
Final simplification99.2%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ -0.5 a) (/ (/ PI b) a)))
assert(a < b);
double code(double a, double b) {
return (-0.5 / a) * ((((double) M_PI) / b) / a);
}
assert a < b;
public static double code(double a, double b) {
return (-0.5 / a) * ((Math.PI / b) / a);
}
[a, b] = sort([a, b]) def code(a, b): return (-0.5 / a) * ((math.pi / b) / a)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(-0.5 / a) * Float64(Float64(pi / b) / a)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (-0.5 / a) * ((pi / b) / a);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(-0.5 / a), $MachinePrecision] * N[(N[(Pi / b), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{-0.5}{a} \cdot \frac{\frac{\pi}{b}}{a}
\end{array}
Initial program 75.8%
associate-*r/75.8%
*-rgt-identity75.8%
associate-*l/75.8%
difference-of-squares86.7%
*-commutative86.7%
times-frac99.5%
sub-neg99.5%
distribute-neg-frac99.5%
metadata-eval99.5%
Simplified99.5%
Taylor expanded in a around inf 66.3%
Taylor expanded in b around 0 61.5%
associate-*r/61.5%
Simplified61.5%
associate-/l*61.5%
frac-2neg61.5%
metadata-eval61.5%
distribute-rgt-neg-out61.5%
frac-times61.2%
metadata-eval61.2%
add-sqr-sqrt29.9%
sqrt-unprod49.3%
sqr-neg49.3%
sqrt-unprod18.9%
add-sqr-sqrt35.3%
Applied egg-rr35.3%
add-sqr-sqrt32.0%
sqrt-unprod45.5%
frac-times45.5%
metadata-eval45.5%
metadata-eval45.5%
*-commutative45.5%
associate-*r*45.5%
associate-/r/45.5%
*-commutative45.5%
associate-*r*45.5%
associate-/r/45.5%
frac-times45.5%
associate-/l/45.5%
associate-/l/45.5%
Applied egg-rr35.3%
Final simplification35.3%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ 0.5 a) (/ PI (* a b))))
assert(a < b);
double code(double a, double b) {
return (0.5 / a) * (((double) M_PI) / (a * b));
}
assert a < b;
public static double code(double a, double b) {
return (0.5 / a) * (Math.PI / (a * b));
}
[a, b] = sort([a, b]) def code(a, b): return (0.5 / a) * (math.pi / (a * b))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(0.5 / a) * Float64(pi / Float64(a * b))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (0.5 / a) * (pi / (a * b));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(0.5 / a), $MachinePrecision] * N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{0.5}{a} \cdot \frac{\pi}{a \cdot b}
\end{array}
Initial program 75.8%
*-commutative75.8%
associate-*r*75.8%
associate-*r/75.8%
associate-/l*75.8%
/-rgt-identity75.8%
associate-/l*75.8%
difference-of-squares86.7%
associate-/l*86.8%
associate-/l*99.5%
associate-*r/88.2%
sub-neg88.2%
distribute-neg-frac88.2%
metadata-eval88.2%
Simplified88.2%
Taylor expanded in a around 0 64.5%
Taylor expanded in b around inf 92.6%
expm1-log1p-u72.7%
expm1-udef53.6%
frac-times53.6%
*-un-lft-identity53.6%
times-frac53.6%
+-commutative53.6%
Applied egg-rr53.6%
expm1-def72.7%
expm1-log1p92.6%
associate-/l/91.8%
Simplified91.8%
Taylor expanded in a around inf 61.5%
Final simplification61.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (/ 0.5 a) (/ a (/ PI b))))
assert(a < b);
double code(double a, double b) {
return (0.5 / a) / (a / (((double) M_PI) / b));
}
assert a < b;
public static double code(double a, double b) {
return (0.5 / a) / (a / (Math.PI / b));
}
[a, b] = sort([a, b]) def code(a, b): return (0.5 / a) / (a / (math.pi / b))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(0.5 / a) / Float64(a / Float64(pi / b))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (0.5 / a) / (a / (pi / b));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(0.5 / a), $MachinePrecision] / N[(a / N[(Pi / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{0.5}{a}}{\frac{a}{\frac{\pi}{b}}}
\end{array}
Initial program 75.8%
associate-*r/75.8%
*-rgt-identity75.8%
associate-*l/75.8%
difference-of-squares86.7%
*-commutative86.7%
times-frac99.5%
sub-neg99.5%
distribute-neg-frac99.5%
metadata-eval99.5%
Simplified99.5%
Taylor expanded in a around inf 66.3%
Taylor expanded in b around 0 61.5%
associate-*r/61.5%
Simplified61.5%
associate-/l*61.5%
associate-/r*61.5%
frac-times61.5%
Applied egg-rr61.5%
associate-*r/61.5%
metadata-eval61.5%
associate-*l/61.5%
associate-/l*61.5%
Simplified61.5%
Final simplification61.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (/ 0.5 a) (/ (* a b) PI)))
assert(a < b);
double code(double a, double b) {
return (0.5 / a) / ((a * b) / ((double) M_PI));
}
assert a < b;
public static double code(double a, double b) {
return (0.5 / a) / ((a * b) / Math.PI);
}
[a, b] = sort([a, b]) def code(a, b): return (0.5 / a) / ((a * b) / math.pi)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(0.5 / a) / Float64(Float64(a * b) / pi)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (0.5 / a) / ((a * b) / pi);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(0.5 / a), $MachinePrecision] / N[(N[(a * b), $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{0.5}{a}}{\frac{a \cdot b}{\pi}}
\end{array}
Initial program 75.8%
associate-*r/75.8%
*-rgt-identity75.8%
associate-*l/75.8%
difference-of-squares86.7%
*-commutative86.7%
times-frac99.5%
sub-neg99.5%
distribute-neg-frac99.5%
metadata-eval99.5%
Simplified99.5%
Taylor expanded in a around inf 66.3%
Taylor expanded in b around 0 61.5%
associate-*r/61.5%
Simplified61.5%
associate-/l*61.5%
associate-/r*61.5%
frac-times61.5%
Applied egg-rr61.5%
associate-*r/61.5%
metadata-eval61.5%
associate-*l/61.5%
associate-/l*61.5%
Simplified61.5%
Taylor expanded in a around 0 61.5%
Final simplification61.5%
herbie shell --seed 2023333
(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))))