
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 25 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
(FPCore (n U t l Om U*)
:precision binary64
(if (<= U -1e-310)
(sqrt
(*
n
(*
U
(* 2.0 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))))
(*
(sqrt
(fma (+ (* l -2.0) (/ (- U* U) (/ Om (* l n)))) (/ n (/ Om l)) (* t n)))
(sqrt (* U 2.0)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= -1e-310) {
tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = sqrt(fma(((l * -2.0) + ((U_42_ - U) / (Om / (l * n)))), (n / (Om / l)), (t * n))) * sqrt((U * 2.0));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U <= -1e-310) tmp = sqrt(Float64(n * Float64(U * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))); else tmp = Float64(sqrt(fma(Float64(Float64(l * -2.0) + Float64(Float64(U_42_ - U) / Float64(Om / Float64(l * n)))), Float64(n / Float64(Om / l)), Float64(t * n))) * sqrt(Float64(U * 2.0))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U, -1e-310], N[Sqrt[N[(n * N[(U * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(N[(N[(l * -2.0), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] / N[(Om / N[(l * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(n / N[(Om / l), $MachinePrecision]), $MachinePrecision] + N[(t * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{n \cdot \left(U \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\ell \cdot -2 + \frac{U* - U}{\frac{Om}{\ell \cdot n}}, \frac{n}{\frac{Om}{\ell}}, t \cdot n\right)} \cdot \sqrt{U \cdot 2}\\
\end{array}
\end{array}
if U < -9.999999999999969e-311Initial program 52.6%
Simplified61.5%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr62.5%
if -9.999999999999969e-311 < U Initial program 45.3%
Simplified56.5%
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr76.1%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
div-invN/A
clear-numN/A
associate-*l*N/A
clear-numN/A
associate-/r/N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr80.3%
Final simplification71.7%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= n -1.32e-114)
(sqrt
(*
n
(*
U
(* 2.0 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))))
(if (<= n 7.2e-240)
(sqrt (+ (* (* t n) (* U 2.0)) (* -4.0 (/ (* (* l n) (* U l)) Om))))
(*
(sqrt n)
(sqrt
(*
(* U 2.0)
(+ t (/ (+ (* l -2.0) (* (* l n) (/ U* Om))) (/ Om l)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= -1.32e-114) {
tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else if (n <= 7.2e-240) {
tmp = sqrt((((t * n) * (U * 2.0)) + (-4.0 * (((l * n) * (U * l)) / Om))));
} else {
tmp = sqrt(n) * sqrt(((U * 2.0) * (t + (((l * -2.0) + ((l * n) * (U_42_ / Om))) / (Om / l)))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (n <= (-1.32d-114)) then
tmp = sqrt((n * (u * (2.0d0 * (t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l)))))))
else if (n <= 7.2d-240) then
tmp = sqrt((((t * n) * (u * 2.0d0)) + ((-4.0d0) * (((l * n) * (u * l)) / om))))
else
tmp = sqrt(n) * sqrt(((u * 2.0d0) * (t + (((l * (-2.0d0)) + ((l * n) * (u_42 / om))) / (om / l)))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= -1.32e-114) {
tmp = Math.sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else if (n <= 7.2e-240) {
tmp = Math.sqrt((((t * n) * (U * 2.0)) + (-4.0 * (((l * n) * (U * l)) / Om))));
} else {
tmp = Math.sqrt(n) * Math.sqrt(((U * 2.0) * (t + (((l * -2.0) + ((l * n) * (U_42_ / Om))) / (Om / l)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if n <= -1.32e-114: tmp = math.sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))) elif n <= 7.2e-240: tmp = math.sqrt((((t * n) * (U * 2.0)) + (-4.0 * (((l * n) * (U * l)) / Om)))) else: tmp = math.sqrt(n) * math.sqrt(((U * 2.0) * (t + (((l * -2.0) + ((l * n) * (U_42_ / Om))) / (Om / l))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (n <= -1.32e-114) tmp = sqrt(Float64(n * Float64(U * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))); elseif (n <= 7.2e-240) tmp = sqrt(Float64(Float64(Float64(t * n) * Float64(U * 2.0)) + Float64(-4.0 * Float64(Float64(Float64(l * n) * Float64(U * l)) / Om)))); else tmp = Float64(sqrt(n) * sqrt(Float64(Float64(U * 2.0) * Float64(t + Float64(Float64(Float64(l * -2.0) + Float64(Float64(l * n) * Float64(U_42_ / Om))) / Float64(Om / l)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (n <= -1.32e-114) tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))); elseif (n <= 7.2e-240) tmp = sqrt((((t * n) * (U * 2.0)) + (-4.0 * (((l * n) * (U * l)) / Om)))); else tmp = sqrt(n) * sqrt(((U * 2.0) * (t + (((l * -2.0) + ((l * n) * (U_42_ / Om))) / (Om / l))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, -1.32e-114], N[Sqrt[N[(n * N[(U * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 7.2e-240], N[Sqrt[N[(N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(N[(N[(l * n), $MachinePrecision] * N[(U * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(t + N[(N[(N[(l * -2.0), $MachinePrecision] + N[(N[(l * n), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq -1.32 \cdot 10^{-114}:\\
\;\;\;\;\sqrt{n \cdot \left(U \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{elif}\;n \leq 7.2 \cdot 10^{-240}:\\
\;\;\;\;\sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right) + -4 \cdot \frac{\left(\ell \cdot n\right) \cdot \left(U \cdot \ell\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{\left(U \cdot 2\right) \cdot \left(t + \frac{\ell \cdot -2 + \left(\ell \cdot n\right) \cdot \frac{U*}{Om}}{\frac{Om}{\ell}}\right)}\\
\end{array}
\end{array}
if n < -1.31999999999999996e-114Initial program 63.1%
Simplified71.7%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr76.5%
if -1.31999999999999996e-114 < n < 7.1999999999999998e-240Initial program 42.2%
Simplified45.5%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.0%
Simplified52.0%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.8%
Applied egg-rr63.8%
if 7.1999999999999998e-240 < n Initial program 42.2%
Simplified57.5%
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr43.8%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6442.0%
Simplified42.0%
pow1/2N/A
unpow-prod-downN/A
associate-*l*N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
*-commutativeN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr62.4%
Final simplification67.2%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))
(if (<= U -1e-310)
(sqrt (* n (* U (* 2.0 t_1))))
(* (sqrt (* U 2.0)) (sqrt (* n t_1))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l));
double tmp;
if (U <= -1e-310) {
tmp = sqrt((n * (U * (2.0 * t_1))));
} else {
tmp = sqrt((U * 2.0)) * sqrt((n * t_1));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l))
if (u <= (-1d-310)) then
tmp = sqrt((n * (u * (2.0d0 * t_1))))
else
tmp = sqrt((u * 2.0d0)) * sqrt((n * t_1))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l));
double tmp;
if (U <= -1e-310) {
tmp = Math.sqrt((n * (U * (2.0 * t_1))));
} else {
tmp = Math.sqrt((U * 2.0)) * Math.sqrt((n * t_1));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)) tmp = 0 if U <= -1e-310: tmp = math.sqrt((n * (U * (2.0 * t_1)))) else: tmp = math.sqrt((U * 2.0)) * math.sqrt((n * t_1)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))) tmp = 0.0 if (U <= -1e-310) tmp = sqrt(Float64(n * Float64(U * Float64(2.0 * t_1)))); else tmp = Float64(sqrt(Float64(U * 2.0)) * sqrt(Float64(n * t_1))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)); tmp = 0.0; if (U <= -1e-310) tmp = sqrt((n * (U * (2.0 * t_1)))); else tmp = sqrt((U * 2.0)) * sqrt((n * t_1)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[U, -1e-310], N[Sqrt[N[(n * N[(U * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\\
\mathbf{if}\;U \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{n \cdot \left(U \cdot \left(2 \cdot t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot 2} \cdot \sqrt{n \cdot t\_1}\\
\end{array}
\end{array}
if U < -9.999999999999969e-311Initial program 52.6%
Simplified61.5%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr62.5%
if -9.999999999999969e-311 < U Initial program 45.3%
Simplified56.5%
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr76.1%
Final simplification69.5%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= U -1e-310)
(sqrt
(*
n
(*
U
(* 2.0 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))))
(*
(sqrt (* U 2.0))
(sqrt (* n (+ t (/ (+ (* l -2.0) (* (* U* l) (/ n Om))) (/ Om l))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= -1e-310) {
tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = sqrt((U * 2.0)) * sqrt((n * (t + (((l * -2.0) + ((U_42_ * l) * (n / Om))) / (Om / l)))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u <= (-1d-310)) then
tmp = sqrt((n * (u * (2.0d0 * (t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l)))))))
else
tmp = sqrt((u * 2.0d0)) * sqrt((n * (t + (((l * (-2.0d0)) + ((u_42 * l) * (n / om))) / (om / l)))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= -1e-310) {
tmp = Math.sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = Math.sqrt((U * 2.0)) * Math.sqrt((n * (t + (((l * -2.0) + ((U_42_ * l) * (n / Om))) / (Om / l)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if U <= -1e-310: tmp = math.sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))) else: tmp = math.sqrt((U * 2.0)) * math.sqrt((n * (t + (((l * -2.0) + ((U_42_ * l) * (n / Om))) / (Om / l))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U <= -1e-310) tmp = sqrt(Float64(n * Float64(U * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))); else tmp = Float64(sqrt(Float64(U * 2.0)) * sqrt(Float64(n * Float64(t + Float64(Float64(Float64(l * -2.0) + Float64(Float64(U_42_ * l) * Float64(n / Om))) / Float64(Om / l)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U <= -1e-310) tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))); else tmp = sqrt((U * 2.0)) * sqrt((n * (t + (((l * -2.0) + ((U_42_ * l) * (n / Om))) / (Om / l))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U, -1e-310], N[Sqrt[N[(n * N[(U * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * N[(t + N[(N[(N[(l * -2.0), $MachinePrecision] + N[(N[(U$42$ * l), $MachinePrecision] * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{n \cdot \left(U \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot 2} \cdot \sqrt{n \cdot \left(t + \frac{\ell \cdot -2 + \left(U* \cdot \ell\right) \cdot \frac{n}{Om}}{\frac{Om}{\ell}}\right)}\\
\end{array}
\end{array}
if U < -9.999999999999969e-311Initial program 52.6%
Simplified61.5%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr62.5%
if -9.999999999999969e-311 < U Initial program 45.3%
Simplified56.5%
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr76.1%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.1%
Simplified73.1%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6473.9%
Applied egg-rr73.9%
Final simplification68.4%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= U 4.45e+105)
(sqrt
(*
n
(*
U
(* 2.0 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))))
(* (sqrt (* U 2.0)) (sqrt (* n (+ t (/ (* -2.0 (* l l)) Om)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= 4.45e+105) {
tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = sqrt((U * 2.0)) * sqrt((n * (t + ((-2.0 * (l * l)) / Om))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u <= 4.45d+105) then
tmp = sqrt((n * (u * (2.0d0 * (t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l)))))))
else
tmp = sqrt((u * 2.0d0)) * sqrt((n * (t + (((-2.0d0) * (l * l)) / om))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= 4.45e+105) {
tmp = Math.sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = Math.sqrt((U * 2.0)) * Math.sqrt((n * (t + ((-2.0 * (l * l)) / Om))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if U <= 4.45e+105: tmp = math.sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))) else: tmp = math.sqrt((U * 2.0)) * math.sqrt((n * (t + ((-2.0 * (l * l)) / Om)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U <= 4.45e+105) tmp = sqrt(Float64(n * Float64(U * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))); else tmp = Float64(sqrt(Float64(U * 2.0)) * sqrt(Float64(n * Float64(t + Float64(Float64(-2.0 * Float64(l * l)) / Om))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U <= 4.45e+105) tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))); else tmp = sqrt((U * 2.0)) * sqrt((n * (t + ((-2.0 * (l * l)) / Om)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U, 4.45e+105], N[Sqrt[N[(n * N[(U * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * N[(t + N[(N[(-2.0 * N[(l * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U \leq 4.45 \cdot 10^{+105}:\\
\;\;\;\;\sqrt{n \cdot \left(U \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot 2} \cdot \sqrt{n \cdot \left(t + \frac{-2 \cdot \left(\ell \cdot \ell\right)}{Om}\right)}\\
\end{array}
\end{array}
if U < 4.44999999999999987e105Initial program 47.2%
Simplified57.9%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr62.5%
if 4.44999999999999987e105 < U Initial program 57.3%
Simplified64.6%
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr81.2%
Taylor expanded in n around 0
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6471.0%
Simplified71.0%
Final simplification63.9%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= n -2.55e-250)
(sqrt
(*
n
(*
U
(* 2.0 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))))
(if (<= n 4.4e-167)
(sqrt (+ (* (* t n) (* U 2.0)) (* -4.0 (* (* l (* l n)) (/ U Om)))))
(sqrt
(*
2.0
(* (+ t (* (/ l Om) (+ (* l -2.0) (* U* (/ (* l n) Om))))) (* U n)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= -2.55e-250) {
tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else if (n <= 4.4e-167) {
tmp = sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om)))));
} else {
tmp = sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * ((l * n) / Om))))) * (U * n))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (n <= (-2.55d-250)) then
tmp = sqrt((n * (u * (2.0d0 * (t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l)))))))
else if (n <= 4.4d-167) then
tmp = sqrt((((t * n) * (u * 2.0d0)) + ((-4.0d0) * ((l * (l * n)) * (u / om)))))
else
tmp = sqrt((2.0d0 * ((t + ((l / om) * ((l * (-2.0d0)) + (u_42 * ((l * n) / om))))) * (u * n))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= -2.55e-250) {
tmp = Math.sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else if (n <= 4.4e-167) {
tmp = Math.sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om)))));
} else {
tmp = Math.sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * ((l * n) / Om))))) * (U * n))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if n <= -2.55e-250: tmp = math.sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))) elif n <= 4.4e-167: tmp = math.sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om))))) else: tmp = math.sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * ((l * n) / Om))))) * (U * n)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (n <= -2.55e-250) tmp = sqrt(Float64(n * Float64(U * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))); elseif (n <= 4.4e-167) tmp = sqrt(Float64(Float64(Float64(t * n) * Float64(U * 2.0)) + Float64(-4.0 * Float64(Float64(l * Float64(l * n)) * Float64(U / Om))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(t + Float64(Float64(l / Om) * Float64(Float64(l * -2.0) + Float64(U_42_ * Float64(Float64(l * n) / Om))))) * Float64(U * n)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (n <= -2.55e-250) tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))); elseif (n <= 4.4e-167) tmp = sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om))))); else tmp = sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * ((l * n) / Om))))) * (U * n)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, -2.55e-250], N[Sqrt[N[(n * N[(U * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 4.4e-167], N[Sqrt[N[(N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(N[(l * N[(l * n), $MachinePrecision]), $MachinePrecision] * N[(U / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(U$42$ * N[(N[(l * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(U * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq -2.55 \cdot 10^{-250}:\\
\;\;\;\;\sqrt{n \cdot \left(U \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{elif}\;n \leq 4.4 \cdot 10^{-167}:\\
\;\;\;\;\sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right) + -4 \cdot \left(\left(\ell \cdot \left(\ell \cdot n\right)\right) \cdot \frac{U}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(t + \frac{\ell}{Om} \cdot \left(\ell \cdot -2 + U* \cdot \frac{\ell \cdot n}{Om}\right)\right) \cdot \left(U \cdot n\right)\right)}\\
\end{array}
\end{array}
if n < -2.5500000000000001e-250Initial program 59.5%
Simplified67.4%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr71.9%
if -2.5500000000000001e-250 < n < 4.3999999999999999e-167Initial program 34.7%
Simplified38.6%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6449.1%
Simplified49.1%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6458.5%
Applied egg-rr58.5%
if 4.3999999999999999e-167 < n Initial program 44.5%
Simplified61.7%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.7%
Simplified61.7%
Final simplification65.4%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ (* l -2.0) (* U* (/ (* l n) Om)))))
(if (<= n -3e-206)
(sqrt (* (+ t (/ t_1 (/ Om l))) (* n (* U 2.0))))
(if (<= n 4e-167)
(sqrt (+ (* (* t n) (* U 2.0)) (* -4.0 (* (* l (* l n)) (/ U Om)))))
(sqrt (* 2.0 (* (+ t (* (/ l Om) t_1)) (* U n))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om));
double tmp;
if (n <= -3e-206) {
tmp = sqrt(((t + (t_1 / (Om / l))) * (n * (U * 2.0))));
} else if (n <= 4e-167) {
tmp = sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om)))));
} else {
tmp = sqrt((2.0 * ((t + ((l / Om) * t_1)) * (U * n))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = (l * (-2.0d0)) + (u_42 * ((l * n) / om))
if (n <= (-3d-206)) then
tmp = sqrt(((t + (t_1 / (om / l))) * (n * (u * 2.0d0))))
else if (n <= 4d-167) then
tmp = sqrt((((t * n) * (u * 2.0d0)) + ((-4.0d0) * ((l * (l * n)) * (u / om)))))
else
tmp = sqrt((2.0d0 * ((t + ((l / om) * t_1)) * (u * n))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om));
double tmp;
if (n <= -3e-206) {
tmp = Math.sqrt(((t + (t_1 / (Om / l))) * (n * (U * 2.0))));
} else if (n <= 4e-167) {
tmp = Math.sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om)))));
} else {
tmp = Math.sqrt((2.0 * ((t + ((l / Om) * t_1)) * (U * n))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om)) tmp = 0 if n <= -3e-206: tmp = math.sqrt(((t + (t_1 / (Om / l))) * (n * (U * 2.0)))) elif n <= 4e-167: tmp = math.sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om))))) else: tmp = math.sqrt((2.0 * ((t + ((l / Om) * t_1)) * (U * n)))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(l * -2.0) + Float64(U_42_ * Float64(Float64(l * n) / Om))) tmp = 0.0 if (n <= -3e-206) tmp = sqrt(Float64(Float64(t + Float64(t_1 / Float64(Om / l))) * Float64(n * Float64(U * 2.0)))); elseif (n <= 4e-167) tmp = sqrt(Float64(Float64(Float64(t * n) * Float64(U * 2.0)) + Float64(-4.0 * Float64(Float64(l * Float64(l * n)) * Float64(U / Om))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(t + Float64(Float64(l / Om) * t_1)) * Float64(U * n)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om)); tmp = 0.0; if (n <= -3e-206) tmp = sqrt(((t + (t_1 / (Om / l))) * (n * (U * 2.0)))); elseif (n <= 4e-167) tmp = sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om))))); else tmp = sqrt((2.0 * ((t + ((l / Om) * t_1)) * (U * n)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(l * -2.0), $MachinePrecision] + N[(U$42$ * N[(N[(l * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -3e-206], N[Sqrt[N[(N[(t + N[(t$95$1 / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(n * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 4e-167], N[Sqrt[N[(N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(N[(l * N[(l * n), $MachinePrecision]), $MachinePrecision] * N[(U / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(t + N[(N[(l / Om), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision] * N[(U * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot -2 + U* \cdot \frac{\ell \cdot n}{Om}\\
\mathbf{if}\;n \leq -3 \cdot 10^{-206}:\\
\;\;\;\;\sqrt{\left(t + \frac{t\_1}{\frac{Om}{\ell}}\right) \cdot \left(n \cdot \left(U \cdot 2\right)\right)}\\
\mathbf{elif}\;n \leq 4 \cdot 10^{-167}:\\
\;\;\;\;\sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right) + -4 \cdot \left(\left(\ell \cdot \left(\ell \cdot n\right)\right) \cdot \frac{U}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(t + \frac{\ell}{Om} \cdot t\_1\right) \cdot \left(U \cdot n\right)\right)}\\
\end{array}
\end{array}
if n < -3.0000000000000002e-206Initial program 63.1%
Simplified70.9%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr73.8%
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr70.9%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6471.0%
Simplified71.0%
if -3.0000000000000002e-206 < n < 4.00000000000000001e-167Initial program 32.9%
Simplified37.6%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6447.9%
Simplified47.9%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6457.4%
Applied egg-rr57.4%
if 4.00000000000000001e-167 < n Initial program 44.5%
Simplified61.7%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.7%
Simplified61.7%
Final simplification64.3%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(sqrt
(*
2.0
(*
(+ t (* (/ l Om) (+ (* l -2.0) (* U* (/ (* l n) Om)))))
(* U n))))))
(if (<= n -3.1e-206)
t_1
(if (<= n 3.6e-167)
(sqrt (+ (* (* t n) (* U 2.0)) (* -4.0 (* (* l (* l n)) (/ U Om)))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * ((l * n) / Om))))) * (U * n))));
double tmp;
if (n <= -3.1e-206) {
tmp = t_1;
} else if (n <= 3.6e-167) {
tmp = sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om)))));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = sqrt((2.0d0 * ((t + ((l / om) * ((l * (-2.0d0)) + (u_42 * ((l * n) / om))))) * (u * n))))
if (n <= (-3.1d-206)) then
tmp = t_1
else if (n <= 3.6d-167) then
tmp = sqrt((((t * n) * (u * 2.0d0)) + ((-4.0d0) * ((l * (l * n)) * (u / om)))))
else
tmp = t_1
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = Math.sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * ((l * n) / Om))))) * (U * n))));
double tmp;
if (n <= -3.1e-206) {
tmp = t_1;
} else if (n <= 3.6e-167) {
tmp = Math.sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om)))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * ((l * n) / Om))))) * (U * n)))) tmp = 0 if n <= -3.1e-206: tmp = t_1 elif n <= 3.6e-167: tmp = math.sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om))))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(2.0 * Float64(Float64(t + Float64(Float64(l / Om) * Float64(Float64(l * -2.0) + Float64(U_42_ * Float64(Float64(l * n) / Om))))) * Float64(U * n)))) tmp = 0.0 if (n <= -3.1e-206) tmp = t_1; elseif (n <= 3.6e-167) tmp = sqrt(Float64(Float64(Float64(t * n) * Float64(U * 2.0)) + Float64(-4.0 * Float64(Float64(l * Float64(l * n)) * Float64(U / Om))))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * ((l * n) / Om))))) * (U * n)))); tmp = 0.0; if (n <= -3.1e-206) tmp = t_1; elseif (n <= 3.6e-167) tmp = sqrt((((t * n) * (U * 2.0)) + (-4.0 * ((l * (l * n)) * (U / Om))))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * N[(N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(U$42$ * N[(N[(l * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(U * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -3.1e-206], t$95$1, If[LessEqual[n, 3.6e-167], N[Sqrt[N[(N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(N[(l * N[(l * n), $MachinePrecision]), $MachinePrecision] * N[(U / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{2 \cdot \left(\left(t + \frac{\ell}{Om} \cdot \left(\ell \cdot -2 + U* \cdot \frac{\ell \cdot n}{Om}\right)\right) \cdot \left(U \cdot n\right)\right)}\\
\mathbf{if}\;n \leq -3.1 \cdot 10^{-206}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;n \leq 3.6 \cdot 10^{-167}:\\
\;\;\;\;\sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right) + -4 \cdot \left(\left(\ell \cdot \left(\ell \cdot n\right)\right) \cdot \frac{U}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if n < -3.1000000000000003e-206 or 3.6000000000000001e-167 < n Initial program 54.6%
Simplified66.7%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6466.7%
Simplified66.7%
if -3.1000000000000003e-206 < n < 3.6000000000000001e-167Initial program 32.9%
Simplified37.6%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6447.9%
Simplified47.9%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6457.4%
Applied egg-rr57.4%
Final simplification64.2%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* t n) (* U 2.0))))
(if (<= Om -2.7e-132)
(sqrt (+ t_1 (* -4.0 (* l (* n (/ (* U l) Om))))))
(if (<= Om 1.5e-100)
(sqrt
(/ (* 2.0 (* U (* (* l n) (+ (* l -2.0) (/ (* U* (* l n)) Om))))) Om))
(sqrt (+ t_1 (* -4.0 (/ (* (* l n) (* U l)) Om))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (t * n) * (U * 2.0);
double tmp;
if (Om <= -2.7e-132) {
tmp = sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om))))));
} else if (Om <= 1.5e-100) {
tmp = sqrt(((2.0 * (U * ((l * n) * ((l * -2.0) + ((U_42_ * (l * n)) / Om))))) / Om));
} else {
tmp = sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = (t * n) * (u * 2.0d0)
if (om <= (-2.7d-132)) then
tmp = sqrt((t_1 + ((-4.0d0) * (l * (n * ((u * l) / om))))))
else if (om <= 1.5d-100) then
tmp = sqrt(((2.0d0 * (u * ((l * n) * ((l * (-2.0d0)) + ((u_42 * (l * n)) / om))))) / om))
else
tmp = sqrt((t_1 + ((-4.0d0) * (((l * n) * (u * l)) / om))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (t * n) * (U * 2.0);
double tmp;
if (Om <= -2.7e-132) {
tmp = Math.sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om))))));
} else if (Om <= 1.5e-100) {
tmp = Math.sqrt(((2.0 * (U * ((l * n) * ((l * -2.0) + ((U_42_ * (l * n)) / Om))))) / Om));
} else {
tmp = Math.sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (t * n) * (U * 2.0) tmp = 0 if Om <= -2.7e-132: tmp = math.sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om)))))) elif Om <= 1.5e-100: tmp = math.sqrt(((2.0 * (U * ((l * n) * ((l * -2.0) + ((U_42_ * (l * n)) / Om))))) / Om)) else: tmp = math.sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om)))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(t * n) * Float64(U * 2.0)) tmp = 0.0 if (Om <= -2.7e-132) tmp = sqrt(Float64(t_1 + Float64(-4.0 * Float64(l * Float64(n * Float64(Float64(U * l) / Om)))))); elseif (Om <= 1.5e-100) tmp = sqrt(Float64(Float64(2.0 * Float64(U * Float64(Float64(l * n) * Float64(Float64(l * -2.0) + Float64(Float64(U_42_ * Float64(l * n)) / Om))))) / Om)); else tmp = sqrt(Float64(t_1 + Float64(-4.0 * Float64(Float64(Float64(l * n) * Float64(U * l)) / Om)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (t * n) * (U * 2.0); tmp = 0.0; if (Om <= -2.7e-132) tmp = sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om)))))); elseif (Om <= 1.5e-100) tmp = sqrt(((2.0 * (U * ((l * n) * ((l * -2.0) + ((U_42_ * (l * n)) / Om))))) / Om)); else tmp = sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, -2.7e-132], N[Sqrt[N[(t$95$1 + N[(-4.0 * N[(l * N[(n * N[(N[(U * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 1.5e-100], N[Sqrt[N[(N[(2.0 * N[(U * N[(N[(l * n), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(U$42$ * N[(l * n), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 + N[(-4.0 * N[(N[(N[(l * n), $MachinePrecision] * N[(U * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(t \cdot n\right) \cdot \left(U \cdot 2\right)\\
\mathbf{if}\;Om \leq -2.7 \cdot 10^{-132}:\\
\;\;\;\;\sqrt{t\_1 + -4 \cdot \left(\ell \cdot \left(n \cdot \frac{U \cdot \ell}{Om}\right)\right)}\\
\mathbf{elif}\;Om \leq 1.5 \cdot 10^{-100}:\\
\;\;\;\;\sqrt{\frac{2 \cdot \left(U \cdot \left(\left(\ell \cdot n\right) \cdot \left(\ell \cdot -2 + \frac{U* \cdot \left(\ell \cdot n\right)}{Om}\right)\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 + -4 \cdot \frac{\left(\ell \cdot n\right) \cdot \left(U \cdot \ell\right)}{Om}}\\
\end{array}
\end{array}
if Om < -2.6999999999999999e-132Initial program 53.2%
Simplified60.7%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.9%
Simplified52.9%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6459.4%
Applied egg-rr59.4%
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6462.2%
Applied egg-rr62.2%
if -2.6999999999999999e-132 < Om < 1.5e-100Initial program 43.3%
Simplified60.0%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr65.4%
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr60.0%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6460.0%
Simplified60.0%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6467.6%
Simplified67.6%
if 1.5e-100 < Om Initial program 47.8%
Simplified56.0%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6447.1%
Simplified47.1%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6451.5%
Applied egg-rr51.5%
Final simplification60.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* t n) (* U 2.0))))
(if (<= Om -2.9e-134)
(sqrt (+ t_1 (* -4.0 (* l (* n (/ (* U l) Om))))))
(if (<= Om 1.65e-103)
(sqrt (/ (* -2.0 (* U (* (- 2.0 (/ (* U* n) Om)) (* n (* l l))))) Om))
(sqrt (+ t_1 (* -4.0 (/ (* (* l n) (* U l)) Om))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (t * n) * (U * 2.0);
double tmp;
if (Om <= -2.9e-134) {
tmp = sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om))))));
} else if (Om <= 1.65e-103) {
tmp = sqrt(((-2.0 * (U * ((2.0 - ((U_42_ * n) / Om)) * (n * (l * l))))) / Om));
} else {
tmp = sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = (t * n) * (u * 2.0d0)
if (om <= (-2.9d-134)) then
tmp = sqrt((t_1 + ((-4.0d0) * (l * (n * ((u * l) / om))))))
else if (om <= 1.65d-103) then
tmp = sqrt((((-2.0d0) * (u * ((2.0d0 - ((u_42 * n) / om)) * (n * (l * l))))) / om))
else
tmp = sqrt((t_1 + ((-4.0d0) * (((l * n) * (u * l)) / om))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (t * n) * (U * 2.0);
double tmp;
if (Om <= -2.9e-134) {
tmp = Math.sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om))))));
} else if (Om <= 1.65e-103) {
tmp = Math.sqrt(((-2.0 * (U * ((2.0 - ((U_42_ * n) / Om)) * (n * (l * l))))) / Om));
} else {
tmp = Math.sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (t * n) * (U * 2.0) tmp = 0 if Om <= -2.9e-134: tmp = math.sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om)))))) elif Om <= 1.65e-103: tmp = math.sqrt(((-2.0 * (U * ((2.0 - ((U_42_ * n) / Om)) * (n * (l * l))))) / Om)) else: tmp = math.sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om)))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(t * n) * Float64(U * 2.0)) tmp = 0.0 if (Om <= -2.9e-134) tmp = sqrt(Float64(t_1 + Float64(-4.0 * Float64(l * Float64(n * Float64(Float64(U * l) / Om)))))); elseif (Om <= 1.65e-103) tmp = sqrt(Float64(Float64(-2.0 * Float64(U * Float64(Float64(2.0 - Float64(Float64(U_42_ * n) / Om)) * Float64(n * Float64(l * l))))) / Om)); else tmp = sqrt(Float64(t_1 + Float64(-4.0 * Float64(Float64(Float64(l * n) * Float64(U * l)) / Om)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (t * n) * (U * 2.0); tmp = 0.0; if (Om <= -2.9e-134) tmp = sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om)))))); elseif (Om <= 1.65e-103) tmp = sqrt(((-2.0 * (U * ((2.0 - ((U_42_ * n) / Om)) * (n * (l * l))))) / Om)); else tmp = sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, -2.9e-134], N[Sqrt[N[(t$95$1 + N[(-4.0 * N[(l * N[(n * N[(N[(U * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 1.65e-103], N[Sqrt[N[(N[(-2.0 * N[(U * N[(N[(2.0 - N[(N[(U$42$ * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 + N[(-4.0 * N[(N[(N[(l * n), $MachinePrecision] * N[(U * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(t \cdot n\right) \cdot \left(U \cdot 2\right)\\
\mathbf{if}\;Om \leq -2.9 \cdot 10^{-134}:\\
\;\;\;\;\sqrt{t\_1 + -4 \cdot \left(\ell \cdot \left(n \cdot \frac{U \cdot \ell}{Om}\right)\right)}\\
\mathbf{elif}\;Om \leq 1.65 \cdot 10^{-103}:\\
\;\;\;\;\sqrt{\frac{-2 \cdot \left(U \cdot \left(\left(2 - \frac{U* \cdot n}{Om}\right) \cdot \left(n \cdot \left(\ell \cdot \ell\right)\right)\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 + -4 \cdot \frac{\left(\ell \cdot n\right) \cdot \left(U \cdot \ell\right)}{Om}}\\
\end{array}
\end{array}
if Om < -2.89999999999999993e-134Initial program 53.2%
Simplified60.7%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.9%
Simplified52.9%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6459.4%
Applied egg-rr59.4%
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6462.2%
Applied egg-rr62.2%
if -2.89999999999999993e-134 < Om < 1.64999999999999995e-103Initial program 41.6%
Simplified58.7%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr64.3%
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr58.8%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6458.8%
Simplified58.8%
Taylor expanded in l around -inf
associate-*r/N/A
/-lowering-/.f64N/A
Simplified60.7%
if 1.64999999999999995e-103 < Om Initial program 49.0%
Simplified57.0%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6446.1%
Simplified46.1%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.4%
Applied egg-rr50.4%
Final simplification57.8%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* t n) (* U 2.0))))
(if (<= Om -1.12e-172)
(sqrt (+ t_1 (* -4.0 (* l (* n (/ (* U l) Om))))))
(if (<= Om 3.9e-103)
(sqrt (* n (/ (* 2.0 (* U (* U* (* n (* l l))))) (* Om Om))))
(sqrt (+ t_1 (* -4.0 (/ (* (* l n) (* U l)) Om))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (t * n) * (U * 2.0);
double tmp;
if (Om <= -1.12e-172) {
tmp = sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om))))));
} else if (Om <= 3.9e-103) {
tmp = sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om))));
} else {
tmp = sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = (t * n) * (u * 2.0d0)
if (om <= (-1.12d-172)) then
tmp = sqrt((t_1 + ((-4.0d0) * (l * (n * ((u * l) / om))))))
else if (om <= 3.9d-103) then
tmp = sqrt((n * ((2.0d0 * (u * (u_42 * (n * (l * l))))) / (om * om))))
else
tmp = sqrt((t_1 + ((-4.0d0) * (((l * n) * (u * l)) / om))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (t * n) * (U * 2.0);
double tmp;
if (Om <= -1.12e-172) {
tmp = Math.sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om))))));
} else if (Om <= 3.9e-103) {
tmp = Math.sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om))));
} else {
tmp = Math.sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (t * n) * (U * 2.0) tmp = 0 if Om <= -1.12e-172: tmp = math.sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om)))))) elif Om <= 3.9e-103: tmp = math.sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om)))) else: tmp = math.sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om)))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(t * n) * Float64(U * 2.0)) tmp = 0.0 if (Om <= -1.12e-172) tmp = sqrt(Float64(t_1 + Float64(-4.0 * Float64(l * Float64(n * Float64(Float64(U * l) / Om)))))); elseif (Om <= 3.9e-103) tmp = sqrt(Float64(n * Float64(Float64(2.0 * Float64(U * Float64(U_42_ * Float64(n * Float64(l * l))))) / Float64(Om * Om)))); else tmp = sqrt(Float64(t_1 + Float64(-4.0 * Float64(Float64(Float64(l * n) * Float64(U * l)) / Om)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (t * n) * (U * 2.0); tmp = 0.0; if (Om <= -1.12e-172) tmp = sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om)))))); elseif (Om <= 3.9e-103) tmp = sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om)))); else tmp = sqrt((t_1 + (-4.0 * (((l * n) * (U * l)) / Om)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, -1.12e-172], N[Sqrt[N[(t$95$1 + N[(-4.0 * N[(l * N[(n * N[(N[(U * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 3.9e-103], N[Sqrt[N[(n * N[(N[(2.0 * N[(U * N[(U$42$ * N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 + N[(-4.0 * N[(N[(N[(l * n), $MachinePrecision] * N[(U * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(t \cdot n\right) \cdot \left(U \cdot 2\right)\\
\mathbf{if}\;Om \leq -1.12 \cdot 10^{-172}:\\
\;\;\;\;\sqrt{t\_1 + -4 \cdot \left(\ell \cdot \left(n \cdot \frac{U \cdot \ell}{Om}\right)\right)}\\
\mathbf{elif}\;Om \leq 3.9 \cdot 10^{-103}:\\
\;\;\;\;\sqrt{n \cdot \frac{2 \cdot \left(U \cdot \left(U* \cdot \left(n \cdot \left(\ell \cdot \ell\right)\right)\right)\right)}{Om \cdot Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 + -4 \cdot \frac{\left(\ell \cdot n\right) \cdot \left(U \cdot \ell\right)}{Om}}\\
\end{array}
\end{array}
if Om < -1.11999999999999996e-172Initial program 52.7%
Simplified60.6%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.4%
Simplified52.4%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.5%
Applied egg-rr58.5%
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.0%
Applied egg-rr61.0%
if -1.11999999999999996e-172 < Om < 3.9000000000000002e-103Initial program 42.2%
Simplified59.4%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr65.5%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6455.8%
Simplified55.8%
if 3.9000000000000002e-103 < Om Initial program 48.4%
Simplified56.5%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6446.6%
Simplified46.6%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.9%
Applied egg-rr50.9%
Final simplification56.4%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* t n) (* U 2.0))))
(if (<= Om -1.65e-165)
(sqrt (+ t_1 (* -4.0 (* l (* n (/ (* U l) Om))))))
(if (<= Om 2.8e-102)
(sqrt (* n (/ (* 2.0 (* U (* U* (* n (* l l))))) (* Om Om))))
(sqrt (+ t_1 (* -4.0 (* (* l (* l n)) (/ U Om)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (t * n) * (U * 2.0);
double tmp;
if (Om <= -1.65e-165) {
tmp = sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om))))));
} else if (Om <= 2.8e-102) {
tmp = sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om))));
} else {
tmp = sqrt((t_1 + (-4.0 * ((l * (l * n)) * (U / Om)))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = (t * n) * (u * 2.0d0)
if (om <= (-1.65d-165)) then
tmp = sqrt((t_1 + ((-4.0d0) * (l * (n * ((u * l) / om))))))
else if (om <= 2.8d-102) then
tmp = sqrt((n * ((2.0d0 * (u * (u_42 * (n * (l * l))))) / (om * om))))
else
tmp = sqrt((t_1 + ((-4.0d0) * ((l * (l * n)) * (u / om)))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (t * n) * (U * 2.0);
double tmp;
if (Om <= -1.65e-165) {
tmp = Math.sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om))))));
} else if (Om <= 2.8e-102) {
tmp = Math.sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om))));
} else {
tmp = Math.sqrt((t_1 + (-4.0 * ((l * (l * n)) * (U / Om)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (t * n) * (U * 2.0) tmp = 0 if Om <= -1.65e-165: tmp = math.sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om)))))) elif Om <= 2.8e-102: tmp = math.sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om)))) else: tmp = math.sqrt((t_1 + (-4.0 * ((l * (l * n)) * (U / Om))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(t * n) * Float64(U * 2.0)) tmp = 0.0 if (Om <= -1.65e-165) tmp = sqrt(Float64(t_1 + Float64(-4.0 * Float64(l * Float64(n * Float64(Float64(U * l) / Om)))))); elseif (Om <= 2.8e-102) tmp = sqrt(Float64(n * Float64(Float64(2.0 * Float64(U * Float64(U_42_ * Float64(n * Float64(l * l))))) / Float64(Om * Om)))); else tmp = sqrt(Float64(t_1 + Float64(-4.0 * Float64(Float64(l * Float64(l * n)) * Float64(U / Om))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (t * n) * (U * 2.0); tmp = 0.0; if (Om <= -1.65e-165) tmp = sqrt((t_1 + (-4.0 * (l * (n * ((U * l) / Om)))))); elseif (Om <= 2.8e-102) tmp = sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om)))); else tmp = sqrt((t_1 + (-4.0 * ((l * (l * n)) * (U / Om))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, -1.65e-165], N[Sqrt[N[(t$95$1 + N[(-4.0 * N[(l * N[(n * N[(N[(U * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 2.8e-102], N[Sqrt[N[(n * N[(N[(2.0 * N[(U * N[(U$42$ * N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 + N[(-4.0 * N[(N[(l * N[(l * n), $MachinePrecision]), $MachinePrecision] * N[(U / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(t \cdot n\right) \cdot \left(U \cdot 2\right)\\
\mathbf{if}\;Om \leq -1.65 \cdot 10^{-165}:\\
\;\;\;\;\sqrt{t\_1 + -4 \cdot \left(\ell \cdot \left(n \cdot \frac{U \cdot \ell}{Om}\right)\right)}\\
\mathbf{elif}\;Om \leq 2.8 \cdot 10^{-102}:\\
\;\;\;\;\sqrt{n \cdot \frac{2 \cdot \left(U \cdot \left(U* \cdot \left(n \cdot \left(\ell \cdot \ell\right)\right)\right)\right)}{Om \cdot Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 + -4 \cdot \left(\left(\ell \cdot \left(\ell \cdot n\right)\right) \cdot \frac{U}{Om}\right)}\\
\end{array}
\end{array}
if Om < -1.6499999999999999e-165Initial program 52.7%
Simplified60.6%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.4%
Simplified52.4%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.5%
Applied egg-rr58.5%
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.0%
Applied egg-rr61.0%
if -1.6499999999999999e-165 < Om < 2.80000000000000013e-102Initial program 42.2%
Simplified59.4%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr65.5%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6455.8%
Simplified55.8%
if 2.80000000000000013e-102 < Om Initial program 48.4%
Simplified56.5%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6446.6%
Simplified46.6%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6450.5%
Applied egg-rr50.5%
Final simplification56.3%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(sqrt (+ (* (* t n) (* U 2.0)) (* -4.0 (* l (* n (/ (* U l) Om))))))))
(if (<= Om -1.25e-167)
t_1
(if (<= Om 2.65e-102)
(sqrt (* n (/ (* 2.0 (* U (* U* (* n (* l l))))) (* Om Om))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt((((t * n) * (U * 2.0)) + (-4.0 * (l * (n * ((U * l) / Om))))));
double tmp;
if (Om <= -1.25e-167) {
tmp = t_1;
} else if (Om <= 2.65e-102) {
tmp = sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om))));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = sqrt((((t * n) * (u * 2.0d0)) + ((-4.0d0) * (l * (n * ((u * l) / om))))))
if (om <= (-1.25d-167)) then
tmp = t_1
else if (om <= 2.65d-102) then
tmp = sqrt((n * ((2.0d0 * (u * (u_42 * (n * (l * l))))) / (om * om))))
else
tmp = t_1
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = Math.sqrt((((t * n) * (U * 2.0)) + (-4.0 * (l * (n * ((U * l) / Om))))));
double tmp;
if (Om <= -1.25e-167) {
tmp = t_1;
} else if (Om <= 2.65e-102) {
tmp = Math.sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt((((t * n) * (U * 2.0)) + (-4.0 * (l * (n * ((U * l) / Om)))))) tmp = 0 if Om <= -1.25e-167: tmp = t_1 elif Om <= 2.65e-102: tmp = math.sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om)))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(Float64(Float64(t * n) * Float64(U * 2.0)) + Float64(-4.0 * Float64(l * Float64(n * Float64(Float64(U * l) / Om)))))) tmp = 0.0 if (Om <= -1.25e-167) tmp = t_1; elseif (Om <= 2.65e-102) tmp = sqrt(Float64(n * Float64(Float64(2.0 * Float64(U * Float64(U_42_ * Float64(n * Float64(l * l))))) / Float64(Om * Om)))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt((((t * n) * (U * 2.0)) + (-4.0 * (l * (n * ((U * l) / Om)))))); tmp = 0.0; if (Om <= -1.25e-167) tmp = t_1; elseif (Om <= 2.65e-102) tmp = sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om)))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(l * N[(n * N[(N[(U * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[Om, -1.25e-167], t$95$1, If[LessEqual[Om, 2.65e-102], N[Sqrt[N[(n * N[(N[(2.0 * N[(U * N[(U$42$ * N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right) + -4 \cdot \left(\ell \cdot \left(n \cdot \frac{U \cdot \ell}{Om}\right)\right)}\\
\mathbf{if}\;Om \leq -1.25 \cdot 10^{-167}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;Om \leq 2.65 \cdot 10^{-102}:\\
\;\;\;\;\sqrt{n \cdot \frac{2 \cdot \left(U \cdot \left(U* \cdot \left(n \cdot \left(\ell \cdot \ell\right)\right)\right)\right)}{Om \cdot Om}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if Om < -1.25000000000000005e-167 or 2.6500000000000001e-102 < Om Initial program 50.8%
Simplified58.8%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6449.9%
Simplified49.9%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6455.2%
Applied egg-rr55.2%
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.2%
Applied egg-rr56.2%
if -1.25000000000000005e-167 < Om < 2.6500000000000001e-102Initial program 42.2%
Simplified59.4%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr65.5%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6455.8%
Simplified55.8%
Final simplification56.1%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* U (* t n))))
(if (<= l 5.6e+104)
(sqrt (* (* t n) (* U 2.0)))
(if (<= l 8.5e+200)
(sqrt (/ (* -4.0 (* n (* U (* l l)))) Om))
(pow (* 4.0 (* t_1 t_1)) 0.25)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = U * (t * n);
double tmp;
if (l <= 5.6e+104) {
tmp = sqrt(((t * n) * (U * 2.0)));
} else if (l <= 8.5e+200) {
tmp = sqrt(((-4.0 * (n * (U * (l * l)))) / Om));
} else {
tmp = pow((4.0 * (t_1 * t_1)), 0.25);
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = u * (t * n)
if (l <= 5.6d+104) then
tmp = sqrt(((t * n) * (u * 2.0d0)))
else if (l <= 8.5d+200) then
tmp = sqrt((((-4.0d0) * (n * (u * (l * l)))) / om))
else
tmp = (4.0d0 * (t_1 * t_1)) ** 0.25d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = U * (t * n);
double tmp;
if (l <= 5.6e+104) {
tmp = Math.sqrt(((t * n) * (U * 2.0)));
} else if (l <= 8.5e+200) {
tmp = Math.sqrt(((-4.0 * (n * (U * (l * l)))) / Om));
} else {
tmp = Math.pow((4.0 * (t_1 * t_1)), 0.25);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = U * (t * n) tmp = 0 if l <= 5.6e+104: tmp = math.sqrt(((t * n) * (U * 2.0))) elif l <= 8.5e+200: tmp = math.sqrt(((-4.0 * (n * (U * (l * l)))) / Om)) else: tmp = math.pow((4.0 * (t_1 * t_1)), 0.25) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(U * Float64(t * n)) tmp = 0.0 if (l <= 5.6e+104) tmp = sqrt(Float64(Float64(t * n) * Float64(U * 2.0))); elseif (l <= 8.5e+200) tmp = sqrt(Float64(Float64(-4.0 * Float64(n * Float64(U * Float64(l * l)))) / Om)); else tmp = Float64(4.0 * Float64(t_1 * t_1)) ^ 0.25; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = U * (t * n); tmp = 0.0; if (l <= 5.6e+104) tmp = sqrt(((t * n) * (U * 2.0))); elseif (l <= 8.5e+200) tmp = sqrt(((-4.0 * (n * (U * (l * l)))) / Om)); else tmp = (4.0 * (t_1 * t_1)) ^ 0.25; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(U * N[(t * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 5.6e+104], N[Sqrt[N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 8.5e+200], N[Sqrt[N[(N[(-4.0 * N[(n * N[(U * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision], N[Power[N[(4.0 * N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := U \cdot \left(t \cdot n\right)\\
\mathbf{if}\;\ell \leq 5.6 \cdot 10^{+104}:\\
\;\;\;\;\sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right)}\\
\mathbf{elif}\;\ell \leq 8.5 \cdot 10^{+200}:\\
\;\;\;\;\sqrt{\frac{-4 \cdot \left(n \cdot \left(U \cdot \left(\ell \cdot \ell\right)\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;{\left(4 \cdot \left(t\_1 \cdot t\_1\right)\right)}^{0.25}\\
\end{array}
\end{array}
if l < 5.6e104Initial program 53.3%
Simplified61.1%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6442.8%
Simplified42.8%
if 5.6e104 < l < 8.5e200Initial program 36.7%
Simplified56.8%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6446.3%
Simplified46.3%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.6%
Applied egg-rr58.6%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6431.9%
Simplified31.9%
if 8.5e200 < l Initial program 7.9%
Simplified35.9%
Taylor expanded in t around inf
Simplified13.1%
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6413.2%
Applied egg-rr13.2%
pow1/2N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-prod-upN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
Applied egg-rr19.3%
Final simplification40.3%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 6.4e+161) (sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om)))))) (sqrt (* n (/ (* 2.0 (* U (* U* (* n (* l l))))) (* Om Om))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.4e+161) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 6.4d+161) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = sqrt((n * ((2.0d0 * (u * (u_42 * (n * (l * l))))) / (om * om))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.4e+161) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 6.4e+161: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 6.4e+161) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = sqrt(Float64(n * Float64(Float64(2.0 * Float64(U * Float64(U_42_ * Float64(n * Float64(l * l))))) / Float64(Om * Om)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 6.4e+161) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = sqrt((n * ((2.0 * (U * (U_42_ * (n * (l * l))))) / (Om * Om)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 6.4e+161], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(n * N[(N[(2.0 * N[(U * N[(U$42$ * N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6.4 \cdot 10^{+161}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \frac{2 \cdot \left(U \cdot \left(U* \cdot \left(n \cdot \left(\ell \cdot \ell\right)\right)\right)\right)}{Om \cdot Om}}\\
\end{array}
\end{array}
if l < 6.40000000000000004e161Initial program 52.0%
Simplified60.1%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6452.4%
Simplified52.4%
if 6.40000000000000004e161 < l Initial program 18.5%
Simplified47.9%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr46.6%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.8%
Simplified26.8%
Final simplification50.0%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 2e+161) (sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om)))))) (sqrt (* (* U (* 2.0 n)) (/ (* U* (* n (* l l))) (* Om Om))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2e+161) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = sqrt(((U * (2.0 * n)) * ((U_42_ * (n * (l * l))) / (Om * Om))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 2d+161) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = sqrt(((u * (2.0d0 * n)) * ((u_42 * (n * (l * l))) / (om * om))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2e+161) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.sqrt(((U * (2.0 * n)) * ((U_42_ * (n * (l * l))) / (Om * Om))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2e+161: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.sqrt(((U * (2.0 * n)) * ((U_42_ * (n * (l * l))) / (Om * Om)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2e+161) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = sqrt(Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(U_42_ * Float64(n * Float64(l * l))) / Float64(Om * Om)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2e+161) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = sqrt(((U * (2.0 * n)) * ((U_42_ * (n * (l * l))) / (Om * Om)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2e+161], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * N[(N[(U$42$ * N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2 \cdot 10^{+161}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot \frac{U* \cdot \left(n \cdot \left(\ell \cdot \ell\right)\right)}{Om \cdot Om}}\\
\end{array}
\end{array}
if l < 2.0000000000000001e161Initial program 52.0%
Simplified60.1%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6452.4%
Simplified52.4%
if 2.0000000000000001e161 < l Initial program 18.5%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.1%
Simplified26.1%
Final simplification49.9%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 2.2e+161) (sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om)))))) (sqrt (* 2.0 (* U (/ (* (* U* (* l l)) (* n n)) (* Om Om)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.2e+161) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = sqrt((2.0 * (U * (((U_42_ * (l * l)) * (n * n)) / (Om * Om)))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 2.2d+161) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = sqrt((2.0d0 * (u * (((u_42 * (l * l)) * (n * n)) / (om * om)))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.2e+161) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.sqrt((2.0 * (U * (((U_42_ * (l * l)) * (n * n)) / (Om * Om)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2.2e+161: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.sqrt((2.0 * (U * (((U_42_ * (l * l)) * (n * n)) / (Om * Om))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.2e+161) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(Float64(Float64(U_42_ * Float64(l * l)) * Float64(n * n)) / Float64(Om * Om))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2.2e+161) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = sqrt((2.0 * (U * (((U_42_ * (l * l)) * (n * n)) / (Om * Om))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.2e+161], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(N[(N[(U$42$ * N[(l * l), $MachinePrecision]), $MachinePrecision] * N[(n * n), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.2 \cdot 10^{+161}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \frac{\left(U* \cdot \left(\ell \cdot \ell\right)\right) \cdot \left(n \cdot n\right)}{Om \cdot Om}\right)}\\
\end{array}
\end{array}
if l < 2.2e161Initial program 52.0%
Simplified60.1%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6452.4%
Simplified52.4%
if 2.2e161 < l Initial program 18.5%
Simplified47.9%
Taylor expanded in U* around inf
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6425.4%
Simplified25.4%
Final simplification49.9%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* n (* U (* 2.0 t)))))
(if (<= l 5e+200)
(sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om))))))
(pow (* t_1 t_1) 0.25))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * (U * (2.0 * t));
double tmp;
if (l <= 5e+200) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = pow((t_1 * t_1), 0.25);
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = n * (u * (2.0d0 * t))
if (l <= 5d+200) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = (t_1 * t_1) ** 0.25d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * (U * (2.0 * t));
double tmp;
if (l <= 5e+200) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.pow((t_1 * t_1), 0.25);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = n * (U * (2.0 * t)) tmp = 0 if l <= 5e+200: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.pow((t_1 * t_1), 0.25) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n * Float64(U * Float64(2.0 * t))) tmp = 0.0 if (l <= 5e+200) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = Float64(t_1 * t_1) ^ 0.25; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = n * (U * (2.0 * t)); tmp = 0.0; if (l <= 5e+200) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = (t_1 * t_1) ^ 0.25; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[(U * N[(2.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 5e+200], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(t$95$1 * t$95$1), $MachinePrecision], 0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := n \cdot \left(U \cdot \left(2 \cdot t\right)\right)\\
\mathbf{if}\;\ell \leq 5 \cdot 10^{+200}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(t\_1 \cdot t\_1\right)}^{0.25}\\
\end{array}
\end{array}
if l < 5.00000000000000019e200Initial program 51.9%
Simplified60.7%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6452.4%
Simplified52.4%
if 5.00000000000000019e200 < l Initial program 7.9%
Simplified35.9%
Taylor expanded in t around inf
Simplified13.1%
pow1/2N/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval19.3%
Applied egg-rr19.3%
Final simplification50.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* U (* t n))))
(if (<= l 8.8e+200)
(sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om))))))
(pow (* 4.0 (* t_1 t_1)) 0.25))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = U * (t * n);
double tmp;
if (l <= 8.8e+200) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = pow((4.0 * (t_1 * t_1)), 0.25);
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = u * (t * n)
if (l <= 8.8d+200) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = (4.0d0 * (t_1 * t_1)) ** 0.25d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = U * (t * n);
double tmp;
if (l <= 8.8e+200) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.pow((4.0 * (t_1 * t_1)), 0.25);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = U * (t * n) tmp = 0 if l <= 8.8e+200: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.pow((4.0 * (t_1 * t_1)), 0.25) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(U * Float64(t * n)) tmp = 0.0 if (l <= 8.8e+200) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = Float64(4.0 * Float64(t_1 * t_1)) ^ 0.25; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = U * (t * n); tmp = 0.0; if (l <= 8.8e+200) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = (4.0 * (t_1 * t_1)) ^ 0.25; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(U * N[(t * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 8.8e+200], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(4.0 * N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := U \cdot \left(t \cdot n\right)\\
\mathbf{if}\;\ell \leq 8.8 \cdot 10^{+200}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(4 \cdot \left(t\_1 \cdot t\_1\right)\right)}^{0.25}\\
\end{array}
\end{array}
if l < 8.8e200Initial program 51.9%
Simplified60.7%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6452.4%
Simplified52.4%
if 8.8e200 < l Initial program 7.9%
Simplified35.9%
Taylor expanded in t around inf
Simplified13.1%
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6413.2%
Applied egg-rr13.2%
pow1/2N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-prod-upN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
Applied egg-rr19.3%
Final simplification50.0%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 5.4e+104) (sqrt (* (* t n) (* U 2.0))) (sqrt (/ (* -4.0 (* n (* U (* l l)))) Om))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5.4e+104) {
tmp = sqrt(((t * n) * (U * 2.0)));
} else {
tmp = sqrt(((-4.0 * (n * (U * (l * l)))) / Om));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 5.4d+104) then
tmp = sqrt(((t * n) * (u * 2.0d0)))
else
tmp = sqrt((((-4.0d0) * (n * (u * (l * l)))) / om))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5.4e+104) {
tmp = Math.sqrt(((t * n) * (U * 2.0)));
} else {
tmp = Math.sqrt(((-4.0 * (n * (U * (l * l)))) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 5.4e+104: tmp = math.sqrt(((t * n) * (U * 2.0))) else: tmp = math.sqrt(((-4.0 * (n * (U * (l * l)))) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 5.4e+104) tmp = sqrt(Float64(Float64(t * n) * Float64(U * 2.0))); else tmp = sqrt(Float64(Float64(-4.0 * Float64(n * Float64(U * Float64(l * l)))) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 5.4e+104) tmp = sqrt(((t * n) * (U * 2.0))); else tmp = sqrt(((-4.0 * (n * (U * (l * l)))) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 5.4e+104], N[Sqrt[N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(-4.0 * N[(n * N[(U * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 5.4 \cdot 10^{+104}:\\
\;\;\;\;\sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-4 \cdot \left(n \cdot \left(U \cdot \left(\ell \cdot \ell\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 5.39999999999999969e104Initial program 53.3%
Simplified61.1%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6442.8%
Simplified42.8%
if 5.39999999999999969e104 < l Initial program 23.0%
Simplified46.9%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6428.5%
Simplified28.5%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6448.1%
Applied egg-rr48.1%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6421.0%
Simplified21.0%
Final simplification39.6%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 5.6e+104) (sqrt (* (* t n) (* U 2.0))) (sqrt (/ (* -4.0 (* U (* n (* l l)))) Om))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5.6e+104) {
tmp = sqrt(((t * n) * (U * 2.0)));
} else {
tmp = sqrt(((-4.0 * (U * (n * (l * l)))) / Om));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 5.6d+104) then
tmp = sqrt(((t * n) * (u * 2.0d0)))
else
tmp = sqrt((((-4.0d0) * (u * (n * (l * l)))) / om))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5.6e+104) {
tmp = Math.sqrt(((t * n) * (U * 2.0)));
} else {
tmp = Math.sqrt(((-4.0 * (U * (n * (l * l)))) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 5.6e+104: tmp = math.sqrt(((t * n) * (U * 2.0))) else: tmp = math.sqrt(((-4.0 * (U * (n * (l * l)))) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 5.6e+104) tmp = sqrt(Float64(Float64(t * n) * Float64(U * 2.0))); else tmp = sqrt(Float64(Float64(-4.0 * Float64(U * Float64(n * Float64(l * l)))) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 5.6e+104) tmp = sqrt(((t * n) * (U * 2.0))); else tmp = sqrt(((-4.0 * (U * (n * (l * l)))) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 5.6e+104], N[Sqrt[N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(-4.0 * N[(U * N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 5.6 \cdot 10^{+104}:\\
\;\;\;\;\sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-4 \cdot \left(U \cdot \left(n \cdot \left(\ell \cdot \ell\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 5.6e104Initial program 53.3%
Simplified61.1%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6442.8%
Simplified42.8%
if 5.6e104 < l Initial program 23.0%
Simplified46.9%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6428.5%
Simplified28.5%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6423.4%
Simplified23.4%
Final simplification39.9%
(FPCore (n U t l Om U*) :precision binary64 (if (<= U* -2.25e-297) (pow (* n (* U (* 2.0 t))) 0.5) (sqrt (* (* t n) (* U 2.0)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= -2.25e-297) {
tmp = pow((n * (U * (2.0 * t))), 0.5);
} else {
tmp = sqrt(((t * n) * (U * 2.0)));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u_42 <= (-2.25d-297)) then
tmp = (n * (u * (2.0d0 * t))) ** 0.5d0
else
tmp = sqrt(((t * n) * (u * 2.0d0)))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= -2.25e-297) {
tmp = Math.pow((n * (U * (2.0 * t))), 0.5);
} else {
tmp = Math.sqrt(((t * n) * (U * 2.0)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if U_42_ <= -2.25e-297: tmp = math.pow((n * (U * (2.0 * t))), 0.5) else: tmp = math.sqrt(((t * n) * (U * 2.0))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U_42_ <= -2.25e-297) tmp = Float64(n * Float64(U * Float64(2.0 * t))) ^ 0.5; else tmp = sqrt(Float64(Float64(t * n) * Float64(U * 2.0))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U_42_ <= -2.25e-297) tmp = (n * (U * (2.0 * t))) ^ 0.5; else tmp = sqrt(((t * n) * (U * 2.0))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U$42$, -2.25e-297], N[Power[N[(n * N[(U * N[(2.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U* \leq -2.25 \cdot 10^{-297}:\\
\;\;\;\;{\left(n \cdot \left(U \cdot \left(2 \cdot t\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right)}\\
\end{array}
\end{array}
if U* < -2.24999999999999988e-297Initial program 53.4%
Simplified61.3%
Taylor expanded in t around inf
Simplified40.3%
pow1/2N/A
pow-lowering-pow.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6447.7%
Applied egg-rr47.7%
if -2.24999999999999988e-297 < U* Initial program 44.4%
Simplified56.6%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6432.9%
Simplified32.9%
Final simplification40.3%
(FPCore (n U t l Om U*) :precision binary64 (if (<= Om 3.5e-216) (sqrt (* (* t n) (* U 2.0))) (sqrt (* t (* U (* 2.0 n))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= 3.5e-216) {
tmp = sqrt(((t * n) * (U * 2.0)));
} else {
tmp = sqrt((t * (U * (2.0 * n))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (om <= 3.5d-216) then
tmp = sqrt(((t * n) * (u * 2.0d0)))
else
tmp = sqrt((t * (u * (2.0d0 * n))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= 3.5e-216) {
tmp = Math.sqrt(((t * n) * (U * 2.0)));
} else {
tmp = Math.sqrt((t * (U * (2.0 * n))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if Om <= 3.5e-216: tmp = math.sqrt(((t * n) * (U * 2.0))) else: tmp = math.sqrt((t * (U * (2.0 * n)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (Om <= 3.5e-216) tmp = sqrt(Float64(Float64(t * n) * Float64(U * 2.0))); else tmp = sqrt(Float64(t * Float64(U * Float64(2.0 * n)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (Om <= 3.5e-216) tmp = sqrt(((t * n) * (U * 2.0))); else tmp = sqrt((t * (U * (2.0 * n)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[Om, 3.5e-216], N[Sqrt[N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t * N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;Om \leq 3.5 \cdot 10^{-216}:\\
\;\;\;\;\sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t \cdot \left(U \cdot \left(2 \cdot n\right)\right)}\\
\end{array}
\end{array}
if Om < 3.49999999999999982e-216Initial program 49.6%
Simplified58.8%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6441.4%
Simplified41.4%
if 3.49999999999999982e-216 < Om Initial program 47.9%
Taylor expanded in t around inf
Simplified38.2%
Final simplification40.0%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* t n) (* U 2.0))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt(((t * n) * (U * 2.0)));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt(((t * n) * (u * 2.0d0)))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt(((t * n) * (U * 2.0)));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt(((t * n) * (U * 2.0)))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(t * n) * Float64(U * 2.0))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt(((t * n) * (U * 2.0))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(t * n), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(t \cdot n\right) \cdot \left(U \cdot 2\right)}
\end{array}
Initial program 48.8%
Simplified59.0%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.4%
Simplified38.4%
Final simplification38.4%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* t (* U n)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * (t * (U * n))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((2.0d0 * (t * (u * n))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((2.0 * (t * (U * n))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * (t * (U * n))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(t * Float64(U * n)))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * (t * (U * n)))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(t * N[(U * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(t \cdot \left(U \cdot n\right)\right)}
\end{array}
Initial program 48.8%
Simplified59.0%
Taylor expanded in t around inf
Simplified35.9%
Final simplification35.9%
herbie shell --seed 2024138
(FPCore (n U t l Om U*)
:name "Toniolo and Linder, Equation (13)"
:precision binary64
(sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))