
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(let* ((t_0 (* 2.0 (exp (* 0.5 (- (log (- (+ y z))) (log (/ -1.0 x))))))))
(if (<= y -12500000000.0)
t_0
(if (<= y -7.2e-178)
(* 2.0 (sqrt (* (+ y z) x)))
(if (<= y -4.2e-300) t_0 (* 2.0 (* (sqrt (+ y x)) (sqrt z))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = 2.0 * exp((0.5 * (log(-(y + z)) - log((-1.0 / x)))));
double tmp;
if (y <= -12500000000.0) {
tmp = t_0;
} else if (y <= -7.2e-178) {
tmp = 2.0 * sqrt(((y + z) * x));
} else if (y <= -4.2e-300) {
tmp = t_0;
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 * exp((0.5d0 * (log(-(y + z)) - log(((-1.0d0) / x)))))
if (y <= (-12500000000.0d0)) then
tmp = t_0
else if (y <= (-7.2d-178)) then
tmp = 2.0d0 * sqrt(((y + z) * x))
else if (y <= (-4.2d-300)) then
tmp = t_0
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double t_0 = 2.0 * Math.exp((0.5 * (Math.log(-(y + z)) - Math.log((-1.0 / x)))));
double tmp;
if (y <= -12500000000.0) {
tmp = t_0;
} else if (y <= -7.2e-178) {
tmp = 2.0 * Math.sqrt(((y + z) * x));
} else if (y <= -4.2e-300) {
tmp = t_0;
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): t_0 = 2.0 * math.exp((0.5 * (math.log(-(y + z)) - math.log((-1.0 / x))))) tmp = 0 if y <= -12500000000.0: tmp = t_0 elif y <= -7.2e-178: tmp = 2.0 * math.sqrt(((y + z) * x)) elif y <= -4.2e-300: tmp = t_0 else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = Float64(2.0 * exp(Float64(0.5 * Float64(log(Float64(-Float64(y + z))) - log(Float64(-1.0 / x)))))) tmp = 0.0 if (y <= -12500000000.0) tmp = t_0; elseif (y <= -7.2e-178) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * x))); elseif (y <= -4.2e-300) tmp = t_0; else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
t_0 = 2.0 * exp((0.5 * (log(-(y + z)) - log((-1.0 / x)))));
tmp = 0.0;
if (y <= -12500000000.0)
tmp = t_0;
elseif (y <= -7.2e-178)
tmp = 2.0 * sqrt(((y + z) * x));
elseif (y <= -4.2e-300)
tmp = t_0;
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[(2.0 * N[Exp[N[(0.5 * N[(N[Log[(-N[(y + z), $MachinePrecision])], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -12500000000.0], t$95$0, If[LessEqual[y, -7.2e-178], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -4.2e-300], t$95$0, N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
t_0 := 2 \cdot e^{0.5 \cdot \left(\log \left(-\left(y + z\right)\right) - \log \left(\frac{-1}{x}\right)\right)}\\
\mathbf{if}\;y \leq -12500000000:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq -7.2 \cdot 10^{-178}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{elif}\;y \leq -4.2 \cdot 10^{-300}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -1.25e10 or -7.19999999999999987e-178 < y < -4.20000000000000007e-300Initial program 68.9%
+-commutative68.9%
associate-+r+68.9%
*-commutative68.9%
+-commutative68.9%
+-commutative68.9%
*-commutative68.9%
*-commutative68.9%
associate-+l+68.9%
+-commutative68.9%
*-commutative68.9%
associate-+l+68.9%
*-commutative68.9%
*-commutative68.9%
+-commutative68.9%
Simplified69.0%
add-cbrt-cube42.8%
pow1/340.1%
add-sqr-sqrt40.1%
pow140.1%
pow1/240.1%
pow-prod-up40.1%
distribute-rgt-in40.0%
associate-+r+40.0%
*-commutative40.0%
distribute-lft-in40.0%
fma-define40.2%
metadata-eval40.2%
Applied egg-rr40.2%
unpow1/342.9%
+-commutative42.9%
*-commutative42.9%
Simplified42.9%
pow1/340.2%
pow-to-exp40.4%
log-pow63.6%
+-commutative63.6%
*-commutative63.6%
Applied egg-rr63.6%
Taylor expanded in x around -inf 50.3%
mul-1-neg50.3%
unsub-neg50.3%
distribute-lft-out50.3%
mul-1-neg50.3%
+-commutative50.3%
Simplified50.3%
if -1.25e10 < y < -7.19999999999999987e-178Initial program 70.6%
+-commutative70.6%
associate-+r+70.6%
*-commutative70.6%
+-commutative70.6%
+-commutative70.6%
*-commutative70.6%
*-commutative70.6%
associate-+l+70.6%
+-commutative70.6%
*-commutative70.6%
associate-+l+70.6%
*-commutative70.6%
*-commutative70.6%
+-commutative70.6%
Simplified70.6%
Taylor expanded in x around inf 36.1%
if -4.20000000000000007e-300 < y Initial program 76.9%
+-commutative76.9%
associate-+r+76.9%
*-commutative76.9%
+-commutative76.9%
+-commutative76.9%
*-commutative76.9%
*-commutative76.9%
associate-+l+76.9%
+-commutative76.9%
*-commutative76.9%
associate-+l+76.9%
*-commutative76.9%
*-commutative76.9%
+-commutative76.9%
Simplified76.9%
Taylor expanded in z around inf 49.1%
+-commutative49.1%
Simplified49.1%
*-commutative49.1%
sqrt-prod49.3%
Applied egg-rr49.3%
Final simplification48.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.22e-278) (* 2.0 (sqrt (fma x z (* y (+ z x))))) (* 2.0 (* (sqrt (+ y x)) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.22e-278) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.22e-278) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 1.22e-278], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.22 \cdot 10^{-278}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 1.22e-278Initial program 71.1%
associate-+l+71.1%
*-commutative71.1%
*-commutative71.1%
*-commutative71.1%
+-commutative71.1%
+-commutative71.1%
+-commutative71.1%
*-commutative71.1%
*-commutative71.1%
associate-+l+71.1%
+-commutative71.1%
fma-define71.1%
distribute-lft-out71.2%
Simplified71.2%
if 1.22e-278 < y Initial program 75.9%
+-commutative75.9%
associate-+r+75.9%
*-commutative75.9%
+-commutative75.9%
+-commutative75.9%
*-commutative75.9%
*-commutative75.9%
associate-+l+75.9%
+-commutative75.9%
*-commutative75.9%
associate-+l+75.9%
*-commutative75.9%
*-commutative75.9%
+-commutative75.9%
Simplified75.9%
Taylor expanded in z around inf 45.0%
+-commutative45.0%
Simplified45.0%
*-commutative45.0%
sqrt-prod47.7%
Applied egg-rr47.7%
Final simplification59.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 8.6e-281) (* 2.0 (sqrt (* (+ y z) x))) (* 2.0 (* (sqrt (+ y x)) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 8.6e-281) {
tmp = 2.0 * sqrt(((y + z) * x));
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 (y <= 8.6d-281) then
tmp = 2.0d0 * sqrt(((y + z) * x))
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 8.6e-281) {
tmp = 2.0 * Math.sqrt(((y + z) * x));
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 8.6e-281: tmp = 2.0 * math.sqrt(((y + z) * x)) else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 8.6e-281) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * x))); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 8.6e-281)
tmp = 2.0 * sqrt(((y + z) * x));
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 8.6e-281], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 8.6 \cdot 10^{-281}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 8.60000000000000047e-281Initial program 70.7%
+-commutative70.7%
associate-+r+70.7%
*-commutative70.7%
+-commutative70.7%
+-commutative70.7%
*-commutative70.7%
*-commutative70.7%
associate-+l+70.7%
+-commutative70.7%
*-commutative70.7%
associate-+l+70.7%
*-commutative70.7%
*-commutative70.7%
+-commutative70.7%
Simplified70.7%
Taylor expanded in x around inf 47.8%
if 8.60000000000000047e-281 < y Initial program 76.3%
+-commutative76.3%
associate-+r+76.3%
*-commutative76.3%
+-commutative76.3%
+-commutative76.3%
*-commutative76.3%
*-commutative76.3%
associate-+l+76.3%
+-commutative76.3%
*-commutative76.3%
associate-+l+76.3%
*-commutative76.3%
*-commutative76.3%
+-commutative76.3%
Simplified76.3%
Taylor expanded in z around inf 45.8%
+-commutative45.8%
Simplified45.8%
*-commutative45.8%
sqrt-prod47.7%
Applied egg-rr47.7%
Final simplification47.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 8.6e-281) (* 2.0 (sqrt (* (+ y z) x))) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 8.6e-281) {
tmp = 2.0 * sqrt(((y + z) * x));
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 (y <= 8.6d-281) then
tmp = 2.0d0 * sqrt(((y + z) * x))
else
tmp = 2.0d0 * (sqrt(z) * sqrt(y))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 8.6e-281) {
tmp = 2.0 * Math.sqrt(((y + z) * x));
} else {
tmp = 2.0 * (Math.sqrt(z) * Math.sqrt(y));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 8.6e-281: tmp = 2.0 * math.sqrt(((y + z) * x)) else: tmp = 2.0 * (math.sqrt(z) * math.sqrt(y)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 8.6e-281) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * x))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 8.6e-281)
tmp = 2.0 * sqrt(((y + z) * x));
else
tmp = 2.0 * (sqrt(z) * sqrt(y));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 8.6e-281], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 8.6 \cdot 10^{-281}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 8.60000000000000047e-281Initial program 70.7%
+-commutative70.7%
associate-+r+70.7%
*-commutative70.7%
+-commutative70.7%
+-commutative70.7%
*-commutative70.7%
*-commutative70.7%
associate-+l+70.7%
+-commutative70.7%
*-commutative70.7%
associate-+l+70.7%
*-commutative70.7%
*-commutative70.7%
+-commutative70.7%
Simplified70.7%
Taylor expanded in x around inf 47.8%
if 8.60000000000000047e-281 < y Initial program 76.3%
+-commutative76.3%
associate-+r+76.3%
*-commutative76.3%
+-commutative76.3%
+-commutative76.3%
*-commutative76.3%
*-commutative76.3%
associate-+l+76.3%
+-commutative76.3%
*-commutative76.3%
associate-+l+76.3%
*-commutative76.3%
*-commutative76.3%
+-commutative76.3%
Simplified76.3%
Taylor expanded in y around inf 69.6%
Taylor expanded in x around 0 24.0%
*-commutative24.0%
Simplified24.0%
sqrt-prod28.2%
Applied egg-rr28.2%
Final simplification38.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -6.2e-279) (* 2.0 (sqrt (* (+ y z) x))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -6.2e-279) {
tmp = 2.0 * sqrt(((y + z) * x));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 (y <= (-6.2d-279)) then
tmp = 2.0d0 * sqrt(((y + z) * x))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -6.2e-279) {
tmp = 2.0 * Math.sqrt(((y + z) * x));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -6.2e-279: tmp = 2.0 * math.sqrt(((y + z) * x)) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -6.2e-279) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * x))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -6.2e-279)
tmp = 2.0 * sqrt(((y + z) * x));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -6.2e-279], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -6.2 \cdot 10^{-279}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -6.1999999999999998e-279Initial program 69.9%
+-commutative69.9%
associate-+r+69.9%
*-commutative69.9%
+-commutative69.9%
+-commutative69.9%
*-commutative69.9%
*-commutative69.9%
associate-+l+69.9%
+-commutative69.9%
*-commutative69.9%
associate-+l+69.9%
*-commutative69.9%
*-commutative69.9%
+-commutative69.9%
Simplified69.9%
Taylor expanded in x around inf 44.5%
if -6.1999999999999998e-279 < y Initial program 76.4%
+-commutative76.4%
associate-+r+76.4%
*-commutative76.4%
+-commutative76.4%
+-commutative76.4%
*-commutative76.4%
*-commutative76.4%
associate-+l+76.4%
+-commutative76.4%
*-commutative76.4%
associate-+l+76.4%
*-commutative76.4%
*-commutative76.4%
+-commutative76.4%
Simplified76.4%
Taylor expanded in x around 0 22.2%
Final simplification32.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2e-273) (* 2.0 (sqrt (* (+ y z) x))) (* 2.0 (sqrt (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -2e-273) {
tmp = 2.0 * sqrt(((y + z) * x));
} else {
tmp = 2.0 * sqrt((z * (y + x)));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 (y <= (-2d-273)) then
tmp = 2.0d0 * sqrt(((y + z) * x))
else
tmp = 2.0d0 * sqrt((z * (y + x)))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -2e-273) {
tmp = 2.0 * Math.sqrt(((y + z) * x));
} else {
tmp = 2.0 * Math.sqrt((z * (y + x)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -2e-273: tmp = 2.0 * math.sqrt(((y + z) * x)) else: tmp = 2.0 * math.sqrt((z * (y + x))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -2e-273) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * x))); else tmp = Float64(2.0 * sqrt(Float64(z * Float64(y + x)))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -2e-273)
tmp = 2.0 * sqrt(((y + z) * x));
else
tmp = 2.0 * sqrt((z * (y + x)));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -2e-273], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -2 \cdot 10^{-273}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -2e-273Initial program 70.0%
+-commutative70.0%
associate-+r+70.0%
*-commutative70.0%
+-commutative70.0%
+-commutative70.0%
*-commutative70.0%
*-commutative70.0%
associate-+l+70.0%
+-commutative70.0%
*-commutative70.0%
associate-+l+70.0%
*-commutative70.0%
*-commutative70.0%
+-commutative70.0%
Simplified70.0%
Taylor expanded in x around inf 44.3%
if -2e-273 < y Initial program 76.3%
+-commutative76.3%
associate-+r+76.3%
*-commutative76.3%
+-commutative76.3%
+-commutative76.3%
*-commutative76.3%
*-commutative76.3%
associate-+l+76.3%
+-commutative76.3%
*-commutative76.3%
associate-+l+76.3%
*-commutative76.3%
*-commutative76.3%
+-commutative76.3%
Simplified76.3%
Taylor expanded in z around inf 48.9%
+-commutative48.9%
Simplified48.9%
Final simplification46.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (* y x) (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt(((y * x) + (z * (y + x))));
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt(((y * x) + (z * (y + x))))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}
\end{array}
Initial program 73.5%
+-commutative73.5%
associate-+r+73.5%
*-commutative73.5%
+-commutative73.5%
+-commutative73.5%
*-commutative73.5%
*-commutative73.5%
associate-+l+73.5%
+-commutative73.5%
*-commutative73.5%
associate-+l+73.5%
*-commutative73.5%
*-commutative73.5%
+-commutative73.5%
Simplified73.5%
Final simplification73.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -6.2e-279) (* 2.0 (sqrt (* y x))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -6.2e-279) {
tmp = 2.0 * sqrt((y * x));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 (y <= (-6.2d-279)) then
tmp = 2.0d0 * sqrt((y * x))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -6.2e-279) {
tmp = 2.0 * Math.sqrt((y * x));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -6.2e-279: tmp = 2.0 * math.sqrt((y * x)) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -6.2e-279) tmp = Float64(2.0 * sqrt(Float64(y * x))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -6.2e-279)
tmp = 2.0 * sqrt((y * x));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -6.2e-279], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -6.2 \cdot 10^{-279}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -6.1999999999999998e-279Initial program 69.9%
+-commutative69.9%
associate-+r+69.9%
*-commutative69.9%
+-commutative69.9%
+-commutative69.9%
*-commutative69.9%
*-commutative69.9%
associate-+l+69.9%
+-commutative69.9%
*-commutative69.9%
associate-+l+69.9%
*-commutative69.9%
*-commutative69.9%
+-commutative69.9%
Simplified69.9%
Taylor expanded in z around 0 25.9%
*-commutative25.9%
Simplified25.9%
if -6.1999999999999998e-279 < y Initial program 76.4%
+-commutative76.4%
associate-+r+76.4%
*-commutative76.4%
+-commutative76.4%
+-commutative76.4%
*-commutative76.4%
*-commutative76.4%
associate-+l+76.4%
+-commutative76.4%
*-commutative76.4%
associate-+l+76.4%
*-commutative76.4%
*-commutative76.4%
+-commutative76.4%
Simplified76.4%
Taylor expanded in x around 0 22.2%
Final simplification23.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (* y x))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt((y * x));
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((y * x))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((y * x));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt((y * x))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(y * x))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt((y * x));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot x}
\end{array}
Initial program 73.5%
+-commutative73.5%
associate-+r+73.5%
*-commutative73.5%
+-commutative73.5%
+-commutative73.5%
*-commutative73.5%
*-commutative73.5%
associate-+l+73.5%
+-commutative73.5%
*-commutative73.5%
associate-+l+73.5%
*-commutative73.5%
*-commutative73.5%
+-commutative73.5%
Simplified73.5%
Taylor expanded in z around 0 27.8%
*-commutative27.8%
Simplified27.8%
Final simplification27.8%
(FPCore (x y z)
:precision binary64
(let* ((t_0
(+
(* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z)))
(* (pow z 0.25) (pow y 0.25)))))
(if (< z 7.636950090573675e+176)
(* 2.0 (sqrt (+ (* (+ x y) z) (* x y))))
(* (* t_0 t_0) 2.0))))
double code(double x, double y, double z) {
double t_0 = (0.25 * ((pow(y, -0.75) * (pow(z, -0.75) * x)) * (y + z))) + (pow(z, 0.25) * pow(y, 0.25));
double tmp;
if (z < 7.636950090573675e+176) {
tmp = 2.0 * sqrt((((x + y) * z) + (x * y)));
} else {
tmp = (t_0 * t_0) * 2.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) :: t_0
real(8) :: tmp
t_0 = (0.25d0 * (((y ** (-0.75d0)) * ((z ** (-0.75d0)) * x)) * (y + z))) + ((z ** 0.25d0) * (y ** 0.25d0))
if (z < 7.636950090573675d+176) then
tmp = 2.0d0 * sqrt((((x + y) * z) + (x * y)))
else
tmp = (t_0 * t_0) * 2.0d0
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double t_0 = (0.25 * ((Math.pow(y, -0.75) * (Math.pow(z, -0.75) * x)) * (y + z))) + (Math.pow(z, 0.25) * Math.pow(y, 0.25));
double tmp;
if (z < 7.636950090573675e+176) {
tmp = 2.0 * Math.sqrt((((x + y) * z) + (x * y)));
} else {
tmp = (t_0 * t_0) * 2.0;
}
return tmp;
}
def code(x, y, z): t_0 = (0.25 * ((math.pow(y, -0.75) * (math.pow(z, -0.75) * x)) * (y + z))) + (math.pow(z, 0.25) * math.pow(y, 0.25)) tmp = 0 if z < 7.636950090573675e+176: tmp = 2.0 * math.sqrt((((x + y) * z) + (x * y))) else: tmp = (t_0 * t_0) * 2.0 return tmp
function code(x, y, z) t_0 = Float64(Float64(0.25 * Float64(Float64((y ^ -0.75) * Float64((z ^ -0.75) * x)) * Float64(y + z))) + Float64((z ^ 0.25) * (y ^ 0.25))) tmp = 0.0 if (z < 7.636950090573675e+176) tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(x + y) * z) + Float64(x * y)))); else tmp = Float64(Float64(t_0 * t_0) * 2.0); end return tmp end
function tmp_2 = code(x, y, z) t_0 = (0.25 * (((y ^ -0.75) * ((z ^ -0.75) * x)) * (y + z))) + ((z ^ 0.25) * (y ^ 0.25)); tmp = 0.0; if (z < 7.636950090573675e+176) tmp = 2.0 * sqrt((((x + y) * z) + (x * y))); else tmp = (t_0 * t_0) * 2.0; end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(N[(0.25 * N[(N[(N[Power[y, -0.75], $MachinePrecision] * N[(N[Power[z, -0.75], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] * N[(y + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Power[z, 0.25], $MachinePrecision] * N[Power[y, 0.25], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[z, 7.636950090573675e+176], N[(2.0 * N[Sqrt[N[(N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * t$95$0), $MachinePrecision] * 2.0), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 0.25 \cdot \left(\left({y}^{-0.75} \cdot \left({z}^{-0.75} \cdot x\right)\right) \cdot \left(y + z\right)\right) + {z}^{0.25} \cdot {y}^{0.25}\\
\mathbf{if}\;z < 7.636950090573675 \cdot 10^{+176}:\\
\;\;\;\;2 \cdot \sqrt{\left(x + y\right) \cdot z + x \cdot y}\\
\mathbf{else}:\\
\;\;\;\;\left(t\_0 \cdot t\_0\right) \cdot 2\\
\end{array}
\end{array}
herbie shell --seed 2024076
(FPCore (x y z)
:name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
:precision binary64
:alt
(if (< z 7.636950090573675e+176) (* 2.0 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25))) (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25)))) 2.0))
(* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))