
(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
(if (<= y -8.5e+84)
(*
2.0
(* y (- (* 0.5 (* x (sqrt (/ z (pow y 3.0))))) (sqrt (/ (+ x z) y)))))
(if (<= y -2e-272)
(* 2.0 (sqrt (* x (+ y z))))
(* 2.0 (* (sqrt (fma x (/ y z) (+ y x))) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -8.5e+84) {
tmp = 2.0 * (y * ((0.5 * (x * sqrt((z / pow(y, 3.0))))) - sqrt(((x + z) / y))));
} else if (y <= -2e-272) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * (sqrt(fma(x, (y / z), (y + x))) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -8.5e+84) tmp = Float64(2.0 * Float64(y * Float64(Float64(0.5 * Float64(x * sqrt(Float64(z / (y ^ 3.0))))) - sqrt(Float64(Float64(x + z) / y))))); elseif (y <= -2e-272) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * Float64(sqrt(fma(x, Float64(y / z), 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, -8.5e+84], N[(2.0 * N[(y * N[(N[(0.5 * N[(x * N[Sqrt[N[(z / N[Power[y, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Sqrt[N[(N[(x + z), $MachinePrecision] / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -2e-272], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x * N[(y / z), $MachinePrecision] + N[(y + x), $MachinePrecision]), $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.5 \cdot 10^{+84}:\\
\;\;\;\;2 \cdot \left(y \cdot \left(0.5 \cdot \left(x \cdot \sqrt{\frac{z}{{y}^{3}}}\right) - \sqrt{\frac{x + z}{y}}\right)\right)\\
\mathbf{elif}\;y \leq -2 \cdot 10^{-272}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{\mathsf{fma}\left(x, \frac{y}{z}, y + x\right)} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -8.5000000000000008e84Initial program 52.5%
associate-+l+52.5%
*-commutative52.5%
*-commutative52.5%
*-commutative52.5%
+-commutative52.5%
+-commutative52.5%
associate-+l+52.5%
*-commutative52.5%
*-commutative52.5%
+-commutative52.5%
+-commutative52.5%
*-commutative52.5%
associate-+l+52.5%
+-commutative52.5%
distribute-rgt-in52.5%
Simplified52.5%
Taylor expanded in y around inf 0.9%
+-commutative0.9%
*-commutative0.9%
+-commutative0.9%
Simplified0.9%
Taylor expanded in z around inf 0.9%
Taylor expanded in y around -inf 0.0%
unpow20.0%
rem-square-sqrt84.0%
Simplified84.0%
if -8.5000000000000008e84 < y < -1.99999999999999986e-272Initial program 75.9%
associate-+l+75.9%
*-commutative75.9%
*-commutative75.9%
*-commutative75.9%
+-commutative75.9%
+-commutative75.9%
associate-+l+75.9%
*-commutative75.9%
*-commutative75.9%
+-commutative75.9%
+-commutative75.9%
*-commutative75.9%
associate-+l+75.9%
+-commutative75.9%
distribute-rgt-in75.9%
Simplified75.9%
Taylor expanded in x around inf 60.9%
if -1.99999999999999986e-272 < y Initial program 71.7%
associate-+l+71.7%
*-commutative71.7%
*-commutative71.7%
*-commutative71.7%
+-commutative71.7%
+-commutative71.7%
associate-+l+71.7%
*-commutative71.7%
*-commutative71.7%
+-commutative71.7%
+-commutative71.7%
*-commutative71.7%
associate-+l+71.7%
+-commutative71.7%
distribute-rgt-in71.8%
Simplified71.8%
distribute-rgt-in71.7%
associate-+r+71.7%
*-commutative71.7%
distribute-lft-in71.7%
*-commutative71.7%
add-sqr-sqrt68.6%
associate-*r*68.6%
fma-define68.6%
Applied egg-rr68.6%
Taylor expanded in z around inf 61.2%
associate-+r+61.2%
associate-/l*58.3%
Simplified58.3%
*-commutative58.3%
sqrt-prod57.7%
+-commutative57.7%
fma-define57.7%
Applied egg-rr57.7%
Final simplification64.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2e-272) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (* (sqrt (fma x (/ y z) (+ y x))) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -2e-272) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * (sqrt(fma(x, (y / z), (y + x))) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -2e-272) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * Float64(sqrt(fma(x, Float64(y / z), 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, -2e-272], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x * N[(y / z), $MachinePrecision] + N[(y + x), $MachinePrecision]), $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 \cdot 10^{-272}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{\mathsf{fma}\left(x, \frac{y}{z}, y + x\right)} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -1.99999999999999986e-272Initial program 65.4%
associate-+l+65.4%
*-commutative65.4%
*-commutative65.4%
*-commutative65.4%
+-commutative65.4%
+-commutative65.4%
associate-+l+65.4%
*-commutative65.4%
*-commutative65.4%
+-commutative65.4%
+-commutative65.4%
*-commutative65.4%
associate-+l+65.4%
+-commutative65.4%
distribute-rgt-in65.4%
Simplified65.4%
Taylor expanded in x around inf 47.3%
if -1.99999999999999986e-272 < y Initial program 71.7%
associate-+l+71.7%
*-commutative71.7%
*-commutative71.7%
*-commutative71.7%
+-commutative71.7%
+-commutative71.7%
associate-+l+71.7%
*-commutative71.7%
*-commutative71.7%
+-commutative71.7%
+-commutative71.7%
*-commutative71.7%
associate-+l+71.7%
+-commutative71.7%
distribute-rgt-in71.8%
Simplified71.8%
distribute-rgt-in71.7%
associate-+r+71.7%
*-commutative71.7%
distribute-lft-in71.7%
*-commutative71.7%
add-sqr-sqrt68.6%
associate-*r*68.6%
fma-define68.6%
Applied egg-rr68.6%
Taylor expanded in z around inf 61.2%
associate-+r+61.2%
associate-/l*58.3%
Simplified58.3%
*-commutative58.3%
sqrt-prod57.7%
+-commutative57.7%
fma-define57.7%
Applied egg-rr57.7%
Final simplification52.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.65e+18) (* 2.0 (sqrt (fma x z (* y (+ x z))))) (* 2.0 (* (sqrt (+ z (* x (+ 1.0 (/ z y))))) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.65e+18) {
tmp = 2.0 * sqrt(fma(x, z, (y * (x + z))));
} else {
tmp = 2.0 * (sqrt((z + (x * (1.0 + (z / y))))) * sqrt(y));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.65e+18) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(x + z))))); else tmp = Float64(2.0 * Float64(sqrt(Float64(z + Float64(x * Float64(1.0 + Float64(z / y))))) * 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.65e+18], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(z + N[(x * N[(1.0 + N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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.65 \cdot 10^{+18}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z + x \cdot \left(1 + \frac{z}{y}\right)} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 1.65e18Initial program 71.7%
associate-+l+71.7%
*-commutative71.7%
*-commutative71.7%
*-commutative71.7%
+-commutative71.7%
+-commutative71.7%
+-commutative71.7%
*-commutative71.7%
*-commutative71.7%
associate-+l+71.7%
+-commutative71.7%
fma-define71.7%
distribute-lft-out71.7%
Simplified71.7%
if 1.65e18 < y Initial program 58.6%
associate-+l+58.6%
*-commutative58.6%
*-commutative58.6%
*-commutative58.6%
+-commutative58.6%
+-commutative58.6%
associate-+l+58.6%
*-commutative58.6%
*-commutative58.6%
+-commutative58.6%
+-commutative58.6%
*-commutative58.6%
associate-+l+58.6%
+-commutative58.6%
distribute-rgt-in58.7%
Simplified58.7%
Taylor expanded in x around inf 50.2%
associate-/l*50.3%
Simplified50.3%
Taylor expanded in y around inf 55.4%
*-commutative55.4%
sqrt-prod69.8%
+-commutative69.8%
associate-/l*73.0%
distribute-lft-out73.0%
Applied egg-rr73.0%
Taylor expanded in x around 0 91.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.8e-290) (* 2.0 (sqrt (* x (+ y (+ 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 <= 2.8e-290) {
tmp = 2.0 * sqrt((x * (y + (z + (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 <= 2.8d-290) then
tmp = 2.0d0 * sqrt((x * (y + (z + (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 <= 2.8e-290) {
tmp = 2.0 * Math.sqrt((x * (y + (z + (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 <= 2.8e-290: tmp = 2.0 * math.sqrt((x * (y + (z + (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 <= 2.8e-290) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + Float64(z + Float64(y * Float64(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 <= 2.8e-290)
tmp = 2.0 * sqrt((x * (y + (z + (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, 2.8e-290], N[(2.0 * N[Sqrt[N[(x * N[(y + N[(z + N[(y * N[(z / 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 2.8 \cdot 10^{-290}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + \left(z + y \cdot \frac{z}{x}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 2.79999999999999997e-290Initial program 66.6%
associate-+l+66.6%
*-commutative66.6%
*-commutative66.6%
*-commutative66.6%
+-commutative66.6%
+-commutative66.6%
associate-+l+66.6%
*-commutative66.6%
*-commutative66.6%
+-commutative66.6%
+-commutative66.6%
*-commutative66.6%
associate-+l+66.6%
+-commutative66.6%
distribute-rgt-in66.6%
Simplified66.6%
Taylor expanded in x around inf 61.6%
associate-/l*59.5%
Simplified59.5%
if 2.79999999999999997e-290 < y Initial program 71.0%
associate-+l+71.0%
*-commutative71.0%
*-commutative71.0%
*-commutative71.0%
+-commutative71.0%
+-commutative71.0%
associate-+l+71.0%
*-commutative71.0%
*-commutative71.0%
+-commutative71.0%
+-commutative71.0%
*-commutative71.0%
associate-+l+71.0%
+-commutative71.0%
distribute-rgt-in71.0%
Simplified71.0%
Taylor expanded in x around inf 63.4%
associate-/l*60.3%
Simplified60.3%
Taylor expanded in y around inf 55.0%
*-commutative55.0%
sqrt-prod62.9%
+-commutative62.9%
associate-/l*65.5%
distribute-lft-out65.5%
Applied egg-rr65.5%
Taylor expanded in x around 0 34.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2e-285) (* 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 <= -2e-285) {
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 <= (-2d-285)) 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 <= -2e-285) {
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 <= -2e-285: 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 <= -2e-285) 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 <= -2e-285)
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, -2e-285], 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 -2 \cdot 10^{-285}:\\
\;\;\;\;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 < -2.00000000000000015e-285Initial program 66.5%
associate-+l+66.5%
*-commutative66.5%
*-commutative66.5%
*-commutative66.5%
+-commutative66.5%
+-commutative66.5%
associate-+l+66.5%
*-commutative66.5%
*-commutative66.5%
+-commutative66.5%
+-commutative66.5%
*-commutative66.5%
associate-+l+66.5%
+-commutative66.5%
distribute-rgt-in66.5%
Simplified66.5%
Taylor expanded in x around inf 48.2%
if -2.00000000000000015e-285 < y Initial program 70.9%
associate-+l+70.9%
*-commutative70.9%
*-commutative70.9%
*-commutative70.9%
+-commutative70.9%
+-commutative70.9%
associate-+l+70.9%
*-commutative70.9%
*-commutative70.9%
+-commutative70.9%
+-commutative70.9%
*-commutative70.9%
associate-+l+70.9%
+-commutative70.9%
distribute-rgt-in70.9%
Simplified70.9%
Taylor expanded in z around inf 50.5%
+-commutative50.5%
Simplified50.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 4.3e-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 <= 4.3e-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 <= 4.3d-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 <= 4.3e-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 <= 4.3e-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 <= 4.3e-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 <= 4.3e-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, 4.3e-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 4.3 \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 < 4.2999999999999998e-293Initial program 66.3%
associate-+l+66.3%
*-commutative66.3%
*-commutative66.3%
*-commutative66.3%
+-commutative66.3%
+-commutative66.3%
associate-+l+66.3%
*-commutative66.3%
*-commutative66.3%
+-commutative66.3%
+-commutative66.3%
*-commutative66.3%
associate-+l+66.3%
+-commutative66.3%
distribute-rgt-in66.3%
Simplified66.3%
Taylor expanded in x around inf 48.7%
if 4.2999999999999998e-293 < y Initial program 71.2%
associate-+l+71.2%
*-commutative71.2%
*-commutative71.2%
*-commutative71.2%
+-commutative71.2%
+-commutative71.2%
associate-+l+71.2%
*-commutative71.2%
*-commutative71.2%
+-commutative71.2%
+-commutative71.2%
*-commutative71.2%
associate-+l+71.2%
+-commutative71.2%
distribute-rgt-in71.3%
Simplified71.3%
Taylor expanded in x around 0 25.6%
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.8%
associate-+l+68.8%
*-commutative68.8%
*-commutative68.8%
*-commutative68.8%
+-commutative68.8%
+-commutative68.8%
associate-+l+68.8%
*-commutative68.8%
*-commutative68.8%
+-commutative68.8%
+-commutative68.8%
*-commutative68.8%
associate-+l+68.8%
+-commutative68.8%
distribute-rgt-in68.8%
Simplified68.8%
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 -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 66.0%
associate-+l+66.0%
*-commutative66.0%
*-commutative66.0%
*-commutative66.0%
+-commutative66.0%
+-commutative66.0%
associate-+l+66.0%
*-commutative66.0%
*-commutative66.0%
+-commutative66.0%
+-commutative66.0%
*-commutative66.0%
associate-+l+66.0%
+-commutative66.0%
distribute-rgt-in66.0%
Simplified66.0%
Taylor expanded in z around 0 29.6%
*-commutative29.6%
Simplified29.6%
if -1.999999999999994e-310 < y Initial program 71.4%
associate-+l+71.4%
*-commutative71.4%
*-commutative71.4%
*-commutative71.4%
+-commutative71.4%
+-commutative71.4%
associate-+l+71.4%
*-commutative71.4%
*-commutative71.4%
+-commutative71.4%
+-commutative71.4%
*-commutative71.4%
associate-+l+71.4%
+-commutative71.4%
distribute-rgt-in71.4%
Simplified71.4%
Taylor expanded in x around 0 25.0%
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 68.8%
associate-+l+68.8%
*-commutative68.8%
*-commutative68.8%
*-commutative68.8%
+-commutative68.8%
+-commutative68.8%
associate-+l+68.8%
*-commutative68.8%
*-commutative68.8%
+-commutative68.8%
+-commutative68.8%
*-commutative68.8%
associate-+l+68.8%
+-commutative68.8%
distribute-rgt-in68.8%
Simplified68.8%
Taylor expanded in z around 0 26.0%
*-commutative26.0%
Simplified26.0%
(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 2024108
(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)))))