
(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 (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0))))
(if (<= y -9e+23)
t_0
(if (<= y -1.1e-174)
(* 2.0 (sqrt (+ (* y x) (* z (+ y x)))))
(if (<= y 1.1e-302) 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((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
double tmp;
if (y <= -9e+23) {
tmp = t_0;
} else if (y <= -1.1e-174) {
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
} else if (y <= 1.1e-302) {
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((0.25d0 * (log((-y - z)) - log(((-1.0d0) / x))))) ** 2.0d0)
if (y <= (-9d+23)) then
tmp = t_0
else if (y <= (-1.1d-174)) then
tmp = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
else if (y <= 1.1d-302) 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((0.25 * (Math.log((-y - z)) - Math.log((-1.0 / x))))), 2.0);
double tmp;
if (y <= -9e+23) {
tmp = t_0;
} else if (y <= -1.1e-174) {
tmp = 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
} else if (y <= 1.1e-302) {
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((0.25 * (math.log((-y - z)) - math.log((-1.0 / x))))), 2.0) tmp = 0 if y <= -9e+23: tmp = t_0 elif y <= -1.1e-174: tmp = 2.0 * math.sqrt(((y * x) + (z * (y + x)))) elif y <= 1.1e-302: 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 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0)) tmp = 0.0 if (y <= -9e+23) tmp = t_0; elseif (y <= -1.1e-174) tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))); elseif (y <= 1.1e-302) 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((0.25 * (log((-y - z)) - log((-1.0 / x))))) ^ 2.0);
tmp = 0.0;
if (y <= -9e+23)
tmp = t_0;
elseif (y <= -1.1e-174)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
elseif (y <= 1.1e-302)
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[Exp[N[(0.25 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -9e+23], t$95$0, If[LessEqual[y, -1.1e-174], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.1e-302], 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^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\
\mathbf{if}\;y \leq -9 \cdot 10^{+23}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq -1.1 \cdot 10^{-174}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\
\mathbf{elif}\;y \leq 1.1 \cdot 10^{-302}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -8.99999999999999958e23 or -1.10000000000000011e-174 < y < 1.10000000000000004e-302Initial program 56.0%
associate-+l+56.0%
*-commutative56.0%
*-commutative56.0%
*-commutative56.0%
+-commutative56.0%
+-commutative56.0%
associate-+l+56.0%
*-commutative56.0%
*-commutative56.0%
+-commutative56.0%
+-commutative56.0%
*-commutative56.0%
associate-+l+56.0%
+-commutative56.0%
distribute-rgt-in56.0%
Simplified56.0%
add-sqr-sqrt55.5%
pow255.5%
pow1/255.5%
sqrt-pow155.6%
distribute-rgt-in55.6%
associate-+r+55.6%
*-commutative55.6%
distribute-lft-in55.6%
fma-define56.0%
metadata-eval56.0%
Applied egg-rr56.0%
Taylor expanded in x around -inf 50.0%
if -8.99999999999999958e23 < y < -1.10000000000000011e-174Initial program 73.2%
associate-+l+73.2%
*-commutative73.2%
*-commutative73.2%
*-commutative73.2%
+-commutative73.2%
+-commutative73.2%
associate-+l+73.2%
*-commutative73.2%
*-commutative73.2%
+-commutative73.2%
+-commutative73.2%
*-commutative73.2%
associate-+l+73.2%
+-commutative73.2%
distribute-rgt-in73.2%
Simplified73.2%
if 1.10000000000000004e-302 < y Initial program 67.8%
associate-+l+67.8%
*-commutative67.8%
*-commutative67.8%
*-commutative67.8%
+-commutative67.8%
+-commutative67.8%
associate-+l+67.8%
*-commutative67.8%
*-commutative67.8%
+-commutative67.8%
+-commutative67.8%
*-commutative67.8%
associate-+l+67.8%
+-commutative67.8%
distribute-rgt-in67.8%
Simplified67.8%
Taylor expanded in z around inf 42.9%
+-commutative42.9%
Simplified42.9%
*-commutative42.9%
sqrt-prod47.0%
Applied egg-rr47.0%
Final simplification52.7%
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 (* 0.25 (- (log (- y)) (log (/ -1.0 x))))) 2.0))))
(if (<= y -3.8e+25)
t_0
(if (<= y -1.1e-174)
(* 2.0 (sqrt (+ (* y x) (* z (+ y x)))))
(if (<= y -1.65e-295) 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((0.25 * (log(-y) - log((-1.0 / x))))), 2.0);
double tmp;
if (y <= -3.8e+25) {
tmp = t_0;
} else if (y <= -1.1e-174) {
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
} else if (y <= -1.65e-295) {
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((0.25d0 * (log(-y) - log(((-1.0d0) / x))))) ** 2.0d0)
if (y <= (-3.8d+25)) then
tmp = t_0
else if (y <= (-1.1d-174)) then
tmp = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
else if (y <= (-1.65d-295)) 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((0.25 * (Math.log(-y) - Math.log((-1.0 / x))))), 2.0);
double tmp;
if (y <= -3.8e+25) {
tmp = t_0;
} else if (y <= -1.1e-174) {
tmp = 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
} else if (y <= -1.65e-295) {
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((0.25 * (math.log(-y) - math.log((-1.0 / x))))), 2.0) tmp = 0 if y <= -3.8e+25: tmp = t_0 elif y <= -1.1e-174: tmp = 2.0 * math.sqrt(((y * x) + (z * (y + x)))) elif y <= -1.65e-295: 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 * (exp(Float64(0.25 * Float64(log(Float64(-y)) - log(Float64(-1.0 / x))))) ^ 2.0)) tmp = 0.0 if (y <= -3.8e+25) tmp = t_0; elseif (y <= -1.1e-174) tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))); elseif (y <= -1.65e-295) 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((0.25 * (log(-y) - log((-1.0 / x))))) ^ 2.0);
tmp = 0.0;
if (y <= -3.8e+25)
tmp = t_0;
elseif (y <= -1.1e-174)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
elseif (y <= -1.65e-295)
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[Exp[N[(0.25 * N[(N[Log[(-y)], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -3.8e+25], t$95$0, If[LessEqual[y, -1.1e-174], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.65e-295], 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^{0.25 \cdot \left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\
\mathbf{if}\;y \leq -3.8 \cdot 10^{+25}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq -1.1 \cdot 10^{-174}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\
\mathbf{elif}\;y \leq -1.65 \cdot 10^{-295}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -3.8e25 or -1.10000000000000011e-174 < y < -1.6499999999999999e-295Initial program 55.4%
associate-+l+55.4%
*-commutative55.4%
*-commutative55.4%
*-commutative55.4%
+-commutative55.4%
+-commutative55.4%
associate-+l+55.4%
*-commutative55.4%
*-commutative55.4%
+-commutative55.4%
+-commutative55.4%
*-commutative55.4%
associate-+l+55.4%
+-commutative55.4%
distribute-rgt-in55.4%
Simplified55.4%
Taylor expanded in z around 0 20.1%
*-commutative20.1%
Simplified20.1%
add-sqr-sqrt19.9%
pow219.9%
pow1/220.2%
metadata-eval20.2%
sqrt-pow120.2%
metadata-eval20.2%
metadata-eval20.2%
Applied egg-rr20.2%
Taylor expanded in x around -inf 33.8%
if -3.8e25 < y < -1.10000000000000011e-174Initial program 73.2%
associate-+l+73.2%
*-commutative73.2%
*-commutative73.2%
*-commutative73.2%
+-commutative73.2%
+-commutative73.2%
associate-+l+73.2%
*-commutative73.2%
*-commutative73.2%
+-commutative73.2%
+-commutative73.2%
*-commutative73.2%
associate-+l+73.2%
+-commutative73.2%
distribute-rgt-in73.2%
Simplified73.2%
if -1.6499999999999999e-295 < y Initial program 68.0%
associate-+l+68.0%
*-commutative68.0%
*-commutative68.0%
*-commutative68.0%
+-commutative68.0%
+-commutative68.0%
associate-+l+68.0%
*-commutative68.0%
*-commutative68.0%
+-commutative68.0%
+-commutative68.0%
*-commutative68.0%
associate-+l+68.0%
+-commutative68.0%
distribute-rgt-in68.1%
Simplified68.1%
Taylor expanded in z around inf 43.3%
+-commutative43.3%
Simplified43.3%
*-commutative43.3%
sqrt-prod47.4%
Applied egg-rr47.4%
Final simplification47.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= z 1.85e+59) (* 2.0 (sqrt (fma x z (* y (+ z 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 <= 1.85e+59) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + 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 <= 1.85e+59) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + 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, 1.85e+59], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[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 1.85 \cdot 10^{+59}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + 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 < 1.84999999999999999e59Initial program 70.0%
associate-+l+70.0%
*-commutative70.0%
*-commutative70.0%
*-commutative70.0%
+-commutative70.0%
+-commutative70.0%
+-commutative70.0%
*-commutative70.0%
*-commutative70.0%
associate-+l+70.0%
+-commutative70.0%
fma-define70.0%
distribute-lft-out70.1%
Simplified70.1%
if 1.84999999999999999e59 < z Initial program 44.8%
associate-+l+44.8%
*-commutative44.8%
*-commutative44.8%
*-commutative44.8%
+-commutative44.8%
+-commutative44.8%
associate-+l+44.8%
*-commutative44.8%
*-commutative44.8%
+-commutative44.8%
+-commutative44.8%
*-commutative44.8%
associate-+l+44.8%
+-commutative44.8%
distribute-rgt-in44.9%
Simplified44.9%
Taylor expanded in z around inf 45.0%
associate-/l*45.5%
Simplified45.5%
*-commutative45.5%
sqrt-prod99.5%
+-commutative99.5%
fma-define99.5%
Applied egg-rr99.5%
Final simplification75.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 4.05e-224) (* 2.0 (sqrt (fma x z (* 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 <= 4.05e-224) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + 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 <= 4.05e-224) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + 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, 4.05e-224], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + 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.05 \cdot 10^{-224}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 4.0500000000000002e-224Initial program 63.7%
associate-+l+63.7%
*-commutative63.7%
*-commutative63.7%
*-commutative63.7%
+-commutative63.7%
+-commutative63.7%
+-commutative63.7%
*-commutative63.7%
*-commutative63.7%
associate-+l+63.7%
+-commutative63.7%
fma-define63.8%
distribute-lft-out63.8%
Simplified63.8%
if 4.0500000000000002e-224 < y Initial program 66.8%
associate-+l+66.8%
*-commutative66.8%
*-commutative66.8%
*-commutative66.8%
+-commutative66.8%
+-commutative66.8%
associate-+l+66.8%
*-commutative66.8%
*-commutative66.8%
+-commutative66.8%
+-commutative66.8%
*-commutative66.8%
associate-+l+66.8%
+-commutative66.8%
distribute-rgt-in66.9%
Simplified66.9%
Taylor expanded in z around inf 38.7%
+-commutative38.7%
Simplified38.7%
*-commutative38.7%
sqrt-prod46.5%
Applied egg-rr46.5%
Final simplification56.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 6.4e-288) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (* (sqrt (+ y x)) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 6.4e-288) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 6.4d-288) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 6.4e-288) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 6.4e-288: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 6.4e-288) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 6.4e-288)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 6.4e-288], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 6.4 \cdot 10^{-288}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 6.4000000000000001e-288Initial program 62.7%
associate-+l+62.7%
*-commutative62.7%
*-commutative62.7%
*-commutative62.7%
+-commutative62.7%
+-commutative62.7%
associate-+l+62.7%
*-commutative62.7%
*-commutative62.7%
+-commutative62.7%
+-commutative62.7%
*-commutative62.7%
associate-+l+62.7%
+-commutative62.7%
distribute-rgt-in62.7%
Simplified62.7%
Taylor expanded in x around inf 47.9%
if 6.4000000000000001e-288 < y Initial program 67.5%
associate-+l+67.5%
*-commutative67.5%
*-commutative67.5%
*-commutative67.5%
+-commutative67.5%
+-commutative67.5%
associate-+l+67.5%
*-commutative67.5%
*-commutative67.5%
+-commutative67.5%
+-commutative67.5%
*-commutative67.5%
associate-+l+67.5%
+-commutative67.5%
distribute-rgt-in67.5%
Simplified67.5%
Taylor expanded in z around inf 41.8%
+-commutative41.8%
Simplified41.8%
*-commutative41.8%
sqrt-prod46.9%
Applied egg-rr46.9%
Final simplification47.4%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 4.05e-224) (* 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 <= 4.05e-224) {
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 <= 4.05d-224) 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 <= 4.05e-224) {
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 <= 4.05e-224: 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 <= 4.05e-224) 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 <= 4.05e-224)
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, 4.05e-224], 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 4.05 \cdot 10^{-224}:\\
\;\;\;\;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 < 4.0500000000000002e-224Initial program 63.7%
associate-+l+63.7%
*-commutative63.7%
*-commutative63.7%
*-commutative63.7%
+-commutative63.7%
+-commutative63.7%
associate-+l+63.7%
*-commutative63.7%
*-commutative63.7%
+-commutative63.7%
+-commutative63.7%
*-commutative63.7%
associate-+l+63.7%
+-commutative63.7%
distribute-rgt-in63.7%
Simplified63.7%
if 4.0500000000000002e-224 < y Initial program 66.8%
associate-+l+66.8%
*-commutative66.8%
*-commutative66.8%
*-commutative66.8%
+-commutative66.8%
+-commutative66.8%
associate-+l+66.8%
*-commutative66.8%
*-commutative66.8%
+-commutative66.8%
+-commutative66.8%
*-commutative66.8%
associate-+l+66.8%
+-commutative66.8%
distribute-rgt-in66.9%
Simplified66.9%
add-sqr-sqrt66.5%
pow266.5%
pow1/266.5%
sqrt-pow166.5%
distribute-rgt-in66.5%
associate-+r+66.5%
*-commutative66.5%
distribute-lft-in66.5%
fma-define66.8%
metadata-eval66.8%
Applied egg-rr66.8%
Taylor expanded in x around 0 24.4%
*-commutative24.4%
Simplified24.4%
sqrt-prod36.2%
Applied egg-rr36.2%
Final simplification51.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1.05e-237) (* 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.05e-237) {
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.05d-237)) 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.05e-237) {
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.05e-237: 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.05e-237) 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.05e-237)
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.05e-237], 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.05 \cdot 10^{-237}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -1.0500000000000001e-237Initial program 60.9%
associate-+l+60.9%
*-commutative60.9%
*-commutative60.9%
*-commutative60.9%
+-commutative60.9%
+-commutative60.9%
associate-+l+60.9%
*-commutative60.9%
*-commutative60.9%
+-commutative60.9%
+-commutative60.9%
*-commutative60.9%
associate-+l+60.9%
+-commutative60.9%
distribute-rgt-in60.9%
Simplified60.9%
Taylor expanded in x around inf 43.7%
if -1.0500000000000001e-237 < y Initial program 68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
*-commutative68.3%
associate-+l+68.3%
+-commutative68.3%
distribute-rgt-in68.3%
Simplified68.3%
Taylor expanded in x around 0 19.7%
Final simplification30.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1.05e-237) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1.05e-237) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * sqrt((z * (y + x)));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-1.05d-237)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * sqrt((z * (y + x)))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -1.05e-237) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * Math.sqrt((z * (y + x)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1.05e-237: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * math.sqrt((z * (y + x))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1.05e-237) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * sqrt(Float64(z * Float64(y + x)))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -1.05e-237)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * sqrt((z * (y + x)));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -1.05e-237], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.05 \cdot 10^{-237}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -1.0500000000000001e-237Initial program 60.9%
associate-+l+60.9%
*-commutative60.9%
*-commutative60.9%
*-commutative60.9%
+-commutative60.9%
+-commutative60.9%
associate-+l+60.9%
*-commutative60.9%
*-commutative60.9%
+-commutative60.9%
+-commutative60.9%
*-commutative60.9%
associate-+l+60.9%
+-commutative60.9%
distribute-rgt-in60.9%
Simplified60.9%
Taylor expanded in x around inf 43.7%
if -1.0500000000000001e-237 < y Initial program 68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
*-commutative68.3%
associate-+l+68.3%
+-commutative68.3%
distribute-rgt-in68.3%
Simplified68.3%
Taylor expanded in z around inf 45.8%
+-commutative45.8%
Simplified45.8%
Final simplification44.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (* y x) (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt(((y * x) + (z * (y + x))));
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt(((y * x) + (z * (y + x))))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}
\end{array}
Initial program 65.1%
associate-+l+65.1%
*-commutative65.1%
*-commutative65.1%
*-commutative65.1%
+-commutative65.1%
+-commutative65.1%
associate-+l+65.1%
*-commutative65.1%
*-commutative65.1%
+-commutative65.1%
+-commutative65.1%
*-commutative65.1%
associate-+l+65.1%
+-commutative65.1%
distribute-rgt-in65.1%
Simplified65.1%
Final simplification65.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.7e-295) (* 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 <= -1.7e-295) {
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 <= (-1.7d-295)) 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 <= -1.7e-295) {
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 <= -1.7e-295: 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 <= -1.7e-295) 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 <= -1.7e-295)
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, -1.7e-295], 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.7 \cdot 10^{-295}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -1.70000000000000004e-295Initial program 62.0%
associate-+l+62.0%
*-commutative62.0%
*-commutative62.0%
*-commutative62.0%
+-commutative62.0%
+-commutative62.0%
associate-+l+62.0%
*-commutative62.0%
*-commutative62.0%
+-commutative62.0%
+-commutative62.0%
*-commutative62.0%
associate-+l+62.0%
+-commutative62.0%
distribute-rgt-in62.0%
Simplified62.0%
Taylor expanded in z around 0 21.9%
*-commutative21.9%
Simplified21.9%
if -1.70000000000000004e-295 < y Initial program 68.0%
associate-+l+68.0%
*-commutative68.0%
*-commutative68.0%
*-commutative68.0%
+-commutative68.0%
+-commutative68.0%
associate-+l+68.0%
*-commutative68.0%
*-commutative68.0%
+-commutative68.0%
+-commutative68.0%
*-commutative68.0%
associate-+l+68.0%
+-commutative68.0%
distribute-rgt-in68.1%
Simplified68.1%
Taylor expanded in x around 0 21.2%
Final simplification21.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 65.1%
associate-+l+65.1%
*-commutative65.1%
*-commutative65.1%
*-commutative65.1%
+-commutative65.1%
+-commutative65.1%
associate-+l+65.1%
*-commutative65.1%
*-commutative65.1%
+-commutative65.1%
+-commutative65.1%
*-commutative65.1%
associate-+l+65.1%
+-commutative65.1%
distribute-rgt-in65.1%
Simplified65.1%
Taylor expanded in z around 0 24.8%
*-commutative24.8%
Simplified24.8%
Final simplification24.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 2024074
(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)))))