
(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 7 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 1e+46) (/ PI (* a (* (+ b a) (* b 2.0)))) (* PI (/ 0.5 (* b (* a (+ b a)))))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 1e+46) {
tmp = ((double) M_PI) / (a * ((b + a) * (b * 2.0)));
} else {
tmp = ((double) M_PI) * (0.5 / (b * (a * (b + a))));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 1e+46) {
tmp = Math.PI / (a * ((b + a) * (b * 2.0)));
} else {
tmp = Math.PI * (0.5 / (b * (a * (b + a))));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 1e+46: tmp = math.pi / (a * ((b + a) * (b * 2.0))) else: tmp = math.pi * (0.5 / (b * (a * (b + a)))) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 1e+46) tmp = Float64(pi / Float64(a * Float64(Float64(b + a) * Float64(b * 2.0)))); else tmp = Float64(pi * Float64(0.5 / Float64(b * 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 <= 1e+46)
tmp = pi / (a * ((b + a) * (b * 2.0)));
else
tmp = pi * (0.5 / (b * (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, 1e+46], N[(Pi / N[(a * N[(N[(b + a), $MachinePrecision] * N[(b * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(Pi * N[(0.5 / N[(b * N[(a * N[(b + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 10^{+46}:\\
\;\;\;\;\frac{\pi}{a \cdot \left(\left(b + a\right) \cdot \left(b \cdot 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot \frac{0.5}{b \cdot \left(a \cdot \left(b + a\right)\right)}\\
\end{array}
\end{array}
if b < 9.9999999999999999e45Initial program 83.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
un-div-invN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
*-commutativeN/A
*-rgt-identityN/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites99.5%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
*-rgt-identityN/A
*-lft-identityN/A
*-commutativeN/A
frac-subN/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squaresN/A
associate-*l/N/A
Applied rewrites99.6%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
div-invN/A
lower-*.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6499.7
Applied rewrites99.7%
if 9.9999999999999999e45 < b Initial program 67.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
un-div-invN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
*-commutativeN/A
*-rgt-identityN/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites99.7%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
*-rgt-identityN/A
*-lft-identityN/A
*-commutativeN/A
frac-subN/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squaresN/A
associate-*l/N/A
Applied rewrites99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.8
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
div-invN/A
lower-*.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6499.8
Applied rewrites99.8%
lift-/.f64N/A
*-lft-identityN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
frac-timesN/A
lift-/.f64N/A
div-invN/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites99.8%
Final simplification99.8%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -1.5e+92) (/ (* PI 0.5) (* a (* b a))) (* PI (/ 0.5 (* b (* a (+ b a)))))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.5e+92) {
tmp = (((double) M_PI) * 0.5) / (a * (b * a));
} else {
tmp = ((double) M_PI) * (0.5 / (b * (a * (b + a))));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -1.5e+92) {
tmp = (Math.PI * 0.5) / (a * (b * a));
} else {
tmp = Math.PI * (0.5 / (b * (a * (b + a))));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -1.5e+92: tmp = (math.pi * 0.5) / (a * (b * a)) else: tmp = math.pi * (0.5 / (b * (a * (b + a)))) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1.5e+92) tmp = Float64(Float64(pi * 0.5) / Float64(a * Float64(b * a))); else tmp = Float64(pi * Float64(0.5 / Float64(b * 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 (a <= -1.5e+92)
tmp = (pi * 0.5) / (a * (b * a));
else
tmp = pi * (0.5 / (b * (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[a, -1.5e+92], N[(N[(Pi * 0.5), $MachinePrecision] / N[(a * N[(b * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(Pi * N[(0.5 / N[(b * N[(a * N[(b + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.5 \cdot 10^{+92}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{a \cdot \left(b \cdot a\right)}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot \frac{0.5}{b \cdot \left(a \cdot \left(b + a\right)\right)}\\
\end{array}
\end{array}
if a < -1.50000000000000007e92Initial program 64.5%
Taylor expanded in b around 0
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6498.4
Applied rewrites98.4%
if -1.50000000000000007e92 < a Initial program 84.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
un-div-invN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
*-commutativeN/A
*-rgt-identityN/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites99.5%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
*-rgt-identityN/A
*-lft-identityN/A
*-commutativeN/A
frac-subN/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squaresN/A
associate-*l/N/A
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
div-invN/A
lower-*.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6499.2
Applied rewrites99.2%
lift-/.f64N/A
*-lft-identityN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
frac-timesN/A
lift-/.f64N/A
div-invN/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites99.1%
Final simplification98.9%
herbie shell --seed 2024225
(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))))