
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -40000000000000.0)
(* 2.0 (pow (exp (* 0.25 (- (log (- 0.0 x)) (log (/ -1.0 y))))) 2.0))
(if (<= y 4.3e-271)
(* 2.0 (sqrt (+ (* x z) (* y (+ x z)))))
(* 2.0 (* (pow (/ 1.0 z) -0.5) (pow (/ 1.0 (+ y x)) -0.5))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -40000000000000.0) {
tmp = 2.0 * pow(exp((0.25 * (log((0.0 - x)) - log((-1.0 / y))))), 2.0);
} else if (y <= 4.3e-271) {
tmp = 2.0 * sqrt(((x * z) + (y * (x + z))));
} else {
tmp = 2.0 * (pow((1.0 / z), -0.5) * pow((1.0 / (y + x)), -0.5));
}
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 <= (-40000000000000.0d0)) then
tmp = 2.0d0 * (exp((0.25d0 * (log((0.0d0 - x)) - log(((-1.0d0) / y))))) ** 2.0d0)
else if (y <= 4.3d-271) then
tmp = 2.0d0 * sqrt(((x * z) + (y * (x + z))))
else
tmp = 2.0d0 * (((1.0d0 / z) ** (-0.5d0)) * ((1.0d0 / (y + x)) ** (-0.5d0)))
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 <= -40000000000000.0) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log((0.0 - x)) - Math.log((-1.0 / y))))), 2.0);
} else if (y <= 4.3e-271) {
tmp = 2.0 * Math.sqrt(((x * z) + (y * (x + z))));
} else {
tmp = 2.0 * (Math.pow((1.0 / z), -0.5) * Math.pow((1.0 / (y + x)), -0.5));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -40000000000000.0: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log((0.0 - x)) - math.log((-1.0 / y))))), 2.0) elif y <= 4.3e-271: tmp = 2.0 * math.sqrt(((x * z) + (y * (x + z)))) else: tmp = 2.0 * (math.pow((1.0 / z), -0.5) * math.pow((1.0 / (y + x)), -0.5)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -40000000000000.0) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(0.0 - x)) - log(Float64(-1.0 / y))))) ^ 2.0)); elseif (y <= 4.3e-271) tmp = Float64(2.0 * sqrt(Float64(Float64(x * z) + Float64(y * Float64(x + z))))); else tmp = Float64(2.0 * Float64((Float64(1.0 / z) ^ -0.5) * (Float64(1.0 / Float64(y + x)) ^ -0.5))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -40000000000000.0)
tmp = 2.0 * (exp((0.25 * (log((0.0 - x)) - log((-1.0 / y))))) ^ 2.0);
elseif (y <= 4.3e-271)
tmp = 2.0 * sqrt(((x * z) + (y * (x + z))));
else
tmp = 2.0 * (((1.0 / z) ^ -0.5) * ((1.0 / (y + x)) ^ -0.5));
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, -40000000000000.0], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[(0.0 - x), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.3e-271], N[(2.0 * N[Sqrt[N[(N[(x * z), $MachinePrecision] + N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Power[N[(1.0 / z), $MachinePrecision], -0.5], $MachinePrecision] * N[Power[N[(1.0 / N[(y + x), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -40000000000000:\\
\;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(0 - x\right) - \log \left(\frac{-1}{y}\right)\right)}\right)}^{2}\\
\mathbf{elif}\;y \leq 4.3 \cdot 10^{-271}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot z + y \cdot \left(x + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left({\left(\frac{1}{z}\right)}^{-0.5} \cdot {\left(\frac{1}{y + x}\right)}^{-0.5}\right)\\
\end{array}
\end{array}
if y < -4e13Initial program 50.3%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6431.0%
Simplified31.0%
pow1/2N/A
sqr-powN/A
pow2N/A
pow-lowering-pow.f64N/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-eval31.3%
Applied egg-rr31.3%
Taylor expanded in y around -inf
exp-lowering-exp.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
log-lowering-log.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
log-lowering-log.f64N/A
/-lowering-/.f6446.2%
Simplified46.2%
if -4e13 < y < 4.3e-271Initial program 85.3%
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6485.2%
Applied egg-rr85.2%
if 4.3e-271 < y Initial program 70.0%
flip3-+N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
Applied egg-rr69.9%
Taylor expanded in z around -inf
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6447.0%
Simplified47.0%
pow1/2N/A
pow-flipN/A
metadata-evalN/A
div-invN/A
mul-1-negN/A
mul-1-negN/A
frac-2negN/A
div-invN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6456.0%
Applied egg-rr56.0%
Final simplification61.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.8e-296) (* 2.0 (pow (/ (/ 1.0 x) (+ y z)) -0.5)) (* 2.0 (* (pow (/ 1.0 z) -0.5) (pow (/ 1.0 (+ y x)) -0.5)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.8e-296) {
tmp = 2.0 * pow(((1.0 / x) / (y + z)), -0.5);
} else {
tmp = 2.0 * (pow((1.0 / z), -0.5) * pow((1.0 / (y + x)), -0.5));
}
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.8d-296) then
tmp = 2.0d0 * (((1.0d0 / x) / (y + z)) ** (-0.5d0))
else
tmp = 2.0d0 * (((1.0d0 / z) ** (-0.5d0)) * ((1.0d0 / (y + x)) ** (-0.5d0)))
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.8e-296) {
tmp = 2.0 * Math.pow(((1.0 / x) / (y + z)), -0.5);
} else {
tmp = 2.0 * (Math.pow((1.0 / z), -0.5) * Math.pow((1.0 / (y + x)), -0.5));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 2.8e-296: tmp = 2.0 * math.pow(((1.0 / x) / (y + z)), -0.5) else: tmp = 2.0 * (math.pow((1.0 / z), -0.5) * math.pow((1.0 / (y + x)), -0.5)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.8e-296) tmp = Float64(2.0 * (Float64(Float64(1.0 / x) / Float64(y + z)) ^ -0.5)); else tmp = Float64(2.0 * Float64((Float64(1.0 / z) ^ -0.5) * (Float64(1.0 / Float64(y + x)) ^ -0.5))); 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.8e-296)
tmp = 2.0 * (((1.0 / x) / (y + z)) ^ -0.5);
else
tmp = 2.0 * (((1.0 / z) ^ -0.5) * ((1.0 / (y + x)) ^ -0.5));
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.8e-296], N[(2.0 * N[Power[N[(N[(1.0 / x), $MachinePrecision] / N[(y + z), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Power[N[(1.0 / z), $MachinePrecision], -0.5], $MachinePrecision] * N[Power[N[(1.0 / N[(y + x), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.8 \cdot 10^{-296}:\\
\;\;\;\;2 \cdot {\left(\frac{\frac{1}{x}}{y + z}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left({\left(\frac{1}{z}\right)}^{-0.5} \cdot {\left(\frac{1}{y + x}\right)}^{-0.5}\right)\\
\end{array}
\end{array}
if y < 2.7999999999999999e-296Initial program 67.6%
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.6%
Applied egg-rr67.6%
flip-+N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
Applied egg-rr34.1%
inv-powN/A
pow1/2N/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
flip-+N/A
metadata-evalN/A
Applied egg-rr67.5%
Taylor expanded in x around inf
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6450.6%
Simplified50.6%
if 2.7999999999999999e-296 < y Initial program 70.8%
flip3-+N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
Applied egg-rr70.6%
Taylor expanded in z around -inf
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6447.9%
Simplified47.9%
pow1/2N/A
pow-flipN/A
metadata-evalN/A
div-invN/A
mul-1-negN/A
mul-1-negN/A
frac-2negN/A
div-invN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6455.5%
Applied egg-rr55.5%
Final simplification52.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.8e-296) (* 2.0 (pow (/ (/ 1.0 x) (+ y z)) -0.5)) (* 2.0 (/ (pow (+ y x) 0.5) (pow z -0.5)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.8e-296) {
tmp = 2.0 * pow(((1.0 / x) / (y + z)), -0.5);
} else {
tmp = 2.0 * (pow((y + x), 0.5) / pow(z, -0.5));
}
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.8d-296) then
tmp = 2.0d0 * (((1.0d0 / x) / (y + z)) ** (-0.5d0))
else
tmp = 2.0d0 * (((y + x) ** 0.5d0) / (z ** (-0.5d0)))
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.8e-296) {
tmp = 2.0 * Math.pow(((1.0 / x) / (y + z)), -0.5);
} else {
tmp = 2.0 * (Math.pow((y + x), 0.5) / Math.pow(z, -0.5));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 2.8e-296: tmp = 2.0 * math.pow(((1.0 / x) / (y + z)), -0.5) else: tmp = 2.0 * (math.pow((y + x), 0.5) / math.pow(z, -0.5)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.8e-296) tmp = Float64(2.0 * (Float64(Float64(1.0 / x) / Float64(y + z)) ^ -0.5)); else tmp = Float64(2.0 * Float64((Float64(y + x) ^ 0.5) / (z ^ -0.5))); 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.8e-296)
tmp = 2.0 * (((1.0 / x) / (y + z)) ^ -0.5);
else
tmp = 2.0 * (((y + x) ^ 0.5) / (z ^ -0.5));
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.8e-296], N[(2.0 * N[Power[N[(N[(1.0 / x), $MachinePrecision] / N[(y + z), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Power[N[(y + x), $MachinePrecision], 0.5], $MachinePrecision] / N[Power[z, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.8 \cdot 10^{-296}:\\
\;\;\;\;2 \cdot {\left(\frac{\frac{1}{x}}{y + z}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \frac{{\left(y + x\right)}^{0.5}}{{z}^{-0.5}}\\
\end{array}
\end{array}
if y < 2.7999999999999999e-296Initial program 67.6%
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.6%
Applied egg-rr67.6%
flip-+N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
Applied egg-rr34.1%
inv-powN/A
pow1/2N/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
flip-+N/A
metadata-evalN/A
Applied egg-rr67.5%
Taylor expanded in x around inf
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6450.6%
Simplified50.6%
if 2.7999999999999999e-296 < y Initial program 70.8%
flip3-+N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
Applied egg-rr70.6%
Taylor expanded in z around -inf
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6447.9%
Simplified47.9%
sqrt-divN/A
clear-numN/A
sqrt-divN/A
mul-1-negN/A
div-invN/A
mul-1-negN/A
frac-2negN/A
sqrt-divN/A
/-lowering-/.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
pow-lowering-pow.f6455.4%
Applied egg-rr55.4%
Final simplification52.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.8e-296) (* 2.0 (pow (/ (/ 1.0 x) (+ y z)) -0.5)) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.8e-296) {
tmp = 2.0 * pow(((1.0 / x) / (y + z)), -0.5);
} 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.8d-296) then
tmp = 2.0d0 * (((1.0d0 / x) / (y + z)) ** (-0.5d0))
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.8e-296) {
tmp = 2.0 * Math.pow(((1.0 / x) / (y + z)), -0.5);
} 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.8e-296: tmp = 2.0 * math.pow(((1.0 / x) / (y + z)), -0.5) 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.8e-296) tmp = Float64(2.0 * (Float64(Float64(1.0 / x) / Float64(y + z)) ^ -0.5)); 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.8e-296)
tmp = 2.0 * (((1.0 / x) / (y + z)) ^ -0.5);
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.8e-296], N[(2.0 * N[Power[N[(N[(1.0 / x), $MachinePrecision] / N[(y + z), $MachinePrecision]), $MachinePrecision], -0.5], $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.8 \cdot 10^{-296}:\\
\;\;\;\;2 \cdot {\left(\frac{\frac{1}{x}}{y + z}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 2.7999999999999999e-296Initial program 67.6%
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.6%
Applied egg-rr67.6%
flip-+N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
Applied egg-rr34.1%
inv-powN/A
pow1/2N/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
flip-+N/A
metadata-evalN/A
Applied egg-rr67.5%
Taylor expanded in x around inf
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6450.6%
Simplified50.6%
if 2.7999999999999999e-296 < y Initial program 70.8%
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6470.8%
Applied egg-rr70.8%
Taylor expanded in x around 0
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6423.9%
Simplified23.9%
pow1/2N/A
*-commutativeN/A
metadata-evalN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f6437.6%
Applied egg-rr37.6%
Final simplification44.4%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (+ (+ (* x z) (* y x)) (* y z)) 2e+298) (* 2.0 (sqrt (+ (* x z) (* y (+ x z))))) (* 2.0 (pow (/ (/ 1.0 y) (+ x z)) -0.5))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if ((((x * z) + (y * x)) + (y * z)) <= 2e+298) {
tmp = 2.0 * sqrt(((x * z) + (y * (x + z))));
} else {
tmp = 2.0 * pow(((1.0 / y) / (x + z)), -0.5);
}
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 ((((x * z) + (y * x)) + (y * z)) <= 2d+298) then
tmp = 2.0d0 * sqrt(((x * z) + (y * (x + z))))
else
tmp = 2.0d0 * (((1.0d0 / y) / (x + z)) ** (-0.5d0))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if ((((x * z) + (y * x)) + (y * z)) <= 2e+298) {
tmp = 2.0 * Math.sqrt(((x * z) + (y * (x + z))));
} else {
tmp = 2.0 * Math.pow(((1.0 / y) / (x + z)), -0.5);
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if (((x * z) + (y * x)) + (y * z)) <= 2e+298: tmp = 2.0 * math.sqrt(((x * z) + (y * (x + z)))) else: tmp = 2.0 * math.pow(((1.0 / y) / (x + z)), -0.5) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (Float64(Float64(Float64(x * z) + Float64(y * x)) + Float64(y * z)) <= 2e+298) tmp = Float64(2.0 * sqrt(Float64(Float64(x * z) + Float64(y * Float64(x + z))))); else tmp = Float64(2.0 * (Float64(Float64(1.0 / y) / Float64(x + z)) ^ -0.5)); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((((x * z) + (y * x)) + (y * z)) <= 2e+298)
tmp = 2.0 * sqrt(((x * z) + (y * (x + z))));
else
tmp = 2.0 * (((1.0 / y) / (x + z)) ^ -0.5);
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[N[(N[(N[(x * z), $MachinePrecision] + N[(y * x), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision], 2e+298], N[(2.0 * N[Sqrt[N[(N[(x * z), $MachinePrecision] + N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Power[N[(N[(1.0 / y), $MachinePrecision] / N[(x + z), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;\left(x \cdot z + y \cdot x\right) + y \cdot z \leq 2 \cdot 10^{+298}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot z + y \cdot \left(x + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot {\left(\frac{\frac{1}{y}}{x + z}\right)}^{-0.5}\\
\end{array}
\end{array}
if (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 1.9999999999999999e298Initial program 96.5%
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6496.5%
Applied egg-rr96.5%
if 1.9999999999999999e298 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) Initial program 10.9%
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6411.0%
Applied egg-rr11.0%
flip-+N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
Applied egg-rr0.1%
inv-powN/A
pow1/2N/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
flip-+N/A
metadata-evalN/A
Applied egg-rr10.9%
Taylor expanded in y around inf
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6416.0%
Simplified16.0%
Final simplification70.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.3e-299) (* 2.0 (pow (/ (/ 1.0 x) (+ y z)) -0.5)) (* 2.0 (sqrt (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1.3e-299) {
tmp = 2.0 * pow(((1.0 / x) / (y + z)), -0.5);
} 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.3d-299)) then
tmp = 2.0d0 * (((1.0d0 / x) / (y + z)) ** (-0.5d0))
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.3e-299) {
tmp = 2.0 * Math.pow(((1.0 / x) / (y + z)), -0.5);
} 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.3e-299: tmp = 2.0 * math.pow(((1.0 / x) / (y + z)), -0.5) 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.3e-299) tmp = Float64(2.0 * (Float64(Float64(1.0 / x) / Float64(y + z)) ^ -0.5)); 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.3e-299)
tmp = 2.0 * (((1.0 / x) / (y + z)) ^ -0.5);
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.3e-299], N[(2.0 * N[Power[N[(N[(1.0 / x), $MachinePrecision] / N[(y + z), $MachinePrecision]), $MachinePrecision], -0.5], $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.3 \cdot 10^{-299}:\\
\;\;\;\;2 \cdot {\left(\frac{\frac{1}{x}}{y + z}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -1.2999999999999999e-299Initial program 65.8%
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6465.9%
Applied egg-rr65.9%
flip-+N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
Applied egg-rr32.0%
inv-powN/A
pow1/2N/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
flip-+N/A
metadata-evalN/A
Applied egg-rr65.7%
Taylor expanded in x around inf
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6447.9%
Simplified47.9%
if -1.2999999999999999e-299 < y Initial program 72.4%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6449.3%
Simplified49.3%
Final simplification48.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -5e-289) (* 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 <= -5e-289) {
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 <= (-5d-289)) 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 <= -5e-289) {
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 <= -5e-289: 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 <= -5e-289) 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 <= -5e-289)
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, -5e-289], 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 -5 \cdot 10^{-289}:\\
\;\;\;\;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 < -5.00000000000000029e-289Initial program 66.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6446.0%
Simplified46.0%
if -5.00000000000000029e-289 < y Initial program 72.1%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6449.3%
Simplified49.3%
Final simplification47.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.8e-296) (* 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 <= 2.8e-296) {
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 <= 2.8d-296) 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 <= 2.8e-296) {
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 <= 2.8e-296: 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 <= 2.8e-296) 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 <= 2.8e-296)
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, 2.8e-296], 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.8 \cdot 10^{-296}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < 2.7999999999999999e-296Initial program 67.6%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6448.9%
Simplified48.9%
if 2.7999999999999999e-296 < y Initial program 70.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6423.9%
Simplified23.9%
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 (* y x))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -5e-310) {
tmp = 2.0 * sqrt((y * x));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-5d-310)) then
tmp = 2.0d0 * sqrt((y * x))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -5e-310) {
tmp = 2.0 * Math.sqrt((y * x));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -5e-310: tmp = 2.0 * math.sqrt((y * x)) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -5e-310) tmp = Float64(2.0 * sqrt(Float64(y * x))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -5e-310)
tmp = 2.0 * sqrt((y * x));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -5e-310], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -5 \cdot 10^{-310}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -4.999999999999985e-310Initial program 66.6%
Taylor expanded in z around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6426.4%
Simplified26.4%
if -4.999999999999985e-310 < y Initial program 71.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6423.2%
Simplified23.2%
Final simplification24.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (pow (/ (/ 1.0 y) (+ x z)) -0.5)))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * pow(((1.0 / y) / (x + z)), -0.5);
}
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 * (((1.0d0 / y) / (x + z)) ** (-0.5d0))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.pow(((1.0 / y) / (x + z)), -0.5);
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.pow(((1.0 / y) / (x + z)), -0.5)
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * (Float64(Float64(1.0 / y) / Float64(x + z)) ^ -0.5)) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * (((1.0 / y) / (x + z)) ^ -0.5);
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Power[N[(N[(1.0 / y), $MachinePrecision] / N[(x + z), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot {\left(\frac{\frac{1}{y}}{x + z}\right)}^{-0.5}
\end{array}
Initial program 69.1%
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6469.1%
Applied egg-rr69.1%
flip-+N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
Applied egg-rr34.9%
inv-powN/A
pow1/2N/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
flip-+N/A
metadata-evalN/A
Applied egg-rr69.0%
Taylor expanded in y around inf
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6447.7%
Simplified47.7%
Final simplification47.7%
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 69.1%
Taylor expanded in z around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6425.5%
Simplified25.5%
Final simplification25.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 2024191
(FPCore (x y z)
:name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
:precision binary64
:alt
(! :herbie-platform default (if (< z 763695009057367500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* 2 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4))) (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4)))) 2)))
(* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))