
(FPCore (x y z) :precision binary64 (+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))
double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (((x * y) + (z * z)) + (z * z)) + (z * z)
end function
public static double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
def code(x, y, z): return (((x * y) + (z * z)) + (z * z)) + (z * z)
function code(x, y, z) return Float64(Float64(Float64(Float64(x * y) + Float64(z * z)) + Float64(z * z)) + Float64(z * z)) end
function tmp = code(x, y, z) tmp = (((x * y) + (z * z)) + (z * z)) + (z * z); end
code[x_, y_, z_] := N[(N[(N[(N[(x * y), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))
double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (((x * y) + (z * z)) + (z * z)) + (z * z)
end function
public static double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
def code(x, y, z): return (((x * y) + (z * z)) + (z * z)) + (z * z)
function code(x, y, z) return Float64(Float64(Float64(Float64(x * y) + Float64(z * z)) + Float64(z * z)) + Float64(z * z)) end
function tmp = code(x, y, z) tmp = (((x * y) + (z * z)) + (z * z)) + (z * z); end
code[x_, y_, z_] := N[(N[(N[(N[(x * y), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z
\end{array}
(FPCore (x y z) :precision binary64 (fma z z (fma x y (* 2.0 (* z z)))))
double code(double x, double y, double z) {
return fma(z, z, fma(x, y, (2.0 * (z * z))));
}
function code(x, y, z) return fma(z, z, fma(x, y, Float64(2.0 * Float64(z * z)))) end
code[x_, y_, z_] := N[(z * z + N[(x * y + N[(2.0 * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(z, z, \mathsf{fma}\left(x, y, 2 \cdot \left(z \cdot z\right)\right)\right)
\end{array}
Initial program 97.5%
+-commutative97.5%
fma-def97.6%
associate-+l+97.6%
fma-def99.2%
count-299.2%
Simplified99.2%
Final simplification99.2%
(FPCore (x y z) :precision binary64 (fma x y (* z (* z 3.0))))
double code(double x, double y, double z) {
return fma(x, y, (z * (z * 3.0)));
}
function code(x, y, z) return fma(x, y, Float64(z * Float64(z * 3.0))) end
code[x_, y_, z_] := N[(x * y + N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, y, z \cdot \left(z \cdot 3\right)\right)
\end{array}
Initial program 97.5%
associate-+l+97.5%
associate-+l+97.5%
fma-def99.1%
associate-+r+99.1%
distribute-lft-out99.1%
distribute-lft-out99.1%
remove-double-neg99.1%
unsub-neg99.1%
count-299.1%
neg-mul-199.1%
distribute-rgt-out--99.1%
metadata-eval99.1%
Simplified99.1%
Final simplification99.1%
(FPCore (x y z) :precision binary64 (if (<= (* z z) 2e+273) (+ (* z z) (+ (* z z) (+ (* z z) (* x y)))) (* z (* z 3.0))))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e+273) {
tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 2d+273) then
tmp = (z * z) + ((z * z) + ((z * z) + (x * y)))
else
tmp = z * (z * 3.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e+273) {
tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
def code(x, y, z): tmp = 0 if (z * z) <= 2e+273: tmp = (z * z) + ((z * z) + ((z * z) + (x * y))) else: tmp = z * (z * 3.0) return tmp
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e+273) tmp = Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(x * y)))); else tmp = Float64(z * Float64(z * 3.0)); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if ((z * z) <= 2e+273) tmp = (z * z) + ((z * z) + ((z * z) + (x * y))); else tmp = z * (z * 3.0); end tmp_2 = tmp; end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 2e+273], N[(N[(z * z), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+273}:\\
\;\;\;\;z \cdot z + \left(z \cdot z + \left(z \cdot z + x \cdot y\right)\right)\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(z \cdot 3\right)\\
\end{array}
\end{array}
if (*.f64 z z) < 1.99999999999999989e273Initial program 99.8%
if 1.99999999999999989e273 < (*.f64 z z) Initial program 92.2%
associate-+l+92.2%
associate-+l+92.2%
fma-def97.4%
associate-+r+97.4%
distribute-lft-out97.4%
distribute-lft-out97.4%
remove-double-neg97.4%
unsub-neg97.4%
count-297.4%
neg-mul-197.4%
distribute-rgt-out--97.4%
metadata-eval97.4%
Simplified97.4%
add-sqr-sqrt97.4%
pow297.4%
associate-*r*97.4%
sqrt-prod97.4%
sqrt-prod44.8%
add-sqr-sqrt97.4%
Applied egg-rr97.4%
Taylor expanded in x around 0 97.4%
unpow297.4%
unpow297.4%
swap-sqr97.4%
unpow297.4%
Simplified97.4%
unpow297.4%
*-commutative97.4%
*-commutative97.4%
swap-sqr97.4%
rem-square-sqrt97.4%
associate-*r*97.4%
Applied egg-rr97.4%
Final simplification99.1%
(FPCore (x y z) :precision binary64 (if (<= (* z z) 1e-6) (+ (* z z) (+ (* z z) (* x y))) (* z (* z 3.0))))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e-6) {
tmp = (z * z) + ((z * z) + (x * y));
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 1d-6) then
tmp = (z * z) + ((z * z) + (x * y))
else
tmp = z * (z * 3.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e-6) {
tmp = (z * z) + ((z * z) + (x * y));
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
def code(x, y, z): tmp = 0 if (z * z) <= 1e-6: tmp = (z * z) + ((z * z) + (x * y)) else: tmp = z * (z * 3.0) return tmp
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 1e-6) tmp = Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(x * y))); else tmp = Float64(z * Float64(z * 3.0)); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if ((z * z) <= 1e-6) tmp = (z * z) + ((z * z) + (x * y)); else tmp = z * (z * 3.0); end tmp_2 = tmp; end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e-6], N[(N[(z * z), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 10^{-6}:\\
\;\;\;\;z \cdot z + \left(z \cdot z + x \cdot y\right)\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(z \cdot 3\right)\\
\end{array}
\end{array}
if (*.f64 z z) < 9.99999999999999955e-7Initial program 99.9%
Taylor expanded in x around inf 86.6%
if 9.99999999999999955e-7 < (*.f64 z z) Initial program 95.4%
associate-+l+95.4%
associate-+l+95.4%
fma-def98.4%
associate-+r+98.4%
distribute-lft-out98.4%
distribute-lft-out98.4%
remove-double-neg98.4%
unsub-neg98.4%
count-298.4%
neg-mul-198.4%
distribute-rgt-out--98.4%
metadata-eval98.4%
Simplified98.4%
add-sqr-sqrt98.3%
pow298.3%
associate-*r*98.3%
sqrt-prod98.1%
sqrt-prod42.9%
add-sqr-sqrt98.1%
Applied egg-rr98.1%
Taylor expanded in x around 0 87.1%
unpow287.1%
unpow287.1%
swap-sqr87.2%
unpow287.2%
Simplified87.2%
unpow287.2%
*-commutative87.2%
*-commutative87.2%
swap-sqr87.1%
rem-square-sqrt87.4%
associate-*r*87.5%
Applied egg-rr87.5%
Final simplification87.1%
(FPCore (x y z) :precision binary64 (if (<= (* z z) 1e-6) (+ (* z z) (* x y)) (* z (* z 3.0))))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e-6) {
tmp = (z * z) + (x * y);
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 1d-6) then
tmp = (z * z) + (x * y)
else
tmp = z * (z * 3.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e-6) {
tmp = (z * z) + (x * y);
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
def code(x, y, z): tmp = 0 if (z * z) <= 1e-6: tmp = (z * z) + (x * y) else: tmp = z * (z * 3.0) return tmp
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 1e-6) tmp = Float64(Float64(z * z) + Float64(x * y)); else tmp = Float64(z * Float64(z * 3.0)); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if ((z * z) <= 1e-6) tmp = (z * z) + (x * y); else tmp = z * (z * 3.0); end tmp_2 = tmp; end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e-6], N[(N[(z * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision], N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 10^{-6}:\\
\;\;\;\;z \cdot z + x \cdot y\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(z \cdot 3\right)\\
\end{array}
\end{array}
if (*.f64 z z) < 9.99999999999999955e-7Initial program 99.9%
Taylor expanded in x around inf 86.6%
Taylor expanded in x around inf 86.2%
if 9.99999999999999955e-7 < (*.f64 z z) Initial program 95.4%
associate-+l+95.4%
associate-+l+95.4%
fma-def98.4%
associate-+r+98.4%
distribute-lft-out98.4%
distribute-lft-out98.4%
remove-double-neg98.4%
unsub-neg98.4%
count-298.4%
neg-mul-198.4%
distribute-rgt-out--98.4%
metadata-eval98.4%
Simplified98.4%
add-sqr-sqrt98.3%
pow298.3%
associate-*r*98.3%
sqrt-prod98.1%
sqrt-prod42.9%
add-sqr-sqrt98.1%
Applied egg-rr98.1%
Taylor expanded in x around 0 87.1%
unpow287.1%
unpow287.1%
swap-sqr87.2%
unpow287.2%
Simplified87.2%
unpow287.2%
*-commutative87.2%
*-commutative87.2%
swap-sqr87.1%
rem-square-sqrt87.4%
associate-*r*87.5%
Applied egg-rr87.5%
Final simplification86.9%
(FPCore (x y z) :precision binary64 (if (<= z 1.6e-10) (* x y) (* z (* z 3.0))))
double code(double x, double y, double z) {
double tmp;
if (z <= 1.6e-10) {
tmp = x * y;
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (z <= 1.6d-10) then
tmp = x * y
else
tmp = z * (z * 3.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if (z <= 1.6e-10) {
tmp = x * y;
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
def code(x, y, z): tmp = 0 if z <= 1.6e-10: tmp = x * y else: tmp = z * (z * 3.0) return tmp
function code(x, y, z) tmp = 0.0 if (z <= 1.6e-10) tmp = Float64(x * y); else tmp = Float64(z * Float64(z * 3.0)); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if (z <= 1.6e-10) tmp = x * y; else tmp = z * (z * 3.0); end tmp_2 = tmp; end
code[x_, y_, z_] := If[LessEqual[z, 1.6e-10], N[(x * y), $MachinePrecision], N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \leq 1.6 \cdot 10^{-10}:\\
\;\;\;\;x \cdot y\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(z \cdot 3\right)\\
\end{array}
\end{array}
if z < 1.5999999999999999e-10Initial program 97.8%
associate-+l+97.8%
associate-+l+97.8%
fma-def99.3%
associate-+r+99.3%
distribute-lft-out99.3%
distribute-lft-out99.4%
remove-double-neg99.4%
unsub-neg99.4%
count-299.4%
neg-mul-199.4%
distribute-rgt-out--99.4%
metadata-eval99.4%
Simplified99.4%
add-sqr-sqrt99.3%
pow299.3%
associate-*r*99.3%
sqrt-prod99.2%
sqrt-prod28.0%
add-sqr-sqrt99.2%
Applied egg-rr99.2%
Taylor expanded in x around inf 56.0%
if 1.5999999999999999e-10 < z Initial program 96.8%
associate-+l+96.8%
associate-+l+96.8%
fma-def98.3%
associate-+r+98.3%
distribute-lft-out98.3%
distribute-lft-out98.3%
remove-double-neg98.3%
unsub-neg98.3%
count-298.3%
neg-mul-198.3%
distribute-rgt-out--98.3%
metadata-eval98.3%
Simplified98.3%
add-sqr-sqrt98.3%
pow298.3%
associate-*r*98.3%
sqrt-prod98.2%
sqrt-prod97.9%
add-sqr-sqrt98.2%
Applied egg-rr98.2%
Taylor expanded in x around 0 83.0%
unpow283.0%
unpow283.0%
swap-sqr83.0%
unpow283.0%
Simplified83.0%
unpow283.0%
*-commutative83.0%
*-commutative83.0%
swap-sqr83.0%
rem-square-sqrt83.2%
associate-*r*83.2%
Applied egg-rr83.2%
Final simplification62.8%
(FPCore (x y z) :precision binary64 (* x y))
double code(double x, double y, double z) {
return x * y;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = x * y
end function
public static double code(double x, double y, double z) {
return x * y;
}
def code(x, y, z): return x * y
function code(x, y, z) return Float64(x * y) end
function tmp = code(x, y, z) tmp = x * y; end
code[x_, y_, z_] := N[(x * y), $MachinePrecision]
\begin{array}{l}
\\
x \cdot y
\end{array}
Initial program 97.5%
associate-+l+97.5%
associate-+l+97.5%
fma-def99.1%
associate-+r+99.1%
distribute-lft-out99.1%
distribute-lft-out99.1%
remove-double-neg99.1%
unsub-neg99.1%
count-299.1%
neg-mul-199.1%
distribute-rgt-out--99.1%
metadata-eval99.1%
Simplified99.1%
add-sqr-sqrt99.0%
pow299.0%
associate-*r*99.0%
sqrt-prod98.9%
sqrt-prod45.5%
add-sqr-sqrt98.9%
Applied egg-rr98.9%
Taylor expanded in x around inf 47.5%
Final simplification47.5%
(FPCore (x y z) :precision binary64 (+ (* (* 3.0 z) z) (* y x)))
double code(double x, double y, double z) {
return ((3.0 * z) * z) + (y * x);
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = ((3.0d0 * z) * z) + (y * x)
end function
public static double code(double x, double y, double z) {
return ((3.0 * z) * z) + (y * x);
}
def code(x, y, z): return ((3.0 * z) * z) + (y * x)
function code(x, y, z) return Float64(Float64(Float64(3.0 * z) * z) + Float64(y * x)) end
function tmp = code(x, y, z) tmp = ((3.0 * z) * z) + (y * x); end
code[x_, y_, z_] := N[(N[(N[(3.0 * z), $MachinePrecision] * z), $MachinePrecision] + N[(y * x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(3 \cdot z\right) \cdot z + y \cdot x
\end{array}
herbie shell --seed 2024017
(FPCore (x y z)
:name "Linear.Quaternion:$c/ from linear-1.19.1.3, A"
:precision binary64
:herbie-target
(+ (* (* 3.0 z) z) (* y x))
(+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))