
(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
(let* ((t_0
(*
2.0
(pow
(*
(exp (* (log (- (- y) z)) 0.25))
(exp (* (log (/ -1.0 x)) (- 0.25))))
2.0))))
(if (<= y -6.5e+24)
t_0
(if (<= y -7.5e-212)
(* 2.0 (sqrt (* (+ y z) x)))
(if (<= y 3e-305) t_0 (* 2.0 (* (sqrt (+ y x)) (sqrt z))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = 2.0 * pow((exp((log((-y - z)) * 0.25)) * exp((log((-1.0 / x)) * -0.25))), 2.0);
double tmp;
if (y <= -6.5e+24) {
tmp = t_0;
} else if (y <= -7.5e-212) {
tmp = 2.0 * sqrt(((y + z) * x));
} else if (y <= 3e-305) {
tmp = t_0;
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 * ((exp((log((-y - z)) * 0.25d0)) * exp((log(((-1.0d0) / x)) * -0.25d0))) ** 2.0d0)
if (y <= (-6.5d+24)) then
tmp = t_0
else if (y <= (-7.5d-212)) then
tmp = 2.0d0 * sqrt(((y + z) * x))
else if (y <= 3d-305) then
tmp = t_0
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double t_0 = 2.0 * Math.pow((Math.exp((Math.log((-y - z)) * 0.25)) * Math.exp((Math.log((-1.0 / x)) * -0.25))), 2.0);
double tmp;
if (y <= -6.5e+24) {
tmp = t_0;
} else if (y <= -7.5e-212) {
tmp = 2.0 * Math.sqrt(((y + z) * x));
} else if (y <= 3e-305) {
tmp = t_0;
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): t_0 = 2.0 * math.pow((math.exp((math.log((-y - z)) * 0.25)) * math.exp((math.log((-1.0 / x)) * -0.25))), 2.0) tmp = 0 if y <= -6.5e+24: tmp = t_0 elif y <= -7.5e-212: tmp = 2.0 * math.sqrt(((y + z) * x)) elif y <= 3e-305: tmp = t_0 else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = Float64(2.0 * (Float64(exp(Float64(log(Float64(Float64(-y) - z)) * 0.25)) * exp(Float64(log(Float64(-1.0 / x)) * Float64(-0.25)))) ^ 2.0)) tmp = 0.0 if (y <= -6.5e+24) tmp = t_0; elseif (y <= -7.5e-212) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * x))); elseif (y <= 3e-305) tmp = t_0; else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
t_0 = 2.0 * ((exp((log((-y - z)) * 0.25)) * exp((log((-1.0 / x)) * -0.25))) ^ 2.0);
tmp = 0.0;
if (y <= -6.5e+24)
tmp = t_0;
elseif (y <= -7.5e-212)
tmp = 2.0 * sqrt(((y + z) * x));
elseif (y <= 3e-305)
tmp = t_0;
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[(2.0 * N[Power[N[(N[Exp[N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] * 0.25), $MachinePrecision]], $MachinePrecision] * N[Exp[N[(N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision] * (-0.25)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -6.5e+24], t$95$0, If[LessEqual[y, -7.5e-212], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3e-305], t$95$0, N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
t_0 := 2 \cdot {\left(e^{\log \left(\left(-y\right) - z\right) \cdot 0.25} \cdot e^{\log \left(\frac{-1}{x}\right) \cdot \left(-0.25\right)}\right)}^{2}\\
\mathbf{if}\;y \leq -6.5 \cdot 10^{+24}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq -7.5 \cdot 10^{-212}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{elif}\;y \leq 3 \cdot 10^{-305}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -6.4999999999999996e24 or -7.50000000000000012e-212 < y < 3.0000000000000001e-305Initial program 62.9%
associate-+l+62.9%
*-commutative62.9%
*-commutative62.9%
*-commutative62.9%
+-commutative62.9%
+-commutative62.9%
associate-+l+62.9%
*-commutative62.9%
*-commutative62.9%
+-commutative62.9%
+-commutative62.9%
*-commutative62.9%
associate-+l+62.9%
+-commutative62.9%
distribute-rgt-in62.9%
Simplified62.9%
distribute-rgt-in62.9%
associate-+r+62.9%
*-commutative62.9%
distribute-lft-in62.9%
+-commutative62.9%
fma-undefine63.6%
add-sqr-sqrt63.3%
pow263.3%
pow1/263.4%
sqrt-pow163.4%
fma-undefine62.6%
+-commutative62.6%
distribute-lft-in62.6%
*-commutative62.6%
associate-+l+62.6%
distribute-rgt-in62.6%
fma-define63.4%
metadata-eval63.4%
Applied egg-rr63.4%
Taylor expanded in x around -inf 52.7%
distribute-rgt-in52.7%
exp-sum53.3%
distribute-lft-out53.3%
mul-1-neg53.3%
Applied egg-rr53.3%
if -6.4999999999999996e24 < y < -7.50000000000000012e-212Initial program 82.1%
associate-+l+82.1%
*-commutative82.1%
*-commutative82.1%
*-commutative82.1%
+-commutative82.1%
+-commutative82.1%
associate-+l+82.1%
*-commutative82.1%
*-commutative82.1%
+-commutative82.1%
+-commutative82.1%
*-commutative82.1%
associate-+l+82.1%
+-commutative82.1%
distribute-rgt-in82.1%
Simplified82.1%
Taylor expanded in x around inf 60.8%
if 3.0000000000000001e-305 < y Initial program 75.8%
associate-+l+75.8%
*-commutative75.8%
*-commutative75.8%
*-commutative75.8%
+-commutative75.8%
+-commutative75.8%
associate-+l+75.8%
*-commutative75.8%
*-commutative75.8%
+-commutative75.8%
+-commutative75.8%
*-commutative75.8%
associate-+l+75.8%
+-commutative75.8%
distribute-rgt-in75.9%
Simplified75.9%
Taylor expanded in z around inf 56.2%
+-commutative56.2%
Simplified56.2%
*-commutative56.2%
sqrt-prod46.1%
+-commutative46.1%
Applied egg-rr46.1%
Final simplification51.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -5.2e+24)
(* 2.0 (pow (exp (* 0.25 (+ (log (- (- y) z)) (log (- x))))) 2.0))
(if (<= y 1.2e-241)
(* 2.0 (sqrt (fma x y (* z (+ y x)))))
(* 2.0 (* (sqrt (+ y x)) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -5.2e+24) {
tmp = 2.0 * pow(exp((0.25 * (log((-y - z)) + log(-x)))), 2.0);
} else if (y <= 1.2e-241) {
tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -5.2e+24) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) + log(Float64(-x))))) ^ 2.0)); elseif (y <= 1.2e-241) tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -5.2e+24], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] + N[Log[(-x)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.2e-241], 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[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -5.2 \cdot 10^{+24}:\\
\;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) + \log \left(-x\right)\right)}\right)}^{2}\\
\mathbf{elif}\;y \leq 1.2 \cdot 10^{-241}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -5.1999999999999997e24Initial program 55.2%
associate-+l+55.2%
*-commutative55.2%
*-commutative55.2%
*-commutative55.2%
+-commutative55.2%
+-commutative55.2%
associate-+l+55.2%
*-commutative55.2%
*-commutative55.2%
+-commutative55.2%
+-commutative55.2%
*-commutative55.2%
associate-+l+55.2%
+-commutative55.2%
distribute-rgt-in55.2%
Simplified55.2%
distribute-rgt-in55.2%
associate-+r+55.2%
*-commutative55.2%
distribute-lft-in55.2%
+-commutative55.2%
fma-undefine56.1%
add-sqr-sqrt55.8%
pow255.8%
pow1/255.9%
sqrt-pow155.9%
fma-undefine54.9%
+-commutative54.9%
distribute-lft-in54.9%
*-commutative54.9%
associate-+l+54.9%
distribute-rgt-in54.9%
fma-define55.9%
metadata-eval55.9%
Applied egg-rr55.9%
Taylor expanded in x around -inf 51.1%
exp-prod49.1%
unpow-prod-up49.1%
distribute-lft-out49.1%
mul-1-neg49.1%
Applied egg-rr49.1%
exp-prod49.8%
*-commutative49.8%
exp-prod51.7%
neg-mul-151.7%
*-commutative51.7%
neg-mul-151.7%
prod-exp51.1%
neg-mul-151.1%
distribute-rgt-out51.1%
Simplified51.1%
if -5.1999999999999997e24 < y < 1.2e-241Initial program 82.2%
associate-+l+82.2%
*-commutative82.2%
*-commutative82.2%
*-commutative82.2%
+-commutative82.2%
+-commutative82.2%
associate-+l+82.2%
*-commutative82.2%
*-commutative82.2%
+-commutative82.2%
+-commutative82.2%
*-commutative82.2%
*-commutative82.2%
associate-+l+82.2%
+-commutative82.2%
*-commutative82.2%
fma-define82.2%
Simplified82.2%
if 1.2e-241 < y Initial program 75.0%
associate-+l+75.0%
*-commutative75.0%
*-commutative75.0%
*-commutative75.0%
+-commutative75.0%
+-commutative75.0%
associate-+l+75.0%
*-commutative75.0%
*-commutative75.0%
+-commutative75.0%
+-commutative75.0%
*-commutative75.0%
associate-+l+75.0%
+-commutative75.0%
distribute-rgt-in75.2%
Simplified75.2%
Taylor expanded in z around inf 52.4%
+-commutative52.4%
Simplified52.4%
*-commutative52.4%
sqrt-prod47.1%
+-commutative47.1%
Applied egg-rr47.1%
Final simplification61.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -4e+24)
(* 2.0 (pow (exp (* 0.25 (+ (log (- x)) (log (- y))))) 2.0))
(if (<= y 1.2e-241)
(* 2.0 (sqrt (fma x y (* z (+ y x)))))
(* 2.0 (* (sqrt (+ y x)) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -4e+24) {
tmp = 2.0 * pow(exp((0.25 * (log(-x) + log(-y)))), 2.0);
} else if (y <= 1.2e-241) {
tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -4e+24) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(-x)) + log(Float64(-y))))) ^ 2.0)); elseif (y <= 1.2e-241) tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -4e+24], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[(-x)], $MachinePrecision] + N[Log[(-y)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.2e-241], 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[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -4 \cdot 10^{+24}:\\
\;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(-x\right) + \log \left(-y\right)\right)}\right)}^{2}\\
\mathbf{elif}\;y \leq 1.2 \cdot 10^{-241}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -3.9999999999999999e24Initial program 55.2%
associate-+l+55.2%
*-commutative55.2%
*-commutative55.2%
*-commutative55.2%
+-commutative55.2%
+-commutative55.2%
associate-+l+55.2%
*-commutative55.2%
*-commutative55.2%
+-commutative55.2%
+-commutative55.2%
*-commutative55.2%
associate-+l+55.2%
+-commutative55.2%
distribute-rgt-in55.2%
Simplified55.2%
distribute-rgt-in55.2%
associate-+r+55.2%
*-commutative55.2%
distribute-lft-in55.2%
+-commutative55.2%
fma-undefine56.1%
add-sqr-sqrt55.8%
pow255.8%
pow1/255.9%
sqrt-pow155.9%
fma-undefine54.9%
+-commutative54.9%
distribute-lft-in54.9%
*-commutative54.9%
associate-+l+54.9%
distribute-rgt-in54.9%
fma-define55.9%
metadata-eval55.9%
Applied egg-rr55.9%
Taylor expanded in x around -inf 51.1%
Taylor expanded in z around 0 48.9%
+-commutative48.9%
neg-mul-148.9%
log-rec48.9%
associate-/r/48.9%
metadata-eval48.9%
neg-mul-148.9%
neg-mul-148.9%
Simplified48.9%
if -3.9999999999999999e24 < y < 1.2e-241Initial program 82.2%
associate-+l+82.2%
*-commutative82.2%
*-commutative82.2%
*-commutative82.2%
+-commutative82.2%
+-commutative82.2%
associate-+l+82.2%
*-commutative82.2%
*-commutative82.2%
+-commutative82.2%
+-commutative82.2%
*-commutative82.2%
*-commutative82.2%
associate-+l+82.2%
+-commutative82.2%
*-commutative82.2%
fma-define82.2%
Simplified82.2%
if 1.2e-241 < y Initial program 75.0%
associate-+l+75.0%
*-commutative75.0%
*-commutative75.0%
*-commutative75.0%
+-commutative75.0%
+-commutative75.0%
associate-+l+75.0%
*-commutative75.0%
*-commutative75.0%
+-commutative75.0%
+-commutative75.0%
*-commutative75.0%
associate-+l+75.0%
+-commutative75.0%
distribute-rgt-in75.2%
Simplified75.2%
Taylor expanded in z around inf 52.4%
+-commutative52.4%
Simplified52.4%
*-commutative52.4%
sqrt-prod47.1%
+-commutative47.1%
Applied egg-rr47.1%
Final simplification60.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= z 3e+20) (* 2.0 (sqrt (fma x y (* z (+ y x))))) (* 2.0 (* (sqrt z) (sqrt (+ x (fma x (/ y z) y)))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (z <= 3e+20) {
tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt((x + fma(x, (y / z), y))));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (z <= 3e+20) tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(Float64(x + fma(x, Float64(y / z), 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[z, 3e+20], N[(2.0 * N[Sqrt[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[N[(x + N[(x * N[(y / z), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 3 \cdot 10^{+20}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{x + \mathsf{fma}\left(x, \frac{y}{z}, y\right)}\right)\\
\end{array}
\end{array}
if z < 3e20Initial 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%
*-commutative75.9%
associate-+l+75.9%
+-commutative75.9%
*-commutative75.9%
fma-define76.0%
Simplified76.1%
if 3e20 < z Initial program 63.0%
associate-+l+63.0%
*-commutative63.0%
*-commutative63.0%
*-commutative63.0%
+-commutative63.0%
+-commutative63.0%
associate-+l+63.0%
*-commutative63.0%
*-commutative63.0%
+-commutative63.0%
+-commutative63.0%
*-commutative63.0%
associate-+l+63.0%
+-commutative63.0%
distribute-rgt-in63.0%
Simplified63.0%
Taylor expanded in z around inf 63.6%
associate-/l*63.7%
Simplified63.7%
*-commutative63.7%
sqrt-prod91.4%
+-commutative91.4%
fma-define91.4%
Applied egg-rr91.4%
Final simplification79.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 8.2e-278) (* 2.0 (sqrt (* (+ y z) x))) (* 2.0 (* (sqrt (+ y x)) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 8.2e-278) {
tmp = 2.0 * sqrt(((y + z) * x));
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 8.2d-278) then
tmp = 2.0d0 * sqrt(((y + z) * x))
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 8.2e-278) {
tmp = 2.0 * Math.sqrt(((y + z) * x));
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 8.2e-278: tmp = 2.0 * math.sqrt(((y + z) * x)) else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 8.2e-278) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * x))); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 8.2e-278)
tmp = 2.0 * sqrt(((y + z) * x));
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 8.2e-278], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 8.2 \cdot 10^{-278}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 8.20000000000000002e-278Initial program 71.6%
associate-+l+71.6%
*-commutative71.6%
*-commutative71.6%
*-commutative71.6%
+-commutative71.6%
+-commutative71.6%
associate-+l+71.6%
*-commutative71.6%
*-commutative71.6%
+-commutative71.6%
+-commutative71.6%
*-commutative71.6%
associate-+l+71.6%
+-commutative71.6%
distribute-rgt-in71.6%
Simplified71.6%
Taylor expanded in x around inf 52.1%
if 8.20000000000000002e-278 < y Initial program 75.1%
associate-+l+75.1%
*-commutative75.1%
*-commutative75.1%
*-commutative75.1%
+-commutative75.1%
+-commutative75.1%
associate-+l+75.1%
*-commutative75.1%
*-commutative75.1%
+-commutative75.1%
+-commutative75.1%
*-commutative75.1%
associate-+l+75.1%
+-commutative75.1%
distribute-rgt-in75.2%
Simplified75.2%
Taylor expanded in z around inf 54.2%
+-commutative54.2%
Simplified54.2%
*-commutative54.2%
sqrt-prod47.3%
+-commutative47.3%
Applied egg-rr47.3%
Final simplification50.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.2e+15) (* 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 <= 1.2e+15) {
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 <= 1.2d+15) 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 <= 1.2e+15) {
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 <= 1.2e+15: 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 <= 1.2e+15) 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 <= 1.2e+15)
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, 1.2e+15], 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 1.2 \cdot 10^{+15}:\\
\;\;\;\;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 < 1.2e15Initial program 77.5%
associate-+l+77.5%
*-commutative77.5%
*-commutative77.5%
*-commutative77.5%
+-commutative77.5%
+-commutative77.5%
associate-+l+77.5%
*-commutative77.5%
*-commutative77.5%
+-commutative77.5%
+-commutative77.5%
*-commutative77.5%
associate-+l+77.5%
+-commutative77.5%
distribute-rgt-in77.5%
Simplified77.5%
if 1.2e15 < y Initial program 51.2%
associate-+l+51.2%
*-commutative51.2%
*-commutative51.2%
*-commutative51.2%
+-commutative51.2%
+-commutative51.2%
associate-+l+51.2%
*-commutative51.2%
*-commutative51.2%
+-commutative51.2%
+-commutative51.2%
*-commutative51.2%
associate-+l+51.2%
+-commutative51.2%
distribute-rgt-in51.4%
Simplified51.4%
Taylor expanded in x around 0 19.9%
sqrt-prod33.6%
Applied egg-rr33.6%
*-commutative33.6%
Simplified33.6%
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 1.5e-273) (* 2.0 (sqrt (* (+ y z) x))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.5e-273) {
tmp = 2.0 * sqrt(((y + z) * x));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 1.5d-273) then
tmp = 2.0d0 * sqrt(((y + z) * x))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 1.5e-273) {
tmp = 2.0 * Math.sqrt(((y + z) * x));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 1.5e-273: tmp = 2.0 * math.sqrt(((y + z) * x)) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.5e-273) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * x))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 1.5e-273)
tmp = 2.0 * sqrt(((y + z) * x));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 1.5e-273], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.5 \cdot 10^{-273}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < 1.49999999999999994e-273Initial program 71.1%
associate-+l+71.1%
*-commutative71.1%
*-commutative71.1%
*-commutative71.1%
+-commutative71.1%
+-commutative71.1%
associate-+l+71.1%
*-commutative71.1%
*-commutative71.1%
+-commutative71.1%
+-commutative71.1%
*-commutative71.1%
associate-+l+71.1%
+-commutative71.1%
distribute-rgt-in71.1%
Simplified71.1%
Taylor expanded in x around inf 51.8%
if 1.49999999999999994e-273 < y Initial program 75.8%
associate-+l+75.8%
*-commutative75.8%
*-commutative75.8%
*-commutative75.8%
+-commutative75.8%
+-commutative75.8%
associate-+l+75.8%
*-commutative75.8%
*-commutative75.8%
+-commutative75.8%
+-commutative75.8%
*-commutative75.8%
associate-+l+75.8%
+-commutative75.8%
distribute-rgt-in75.9%
Simplified75.9%
Taylor expanded in x around 0 25.8%
Final simplification40.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1e-275) (* 2.0 (sqrt (* (+ y z) x))) (* 2.0 (sqrt (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1e-275) {
tmp = 2.0 * sqrt(((y + z) * x));
} else {
tmp = 2.0 * sqrt((z * (y + x)));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-1d-275)) then
tmp = 2.0d0 * sqrt(((y + z) * x))
else
tmp = 2.0d0 * sqrt((z * (y + x)))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -1e-275) {
tmp = 2.0 * Math.sqrt(((y + z) * x));
} else {
tmp = 2.0 * Math.sqrt((z * (y + x)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1e-275: tmp = 2.0 * math.sqrt(((y + z) * x)) else: tmp = 2.0 * math.sqrt((z * (y + x))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1e-275) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * x))); else tmp = Float64(2.0 * sqrt(Float64(z * Float64(y + x)))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -1e-275)
tmp = 2.0 * sqrt(((y + z) * x));
else
tmp = 2.0 * sqrt((z * (y + x)));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -1e-275], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1 \cdot 10^{-275}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -9.99999999999999934e-276Initial program 70.5%
associate-+l+70.5%
*-commutative70.5%
*-commutative70.5%
*-commutative70.5%
+-commutative70.5%
+-commutative70.5%
associate-+l+70.5%
*-commutative70.5%
*-commutative70.5%
+-commutative70.5%
+-commutative70.5%
*-commutative70.5%
associate-+l+70.5%
+-commutative70.5%
distribute-rgt-in70.5%
Simplified70.5%
Taylor expanded in x around inf 49.3%
if -9.99999999999999934e-276 < y Initial program 75.8%
associate-+l+75.8%
*-commutative75.8%
*-commutative75.8%
*-commutative75.8%
+-commutative75.8%
+-commutative75.8%
associate-+l+75.8%
*-commutative75.8%
*-commutative75.8%
+-commutative75.8%
+-commutative75.8%
*-commutative75.8%
associate-+l+75.8%
+-commutative75.8%
distribute-rgt-in75.9%
Simplified75.9%
Taylor expanded in z around inf 57.4%
+-commutative57.4%
Simplified57.4%
Final simplification53.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (* y x) (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt(((y * x) + (z * (y + x))));
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt(((y * x) + (z * (y + x))))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}
\end{array}
Initial program 73.1%
associate-+l+73.1%
*-commutative73.1%
*-commutative73.1%
*-commutative73.1%
+-commutative73.1%
+-commutative73.1%
associate-+l+73.1%
*-commutative73.1%
*-commutative73.1%
+-commutative73.1%
+-commutative73.1%
*-commutative73.1%
associate-+l+73.1%
+-commutative73.1%
distribute-rgt-in73.1%
Simplified73.1%
Final simplification73.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1e-309) (* 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-309) {
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-309)) 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-309) {
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-309: 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-309) 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-309)
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-309], 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^{-309}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -1.000000000000002e-309Initial program 70.8%
associate-+l+70.8%
*-commutative70.8%
*-commutative70.8%
*-commutative70.8%
+-commutative70.8%
+-commutative70.8%
associate-+l+70.8%
*-commutative70.8%
*-commutative70.8%
+-commutative70.8%
+-commutative70.8%
*-commutative70.8%
associate-+l+70.8%
+-commutative70.8%
distribute-rgt-in70.8%
Simplified70.8%
Taylor expanded in z around 0 26.6%
*-commutative26.6%
Simplified26.6%
if -1.000000000000002e-309 < y Initial program 75.8%
associate-+l+75.8%
*-commutative75.8%
*-commutative75.8%
*-commutative75.8%
+-commutative75.8%
+-commutative75.8%
associate-+l+75.8%
*-commutative75.8%
*-commutative75.8%
+-commutative75.8%
+-commutative75.8%
*-commutative75.8%
associate-+l+75.8%
+-commutative75.8%
distribute-rgt-in75.9%
Simplified75.9%
Taylor expanded in x around 0 24.2%
Final simplification25.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))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt((y * x));
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((y * x))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((y * x));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt((y * x))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(y * x))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt((y * x));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot x}
\end{array}
Initial program 73.1%
associate-+l+73.1%
*-commutative73.1%
*-commutative73.1%
*-commutative73.1%
+-commutative73.1%
+-commutative73.1%
associate-+l+73.1%
*-commutative73.1%
*-commutative73.1%
+-commutative73.1%
+-commutative73.1%
*-commutative73.1%
associate-+l+73.1%
+-commutative73.1%
distribute-rgt-in73.1%
Simplified73.1%
Taylor expanded in z around 0 23.8%
*-commutative23.8%
Simplified23.8%
Final simplification23.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 2024067
(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)))))