
(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 19 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}
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l Om) 2.0)) (- U* U)))
(t_2 (* (* 2.0 n) U))
(t_3 (sqrt (* t_2 (+ (- t (* 2.0 (/ (* l l) Om))) t_1)))))
(if (<= t_3 1e-156)
(*
(sqrt (* 2.0 n))
(sqrt
(*
U
(+
t
(+
(* l (* (/ l Om) -2.0))
(* (/ n Om) (/ (* (* l l) (- U* U)) Om)))))))
(if (<= t_3 5e+141)
(sqrt (* t_2 (+ (+ t (* 2.0 (/ -1.0 (/ Om (* l l))))) t_1)))
(*
(sqrt 2.0)
(* l (sqrt (* n (* U (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om)))))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (n * pow((l / Om), 2.0)) * (U_42_ - U);
double t_2 = (2.0 * n) * U;
double t_3 = sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1)));
double tmp;
if (t_3 <= 1e-156) {
tmp = sqrt((2.0 * n)) * sqrt((U * (t + ((l * ((l / Om) * -2.0)) + ((n / Om) * (((l * l) * (U_42_ - U)) / Om))))));
} else if (t_3 <= 5e+141) {
tmp = sqrt((t_2 * ((t + (2.0 * (-1.0 / (Om / (l * l))))) + t_1)));
} else {
tmp = sqrt(2.0) * (l * sqrt((n * (U * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))));
}
return tmp;
}
NOTE: l should be positive before calling this function
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) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = (n * ((l / om) ** 2.0d0)) * (u_42 - u)
t_2 = (2.0d0 * n) * u
t_3 = sqrt((t_2 * ((t - (2.0d0 * ((l * l) / om))) + t_1)))
if (t_3 <= 1d-156) then
tmp = sqrt((2.0d0 * n)) * sqrt((u * (t + ((l * ((l / om) * (-2.0d0))) + ((n / om) * (((l * l) * (u_42 - u)) / om))))))
else if (t_3 <= 5d+141) then
tmp = sqrt((t_2 * ((t + (2.0d0 * ((-1.0d0) / (om / (l * l))))) + t_1)))
else
tmp = sqrt(2.0d0) * (l * sqrt((n * (u * (((n / om) * (u_42 / om)) - (2.0d0 / om))))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (n * Math.pow((l / Om), 2.0)) * (U_42_ - U);
double t_2 = (2.0 * n) * U;
double t_3 = Math.sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1)));
double tmp;
if (t_3 <= 1e-156) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * (t + ((l * ((l / Om) * -2.0)) + ((n / Om) * (((l * l) * (U_42_ - U)) / Om))))));
} else if (t_3 <= 5e+141) {
tmp = Math.sqrt((t_2 * ((t + (2.0 * (-1.0 / (Om / (l * l))))) + t_1)));
} else {
tmp = Math.sqrt(2.0) * (l * Math.sqrt((n * (U * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = (n * math.pow((l / Om), 2.0)) * (U_42_ - U) t_2 = (2.0 * n) * U t_3 = math.sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1))) tmp = 0 if t_3 <= 1e-156: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * (t + ((l * ((l / Om) * -2.0)) + ((n / Om) * (((l * l) * (U_42_ - U)) / Om)))))) elif t_3 <= 5e+141: tmp = math.sqrt((t_2 * ((t + (2.0 * (-1.0 / (Om / (l * l))))) + t_1))) else: tmp = math.sqrt(2.0) * (l * math.sqrt((n * (U * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = Float64(Float64(2.0 * n) * U) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_1))) tmp = 0.0 if (t_3 <= 1e-156) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * Float64(t + Float64(Float64(l * Float64(Float64(l / Om) * -2.0)) + Float64(Float64(n / Om) * Float64(Float64(Float64(l * l) * Float64(U_42_ - U)) / Om))))))); elseif (t_3 <= 5e+141) tmp = sqrt(Float64(t_2 * Float64(Float64(t + Float64(2.0 * Float64(-1.0 / Float64(Om / Float64(l * l))))) + t_1))); else tmp = Float64(sqrt(2.0) * Float64(l * sqrt(Float64(n * Float64(U * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om))))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (n * ((l / Om) ^ 2.0)) * (U_42_ - U); t_2 = (2.0 * n) * U; t_3 = sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1))); tmp = 0.0; if (t_3 <= 1e-156) tmp = sqrt((2.0 * n)) * sqrt((U * (t + ((l * ((l / Om) * -2.0)) + ((n / Om) * (((l * l) * (U_42_ - U)) / Om)))))); elseif (t_3 <= 5e+141) tmp = sqrt((t_2 * ((t + (2.0 * (-1.0 / (Om / (l * l))))) + t_1))); else tmp = sqrt(2.0) * (l * sqrt((n * (U * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 1e-156], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t + N[(N[(l * N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision] + N[(N[(n / Om), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 5e+141], N[Sqrt[N[(t$95$2 * N[(N[(t + N[(2.0 * N[(-1.0 / N[(Om / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(l * N[Sqrt[N[(n * N[(U * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \left(2 \cdot n\right) \cdot U\\
t_3 := \sqrt{t_2 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t_1\right)}\\
\mathbf{if}\;t_3 \leq 10^{-156}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(t + \left(\ell \cdot \left(\frac{\ell}{Om} \cdot -2\right) + \frac{n}{Om} \cdot \frac{\left(\ell \cdot \ell\right) \cdot \left(U* - U\right)}{Om}\right)\right)}\\
\mathbf{elif}\;t_3 \leq 5 \cdot 10^{+141}:\\
\;\;\;\;\sqrt{t_2 \cdot \left(\left(t + 2 \cdot \frac{-1}{\frac{Om}{\ell \cdot \ell}}\right) + t_1\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(\ell \cdot \sqrt{n \cdot \left(U \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)}\right)\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 1.00000000000000004e-156Initial program 18.9%
Simplified18.9%
Taylor expanded in t around 0 34.1%
+-commutative34.1%
associate-*r*34.1%
associate-*r*34.1%
distribute-lft-out34.1%
Simplified35.1%
sqrt-prod55.1%
distribute-lft-out55.1%
*-commutative55.1%
Applied egg-rr55.1%
if 1.00000000000000004e-156 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 5.00000000000000025e141Initial program 96.5%
clear-num96.5%
inv-pow96.5%
Applied egg-rr96.5%
unpow-196.5%
Simplified96.5%
if 5.00000000000000025e141 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) Initial program 21.3%
Simplified29.0%
Taylor expanded in l around 0 32.3%
*-commutative32.3%
unpow232.3%
unpow232.3%
times-frac37.3%
associate-*r/37.3%
metadata-eval37.3%
Simplified37.3%
Taylor expanded in U around 0 32.7%
unpow232.7%
+-commutative32.7%
mul-1-neg32.7%
unsub-neg32.7%
associate-*r/32.7%
metadata-eval32.7%
unpow232.7%
times-frac37.4%
Simplified37.4%
Taylor expanded in l around inf 25.3%
associate-*l*25.3%
*-commutative25.3%
unpow225.3%
times-frac28.5%
associate-*r/28.5%
metadata-eval28.5%
Simplified28.5%
Final simplification56.7%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l Om) 2.0)) (- U* U)))
(t_2 (* (* 2.0 n) U))
(t_3 (* t_2 (+ (- t (* 2.0 (/ (* l l) Om))) t_1))))
(if (<= t_3 0.0)
(sqrt
(*
2.0
(*
U
(*
n
(+ (* (/ n Om) (/ (* (* l l) U*) Om)) (fma l (* (/ l Om) -2.0) t))))))
(if (<= t_3 1e+283)
(sqrt (* t_2 (+ (+ t (* 2.0 (/ -1.0 (/ Om (* l l))))) t_1)))
(*
(sqrt 2.0)
(* l (sqrt (* n (* U (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om)))))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (n * pow((l / Om), 2.0)) * (U_42_ - U);
double t_2 = (2.0 * n) * U;
double t_3 = t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1);
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((2.0 * (U * (n * (((n / Om) * (((l * l) * U_42_) / Om)) + fma(l, ((l / Om) * -2.0), t))))));
} else if (t_3 <= 1e+283) {
tmp = sqrt((t_2 * ((t + (2.0 * (-1.0 / (Om / (l * l))))) + t_1)));
} else {
tmp = sqrt(2.0) * (l * sqrt((n * (U * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = Float64(Float64(2.0 * n) * U) t_3 = Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_1)) tmp = 0.0 if (t_3 <= 0.0) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(Float64(Float64(n / Om) * Float64(Float64(Float64(l * l) * U_42_) / Om)) + fma(l, Float64(Float64(l / Om) * -2.0), t)))))); elseif (t_3 <= 1e+283) tmp = sqrt(Float64(t_2 * Float64(Float64(t + Float64(2.0 * Float64(-1.0 / Float64(Om / Float64(l * l))))) + t_1))); else tmp = Float64(sqrt(2.0) * Float64(l * sqrt(Float64(n * Float64(U * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om))))))); end return tmp end
NOTE: l should be positive before calling this function
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(N[(N[(n / Om), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] + N[(l * N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, 1e+283], N[Sqrt[N[(t$95$2 * N[(N[(t + N[(2.0 * N[(-1.0 / N[(Om / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(l * N[Sqrt[N[(n * N[(U * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \left(2 \cdot n\right) \cdot U\\
t_3 := t_2 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t_1\right)\\
\mathbf{if}\;t_3 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(\frac{n}{Om} \cdot \frac{\left(\ell \cdot \ell\right) \cdot U*}{Om} + \mathsf{fma}\left(\ell, \frac{\ell}{Om} \cdot -2, t\right)\right)\right)\right)}\\
\mathbf{elif}\;t_3 \leq 10^{+283}:\\
\;\;\;\;\sqrt{t_2 \cdot \left(\left(t + 2 \cdot \frac{-1}{\frac{Om}{\ell \cdot \ell}}\right) + t_1\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(\ell \cdot \sqrt{n \cdot \left(U \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < 0.0Initial program 12.7%
Simplified18.3%
Taylor expanded in U around 0 28.1%
associate-*r*34.2%
Simplified37.8%
if 0.0 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < 9.99999999999999955e282Initial program 95.8%
clear-num95.9%
inv-pow95.8%
Applied egg-rr95.8%
unpow-195.9%
Simplified95.9%
if 9.99999999999999955e282 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) Initial program 22.5%
Simplified29.0%
Taylor expanded in l around 0 31.7%
*-commutative31.7%
unpow231.7%
unpow231.7%
times-frac36.2%
associate-*r/36.2%
metadata-eval36.2%
Simplified36.2%
Taylor expanded in U around 0 32.1%
unpow232.1%
+-commutative32.1%
mul-1-neg32.1%
unsub-neg32.1%
associate-*r/32.1%
metadata-eval32.1%
unpow232.1%
times-frac36.3%
Simplified36.3%
Taylor expanded in l around inf 25.0%
associate-*l*25.1%
*-commutative25.1%
unpow225.1%
times-frac28.4%
associate-*r/28.4%
metadata-eval28.4%
Simplified28.4%
Final simplification55.0%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(*
(* (* 2.0 n) U)
(+
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U* U))))))
(if (<= t_1 0.0)
(sqrt
(*
2.0
(*
U
(*
n
(+ (* (/ n Om) (/ (* (* l l) U*) Om)) (fma l (* (/ l Om) -2.0) t))))))
(if (<= t_1 1e+283)
(sqrt t_1)
(*
(sqrt 2.0)
(* l (sqrt (* n (* U (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om)))))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + ((n * pow((l / Om), 2.0)) * (U_42_ - U)));
double tmp;
if (t_1 <= 0.0) {
tmp = sqrt((2.0 * (U * (n * (((n / Om) * (((l * l) * U_42_) / Om)) + fma(l, ((l / Om) * -2.0), t))))));
} else if (t_1 <= 1e+283) {
tmp = sqrt(t_1);
} else {
tmp = sqrt(2.0) * (l * sqrt((n * (U * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = 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_42_ - U)))) tmp = 0.0 if (t_1 <= 0.0) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(Float64(Float64(n / Om) * Float64(Float64(Float64(l * l) * U_42_) / Om)) + fma(l, Float64(Float64(l / Om) * -2.0), t)))))); elseif (t_1 <= 1e+283) tmp = sqrt(t_1); else tmp = Float64(sqrt(2.0) * Float64(l * sqrt(Float64(n * Float64(U * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om))))))); end return tmp end
NOTE: l should be positive before calling this function
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = 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$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(N[(N[(n / Om), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] + N[(l * N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$1, 1e+283], N[Sqrt[t$95$1], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(l * N[Sqrt[N[(n * N[(U * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := \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)\\
\mathbf{if}\;t_1 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(\frac{n}{Om} \cdot \frac{\left(\ell \cdot \ell\right) \cdot U*}{Om} + \mathsf{fma}\left(\ell, \frac{\ell}{Om} \cdot -2, t\right)\right)\right)\right)}\\
\mathbf{elif}\;t_1 \leq 10^{+283}:\\
\;\;\;\;\sqrt{t_1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(\ell \cdot \sqrt{n \cdot \left(U \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < 0.0Initial program 12.7%
Simplified18.3%
Taylor expanded in U around 0 28.1%
associate-*r*34.2%
Simplified37.8%
if 0.0 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < 9.99999999999999955e282Initial program 95.8%
if 9.99999999999999955e282 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) Initial program 22.5%
Simplified29.0%
Taylor expanded in l around 0 31.7%
*-commutative31.7%
unpow231.7%
unpow231.7%
times-frac36.2%
associate-*r/36.2%
metadata-eval36.2%
Simplified36.2%
Taylor expanded in U around 0 32.1%
unpow232.1%
+-commutative32.1%
mul-1-neg32.1%
unsub-neg32.1%
associate-*r/32.1%
metadata-eval32.1%
unpow232.1%
times-frac36.3%
Simplified36.3%
Taylor expanded in l around inf 25.0%
associate-*l*25.1%
*-commutative25.1%
unpow225.1%
times-frac28.4%
associate-*r/28.4%
metadata-eval28.4%
Simplified28.4%
Final simplification55.0%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* n U))))
(if (<= l 5e-108)
(sqrt (* t_1 (+ t (/ n (* (/ Om (* l U*)) (/ Om l))))))
(if (<= l 5.2e+168)
(pow
(* t_1 (+ t (* l (* l (- (/ (* n (/ U* Om)) Om) (/ 2.0 Om))))))
0.5)
(*
(sqrt 2.0)
(* l (sqrt (* n (* U (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om)))))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = 2.0 * (n * U);
double tmp;
if (l <= 5e-108) {
tmp = sqrt((t_1 * (t + (n / ((Om / (l * U_42_)) * (Om / l))))));
} else if (l <= 5.2e+168) {
tmp = pow((t_1 * (t + (l * (l * (((n * (U_42_ / Om)) / Om) - (2.0 / Om)))))), 0.5);
} else {
tmp = sqrt(2.0) * (l * sqrt((n * (U * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))));
}
return tmp;
}
NOTE: l should be positive before calling this function
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 = 2.0d0 * (n * u)
if (l <= 5d-108) then
tmp = sqrt((t_1 * (t + (n / ((om / (l * u_42)) * (om / l))))))
else if (l <= 5.2d+168) then
tmp = (t_1 * (t + (l * (l * (((n * (u_42 / om)) / om) - (2.0d0 / om)))))) ** 0.5d0
else
tmp = sqrt(2.0d0) * (l * sqrt((n * (u * (((n / om) * (u_42 / om)) - (2.0d0 / om))))))
end if
code = tmp
end function
l = Math.abs(l);
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 tmp;
if (l <= 5e-108) {
tmp = Math.sqrt((t_1 * (t + (n / ((Om / (l * U_42_)) * (Om / l))))));
} else if (l <= 5.2e+168) {
tmp = Math.pow((t_1 * (t + (l * (l * (((n * (U_42_ / Om)) / Om) - (2.0 / Om)))))), 0.5);
} else {
tmp = Math.sqrt(2.0) * (l * Math.sqrt((n * (U * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = 2.0 * (n * U) tmp = 0 if l <= 5e-108: tmp = math.sqrt((t_1 * (t + (n / ((Om / (l * U_42_)) * (Om / l)))))) elif l <= 5.2e+168: tmp = math.pow((t_1 * (t + (l * (l * (((n * (U_42_ / Om)) / Om) - (2.0 / Om)))))), 0.5) else: tmp = math.sqrt(2.0) * (l * math.sqrt((n * (U * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(2.0 * Float64(n * U)) tmp = 0.0 if (l <= 5e-108) tmp = sqrt(Float64(t_1 * Float64(t + Float64(n / Float64(Float64(Om / Float64(l * U_42_)) * Float64(Om / l)))))); elseif (l <= 5.2e+168) tmp = Float64(t_1 * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n * Float64(U_42_ / Om)) / Om) - Float64(2.0 / Om)))))) ^ 0.5; else tmp = Float64(sqrt(2.0) * Float64(l * sqrt(Float64(n * Float64(U * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om))))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = 2.0 * (n * U); tmp = 0.0; if (l <= 5e-108) tmp = sqrt((t_1 * (t + (n / ((Om / (l * U_42_)) * (Om / l)))))); elseif (l <= 5.2e+168) tmp = (t_1 * (t + (l * (l * (((n * (U_42_ / Om)) / Om) - (2.0 / Om)))))) ^ 0.5; else tmp = sqrt(2.0) * (l * sqrt((n * (U * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 5e-108], N[Sqrt[N[(t$95$1 * N[(t + N[(n / N[(N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision] * N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 5.2e+168], N[Power[N[(t$95$1 * N[(t + N[(l * N[(l * N[(N[(N[(n * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(l * N[Sqrt[N[(n * N[(U * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := 2 \cdot \left(n \cdot U\right)\\
\mathbf{if}\;\ell \leq 5 \cdot 10^{-108}:\\
\;\;\;\;\sqrt{t_1 \cdot \left(t + \frac{n}{\frac{Om}{\ell \cdot U*} \cdot \frac{Om}{\ell}}\right)}\\
\mathbf{elif}\;\ell \leq 5.2 \cdot 10^{+168}:\\
\;\;\;\;{\left(t_1 \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{n \cdot \frac{U*}{Om}}{Om} - \frac{2}{Om}\right)\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(\ell \cdot \sqrt{n \cdot \left(U \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)}\right)\\
\end{array}
\end{array}
if l < 5e-108Initial program 54.0%
Simplified53.2%
Taylor expanded in l around 0 46.3%
*-commutative46.3%
unpow246.3%
unpow246.3%
times-frac50.0%
associate-*r/50.0%
metadata-eval50.0%
Simplified50.0%
Taylor expanded in U around 0 47.2%
unpow247.2%
+-commutative47.2%
mul-1-neg47.2%
unsub-neg47.2%
associate-*r/47.2%
metadata-eval47.2%
unpow247.2%
times-frac54.2%
Simplified54.2%
Taylor expanded in Om around 0 45.9%
mul-1-neg45.9%
unpow245.9%
associate-*r*47.7%
associate-/l*48.3%
distribute-neg-frac48.3%
unpow248.3%
*-commutative48.3%
times-frac57.2%
Simplified57.2%
if 5e-108 < l < 5.2e168Initial program 48.4%
Simplified48.1%
Taylor expanded in l around 0 48.3%
*-commutative48.3%
unpow248.3%
unpow248.3%
times-frac58.7%
associate-*r/58.7%
metadata-eval58.7%
Simplified58.7%
Taylor expanded in U around 0 48.4%
unpow248.4%
+-commutative48.4%
mul-1-neg48.4%
unsub-neg48.4%
associate-*r/48.4%
metadata-eval48.4%
unpow248.4%
times-frac59.5%
Simplified59.5%
pow1/259.6%
associate-*l*63.1%
associate-*l/63.2%
Applied egg-rr63.2%
if 5.2e168 < l Initial program 15.5%
Simplified33.1%
Taylor expanded in l around 0 37.3%
*-commutative37.3%
unpow237.3%
unpow237.3%
times-frac44.4%
associate-*r/44.4%
metadata-eval44.4%
Simplified44.4%
Taylor expanded in U around 0 37.3%
unpow237.3%
+-commutative37.3%
mul-1-neg37.3%
unsub-neg37.3%
associate-*r/37.3%
metadata-eval37.3%
unpow237.3%
times-frac44.4%
Simplified44.4%
Taylor expanded in l around inf 64.4%
associate-*l*64.5%
*-commutative64.5%
unpow264.5%
times-frac75.3%
associate-*r/75.3%
metadata-eval75.3%
Simplified75.3%
Final simplification60.5%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* n U))))
(if (<= l 1.1e-107)
(sqrt (* t_1 (+ t (/ n (* (/ Om (* l U*)) (/ Om l))))))
(pow
(* t_1 (+ t (* l (* l (- (/ (* n (/ U* Om)) Om) (/ 2.0 Om))))))
0.5))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = 2.0 * (n * U);
double tmp;
if (l <= 1.1e-107) {
tmp = sqrt((t_1 * (t + (n / ((Om / (l * U_42_)) * (Om / l))))));
} else {
tmp = pow((t_1 * (t + (l * (l * (((n * (U_42_ / Om)) / Om) - (2.0 / Om)))))), 0.5);
}
return tmp;
}
NOTE: l should be positive before calling this function
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 = 2.0d0 * (n * u)
if (l <= 1.1d-107) then
tmp = sqrt((t_1 * (t + (n / ((om / (l * u_42)) * (om / l))))))
else
tmp = (t_1 * (t + (l * (l * (((n * (u_42 / om)) / om) - (2.0d0 / om)))))) ** 0.5d0
end if
code = tmp
end function
l = Math.abs(l);
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 tmp;
if (l <= 1.1e-107) {
tmp = Math.sqrt((t_1 * (t + (n / ((Om / (l * U_42_)) * (Om / l))))));
} else {
tmp = Math.pow((t_1 * (t + (l * (l * (((n * (U_42_ / Om)) / Om) - (2.0 / Om)))))), 0.5);
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = 2.0 * (n * U) tmp = 0 if l <= 1.1e-107: tmp = math.sqrt((t_1 * (t + (n / ((Om / (l * U_42_)) * (Om / l)))))) else: tmp = math.pow((t_1 * (t + (l * (l * (((n * (U_42_ / Om)) / Om) - (2.0 / Om)))))), 0.5) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(2.0 * Float64(n * U)) tmp = 0.0 if (l <= 1.1e-107) tmp = sqrt(Float64(t_1 * Float64(t + Float64(n / Float64(Float64(Om / Float64(l * U_42_)) * Float64(Om / l)))))); else tmp = Float64(t_1 * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n * Float64(U_42_ / Om)) / Om) - Float64(2.0 / Om)))))) ^ 0.5; end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = 2.0 * (n * U); tmp = 0.0; if (l <= 1.1e-107) tmp = sqrt((t_1 * (t + (n / ((Om / (l * U_42_)) * (Om / l)))))); else tmp = (t_1 * (t + (l * (l * (((n * (U_42_ / Om)) / Om) - (2.0 / Om)))))) ^ 0.5; end tmp_2 = tmp; end
NOTE: l should be positive before calling this function
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 1.1e-107], N[Sqrt[N[(t$95$1 * N[(t + N[(n / N[(N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision] * N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(t$95$1 * N[(t + N[(l * N[(l * N[(N[(N[(n * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := 2 \cdot \left(n \cdot U\right)\\
\mathbf{if}\;\ell \leq 1.1 \cdot 10^{-107}:\\
\;\;\;\;\sqrt{t_1 \cdot \left(t + \frac{n}{\frac{Om}{\ell \cdot U*} \cdot \frac{Om}{\ell}}\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(t_1 \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{n \cdot \frac{U*}{Om}}{Om} - \frac{2}{Om}\right)\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 1.10000000000000006e-107Initial program 54.0%
Simplified53.2%
Taylor expanded in l around 0 46.3%
*-commutative46.3%
unpow246.3%
unpow246.3%
times-frac50.0%
associate-*r/50.0%
metadata-eval50.0%
Simplified50.0%
Taylor expanded in U around 0 47.2%
unpow247.2%
+-commutative47.2%
mul-1-neg47.2%
unsub-neg47.2%
associate-*r/47.2%
metadata-eval47.2%
unpow247.2%
times-frac54.2%
Simplified54.2%
Taylor expanded in Om around 0 45.9%
mul-1-neg45.9%
unpow245.9%
associate-*r*47.7%
associate-/l*48.3%
distribute-neg-frac48.3%
unpow248.3%
*-commutative48.3%
times-frac57.2%
Simplified57.2%
if 1.10000000000000006e-107 < l Initial program 37.2%
Simplified43.0%
Taylor expanded in l around 0 44.5%
*-commutative44.5%
unpow244.5%
unpow244.5%
times-frac53.8%
associate-*r/53.8%
metadata-eval53.8%
Simplified53.8%
Taylor expanded in U around 0 44.6%
unpow244.6%
+-commutative44.6%
mul-1-neg44.6%
unsub-neg44.6%
associate-*r/44.6%
metadata-eval44.6%
unpow244.6%
times-frac54.4%
Simplified54.4%
pow1/254.5%
associate-*l*60.3%
associate-*l/60.3%
Applied egg-rr60.3%
Final simplification58.2%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1e-105)
(sqrt (* (* 2.0 (* n U)) (+ t (/ n (* (/ Om (* l U*)) (/ Om l))))))
(if (<= l 1e+129)
(sqrt
(* (* n U) (* 2.0 (+ t (* (* l l) (/ (- (* U* (/ n Om)) 2.0) Om))))))
(pow (* 2.0 (* (* n U) (+ t (* -2.0 (/ l (/ Om l)))))) 0.5))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1e-105) {
tmp = sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (l * U_42_)) * (Om / l))))));
} else if (l <= 1e+129) {
tmp = sqrt(((n * U) * (2.0 * (t + ((l * l) * (((U_42_ * (n / Om)) - 2.0) / Om))))));
} else {
tmp = pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5);
}
return tmp;
}
NOTE: l should be positive before calling this function
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 <= 1d-105) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (n / ((om / (l * u_42)) * (om / l))))))
else if (l <= 1d+129) then
tmp = sqrt(((n * u) * (2.0d0 * (t + ((l * l) * (((u_42 * (n / om)) - 2.0d0) / om))))))
else
tmp = (2.0d0 * ((n * u) * (t + ((-2.0d0) * (l / (om / l)))))) ** 0.5d0
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1e-105) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (l * U_42_)) * (Om / l))))));
} else if (l <= 1e+129) {
tmp = Math.sqrt(((n * U) * (2.0 * (t + ((l * l) * (((U_42_ * (n / Om)) - 2.0) / Om))))));
} else {
tmp = Math.pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5);
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1e-105: tmp = math.sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (l * U_42_)) * (Om / l)))))) elif l <= 1e+129: tmp = math.sqrt(((n * U) * (2.0 * (t + ((l * l) * (((U_42_ * (n / Om)) - 2.0) / Om)))))) else: tmp = math.pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1e-105) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(n / Float64(Float64(Om / Float64(l * U_42_)) * Float64(Om / l)))))); elseif (l <= 1e+129) tmp = sqrt(Float64(Float64(n * U) * Float64(2.0 * Float64(t + Float64(Float64(l * l) * Float64(Float64(Float64(U_42_ * Float64(n / Om)) - 2.0) / Om)))))); else tmp = Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))))) ^ 0.5; end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1e-105) tmp = sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (l * U_42_)) * (Om / l)))))); elseif (l <= 1e+129) tmp = sqrt(((n * U) * (2.0 * (t + ((l * l) * (((U_42_ * (n / Om)) - 2.0) / Om)))))); else tmp = (2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))) ^ 0.5; end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1e-105], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(n / N[(N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision] * N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1e+129], N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(2.0 * N[(t + N[(N[(l * l), $MachinePrecision] * N[(N[(N[(U$42$ * N[(n / Om), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 10^{-105}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \frac{n}{\frac{Om}{\ell \cdot U*} \cdot \frac{Om}{\ell}}\right)}\\
\mathbf{elif}\;\ell \leq 10^{+129}:\\
\;\;\;\;\sqrt{\left(n \cdot U\right) \cdot \left(2 \cdot \left(t + \left(\ell \cdot \ell\right) \cdot \frac{U* \cdot \frac{n}{Om} - 2}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 9.99999999999999965e-106Initial program 54.3%
Simplified53.4%
Taylor expanded in l around 0 46.1%
*-commutative46.1%
unpow246.1%
unpow246.1%
times-frac50.3%
associate-*r/50.3%
metadata-eval50.3%
Simplified50.3%
Taylor expanded in U around 0 46.9%
unpow246.9%
+-commutative46.9%
mul-1-neg46.9%
unsub-neg46.9%
associate-*r/46.9%
metadata-eval46.9%
unpow246.9%
times-frac54.2%
Simplified54.2%
Taylor expanded in Om around 0 45.6%
mul-1-neg45.6%
unpow245.6%
associate-*r*47.4%
associate-/l*48.1%
distribute-neg-frac48.1%
unpow248.1%
*-commutative48.1%
times-frac57.2%
Simplified57.2%
if 9.99999999999999965e-106 < l < 1e129Initial program 48.2%
Simplified43.7%
Taylor expanded in l around 0 49.9%
*-commutative49.9%
unpow249.9%
unpow249.9%
times-frac59.6%
associate-*r/59.6%
metadata-eval59.6%
Simplified59.6%
Taylor expanded in U around 0 50.0%
unpow250.0%
+-commutative50.0%
mul-1-neg50.0%
unsub-neg50.0%
associate-*r/50.0%
metadata-eval50.0%
unpow250.0%
times-frac61.4%
Simplified61.4%
pow1/261.4%
associate-*l*61.4%
associate-*l/61.4%
Applied egg-rr61.4%
*-un-lft-identity61.4%
unpow1/261.4%
associate-*l*61.4%
sub-div61.4%
Applied egg-rr61.4%
Simplified61.4%
if 1e129 < l Initial program 19.4%
Simplified40.2%
Taylor expanded in l around 0 38.0%
*-commutative38.0%
unpow238.0%
unpow238.0%
times-frac44.0%
associate-*r/44.0%
metadata-eval44.0%
Simplified44.0%
Taylor expanded in U around 0 38.0%
unpow238.0%
+-commutative38.0%
mul-1-neg38.0%
unsub-neg38.0%
associate-*r/38.0%
metadata-eval38.0%
unpow238.0%
times-frac44.0%
Simplified44.0%
pow1/244.3%
associate-*l*58.9%
associate-*l/58.9%
Applied egg-rr58.9%
Taylor expanded in n around 0 48.4%
*-commutative48.4%
associate-*r*44.3%
sub-neg44.3%
*-commutative44.3%
distribute-rgt-neg-in44.3%
unpow244.3%
associate-/l*58.9%
metadata-eval58.9%
Simplified58.9%
Final simplification58.2%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= l 2.55e+42) (sqrt (* (* 2.0 (* n U)) (+ t (* (/ n Om) (/ (* l (* l U*)) Om))))) (pow (* 2.0 (* (* n U) (+ t (* -2.0 (/ l (/ Om l)))))) 0.5)))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.55e+42) {
tmp = sqrt(((2.0 * (n * U)) * (t + ((n / Om) * ((l * (l * U_42_)) / Om)))));
} else {
tmp = pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5);
}
return tmp;
}
NOTE: l should be positive before calling this function
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.55d+42) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + ((n / om) * ((l * (l * u_42)) / om)))))
else
tmp = (2.0d0 * ((n * u) * (t + ((-2.0d0) * (l / (om / l)))))) ** 0.5d0
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.55e+42) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + ((n / Om) * ((l * (l * U_42_)) / Om)))));
} else {
tmp = Math.pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5);
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2.55e+42: tmp = math.sqrt(((2.0 * (n * U)) * (t + ((n / Om) * ((l * (l * U_42_)) / Om))))) else: tmp = math.pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.55e+42) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(n / Om) * Float64(Float64(l * Float64(l * U_42_)) / Om))))); else tmp = Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))))) ^ 0.5; end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2.55e+42) tmp = sqrt(((2.0 * (n * U)) * (t + ((n / Om) * ((l * (l * U_42_)) / Om))))); else tmp = (2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))) ^ 0.5; end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.55e+42], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(n / Om), $MachinePrecision] * N[(N[(l * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.55 \cdot 10^{+42}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \frac{n}{Om} \cdot \frac{\ell \cdot \left(\ell \cdot U*\right)}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 2.55e42Initial program 54.1%
Simplified52.9%
Taylor expanded in l around 0 47.1%
*-commutative47.1%
unpow247.1%
unpow247.1%
times-frac52.4%
associate-*r/52.4%
metadata-eval52.4%
Simplified52.4%
Taylor expanded in U* around inf 46.2%
mul-1-neg46.2%
*-commutative46.2%
unpow246.2%
unpow246.2%
times-frac53.0%
distribute-rgt-neg-in53.0%
associate-*l*55.3%
distribute-neg-frac55.3%
Simplified55.3%
if 2.55e42 < l Initial program 25.5%
Simplified37.4%
Taylor expanded in l around 0 40.2%
*-commutative40.2%
unpow240.2%
unpow240.2%
times-frac46.3%
associate-*r/46.3%
metadata-eval46.3%
Simplified46.3%
Taylor expanded in U around 0 40.2%
unpow240.2%
+-commutative40.2%
mul-1-neg40.2%
unsub-neg40.2%
associate-*r/40.2%
metadata-eval40.2%
unpow240.2%
times-frac46.3%
Simplified46.3%
pow1/246.4%
associate-*l*56.3%
associate-*l/56.3%
Applied egg-rr56.3%
Taylor expanded in n around 0 43.6%
*-commutative43.6%
associate-*r*46.3%
sub-neg46.3%
*-commutative46.3%
distribute-rgt-neg-in46.3%
unpow246.3%
associate-/l*56.2%
metadata-eval56.2%
Simplified56.2%
Final simplification55.5%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.65e+41) (sqrt (* (* 2.0 (* n U)) (+ t (/ n (* (/ Om (* l U*)) (/ Om l)))))) (pow (* 2.0 (* (* n U) (+ t (* -2.0 (/ l (/ Om l)))))) 0.5)))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.65e+41) {
tmp = sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (l * U_42_)) * (Om / l))))));
} else {
tmp = pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5);
}
return tmp;
}
NOTE: l should be positive before calling this function
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 <= 1.65d+41) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (n / ((om / (l * u_42)) * (om / l))))))
else
tmp = (2.0d0 * ((n * u) * (t + ((-2.0d0) * (l / (om / l)))))) ** 0.5d0
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.65e+41) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (l * U_42_)) * (Om / l))))));
} else {
tmp = Math.pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5);
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.65e+41: tmp = math.sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (l * U_42_)) * (Om / l)))))) else: tmp = math.pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.65e+41) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(n / Float64(Float64(Om / Float64(l * U_42_)) * Float64(Om / l)))))); else tmp = Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))))) ^ 0.5; end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.65e+41) tmp = sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (l * U_42_)) * (Om / l)))))); else tmp = (2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))) ^ 0.5; end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.65e+41], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(n / N[(N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision] * N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.65 \cdot 10^{+41}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \frac{n}{\frac{Om}{\ell \cdot U*} \cdot \frac{Om}{\ell}}\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 1.65e41Initial program 54.4%
Simplified53.1%
Taylor expanded in l around 0 47.3%
*-commutative47.3%
unpow247.3%
unpow247.3%
times-frac52.2%
associate-*r/52.2%
metadata-eval52.2%
Simplified52.2%
Taylor expanded in U around 0 48.0%
unpow248.0%
+-commutative48.0%
mul-1-neg48.0%
unsub-neg48.0%
associate-*r/48.0%
metadata-eval48.0%
unpow248.0%
times-frac56.0%
Simplified56.0%
Taylor expanded in Om around 0 46.4%
mul-1-neg46.4%
unpow246.4%
associate-*r*47.9%
associate-/l*48.0%
distribute-neg-frac48.0%
unpow248.0%
*-commutative48.0%
times-frac56.7%
Simplified56.7%
if 1.65e41 < l Initial program 25.0%
Simplified36.7%
Taylor expanded in l around 0 39.4%
*-commutative39.4%
unpow239.4%
unpow239.4%
times-frac47.3%
associate-*r/47.3%
metadata-eval47.3%
Simplified47.3%
Taylor expanded in U around 0 39.4%
unpow239.4%
+-commutative39.4%
mul-1-neg39.4%
unsub-neg39.4%
associate-*r/39.4%
metadata-eval39.4%
unpow239.4%
times-frac47.3%
Simplified47.3%
pow1/247.5%
associate-*l*57.1%
associate-*l/57.1%
Applied egg-rr57.1%
Taylor expanded in n around 0 42.8%
*-commutative42.8%
associate-*r*45.4%
sub-neg45.4%
*-commutative45.4%
distribute-rgt-neg-in45.4%
unpow245.4%
associate-/l*55.0%
metadata-eval55.0%
Simplified55.0%
Final simplification56.4%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (or (<= Om -6e+75) (not (<= Om 4.1e+207))) (sqrt (* (* 2.0 (* n U)) (- t (* 2.0 (* l (/ l Om)))))) (pow (* 2.0 (* n (* U (+ t (* (/ (* l l) Om) -2.0))))) 0.5)))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((Om <= -6e+75) || !(Om <= 4.1e+207)) {
tmp = sqrt(((2.0 * (n * U)) * (t - (2.0 * (l * (l / Om))))));
} else {
tmp = pow((2.0 * (n * (U * (t + (((l * l) / Om) * -2.0))))), 0.5);
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if ((om <= (-6d+75)) .or. (.not. (om <= 4.1d+207))) then
tmp = sqrt(((2.0d0 * (n * u)) * (t - (2.0d0 * (l * (l / om))))))
else
tmp = (2.0d0 * (n * (u * (t + (((l * l) / om) * (-2.0d0)))))) ** 0.5d0
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((Om <= -6e+75) || !(Om <= 4.1e+207)) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t - (2.0 * (l * (l / Om))))));
} else {
tmp = Math.pow((2.0 * (n * (U * (t + (((l * l) / Om) * -2.0))))), 0.5);
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if (Om <= -6e+75) or not (Om <= 4.1e+207): tmp = math.sqrt(((2.0 * (n * U)) * (t - (2.0 * (l * (l / Om)))))) else: tmp = math.pow((2.0 * (n * (U * (t + (((l * l) / Om) * -2.0))))), 0.5) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((Om <= -6e+75) || !(Om <= 4.1e+207)) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(2.0 * Float64(l * Float64(l / Om)))))); else tmp = Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0))))) ^ 0.5; end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if ((Om <= -6e+75) || ~((Om <= 4.1e+207))) tmp = sqrt(((2.0 * (n * U)) * (t - (2.0 * (l * (l / Om)))))); else tmp = (2.0 * (n * (U * (t + (((l * l) / Om) * -2.0))))) ^ 0.5; end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[Om, -6e+75], N[Not[LessEqual[Om, 4.1e+207]], $MachinePrecision]], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -6 \cdot 10^{+75} \lor \neg \left(Om \leq 4.1 \cdot 10^{+207}\right):\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot \left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right)\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if Om < -6e75 or 4.1e207 < Om Initial program 53.9%
Simplified62.5%
Taylor expanded in Om around inf 52.8%
unpow252.8%
associate-*r/64.7%
Simplified64.7%
if -6e75 < Om < 4.1e207Initial program 46.5%
Simplified44.8%
Taylor expanded in l around 0 44.8%
*-commutative44.8%
unpow244.8%
unpow244.8%
times-frac47.6%
associate-*r/47.6%
metadata-eval47.6%
Simplified47.6%
Taylor expanded in U around 0 45.5%
unpow245.5%
+-commutative45.5%
mul-1-neg45.5%
unsub-neg45.5%
associate-*r/45.5%
metadata-eval45.5%
unpow245.5%
times-frac52.2%
Simplified52.2%
pow1/252.2%
associate-*l*53.1%
associate-*l/52.1%
Applied egg-rr52.1%
Taylor expanded in n around 0 48.4%
*-commutative48.4%
cancel-sign-sub-inv48.4%
metadata-eval48.4%
unpow248.4%
Simplified48.4%
Final simplification53.1%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= t -7.2e+121) (pow (* 2.0 (* U (* n t))) 0.5) (sqrt (* (* 2.0 (* n U)) (- t (* 2.0 (* l (/ l Om))))))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= -7.2e+121) {
tmp = pow((2.0 * (U * (n * t))), 0.5);
} else {
tmp = sqrt(((2.0 * (n * U)) * (t - (2.0 * (l * (l / Om))))));
}
return tmp;
}
NOTE: l should be positive before calling this function
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 (t <= (-7.2d+121)) then
tmp = (2.0d0 * (u * (n * t))) ** 0.5d0
else
tmp = sqrt(((2.0d0 * (n * u)) * (t - (2.0d0 * (l * (l / om))))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= -7.2e+121) {
tmp = Math.pow((2.0 * (U * (n * t))), 0.5);
} else {
tmp = Math.sqrt(((2.0 * (n * U)) * (t - (2.0 * (l * (l / Om))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= -7.2e+121: tmp = math.pow((2.0 * (U * (n * t))), 0.5) else: tmp = math.sqrt(((2.0 * (n * U)) * (t - (2.0 * (l * (l / Om)))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= -7.2e+121) tmp = Float64(2.0 * Float64(U * Float64(n * t))) ^ 0.5; else tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(2.0 * Float64(l * Float64(l / Om)))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= -7.2e+121) tmp = (2.0 * (U * (n * t))) ^ 0.5; else tmp = sqrt(((2.0 * (n * U)) * (t - (2.0 * (l * (l / Om)))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, -7.2e+121], N[Power[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -7.2 \cdot 10^{+121}:\\
\;\;\;\;{\left(2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)}\\
\end{array}
\end{array}
if t < -7.19999999999999963e121Initial program 34.9%
Simplified34.6%
Taylor expanded in t around inf 39.5%
pow1/242.8%
associate-*r*59.0%
Applied egg-rr59.0%
if -7.19999999999999963e121 < t Initial program 50.5%
Simplified52.0%
Taylor expanded in Om around inf 42.6%
unpow242.6%
associate-*r/45.6%
Simplified45.6%
Final simplification47.2%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (pow (* 2.0 (* (* n U) (+ t (* -2.0 (/ l (/ Om l)))))) 0.5))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5);
}
NOTE: l should be positive before calling this function
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 = (2.0d0 * ((n * u) * (t + ((-2.0d0) * (l / (om / l)))))) ** 0.5d0
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5);
}
l = abs(l) def code(n, U, t, l, Om, U_42_): return math.pow((2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))), 0.5)
l = abs(l) function code(n, U, t, l, Om, U_42_) return Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))))) ^ 0.5 end
l = abs(l) function tmp = code(n, U, t, l, Om, U_42_) tmp = (2.0 * ((n * U) * (t + (-2.0 * (l / (Om / l)))))) ^ 0.5; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
l = |l|\\
\\
{\left(2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right)\right)\right)}^{0.5}
\end{array}
Initial program 48.6%
Simplified49.9%
Taylor expanded in l around 0 45.7%
*-commutative45.7%
unpow245.7%
unpow245.7%
times-frac51.2%
associate-*r/51.2%
metadata-eval51.2%
Simplified51.2%
Taylor expanded in U around 0 46.4%
unpow246.4%
+-commutative46.4%
mul-1-neg46.4%
unsub-neg46.4%
associate-*r/46.4%
metadata-eval46.4%
unpow246.4%
times-frac54.3%
Simplified54.3%
pow1/254.3%
associate-*l*58.3%
associate-*l/57.6%
Applied egg-rr57.6%
Taylor expanded in n around 0 46.8%
*-commutative46.8%
associate-*r*50.4%
sub-neg50.4%
*-commutative50.4%
distribute-rgt-neg-in50.4%
unpow250.4%
associate-/l*53.8%
metadata-eval53.8%
Simplified53.8%
Final simplification53.8%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= l 4e+75) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (* (* 2.0 n) (* U (* (* l l) (/ -2.0 Om)))))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4e+75) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt(((2.0 * n) * (U * ((l * l) * (-2.0 / Om)))));
}
return tmp;
}
NOTE: l should be positive before calling this function
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 <= 4d+75) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt(((2.0d0 * n) * (u * ((l * l) * ((-2.0d0) / om)))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4e+75) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt(((2.0 * n) * (U * ((l * l) * (-2.0 / Om)))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 4e+75: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt(((2.0 * n) * (U * ((l * l) * (-2.0 / Om))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 4e+75) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(Float64(l * l) * Float64(-2.0 / Om))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 4e+75) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt(((2.0 * n) * (U * ((l * l) * (-2.0 / Om))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 4e+75], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(N[(l * l), $MachinePrecision] * N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 4 \cdot 10^{+75}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \frac{-2}{Om}\right)\right)}\\
\end{array}
\end{array}
if l < 3.99999999999999971e75Initial program 53.3%
Simplified53.4%
Taylor expanded in t around inf 40.3%
pow1/241.8%
associate-*l*41.8%
Applied egg-rr41.8%
if 3.99999999999999971e75 < l Initial program 26.0%
Simplified26.0%
Taylor expanded in t around 0 19.6%
associate-*r*19.6%
*-commutative19.6%
unpow219.6%
associate-*r/19.6%
*-commutative19.6%
associate-*l*19.6%
unpow219.6%
times-frac24.2%
Simplified24.2%
Taylor expanded in Om around inf 22.2%
metadata-eval22.2%
distribute-lft-neg-in22.2%
associate-*r/22.2%
associate-*l/22.2%
metadata-eval22.2%
associate-*r/22.2%
*-commutative22.2%
distribute-rgt-neg-in22.2%
unpow222.2%
associate-*r/22.2%
metadata-eval22.2%
distribute-neg-frac22.2%
metadata-eval22.2%
Simplified22.2%
Final simplification38.4%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.4e+76) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (* (* 2.0 n) (* U (* (/ (* l l) Om) -2.0))))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.4e+76) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt(((2.0 * n) * (U * (((l * l) / Om) * -2.0))));
}
return tmp;
}
NOTE: l should be positive before calling this function
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 <= 1.4d+76) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt(((2.0d0 * n) * (u * (((l * l) / om) * (-2.0d0)))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.4e+76) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt(((2.0 * n) * (U * (((l * l) / Om) * -2.0))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.4e+76: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt(((2.0 * n) * (U * (((l * l) / Om) * -2.0)))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.4e+76) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(Float64(Float64(l * l) / Om) * -2.0)))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.4e+76) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt(((2.0 * n) * (U * (((l * l) / Om) * -2.0)))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.4e+76], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.4 \cdot 10^{+76}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(\frac{\ell \cdot \ell}{Om} \cdot -2\right)\right)}\\
\end{array}
\end{array}
if l < 1.3999999999999999e76Initial program 53.3%
Simplified53.4%
Taylor expanded in t around inf 40.3%
pow1/241.8%
associate-*l*41.8%
Applied egg-rr41.8%
if 1.3999999999999999e76 < l Initial program 26.0%
Simplified26.0%
Taylor expanded in t around 0 19.6%
associate-*r*19.6%
*-commutative19.6%
unpow219.6%
associate-*r/19.6%
*-commutative19.6%
associate-*l*19.6%
unpow219.6%
times-frac24.2%
Simplified24.2%
Taylor expanded in Om around inf 22.2%
*-commutative22.2%
unpow222.2%
Simplified22.2%
Final simplification38.4%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= l 4e+77) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (* (* 2.0 n) (/ (* -2.0 (* U (* l l))) Om)))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4e+77) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt(((2.0 * n) * ((-2.0 * (U * (l * l))) / Om)));
}
return tmp;
}
NOTE: l should be positive before calling this function
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 <= 4d+77) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt(((2.0d0 * n) * (((-2.0d0) * (u * (l * l))) / om)))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4e+77) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt(((2.0 * n) * ((-2.0 * (U * (l * l))) / Om)));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 4e+77: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt(((2.0 * n) * ((-2.0 * (U * (l * l))) / Om))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 4e+77) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(Float64(-2.0 * Float64(U * Float64(l * l))) / Om))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 4e+77) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt(((2.0 * n) * ((-2.0 * (U * (l * l))) / Om))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 4e+77], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(N[(-2.0 * N[(U * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 4 \cdot 10^{+77}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \frac{-2 \cdot \left(U \cdot \left(\ell \cdot \ell\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 3.99999999999999993e77Initial program 53.3%
Simplified53.4%
Taylor expanded in t around inf 40.3%
pow1/241.8%
associate-*l*41.8%
Applied egg-rr41.8%
if 3.99999999999999993e77 < l Initial program 26.0%
Simplified26.0%
Taylor expanded in t around 0 19.6%
associate-*r*19.6%
*-commutative19.6%
unpow219.6%
associate-*r/19.6%
*-commutative19.6%
associate-*l*19.6%
unpow219.6%
times-frac24.2%
Simplified24.2%
Taylor expanded in Om around inf 24.4%
associate-*r/24.4%
*-commutative24.4%
unpow224.4%
Simplified24.4%
Final simplification38.8%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= t -8.5e+140) (pow (* 2.0 (* U (* n t))) 0.5) (pow (* 2.0 (* t (* n U))) 0.5)))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= -8.5e+140) {
tmp = pow((2.0 * (U * (n * t))), 0.5);
} else {
tmp = pow((2.0 * (t * (n * U))), 0.5);
}
return tmp;
}
NOTE: l should be positive before calling this function
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 (t <= (-8.5d+140)) then
tmp = (2.0d0 * (u * (n * t))) ** 0.5d0
else
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= -8.5e+140) {
tmp = Math.pow((2.0 * (U * (n * t))), 0.5);
} else {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= -8.5e+140: tmp = math.pow((2.0 * (U * (n * t))), 0.5) else: tmp = math.pow((2.0 * (t * (n * U))), 0.5) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= -8.5e+140) tmp = Float64(2.0 * Float64(U * Float64(n * t))) ^ 0.5; else tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= -8.5e+140) tmp = (2.0 * (U * (n * t))) ^ 0.5; else tmp = (2.0 * (t * (n * U))) ^ 0.5; end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, -8.5e+140], N[Power[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -8.5 \cdot 10^{+140}:\\
\;\;\;\;{\left(2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if t < -8.4999999999999996e140Initial program 33.7%
Simplified33.4%
Taylor expanded in t around inf 46.6%
pow1/250.6%
associate-*r*62.4%
Applied egg-rr62.4%
if -8.4999999999999996e140 < t Initial program 50.2%
Simplified50.3%
Taylor expanded in t around inf 35.5%
pow1/237.2%
associate-*l*37.2%
Applied egg-rr37.2%
Final simplification39.7%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= t -2.8e+131) (sqrt (* 2.0 (* U (* n t)))) (sqrt (* t (* 2.0 (* n U))))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= -2.8e+131) {
tmp = sqrt((2.0 * (U * (n * t))));
} else {
tmp = sqrt((t * (2.0 * (n * U))));
}
return tmp;
}
NOTE: l should be positive before calling this function
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 (t <= (-2.8d+131)) then
tmp = sqrt((2.0d0 * (u * (n * t))))
else
tmp = sqrt((t * (2.0d0 * (n * u))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= -2.8e+131) {
tmp = Math.sqrt((2.0 * (U * (n * t))));
} else {
tmp = Math.sqrt((t * (2.0 * (n * U))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= -2.8e+131: tmp = math.sqrt((2.0 * (U * (n * t)))) else: tmp = math.sqrt((t * (2.0 * (n * U)))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= -2.8e+131) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); else tmp = sqrt(Float64(t * Float64(2.0 * Float64(n * U)))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= -2.8e+131) tmp = sqrt((2.0 * (U * (n * t)))); else tmp = sqrt((t * (2.0 * (n * U)))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, -2.8e+131], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.8 \cdot 10^{+131}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\end{array}
\end{array}
if t < -2.8000000000000001e131Initial program 34.8%
Simplified34.7%
Taylor expanded in t around inf 43.4%
associate-*r*57.6%
Simplified57.6%
if -2.8000000000000001e131 < t Initial program 50.3%
Simplified50.3%
Taylor expanded in t around inf 35.3%
Final simplification37.7%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (pow (* 2.0 (* t (* n U))) 0.5))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((2.0 * (t * (n * U))), 0.5);
}
NOTE: l should be positive before calling this function
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 = (2.0d0 * (t * (n * u))) ** 0.5d0
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow((2.0 * (t * (n * U))), 0.5);
}
l = abs(l) def code(n, U, t, l, Om, U_42_): return math.pow((2.0 * (t * (n * U))), 0.5)
l = abs(l) function code(n, U, t, l, Om, U_42_) return Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5 end
l = abs(l) function tmp = code(n, U, t, l, Om, U_42_) tmp = (2.0 * (t * (n * U))) ^ 0.5; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
l = |l|\\
\\
{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}
\end{array}
Initial program 48.6%
Simplified48.7%
Taylor expanded in t around inf 35.7%
pow1/237.7%
associate-*l*37.7%
Applied egg-rr37.7%
Final simplification37.7%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* n (* U t)))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * (n * (U * t))));
}
NOTE: l should be positive before calling this function
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))))
end function
l = Math.abs(l);
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 = abs(l) def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * (n * (U * t))))
l = abs(l) function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(n * Float64(U * t)))) end
l = abs(l) function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * (n * (U * t)))); end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l = |l|\\
\\
\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}
\end{array}
Initial program 48.6%
Simplified49.9%
Taylor expanded in t around inf 31.3%
Final simplification31.3%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* U (* n t)))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * (U * (n * t))));
}
NOTE: l should be positive before calling this function
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
l = Math.abs(l);
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))));
}
l = abs(l) def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * (U * (n * t))))
l = abs(l) function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(U * Float64(n * t)))) end
l = abs(l) function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * (U * (n * t)))); end
NOTE: l should be positive before calling this function 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}
l = |l|\\
\\
\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}
\end{array}
Initial program 48.6%
Simplified49.9%
Taylor expanded in t around inf 31.3%
associate-*r*34.7%
Simplified34.7%
Final simplification34.7%
herbie shell --seed 2023275
(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*))))))