
(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 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= z -2.3e-130)
(* 2.0 (* (sqrt (* z x)) (sqrt (+ (+ 1.0 (/ y x)) (/ y z)))))
(if (<= z 4.3e+82)
(* 2.0 (sqrt (fma x z (* y (+ z x)))))
(* 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 (z <= -2.3e-130) {
tmp = 2.0 * (sqrt((z * x)) * sqrt(((1.0 + (y / x)) + (y / z))));
} else if (z <= 4.3e+82) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} 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 (z <= -2.3e-130) tmp = Float64(2.0 * Float64(sqrt(Float64(z * x)) * sqrt(Float64(Float64(1.0 + Float64(y / x)) + Float64(y / z))))); elseif (z <= 4.3e+82) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); 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[z, -2.3e-130], N[(2.0 * N[(N[Sqrt[N[(z * x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(1.0 + N[(y / x), $MachinePrecision]), $MachinePrecision] + N[(y / z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.3e+82], 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[(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}\;z \leq -2.3 \cdot 10^{-130}:\\
\;\;\;\;2 \cdot \left(\sqrt{z \cdot x} \cdot \sqrt{\left(1 + \frac{y}{x}\right) + \frac{y}{z}}\right)\\
\mathbf{elif}\;z \leq 4.3 \cdot 10^{+82}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\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 z < -2.3000000000000001e-130Initial program 69.9%
associate-+l+69.9%
*-commutative69.9%
*-commutative69.9%
*-commutative69.9%
+-commutative69.9%
+-commutative69.9%
associate-+l+69.9%
*-commutative69.9%
*-commutative69.9%
+-commutative69.9%
+-commutative69.9%
*-commutative69.9%
associate-+l+69.9%
+-commutative69.9%
distribute-rgt-in70.1%
Simplified70.1%
Taylor expanded in z around inf 67.8%
associate-/l*65.5%
Simplified65.5%
Taylor expanded in x around inf 60.7%
+-commutative60.7%
Simplified60.7%
associate-*r*61.8%
sqrt-prod47.6%
*-commutative47.6%
Applied egg-rr47.6%
+-commutative47.6%
associate-+r+47.6%
Simplified47.6%
if -2.3000000000000001e-130 < z < 4.30000000000000015e82Initial program 90.0%
associate-+l+90.0%
*-commutative90.0%
*-commutative90.0%
*-commutative90.0%
+-commutative90.0%
+-commutative90.0%
+-commutative90.0%
*-commutative90.0%
*-commutative90.0%
associate-+l+90.0%
+-commutative90.0%
fma-define90.0%
distribute-lft-out90.0%
Simplified90.0%
if 4.30000000000000015e82 < z Initial program 34.2%
associate-+l+34.2%
*-commutative34.2%
*-commutative34.2%
*-commutative34.2%
+-commutative34.2%
+-commutative34.2%
associate-+l+34.2%
*-commutative34.2%
*-commutative34.2%
+-commutative34.2%
+-commutative34.2%
*-commutative34.2%
associate-+l+34.2%
+-commutative34.2%
distribute-rgt-in34.3%
Simplified34.3%
Taylor expanded in z around inf 34.6%
associate-/l*35.4%
Simplified35.4%
*-commutative35.4%
sqrt-prod96.0%
+-commutative96.0%
fma-define96.0%
Applied egg-rr96.0%
Final simplification77.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (+ (+ (* z x) (* x y)) (* z y)) 5e+304) (* 2.0 (sqrt (fma (+ z x) y (* z x)))) (* 2.0 (* (sqrt z) (sqrt (* y (+ 1.0 (/ x z))))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if ((((z * x) + (x * y)) + (z * y)) <= 5e+304) {
tmp = 2.0 * sqrt(fma((z + x), y, (z * x)));
} else {
tmp = 2.0 * (sqrt(z) * sqrt((y * (1.0 + (x / z)))));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (Float64(Float64(Float64(z * x) + Float64(x * y)) + Float64(z * y)) <= 5e+304) tmp = Float64(2.0 * sqrt(fma(Float64(z + x), y, Float64(z * x)))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(Float64(y * Float64(1.0 + Float64(x / 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[N[(N[(N[(z * x), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] + N[(z * y), $MachinePrecision]), $MachinePrecision], 5e+304], N[(2.0 * N[Sqrt[N[(N[(z + x), $MachinePrecision] * y + N[(z * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[N[(y * N[(1.0 + N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;\left(z \cdot x + x \cdot y\right) + z \cdot y \leq 5 \cdot 10^{+304}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(z + x, y, z \cdot x\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y \cdot \left(1 + \frac{x}{z}\right)}\right)\\
\end{array}
\end{array}
if (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 4.9999999999999997e304Initial program 98.8%
associate-+l+98.8%
*-commutative98.8%
*-commutative98.8%
*-commutative98.8%
+-commutative98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
*-commutative98.8%
+-commutative98.8%
+-commutative98.8%
*-commutative98.8%
associate-+l+98.8%
+-commutative98.8%
distribute-rgt-in98.8%
Simplified98.8%
distribute-rgt-in98.8%
associate-+r+98.8%
*-commutative98.8%
distribute-lft-in98.8%
*-commutative98.8%
fma-define98.8%
Applied egg-rr98.8%
if 4.9999999999999997e304 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) Initial program 4.5%
associate-+l+4.5%
*-commutative4.5%
*-commutative4.5%
*-commutative4.5%
+-commutative4.5%
+-commutative4.5%
associate-+l+4.5%
*-commutative4.5%
*-commutative4.5%
+-commutative4.5%
+-commutative4.5%
*-commutative4.5%
associate-+l+4.5%
+-commutative4.5%
distribute-rgt-in4.7%
Simplified4.7%
Taylor expanded in z around inf 5.0%
associate-/l*5.8%
Simplified5.8%
Taylor expanded in y around inf 4.3%
*-commutative4.3%
sqrt-prod25.5%
Applied egg-rr25.5%
Final simplification78.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= z -5.2e-130)
(* 2.0 (* (sqrt (* z x)) (sqrt (+ (+ 1.0 (/ y x)) (/ y z)))))
(if (<= z 1.75e+83)
(* 2.0 (sqrt (fma x z (* y (+ z x)))))
(* 2.0 (* (sqrt z) (sqrt (* y (+ 1.0 (/ x z)))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (z <= -5.2e-130) {
tmp = 2.0 * (sqrt((z * x)) * sqrt(((1.0 + (y / x)) + (y / z))));
} else if (z <= 1.75e+83) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt((y * (1.0 + (x / z)))));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (z <= -5.2e-130) tmp = Float64(2.0 * Float64(sqrt(Float64(z * x)) * sqrt(Float64(Float64(1.0 + Float64(y / x)) + Float64(y / z))))); elseif (z <= 1.75e+83) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(Float64(y * Float64(1.0 + Float64(x / 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[z, -5.2e-130], N[(2.0 * N[(N[Sqrt[N[(z * x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(1.0 + N[(y / x), $MachinePrecision]), $MachinePrecision] + N[(y / z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.75e+83], 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[(y * N[(1.0 + N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -5.2 \cdot 10^{-130}:\\
\;\;\;\;2 \cdot \left(\sqrt{z \cdot x} \cdot \sqrt{\left(1 + \frac{y}{x}\right) + \frac{y}{z}}\right)\\
\mathbf{elif}\;z \leq 1.75 \cdot 10^{+83}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y \cdot \left(1 + \frac{x}{z}\right)}\right)\\
\end{array}
\end{array}
if z < -5.2000000000000001e-130Initial program 69.9%
associate-+l+69.9%
*-commutative69.9%
*-commutative69.9%
*-commutative69.9%
+-commutative69.9%
+-commutative69.9%
associate-+l+69.9%
*-commutative69.9%
*-commutative69.9%
+-commutative69.9%
+-commutative69.9%
*-commutative69.9%
associate-+l+69.9%
+-commutative69.9%
distribute-rgt-in70.1%
Simplified70.1%
Taylor expanded in z around inf 67.8%
associate-/l*65.5%
Simplified65.5%
Taylor expanded in x around inf 60.7%
+-commutative60.7%
Simplified60.7%
associate-*r*61.8%
sqrt-prod47.6%
*-commutative47.6%
Applied egg-rr47.6%
+-commutative47.6%
associate-+r+47.6%
Simplified47.6%
if -5.2000000000000001e-130 < z < 1.74999999999999989e83Initial program 90.0%
associate-+l+90.0%
*-commutative90.0%
*-commutative90.0%
*-commutative90.0%
+-commutative90.0%
+-commutative90.0%
+-commutative90.0%
*-commutative90.0%
*-commutative90.0%
associate-+l+90.0%
+-commutative90.0%
fma-define90.0%
distribute-lft-out90.0%
Simplified90.0%
if 1.74999999999999989e83 < z Initial program 34.2%
associate-+l+34.2%
*-commutative34.2%
*-commutative34.2%
*-commutative34.2%
+-commutative34.2%
+-commutative34.2%
associate-+l+34.2%
*-commutative34.2%
*-commutative34.2%
+-commutative34.2%
+-commutative34.2%
*-commutative34.2%
associate-+l+34.2%
+-commutative34.2%
distribute-rgt-in34.3%
Simplified34.3%
Taylor expanded in z around inf 34.6%
associate-/l*35.4%
Simplified35.4%
Taylor expanded in y around inf 14.6%
*-commutative14.6%
sqrt-prod44.2%
Applied egg-rr44.2%
Final simplification67.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.55e+36) (* 2.0 (sqrt (fma x z (* y (+ z x))))) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.55e+36) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.55e+36) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); end return tmp end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 1.55e+36], 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[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.55 \cdot 10^{+36}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 1.55e36Initial program 78.4%
associate-+l+78.4%
*-commutative78.4%
*-commutative78.4%
*-commutative78.4%
+-commutative78.4%
+-commutative78.4%
+-commutative78.4%
*-commutative78.4%
*-commutative78.4%
associate-+l+78.4%
+-commutative78.4%
fma-define78.4%
distribute-lft-out78.5%
Simplified78.5%
if 1.55e36 < y Initial program 53.6%
associate-+l+53.6%
*-commutative53.6%
*-commutative53.6%
*-commutative53.6%
+-commutative53.6%
+-commutative53.6%
associate-+l+53.6%
*-commutative53.6%
*-commutative53.6%
+-commutative53.6%
+-commutative53.6%
*-commutative53.6%
associate-+l+53.6%
+-commutative53.6%
distribute-rgt-in53.9%
Simplified53.9%
Taylor expanded in z around inf 44.4%
associate-/l*38.1%
Simplified38.1%
Taylor expanded in x around 0 24.0%
sqrt-prod49.1%
Applied egg-rr49.1%
Final simplification71.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.05e+36) (* 2.0 (sqrt (+ (* x y) (* z (+ x y))))) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.05e+36) {
tmp = 2.0 * sqrt(((x * y) + (z * (x + y))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 2.05d+36) then
tmp = 2.0d0 * sqrt(((x * y) + (z * (x + y))))
else
tmp = 2.0d0 * (sqrt(z) * sqrt(y))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 2.05e+36) {
tmp = 2.0 * Math.sqrt(((x * y) + (z * (x + y))));
} else {
tmp = 2.0 * (Math.sqrt(z) * Math.sqrt(y));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 2.05e+36: tmp = 2.0 * math.sqrt(((x * y) + (z * (x + y)))) else: tmp = 2.0 * (math.sqrt(z) * math.sqrt(y)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.05e+36) tmp = Float64(2.0 * sqrt(Float64(Float64(x * y) + Float64(z * Float64(x + y))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 2.05e+36)
tmp = 2.0 * sqrt(((x * y) + (z * (x + y))));
else
tmp = 2.0 * (sqrt(z) * sqrt(y));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 2.05e+36], N[(2.0 * N[Sqrt[N[(N[(x * y), $MachinePrecision] + N[(z * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.05 \cdot 10^{+36}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot y + z \cdot \left(x + y\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 2.05000000000000006e36Initial program 78.4%
associate-+l+78.4%
*-commutative78.4%
*-commutative78.4%
*-commutative78.4%
+-commutative78.4%
+-commutative78.4%
associate-+l+78.4%
*-commutative78.4%
*-commutative78.4%
+-commutative78.4%
+-commutative78.4%
*-commutative78.4%
associate-+l+78.4%
+-commutative78.4%
distribute-rgt-in78.4%
Simplified78.4%
if 2.05000000000000006e36 < y Initial program 53.6%
associate-+l+53.6%
*-commutative53.6%
*-commutative53.6%
*-commutative53.6%
+-commutative53.6%
+-commutative53.6%
associate-+l+53.6%
*-commutative53.6%
*-commutative53.6%
+-commutative53.6%
+-commutative53.6%
*-commutative53.6%
associate-+l+53.6%
+-commutative53.6%
distribute-rgt-in53.9%
Simplified53.9%
Taylor expanded in z around inf 44.4%
associate-/l*38.1%
Simplified38.1%
Taylor expanded in x around 0 24.0%
sqrt-prod49.1%
Applied egg-rr49.1%
Final simplification71.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 3.5e-269) (* 2.0 (sqrt (* x (+ z y)))) (* 2.0 (sqrt (* z y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 3.5e-269) {
tmp = 2.0 * sqrt((x * (z + y)));
} else {
tmp = 2.0 * sqrt((z * 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 <= 3.5d-269) then
tmp = 2.0d0 * sqrt((x * (z + y)))
else
tmp = 2.0d0 * sqrt((z * 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 <= 3.5e-269) {
tmp = 2.0 * Math.sqrt((x * (z + y)));
} else {
tmp = 2.0 * Math.sqrt((z * y));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 3.5e-269: tmp = 2.0 * math.sqrt((x * (z + y))) else: tmp = 2.0 * math.sqrt((z * y)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 3.5e-269) tmp = Float64(2.0 * sqrt(Float64(x * Float64(z + y)))); else tmp = Float64(2.0 * sqrt(Float64(z * 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 <= 3.5e-269)
tmp = 2.0 * sqrt((x * (z + y)));
else
tmp = 2.0 * sqrt((z * 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, 3.5e-269], N[(2.0 * N[Sqrt[N[(x * N[(z + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 3.5 \cdot 10^{-269}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(z + y\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot y}\\
\end{array}
\end{array}
if y < 3.50000000000000019e-269Initial program 77.1%
associate-+l+77.1%
*-commutative77.1%
*-commutative77.1%
*-commutative77.1%
+-commutative77.1%
+-commutative77.1%
associate-+l+77.1%
*-commutative77.1%
*-commutative77.1%
+-commutative77.1%
+-commutative77.1%
*-commutative77.1%
associate-+l+77.1%
+-commutative77.1%
distribute-rgt-in77.1%
Simplified77.1%
Taylor expanded in x around inf 54.1%
if 3.50000000000000019e-269 < 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.4%
Simplified68.4%
Taylor expanded in x around 0 24.4%
Final simplification39.0%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1e-294) (* 2.0 (sqrt (* x (+ z y)))) (* 2.0 (sqrt (* z (+ x y))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1e-294) {
tmp = 2.0 * sqrt((x * (z + y)));
} else {
tmp = 2.0 * sqrt((z * (x + 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 <= 1d-294) then
tmp = 2.0d0 * sqrt((x * (z + y)))
else
tmp = 2.0d0 * sqrt((z * (x + 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 <= 1e-294) {
tmp = 2.0 * Math.sqrt((x * (z + y)));
} else {
tmp = 2.0 * Math.sqrt((z * (x + y)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 1e-294: tmp = 2.0 * math.sqrt((x * (z + y))) else: tmp = 2.0 * math.sqrt((z * (x + y))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1e-294) tmp = Float64(2.0 * sqrt(Float64(x * Float64(z + y)))); else tmp = Float64(2.0 * sqrt(Float64(z * Float64(x + 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 <= 1e-294)
tmp = 2.0 * sqrt((x * (z + y)));
else
tmp = 2.0 * sqrt((z * (x + 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, 1e-294], N[(2.0 * N[Sqrt[N[(x * N[(z + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * N[(x + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 10^{-294}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(z + y\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(x + y\right)}\\
\end{array}
\end{array}
if y < 1.00000000000000002e-294Initial program 76.9%
associate-+l+76.9%
*-commutative76.9%
*-commutative76.9%
*-commutative76.9%
+-commutative76.9%
+-commutative76.9%
associate-+l+76.9%
*-commutative76.9%
*-commutative76.9%
+-commutative76.9%
+-commutative76.9%
*-commutative76.9%
associate-+l+76.9%
+-commutative76.9%
distribute-rgt-in76.9%
Simplified76.9%
Taylor expanded in x around inf 53.0%
if 1.00000000000000002e-294 < y Initial program 68.7%
associate-+l+68.7%
*-commutative68.7%
*-commutative68.7%
*-commutative68.7%
+-commutative68.7%
+-commutative68.7%
associate-+l+68.7%
*-commutative68.7%
*-commutative68.7%
+-commutative68.7%
+-commutative68.7%
*-commutative68.7%
associate-+l+68.7%
+-commutative68.7%
distribute-rgt-in68.9%
Simplified68.9%
Taylor expanded in z around inf 40.3%
+-commutative40.3%
Simplified40.3%
Final simplification46.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (* x y) (* z (+ x y))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt(((x * y) + (z * (x + y))));
}
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(((x * y) + (z * (x + y))))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt(((x * y) + (z * (x + y))));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt(((x * y) + (z * (x + y))))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(x * y) + Float64(z * Float64(x + y))))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt(((x * y) + (z * (x + y))));
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[(x * y), $MachinePrecision] + N[(z * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{x \cdot y + z \cdot \left(x + y\right)}
\end{array}
Initial program 72.6%
associate-+l+72.6%
*-commutative72.6%
*-commutative72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
associate-+l+72.6%
*-commutative72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
*-commutative72.6%
associate-+l+72.6%
+-commutative72.6%
distribute-rgt-in72.7%
Simplified72.7%
Final simplification72.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -5e-310) (* 2.0 (sqrt (* x y))) (* 2.0 (sqrt (* z y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -5e-310) {
tmp = 2.0 * sqrt((x * y));
} else {
tmp = 2.0 * sqrt((z * 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 <= (-5d-310)) then
tmp = 2.0d0 * sqrt((x * y))
else
tmp = 2.0d0 * sqrt((z * 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 <= -5e-310) {
tmp = 2.0 * Math.sqrt((x * y));
} else {
tmp = 2.0 * Math.sqrt((z * y));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -5e-310: tmp = 2.0 * math.sqrt((x * y)) else: tmp = 2.0 * math.sqrt((z * y)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -5e-310) tmp = Float64(2.0 * sqrt(Float64(x * y))); else tmp = Float64(2.0 * sqrt(Float64(z * 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 <= -5e-310)
tmp = 2.0 * sqrt((x * y));
else
tmp = 2.0 * sqrt((z * 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, -5e-310], N[(2.0 * N[Sqrt[N[(x * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -5 \cdot 10^{-310}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot y}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot y}\\
\end{array}
\end{array}
if y < -4.999999999999985e-310Initial program 76.3%
associate-+l+76.3%
*-commutative76.3%
*-commutative76.3%
*-commutative76.3%
+-commutative76.3%
+-commutative76.3%
associate-+l+76.3%
*-commutative76.3%
*-commutative76.3%
+-commutative76.3%
+-commutative76.3%
*-commutative76.3%
associate-+l+76.3%
+-commutative76.3%
distribute-rgt-in76.3%
Simplified76.3%
Taylor expanded in z around 0 24.8%
*-commutative24.8%
Simplified24.8%
if -4.999999999999985e-310 < y Initial program 69.4%
associate-+l+69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
+-commutative69.4%
+-commutative69.4%
associate-+l+69.4%
*-commutative69.4%
*-commutative69.4%
+-commutative69.4%
+-commutative69.4%
*-commutative69.4%
associate-+l+69.4%
+-commutative69.4%
distribute-rgt-in69.6%
Simplified69.6%
Taylor expanded in x around 0 23.1%
Final simplification23.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 (* x y))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt((x * y));
}
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((x * y))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((x * y));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt((x * y))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(x * y))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt((x * y));
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[(x * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{x \cdot y}
\end{array}
Initial program 72.6%
associate-+l+72.6%
*-commutative72.6%
*-commutative72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
associate-+l+72.6%
*-commutative72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
*-commutative72.6%
associate-+l+72.6%
+-commutative72.6%
distribute-rgt-in72.7%
Simplified72.7%
Taylor expanded in z around 0 27.5%
*-commutative27.5%
Simplified27.5%
Final simplification27.5%
(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 2024077
(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)))))