
(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}
a_m = (fabs.f64 a) b_m = (fabs.f64 b) (FPCore (a_m b_m) :precision binary64 (if (<= (* a_m a_m) 1e+288) (fma a_m a_m (* b_m (- b_m))) (* a_m (+ a_m (* b_m -2.0)))))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
double tmp;
if ((a_m * a_m) <= 1e+288) {
tmp = fma(a_m, a_m, (b_m * -b_m));
} else {
tmp = a_m * (a_m + (b_m * -2.0));
}
return tmp;
}
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) tmp = 0.0 if (Float64(a_m * a_m) <= 1e+288) tmp = fma(a_m, a_m, Float64(b_m * Float64(-b_m))); else tmp = Float64(a_m * Float64(a_m + Float64(b_m * -2.0))); end return tmp end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] code[a$95$m_, b$95$m_] := If[LessEqual[N[(a$95$m * a$95$m), $MachinePrecision], 1e+288], N[(a$95$m * a$95$m + N[(b$95$m * (-b$95$m)), $MachinePrecision]), $MachinePrecision], N[(a$95$m * N[(a$95$m + N[(b$95$m * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
\begin{array}{l}
\mathbf{if}\;a\_m \cdot a\_m \leq 10^{+288}:\\
\;\;\;\;\mathsf{fma}\left(a\_m, a\_m, b\_m \cdot \left(-b\_m\right)\right)\\
\mathbf{else}:\\
\;\;\;\;a\_m \cdot \left(a\_m + b\_m \cdot -2\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 1e288Initial program 100.0%
sqr-neg100.0%
cancel-sign-sub100.0%
fma-define100.0%
Simplified100.0%
if 1e288 < (*.f64 a a) Initial program 68.0%
add-sqr-sqrt68.0%
pow268.0%
difference-of-squares88.0%
sqrt-prod36.0%
add-sqr-sqrt22.0%
sqrt-prod36.0%
sqr-neg36.0%
sqrt-unprod14.0%
add-sqr-sqrt36.0%
sub-neg36.0%
add-sqr-sqrt88.0%
add-sqr-sqrt36.0%
add-sqr-sqrt22.0%
difference-of-squares22.0%
unpow-prod-down22.0%
Applied egg-rr22.0%
unpow222.0%
unpow222.0%
unswap-sqr22.0%
difference-of-squares22.0%
rem-square-sqrt22.0%
rem-square-sqrt22.0%
difference-of-squares22.0%
rem-square-sqrt42.0%
rem-square-sqrt88.0%
Simplified88.0%
Taylor expanded in a around inf 74.0%
*-commutative74.0%
associate-*l*74.0%
unpow274.0%
distribute-lft-out94.0%
Simplified94.0%
Final simplification98.8%
a_m = (fabs.f64 a) b_m = (fabs.f64 b) (FPCore (a_m b_m) :precision binary64 (if (<= (* a_m a_m) 1e+288) (- (* a_m a_m) (* b_m b_m)) (* a_m (+ a_m (* b_m -2.0)))))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
double tmp;
if ((a_m * a_m) <= 1e+288) {
tmp = (a_m * a_m) - (b_m * b_m);
} else {
tmp = a_m * (a_m + (b_m * -2.0));
}
return tmp;
}
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
real(8) :: tmp
if ((a_m * a_m) <= 1d+288) then
tmp = (a_m * a_m) - (b_m * b_m)
else
tmp = a_m * (a_m + (b_m * (-2.0d0)))
end if
code = tmp
end function
a_m = Math.abs(a);
b_m = Math.abs(b);
public static double code(double a_m, double b_m) {
double tmp;
if ((a_m * a_m) <= 1e+288) {
tmp = (a_m * a_m) - (b_m * b_m);
} else {
tmp = a_m * (a_m + (b_m * -2.0));
}
return tmp;
}
a_m = math.fabs(a) b_m = math.fabs(b) def code(a_m, b_m): tmp = 0 if (a_m * a_m) <= 1e+288: tmp = (a_m * a_m) - (b_m * b_m) else: tmp = a_m * (a_m + (b_m * -2.0)) return tmp
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) tmp = 0.0 if (Float64(a_m * a_m) <= 1e+288) tmp = Float64(Float64(a_m * a_m) - Float64(b_m * b_m)); else tmp = Float64(a_m * Float64(a_m + Float64(b_m * -2.0))); end return tmp end
a_m = abs(a); b_m = abs(b); function tmp_2 = code(a_m, b_m) tmp = 0.0; if ((a_m * a_m) <= 1e+288) tmp = (a_m * a_m) - (b_m * b_m); else tmp = a_m * (a_m + (b_m * -2.0)); end tmp_2 = tmp; end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] code[a$95$m_, b$95$m_] := If[LessEqual[N[(a$95$m * a$95$m), $MachinePrecision], 1e+288], N[(N[(a$95$m * a$95$m), $MachinePrecision] - N[(b$95$m * b$95$m), $MachinePrecision]), $MachinePrecision], N[(a$95$m * N[(a$95$m + N[(b$95$m * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
\begin{array}{l}
\mathbf{if}\;a\_m \cdot a\_m \leq 10^{+288}:\\
\;\;\;\;a\_m \cdot a\_m - b\_m \cdot b\_m\\
\mathbf{else}:\\
\;\;\;\;a\_m \cdot \left(a\_m + b\_m \cdot -2\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 1e288Initial program 100.0%
if 1e288 < (*.f64 a a) Initial program 68.0%
add-sqr-sqrt68.0%
pow268.0%
difference-of-squares88.0%
sqrt-prod36.0%
add-sqr-sqrt22.0%
sqrt-prod36.0%
sqr-neg36.0%
sqrt-unprod14.0%
add-sqr-sqrt36.0%
sub-neg36.0%
add-sqr-sqrt88.0%
add-sqr-sqrt36.0%
add-sqr-sqrt22.0%
difference-of-squares22.0%
unpow-prod-down22.0%
Applied egg-rr22.0%
unpow222.0%
unpow222.0%
unswap-sqr22.0%
difference-of-squares22.0%
rem-square-sqrt22.0%
rem-square-sqrt22.0%
difference-of-squares22.0%
rem-square-sqrt42.0%
rem-square-sqrt88.0%
Simplified88.0%
Taylor expanded in a around inf 74.0%
*-commutative74.0%
associate-*l*74.0%
unpow274.0%
distribute-lft-out94.0%
Simplified94.0%
Final simplification98.8%
a_m = (fabs.f64 a) b_m = (fabs.f64 b) (FPCore (a_m b_m) :precision binary64 (* a_m (+ a_m (* b_m -2.0))))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
return a_m * (a_m + (b_m * -2.0));
}
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 * (a_m + (b_m * (-2.0d0)))
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 * (a_m + (b_m * -2.0));
}
a_m = math.fabs(a) b_m = math.fabs(b) def code(a_m, b_m): return a_m * (a_m + (b_m * -2.0))
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) return Float64(a_m * Float64(a_m + Float64(b_m * -2.0))) end
a_m = abs(a); b_m = abs(b); function tmp = code(a_m, b_m) tmp = a_m * (a_m + (b_m * -2.0)); end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] code[a$95$m_, b$95$m_] := N[(a$95$m * N[(a$95$m + N[(b$95$m * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
a\_m \cdot \left(a\_m + b\_m \cdot -2\right)
\end{array}
Initial program 93.7%
add-sqr-sqrt48.4%
pow248.4%
difference-of-squares52.3%
sqrt-prod23.7%
add-sqr-sqrt15.5%
sqrt-prod24.6%
sqr-neg24.6%
sqrt-unprod10.7%
add-sqr-sqrt25.9%
sub-neg25.9%
add-sqr-sqrt52.1%
add-sqr-sqrt25.2%
add-sqr-sqrt16.2%
difference-of-squares16.2%
unpow-prod-down16.2%
Applied egg-rr16.2%
unpow216.2%
unpow216.2%
unswap-sqr16.2%
difference-of-squares16.2%
rem-square-sqrt16.2%
rem-square-sqrt16.2%
difference-of-squares16.2%
rem-square-sqrt29.6%
rem-square-sqrt52.1%
Simplified52.1%
Taylor expanded in a around inf 52.8%
*-commutative52.8%
associate-*l*52.8%
unpow252.8%
distribute-lft-out56.7%
Simplified56.7%
Final simplification56.7%
a_m = (fabs.f64 a) b_m = (fabs.f64 b) (FPCore (a_m b_m) :precision binary64 (* -2.0 (* a_m b_m)))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
return -2.0 * (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 = (-2.0d0) * (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 -2.0 * (a_m * b_m);
}
a_m = math.fabs(a) b_m = math.fabs(b) def code(a_m, b_m): return -2.0 * (a_m * b_m)
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) return Float64(-2.0 * Float64(a_m * b_m)) end
a_m = abs(a); b_m = abs(b); function tmp = code(a_m, b_m) tmp = -2.0 * (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[(-2.0 * N[(a$95$m * b$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
-2 \cdot \left(a\_m \cdot b\_m\right)
\end{array}
Initial program 93.7%
add-sqr-sqrt48.4%
pow248.4%
difference-of-squares52.3%
sqrt-prod23.7%
add-sqr-sqrt15.5%
sqrt-prod24.6%
sqr-neg24.6%
sqrt-unprod10.7%
add-sqr-sqrt25.9%
sub-neg25.9%
add-sqr-sqrt52.1%
add-sqr-sqrt25.2%
add-sqr-sqrt16.2%
difference-of-squares16.2%
unpow-prod-down16.2%
Applied egg-rr16.2%
unpow216.2%
unpow216.2%
unswap-sqr16.2%
difference-of-squares16.2%
rem-square-sqrt16.2%
rem-square-sqrt16.2%
difference-of-squares16.2%
rem-square-sqrt29.6%
rem-square-sqrt52.1%
Simplified52.1%
Taylor expanded in a around inf 52.8%
*-commutative52.8%
associate-*l*52.8%
unpow252.8%
distribute-lft-out56.7%
Simplified56.7%
Taylor expanded in a around 0 16.7%
Final simplification16.7%
(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 2024040
(FPCore (a b)
:name "Difference of squares"
:precision binary64
:herbie-target
(* (+ a b) (- a b))
(- (* a a) (* b b)))