
(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 -25000000000000.0)
(*
y
(-
(* (* z x) (sqrt (/ 1.0 (* (+ z x) (pow y 3.0)))))
(* 2.0 (sqrt (/ (+ z x) y)))))
(if (<= y 9.2e+30)
(* 2.0 (sqrt (+ (* x (+ y z)) (* y z))))
(* z (+ (* 2.0 (sqrt (/ (+ y x) z))) (* y (sqrt (/ x (pow z 3.0)))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -25000000000000.0) {
tmp = y * (((z * x) * sqrt((1.0 / ((z + x) * pow(y, 3.0))))) - (2.0 * sqrt(((z + x) / y))));
} else if (y <= 9.2e+30) {
tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
} else {
tmp = z * ((2.0 * sqrt(((y + x) / z))) + (y * sqrt((x / pow(z, 3.0)))));
}
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 <= (-25000000000000.0d0)) then
tmp = y * (((z * x) * sqrt((1.0d0 / ((z + x) * (y ** 3.0d0))))) - (2.0d0 * sqrt(((z + x) / y))))
else if (y <= 9.2d+30) then
tmp = 2.0d0 * sqrt(((x * (y + z)) + (y * z)))
else
tmp = z * ((2.0d0 * sqrt(((y + x) / z))) + (y * sqrt((x / (z ** 3.0d0)))))
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 <= -25000000000000.0) {
tmp = y * (((z * x) * Math.sqrt((1.0 / ((z + x) * Math.pow(y, 3.0))))) - (2.0 * Math.sqrt(((z + x) / y))));
} else if (y <= 9.2e+30) {
tmp = 2.0 * Math.sqrt(((x * (y + z)) + (y * z)));
} else {
tmp = z * ((2.0 * Math.sqrt(((y + x) / z))) + (y * Math.sqrt((x / Math.pow(z, 3.0)))));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -25000000000000.0: tmp = y * (((z * x) * math.sqrt((1.0 / ((z + x) * math.pow(y, 3.0))))) - (2.0 * math.sqrt(((z + x) / y)))) elif y <= 9.2e+30: tmp = 2.0 * math.sqrt(((x * (y + z)) + (y * z))) else: tmp = z * ((2.0 * math.sqrt(((y + x) / z))) + (y * math.sqrt((x / math.pow(z, 3.0))))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -25000000000000.0) tmp = Float64(y * Float64(Float64(Float64(z * x) * sqrt(Float64(1.0 / Float64(Float64(z + x) * (y ^ 3.0))))) - Float64(2.0 * sqrt(Float64(Float64(z + x) / y))))); elseif (y <= 9.2e+30) tmp = Float64(2.0 * sqrt(Float64(Float64(x * Float64(y + z)) + Float64(y * z)))); else tmp = Float64(z * Float64(Float64(2.0 * sqrt(Float64(Float64(y + x) / z))) + Float64(y * sqrt(Float64(x / (z ^ 3.0)))))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -25000000000000.0)
tmp = y * (((z * x) * sqrt((1.0 / ((z + x) * (y ^ 3.0))))) - (2.0 * sqrt(((z + x) / y))));
elseif (y <= 9.2e+30)
tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
else
tmp = z * ((2.0 * sqrt(((y + x) / z))) + (y * sqrt((x / (z ^ 3.0)))));
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, -25000000000000.0], N[(y * N[(N[(N[(z * x), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(N[(z + x), $MachinePrecision] * N[Power[y, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(2.0 * N[Sqrt[N[(N[(z + x), $MachinePrecision] / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 9.2e+30], N[(2.0 * N[Sqrt[N[(N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(z * N[(N[(2.0 * N[Sqrt[N[(N[(y + x), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(y * N[Sqrt[N[(x / N[Power[z, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -25000000000000:\\
\;\;\;\;y \cdot \left(\left(z \cdot x\right) \cdot \sqrt{\frac{1}{\left(z + x\right) \cdot {y}^{3}}} - 2 \cdot \sqrt{\frac{z + x}{y}}\right)\\
\mathbf{elif}\;y \leq 9.2 \cdot 10^{+30}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right) + y \cdot z}\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(2 \cdot \sqrt{\frac{y + x}{z}} + y \cdot \sqrt{\frac{x}{{z}^{3}}}\right)\\
\end{array}
\end{array}
if y < -2.5e13Initial program 61.8%
+-commutative61.8%
associate-+r+61.8%
*-commutative61.8%
+-commutative61.8%
+-commutative61.8%
*-commutative61.8%
*-commutative61.8%
associate-+l+61.8%
+-commutative61.8%
*-commutative61.8%
associate-+l+61.8%
*-commutative61.8%
*-commutative61.8%
+-commutative61.8%
Simplified61.8%
Taylor expanded in y around inf 1.0%
Taylor expanded in y around -inf 0.0%
unpow20.0%
rem-square-sqrt77.0%
Simplified77.0%
if -2.5e13 < y < 9.2e30Initial program 79.9%
distribute-lft-out79.9%
*-commutative79.9%
Applied egg-rr79.9%
if 9.2e30 < y Initial program 54.0%
+-commutative54.0%
associate-+r+54.0%
*-commutative54.0%
+-commutative54.0%
+-commutative54.0%
*-commutative54.0%
*-commutative54.0%
associate-+l+54.0%
+-commutative54.0%
*-commutative54.0%
associate-+l+54.0%
*-commutative54.0%
*-commutative54.0%
+-commutative54.0%
Simplified54.0%
Taylor expanded in z around inf 35.5%
Taylor expanded in x around inf 37.6%
Final simplification68.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.1e-284) (* 2.0 (pow (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0)) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.1e-284) {
tmp = 2.0 * pow(exp((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
} 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.1d-284) then
tmp = 2.0d0 * (exp((0.25d0 * (log((-y - z)) - log(((-1.0d0) / x))))) ** 2.0d0)
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.1e-284) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log((-y - z)) - Math.log((-1.0 / x))))), 2.0);
} 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.1e-284: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log((-y - z)) - math.log((-1.0 / x))))), 2.0) 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.1e-284) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0)); 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.1e-284)
tmp = 2.0 * (exp((0.25 * (log((-y - z)) - log((-1.0 / x))))) ^ 2.0);
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.1e-284], 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], 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.1 \cdot 10^{-284}:\\
\;\;\;\;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{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 1.1e-284Initial program 70.1%
+-commutative70.1%
associate-+r+70.1%
*-commutative70.1%
+-commutative70.1%
associate-+l+70.1%
*-commutative70.1%
*-commutative70.1%
*-commutative70.1%
fma-define70.1%
+-commutative70.1%
distribute-lft-out70.2%
Simplified70.2%
fma-undefine70.1%
distribute-rgt-in70.1%
associate-+l+70.1%
add-sqr-sqrt69.7%
pow269.7%
pow1/269.7%
sqrt-pow169.7%
associate-+l+69.7%
distribute-rgt-in69.7%
fma-undefine69.8%
metadata-eval69.8%
Applied egg-rr69.8%
Taylor expanded in x around -inf 48.1%
if 1.1e-284 < y Initial program 66.7%
+-commutative66.7%
associate-+r+66.7%
*-commutative66.7%
+-commutative66.7%
+-commutative66.7%
*-commutative66.7%
*-commutative66.7%
associate-+l+66.7%
+-commutative66.7%
*-commutative66.7%
associate-+l+66.7%
*-commutative66.7%
*-commutative66.7%
+-commutative66.7%
Simplified66.8%
Taylor expanded in x around 0 25.5%
*-commutative25.5%
Simplified25.5%
sqrt-prod34.6%
Applied egg-rr34.6%
Final simplification41.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.9e+30) (* 2.0 (sqrt (fma x z (* y (+ z x))))) (* z (+ (* 2.0 (sqrt (/ (+ y x) z))) (* y (sqrt (/ x (pow z 3.0))))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.9e+30) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = z * ((2.0 * sqrt(((y + x) / z))) + (y * sqrt((x / pow(z, 3.0)))));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.9e+30) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(z * Float64(Float64(2.0 * sqrt(Float64(Float64(y + x) / z))) + Float64(y * sqrt(Float64(x / (z ^ 3.0)))))); 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.9e+30], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(z * N[(N[(2.0 * N[Sqrt[N[(N[(y + x), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(y * N[Sqrt[N[(x / N[Power[z, 3.0], $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.9 \cdot 10^{+30}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(2 \cdot \sqrt{\frac{y + x}{z}} + y \cdot \sqrt{\frac{x}{{z}^{3}}}\right)\\
\end{array}
\end{array}
if y < 1.9000000000000001e30Initial program 73.2%
associate-+l+73.2%
*-commutative73.2%
*-commutative73.2%
*-commutative73.2%
+-commutative73.2%
+-commutative73.2%
+-commutative73.2%
*-commutative73.2%
*-commutative73.2%
associate-+l+73.2%
+-commutative73.2%
fma-define73.2%
distribute-lft-out73.2%
Simplified73.2%
if 1.9000000000000001e30 < y Initial program 54.0%
+-commutative54.0%
associate-+r+54.0%
*-commutative54.0%
+-commutative54.0%
+-commutative54.0%
*-commutative54.0%
*-commutative54.0%
associate-+l+54.0%
+-commutative54.0%
*-commutative54.0%
associate-+l+54.0%
*-commutative54.0%
*-commutative54.0%
+-commutative54.0%
Simplified54.0%
Taylor expanded in z around inf 35.5%
Taylor expanded in x around inf 37.6%
Final simplification64.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 6.5e+30) (* 2.0 (sqrt (fma x z (* y (+ z x))))) (* y (+ (* 2.0 (sqrt (/ (+ z x) y))) (* x (sqrt (/ z (pow y 3.0))))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 6.5e+30) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = y * ((2.0 * sqrt(((z + x) / y))) + (x * sqrt((z / pow(y, 3.0)))));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 6.5e+30) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(y * Float64(Float64(2.0 * sqrt(Float64(Float64(z + x) / y))) + Float64(x * sqrt(Float64(z / (y ^ 3.0)))))); 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, 6.5e+30], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(y * N[(N[(2.0 * N[Sqrt[N[(N[(z + x), $MachinePrecision] / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(x * N[Sqrt[N[(z / N[Power[y, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 6.5 \cdot 10^{+30}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(2 \cdot \sqrt{\frac{z + x}{y}} + x \cdot \sqrt{\frac{z}{{y}^{3}}}\right)\\
\end{array}
\end{array}
if y < 6.5e30Initial program 73.2%
associate-+l+73.2%
*-commutative73.2%
*-commutative73.2%
*-commutative73.2%
+-commutative73.2%
+-commutative73.2%
+-commutative73.2%
*-commutative73.2%
*-commutative73.2%
associate-+l+73.2%
+-commutative73.2%
fma-define73.2%
distribute-lft-out73.2%
Simplified73.2%
if 6.5e30 < y Initial program 54.0%
+-commutative54.0%
associate-+r+54.0%
*-commutative54.0%
+-commutative54.0%
+-commutative54.0%
*-commutative54.0%
*-commutative54.0%
associate-+l+54.0%
+-commutative54.0%
*-commutative54.0%
associate-+l+54.0%
*-commutative54.0%
*-commutative54.0%
+-commutative54.0%
Simplified54.0%
Taylor expanded in y around inf 70.6%
Taylor expanded in x around 0 76.3%
Final simplification73.9%
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+38) (* 2.0 (sqrt (fma x z (* 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 <= 1.05e+38) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.05e+38) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); 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.05e+38], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $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^{+38}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 1.05e38Initial program 73.4%
associate-+l+73.4%
*-commutative73.4%
*-commutative73.4%
*-commutative73.4%
+-commutative73.4%
+-commutative73.4%
+-commutative73.4%
*-commutative73.4%
*-commutative73.4%
associate-+l+73.4%
+-commutative73.4%
fma-define73.4%
distribute-lft-out73.5%
Simplified73.5%
if 1.05e38 < y Initial program 52.4%
+-commutative52.4%
associate-+r+52.4%
*-commutative52.4%
+-commutative52.4%
+-commutative52.4%
*-commutative52.4%
*-commutative52.4%
associate-+l+52.4%
+-commutative52.4%
*-commutative52.4%
associate-+l+52.4%
*-commutative52.4%
*-commutative52.4%
+-commutative52.4%
Simplified52.5%
Taylor expanded in x around 0 21.6%
*-commutative21.6%
Simplified21.6%
sqrt-prod39.8%
Applied egg-rr39.8%
Final simplification65.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.3e+38) (* 2.0 (sqrt (+ (* x (+ y z)) (* y z)))) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.3e+38) {
tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
} 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.3d+38) then
tmp = 2.0d0 * sqrt(((x * (y + z)) + (y * z)))
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.3e+38) {
tmp = 2.0 * Math.sqrt(((x * (y + z)) + (y * z)));
} 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.3e+38: tmp = 2.0 * math.sqrt(((x * (y + z)) + (y * z))) 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.3e+38) tmp = Float64(2.0 * sqrt(Float64(Float64(x * Float64(y + z)) + Float64(y * z)))); 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.3e+38)
tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
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.3e+38], N[(2.0 * N[Sqrt[N[(N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $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.3 \cdot 10^{+38}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right) + y \cdot z}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 1.3e38Initial program 73.4%
distribute-lft-out73.4%
*-commutative73.4%
Applied egg-rr73.4%
if 1.3e38 < y Initial program 52.4%
+-commutative52.4%
associate-+r+52.4%
*-commutative52.4%
+-commutative52.4%
+-commutative52.4%
*-commutative52.4%
*-commutative52.4%
associate-+l+52.4%
+-commutative52.4%
*-commutative52.4%
associate-+l+52.4%
*-commutative52.4%
*-commutative52.4%
+-commutative52.4%
Simplified52.5%
Taylor expanded in x around 0 21.6%
*-commutative21.6%
Simplified21.6%
sqrt-prod39.8%
Applied egg-rr39.8%
Final simplification65.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1.6e-252) (* 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 <= -1.6e-252) {
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 <= (-1.6d-252)) 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 <= -1.6e-252) {
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 <= -1.6e-252: 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 <= -1.6e-252) 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 <= -1.6e-252)
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, -1.6e-252], 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.6 \cdot 10^{-252}:\\
\;\;\;\;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 < -1.6000000000000001e-252Initial program 68.8%
+-commutative68.8%
associate-+r+68.8%
*-commutative68.8%
+-commutative68.8%
+-commutative68.8%
*-commutative68.8%
*-commutative68.8%
associate-+l+68.8%
+-commutative68.8%
*-commutative68.8%
associate-+l+68.8%
*-commutative68.8%
*-commutative68.8%
+-commutative68.8%
Simplified68.8%
Taylor expanded in x around inf 44.8%
+-commutative44.8%
Simplified44.8%
if -1.6000000000000001e-252 < y Initial program 68.3%
+-commutative68.3%
associate-+r+68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
*-commutative68.3%
*-commutative68.3%
associate-+l+68.3%
+-commutative68.3%
*-commutative68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
Simplified68.4%
Taylor expanded in z around inf 44.7%
Final simplification44.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1.6e-252) (* 2.0 (sqrt (* x (+ y z)))) (sqrt (* y (* z 4.0)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1.6e-252) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = sqrt((y * (z * 4.0)));
}
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.6d-252)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = sqrt((y * (z * 4.0d0)))
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.6e-252) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = Math.sqrt((y * (z * 4.0)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1.6e-252: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = math.sqrt((y * (z * 4.0))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1.6e-252) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = sqrt(Float64(y * Float64(z * 4.0))); 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.6e-252)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = sqrt((y * (z * 4.0)));
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.6e-252], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(y * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.6 \cdot 10^{-252}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{y \cdot \left(z \cdot 4\right)}\\
\end{array}
\end{array}
if y < -1.6000000000000001e-252Initial program 68.8%
+-commutative68.8%
associate-+r+68.8%
*-commutative68.8%
+-commutative68.8%
+-commutative68.8%
*-commutative68.8%
*-commutative68.8%
associate-+l+68.8%
+-commutative68.8%
*-commutative68.8%
associate-+l+68.8%
*-commutative68.8%
*-commutative68.8%
+-commutative68.8%
Simplified68.8%
Taylor expanded in x around inf 44.8%
+-commutative44.8%
Simplified44.8%
if -1.6000000000000001e-252 < y Initial program 68.3%
+-commutative68.3%
associate-+r+68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
*-commutative68.3%
*-commutative68.3%
associate-+l+68.3%
+-commutative68.3%
*-commutative68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
Simplified68.4%
Taylor expanded in x around 0 22.5%
*-commutative22.5%
Simplified22.5%
add-sqr-sqrt22.4%
sqrt-unprod22.5%
metadata-eval22.5%
metadata-eval22.5%
sqrt-pow222.3%
*-commutative22.3%
metadata-eval22.3%
metadata-eval22.3%
sqrt-pow222.2%
*-commutative22.2%
swap-sqr22.2%
add-sqr-sqrt22.2%
*-commutative22.2%
sqrt-pow222.3%
metadata-eval22.3%
metadata-eval22.3%
sqrt-pow222.5%
metadata-eval22.5%
metadata-eval22.5%
metadata-eval22.5%
Applied egg-rr22.5%
associate-*l*22.5%
Simplified22.5%
Final simplification32.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (* x (+ y z)) (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt(((x * (y + z)) + (y * z)));
}
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(((x * (y + z)) + (y * z)))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt(((x * (y + z)) + (y * z)));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt(((x * (y + z)) + (y * z)))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(x * Float64(y + z)) + Float64(y * z)))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
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[(x * N[(y + z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{x \cdot \left(y + z\right) + y \cdot z}
\end{array}
Initial program 68.5%
distribute-lft-out68.5%
*-commutative68.5%
Applied egg-rr68.5%
Final simplification68.5%
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 68.5%
+-commutative68.5%
associate-+r+68.5%
*-commutative68.5%
+-commutative68.5%
+-commutative68.5%
*-commutative68.5%
*-commutative68.5%
associate-+l+68.5%
+-commutative68.5%
*-commutative68.5%
associate-+l+68.5%
*-commutative68.5%
*-commutative68.5%
+-commutative68.5%
Simplified68.5%
Final simplification68.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -7.6e-268) (* 2.0 (sqrt (* y x))) (sqrt (* y (* z 4.0)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -7.6e-268) {
tmp = 2.0 * sqrt((y * x));
} else {
tmp = sqrt((y * (z * 4.0)));
}
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 <= (-7.6d-268)) then
tmp = 2.0d0 * sqrt((y * x))
else
tmp = sqrt((y * (z * 4.0d0)))
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 <= -7.6e-268) {
tmp = 2.0 * Math.sqrt((y * x));
} else {
tmp = Math.sqrt((y * (z * 4.0)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -7.6e-268: tmp = 2.0 * math.sqrt((y * x)) else: tmp = math.sqrt((y * (z * 4.0))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -7.6e-268) tmp = Float64(2.0 * sqrt(Float64(y * x))); else tmp = sqrt(Float64(y * Float64(z * 4.0))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -7.6e-268)
tmp = 2.0 * sqrt((y * x));
else
tmp = sqrt((y * (z * 4.0)));
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, -7.6e-268], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(y * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -7.6 \cdot 10^{-268}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{y \cdot \left(z \cdot 4\right)}\\
\end{array}
\end{array}
if y < -7.6000000000000005e-268Initial program 69.0%
+-commutative69.0%
associate-+r+69.0%
*-commutative69.0%
+-commutative69.0%
+-commutative69.0%
*-commutative69.0%
*-commutative69.0%
associate-+l+69.0%
+-commutative69.0%
*-commutative69.0%
associate-+l+69.0%
*-commutative69.0%
*-commutative69.0%
+-commutative69.0%
Simplified69.0%
Taylor expanded in z around 0 32.3%
if -7.6000000000000005e-268 < y Initial program 68.1%
+-commutative68.1%
associate-+r+68.1%
*-commutative68.1%
+-commutative68.1%
+-commutative68.1%
*-commutative68.1%
*-commutative68.1%
associate-+l+68.1%
+-commutative68.1%
*-commutative68.1%
associate-+l+68.1%
*-commutative68.1%
*-commutative68.1%
+-commutative68.1%
Simplified68.1%
Taylor expanded in x around 0 23.2%
*-commutative23.2%
Simplified23.2%
add-sqr-sqrt23.1%
sqrt-unprod23.2%
metadata-eval23.2%
metadata-eval23.2%
sqrt-pow222.9%
*-commutative22.9%
metadata-eval22.9%
metadata-eval22.9%
sqrt-pow222.8%
*-commutative22.8%
swap-sqr22.8%
add-sqr-sqrt22.8%
*-commutative22.8%
sqrt-pow223.0%
metadata-eval23.0%
metadata-eval23.0%
sqrt-pow223.2%
metadata-eval23.2%
metadata-eval23.2%
metadata-eval23.2%
Applied egg-rr23.2%
associate-*l*23.2%
Simplified23.2%
Final simplification27.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (sqrt (* y (* z 4.0))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return sqrt((y * (z * 4.0)));
}
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 = sqrt((y * (z * 4.0d0)))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return Math.sqrt((y * (z * 4.0)));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return math.sqrt((y * (z * 4.0)))
x, y, z = sort([x, y, z]) function code(x, y, z) return sqrt(Float64(y * Float64(z * 4.0))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = sqrt((y * (z * 4.0)));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[Sqrt[N[(y * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\sqrt{y \cdot \left(z \cdot 4\right)}
\end{array}
Initial program 68.5%
+-commutative68.5%
associate-+r+68.5%
*-commutative68.5%
+-commutative68.5%
+-commutative68.5%
*-commutative68.5%
*-commutative68.5%
associate-+l+68.5%
+-commutative68.5%
*-commutative68.5%
associate-+l+68.5%
*-commutative68.5%
*-commutative68.5%
+-commutative68.5%
Simplified68.5%
Taylor expanded in x around 0 23.8%
*-commutative23.8%
Simplified23.8%
add-sqr-sqrt23.6%
sqrt-unprod23.8%
metadata-eval23.8%
metadata-eval23.8%
sqrt-pow223.5%
*-commutative23.5%
metadata-eval23.5%
metadata-eval23.5%
sqrt-pow223.4%
*-commutative23.4%
swap-sqr23.4%
add-sqr-sqrt23.4%
*-commutative23.4%
sqrt-pow223.5%
metadata-eval23.5%
metadata-eval23.5%
sqrt-pow223.8%
metadata-eval23.8%
metadata-eval23.8%
metadata-eval23.8%
Applied egg-rr23.8%
associate-*l*23.8%
Simplified23.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 2024165
(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)))))