
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(let* ((t_0 (* 2.0 (exp (* (- (log (- (- z) y)) (log (/ -1.0 x))) 0.5)))))
(if (<= y -2.3e+24)
t_0
(if (<= y -5.3e-173)
(* 2.0 (sqrt (fma x z (* y (+ z x)))))
(if (<= y 1.9e-292)
t_0
(* 2.0 (* (sqrt (+ x (fma x (/ y z) y))) (sqrt z))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = 2.0 * exp(((log((-z - y)) - log((-1.0 / x))) * 0.5));
double tmp;
if (y <= -2.3e+24) {
tmp = t_0;
} else if (y <= -5.3e-173) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else if (y <= 1.9e-292) {
tmp = t_0;
} else {
tmp = 2.0 * (sqrt((x + fma(x, (y / z), y))) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = Float64(2.0 * exp(Float64(Float64(log(Float64(Float64(-z) - y)) - log(Float64(-1.0 / x))) * 0.5))) tmp = 0.0 if (y <= -2.3e+24) tmp = t_0; elseif (y <= -5.3e-173) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); elseif (y <= 1.9e-292) tmp = t_0; else tmp = Float64(2.0 * Float64(sqrt(Float64(x + fma(x, Float64(y / z), y))) * 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_] := Block[{t$95$0 = N[(2.0 * N[Exp[N[(N[(N[Log[N[((-z) - y), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2.3e+24], t$95$0, If[LessEqual[y, -5.3e-173], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.9e-292], t$95$0, N[(2.0 * N[(N[Sqrt[N[(x + N[(x * N[(y / z), $MachinePrecision] + y), $MachinePrecision]), $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 e^{\left(\log \left(\left(-z\right) - y\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\
\mathbf{if}\;y \leq -2.3 \cdot 10^{+24}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq -5.3 \cdot 10^{-173}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{elif}\;y \leq 1.9 \cdot 10^{-292}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x + \mathsf{fma}\left(x, \frac{y}{z}, y\right)} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -2.2999999999999999e24 or -5.29999999999999964e-173 < y < 1.9000000000000001e-292Initial program 54.7%
associate-+l+54.7%
*-commutative54.7%
*-commutative54.7%
*-commutative54.7%
+-commutative54.7%
+-commutative54.7%
associate-+l+54.7%
*-commutative54.7%
*-commutative54.7%
+-commutative54.7%
+-commutative54.7%
*-commutative54.7%
associate-+l+54.7%
+-commutative54.7%
distribute-rgt-in54.7%
Simplified54.7%
pow1/254.7%
pow-to-exp50.9%
distribute-rgt-in50.9%
associate-+r+50.9%
*-commutative50.9%
distribute-lft-in50.9%
fma-define51.0%
Applied egg-rr51.0%
Taylor expanded in x around -inf 45.2%
mul-1-neg45.2%
unsub-neg45.2%
+-commutative45.2%
mul-1-neg45.2%
unsub-neg45.2%
neg-mul-145.2%
Simplified45.2%
if -2.2999999999999999e24 < y < -5.29999999999999964e-173Initial program 84.5%
associate-+l+84.5%
*-commutative84.5%
*-commutative84.5%
*-commutative84.5%
+-commutative84.5%
+-commutative84.5%
+-commutative84.5%
*-commutative84.5%
*-commutative84.5%
associate-+l+84.5%
+-commutative84.5%
fma-define84.5%
distribute-lft-out84.5%
Simplified84.5%
if 1.9000000000000001e-292 < y Initial program 66.5%
associate-+l+66.5%
*-commutative66.5%
*-commutative66.5%
*-commutative66.5%
+-commutative66.5%
+-commutative66.5%
associate-+l+66.5%
*-commutative66.5%
*-commutative66.5%
+-commutative66.5%
+-commutative66.5%
*-commutative66.5%
associate-+l+66.5%
+-commutative66.5%
distribute-rgt-in66.5%
Simplified66.5%
Taylor expanded in z around inf 52.8%
associate-/l*50.8%
Simplified50.8%
*-commutative50.8%
sqrt-prod47.1%
+-commutative47.1%
fma-define47.1%
Applied egg-rr47.1%
Final simplification52.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 4.4e-263) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (* (sqrt (+ x (fma x (/ y z) y))) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 4.4e-263) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * (sqrt((x + fma(x, (y / z), y))) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 4.4e-263) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * Float64(sqrt(Float64(x + fma(x, Float64(y / z), y))) * 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.4e-263], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(x * N[(y / z), $MachinePrecision] + y), $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.4 \cdot 10^{-263}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x + \mathsf{fma}\left(x, \frac{y}{z}, y\right)} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 4.4000000000000001e-263Initial program 65.0%
associate-+l+65.0%
*-commutative65.0%
*-commutative65.0%
*-commutative65.0%
+-commutative65.0%
+-commutative65.0%
associate-+l+65.0%
*-commutative65.0%
*-commutative65.0%
+-commutative65.0%
+-commutative65.0%
*-commutative65.0%
associate-+l+65.0%
+-commutative65.0%
distribute-rgt-in65.0%
Simplified65.0%
Taylor expanded in x around inf 42.1%
if 4.4000000000000001e-263 < y Initial program 65.7%
associate-+l+65.7%
*-commutative65.7%
*-commutative65.7%
*-commutative65.7%
+-commutative65.7%
+-commutative65.7%
associate-+l+65.7%
*-commutative65.7%
*-commutative65.7%
+-commutative65.7%
+-commutative65.7%
*-commutative65.7%
associate-+l+65.7%
+-commutative65.7%
distribute-rgt-in65.8%
Simplified65.8%
Taylor expanded in z around inf 51.7%
associate-/l*49.6%
Simplified49.6%
*-commutative49.6%
sqrt-prod46.7%
+-commutative46.7%
fma-define46.7%
Applied egg-rr46.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 7e-262) (* 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 <= 7e-262) {
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 <= 7d-262) 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 <= 7e-262) {
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 <= 7e-262: 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 <= 7e-262) 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 <= 7e-262)
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, 7e-262], 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 7 \cdot 10^{-262}:\\
\;\;\;\;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 < 7.00000000000000023e-262Initial program 65.0%
associate-+l+65.0%
*-commutative65.0%
*-commutative65.0%
*-commutative65.0%
+-commutative65.0%
+-commutative65.0%
associate-+l+65.0%
*-commutative65.0%
*-commutative65.0%
+-commutative65.0%
+-commutative65.0%
*-commutative65.0%
associate-+l+65.0%
+-commutative65.0%
distribute-rgt-in65.0%
Simplified65.0%
Taylor expanded in x around inf 42.1%
if 7.00000000000000023e-262 < y Initial program 65.7%
associate-+l+65.7%
*-commutative65.7%
*-commutative65.7%
*-commutative65.7%
+-commutative65.7%
+-commutative65.7%
associate-+l+65.7%
*-commutative65.7%
*-commutative65.7%
+-commutative65.7%
+-commutative65.7%
*-commutative65.7%
associate-+l+65.7%
+-commutative65.7%
distribute-rgt-in65.8%
Simplified65.8%
Taylor expanded in z around inf 39.5%
+-commutative39.5%
Simplified39.5%
*-commutative39.5%
sqrt-prod41.9%
Applied egg-rr41.9%
Final simplification42.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-261) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.45e-261) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 1.45d-261) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * (sqrt(z) * sqrt(y))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 1.45e-261) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * (Math.sqrt(z) * Math.sqrt(y));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 1.45e-261: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * (math.sqrt(z) * math.sqrt(y)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.45e-261) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 1.45e-261)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * (sqrt(z) * sqrt(y));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 1.45e-261], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.45 \cdot 10^{-261}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 1.44999999999999993e-261Initial program 65.0%
associate-+l+65.0%
*-commutative65.0%
*-commutative65.0%
*-commutative65.0%
+-commutative65.0%
+-commutative65.0%
associate-+l+65.0%
*-commutative65.0%
*-commutative65.0%
+-commutative65.0%
+-commutative65.0%
*-commutative65.0%
associate-+l+65.0%
+-commutative65.0%
distribute-rgt-in65.0%
Simplified65.0%
Taylor expanded in x around inf 42.1%
if 1.44999999999999993e-261 < y Initial program 65.7%
associate-+l+65.7%
*-commutative65.7%
*-commutative65.7%
*-commutative65.7%
+-commutative65.7%
+-commutative65.7%
associate-+l+65.7%
*-commutative65.7%
*-commutative65.7%
+-commutative65.7%
+-commutative65.7%
*-commutative65.7%
associate-+l+65.7%
+-commutative65.7%
distribute-rgt-in65.8%
Simplified65.8%
add-sqr-sqrt65.3%
pow265.3%
pow1/265.3%
sqrt-pow165.3%
distribute-rgt-in65.3%
associate-+r+65.3%
*-commutative65.3%
distribute-lft-in65.3%
fma-define65.4%
metadata-eval65.4%
Applied egg-rr65.4%
Taylor expanded in x around 0 18.6%
*-commutative18.6%
Simplified18.6%
sqrt-prod26.5%
Applied egg-rr26.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.5e-261) (* 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.5e-261) {
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.5d-261) 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.5e-261) {
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.5e-261: 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.5e-261) 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.5e-261)
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.5e-261], 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.5 \cdot 10^{-261}:\\
\;\;\;\;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.5e-261Initial program 64.5%
associate-+l+64.5%
*-commutative64.5%
*-commutative64.5%
*-commutative64.5%
+-commutative64.5%
+-commutative64.5%
associate-+l+64.5%
*-commutative64.5%
*-commutative64.5%
+-commutative64.5%
+-commutative64.5%
*-commutative64.5%
associate-+l+64.5%
+-commutative64.5%
distribute-rgt-in64.5%
Simplified64.5%
Taylor expanded in x around inf 41.8%
if 1.5e-261 < y Initial program 66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
*-commutative66.2%
associate-+l+66.2%
+-commutative66.2%
distribute-rgt-in66.2%
Simplified66.2%
Taylor expanded in z around inf 39.7%
+-commutative39.7%
Simplified39.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2e-259) (* 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 <= 2e-259) {
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 <= 2d-259) 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 <= 2e-259) {
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 <= 2e-259: 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 <= 2e-259) 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 <= 2e-259)
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, 2e-259], 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 2 \cdot 10^{-259}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < 2.0000000000000001e-259Initial program 64.5%
associate-+l+64.5%
*-commutative64.5%
*-commutative64.5%
*-commutative64.5%
+-commutative64.5%
+-commutative64.5%
associate-+l+64.5%
*-commutative64.5%
*-commutative64.5%
+-commutative64.5%
+-commutative64.5%
*-commutative64.5%
associate-+l+64.5%
+-commutative64.5%
distribute-rgt-in64.5%
Simplified64.5%
Taylor expanded in x around inf 41.8%
if 2.0000000000000001e-259 < y Initial program 66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
*-commutative66.2%
associate-+l+66.2%
+-commutative66.2%
distribute-rgt-in66.2%
Simplified66.2%
add-sqr-sqrt65.7%
pow265.7%
pow1/265.7%
sqrt-pow165.8%
distribute-rgt-in65.7%
associate-+r+65.7%
*-commutative65.7%
distribute-lft-in65.7%
fma-define65.9%
metadata-eval65.9%
Applied egg-rr65.9%
Taylor expanded in x around 0 18.7%
*-commutative18.7%
Simplified18.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 (* 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.4%
associate-+l+65.4%
*-commutative65.4%
*-commutative65.4%
*-commutative65.4%
+-commutative65.4%
+-commutative65.4%
associate-+l+65.4%
*-commutative65.4%
*-commutative65.4%
+-commutative65.4%
+-commutative65.4%
*-commutative65.4%
associate-+l+65.4%
+-commutative65.4%
distribute-rgt-in65.4%
Simplified65.4%
Final simplification65.4%
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-261) (* 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.5e-261) {
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.5d-261) 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.5e-261) {
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.5e-261: 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.5e-261) 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.5e-261)
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.5e-261], 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.5 \cdot 10^{-261}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < 1.5e-261Initial program 64.5%
associate-+l+64.5%
*-commutative64.5%
*-commutative64.5%
*-commutative64.5%
+-commutative64.5%
+-commutative64.5%
associate-+l+64.5%
*-commutative64.5%
*-commutative64.5%
+-commutative64.5%
+-commutative64.5%
*-commutative64.5%
associate-+l+64.5%
+-commutative64.5%
distribute-rgt-in64.5%
Simplified64.5%
Taylor expanded in z around 0 15.4%
*-commutative15.4%
Simplified15.4%
if 1.5e-261 < y Initial program 66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
*-commutative66.2%
associate-+l+66.2%
+-commutative66.2%
distribute-rgt-in66.2%
Simplified66.2%
add-sqr-sqrt65.7%
pow265.7%
pow1/265.7%
sqrt-pow165.8%
distribute-rgt-in65.7%
associate-+r+65.7%
*-commutative65.7%
distribute-lft-in65.7%
fma-define65.9%
metadata-eval65.9%
Applied egg-rr65.9%
Taylor expanded in x around 0 18.7%
*-commutative18.7%
Simplified18.7%
Final simplification17.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 65.4%
associate-+l+65.4%
*-commutative65.4%
*-commutative65.4%
*-commutative65.4%
+-commutative65.4%
+-commutative65.4%
associate-+l+65.4%
*-commutative65.4%
*-commutative65.4%
+-commutative65.4%
+-commutative65.4%
*-commutative65.4%
associate-+l+65.4%
+-commutative65.4%
distribute-rgt-in65.4%
Simplified65.4%
Taylor expanded in z around 0 22.6%
*-commutative22.6%
Simplified22.6%
(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 2024103
(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)))))