
(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) (FPCore (a_m b_m) :precision binary64 (* (sqrt (* a_m b_m)) (- (pow (* a_m b_m) 1.5))))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
return sqrt((a_m * b_m)) * -pow((a_m * b_m), 1.5);
}
a_m = abs(a)
b_m = abs(b)
real(8) function code(a_m, b_m)
real(8), intent (in) :: a_m
real(8), intent (in) :: b_m
code = sqrt((a_m * b_m)) * -((a_m * b_m) ** 1.5d0)
end function
a_m = Math.abs(a);
b_m = Math.abs(b);
public static double code(double a_m, double b_m) {
return Math.sqrt((a_m * b_m)) * -Math.pow((a_m * b_m), 1.5);
}
a_m = math.fabs(a) b_m = math.fabs(b) def code(a_m, b_m): return math.sqrt((a_m * b_m)) * -math.pow((a_m * b_m), 1.5)
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) return Float64(sqrt(Float64(a_m * b_m)) * Float64(-(Float64(a_m * b_m) ^ 1.5))) end
a_m = abs(a); b_m = abs(b); function tmp = code(a_m, b_m) tmp = sqrt((a_m * b_m)) * -((a_m * b_m) ^ 1.5); end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] code[a$95$m_, b$95$m_] := N[(N[Sqrt[N[(a$95$m * b$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Power[N[(a$95$m * b$95$m), $MachinePrecision], 1.5], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
\sqrt{a\_m \cdot b\_m} \cdot \left(-{\left(a\_m \cdot b\_m\right)}^{1.5}\right)
\end{array}
Initial program 82.1%
add-cbrt-cube63.2%
pow363.3%
associate-*l*62.4%
swap-sqr70.6%
pow270.6%
Applied egg-rr70.6%
Taylor expanded in a around 0 51.6%
exp-to-pow25.3%
exp-to-pow16.1%
exp-sum21.3%
distribute-rgt-in21.3%
log-prod45.2%
*-commutative45.2%
exp-to-pow70.6%
Simplified70.6%
pow1/369.5%
pow-pow99.6%
metadata-eval99.6%
pow299.6%
add-sqr-sqrt62.2%
associate-*l*62.2%
*-commutative62.2%
pow1/262.2%
pow-plus62.3%
metadata-eval62.3%
Applied egg-rr62.3%
Final simplification62.3%
a_m = (fabs.f64 a) b_m = (fabs.f64 b) (FPCore (a_m b_m) :precision binary64 (* (* a_m b_m) (* a_m (- b_m))))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
return (a_m * b_m) * (a_m * -b_m);
}
a_m = abs(a)
b_m = abs(b)
real(8) function code(a_m, b_m)
real(8), intent (in) :: a_m
real(8), intent (in) :: b_m
code = (a_m * b_m) * (a_m * -b_m)
end function
a_m = Math.abs(a);
b_m = Math.abs(b);
public static double code(double a_m, double b_m) {
return (a_m * b_m) * (a_m * -b_m);
}
a_m = math.fabs(a) b_m = math.fabs(b) def code(a_m, b_m): return (a_m * b_m) * (a_m * -b_m)
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) return Float64(Float64(a_m * b_m) * Float64(a_m * Float64(-b_m))) end
a_m = abs(a); b_m = abs(b); function tmp = code(a_m, b_m) tmp = (a_m * b_m) * (a_m * -b_m); end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] code[a$95$m_, b$95$m_] := N[(N[(a$95$m * b$95$m), $MachinePrecision] * N[(a$95$m * (-b$95$m)), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
\left(a\_m \cdot b\_m\right) \cdot \left(a\_m \cdot \left(-b\_m\right)\right)
\end{array}
Initial program 82.1%
Taylor expanded in a around 0 75.2%
unpow275.2%
unpow275.2%
swap-sqr99.6%
unpow299.6%
Simplified99.6%
unpow299.6%
Applied egg-rr99.6%
Final simplification99.6%
herbie shell --seed 2024039
(FPCore (a b)
:name "ab-angle->ABCF D"
:precision binary64
(- (* (* (* a a) b) b)))