
(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 12 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
(if (<= y -2.55e+17)
(* 2.0 (pow (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0))
(if (<= y 1.55e-293)
(* 2.0 (sqrt (* x (+ y z))))
(* 2.0 (* (sqrt (+ y x)) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -2.55e+17) {
tmp = 2.0 * pow(exp((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
} else if (y <= 1.55e-293) {
tmp = 2.0 * sqrt((x * (y + z)));
} 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 <= (-2.55d+17)) then
tmp = 2.0d0 * (exp((0.25d0 * (log((-y - z)) - log(((-1.0d0) / x))))) ** 2.0d0)
else if (y <= 1.55d-293) then
tmp = 2.0d0 * sqrt((x * (y + z)))
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 <= -2.55e+17) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log((-y - z)) - Math.log((-1.0 / x))))), 2.0);
} else if (y <= 1.55e-293) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} 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 <= -2.55e+17: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log((-y - z)) - math.log((-1.0 / x))))), 2.0) elif y <= 1.55e-293: tmp = 2.0 * math.sqrt((x * (y + z))) 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 <= -2.55e+17) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0)); elseif (y <= 1.55e-293) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); 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 <= -2.55e+17)
tmp = 2.0 * (exp((0.25 * (log((-y - z)) - log((-1.0 / x))))) ^ 2.0);
elseif (y <= 1.55e-293)
tmp = 2.0 * sqrt((x * (y + z)));
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, -2.55e+17], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.55e-293], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $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 -2.55 \cdot 10^{+17}:\\
\;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\
\mathbf{elif}\;y \leq 1.55 \cdot 10^{-293}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -2.55e17Initial program 52.2%
+-commutative52.2%
*-commutative52.2%
+-commutative52.2%
*-commutative52.2%
associate-+l+52.2%
*-commutative52.2%
*-commutative52.2%
+-commutative52.2%
fma-define52.2%
+-commutative52.2%
distribute-lft-out52.4%
Simplified52.4%
fma-undefine52.3%
+-commutative52.3%
+-commutative52.3%
+-commutative52.3%
distribute-rgt-in52.2%
associate-+l+52.2%
*-commutative52.2%
distribute-lft-in52.3%
+-commutative52.3%
fma-undefine52.6%
add-sqr-sqrt52.3%
pow252.3%
pow1/252.4%
sqrt-pow152.4%
metadata-eval52.4%
Applied egg-rr52.4%
Taylor expanded in x around -inf 40.3%
if -2.55e17 < y < 1.54999999999999991e-293Initial program 86.7%
associate-+l+86.7%
*-commutative86.7%
*-commutative86.7%
*-commutative86.7%
+-commutative86.7%
+-commutative86.7%
associate-+l+86.7%
*-commutative86.7%
*-commutative86.7%
+-commutative86.7%
+-commutative86.7%
*-commutative86.7%
associate-+l+86.7%
*-commutative86.7%
*-commutative86.7%
+-commutative86.7%
Simplified86.7%
Taylor expanded in x around inf 64.0%
+-commutative64.0%
Simplified64.0%
if 1.54999999999999991e-293 < y Initial program 67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
+-commutative67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
+-commutative67.0%
*-commutative67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
Simplified67.0%
Taylor expanded in z around inf 47.3%
*-commutative47.3%
sqrt-prod51.3%
Applied egg-rr51.3%
Final simplification51.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(let* ((t_0 (+ (+ (* y x) (* z x)) (* y z))))
(if (<= t_0 0.0)
(* 2.0 (* (sqrt (fma x (/ y z) (+ y x))) (pow (pow z 0.25) 2.0)))
(if (<= t_0 2e+302)
(* 2.0 (sqrt (fma x y (* z (+ y x)))))
(* 2.0 (* (sqrt z) (sqrt (+ x (+ y (* x (/ y z)))))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = ((y * x) + (z * x)) + (y * z);
double tmp;
if (t_0 <= 0.0) {
tmp = 2.0 * (sqrt(fma(x, (y / z), (y + x))) * pow(pow(z, 0.25), 2.0));
} else if (t_0 <= 2e+302) {
tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt((x + (y + (x * (y / z))))));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = Float64(Float64(Float64(y * x) + Float64(z * x)) + Float64(y * z)) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(2.0 * Float64(sqrt(fma(x, Float64(y / z), Float64(y + x))) * ((z ^ 0.25) ^ 2.0))); elseif (t_0 <= 2e+302) tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(Float64(x + Float64(y + Float64(x * Float64(y / z))))))); end return 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[(N[(N[(y * x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(2.0 * N[(N[Sqrt[N[(x * N[(y / z), $MachinePrecision] + N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Power[N[Power[z, 0.25], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+302], N[(2.0 * N[Sqrt[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[N[(x + N[(y + N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
t_0 := \left(y \cdot x + z \cdot x\right) + y \cdot z\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;2 \cdot \left(\sqrt{\mathsf{fma}\left(x, \frac{y}{z}, y + x\right)} \cdot {\left({z}^{0.25}\right)}^{2}\right)\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+302}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{x + \left(y + x \cdot \frac{y}{z}\right)}\right)\\
\end{array}
\end{array}
if (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 0.0Initial program 5.3%
associate-+l+5.3%
*-commutative5.3%
*-commutative5.3%
*-commutative5.3%
+-commutative5.3%
+-commutative5.3%
associate-+l+5.3%
*-commutative5.3%
*-commutative5.3%
+-commutative5.3%
+-commutative5.3%
*-commutative5.3%
associate-+l+5.3%
*-commutative5.3%
*-commutative5.3%
+-commutative5.3%
Simplified5.3%
add-cbrt-cube5.3%
pow35.3%
+-commutative5.3%
Applied egg-rr5.3%
Taylor expanded in z around inf 5.3%
associate-+r+5.3%
+-commutative5.3%
associate-/l*5.3%
Simplified5.3%
*-commutative5.3%
sqrt-prod99.3%
+-commutative99.3%
fma-define99.3%
Applied egg-rr99.3%
add-sqr-sqrt99.0%
pow299.0%
pow1/299.0%
sqrt-pow199.3%
metadata-eval99.3%
Applied egg-rr99.3%
if 0.0 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 2.0000000000000002e302Initial program 99.8%
+-commutative99.8%
*-commutative99.8%
+-commutative99.8%
*-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
*-commutative99.8%
+-commutative99.8%
fma-define99.8%
+-commutative99.8%
distribute-lft-out99.8%
Simplified99.8%
if 2.0000000000000002e302 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) Initial program 6.4%
associate-+l+6.4%
*-commutative6.4%
*-commutative6.4%
*-commutative6.4%
+-commutative6.4%
+-commutative6.4%
associate-+l+6.4%
*-commutative6.4%
*-commutative6.4%
+-commutative6.4%
+-commutative6.4%
*-commutative6.4%
associate-+l+6.4%
*-commutative6.4%
*-commutative6.4%
+-commutative6.4%
Simplified6.5%
add-cbrt-cube4.4%
pow34.4%
+-commutative4.4%
Applied egg-rr4.4%
Taylor expanded in z around inf 6.7%
associate-+r+6.7%
+-commutative6.7%
associate-/l*7.0%
Simplified7.0%
*-commutative7.0%
sqrt-prod33.8%
+-commutative33.8%
fma-define33.8%
Applied egg-rr33.8%
fma-undefine33.8%
associate-+r+33.8%
Applied egg-rr33.8%
Final simplification78.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -4.6e+17)
(* 2.0 (pow (exp (* 0.25 (- (log (- y)) (log (/ -1.0 x))))) 2.0))
(if (<= y 1.55e-293)
(* 2.0 (sqrt (* x (+ y z))))
(* 2.0 (* (sqrt (+ y x)) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -4.6e+17) {
tmp = 2.0 * pow(exp((0.25 * (log(-y) - log((-1.0 / x))))), 2.0);
} else if (y <= 1.55e-293) {
tmp = 2.0 * sqrt((x * (y + z)));
} 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 <= (-4.6d+17)) then
tmp = 2.0d0 * (exp((0.25d0 * (log(-y) - log(((-1.0d0) / x))))) ** 2.0d0)
else if (y <= 1.55d-293) then
tmp = 2.0d0 * sqrt((x * (y + z)))
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 <= -4.6e+17) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log(-y) - Math.log((-1.0 / x))))), 2.0);
} else if (y <= 1.55e-293) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} 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 <= -4.6e+17: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log(-y) - math.log((-1.0 / x))))), 2.0) elif y <= 1.55e-293: tmp = 2.0 * math.sqrt((x * (y + z))) 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 <= -4.6e+17) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(-y)) - log(Float64(-1.0 / x))))) ^ 2.0)); elseif (y <= 1.55e-293) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); 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 <= -4.6e+17)
tmp = 2.0 * (exp((0.25 * (log(-y) - log((-1.0 / x))))) ^ 2.0);
elseif (y <= 1.55e-293)
tmp = 2.0 * sqrt((x * (y + z)));
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, -4.6e+17], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[(-y)], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.55e-293], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $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 -4.6 \cdot 10^{+17}:\\
\;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\
\mathbf{elif}\;y \leq 1.55 \cdot 10^{-293}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -4.6e17Initial program 52.2%
+-commutative52.2%
*-commutative52.2%
+-commutative52.2%
*-commutative52.2%
associate-+l+52.2%
*-commutative52.2%
*-commutative52.2%
+-commutative52.2%
fma-define52.2%
+-commutative52.2%
distribute-lft-out52.4%
Simplified52.4%
fma-undefine52.3%
+-commutative52.3%
+-commutative52.3%
+-commutative52.3%
distribute-rgt-in52.2%
associate-+l+52.2%
*-commutative52.2%
distribute-lft-in52.3%
+-commutative52.3%
fma-undefine52.6%
add-sqr-sqrt52.3%
pow252.3%
pow1/252.4%
sqrt-pow152.4%
metadata-eval52.4%
Applied egg-rr52.4%
Taylor expanded in z around 0 24.8%
*-lft-identity24.8%
*-commutative24.8%
Simplified24.8%
Taylor expanded in x around -inf 39.5%
if -4.6e17 < y < 1.54999999999999991e-293Initial program 86.7%
associate-+l+86.7%
*-commutative86.7%
*-commutative86.7%
*-commutative86.7%
+-commutative86.7%
+-commutative86.7%
associate-+l+86.7%
*-commutative86.7%
*-commutative86.7%
+-commutative86.7%
+-commutative86.7%
*-commutative86.7%
associate-+l+86.7%
*-commutative86.7%
*-commutative86.7%
+-commutative86.7%
Simplified86.7%
Taylor expanded in x around inf 64.0%
+-commutative64.0%
Simplified64.0%
if 1.54999999999999991e-293 < y Initial program 67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
+-commutative67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
+-commutative67.0%
*-commutative67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
Simplified67.0%
Taylor expanded in z around inf 47.3%
*-commutative47.3%
sqrt-prod51.3%
Applied egg-rr51.3%
Final simplification51.0%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(let* ((t_0 (+ (+ (* y x) (* z x)) (* y z))))
(if (<= t_0 0.0)
(* 2.0 (* (sqrt (+ y x)) (sqrt z)))
(if (<= t_0 2e+302)
(* 2.0 (sqrt (fma x y (* z (+ y x)))))
(* 2.0 (* (sqrt z) (sqrt (+ x (+ y (* x (/ y z)))))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = ((y * x) + (z * x)) + (y * z);
double tmp;
if (t_0 <= 0.0) {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
} else if (t_0 <= 2e+302) {
tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt((x + (y + (x * (y / z))))));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = Float64(Float64(Float64(y * x) + Float64(z * x)) + Float64(y * z)) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); elseif (t_0 <= 2e+302) tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(Float64(x + Float64(y + Float64(x * Float64(y / z))))))); end return 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[(N[(N[(y * x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+302], N[(2.0 * N[Sqrt[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[N[(x + N[(y + N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
t_0 := \left(y \cdot x + z \cdot x\right) + y \cdot z\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+302}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{x + \left(y + x \cdot \frac{y}{z}\right)}\right)\\
\end{array}
\end{array}
if (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 0.0Initial program 5.3%
associate-+l+5.3%
*-commutative5.3%
*-commutative5.3%
*-commutative5.3%
+-commutative5.3%
+-commutative5.3%
associate-+l+5.3%
*-commutative5.3%
*-commutative5.3%
+-commutative5.3%
+-commutative5.3%
*-commutative5.3%
associate-+l+5.3%
*-commutative5.3%
*-commutative5.3%
+-commutative5.3%
Simplified5.3%
Taylor expanded in z around inf 5.3%
*-commutative5.3%
sqrt-prod78.1%
Applied egg-rr78.1%
if 0.0 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 2.0000000000000002e302Initial program 99.8%
+-commutative99.8%
*-commutative99.8%
+-commutative99.8%
*-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
*-commutative99.8%
+-commutative99.8%
fma-define99.8%
+-commutative99.8%
distribute-lft-out99.8%
Simplified99.8%
if 2.0000000000000002e302 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) Initial program 6.4%
associate-+l+6.4%
*-commutative6.4%
*-commutative6.4%
*-commutative6.4%
+-commutative6.4%
+-commutative6.4%
associate-+l+6.4%
*-commutative6.4%
*-commutative6.4%
+-commutative6.4%
+-commutative6.4%
*-commutative6.4%
associate-+l+6.4%
*-commutative6.4%
*-commutative6.4%
+-commutative6.4%
Simplified6.5%
add-cbrt-cube4.4%
pow34.4%
+-commutative4.4%
Applied egg-rr4.4%
Taylor expanded in z around inf 6.7%
associate-+r+6.7%
+-commutative6.7%
associate-/l*7.0%
Simplified7.0%
*-commutative7.0%
sqrt-prod33.8%
+-commutative33.8%
fma-define33.8%
Applied egg-rr33.8%
fma-undefine33.8%
associate-+r+33.8%
Applied egg-rr33.8%
Final simplification78.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.55e-293) (* 2.0 (sqrt (* x (+ y z)))) (* 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.55e-293) {
tmp = 2.0 * sqrt((x * (y + z)));
} 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 <= 1.55d-293) then
tmp = 2.0d0 * sqrt((x * (y + z)))
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 <= 1.55e-293) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} 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 <= 1.55e-293: tmp = 2.0 * math.sqrt((x * (y + z))) 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 <= 1.55e-293) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); 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 <= 1.55e-293)
tmp = 2.0 * sqrt((x * (y + z)));
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, 1.55e-293], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $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.55 \cdot 10^{-293}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 1.54999999999999991e-293Initial program 68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
+-commutative68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
+-commutative68.2%
*-commutative68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
Simplified68.2%
Taylor expanded in x around inf 43.8%
+-commutative43.8%
Simplified43.8%
if 1.54999999999999991e-293 < y Initial program 67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
+-commutative67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
+-commutative67.0%
*-commutative67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
Simplified67.0%
Taylor expanded in z around inf 47.3%
*-commutative47.3%
sqrt-prod51.3%
Applied egg-rr51.3%
Final simplification47.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.05e-279) (* 2.0 (sqrt (* x (+ y (+ z (* z (/ y x))))))) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.05e-279) {
tmp = 2.0 * sqrt((x * (y + (z + (z * (y / 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 <= 1.05d-279) then
tmp = 2.0d0 * sqrt((x * (y + (z + (z * (y / 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 <= 1.05e-279) {
tmp = 2.0 * Math.sqrt((x * (y + (z + (z * (y / 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 <= 1.05e-279: tmp = 2.0 * math.sqrt((x * (y + (z + (z * (y / 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 <= 1.05e-279) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + Float64(z + Float64(z * Float64(y / 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 <= 1.05e-279)
tmp = 2.0 * sqrt((x * (y + (z + (z * (y / 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, 1.05e-279], N[(2.0 * N[Sqrt[N[(x * N[(y + N[(z + N[(z * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 1.05 \cdot 10^{-279}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + \left(z + z \cdot \frac{y}{x}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 1.05000000000000003e-279Initial program 69.1%
+-commutative69.1%
*-commutative69.1%
+-commutative69.1%
*-commutative69.1%
associate-+l+69.1%
*-commutative69.1%
*-commutative69.1%
+-commutative69.1%
fma-define69.1%
+-commutative69.1%
distribute-lft-out69.2%
Simplified69.2%
Taylor expanded in x around inf 61.2%
*-commutative61.2%
associate-/l*57.3%
Simplified57.3%
if 1.05000000000000003e-279 < y Initial program 65.8%
associate-+l+65.8%
*-commutative65.8%
*-commutative65.8%
*-commutative65.8%
+-commutative65.8%
+-commutative65.8%
associate-+l+65.8%
*-commutative65.8%
*-commutative65.8%
+-commutative65.8%
+-commutative65.8%
*-commutative65.8%
associate-+l+65.8%
*-commutative65.8%
*-commutative65.8%
+-commutative65.8%
Simplified65.8%
Taylor expanded in x around 0 28.2%
*-commutative28.2%
Simplified28.2%
sqrt-prod41.1%
Applied egg-rr41.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.55e-293) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* z (* y (+ 1.0 (/ x y))))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.55e-293) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * sqrt((z * (y * (1.0 + (x / 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 <= 1.55d-293) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * sqrt((z * (y * (1.0d0 + (x / 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 <= 1.55e-293) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * Math.sqrt((z * (y * (1.0 + (x / y)))));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 1.55e-293: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * math.sqrt((z * (y * (1.0 + (x / y))))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.55e-293) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * sqrt(Float64(z * Float64(y * Float64(1.0 + Float64(x / 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 <= 1.55e-293)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * sqrt((z * (y * (1.0 + (x / 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, 1.55e-293], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * N[(y * N[(1.0 + N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.55 \cdot 10^{-293}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y \cdot \left(1 + \frac{x}{y}\right)\right)}\\
\end{array}
\end{array}
if y < 1.54999999999999991e-293Initial program 68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
+-commutative68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
+-commutative68.2%
*-commutative68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
Simplified68.2%
Taylor expanded in x around inf 43.8%
+-commutative43.8%
Simplified43.8%
if 1.54999999999999991e-293 < y Initial program 67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
+-commutative67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
+-commutative67.0%
*-commutative67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
Simplified67.0%
Taylor expanded in z around inf 47.3%
Taylor expanded in y around inf 40.8%
Final simplification42.4%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1e-304) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1e-304) {
tmp = 2.0 * sqrt((x * (y + z)));
} 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 <= (-1d-304)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
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 <= -1e-304) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} 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 <= -1e-304: tmp = 2.0 * math.sqrt((x * (y + z))) 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 <= -1e-304) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); 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 <= -1e-304)
tmp = 2.0 * sqrt((x * (y + z)));
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, -1e-304], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $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 -1 \cdot 10^{-304}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -9.99999999999999971e-305Initial program 67.3%
associate-+l+67.3%
*-commutative67.3%
*-commutative67.3%
*-commutative67.3%
+-commutative67.3%
+-commutative67.3%
associate-+l+67.3%
*-commutative67.3%
*-commutative67.3%
+-commutative67.3%
+-commutative67.3%
*-commutative67.3%
associate-+l+67.3%
*-commutative67.3%
*-commutative67.3%
+-commutative67.3%
Simplified67.3%
Taylor expanded in x around inf 42.1%
+-commutative42.1%
Simplified42.1%
if -9.99999999999999971e-305 < y Initial program 68.1%
associate-+l+68.1%
*-commutative68.1%
*-commutative68.1%
*-commutative68.1%
+-commutative68.1%
+-commutative68.1%
associate-+l+68.1%
*-commutative68.1%
*-commutative68.1%
+-commutative68.1%
+-commutative68.1%
*-commutative68.1%
associate-+l+68.1%
*-commutative68.1%
*-commutative68.1%
+-commutative68.1%
Simplified68.1%
Taylor expanded in z around inf 49.0%
Final simplification45.4%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.55e-293) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.55e-293) {
tmp = 2.0 * sqrt((x * (y + z)));
} 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 <= 1.55d-293) then
tmp = 2.0d0 * sqrt((x * (y + z)))
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 <= 1.55e-293) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} 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 <= 1.55e-293: tmp = 2.0 * math.sqrt((x * (y + z))) 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 <= 1.55e-293) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); 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 <= 1.55e-293)
tmp = 2.0 * sqrt((x * (y + z)));
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, 1.55e-293], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $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 1.55 \cdot 10^{-293}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < 1.54999999999999991e-293Initial program 68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
+-commutative68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
+-commutative68.2%
*-commutative68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
Simplified68.2%
Taylor expanded in x around inf 43.8%
+-commutative43.8%
Simplified43.8%
if 1.54999999999999991e-293 < y Initial program 67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
+-commutative67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
+-commutative67.0%
*-commutative67.0%
associate-+l+67.0%
*-commutative67.0%
*-commutative67.0%
+-commutative67.0%
Simplified67.0%
Taylor expanded in x around 0 26.8%
*-commutative26.8%
Simplified26.8%
Final simplification35.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) (* 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 67.7%
associate-+l+67.7%
*-commutative67.7%
*-commutative67.7%
*-commutative67.7%
+-commutative67.7%
+-commutative67.7%
associate-+l+67.7%
*-commutative67.7%
*-commutative67.7%
+-commutative67.7%
+-commutative67.7%
*-commutative67.7%
associate-+l+67.7%
*-commutative67.7%
*-commutative67.7%
+-commutative67.7%
Simplified67.7%
Final simplification67.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2e-310) (* 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 <= -2e-310) {
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 <= (-2d-310)) 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 <= -2e-310) {
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 <= -2e-310: 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 <= -2e-310) 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 <= -2e-310)
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, -2e-310], 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 -2 \cdot 10^{-310}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -1.999999999999994e-310Initial program 67.3%
associate-+l+67.3%
*-commutative67.3%
*-commutative67.3%
*-commutative67.3%
+-commutative67.3%
+-commutative67.3%
associate-+l+67.3%
*-commutative67.3%
*-commutative67.3%
+-commutative67.3%
+-commutative67.3%
*-commutative67.3%
associate-+l+67.3%
*-commutative67.3%
*-commutative67.3%
+-commutative67.3%
Simplified67.3%
Taylor expanded in z around 0 25.5%
if -1.999999999999994e-310 < y Initial program 68.1%
associate-+l+68.1%
*-commutative68.1%
*-commutative68.1%
*-commutative68.1%
+-commutative68.1%
+-commutative68.1%
associate-+l+68.1%
*-commutative68.1%
*-commutative68.1%
+-commutative68.1%
+-commutative68.1%
*-commutative68.1%
associate-+l+68.1%
*-commutative68.1%
*-commutative68.1%
+-commutative68.1%
Simplified68.1%
Taylor expanded in x around 0 26.1%
*-commutative26.1%
Simplified26.1%
Final simplification25.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))))
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 67.7%
associate-+l+67.7%
*-commutative67.7%
*-commutative67.7%
*-commutative67.7%
+-commutative67.7%
+-commutative67.7%
associate-+l+67.7%
*-commutative67.7%
*-commutative67.7%
+-commutative67.7%
+-commutative67.7%
*-commutative67.7%
associate-+l+67.7%
*-commutative67.7%
*-commutative67.7%
+-commutative67.7%
Simplified67.7%
Taylor expanded in z around 0 23.6%
Final simplification23.6%
(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 2024153
(FPCore (x y z)
:name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
:precision binary64
:alt
(! :herbie-platform default (if (< z 763695009057367500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* 2 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4))) (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4)))) 2)))
(* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))