
(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 11 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 -9.5e+31)
(pow
(* (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) (sqrt 2.0))
2.0)
(if (<= y -1.78e-277)
(* 2.0 (sqrt (fma x y (* z (+ y x)))))
(* 2.0 (* (sqrt (+ x (* y (+ 1.0 (/ x z))))) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -9.5e+31) {
tmp = pow((exp((0.25 * (log((-y - z)) - log((-1.0 / x))))) * sqrt(2.0)), 2.0);
} else if (y <= -1.78e-277) {
tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
} else {
tmp = 2.0 * (sqrt((x + (y * (1.0 + (x / z))))) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -9.5e+31) tmp = Float64(exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) * sqrt(2.0)) ^ 2.0; elseif (y <= -1.78e-277) tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(Float64(x + Float64(y * Float64(1.0 + Float64(x / z))))) * 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, -9.5e+31], N[Power[N[(N[Exp[N[(0.25 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision], If[LessEqual[y, -1.78e-277], N[(2.0 * N[Sqrt[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(y * N[(1.0 + N[(x / z), $MachinePrecision]), $MachinePrecision]), $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 -9.5 \cdot 10^{+31}:\\
\;\;\;\;{\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)} \cdot \sqrt{2}\right)}^{2}\\
\mathbf{elif}\;y \leq -1.78 \cdot 10^{-277}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x + y \cdot \left(1 + \frac{x}{z}\right)} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -9.5000000000000008e31Initial program 50.5%
+-commutative50.5%
associate-+r+50.5%
*-commutative50.5%
+-commutative50.5%
+-commutative50.5%
*-commutative50.5%
*-commutative50.5%
associate-+l+50.5%
+-commutative50.5%
*-commutative50.5%
associate-+l+50.5%
*-commutative50.5%
*-commutative50.5%
+-commutative50.5%
Simplified50.5%
add-sqr-sqrt50.3%
sqrt-unprod50.5%
swap-sqr50.5%
add-sqr-sqrt50.5%
distribute-rgt-in50.5%
associate-+r+50.5%
*-commutative50.5%
distribute-lft-in50.7%
+-commutative50.7%
fma-undefine51.1%
add-sqr-sqrt51.1%
swap-sqr51.1%
sqrt-unprod50.8%
Applied egg-rr50.8%
Taylor expanded in x around -inf 42.6%
if -9.5000000000000008e31 < y < -1.78000000000000012e-277Initial program 92.3%
+-commutative92.3%
*-commutative92.3%
+-commutative92.3%
*-commutative92.3%
associate-+l+92.3%
*-commutative92.3%
*-commutative92.3%
+-commutative92.3%
fma-define92.3%
+-commutative92.3%
distribute-lft-out92.3%
Simplified92.3%
if -1.78000000000000012e-277 < y Initial program 68.8%
+-commutative68.8%
*-commutative68.8%
+-commutative68.8%
*-commutative68.8%
associate-+l+68.8%
*-commutative68.8%
*-commutative68.8%
+-commutative68.8%
fma-define68.8%
+-commutative68.8%
distribute-lft-out68.9%
Simplified68.9%
Taylor expanded in z around inf 61.1%
associate-+r+61.1%
associate-/l*54.6%
Simplified54.6%
*-commutative54.6%
sqrt-prod51.1%
+-commutative51.1%
fma-define51.1%
Applied egg-rr51.1%
Taylor expanded in y around 0 54.8%
Final simplification61.0%
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+33)
(pow
(* (sqrt 2.0) (exp (* 0.25 (- (log (- (- z) x)) (log (/ -1.0 y))))))
2.0)
(if (<= y -1.78e-277)
(* 2.0 (sqrt (fma x y (* z (+ y x)))))
(* 2.0 (* (sqrt (+ x (* y (+ 1.0 (/ x z))))) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -6.5e+33) {
tmp = pow((sqrt(2.0) * exp((0.25 * (log((-z - x)) - log((-1.0 / y)))))), 2.0);
} else if (y <= -1.78e-277) {
tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
} else {
tmp = 2.0 * (sqrt((x + (y * (1.0 + (x / z))))) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -6.5e+33) tmp = Float64(sqrt(2.0) * exp(Float64(0.25 * Float64(log(Float64(Float64(-z) - x)) - log(Float64(-1.0 / y)))))) ^ 2.0; elseif (y <= -1.78e-277) tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(Float64(x + Float64(y * Float64(1.0 + Float64(x / z))))) * 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, -6.5e+33], N[Power[N[(N[Sqrt[2.0], $MachinePrecision] * N[Exp[N[(0.25 * N[(N[Log[N[((-z) - x), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision], If[LessEqual[y, -1.78e-277], N[(2.0 * N[Sqrt[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(y * N[(1.0 + N[(x / z), $MachinePrecision]), $MachinePrecision]), $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 -6.5 \cdot 10^{+33}:\\
\;\;\;\;{\left(\sqrt{2} \cdot e^{0.25 \cdot \left(\log \left(\left(-z\right) - x\right) - \log \left(\frac{-1}{y}\right)\right)}\right)}^{2}\\
\mathbf{elif}\;y \leq -1.78 \cdot 10^{-277}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x + y \cdot \left(1 + \frac{x}{z}\right)} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -6.49999999999999993e33Initial program 50.5%
+-commutative50.5%
associate-+r+50.5%
*-commutative50.5%
+-commutative50.5%
+-commutative50.5%
*-commutative50.5%
*-commutative50.5%
associate-+l+50.5%
+-commutative50.5%
*-commutative50.5%
associate-+l+50.5%
*-commutative50.5%
*-commutative50.5%
+-commutative50.5%
Simplified50.5%
add-sqr-sqrt50.3%
sqrt-unprod50.5%
swap-sqr50.5%
add-sqr-sqrt50.5%
distribute-rgt-in50.5%
associate-+r+50.5%
*-commutative50.5%
distribute-lft-in50.7%
+-commutative50.7%
fma-undefine51.1%
add-sqr-sqrt51.1%
swap-sqr51.1%
sqrt-unprod50.8%
Applied egg-rr50.8%
Taylor expanded in y around -inf 81.2%
if -6.49999999999999993e33 < y < -1.78000000000000012e-277Initial program 92.3%
+-commutative92.3%
*-commutative92.3%
+-commutative92.3%
*-commutative92.3%
associate-+l+92.3%
*-commutative92.3%
*-commutative92.3%
+-commutative92.3%
fma-define92.3%
+-commutative92.3%
distribute-lft-out92.3%
Simplified92.3%
if -1.78000000000000012e-277 < y Initial program 68.8%
+-commutative68.8%
*-commutative68.8%
+-commutative68.8%
*-commutative68.8%
associate-+l+68.8%
*-commutative68.8%
*-commutative68.8%
+-commutative68.8%
fma-define68.8%
+-commutative68.8%
distribute-lft-out68.9%
Simplified68.9%
Taylor expanded in z around inf 61.1%
associate-+r+61.1%
associate-/l*54.6%
Simplified54.6%
*-commutative54.6%
sqrt-prod51.1%
+-commutative51.1%
fma-define51.1%
Applied egg-rr51.1%
Taylor expanded in y around 0 54.8%
Final simplification70.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -4e+38)
(*
y
(-
(* (* z x) (sqrt (/ 1.0 (* (+ z x) (pow y 3.0)))))
(* 2.0 (sqrt (/ (+ z x) y)))))
(if (<= y -1.78e-277)
(* 2.0 (sqrt (fma x y (* z (+ y x)))))
(* 2.0 (* (sqrt (+ x (* y (+ 1.0 (/ x z))))) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -4e+38) {
tmp = y * (((z * x) * sqrt((1.0 / ((z + x) * pow(y, 3.0))))) - (2.0 * sqrt(((z + x) / y))));
} else if (y <= -1.78e-277) {
tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
} else {
tmp = 2.0 * (sqrt((x + (y * (1.0 + (x / z))))) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -4e+38) 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 <= -1.78e-277) tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(Float64(x + Float64(y * Float64(1.0 + Float64(x / z))))) * 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, -4e+38], 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, -1.78e-277], N[(2.0 * N[Sqrt[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(y * N[(1.0 + N[(x / z), $MachinePrecision]), $MachinePrecision]), $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 -4 \cdot 10^{+38}:\\
\;\;\;\;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 -1.78 \cdot 10^{-277}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x + y \cdot \left(1 + \frac{x}{z}\right)} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -3.99999999999999991e38Initial program 51.3%
+-commutative51.3%
associate-+r+51.3%
*-commutative51.3%
+-commutative51.3%
+-commutative51.3%
*-commutative51.3%
*-commutative51.3%
associate-+l+51.3%
+-commutative51.3%
*-commutative51.3%
associate-+l+51.3%
*-commutative51.3%
*-commutative51.3%
+-commutative51.3%
Simplified51.3%
Taylor expanded in y around inf 0.8%
Taylor expanded in y around -inf 0.0%
+-commutative0.0%
unpow20.0%
rem-square-sqrt74.1%
Simplified74.1%
if -3.99999999999999991e38 < y < -1.78000000000000012e-277Initial program 90.9%
+-commutative90.9%
*-commutative90.9%
+-commutative90.9%
*-commutative90.9%
associate-+l+90.9%
*-commutative90.9%
*-commutative90.9%
+-commutative90.9%
fma-define90.9%
+-commutative90.9%
distribute-lft-out91.0%
Simplified91.0%
if -1.78000000000000012e-277 < y Initial program 68.8%
+-commutative68.8%
*-commutative68.8%
+-commutative68.8%
*-commutative68.8%
associate-+l+68.8%
*-commutative68.8%
*-commutative68.8%
+-commutative68.8%
fma-define68.8%
+-commutative68.8%
distribute-lft-out68.9%
Simplified68.9%
Taylor expanded in z around inf 61.1%
associate-+r+61.1%
associate-/l*54.6%
Simplified54.6%
*-commutative54.6%
sqrt-prod51.1%
+-commutative51.1%
fma-define51.1%
Applied egg-rr51.1%
Taylor expanded in y around 0 54.8%
Final simplification68.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.78e-277) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (* (sqrt (+ x (* y (+ 1.0 (/ x z))))) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1.78e-277) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * (sqrt((x + (y * (1.0 + (x / z))))) * 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.78d-277)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * (sqrt((x + (y * (1.0d0 + (x / z))))) * 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.78e-277) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * (Math.sqrt((x + (y * (1.0 + (x / z))))) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1.78e-277: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * (math.sqrt((x + (y * (1.0 + (x / z))))) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1.78e-277) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * Float64(sqrt(Float64(x + Float64(y * Float64(1.0 + Float64(x / z))))) * 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.78e-277)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * (sqrt((x + (y * (1.0 + (x / z))))) * 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.78e-277], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(y * N[(1.0 + N[(x / z), $MachinePrecision]), $MachinePrecision]), $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 -1.78 \cdot 10^{-277}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x + y \cdot \left(1 + \frac{x}{z}\right)} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -1.78000000000000012e-277Initial program 71.7%
+-commutative71.7%
associate-+r+71.7%
*-commutative71.7%
+-commutative71.7%
+-commutative71.7%
*-commutative71.7%
*-commutative71.7%
associate-+l+71.7%
+-commutative71.7%
*-commutative71.7%
associate-+l+71.7%
*-commutative71.7%
*-commutative71.7%
+-commutative71.7%
Simplified71.8%
Taylor expanded in x around inf 44.3%
+-commutative44.3%
Simplified44.3%
if -1.78000000000000012e-277 < y Initial program 68.8%
+-commutative68.8%
*-commutative68.8%
+-commutative68.8%
*-commutative68.8%
associate-+l+68.8%
*-commutative68.8%
*-commutative68.8%
+-commutative68.8%
fma-define68.8%
+-commutative68.8%
distribute-lft-out68.9%
Simplified68.9%
Taylor expanded in z around inf 61.1%
associate-+r+61.1%
associate-/l*54.6%
Simplified54.6%
*-commutative54.6%
sqrt-prod51.1%
+-commutative51.1%
fma-define51.1%
Applied egg-rr51.1%
Taylor expanded in y around 0 54.8%
Final simplification49.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.3e-280) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (* (sqrt z) (sqrt (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.3e-280) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * (sqrt(z) * sqrt((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.3d-280) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * (sqrt(z) * sqrt((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.3e-280) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * (Math.sqrt(z) * Math.sqrt((y + x)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 1.3e-280: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * (math.sqrt(z) * math.sqrt((y + x))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.3e-280) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(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.3e-280)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * (sqrt(z) * sqrt((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.3e-280], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[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.3 \cdot 10^{-280}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y + x}\right)\\
\end{array}
\end{array}
if y < 1.3e-280Initial program 71.8%
+-commutative71.8%
associate-+r+71.8%
*-commutative71.8%
+-commutative71.8%
+-commutative71.8%
*-commutative71.8%
*-commutative71.8%
associate-+l+71.8%
+-commutative71.8%
*-commutative71.8%
associate-+l+71.8%
*-commutative71.8%
*-commutative71.8%
+-commutative71.8%
Simplified71.9%
Taylor expanded in x around inf 45.8%
+-commutative45.8%
Simplified45.8%
if 1.3e-280 < y Initial program 68.6%
+-commutative68.6%
associate-+r+68.6%
*-commutative68.6%
+-commutative68.6%
+-commutative68.6%
*-commutative68.6%
*-commutative68.6%
associate-+l+68.6%
+-commutative68.6%
*-commutative68.6%
associate-+l+68.6%
*-commutative68.6%
*-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in z around inf 48.1%
*-commutative48.1%
sqrt-prod51.3%
Applied egg-rr51.3%
+-commutative51.3%
Simplified51.3%
Final simplification48.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.6e+32) (* 2.0 (sqrt (+ (* y x) (* 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 <= 2.6e+32) {
tmp = 2.0 * sqrt(((y * x) + (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 <= 2.6d+32) then
tmp = 2.0d0 * sqrt(((y * x) + (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 <= 2.6e+32) {
tmp = 2.0 * Math.sqrt(((y * x) + (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 <= 2.6e+32: tmp = 2.0 * math.sqrt(((y * x) + (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 <= 2.6e+32) tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + 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 <= 2.6e+32)
tmp = 2.0 * sqrt(((y * x) + (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, 2.6e+32], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + 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 2.6 \cdot 10^{+32}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 2.6000000000000002e32Initial program 75.9%
+-commutative75.9%
associate-+r+75.9%
*-commutative75.9%
+-commutative75.9%
+-commutative75.9%
*-commutative75.9%
*-commutative75.9%
associate-+l+75.9%
+-commutative75.9%
*-commutative75.9%
associate-+l+75.9%
*-commutative75.9%
*-commutative75.9%
+-commutative75.9%
Simplified75.9%
if 2.6000000000000002e32 < y Initial program 55.2%
+-commutative55.2%
associate-+r+55.2%
*-commutative55.2%
+-commutative55.2%
+-commutative55.2%
*-commutative55.2%
*-commutative55.2%
associate-+l+55.2%
+-commutative55.2%
*-commutative55.2%
associate-+l+55.2%
*-commutative55.2%
*-commutative55.2%
+-commutative55.2%
Simplified55.2%
add-sqr-sqrt55.0%
sqrt-unprod55.2%
swap-sqr55.2%
add-sqr-sqrt55.2%
distribute-rgt-in55.2%
associate-+r+55.2%
*-commutative55.2%
distribute-lft-in55.2%
+-commutative55.2%
fma-undefine55.5%
add-sqr-sqrt55.5%
swap-sqr55.5%
sqrt-unprod55.2%
Applied egg-rr55.2%
Taylor expanded in x around 0 33.9%
unpow233.9%
rem-square-sqrt34.5%
Simplified34.5%
*-commutative34.5%
sqrt-prod51.8%
Applied egg-rr51.8%
Final simplification69.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2e-294) (* 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-294) {
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-294)) 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-294) {
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-294: 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-294) 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-294)
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-294], 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^{-294}:\\
\;\;\;\;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.00000000000000003e-294Initial program 71.5%
+-commutative71.5%
associate-+r+71.5%
*-commutative71.5%
+-commutative71.5%
+-commutative71.5%
*-commutative71.5%
*-commutative71.5%
associate-+l+71.5%
+-commutative71.5%
*-commutative71.5%
associate-+l+71.5%
*-commutative71.5%
*-commutative71.5%
+-commutative71.5%
Simplified71.5%
Taylor expanded in x around inf 44.4%
+-commutative44.4%
Simplified44.4%
if -2.00000000000000003e-294 < y Initial program 69.1%
+-commutative69.1%
associate-+r+69.1%
*-commutative69.1%
+-commutative69.1%
+-commutative69.1%
*-commutative69.1%
*-commutative69.1%
associate-+l+69.1%
+-commutative69.1%
*-commutative69.1%
associate-+l+69.1%
*-commutative69.1%
*-commutative69.1%
+-commutative69.1%
Simplified69.1%
Taylor expanded in z around inf 49.4%
Final simplification47.0%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.45e-280) (* 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.45e-280) {
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.45d-280) 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.45e-280) {
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.45e-280: 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.45e-280) 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.45e-280)
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.45e-280], 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.45 \cdot 10^{-280}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < 1.45e-280Initial program 71.8%
+-commutative71.8%
associate-+r+71.8%
*-commutative71.8%
+-commutative71.8%
+-commutative71.8%
*-commutative71.8%
*-commutative71.8%
associate-+l+71.8%
+-commutative71.8%
*-commutative71.8%
associate-+l+71.8%
*-commutative71.8%
*-commutative71.8%
+-commutative71.8%
Simplified71.9%
Taylor expanded in x around inf 45.8%
+-commutative45.8%
Simplified45.8%
if 1.45e-280 < y Initial program 68.6%
+-commutative68.6%
associate-+r+68.6%
*-commutative68.6%
+-commutative68.6%
+-commutative68.6%
*-commutative68.6%
*-commutative68.6%
associate-+l+68.6%
+-commutative68.6%
*-commutative68.6%
associate-+l+68.6%
*-commutative68.6%
*-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in x around 0 29.3%
*-commutative29.3%
Simplified29.3%
Final simplification37.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 70.2%
+-commutative70.2%
associate-+r+70.2%
*-commutative70.2%
+-commutative70.2%
+-commutative70.2%
*-commutative70.2%
*-commutative70.2%
associate-+l+70.2%
+-commutative70.2%
*-commutative70.2%
associate-+l+70.2%
*-commutative70.2%
*-commutative70.2%
+-commutative70.2%
Simplified70.2%
Final simplification70.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1e-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 <= -1e-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 <= (-1d-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 <= -1e-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 <= -1e-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 <= -1e-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 <= -1e-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, -1e-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 -1 \cdot 10^{-310}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -9.999999999999969e-311Initial program 71.7%
+-commutative71.7%
associate-+r+71.7%
*-commutative71.7%
+-commutative71.7%
+-commutative71.7%
*-commutative71.7%
*-commutative71.7%
associate-+l+71.7%
+-commutative71.7%
*-commutative71.7%
associate-+l+71.7%
*-commutative71.7%
*-commutative71.7%
+-commutative71.7%
Simplified71.7%
Taylor expanded in z around 0 27.6%
if -9.999999999999969e-311 < y Initial 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.9%
Taylor expanded in x around 0 28.5%
*-commutative28.5%
Simplified28.5%
Final simplification28.1%
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 70.2%
+-commutative70.2%
associate-+r+70.2%
*-commutative70.2%
+-commutative70.2%
+-commutative70.2%
*-commutative70.2%
*-commutative70.2%
associate-+l+70.2%
+-commutative70.2%
*-commutative70.2%
associate-+l+70.2%
*-commutative70.2%
*-commutative70.2%
+-commutative70.2%
Simplified70.2%
Taylor expanded in z around 0 24.3%
Final simplification24.3%
(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 2024149
(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)))))