
(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(a * a) - Float64(b * b)) end
function tmp = code(a, b) tmp = (a * a) - (b * b); end
code[a_, b_] := N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
a \cdot a - b \cdot b
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 4 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(a * a) - Float64(b * b)) end
function tmp = code(a, b) tmp = (a * a) - (b * b); end
code[a_, b_] := N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
a \cdot a - b \cdot b
\end{array}
(FPCore (a b) :precision binary64 (* (+ a b) (- a b)))
double code(double a, double b) {
return (a + b) * (a - b);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (a + b) * (a - b)
end function
public static double code(double a, double b) {
return (a + b) * (a - b);
}
def code(a, b): return (a + b) * (a - b)
function code(a, b) return Float64(Float64(a + b) * Float64(a - b)) end
function tmp = code(a, b) tmp = (a + b) * (a - b); end
code[a_, b_] := N[(N[(a + b), $MachinePrecision] * N[(a - b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(a + b\right) \cdot \left(a - b\right)
\end{array}
Initial program 96.9%
add-sqr-sqrt49.9%
associate-*l*49.9%
prod-diff40.9%
Applied egg-rr40.9%
Taylor expanded in b around 0 51.0%
*-commutative51.0%
associate-*r*51.1%
add-sqr-sqrt99.2%
fma-neg96.9%
difference-of-squares100.0%
Applied egg-rr100.0%
Final simplification100.0%
(FPCore (a b) :precision binary64 (if (<= (* a a) 1e+249) (- (* a a) (* b b)) (* a (+ a (* b -2.0)))))
double code(double a, double b) {
double tmp;
if ((a * a) <= 1e+249) {
tmp = (a * a) - (b * b);
} else {
tmp = a * (a + (b * -2.0));
}
return tmp;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((a * a) <= 1d+249) then
tmp = (a * a) - (b * b)
else
tmp = a * (a + (b * (-2.0d0)))
end if
code = tmp
end function
public static double code(double a, double b) {
double tmp;
if ((a * a) <= 1e+249) {
tmp = (a * a) - (b * b);
} else {
tmp = a * (a + (b * -2.0));
}
return tmp;
}
def code(a, b): tmp = 0 if (a * a) <= 1e+249: tmp = (a * a) - (b * b) else: tmp = a * (a + (b * -2.0)) return tmp
function code(a, b) tmp = 0.0 if (Float64(a * a) <= 1e+249) tmp = Float64(Float64(a * a) - Float64(b * b)); else tmp = Float64(a * Float64(a + Float64(b * -2.0))); end return tmp end
function tmp_2 = code(a, b) tmp = 0.0; if ((a * a) <= 1e+249) tmp = (a * a) - (b * b); else tmp = a * (a + (b * -2.0)); end tmp_2 = tmp; end
code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 1e+249], N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision], N[(a * N[(a + N[(b * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot a \leq 10^{+249}:\\
\;\;\;\;a \cdot a - b \cdot b\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(a + b \cdot -2\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 9.9999999999999992e248Initial program 100.0%
if 9.9999999999999992e248 < (*.f64 a a) Initial program 87.3%
add-sqr-sqrt81.0%
pow281.0%
difference-of-squares84.1%
sqrt-prod44.4%
add-sqr-sqrt25.4%
sqrt-prod44.4%
sqr-neg44.4%
sqrt-unprod19.0%
add-sqr-sqrt44.4%
sub-neg44.4%
add-sqr-sqrt84.1%
add-sqr-sqrt44.4%
add-sqr-sqrt25.4%
difference-of-squares25.4%
unpow-prod-down25.4%
Applied egg-rr25.4%
unpow225.4%
unpow225.4%
unswap-sqr25.4%
difference-of-squares25.4%
rem-square-sqrt25.4%
rem-square-sqrt25.4%
difference-of-squares25.4%
rem-square-sqrt47.6%
rem-square-sqrt84.1%
Simplified84.1%
Taylor expanded in a around inf 77.8%
*-commutative77.8%
associate-*l*77.8%
unpow277.8%
distribute-lft-out92.1%
Simplified92.1%
Final simplification98.0%
(FPCore (a b) :precision binary64 (* a (+ a (* b -2.0))))
double code(double a, double b) {
return a * (a + (b * -2.0));
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = a * (a + (b * (-2.0d0)))
end function
public static double code(double a, double b) {
return a * (a + (b * -2.0));
}
def code(a, b): return a * (a + (b * -2.0))
function code(a, b) return Float64(a * Float64(a + Float64(b * -2.0))) end
function tmp = code(a, b) tmp = a * (a + (b * -2.0)); end
code[a_, b_] := N[(a * N[(a + N[(b * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
a \cdot \left(a + b \cdot -2\right)
\end{array}
Initial program 96.9%
add-sqr-sqrt49.2%
pow249.2%
difference-of-squares50.0%
sqrt-prod23.6%
add-sqr-sqrt13.2%
sqrt-prod24.4%
sqr-neg24.4%
sqrt-unprod12.8%
add-sqr-sqrt26.0%
sub-neg26.0%
add-sqr-sqrt50.5%
add-sqr-sqrt24.7%
add-sqr-sqrt13.7%
difference-of-squares13.7%
unpow-prod-down13.7%
Applied egg-rr13.7%
unpow213.7%
unpow213.7%
unswap-sqr13.7%
difference-of-squares13.7%
rem-square-sqrt13.7%
rem-square-sqrt13.7%
difference-of-squares13.7%
rem-square-sqrt27.8%
rem-square-sqrt50.5%
Simplified50.5%
Taylor expanded in a around inf 51.5%
*-commutative51.5%
associate-*l*51.5%
unpow251.5%
distribute-lft-out55.0%
Simplified55.0%
Final simplification55.0%
(FPCore (a b) :precision binary64 (* -2.0 (* a b)))
double code(double a, double b) {
return -2.0 * (a * b);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (-2.0d0) * (a * b)
end function
public static double code(double a, double b) {
return -2.0 * (a * b);
}
def code(a, b): return -2.0 * (a * b)
function code(a, b) return Float64(-2.0 * Float64(a * b)) end
function tmp = code(a, b) tmp = -2.0 * (a * b); end
code[a_, b_] := N[(-2.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
-2 \cdot \left(a \cdot b\right)
\end{array}
Initial program 96.9%
add-sqr-sqrt49.2%
pow249.2%
difference-of-squares50.0%
sqrt-prod23.6%
add-sqr-sqrt13.2%
sqrt-prod24.4%
sqr-neg24.4%
sqrt-unprod12.8%
add-sqr-sqrt26.0%
sub-neg26.0%
add-sqr-sqrt50.5%
add-sqr-sqrt24.7%
add-sqr-sqrt13.7%
difference-of-squares13.7%
unpow-prod-down13.7%
Applied egg-rr13.7%
unpow213.7%
unpow213.7%
unswap-sqr13.7%
difference-of-squares13.7%
rem-square-sqrt13.7%
rem-square-sqrt13.7%
difference-of-squares13.7%
rem-square-sqrt27.8%
rem-square-sqrt50.5%
Simplified50.5%
Taylor expanded in a around inf 51.5%
*-commutative51.5%
associate-*l*51.5%
unpow251.5%
distribute-lft-out55.0%
Simplified55.0%
Taylor expanded in a around 0 13.2%
Final simplification13.2%
(FPCore (a b) :precision binary64 (* (+ a b) (- a b)))
double code(double a, double b) {
return (a + b) * (a - b);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (a + b) * (a - b)
end function
public static double code(double a, double b) {
return (a + b) * (a - b);
}
def code(a, b): return (a + b) * (a - b)
function code(a, b) return Float64(Float64(a + b) * Float64(a - b)) end
function tmp = code(a, b) tmp = (a + b) * (a - b); end
code[a_, b_] := N[(N[(a + b), $MachinePrecision] * N[(a - b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(a + b\right) \cdot \left(a - b\right)
\end{array}
herbie shell --seed 2024053
(FPCore (a b)
:name "Difference of squares"
:precision binary64
:alt
(* (+ a b) (- a b))
(- (* a a) (* b b)))