
(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) 2e+253) (- (* 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) <= 2e+253) {
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) <= 2d+253) 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) <= 2e+253) {
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) <= 2e+253: 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) <= 2e+253) 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) <= 2e+253) 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], 2e+253], 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 2 \cdot 10^{+253}:\\
\;\;\;\;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) < 1.9999999999999999e253Initial program 100.0%
if 1.9999999999999999e253 < (*.f64 a a) Initial program 86.7%
add-sqr-sqrt83.1%
pow283.1%
difference-of-squares85.5%
sqrt-prod34.9%
add-sqr-sqrt18.1%
sqrt-prod34.9%
sqr-neg34.9%
sqrt-unprod16.9%
add-sqr-sqrt34.9%
sub-neg34.9%
add-sqr-sqrt85.5%
add-sqr-sqrt34.9%
add-sqr-sqrt18.1%
difference-of-squares18.1%
unpow-prod-down18.1%
Applied egg-rr18.1%
unpow218.1%
unpow218.1%
unswap-sqr18.1%
difference-of-squares18.1%
rem-square-sqrt18.1%
rem-square-sqrt18.1%
difference-of-squares18.1%
rem-square-sqrt41.0%
rem-square-sqrt85.5%
Simplified85.5%
Taylor expanded in a around inf 81.9%
*-commutative81.9%
associate-*l*81.9%
unpow281.9%
distribute-lft-out91.6%
Simplified91.6%
Final simplification97.3%
a_m = (fabs.f64 a) b_m = (fabs.f64 b) (FPCore (a_m b_m) :precision binary64 (fma a_m a_m (* b_m (- b_m))))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
return fma(a_m, a_m, (b_m * -b_m));
}
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) return fma(a_m, a_m, Float64(b_m * Float64(-b_m))) end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] code[a$95$m_, b$95$m_] := N[(a$95$m * a$95$m + N[(b$95$m * (-b$95$m)), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
\mathsf{fma}\left(a\_m, a\_m, b\_m \cdot \left(-b\_m\right)\right)
\end{array}
Initial program 95.7%
sqr-neg95.7%
cancel-sign-sub95.7%
fma-define99.2%
Simplified99.2%
Final simplification99.2%
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 95.7%
add-sqr-sqrt50.0%
pow250.0%
difference-of-squares50.8%
sqrt-prod23.7%
add-sqr-sqrt12.4%
sqrt-prod24.3%
sqr-neg24.3%
sqrt-unprod12.3%
add-sqr-sqrt24.6%
sub-neg24.6%
add-sqr-sqrt50.7%
add-sqr-sqrt24.6%
add-sqr-sqrt12.8%
difference-of-squares12.8%
unpow-prod-down12.8%
Applied egg-rr12.8%
unpow212.8%
unpow212.8%
unswap-sqr12.8%
difference-of-squares12.8%
rem-square-sqrt12.8%
rem-square-sqrt12.8%
difference-of-squares12.8%
rem-square-sqrt24.5%
rem-square-sqrt50.7%
Simplified50.7%
Taylor expanded in a around inf 51.9%
*-commutative51.9%
associate-*l*51.9%
unpow251.9%
distribute-lft-out55.0%
Simplified55.0%
Final simplification55.0%
a_m = (fabs.f64 a) b_m = (fabs.f64 b) (FPCore (a_m b_m) :precision binary64 (* b_m (* a_m -2.0)))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
return b_m * (a_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 = b_m * (a_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 b_m * (a_m * -2.0);
}
a_m = math.fabs(a) b_m = math.fabs(b) def code(a_m, b_m): return b_m * (a_m * -2.0)
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) return Float64(b_m * Float64(a_m * -2.0)) end
a_m = abs(a); b_m = abs(b); function tmp = code(a_m, b_m) tmp = b_m * (a_m * -2.0); end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] code[a$95$m_, b$95$m_] := N[(b$95$m * N[(a$95$m * -2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
b\_m \cdot \left(a\_m \cdot -2\right)
\end{array}
Initial program 95.7%
add-sqr-sqrt50.0%
pow250.0%
difference-of-squares50.8%
sqrt-prod23.7%
add-sqr-sqrt12.4%
sqrt-prod24.3%
sqr-neg24.3%
sqrt-unprod12.3%
add-sqr-sqrt24.6%
sub-neg24.6%
add-sqr-sqrt50.7%
add-sqr-sqrt24.6%
add-sqr-sqrt12.8%
difference-of-squares12.8%
unpow-prod-down12.8%
Applied egg-rr12.8%
unpow212.8%
unpow212.8%
unswap-sqr12.8%
difference-of-squares12.8%
rem-square-sqrt12.8%
rem-square-sqrt12.8%
difference-of-squares12.8%
rem-square-sqrt24.5%
rem-square-sqrt50.7%
Simplified50.7%
Taylor expanded in a around inf 51.9%
*-commutative51.9%
associate-*l*51.9%
unpow251.9%
distribute-lft-out55.0%
Simplified55.0%
Taylor expanded in a around 0 10.8%
associate-*r*10.8%
*-commutative10.8%
Simplified10.8%
Final simplification10.8%
(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 2024062
(FPCore (a b)
:name "Difference of squares"
:precision binary64
:herbie-target
(* (+ a b) (- a b))
(- (* a a) (* b b)))