
(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 26 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
(let* ((t_1 (* (* 2.0 n) U))
(t_2
(*
t_1
(+
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U* U))))))
(if (<= t_2 2e-320)
(*
(sqrt
(* (* 2.0 n) (+ t (/ (* l (+ -2.0 (/ (* n (- U* U)) Om))) (/ Om l)))))
(sqrt U))
(if (<= t_2 INFINITY)
(sqrt
(*
t_1
(-
(- t (* 2.0 (/ l (/ Om l))))
(* (- U U*) (* (/ l Om) (/ n (/ Om l)))))))
(pow
(/
(* Om 0.5)
(* U (* (* n l) (+ (* l -2.0) (/ (* (* n l) (- U* U)) Om)))))
-0.5)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) + ((n * pow((l / Om), 2.0)) * (U_42_ - U)));
double tmp;
if (t_2 <= 2e-320) {
tmp = sqrt(((2.0 * n) * (t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))))) * sqrt(U);
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * ((t - (2.0 * (l / (Om / l)))) - ((U - U_42_) * ((l / Om) * (n / (Om / l)))))));
} else {
tmp = pow(((Om * 0.5) / (U * ((n * l) * ((l * -2.0) + (((n * l) * (U_42_ - U)) / Om))))), -0.5);
}
return tmp;
}
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) + ((n * Math.pow((l / Om), 2.0)) * (U_42_ - U)));
double tmp;
if (t_2 <= 2e-320) {
tmp = Math.sqrt(((2.0 * n) * (t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))))) * Math.sqrt(U);
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_1 * ((t - (2.0 * (l / (Om / l)))) - ((U - U_42_) * ((l / Om) * (n / (Om / l)))))));
} else {
tmp = Math.pow(((Om * 0.5) / (U * ((n * l) * ((l * -2.0) + (((n * l) * (U_42_ - U)) / Om))))), -0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (2.0 * n) * U t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) + ((n * math.pow((l / Om), 2.0)) * (U_42_ - U))) tmp = 0 if t_2 <= 2e-320: tmp = math.sqrt(((2.0 * n) * (t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))))) * math.sqrt(U) elif t_2 <= math.inf: tmp = math.sqrt((t_1 * ((t - (2.0 * (l / (Om / l)))) - ((U - U_42_) * ((l / Om) * (n / (Om / l))))))) else: tmp = math.pow(((Om * 0.5) / (U * ((n * l) * ((l * -2.0) + (((n * l) * (U_42_ - U)) / Om))))), -0.5) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) t_2 = Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)))) tmp = 0.0 if (t_2 <= 2e-320) tmp = Float64(sqrt(Float64(Float64(2.0 * n) * Float64(t + Float64(Float64(l * Float64(-2.0 + Float64(Float64(n * Float64(U_42_ - U)) / Om))) / Float64(Om / l))))) * sqrt(U)); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(l / Float64(Om / l)))) - Float64(Float64(U - U_42_) * Float64(Float64(l / Om) * Float64(n / Float64(Om / l))))))); else tmp = Float64(Float64(Om * 0.5) / Float64(U * Float64(Float64(n * l) * Float64(Float64(l * -2.0) + Float64(Float64(Float64(n * l) * Float64(U_42_ - U)) / Om))))) ^ -0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (2.0 * n) * U; t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) + ((n * ((l / Om) ^ 2.0)) * (U_42_ - U))); tmp = 0.0; if (t_2 <= 2e-320) tmp = sqrt(((2.0 * n) * (t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))))) * sqrt(U); elseif (t_2 <= Inf) tmp = sqrt((t_1 * ((t - (2.0 * (l / (Om / l)))) - ((U - U_42_) * ((l / Om) * (n / (Om / l))))))); else tmp = ((Om * 0.5) / (U * ((n * l) * ((l * -2.0) + (((n * l) * (U_42_ - U)) / Om))))) ^ -0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * 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$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 2e-320], N[(N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(t + N[(N[(l * N[(-2.0 + N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[U], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(U - U$42$), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(N[(Om * 0.5), $MachinePrecision] / N[(U * N[(N[(n * l), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(N[(n * l), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
t_2 := t\_1 \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)\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-320}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(t + \frac{\ell \cdot \left(-2 + \frac{n \cdot \left(U* - U\right)}{Om}\right)}{\frac{Om}{\ell}}\right)} \cdot \sqrt{U}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right) - \left(U - U*\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{n}{\frac{Om}{\ell}}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{Om \cdot 0.5}{U \cdot \left(\left(n \cdot \ell\right) \cdot \left(\ell \cdot -2 + \frac{\left(n \cdot \ell\right) \cdot \left(U* - U\right)}{Om}\right)\right)}\right)}^{-0.5}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 1.99998e-320Initial program 13.6%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6422.5%
Applied egg-rr22.5%
Applied egg-rr24.6%
inv-powN/A
pow-powN/A
metadata-evalN/A
pow1/2N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr49.9%
if 1.99998e-320 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 71.1%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6474.5%
Applied egg-rr74.5%
unpow2N/A
clear-numN/A
associate-/r/N/A
div-invN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6475.1%
Applied egg-rr75.1%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f640.6%
Applied egg-rr0.6%
Applied egg-rr36.5%
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
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f6466.8%
Simplified66.8%
Final simplification70.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(pow
(/
-1.0
(*
(* n (* 2.0 U))
(- (/ (- (* n (/ (- U U*) (/ Om l))) (* l -2.0)) (/ Om l)) t)))
-0.5)))
(if (<= n -2.8e-131)
t_1
(if (<= n 1.16e-171)
(sqrt (+ (/ (* l (* U (* n l))) (/ Om -4.0)) (* U (* n (* 2.0 t)))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = pow((-1.0 / ((n * (2.0 * U)) * ((((n * ((U - U_42_) / (Om / l))) - (l * -2.0)) / (Om / l)) - t))), -0.5);
double tmp;
if (n <= -2.8e-131) {
tmp = t_1;
} else if (n <= 1.16e-171) {
tmp = sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t)))));
} 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 = ((-1.0d0) / ((n * (2.0d0 * u)) * ((((n * ((u - u_42) / (om / l))) - (l * (-2.0d0))) / (om / l)) - t))) ** (-0.5d0)
if (n <= (-2.8d-131)) then
tmp = t_1
else if (n <= 1.16d-171) then
tmp = sqrt((((l * (u * (n * l))) / (om / (-4.0d0))) + (u * (n * (2.0d0 * t)))))
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.pow((-1.0 / ((n * (2.0 * U)) * ((((n * ((U - U_42_) / (Om / l))) - (l * -2.0)) / (Om / l)) - t))), -0.5);
double tmp;
if (n <= -2.8e-131) {
tmp = t_1;
} else if (n <= 1.16e-171) {
tmp = Math.sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t)))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.pow((-1.0 / ((n * (2.0 * U)) * ((((n * ((U - U_42_) / (Om / l))) - (l * -2.0)) / (Om / l)) - t))), -0.5) tmp = 0 if n <= -2.8e-131: tmp = t_1 elif n <= 1.16e-171: tmp = math.sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t))))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(-1.0 / Float64(Float64(n * Float64(2.0 * U)) * Float64(Float64(Float64(Float64(n * Float64(Float64(U - U_42_) / Float64(Om / l))) - Float64(l * -2.0)) / Float64(Om / l)) - t))) ^ -0.5 tmp = 0.0 if (n <= -2.8e-131) tmp = t_1; elseif (n <= 1.16e-171) tmp = sqrt(Float64(Float64(Float64(l * Float64(U * Float64(n * l))) / Float64(Om / -4.0)) + Float64(U * Float64(n * Float64(2.0 * t))))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (-1.0 / ((n * (2.0 * U)) * ((((n * ((U - U_42_) / (Om / l))) - (l * -2.0)) / (Om / l)) - t))) ^ -0.5; tmp = 0.0; if (n <= -2.8e-131) tmp = t_1; elseif (n <= 1.16e-171) tmp = sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t))))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Power[N[(-1.0 / N[(N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(n * N[(N[(U - U$42$), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[n, -2.8e-131], t$95$1, If[LessEqual[n, 1.16e-171], N[Sqrt[N[(N[(N[(l * N[(U * N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / -4.0), $MachinePrecision]), $MachinePrecision] + N[(U * N[(n * N[(2.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := {\left(\frac{-1}{\left(n \cdot \left(2 \cdot U\right)\right) \cdot \left(\frac{n \cdot \frac{U - U*}{\frac{Om}{\ell}} - \ell \cdot -2}{\frac{Om}{\ell}} - t\right)}\right)}^{-0.5}\\
\mathbf{if}\;n \leq -2.8 \cdot 10^{-131}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;n \leq 1.16 \cdot 10^{-171}:\\
\;\;\;\;\sqrt{\frac{\ell \cdot \left(U \cdot \left(n \cdot \ell\right)\right)}{\frac{Om}{-4}} + U \cdot \left(n \cdot \left(2 \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if n < -2.8e-131 or 1.15999999999999999e-171 < n Initial program 50.4%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6455.2%
Applied egg-rr55.2%
Applied egg-rr61.6%
associate-/l*N/A
div-invN/A
clear-numN/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
clear-numN/A
div-invN/A
/-lowering-/.f64N/A
--lowering--.f64N/A
/-lowering-/.f6465.3%
Applied egg-rr65.3%
if -2.8e-131 < n < 1.15999999999999999e-171Initial program 45.2%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6450.3%
Simplified50.3%
+-commutativeN/A
+-lowering-+.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.7%
Applied egg-rr63.7%
Final simplification64.9%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(pow
(/
-1.0
(*
(* n (* 2.0 U))
(- (* (/ l Om) (* l (- (* (- U U*) (/ n Om)) -2.0))) t)))
-0.5)))
(if (<= U -5e+16)
t_1
(if (<= U 1.4e-211)
(sqrt
(*
(* 2.0 n)
(/
U
(/
1.0
(+ t (/ (- (* l -2.0) (/ (* n (- U U*)) (/ Om l))) (/ Om l)))))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = pow((-1.0 / ((n * (2.0 * U)) * (((l / Om) * (l * (((U - U_42_) * (n / Om)) - -2.0))) - t))), -0.5);
double tmp;
if (U <= -5e+16) {
tmp = t_1;
} else if (U <= 1.4e-211) {
tmp = sqrt(((2.0 * n) * (U / (1.0 / (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l)))))));
} 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 = ((-1.0d0) / ((n * (2.0d0 * u)) * (((l / om) * (l * (((u - u_42) * (n / om)) - (-2.0d0)))) - t))) ** (-0.5d0)
if (u <= (-5d+16)) then
tmp = t_1
else if (u <= 1.4d-211) then
tmp = sqrt(((2.0d0 * n) * (u / (1.0d0 / (t + (((l * (-2.0d0)) - ((n * (u - u_42)) / (om / l))) / (om / l)))))))
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.pow((-1.0 / ((n * (2.0 * U)) * (((l / Om) * (l * (((U - U_42_) * (n / Om)) - -2.0))) - t))), -0.5);
double tmp;
if (U <= -5e+16) {
tmp = t_1;
} else if (U <= 1.4e-211) {
tmp = Math.sqrt(((2.0 * n) * (U / (1.0 / (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l)))))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.pow((-1.0 / ((n * (2.0 * U)) * (((l / Om) * (l * (((U - U_42_) * (n / Om)) - -2.0))) - t))), -0.5) tmp = 0 if U <= -5e+16: tmp = t_1 elif U <= 1.4e-211: tmp = math.sqrt(((2.0 * n) * (U / (1.0 / (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l))))))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(-1.0 / Float64(Float64(n * Float64(2.0 * U)) * Float64(Float64(Float64(l / Om) * Float64(l * Float64(Float64(Float64(U - U_42_) * Float64(n / Om)) - -2.0))) - t))) ^ -0.5 tmp = 0.0 if (U <= -5e+16) tmp = t_1; elseif (U <= 1.4e-211) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U / Float64(1.0 / Float64(t + Float64(Float64(Float64(l * -2.0) - Float64(Float64(n * Float64(U - U_42_)) / Float64(Om / l))) / Float64(Om / l))))))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (-1.0 / ((n * (2.0 * U)) * (((l / Om) * (l * (((U - U_42_) * (n / Om)) - -2.0))) - t))) ^ -0.5; tmp = 0.0; if (U <= -5e+16) tmp = t_1; elseif (U <= 1.4e-211) tmp = sqrt(((2.0 * n) * (U / (1.0 / (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l))))))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Power[N[(-1.0 / N[(N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(l / Om), $MachinePrecision] * N[(l * N[(N[(N[(U - U$42$), $MachinePrecision] * N[(n / Om), $MachinePrecision]), $MachinePrecision] - -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[U, -5e+16], t$95$1, If[LessEqual[U, 1.4e-211], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U / N[(1.0 / N[(t + N[(N[(N[(l * -2.0), $MachinePrecision] - N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := {\left(\frac{-1}{\left(n \cdot \left(2 \cdot U\right)\right) \cdot \left(\frac{\ell}{Om} \cdot \left(\ell \cdot \left(\left(U - U*\right) \cdot \frac{n}{Om} - -2\right)\right) - t\right)}\right)}^{-0.5}\\
\mathbf{if}\;U \leq -5 \cdot 10^{+16}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;U \leq 1.4 \cdot 10^{-211}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \frac{U}{\frac{1}{t + \frac{\ell \cdot -2 - \frac{n \cdot \left(U - U*\right)}{\frac{Om}{\ell}}}{\frac{Om}{\ell}}}}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if U < -5e16 or 1.3999999999999999e-211 < U Initial program 52.6%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6456.0%
Applied egg-rr56.0%
Applied egg-rr62.9%
clear-numN/A
associate-/r/N/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f6462.9%
Applied egg-rr62.9%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f6465.1%
Applied egg-rr65.1%
if -5e16 < U < 1.3999999999999999e-211Initial program 44.2%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6448.1%
Applied egg-rr48.1%
Applied egg-rr59.0%
Final simplification62.5%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(pow
(/
-1.0
(*
(* n (* 2.0 U))
(- (* (/ l Om) (* l (- (* (- U U*) (/ n Om)) -2.0))) t)))
-0.5)))
(if (<= U -3e+16)
t_1
(if (<= U 1.85e-211)
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (- (* l -2.0) (/ (* n (- U U*)) (/ Om l))) (/ Om l))))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = pow((-1.0 / ((n * (2.0 * U)) * (((l / Om) * (l * (((U - U_42_) * (n / Om)) - -2.0))) - t))), -0.5);
double tmp;
if (U <= -3e+16) {
tmp = t_1;
} else if (U <= 1.85e-211) {
tmp = sqrt(((2.0 * n) * (U * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l))))));
} 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 = ((-1.0d0) / ((n * (2.0d0 * u)) * (((l / om) * (l * (((u - u_42) * (n / om)) - (-2.0d0)))) - t))) ** (-0.5d0)
if (u <= (-3d+16)) then
tmp = t_1
else if (u <= 1.85d-211) then
tmp = sqrt(((2.0d0 * n) * (u * (t + (((l * (-2.0d0)) - ((n * (u - u_42)) / (om / l))) / (om / l))))))
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.pow((-1.0 / ((n * (2.0 * U)) * (((l / Om) * (l * (((U - U_42_) * (n / Om)) - -2.0))) - t))), -0.5);
double tmp;
if (U <= -3e+16) {
tmp = t_1;
} else if (U <= 1.85e-211) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l))))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.pow((-1.0 / ((n * (2.0 * U)) * (((l / Om) * (l * (((U - U_42_) * (n / Om)) - -2.0))) - t))), -0.5) tmp = 0 if U <= -3e+16: tmp = t_1 elif U <= 1.85e-211: tmp = math.sqrt(((2.0 * n) * (U * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l)))))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(-1.0 / Float64(Float64(n * Float64(2.0 * U)) * Float64(Float64(Float64(l / Om) * Float64(l * Float64(Float64(Float64(U - U_42_) * Float64(n / Om)) - -2.0))) - t))) ^ -0.5 tmp = 0.0 if (U <= -3e+16) tmp = t_1; elseif (U <= 1.85e-211) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(Float64(l * -2.0) - Float64(Float64(n * Float64(U - U_42_)) / Float64(Om / l))) / Float64(Om / l)))))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (-1.0 / ((n * (2.0 * U)) * (((l / Om) * (l * (((U - U_42_) * (n / Om)) - -2.0))) - t))) ^ -0.5; tmp = 0.0; if (U <= -3e+16) tmp = t_1; elseif (U <= 1.85e-211) tmp = sqrt(((2.0 * n) * (U * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l)))))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Power[N[(-1.0 / N[(N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(l / Om), $MachinePrecision] * N[(l * N[(N[(N[(U - U$42$), $MachinePrecision] * N[(n / Om), $MachinePrecision]), $MachinePrecision] - -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[U, -3e+16], t$95$1, If[LessEqual[U, 1.85e-211], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(l * -2.0), $MachinePrecision] - N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := {\left(\frac{-1}{\left(n \cdot \left(2 \cdot U\right)\right) \cdot \left(\frac{\ell}{Om} \cdot \left(\ell \cdot \left(\left(U - U*\right) \cdot \frac{n}{Om} - -2\right)\right) - t\right)}\right)}^{-0.5}\\
\mathbf{if}\;U \leq -3 \cdot 10^{+16}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;U \leq 1.85 \cdot 10^{-211}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot -2 - \frac{n \cdot \left(U - U*\right)}{\frac{Om}{\ell}}}{\frac{Om}{\ell}}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if U < -3e16 or 1.8499999999999999e-211 < U Initial program 52.6%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6456.0%
Applied egg-rr56.0%
Applied egg-rr62.9%
clear-numN/A
associate-/r/N/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f6462.9%
Applied egg-rr62.9%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f6465.1%
Applied egg-rr65.1%
if -3e16 < U < 1.8499999999999999e-211Initial program 44.2%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6448.1%
Applied egg-rr48.1%
Applied egg-rr59.0%
Final simplification62.5%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* n (* 2.0 U))))
(if (<= l 1.5e-67)
(pow (/ 1.0 (* t_1 (+ t (* (/ l Om) (/ (* U* (* n l)) Om))))) -0.5)
(if (<= l 6e+151)
(sqrt (* (+ t (/ (* l (+ -2.0 (/ (* n (- U* U)) Om))) (/ Om l))) t_1))
(pow
(/
(* Om 0.5)
(* U (* (* n l) (+ (* l -2.0) (/ (* (* n l) (- U* U)) Om)))))
-0.5)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * (2.0 * U);
double tmp;
if (l <= 1.5e-67) {
tmp = pow((1.0 / (t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5);
} else if (l <= 6e+151) {
tmp = sqrt(((t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))) * t_1));
} else {
tmp = pow(((Om * 0.5) / (U * ((n * l) * ((l * -2.0) + (((n * l) * (U_42_ - U)) / Om))))), -0.5);
}
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 * (2.0d0 * u)
if (l <= 1.5d-67) then
tmp = (1.0d0 / (t_1 * (t + ((l / om) * ((u_42 * (n * l)) / om))))) ** (-0.5d0)
else if (l <= 6d+151) then
tmp = sqrt(((t + ((l * ((-2.0d0) + ((n * (u_42 - u)) / om))) / (om / l))) * t_1))
else
tmp = ((om * 0.5d0) / (u * ((n * l) * ((l * (-2.0d0)) + (((n * l) * (u_42 - u)) / om))))) ** (-0.5d0)
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 * (2.0 * U);
double tmp;
if (l <= 1.5e-67) {
tmp = Math.pow((1.0 / (t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5);
} else if (l <= 6e+151) {
tmp = Math.sqrt(((t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))) * t_1));
} else {
tmp = Math.pow(((Om * 0.5) / (U * ((n * l) * ((l * -2.0) + (((n * l) * (U_42_ - U)) / Om))))), -0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = n * (2.0 * U) tmp = 0 if l <= 1.5e-67: tmp = math.pow((1.0 / (t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5) elif l <= 6e+151: tmp = math.sqrt(((t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))) * t_1)) else: tmp = math.pow(((Om * 0.5) / (U * ((n * l) * ((l * -2.0) + (((n * l) * (U_42_ - U)) / Om))))), -0.5) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n * Float64(2.0 * U)) tmp = 0.0 if (l <= 1.5e-67) tmp = Float64(1.0 / Float64(t_1 * Float64(t + Float64(Float64(l / Om) * Float64(Float64(U_42_ * Float64(n * l)) / Om))))) ^ -0.5; elseif (l <= 6e+151) tmp = sqrt(Float64(Float64(t + Float64(Float64(l * Float64(-2.0 + Float64(Float64(n * Float64(U_42_ - U)) / Om))) / Float64(Om / l))) * t_1)); else tmp = Float64(Float64(Om * 0.5) / Float64(U * Float64(Float64(n * l) * Float64(Float64(l * -2.0) + Float64(Float64(Float64(n * l) * Float64(U_42_ - U)) / Om))))) ^ -0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = n * (2.0 * U); tmp = 0.0; if (l <= 1.5e-67) tmp = (1.0 / (t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))) ^ -0.5; elseif (l <= 6e+151) tmp = sqrt(((t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))) * t_1)); else tmp = ((Om * 0.5) / (U * ((n * l) * ((l * -2.0) + (((n * l) * (U_42_ - U)) / Om))))) ^ -0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 1.5e-67], N[Power[N[(1.0 / N[(t$95$1 * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], If[LessEqual[l, 6e+151], N[Sqrt[N[(N[(t + N[(N[(l * N[(-2.0 + N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision], N[Power[N[(N[(Om * 0.5), $MachinePrecision] / N[(U * N[(N[(n * l), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(N[(n * l), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := n \cdot \left(2 \cdot U\right)\\
\mathbf{if}\;\ell \leq 1.5 \cdot 10^{-67}:\\
\;\;\;\;{\left(\frac{1}{t\_1 \cdot \left(t + \frac{\ell}{Om} \cdot \frac{U* \cdot \left(n \cdot \ell\right)}{Om}\right)}\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq 6 \cdot 10^{+151}:\\
\;\;\;\;\sqrt{\left(t + \frac{\ell \cdot \left(-2 + \frac{n \cdot \left(U* - U\right)}{Om}\right)}{\frac{Om}{\ell}}\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{Om \cdot 0.5}{U \cdot \left(\left(n \cdot \ell\right) \cdot \left(\ell \cdot -2 + \frac{\left(n \cdot \ell\right) \cdot \left(U* - U\right)}{Om}\right)\right)}\right)}^{-0.5}\\
\end{array}
\end{array}
if l < 1.50000000000000016e-67Initial program 51.9%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6455.6%
Applied egg-rr55.6%
Applied egg-rr57.7%
clear-numN/A
associate-/r/N/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f6455.1%
Applied egg-rr55.1%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6451.2%
Simplified51.2%
if 1.50000000000000016e-67 < l < 5.9999999999999998e151Initial program 63.6%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6463.6%
Applied egg-rr63.6%
Applied egg-rr69.0%
inv-powN/A
pow-powN/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr68.9%
if 5.9999999999999998e151 < l Initial program 16.3%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6423.0%
Applied egg-rr23.0%
Applied egg-rr51.1%
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
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f6456.8%
Simplified56.8%
Final simplification54.5%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* n (* 2.0 U))))
(if (<= n -1.8e-127)
(pow (/ 1.0 (* t_1 (+ t (/ (/ (* U* (* n l)) Om) (/ Om l))))) -0.5)
(if (<= n 2.25e-171)
(sqrt (+ (/ (* l (* U (* n l))) (/ Om -4.0)) (* U (* n (* 2.0 t)))))
(sqrt
(* (+ t (/ (* l (+ -2.0 (/ (* n (- U* U)) Om))) (/ Om l))) t_1))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * (2.0 * U);
double tmp;
if (n <= -1.8e-127) {
tmp = pow((1.0 / (t_1 * (t + (((U_42_ * (n * l)) / Om) / (Om / l))))), -0.5);
} else if (n <= 2.25e-171) {
tmp = sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t)))));
} else {
tmp = sqrt(((t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))) * 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 = n * (2.0d0 * u)
if (n <= (-1.8d-127)) then
tmp = (1.0d0 / (t_1 * (t + (((u_42 * (n * l)) / om) / (om / l))))) ** (-0.5d0)
else if (n <= 2.25d-171) then
tmp = sqrt((((l * (u * (n * l))) / (om / (-4.0d0))) + (u * (n * (2.0d0 * t)))))
else
tmp = sqrt(((t + ((l * ((-2.0d0) + ((n * (u_42 - u)) / om))) / (om / l))) * 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 = n * (2.0 * U);
double tmp;
if (n <= -1.8e-127) {
tmp = Math.pow((1.0 / (t_1 * (t + (((U_42_ * (n * l)) / Om) / (Om / l))))), -0.5);
} else if (n <= 2.25e-171) {
tmp = Math.sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t)))));
} else {
tmp = Math.sqrt(((t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))) * t_1));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = n * (2.0 * U) tmp = 0 if n <= -1.8e-127: tmp = math.pow((1.0 / (t_1 * (t + (((U_42_ * (n * l)) / Om) / (Om / l))))), -0.5) elif n <= 2.25e-171: tmp = math.sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t))))) else: tmp = math.sqrt(((t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))) * t_1)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n * Float64(2.0 * U)) tmp = 0.0 if (n <= -1.8e-127) tmp = Float64(1.0 / Float64(t_1 * Float64(t + Float64(Float64(Float64(U_42_ * Float64(n * l)) / Om) / Float64(Om / l))))) ^ -0.5; elseif (n <= 2.25e-171) tmp = sqrt(Float64(Float64(Float64(l * Float64(U * Float64(n * l))) / Float64(Om / -4.0)) + Float64(U * Float64(n * Float64(2.0 * t))))); else tmp = sqrt(Float64(Float64(t + Float64(Float64(l * Float64(-2.0 + Float64(Float64(n * Float64(U_42_ - U)) / Om))) / Float64(Om / l))) * t_1)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = n * (2.0 * U); tmp = 0.0; if (n <= -1.8e-127) tmp = (1.0 / (t_1 * (t + (((U_42_ * (n * l)) / Om) / (Om / l))))) ^ -0.5; elseif (n <= 2.25e-171) tmp = sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t))))); else tmp = sqrt(((t + ((l * (-2.0 + ((n * (U_42_ - U)) / Om))) / (Om / l))) * t_1)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -1.8e-127], N[Power[N[(1.0 / N[(t$95$1 * N[(t + N[(N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], If[LessEqual[n, 2.25e-171], N[Sqrt[N[(N[(N[(l * N[(U * N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / -4.0), $MachinePrecision]), $MachinePrecision] + N[(U * N[(n * N[(2.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(t + N[(N[(l * N[(-2.0 + N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := n \cdot \left(2 \cdot U\right)\\
\mathbf{if}\;n \leq -1.8 \cdot 10^{-127}:\\
\;\;\;\;{\left(\frac{1}{t\_1 \cdot \left(t + \frac{\frac{U* \cdot \left(n \cdot \ell\right)}{Om}}{\frac{Om}{\ell}}\right)}\right)}^{-0.5}\\
\mathbf{elif}\;n \leq 2.25 \cdot 10^{-171}:\\
\;\;\;\;\sqrt{\frac{\ell \cdot \left(U \cdot \left(n \cdot \ell\right)\right)}{\frac{Om}{-4}} + U \cdot \left(n \cdot \left(2 \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(t + \frac{\ell \cdot \left(-2 + \frac{n \cdot \left(U* - U\right)}{Om}\right)}{\frac{Om}{\ell}}\right) \cdot t\_1}\\
\end{array}
\end{array}
if n < -1.8e-127Initial program 49.1%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6451.7%
Applied egg-rr51.7%
Applied egg-rr58.1%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.3%
Simplified57.3%
if -1.8e-127 < n < 2.2500000000000002e-171Initial program 45.2%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6450.3%
Simplified50.3%
+-commutativeN/A
+-lowering-+.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.7%
Applied egg-rr63.7%
if 2.2500000000000002e-171 < n Initial program 51.4%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6457.8%
Applied egg-rr57.8%
Applied egg-rr64.1%
inv-powN/A
pow-powN/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr60.7%
Final simplification60.5%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 6.5e-91)
(pow
(/ 1.0 (* (* n (* 2.0 U)) (+ t (* (/ l Om) (/ (* U* (* n l)) Om)))))
-0.5)
(sqrt
(*
U
(*
(* 2.0 n)
(+ t (/ (- (* l -2.0) (/ (* n (- U U*)) (/ Om l))) (/ Om l))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.5e-91) {
tmp = pow((1.0 / ((n * (2.0 * U)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5);
} else {
tmp = sqrt((U * ((2.0 * n) * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (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 (l <= 6.5d-91) then
tmp = (1.0d0 / ((n * (2.0d0 * u)) * (t + ((l / om) * ((u_42 * (n * l)) / om))))) ** (-0.5d0)
else
tmp = sqrt((u * ((2.0d0 * n) * (t + (((l * (-2.0d0)) - ((n * (u - u_42)) / (om / l))) / (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 (l <= 6.5e-91) {
tmp = Math.pow((1.0 / ((n * (2.0 * U)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5);
} else {
tmp = Math.sqrt((U * ((2.0 * n) * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 6.5e-91: tmp = math.pow((1.0 / ((n * (2.0 * U)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5) else: tmp = math.sqrt((U * ((2.0 * n) * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 6.5e-91) tmp = Float64(1.0 / Float64(Float64(n * Float64(2.0 * U)) * Float64(t + Float64(Float64(l / Om) * Float64(Float64(U_42_ * Float64(n * l)) / Om))))) ^ -0.5; else tmp = sqrt(Float64(U * Float64(Float64(2.0 * n) * Float64(t + Float64(Float64(Float64(l * -2.0) - Float64(Float64(n * Float64(U - U_42_)) / Float64(Om / l))) / Float64(Om / l)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 6.5e-91) tmp = (1.0 / ((n * (2.0 * U)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))) ^ -0.5; else tmp = sqrt((U * ((2.0 * n) * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 6.5e-91], N[Power[N[(1.0 / N[(N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[Sqrt[N[(U * N[(N[(2.0 * n), $MachinePrecision] * N[(t + N[(N[(N[(l * -2.0), $MachinePrecision] - N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6.5 \cdot 10^{-91}:\\
\;\;\;\;{\left(\frac{1}{\left(n \cdot \left(2 \cdot U\right)\right) \cdot \left(t + \frac{\ell}{Om} \cdot \frac{U* \cdot \left(n \cdot \ell\right)}{Om}\right)}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \left(\left(2 \cdot n\right) \cdot \left(t + \frac{\ell \cdot -2 - \frac{n \cdot \left(U - U*\right)}{\frac{Om}{\ell}}}{\frac{Om}{\ell}}\right)\right)}\\
\end{array}
\end{array}
if l < 6.5000000000000001e-91Initial program 51.4%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6455.3%
Applied egg-rr55.3%
Applied egg-rr57.4%
clear-numN/A
associate-/r/N/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f6455.3%
Applied egg-rr55.3%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.7%
Simplified50.7%
if 6.5000000000000001e-91 < l Initial program 43.3%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6446.3%
Applied egg-rr46.3%
Applied egg-rr63.8%
Final simplification54.6%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 4.1e-193)
(pow
(/ 1.0 (* (* n (* 2.0 U)) (+ t (* (/ l Om) (/ (* U* (* n l)) Om)))))
-0.5)
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (- (* l -2.0) (/ (* n (- U U*)) (/ Om l))) (/ Om l))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4.1e-193) {
tmp = pow((1.0 / ((n * (2.0 * U)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5);
} else {
tmp = sqrt(((2.0 * n) * (U * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (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 (l <= 4.1d-193) then
tmp = (1.0d0 / ((n * (2.0d0 * u)) * (t + ((l / om) * ((u_42 * (n * l)) / om))))) ** (-0.5d0)
else
tmp = sqrt(((2.0d0 * n) * (u * (t + (((l * (-2.0d0)) - ((n * (u - u_42)) / (om / l))) / (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 (l <= 4.1e-193) {
tmp = Math.pow((1.0 / ((n * (2.0 * U)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5);
} else {
tmp = Math.sqrt(((2.0 * n) * (U * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 4.1e-193: tmp = math.pow((1.0 / ((n * (2.0 * U)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5) else: tmp = math.sqrt(((2.0 * n) * (U * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 4.1e-193) tmp = Float64(1.0 / Float64(Float64(n * Float64(2.0 * U)) * Float64(t + Float64(Float64(l / Om) * Float64(Float64(U_42_ * Float64(n * l)) / Om))))) ^ -0.5; else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(Float64(l * -2.0) - Float64(Float64(n * Float64(U - U_42_)) / Float64(Om / l))) / Float64(Om / l)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 4.1e-193) tmp = (1.0 / ((n * (2.0 * U)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))) ^ -0.5; else tmp = sqrt(((2.0 * n) * (U * (t + (((l * -2.0) - ((n * (U - U_42_)) / (Om / l))) / (Om / l)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 4.1e-193], N[Power[N[(1.0 / N[(N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(l * -2.0), $MachinePrecision] - N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 4.1 \cdot 10^{-193}:\\
\;\;\;\;{\left(\frac{1}{\left(n \cdot \left(2 \cdot U\right)\right) \cdot \left(t + \frac{\ell}{Om} \cdot \frac{U* \cdot \left(n \cdot \ell\right)}{Om}\right)}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot -2 - \frac{n \cdot \left(U - U*\right)}{\frac{Om}{\ell}}}{\frac{Om}{\ell}}\right)\right)}\\
\end{array}
\end{array}
if l < 4.10000000000000003e-193Initial program 50.4%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6454.7%
Applied egg-rr54.7%
Applied egg-rr57.7%
clear-numN/A
associate-/r/N/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f6455.4%
Applied egg-rr55.4%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.2%
Simplified50.2%
if 4.10000000000000003e-193 < l Initial program 46.6%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6449.0%
Applied egg-rr49.0%
Applied egg-rr59.9%
Final simplification53.8%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* n (* 2.0 U))))
(if (<= n -4e-133)
(pow (/ 1.0 (* t_1 (+ t (/ (/ (* U* (* n l)) Om) (/ Om l))))) -0.5)
(if (<= n 2.6e-171)
(sqrt (+ (/ (* l (* U (* n l))) (/ Om -4.0)) (* U (* n (* 2.0 t)))))
(pow (/ 1.0 (* t_1 (+ t (/ (* l -2.0) (/ Om l))))) -0.5)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * (2.0 * U);
double tmp;
if (n <= -4e-133) {
tmp = pow((1.0 / (t_1 * (t + (((U_42_ * (n * l)) / Om) / (Om / l))))), -0.5);
} else if (n <= 2.6e-171) {
tmp = sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t)))));
} else {
tmp = pow((1.0 / (t_1 * (t + ((l * -2.0) / (Om / l))))), -0.5);
}
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 * (2.0d0 * u)
if (n <= (-4d-133)) then
tmp = (1.0d0 / (t_1 * (t + (((u_42 * (n * l)) / om) / (om / l))))) ** (-0.5d0)
else if (n <= 2.6d-171) then
tmp = sqrt((((l * (u * (n * l))) / (om / (-4.0d0))) + (u * (n * (2.0d0 * t)))))
else
tmp = (1.0d0 / (t_1 * (t + ((l * (-2.0d0)) / (om / l))))) ** (-0.5d0)
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 * (2.0 * U);
double tmp;
if (n <= -4e-133) {
tmp = Math.pow((1.0 / (t_1 * (t + (((U_42_ * (n * l)) / Om) / (Om / l))))), -0.5);
} else if (n <= 2.6e-171) {
tmp = Math.sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t)))));
} else {
tmp = Math.pow((1.0 / (t_1 * (t + ((l * -2.0) / (Om / l))))), -0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = n * (2.0 * U) tmp = 0 if n <= -4e-133: tmp = math.pow((1.0 / (t_1 * (t + (((U_42_ * (n * l)) / Om) / (Om / l))))), -0.5) elif n <= 2.6e-171: tmp = math.sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t))))) else: tmp = math.pow((1.0 / (t_1 * (t + ((l * -2.0) / (Om / l))))), -0.5) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n * Float64(2.0 * U)) tmp = 0.0 if (n <= -4e-133) tmp = Float64(1.0 / Float64(t_1 * Float64(t + Float64(Float64(Float64(U_42_ * Float64(n * l)) / Om) / Float64(Om / l))))) ^ -0.5; elseif (n <= 2.6e-171) tmp = sqrt(Float64(Float64(Float64(l * Float64(U * Float64(n * l))) / Float64(Om / -4.0)) + Float64(U * Float64(n * Float64(2.0 * t))))); else tmp = Float64(1.0 / Float64(t_1 * Float64(t + Float64(Float64(l * -2.0) / Float64(Om / l))))) ^ -0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = n * (2.0 * U); tmp = 0.0; if (n <= -4e-133) tmp = (1.0 / (t_1 * (t + (((U_42_ * (n * l)) / Om) / (Om / l))))) ^ -0.5; elseif (n <= 2.6e-171) tmp = sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t))))); else tmp = (1.0 / (t_1 * (t + ((l * -2.0) / (Om / l))))) ^ -0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -4e-133], N[Power[N[(1.0 / N[(t$95$1 * N[(t + N[(N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], If[LessEqual[n, 2.6e-171], N[Sqrt[N[(N[(N[(l * N[(U * N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / -4.0), $MachinePrecision]), $MachinePrecision] + N[(U * N[(n * N[(2.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(1.0 / N[(t$95$1 * N[(t + N[(N[(l * -2.0), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := n \cdot \left(2 \cdot U\right)\\
\mathbf{if}\;n \leq -4 \cdot 10^{-133}:\\
\;\;\;\;{\left(\frac{1}{t\_1 \cdot \left(t + \frac{\frac{U* \cdot \left(n \cdot \ell\right)}{Om}}{\frac{Om}{\ell}}\right)}\right)}^{-0.5}\\
\mathbf{elif}\;n \leq 2.6 \cdot 10^{-171}:\\
\;\;\;\;\sqrt{\frac{\ell \cdot \left(U \cdot \left(n \cdot \ell\right)\right)}{\frac{Om}{-4}} + U \cdot \left(n \cdot \left(2 \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{1}{t\_1 \cdot \left(t + \frac{\ell \cdot -2}{\frac{Om}{\ell}}\right)}\right)}^{-0.5}\\
\end{array}
\end{array}
if n < -4.0000000000000003e-133Initial program 49.1%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6451.7%
Applied egg-rr51.7%
Applied egg-rr58.1%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.3%
Simplified57.3%
if -4.0000000000000003e-133 < n < 2.60000000000000005e-171Initial program 45.2%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6450.3%
Simplified50.3%
+-commutativeN/A
+-lowering-+.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.7%
Applied egg-rr63.7%
if 2.60000000000000005e-171 < n Initial program 51.4%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6457.8%
Applied egg-rr57.8%
Applied egg-rr64.1%
Taylor expanded in n around 0
*-lowering-*.f6458.2%
Simplified58.2%
Final simplification59.4%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* n (* 2.0 U))))
(if (<= n -6.2e-130)
(pow (/ 1.0 (* t_1 (+ t (* (/ l Om) (/ (* U* (* n l)) Om))))) -0.5)
(if (<= n 1.8e-171)
(sqrt (+ (/ (* l (* U (* n l))) (/ Om -4.0)) (* U (* n (* 2.0 t)))))
(pow (/ 1.0 (* t_1 (+ t (/ (* l -2.0) (/ Om l))))) -0.5)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * (2.0 * U);
double tmp;
if (n <= -6.2e-130) {
tmp = pow((1.0 / (t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5);
} else if (n <= 1.8e-171) {
tmp = sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t)))));
} else {
tmp = pow((1.0 / (t_1 * (t + ((l * -2.0) / (Om / l))))), -0.5);
}
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 * (2.0d0 * u)
if (n <= (-6.2d-130)) then
tmp = (1.0d0 / (t_1 * (t + ((l / om) * ((u_42 * (n * l)) / om))))) ** (-0.5d0)
else if (n <= 1.8d-171) then
tmp = sqrt((((l * (u * (n * l))) / (om / (-4.0d0))) + (u * (n * (2.0d0 * t)))))
else
tmp = (1.0d0 / (t_1 * (t + ((l * (-2.0d0)) / (om / l))))) ** (-0.5d0)
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 * (2.0 * U);
double tmp;
if (n <= -6.2e-130) {
tmp = Math.pow((1.0 / (t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5);
} else if (n <= 1.8e-171) {
tmp = Math.sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t)))));
} else {
tmp = Math.pow((1.0 / (t_1 * (t + ((l * -2.0) / (Om / l))))), -0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = n * (2.0 * U) tmp = 0 if n <= -6.2e-130: tmp = math.pow((1.0 / (t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))), -0.5) elif n <= 1.8e-171: tmp = math.sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t))))) else: tmp = math.pow((1.0 / (t_1 * (t + ((l * -2.0) / (Om / l))))), -0.5) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n * Float64(2.0 * U)) tmp = 0.0 if (n <= -6.2e-130) tmp = Float64(1.0 / Float64(t_1 * Float64(t + Float64(Float64(l / Om) * Float64(Float64(U_42_ * Float64(n * l)) / Om))))) ^ -0.5; elseif (n <= 1.8e-171) tmp = sqrt(Float64(Float64(Float64(l * Float64(U * Float64(n * l))) / Float64(Om / -4.0)) + Float64(U * Float64(n * Float64(2.0 * t))))); else tmp = Float64(1.0 / Float64(t_1 * Float64(t + Float64(Float64(l * -2.0) / Float64(Om / l))))) ^ -0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = n * (2.0 * U); tmp = 0.0; if (n <= -6.2e-130) tmp = (1.0 / (t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))) ^ -0.5; elseif (n <= 1.8e-171) tmp = sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t))))); else tmp = (1.0 / (t_1 * (t + ((l * -2.0) / (Om / l))))) ^ -0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -6.2e-130], N[Power[N[(1.0 / N[(t$95$1 * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], If[LessEqual[n, 1.8e-171], N[Sqrt[N[(N[(N[(l * N[(U * N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / -4.0), $MachinePrecision]), $MachinePrecision] + N[(U * N[(n * N[(2.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(1.0 / N[(t$95$1 * N[(t + N[(N[(l * -2.0), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := n \cdot \left(2 \cdot U\right)\\
\mathbf{if}\;n \leq -6.2 \cdot 10^{-130}:\\
\;\;\;\;{\left(\frac{1}{t\_1 \cdot \left(t + \frac{\ell}{Om} \cdot \frac{U* \cdot \left(n \cdot \ell\right)}{Om}\right)}\right)}^{-0.5}\\
\mathbf{elif}\;n \leq 1.8 \cdot 10^{-171}:\\
\;\;\;\;\sqrt{\frac{\ell \cdot \left(U \cdot \left(n \cdot \ell\right)\right)}{\frac{Om}{-4}} + U \cdot \left(n \cdot \left(2 \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{1}{t\_1 \cdot \left(t + \frac{\ell \cdot -2}{\frac{Om}{\ell}}\right)}\right)}^{-0.5}\\
\end{array}
\end{array}
if n < -6.20000000000000021e-130Initial program 49.1%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6451.7%
Applied egg-rr51.7%
Applied egg-rr58.1%
clear-numN/A
associate-/r/N/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f6455.7%
Applied egg-rr55.7%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.3%
Simplified57.3%
if -6.20000000000000021e-130 < n < 1.80000000000000002e-171Initial program 45.2%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6450.3%
Simplified50.3%
+-commutativeN/A
+-lowering-+.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.7%
Applied egg-rr63.7%
if 1.80000000000000002e-171 < n Initial program 51.4%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6457.8%
Applied egg-rr57.8%
Applied egg-rr64.1%
Taylor expanded in n around 0
*-lowering-*.f6458.2%
Simplified58.2%
Final simplification59.4%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(pow (/ 1.0 (* (* n (* 2.0 U)) (+ t (/ (* l -2.0) (/ Om l))))) -0.5)))
(if (<= n -5.5e-132)
t_1
(if (<= n 1.72e-171)
(sqrt (+ (/ (* l (* U (* n l))) (/ Om -4.0)) (* U (* n (* 2.0 t)))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = pow((1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))), -0.5);
double tmp;
if (n <= -5.5e-132) {
tmp = t_1;
} else if (n <= 1.72e-171) {
tmp = sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t)))));
} 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 = (1.0d0 / ((n * (2.0d0 * u)) * (t + ((l * (-2.0d0)) / (om / l))))) ** (-0.5d0)
if (n <= (-5.5d-132)) then
tmp = t_1
else if (n <= 1.72d-171) then
tmp = sqrt((((l * (u * (n * l))) / (om / (-4.0d0))) + (u * (n * (2.0d0 * t)))))
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.pow((1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))), -0.5);
double tmp;
if (n <= -5.5e-132) {
tmp = t_1;
} else if (n <= 1.72e-171) {
tmp = Math.sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t)))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.pow((1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))), -0.5) tmp = 0 if n <= -5.5e-132: tmp = t_1 elif n <= 1.72e-171: tmp = math.sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t))))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(1.0 / Float64(Float64(n * Float64(2.0 * U)) * Float64(t + Float64(Float64(l * -2.0) / Float64(Om / l))))) ^ -0.5 tmp = 0.0 if (n <= -5.5e-132) tmp = t_1; elseif (n <= 1.72e-171) tmp = sqrt(Float64(Float64(Float64(l * Float64(U * Float64(n * l))) / Float64(Om / -4.0)) + Float64(U * Float64(n * Float64(2.0 * t))))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))) ^ -0.5; tmp = 0.0; if (n <= -5.5e-132) tmp = t_1; elseif (n <= 1.72e-171) tmp = sqrt((((l * (U * (n * l))) / (Om / -4.0)) + (U * (n * (2.0 * t))))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Power[N[(1.0 / N[(N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l * -2.0), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[n, -5.5e-132], t$95$1, If[LessEqual[n, 1.72e-171], N[Sqrt[N[(N[(N[(l * N[(U * N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / -4.0), $MachinePrecision]), $MachinePrecision] + N[(U * N[(n * N[(2.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := {\left(\frac{1}{\left(n \cdot \left(2 \cdot U\right)\right) \cdot \left(t + \frac{\ell \cdot -2}{\frac{Om}{\ell}}\right)}\right)}^{-0.5}\\
\mathbf{if}\;n \leq -5.5 \cdot 10^{-132}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;n \leq 1.72 \cdot 10^{-171}:\\
\;\;\;\;\sqrt{\frac{\ell \cdot \left(U \cdot \left(n \cdot \ell\right)\right)}{\frac{Om}{-4}} + U \cdot \left(n \cdot \left(2 \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if n < -5.4999999999999999e-132 or 1.7199999999999999e-171 < n Initial program 50.4%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6455.2%
Applied egg-rr55.2%
Applied egg-rr61.6%
Taylor expanded in n around 0
*-lowering-*.f6456.6%
Simplified56.6%
if -5.4999999999999999e-132 < n < 1.7199999999999999e-171Initial program 45.2%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6450.3%
Simplified50.3%
+-commutativeN/A
+-lowering-+.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.7%
Applied egg-rr63.7%
Final simplification58.6%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(pow (/ 1.0 (* (* n (* 2.0 U)) (+ t (/ (* l -2.0) (/ Om l))))) -0.5)))
(if (<= n -9.6e-129)
t_1
(if (<= n 5.6e-173)
(sqrt (+ (* (* 2.0 U) (* n t)) (* (* U (* l (* n l))) (/ -4.0 Om))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = pow((1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))), -0.5);
double tmp;
if (n <= -9.6e-129) {
tmp = t_1;
} else if (n <= 5.6e-173) {
tmp = sqrt((((2.0 * U) * (n * t)) + ((U * (l * (n * l))) * (-4.0 / 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 = (1.0d0 / ((n * (2.0d0 * u)) * (t + ((l * (-2.0d0)) / (om / l))))) ** (-0.5d0)
if (n <= (-9.6d-129)) then
tmp = t_1
else if (n <= 5.6d-173) then
tmp = sqrt((((2.0d0 * u) * (n * t)) + ((u * (l * (n * l))) * ((-4.0d0) / 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.pow((1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))), -0.5);
double tmp;
if (n <= -9.6e-129) {
tmp = t_1;
} else if (n <= 5.6e-173) {
tmp = Math.sqrt((((2.0 * U) * (n * t)) + ((U * (l * (n * l))) * (-4.0 / Om))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.pow((1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))), -0.5) tmp = 0 if n <= -9.6e-129: tmp = t_1 elif n <= 5.6e-173: tmp = math.sqrt((((2.0 * U) * (n * t)) + ((U * (l * (n * l))) * (-4.0 / Om)))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(1.0 / Float64(Float64(n * Float64(2.0 * U)) * Float64(t + Float64(Float64(l * -2.0) / Float64(Om / l))))) ^ -0.5 tmp = 0.0 if (n <= -9.6e-129) tmp = t_1; elseif (n <= 5.6e-173) tmp = sqrt(Float64(Float64(Float64(2.0 * U) * Float64(n * t)) + Float64(Float64(U * Float64(l * Float64(n * l))) * Float64(-4.0 / Om)))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))) ^ -0.5; tmp = 0.0; if (n <= -9.6e-129) tmp = t_1; elseif (n <= 5.6e-173) tmp = sqrt((((2.0 * U) * (n * t)) + ((U * (l * (n * l))) * (-4.0 / Om)))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Power[N[(1.0 / N[(N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l * -2.0), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[n, -9.6e-129], t$95$1, If[LessEqual[n, 5.6e-173], N[Sqrt[N[(N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(N[(U * N[(l * N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-4.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := {\left(\frac{1}{\left(n \cdot \left(2 \cdot U\right)\right) \cdot \left(t + \frac{\ell \cdot -2}{\frac{Om}{\ell}}\right)}\right)}^{-0.5}\\
\mathbf{if}\;n \leq -9.6 \cdot 10^{-129}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;n \leq 5.6 \cdot 10^{-173}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\right) + \left(U \cdot \left(\ell \cdot \left(n \cdot \ell\right)\right)\right) \cdot \frac{-4}{Om}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if n < -9.59999999999999954e-129 or 5.5999999999999998e-173 < n Initial program 50.4%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6455.2%
Applied egg-rr55.2%
Applied egg-rr61.6%
Taylor expanded in n around 0
*-lowering-*.f6456.6%
Simplified56.6%
if -9.59999999999999954e-129 < n < 5.5999999999999998e-173Initial program 45.2%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6450.3%
Simplified50.3%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6461.5%
Applied egg-rr61.5%
Final simplification58.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (sqrt (* (* (* 2.0 n) U) (+ t (* (/ (* l l) Om) -2.0))))))
(if (<= Om -5.7e-279)
t_1
(if (<= Om 1.26e-169)
(/ (* l (sqrt (* (* n (- U U*)) (* n (* U -2.0))))) Om)
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt((((2.0 * n) * U) * (t + (((l * l) / Om) * -2.0))));
double tmp;
if (Om <= -5.7e-279) {
tmp = t_1;
} else if (Om <= 1.26e-169) {
tmp = (l * sqrt(((n * (U - U_42_)) * (n * (U * -2.0))))) / 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 * n) * u) * (t + (((l * l) / om) * (-2.0d0)))))
if (om <= (-5.7d-279)) then
tmp = t_1
else if (om <= 1.26d-169) then
tmp = (l * sqrt(((n * (u - u_42)) * (n * (u * (-2.0d0)))))) / 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 * n) * U) * (t + (((l * l) / Om) * -2.0))));
double tmp;
if (Om <= -5.7e-279) {
tmp = t_1;
} else if (Om <= 1.26e-169) {
tmp = (l * Math.sqrt(((n * (U - U_42_)) * (n * (U * -2.0))))) / Om;
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt((((2.0 * n) * U) * (t + (((l * l) / Om) * -2.0)))) tmp = 0 if Om <= -5.7e-279: tmp = t_1 elif Om <= 1.26e-169: tmp = (l * math.sqrt(((n * (U - U_42_)) * (n * (U * -2.0))))) / Om else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)))) tmp = 0.0 if (Om <= -5.7e-279) tmp = t_1; elseif (Om <= 1.26e-169) tmp = Float64(Float64(l * sqrt(Float64(Float64(n * Float64(U - U_42_)) * Float64(n * Float64(U * -2.0))))) / 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 * n) * U) * (t + (((l * l) / Om) * -2.0)))); tmp = 0.0; if (Om <= -5.7e-279) tmp = t_1; elseif (Om <= 1.26e-169) tmp = (l * sqrt(((n * (U - U_42_)) * (n * (U * -2.0))))) / 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[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[Om, -5.7e-279], t$95$1, If[LessEqual[Om, 1.26e-169], N[(N[(l * N[Sqrt[N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] * N[(n * N[(U * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right)}\\
\mathbf{if}\;Om \leq -5.7 \cdot 10^{-279}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;Om \leq 1.26 \cdot 10^{-169}:\\
\;\;\;\;\frac{\ell \cdot \sqrt{\left(n \cdot \left(U - U*\right)\right) \cdot \left(n \cdot \left(U \cdot -2\right)\right)}}{Om}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if Om < -5.7000000000000001e-279 or 1.26e-169 < Om Initial program 50.2%
Taylor expanded in Om around inf
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.2%
Simplified46.2%
if -5.7000000000000001e-279 < Om < 1.26e-169Initial program 39.6%
Taylor expanded in n around inf
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6439.3%
Simplified39.3%
sqrt-divN/A
sqrt-prodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6448.8%
Applied egg-rr48.8%
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
sqrt-prodN/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6429.9%
Applied egg-rr29.9%
Final simplification44.3%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 2.8e+162) (sqrt (* (* (* 2.0 n) U) (+ t (* (/ (* l l) Om) -2.0)))) (* l (/ (sqrt (* (* n (- U U*)) (* n (* U -2.0)))) Om))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.8e+162) {
tmp = sqrt((((2.0 * n) * U) * (t + (((l * l) / Om) * -2.0))));
} else {
tmp = l * (sqrt(((n * (U - U_42_)) * (n * (U * -2.0)))) / 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.8d+162) then
tmp = sqrt((((2.0d0 * n) * u) * (t + (((l * l) / om) * (-2.0d0)))))
else
tmp = l * (sqrt(((n * (u - u_42)) * (n * (u * (-2.0d0))))) / 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.8e+162) {
tmp = Math.sqrt((((2.0 * n) * U) * (t + (((l * l) / Om) * -2.0))));
} else {
tmp = l * (Math.sqrt(((n * (U - U_42_)) * (n * (U * -2.0)))) / Om);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2.8e+162: tmp = math.sqrt((((2.0 * n) * U) * (t + (((l * l) / Om) * -2.0)))) else: tmp = l * (math.sqrt(((n * (U - U_42_)) * (n * (U * -2.0)))) / Om) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.8e+162) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)))); else tmp = Float64(l * Float64(sqrt(Float64(Float64(n * Float64(U - U_42_)) * Float64(n * Float64(U * -2.0)))) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2.8e+162) tmp = sqrt((((2.0 * n) * U) * (t + (((l * l) / Om) * -2.0)))); else tmp = l * (sqrt(((n * (U - U_42_)) * (n * (U * -2.0)))) / Om); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.8e+162], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l * N[(N[Sqrt[N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] * N[(n * N[(U * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.8 \cdot 10^{+162}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right)}\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \frac{\sqrt{\left(n \cdot \left(U - U*\right)\right) \cdot \left(n \cdot \left(U \cdot -2\right)\right)}}{Om}\\
\end{array}
\end{array}
if l < 2.79999999999999991e162Initial program 53.9%
Taylor expanded in Om around inf
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6448.4%
Simplified48.4%
if 2.79999999999999991e162 < l Initial program 16.3%
Taylor expanded in n around inf
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6440.1%
Simplified40.1%
sqrt-divN/A
sqrt-prodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6428.0%
Applied egg-rr28.0%
pow1/2N/A
unpow-prod-downN/A
associate-/l*N/A
pow1/2N/A
sqrt-prodN/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Applied egg-rr35.9%
Final simplification46.8%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 2.6e-91) (sqrt (* (* (* 2.0 n) U) t)) (sqrt (* (* 2.0 U) (* n (+ t (* (/ (* l l) Om) -2.0)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.6e-91) {
tmp = sqrt((((2.0 * n) * U) * t));
} else {
tmp = sqrt(((2.0 * U) * (n * (t + (((l * l) / Om) * -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 (l <= 2.6d-91) then
tmp = sqrt((((2.0d0 * n) * u) * t))
else
tmp = sqrt(((2.0d0 * u) * (n * (t + (((l * l) / om) * (-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 (l <= 2.6e-91) {
tmp = Math.sqrt((((2.0 * n) * U) * t));
} else {
tmp = Math.sqrt(((2.0 * U) * (n * (t + (((l * l) / Om) * -2.0)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2.6e-91: tmp = math.sqrt((((2.0 * n) * U) * t)) else: tmp = math.sqrt(((2.0 * U) * (n * (t + (((l * l) / Om) * -2.0))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.6e-91) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t)); else tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2.6e-91) tmp = sqrt((((2.0 * n) * U) * t)); else tmp = sqrt(((2.0 * U) * (n * (t + (((l * l) / Om) * -2.0))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.6e-91], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.6 \cdot 10^{-91}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot \left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right)\right)}\\
\end{array}
\end{array}
if l < 2.60000000000000014e-91Initial program 51.4%
Taylor expanded in t around inf
Simplified39.6%
if 2.60000000000000014e-91 < l Initial program 43.3%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6438.9%
Simplified38.9%
(FPCore (n U t l Om U*) :precision binary64 (pow (/ 1.0 (* (* n (* 2.0 U)) (+ t (/ (* l -2.0) (/ Om l))))) -0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))), -0.5);
}
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 = (1.0d0 / ((n * (2.0d0 * u)) * (t + ((l * (-2.0d0)) / (om / l))))) ** (-0.5d0)
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow((1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))), -0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow((1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))), -0.5)
function code(n, U, t, l, Om, U_42_) return Float64(1.0 / Float64(Float64(n * Float64(2.0 * U)) * Float64(t + Float64(Float64(l * -2.0) / Float64(Om / l))))) ^ -0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = (1.0 / ((n * (2.0 * U)) * (t + ((l * -2.0) / (Om / l))))) ^ -0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(1.0 / N[(N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l * -2.0), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{1}{\left(n \cdot \left(2 \cdot U\right)\right) \cdot \left(t + \frac{\ell \cdot -2}{\frac{Om}{\ell}}\right)}\right)}^{-0.5}
\end{array}
Initial program 49.0%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6452.6%
Applied egg-rr52.6%
Applied egg-rr58.5%
Taylor expanded in n around 0
*-lowering-*.f6454.2%
Simplified54.2%
Final simplification54.2%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 2.3e+67) (pow (* t (* n (* 2.0 U))) 0.5) (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 <= 2.3e+67) {
tmp = pow((t * (n * (2.0 * U))), 0.5);
} 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 <= 2.3d+67) then
tmp = (t * (n * (2.0d0 * u))) ** 0.5d0
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 <= 2.3e+67) {
tmp = Math.pow((t * (n * (2.0 * U))), 0.5);
} 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 <= 2.3e+67: tmp = math.pow((t * (n * (2.0 * U))), 0.5) 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 <= 2.3e+67) tmp = Float64(t * Float64(n * Float64(2.0 * U))) ^ 0.5; 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 <= 2.3e+67) tmp = (t * (n * (2.0 * U))) ^ 0.5; 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, 2.3e+67], N[Power[N[(t * N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $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 2.3 \cdot 10^{+67}:\\
\;\;\;\;{\left(t \cdot \left(n \cdot \left(2 \cdot U\right)\right)\right)}^{0.5}\\
\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 < 2.2999999999999999e67Initial program 52.9%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.7%
Simplified38.7%
pow1/2N/A
pow-lowering-pow.f64N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6441.7%
Applied egg-rr41.7%
if 2.2999999999999999e67 < l Initial program 33.1%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6424.1%
Simplified24.1%
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-*.f6420.1%
Simplified20.1%
Final simplification37.5%
(FPCore (n U t l Om U*) :precision binary64 (pow (/ 0.5 (* (* n U) (+ t (* (/ (* l l) Om) -2.0)))) -0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((0.5 / ((n * U) * (t + (((l * l) / Om) * -2.0)))), -0.5);
}
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 = (0.5d0 / ((n * u) * (t + (((l * l) / om) * (-2.0d0))))) ** (-0.5d0)
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow((0.5 / ((n * U) * (t + (((l * l) / Om) * -2.0)))), -0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow((0.5 / ((n * U) * (t + (((l * l) / Om) * -2.0)))), -0.5)
function code(n, U, t, l, Om, U_42_) return Float64(0.5 / Float64(Float64(n * U) * Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)))) ^ -0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = (0.5 / ((n * U) * (t + (((l * l) / Om) * -2.0)))) ^ -0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(0.5 / N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{0.5}{\left(n \cdot U\right) \cdot \left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right)}\right)}^{-0.5}
\end{array}
Initial program 49.0%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6452.6%
Applied egg-rr52.6%
Applied egg-rr58.5%
Taylor expanded in n around 0
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6451.8%
Simplified51.8%
Final simplification51.8%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (+ t (* (/ (* l l) Om) -2.0)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * (t + (((l * l) / Om) * -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((((2.0d0 * n) * u) * (t + (((l * l) / om) * (-2.0d0)))))
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 + (((l * l) / Om) * -2.0))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * (t + (((l * l) / Om) * -2.0))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * (t + (((l * l) / Om) * -2.0)))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right)}
\end{array}
Initial program 49.0%
Taylor expanded in Om around inf
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6444.3%
Simplified44.3%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 3.9e-28) (sqrt (* (* (* 2.0 n) U) t)) (pow (/ 0.5 (* U (* n t))) -0.5)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 3.9e-28) {
tmp = sqrt((((2.0 * n) * U) * t));
} else {
tmp = pow((0.5 / (U * (n * t))), -0.5);
}
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 <= 3.9d-28) then
tmp = sqrt((((2.0d0 * n) * u) * t))
else
tmp = (0.5d0 / (u * (n * t))) ** (-0.5d0)
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 <= 3.9e-28) {
tmp = Math.sqrt((((2.0 * n) * U) * t));
} else {
tmp = Math.pow((0.5 / (U * (n * t))), -0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 3.9e-28: tmp = math.sqrt((((2.0 * n) * U) * t)) else: tmp = math.pow((0.5 / (U * (n * t))), -0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 3.9e-28) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t)); else tmp = Float64(0.5 / Float64(U * Float64(n * t))) ^ -0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 3.9e-28) tmp = sqrt((((2.0 * n) * U) * t)); else tmp = (0.5 / (U * (n * t))) ^ -0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 3.9e-28], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[Power[N[(0.5 / N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3.9 \cdot 10^{-28}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{0.5}{U \cdot \left(n \cdot t\right)}\right)}^{-0.5}\\
\end{array}
\end{array}
if l < 3.89999999999999999e-28Initial program 52.4%
Taylor expanded in t around inf
Simplified39.5%
if 3.89999999999999999e-28 < l Initial program 38.3%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6441.9%
Applied egg-rr41.9%
Applied egg-rr60.1%
Taylor expanded in t around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6423.1%
Simplified23.1%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 2e-190) (sqrt (* (* (* 2.0 n) U) t)) (sqrt (* 2.0 (* n (* U t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2e-190) {
tmp = sqrt((((2.0 * n) * U) * t));
} else {
tmp = sqrt((2.0 * (n * (U * t))));
}
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-190) then
tmp = sqrt((((2.0d0 * n) * u) * t))
else
tmp = sqrt((2.0d0 * (n * (u * t))))
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-190) {
tmp = Math.sqrt((((2.0 * n) * U) * t));
} else {
tmp = Math.sqrt((2.0 * (n * (U * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2e-190: tmp = math.sqrt((((2.0 * n) * U) * t)) else: tmp = math.sqrt((2.0 * (n * (U * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2e-190) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t)); else tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2e-190) tmp = sqrt((((2.0 * n) * U) * t)); else tmp = sqrt((2.0 * (n * (U * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2e-190], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2 \cdot 10^{-190}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}\\
\end{array}
\end{array}
if l < 2e-190Initial program 49.9%
Taylor expanded in t around inf
Simplified38.0%
if 2e-190 < l Initial program 47.5%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6428.2%
Simplified28.2%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6428.2%
Applied egg-rr28.2%
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6431.2%
Applied egg-rr31.2%
Final simplification35.6%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 8e-190) (sqrt (* (* (* 2.0 n) U) t)) (sqrt (* n (* t (* 2.0 U))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 8e-190) {
tmp = sqrt((((2.0 * n) * U) * t));
} else {
tmp = sqrt((n * (t * (2.0 * U))));
}
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 <= 8d-190) then
tmp = sqrt((((2.0d0 * n) * u) * t))
else
tmp = sqrt((n * (t * (2.0d0 * u))))
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 <= 8e-190) {
tmp = Math.sqrt((((2.0 * n) * U) * t));
} else {
tmp = Math.sqrt((n * (t * (2.0 * U))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 8e-190: tmp = math.sqrt((((2.0 * n) * U) * t)) else: tmp = math.sqrt((n * (t * (2.0 * U)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 8e-190) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t)); else tmp = sqrt(Float64(n * Float64(t * Float64(2.0 * U)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 8e-190) tmp = sqrt((((2.0 * n) * U) * t)); else tmp = sqrt((n * (t * (2.0 * U)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 8e-190], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(n * N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 8 \cdot 10^{-190}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(t \cdot \left(2 \cdot U\right)\right)}\\
\end{array}
\end{array}
if l < 8.0000000000000002e-190Initial program 49.9%
Taylor expanded in t around inf
Simplified38.0%
if 8.0000000000000002e-190 < l Initial program 47.5%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6428.2%
Simplified28.2%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6431.2%
Applied egg-rr31.2%
Final simplification35.6%
(FPCore (n U t l Om U*) :precision binary64 (pow (* t (* n (* 2.0 U))) 0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((t * (n * (2.0 * U))), 0.5);
}
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 = (t * (n * (2.0d0 * u))) ** 0.5d0
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow((t * (n * (2.0 * U))), 0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow((t * (n * (2.0 * U))), 0.5)
function code(n, U, t, l, Om, U_42_) return Float64(t * Float64(n * Float64(2.0 * U))) ^ 0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = (t * (n * (2.0 * U))) ^ 0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(t * N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(t \cdot \left(n \cdot \left(2 \cdot U\right)\right)\right)}^{0.5}
\end{array}
Initial program 49.0%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.0%
Simplified34.0%
pow1/2N/A
pow-lowering-pow.f64N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6436.0%
Applied egg-rr36.0%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* n (* t (* 2.0 U)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((n * (t * (2.0 * U))));
}
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((n * (t * (2.0d0 * u))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((n * (t * (2.0 * U))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((n * (t * (2.0 * U))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(n * Float64(t * Float64(2.0 * U)))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((n * (t * (2.0 * U)))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(n * N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \left(t \cdot \left(2 \cdot U\right)\right)}
\end{array}
Initial program 49.0%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.0%
Simplified34.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.2%
Applied egg-rr35.2%
Final simplification35.2%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* U (* n t)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * (U * (n * t))));
}
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 * (u * (n * t))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((2.0 * (U * (n * t))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * (U * (n * t))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(U * Float64(n * t)))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * (U * (n * t)))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}
\end{array}
Initial program 49.0%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.0%
Simplified34.0%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6434.0%
Applied egg-rr34.0%
Final simplification34.0%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* 2.0 U) (* n t))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt(((2.0 * U) * (n * t)));
}
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 * u) * (n * t)))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt(((2.0 * U) * (n * t)));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt(((2.0 * U) * (n * t)))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(2.0 * U) * Float64(n * t))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt(((2.0 * U) * (n * t))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\right)}
\end{array}
Initial program 49.0%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.0%
Simplified34.0%
herbie shell --seed 2024192
(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*))))))