
(FPCore (a b) :precision binary64 (- (* (* (* a a) b) b)))
double code(double a, double b) {
return -(((a * a) * b) * b);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = -(((a * a) * b) * b)
end function
public static double code(double a, double b) {
return -(((a * a) * b) * b);
}
def code(a, b): return -(((a * a) * b) * b)
function code(a, b) return Float64(-Float64(Float64(Float64(a * a) * b) * b)) end
function tmp = code(a, b) tmp = -(((a * a) * b) * b); end
code[a_, b_] := (-N[(N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision] * b), $MachinePrecision])
\begin{array}{l}
\\
-\left(\left(a \cdot a\right) \cdot b\right) \cdot b
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 2 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (- (* (* (* a a) b) b)))
double code(double a, double b) {
return -(((a * a) * b) * b);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = -(((a * a) * b) * b)
end function
public static double code(double a, double b) {
return -(((a * a) * b) * b);
}
def code(a, b): return -(((a * a) * b) * b)
function code(a, b) return Float64(-Float64(Float64(Float64(a * a) * b) * b)) end
function tmp = code(a, b) tmp = -(((a * a) * b) * b); end
code[a_, b_] := (-N[(N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision] * b), $MachinePrecision])
\begin{array}{l}
\\
-\left(\left(a \cdot a\right) \cdot b\right) \cdot b
\end{array}
a_m = (fabs.f64 a) b_m = (fabs.f64 b) NOTE: a_m and b_m should be sorted in increasing order before calling this function. (FPCore (a_m b_m) :precision binary64 (* (* b_m (sqrt a_m)) (* (sqrt a_m) (* b_m (- a_m)))))
a_m = fabs(a);
b_m = fabs(b);
assert(a_m < b_m);
double code(double a_m, double b_m) {
return (b_m * sqrt(a_m)) * (sqrt(a_m) * (b_m * -a_m));
}
a_m = abs(a)
b_m = abs(b)
NOTE: a_m and b_m should be sorted in increasing order before calling this function.
real(8) function code(a_m, b_m)
real(8), intent (in) :: a_m
real(8), intent (in) :: b_m
code = (b_m * sqrt(a_m)) * (sqrt(a_m) * (b_m * -a_m))
end function
a_m = Math.abs(a);
b_m = Math.abs(b);
assert a_m < b_m;
public static double code(double a_m, double b_m) {
return (b_m * Math.sqrt(a_m)) * (Math.sqrt(a_m) * (b_m * -a_m));
}
a_m = math.fabs(a) b_m = math.fabs(b) [a_m, b_m] = sort([a_m, b_m]) def code(a_m, b_m): return (b_m * math.sqrt(a_m)) * (math.sqrt(a_m) * (b_m * -a_m))
a_m = abs(a) b_m = abs(b) a_m, b_m = sort([a_m, b_m]) function code(a_m, b_m) return Float64(Float64(b_m * sqrt(a_m)) * Float64(sqrt(a_m) * Float64(b_m * Float64(-a_m)))) end
a_m = abs(a);
b_m = abs(b);
a_m, b_m = num2cell(sort([a_m, b_m])){:}
function tmp = code(a_m, b_m)
tmp = (b_m * sqrt(a_m)) * (sqrt(a_m) * (b_m * -a_m));
end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] NOTE: a_m and b_m should be sorted in increasing order before calling this function. code[a$95$m_, b$95$m_] := N[(N[(b$95$m * N[Sqrt[a$95$m], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[a$95$m], $MachinePrecision] * N[(b$95$m * (-a$95$m)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
[a_m, b_m] = \mathsf{sort}([a_m, b_m])\\
\\
\left(b_m \cdot \sqrt{a_m}\right) \cdot \left(\sqrt{a_m} \cdot \left(b_m \cdot \left(-a_m\right)\right)\right)
\end{array}
Initial program 80.4%
Taylor expanded in a around 0 76.1%
unpow276.1%
unpow276.1%
swap-sqr99.7%
unpow299.7%
Simplified99.7%
unpow299.7%
associate-*l*94.9%
*-commutative94.9%
associate-*l*84.5%
unpow284.5%
add-sqr-sqrt46.2%
sqrt-unprod54.5%
sqr-neg54.5%
sqrt-unprod14.0%
add-sqr-sqrt30.6%
associate-*l*30.6%
*-commutative30.6%
add-sqr-sqrt26.3%
associate-*l*26.3%
Applied egg-rr53.2%
*-commutative53.2%
associate-*r*53.3%
add-sqr-sqrt30.3%
pow230.3%
add-sqr-sqrt30.3%
pow230.3%
pow-prod-down30.3%
pow1/230.3%
sqrt-pow130.3%
metadata-eval30.3%
Applied egg-rr30.3%
*-commutative30.3%
unpow230.3%
swap-sqr30.3%
pow-sqr30.3%
metadata-eval30.3%
unpow1/230.3%
rem-square-sqrt53.3%
Simplified53.3%
Final simplification53.3%
a_m = (fabs.f64 a) b_m = (fabs.f64 b) NOTE: a_m and b_m should be sorted in increasing order before calling this function. (FPCore (a_m b_m) :precision binary64 (* (* b_m a_m) (* b_m (- a_m))))
a_m = fabs(a);
b_m = fabs(b);
assert(a_m < b_m);
double code(double a_m, double b_m) {
return (b_m * a_m) * (b_m * -a_m);
}
a_m = abs(a)
b_m = abs(b)
NOTE: a_m and b_m should be sorted in increasing order before calling this function.
real(8) function code(a_m, b_m)
real(8), intent (in) :: a_m
real(8), intent (in) :: b_m
code = (b_m * a_m) * (b_m * -a_m)
end function
a_m = Math.abs(a);
b_m = Math.abs(b);
assert a_m < b_m;
public static double code(double a_m, double b_m) {
return (b_m * a_m) * (b_m * -a_m);
}
a_m = math.fabs(a) b_m = math.fabs(b) [a_m, b_m] = sort([a_m, b_m]) def code(a_m, b_m): return (b_m * a_m) * (b_m * -a_m)
a_m = abs(a) b_m = abs(b) a_m, b_m = sort([a_m, b_m]) function code(a_m, b_m) return Float64(Float64(b_m * a_m) * Float64(b_m * Float64(-a_m))) end
a_m = abs(a);
b_m = abs(b);
a_m, b_m = num2cell(sort([a_m, b_m])){:}
function tmp = code(a_m, b_m)
tmp = (b_m * a_m) * (b_m * -a_m);
end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] NOTE: a_m and b_m should be sorted in increasing order before calling this function. code[a$95$m_, b$95$m_] := N[(N[(b$95$m * a$95$m), $MachinePrecision] * N[(b$95$m * (-a$95$m)), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
[a_m, b_m] = \mathsf{sort}([a_m, b_m])\\
\\
\left(b_m \cdot a_m\right) \cdot \left(b_m \cdot \left(-a_m\right)\right)
\end{array}
Initial program 80.4%
Taylor expanded in a around 0 76.1%
unpow276.1%
unpow276.1%
swap-sqr99.7%
unpow299.7%
Simplified99.7%
unpow299.7%
Applied egg-rr99.7%
Final simplification99.7%
herbie shell --seed 2023318
(FPCore (a b)
:name "ab-angle->ABCF D"
:precision binary64
(- (* (* (* a a) b) b)))