
(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) (FPCore (a_m b) :precision binary64 (if (<= a_m 1e+206) (fma a_m a_m (* b (- b))) (* (- a_m b) (- a_m b))))
a_m = fabs(a);
double code(double a_m, double b) {
double tmp;
if (a_m <= 1e+206) {
tmp = fma(a_m, a_m, (b * -b));
} else {
tmp = (a_m - b) * (a_m - b);
}
return tmp;
}
a_m = abs(a) function code(a_m, b) tmp = 0.0 if (a_m <= 1e+206) tmp = fma(a_m, a_m, Float64(b * Float64(-b))); else tmp = Float64(Float64(a_m - b) * Float64(a_m - b)); end return tmp end
a_m = N[Abs[a], $MachinePrecision] code[a$95$m_, b_] := If[LessEqual[a$95$m, 1e+206], N[(a$95$m * a$95$m + N[(b * (-b)), $MachinePrecision]), $MachinePrecision], N[(N[(a$95$m - b), $MachinePrecision] * N[(a$95$m - b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
a_m = \left|a\right|
\\
\begin{array}{l}
\mathbf{if}\;a_m \leq 10^{+206}:\\
\;\;\;\;\mathsf{fma}\left(a_m, a_m, b \cdot \left(-b\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(a_m - b\right) \cdot \left(a_m - b\right)\\
\end{array}
\end{array}
if a < 1e206Initial program 93.7%
sqr-neg93.7%
cancel-sign-sub93.7%
fma-def97.0%
Simplified97.0%
if 1e206 < a Initial program 78.9%
difference-of-squares100.0%
add-sqr-sqrt68.4%
sqrt-prod94.7%
sqr-neg94.7%
sqrt-unprod26.3%
add-sqr-sqrt94.7%
sub-neg94.7%
pow194.7%
pow194.7%
pow-prod-up94.7%
metadata-eval94.7%
add-sqr-sqrt94.7%
add-sqr-sqrt68.4%
difference-of-squares68.4%
unpow-prod-down68.4%
Applied egg-rr68.4%
unpow268.4%
unpow268.4%
unswap-sqr68.4%
difference-of-squares68.4%
unpow1/268.4%
unpow1/268.4%
pow-sqr68.4%
metadata-eval68.4%
unpow168.4%
unpow1/268.4%
unpow1/268.4%
pow-sqr68.4%
metadata-eval68.4%
unpow168.4%
difference-of-squares68.4%
unpow1/268.4%
unpow1/268.4%
pow-sqr68.4%
metadata-eval68.4%
unpow168.4%
Simplified94.7%
Final simplification96.9%
a_m = (fabs.f64 a) (FPCore (a_m b) :precision binary64 (if (<= a_m 1.9e-57) (* b (- b)) (* (- a_m b) (- a_m b))))
a_m = fabs(a);
double code(double a_m, double b) {
double tmp;
if (a_m <= 1.9e-57) {
tmp = b * -b;
} else {
tmp = (a_m - b) * (a_m - b);
}
return tmp;
}
a_m = abs(a)
real(8) function code(a_m, b)
real(8), intent (in) :: a_m
real(8), intent (in) :: b
real(8) :: tmp
if (a_m <= 1.9d-57) then
tmp = b * -b
else
tmp = (a_m - b) * (a_m - b)
end if
code = tmp
end function
a_m = Math.abs(a);
public static double code(double a_m, double b) {
double tmp;
if (a_m <= 1.9e-57) {
tmp = b * -b;
} else {
tmp = (a_m - b) * (a_m - b);
}
return tmp;
}
a_m = math.fabs(a) def code(a_m, b): tmp = 0 if a_m <= 1.9e-57: tmp = b * -b else: tmp = (a_m - b) * (a_m - b) return tmp
a_m = abs(a) function code(a_m, b) tmp = 0.0 if (a_m <= 1.9e-57) tmp = Float64(b * Float64(-b)); else tmp = Float64(Float64(a_m - b) * Float64(a_m - b)); end return tmp end
a_m = abs(a); function tmp_2 = code(a_m, b) tmp = 0.0; if (a_m <= 1.9e-57) tmp = b * -b; else tmp = (a_m - b) * (a_m - b); end tmp_2 = tmp; end
a_m = N[Abs[a], $MachinePrecision] code[a$95$m_, b_] := If[LessEqual[a$95$m, 1.9e-57], N[(b * (-b)), $MachinePrecision], N[(N[(a$95$m - b), $MachinePrecision] * N[(a$95$m - b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
a_m = \left|a\right|
\\
\begin{array}{l}
\mathbf{if}\;a_m \leq 1.9 \cdot 10^{-57}:\\
\;\;\;\;b \cdot \left(-b\right)\\
\mathbf{else}:\\
\;\;\;\;\left(a_m - b\right) \cdot \left(a_m - b\right)\\
\end{array}
\end{array}
if a < 1.8999999999999999e-57Initial program 93.5%
Taylor expanded in a around 0 62.0%
mul-1-neg62.0%
Simplified62.0%
unpow262.0%
Applied egg-rr62.0%
if 1.8999999999999999e-57 < a Initial program 90.1%
difference-of-squares100.0%
add-sqr-sqrt52.1%
sqrt-prod88.5%
sqr-neg88.5%
sqrt-unprod36.4%
add-sqr-sqrt74.8%
sub-neg74.8%
pow174.8%
pow174.8%
pow-prod-up74.8%
metadata-eval74.8%
add-sqr-sqrt74.4%
add-sqr-sqrt38.2%
difference-of-squares38.2%
unpow-prod-down38.2%
Applied egg-rr38.2%
unpow238.2%
unpow238.2%
unswap-sqr38.2%
difference-of-squares38.2%
unpow1/238.2%
unpow1/238.2%
pow-sqr38.3%
metadata-eval38.3%
unpow138.3%
unpow1/238.3%
unpow1/238.3%
pow-sqr38.3%
metadata-eval38.3%
unpow138.3%
difference-of-squares38.3%
unpow1/238.3%
unpow1/238.3%
pow-sqr38.4%
metadata-eval38.4%
unpow138.4%
Simplified74.8%
Final simplification65.6%
a_m = (fabs.f64 a) (FPCore (a_m b) :precision binary64 (if (<= a_m 1.18e+147) (- (* a_m a_m) (* b b)) (* (- a_m b) (- a_m b))))
a_m = fabs(a);
double code(double a_m, double b) {
double tmp;
if (a_m <= 1.18e+147) {
tmp = (a_m * a_m) - (b * b);
} else {
tmp = (a_m - b) * (a_m - b);
}
return tmp;
}
a_m = abs(a)
real(8) function code(a_m, b)
real(8), intent (in) :: a_m
real(8), intent (in) :: b
real(8) :: tmp
if (a_m <= 1.18d+147) then
tmp = (a_m * a_m) - (b * b)
else
tmp = (a_m - b) * (a_m - b)
end if
code = tmp
end function
a_m = Math.abs(a);
public static double code(double a_m, double b) {
double tmp;
if (a_m <= 1.18e+147) {
tmp = (a_m * a_m) - (b * b);
} else {
tmp = (a_m - b) * (a_m - b);
}
return tmp;
}
a_m = math.fabs(a) def code(a_m, b): tmp = 0 if a_m <= 1.18e+147: tmp = (a_m * a_m) - (b * b) else: tmp = (a_m - b) * (a_m - b) return tmp
a_m = abs(a) function code(a_m, b) tmp = 0.0 if (a_m <= 1.18e+147) tmp = Float64(Float64(a_m * a_m) - Float64(b * b)); else tmp = Float64(Float64(a_m - b) * Float64(a_m - b)); end return tmp end
a_m = abs(a); function tmp_2 = code(a_m, b) tmp = 0.0; if (a_m <= 1.18e+147) tmp = (a_m * a_m) - (b * b); else tmp = (a_m - b) * (a_m - b); end tmp_2 = tmp; end
a_m = N[Abs[a], $MachinePrecision] code[a$95$m_, b_] := If[LessEqual[a$95$m, 1.18e+147], N[(N[(a$95$m * a$95$m), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision], N[(N[(a$95$m - b), $MachinePrecision] * N[(a$95$m - b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
a_m = \left|a\right|
\\
\begin{array}{l}
\mathbf{if}\;a_m \leq 1.18 \cdot 10^{+147}:\\
\;\;\;\;a_m \cdot a_m - b \cdot b\\
\mathbf{else}:\\
\;\;\;\;\left(a_m - b\right) \cdot \left(a_m - b\right)\\
\end{array}
\end{array}
if a < 1.18000000000000006e147Initial program 94.6%
if 1.18000000000000006e147 < a Initial program 78.8%
difference-of-squares100.0%
add-sqr-sqrt51.5%
sqrt-prod90.9%
sqr-neg90.9%
sqrt-unprod39.4%
add-sqr-sqrt87.9%
sub-neg87.9%
pow187.9%
pow187.9%
pow-prod-up87.9%
metadata-eval87.9%
add-sqr-sqrt87.9%
add-sqr-sqrt48.5%
difference-of-squares48.5%
unpow-prod-down48.5%
Applied egg-rr48.5%
unpow248.5%
unpow248.5%
unswap-sqr48.5%
difference-of-squares48.5%
unpow1/248.5%
unpow1/248.5%
pow-sqr48.5%
metadata-eval48.5%
unpow148.5%
unpow1/248.5%
unpow1/248.5%
pow-sqr48.5%
metadata-eval48.5%
unpow148.5%
difference-of-squares48.5%
unpow1/248.5%
unpow1/248.5%
pow-sqr48.5%
metadata-eval48.5%
unpow148.5%
Simplified87.9%
Final simplification93.8%
a_m = (fabs.f64 a) (FPCore (a_m b) :precision binary64 (* b (- b)))
a_m = fabs(a);
double code(double a_m, double b) {
return b * -b;
}
a_m = abs(a)
real(8) function code(a_m, b)
real(8), intent (in) :: a_m
real(8), intent (in) :: b
code = b * -b
end function
a_m = Math.abs(a);
public static double code(double a_m, double b) {
return b * -b;
}
a_m = math.fabs(a) def code(a_m, b): return b * -b
a_m = abs(a) function code(a_m, b) return Float64(b * Float64(-b)) end
a_m = abs(a); function tmp = code(a_m, b) tmp = b * -b; end
a_m = N[Abs[a], $MachinePrecision] code[a$95$m_, b_] := N[(b * (-b)), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b \cdot \left(-b\right)
\end{array}
Initial program 92.6%
Taylor expanded in a around 0 51.8%
mul-1-neg51.8%
Simplified51.8%
unpow251.8%
Applied egg-rr51.8%
Final simplification51.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 2023315
(FPCore (a b)
:name "Difference of squares"
:precision binary64
:herbie-target
(* (+ a b) (- a b))
(- (* a a) (* b b)))