
(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 5 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 (<= a -2.5e+138) (/ (* -0.5 (/ (/ PI a) b)) (- b a)) (* (/ PI b) (/ (/ 0.5 a) (+ a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2.5e+138) {
tmp = (-0.5 * ((((double) M_PI) / a) / b)) / (b - a);
} else {
tmp = (((double) M_PI) / b) * ((0.5 / a) / (a + b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -2.5e+138) {
tmp = (-0.5 * ((Math.PI / a) / b)) / (b - a);
} else {
tmp = (Math.PI / b) * ((0.5 / a) / (a + b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2.5e+138: tmp = (-0.5 * ((math.pi / a) / b)) / (b - a) else: tmp = (math.pi / b) * ((0.5 / a) / (a + b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2.5e+138) tmp = Float64(Float64(-0.5 * Float64(Float64(pi / a) / b)) / Float64(b - a)); else tmp = Float64(Float64(pi / b) * Float64(Float64(0.5 / a) / Float64(a + b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -2.5e+138)
tmp = (-0.5 * ((pi / a) / b)) / (b - a);
else
tmp = (pi / b) * ((0.5 / a) / (a + 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, -2.5e+138], N[(N[(-0.5 * N[(N[(Pi / a), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] * N[(N[(0.5 / a), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2.5 \cdot 10^{+138}:\\
\;\;\;\;\frac{-0.5 \cdot \frac{\frac{\pi}{a}}{b}}{b - a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot \frac{\frac{0.5}{a}}{a + b}\\
\end{array}
\end{array}
if a < -2.50000000000000008e138Initial program 59.9%
un-div-inv59.8%
difference-of-squares84.8%
associate-/r*84.9%
div-inv84.9%
metadata-eval84.9%
Applied egg-rr84.9%
Taylor expanded in a around inf 84.9%
associate-*l/99.9%
+-commutative99.9%
associate-*r/100.0%
Applied egg-rr100.0%
Taylor expanded in a around inf 100.0%
associate-/r*100.0%
Simplified100.0%
if -2.50000000000000008e138 < a Initial program 81.2%
un-div-inv81.2%
difference-of-squares89.4%
associate-/r*90.1%
div-inv90.1%
metadata-eval90.1%
Applied egg-rr90.1%
associate-*l/99.5%
associate-/l*99.5%
Applied egg-rr99.5%
associate-/l*99.6%
+-commutative99.6%
sub-neg99.6%
distribute-neg-frac99.6%
metadata-eval99.6%
Simplified99.6%
Taylor expanded in a around 0 99.6%
un-div-inv99.6%
Applied egg-rr99.6%
associate-*r/99.6%
associate-/r*99.2%
*-commutative99.2%
associate-/r*99.6%
associate-/r*99.6%
associate-*r/99.6%
associate-*l/99.6%
associate-/l*97.5%
Simplified97.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -8e+146) (* (* PI (/ 0.5 a)) (/ 1.0 (* a b))) (* (/ PI b) (/ (/ 0.5 a) (+ a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -8e+146) {
tmp = (((double) M_PI) * (0.5 / a)) * (1.0 / (a * b));
} else {
tmp = (((double) M_PI) / b) * ((0.5 / a) / (a + b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -8e+146) {
tmp = (Math.PI * (0.5 / a)) * (1.0 / (a * b));
} else {
tmp = (Math.PI / b) * ((0.5 / a) / (a + b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -8e+146: tmp = (math.pi * (0.5 / a)) * (1.0 / (a * b)) else: tmp = (math.pi / b) * ((0.5 / a) / (a + b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -8e+146) tmp = Float64(Float64(pi * Float64(0.5 / a)) * Float64(1.0 / Float64(a * b))); else tmp = Float64(Float64(pi / b) * Float64(Float64(0.5 / a) / Float64(a + b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -8e+146)
tmp = (pi * (0.5 / a)) * (1.0 / (a * b));
else
tmp = (pi / b) * ((0.5 / a) / (a + 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, -8e+146], N[(N[(Pi * N[(0.5 / a), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] * N[(N[(0.5 / a), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -8 \cdot 10^{+146}:\\
\;\;\;\;\left(\pi \cdot \frac{0.5}{a}\right) \cdot \frac{1}{a \cdot b}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot \frac{\frac{0.5}{a}}{a + b}\\
\end{array}
\end{array}
if a < -7.99999999999999947e146Initial program 57.5%
un-div-inv57.5%
difference-of-squares84.0%
associate-/r*84.0%
div-inv84.0%
metadata-eval84.0%
Applied egg-rr84.0%
associate-*l/99.9%
associate-/l*100.0%
Applied egg-rr100.0%
associate-/l*99.9%
+-commutative99.9%
sub-neg99.9%
distribute-neg-frac99.9%
metadata-eval99.9%
Simplified99.9%
Taylor expanded in a around 0 99.9%
Taylor expanded in a around inf 99.9%
if -7.99999999999999947e146 < a Initial program 81.3%
un-div-inv81.4%
difference-of-squares89.5%
associate-/r*90.1%
div-inv90.1%
metadata-eval90.1%
Applied egg-rr90.1%
associate-*l/99.5%
associate-/l*99.5%
Applied egg-rr99.5%
associate-/l*99.6%
+-commutative99.6%
sub-neg99.6%
distribute-neg-frac99.6%
metadata-eval99.6%
Simplified99.6%
Taylor expanded in a around 0 99.6%
un-div-inv99.6%
Applied egg-rr99.6%
associate-*r/99.6%
associate-/r*99.2%
*-commutative99.2%
associate-/r*99.6%
associate-/r*99.6%
associate-*r/99.6%
associate-*l/99.6%
associate-/l*97.5%
Simplified97.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (* PI (/ 0.5 (+ a b))) (* a b)))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) * (0.5 / (a + b))) / (a * b);
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI * (0.5 / (a + b))) / (a * b);
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi * (0.5 / (a + b))) / (a * b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi * Float64(0.5 / Float64(a + b))) / Float64(a * b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi * (0.5 / (a + b))) / (a * b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(Pi * N[(0.5 / N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi \cdot \frac{0.5}{a + b}}{a \cdot b}
\end{array}
Initial program 78.2%
un-div-inv78.2%
difference-of-squares88.7%
associate-/r*89.3%
div-inv89.3%
metadata-eval89.3%
Applied egg-rr89.3%
associate-*l/99.5%
associate-/l*99.5%
Applied egg-rr99.5%
associate-/l*99.6%
+-commutative99.6%
sub-neg99.6%
distribute-neg-frac99.6%
metadata-eval99.6%
Simplified99.6%
Taylor expanded in a around 0 99.6%
un-div-inv99.7%
Applied egg-rr99.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (* PI 0.5) (* (+ a b) (* a b))))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) * 0.5) / ((a + b) * (a * b));
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI * 0.5) / ((a + b) * (a * b));
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi * 0.5) / ((a + b) * (a * b))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi * 0.5) / Float64(Float64(a + b) * Float64(a * b))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi * 0.5) / ((a + b) * (a * b));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(Pi * 0.5), $MachinePrecision] / N[(N[(a + b), $MachinePrecision] * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi \cdot 0.5}{\left(a + b\right) \cdot \left(a \cdot b\right)}
\end{array}
Initial program 78.2%
*-commutative78.2%
associate-*r*78.2%
associate-*r/78.3%
associate-*r*78.3%
*-rgt-identity78.3%
sub-neg78.3%
distribute-neg-frac78.3%
metadata-eval78.3%
Simplified78.3%
*-un-lft-identity78.3%
difference-of-squares88.8%
times-frac99.5%
Applied egg-rr68.6%
Taylor expanded in a around 0 99.6%
associate-*r/99.6%
*-commutative99.6%
*-commutative99.6%
times-frac99.5%
Simplified99.5%
frac-times99.6%
metadata-eval99.6%
div-inv99.6%
*-commutative99.6%
frac-times99.0%
*-un-lft-identity99.0%
div-inv99.0%
metadata-eval99.0%
+-commutative99.0%
Applied egg-rr99.0%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (* PI (/ 0.5 a)) (/ 1.0 (* a b))))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) * (0.5 / a)) * (1.0 / (a * b));
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI * (0.5 / a)) * (1.0 / (a * b));
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi * (0.5 / a)) * (1.0 / (a * b))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi * Float64(0.5 / a)) * Float64(1.0 / Float64(a * b))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi * (0.5 / a)) * (1.0 / (a * b));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(Pi * N[(0.5 / a), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\left(\pi \cdot \frac{0.5}{a}\right) \cdot \frac{1}{a \cdot b}
\end{array}
Initial program 78.2%
un-div-inv78.2%
difference-of-squares88.7%
associate-/r*89.3%
div-inv89.3%
metadata-eval89.3%
Applied egg-rr89.3%
associate-*l/99.5%
associate-/l*99.5%
Applied egg-rr99.5%
associate-/l*99.6%
+-commutative99.6%
sub-neg99.6%
distribute-neg-frac99.6%
metadata-eval99.6%
Simplified99.6%
Taylor expanded in a around 0 99.6%
Taylor expanded in a around inf 64.4%
herbie shell --seed 2024186
(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))))