
(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 16 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 (* l (/ l Om)))
(t_2 (* (* n (pow (/ l Om) 2.0)) (- U* U)))
(t_3 (* (* 2.0 n) U))
(t_4 (* t_3 (+ (- t (* 2.0 (/ (* l l) Om))) t_2))))
(if (<= t_4 0.0)
(sqrt (* 2.0 (* U (* n (- (fma t_1 -2.0 t) (* t_1 (/ (* n U) Om)))))))
(if (<= t_4 INFINITY)
(sqrt (* t_3 (+ (- t (* 2.0 t_1)) t_2)))
(sqrt
(*
(* n -2.0)
(* (* U (* l l)) (- (/ 2.0 Om) (* (/ n Om) (/ U* Om))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = (n * pow((l / Om), 2.0)) * (U_42_ - U);
double t_3 = (2.0 * n) * U;
double t_4 = t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2);
double tmp;
if (t_4 <= 0.0) {
tmp = sqrt((2.0 * (U * (n * (fma(t_1, -2.0, t) - (t_1 * ((n * U) / Om)))))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_3 * ((t - (2.0 * t_1)) + t_2)));
} else {
tmp = sqrt(((n * -2.0) * ((U * (l * l)) * ((2.0 / Om) - ((n / Om) * (U_42_ / Om))))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) t_2 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = Float64(Float64(2.0 * n) * U) t_4 = Float64(t_3 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_2)) tmp = 0.0 if (t_4 <= 0.0) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(fma(t_1, -2.0, t) - Float64(t_1 * Float64(Float64(n * U) / Om))))))); elseif (t_4 <= Inf) tmp = sqrt(Float64(t_3 * Float64(Float64(t - Float64(2.0 * t_1)) + t_2))); else tmp = sqrt(Float64(Float64(n * -2.0) * Float64(Float64(U * Float64(l * l)) * Float64(Float64(2.0 / Om) - Float64(Float64(n / Om) * Float64(U_42_ / Om)))))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, 0.0], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(N[(t$95$1 * -2.0 + t), $MachinePrecision] - N[(t$95$1 * N[(N[(n * U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[(t$95$3 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(n * -2.0), $MachinePrecision] * N[(N[(U * N[(l * l), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 / Om), $MachinePrecision] - N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
t_2 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_3 := \left(2 \cdot n\right) \cdot U\\
t_4 := t_3 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t_2\right)\\
\mathbf{if}\;t_4 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(\mathsf{fma}\left(t_1, -2, t\right) - t_1 \cdot \frac{n \cdot U}{Om}\right)\right)\right)}\\
\mathbf{elif}\;t_4 \leq \infty:\\
\;\;\;\;\sqrt{t_3 \cdot \left(\left(t - 2 \cdot t_1\right) + t_2\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(n \cdot -2\right) \cdot \left(\left(U \cdot \left(\ell \cdot \ell\right)\right) \cdot \left(\frac{2}{Om} - \frac{n}{Om} \cdot \frac{U*}{Om}\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 5.2%
associate-*l/8.5%
Applied egg-rr8.5%
Taylor expanded in U* around 0 30.3%
associate-*r*30.3%
Simplified37.2%
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*)))) < +inf.0Initial program 72.4%
associate-*l/74.4%
Applied egg-rr74.4%
if +inf.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*)))) Initial program 0.0%
Simplified0.3%
Taylor expanded in l around inf 50.8%
unpow250.8%
associate-*r/50.8%
metadata-eval50.8%
*-commutative50.8%
unpow250.8%
Simplified50.8%
Taylor expanded in U around 0 50.5%
unpow250.5%
*-commutative50.5%
fma-def50.5%
unpow250.5%
associate-*r/50.5%
metadata-eval50.5%
Simplified50.5%
*-un-lft-identity50.5%
times-frac59.2%
Applied egg-rr59.2%
*-lft-identity59.2%
associate-*r*59.2%
unpow259.2%
associate-*r*59.5%
*-commutative59.5%
unpow259.5%
times-frac50.8%
unpow250.8%
fma-def50.8%
+-commutative50.8%
mul-1-neg50.8%
unpow250.8%
times-frac59.5%
unsub-neg59.5%
Simplified59.5%
Final simplification67.9%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om))) (t_2 (* 2.0 (* n U))) (t_3 (/ (- U* U) Om)))
(if (<= l 9.5e-28)
(sqrt (* t_2 (+ (+ t (* (/ (* l l) Om) -2.0)) (* n (* t_1 t_3)))))
(if (<= l 7.4e+18)
(sqrt
(*
(* 2.0 n)
(* U (+ (* (/ n Om) (/ (* (* l l) U*) Om)) (fma -2.0 t_1 t)))))
(sqrt (* t_2 (+ t (* (* l l) (- (* (/ n Om) t_3) (/ 2.0 Om))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = 2.0 * (n * U);
double t_3 = (U_42_ - U) / Om;
double tmp;
if (l <= 9.5e-28) {
tmp = sqrt((t_2 * ((t + (((l * l) / Om) * -2.0)) + (n * (t_1 * t_3)))));
} else if (l <= 7.4e+18) {
tmp = sqrt(((2.0 * n) * (U * (((n / Om) * (((l * l) * U_42_) / Om)) + fma(-2.0, t_1, t)))));
} else {
tmp = sqrt((t_2 * (t + ((l * l) * (((n / Om) * t_3) - (2.0 / Om))))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) t_2 = Float64(2.0 * Float64(n * U)) t_3 = Float64(Float64(U_42_ - U) / Om) tmp = 0.0 if (l <= 9.5e-28) tmp = sqrt(Float64(t_2 * Float64(Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)) + Float64(n * Float64(t_1 * t_3))))); elseif (l <= 7.4e+18) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(Float64(Float64(n / Om) * Float64(Float64(Float64(l * l) * U_42_) / Om)) + fma(-2.0, t_1, t))))); else tmp = sqrt(Float64(t_2 * Float64(t + Float64(Float64(l * l) * Float64(Float64(Float64(n / Om) * t_3) - Float64(2.0 / Om)))))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(U$42$ - U), $MachinePrecision] / Om), $MachinePrecision]}, If[LessEqual[l, 9.5e-28], N[Sqrt[N[(t$95$2 * N[(N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision] + N[(n * N[(t$95$1 * t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 7.4e+18], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(N[(N[(n / Om), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * t$95$1 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$2 * N[(t + N[(N[(l * l), $MachinePrecision] * N[(N[(N[(n / Om), $MachinePrecision] * t$95$3), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
t_2 := 2 \cdot \left(n \cdot U\right)\\
t_3 := \frac{U* - U}{Om}\\
\mathbf{if}\;\ell \leq 9.5 \cdot 10^{-28}:\\
\;\;\;\;\sqrt{t_2 \cdot \left(\left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right) + n \cdot \left(t_1 \cdot t_3\right)\right)}\\
\mathbf{elif}\;\ell \leq 7.4 \cdot 10^{+18}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(\frac{n}{Om} \cdot \frac{\left(\ell \cdot \ell\right) \cdot U*}{Om} + \mathsf{fma}\left(-2, t_1, t\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t_2 \cdot \left(t + \left(\ell \cdot \ell\right) \cdot \left(\frac{n}{Om} \cdot t_3 - \frac{2}{Om}\right)\right)}\\
\end{array}
\end{array}
if l < 9.50000000000000001e-28Initial program 60.2%
Simplified59.1%
Taylor expanded in l around 0 51.5%
unpow251.5%
times-frac53.4%
unpow253.4%
associate-*r/56.3%
Simplified56.3%
if 9.50000000000000001e-28 < l < 7.4e18Initial program 40.9%
Simplified40.9%
Taylor expanded in U around 0 52.4%
associate-*r*52.4%
*-commutative52.4%
+-commutative52.4%
mul-1-neg52.4%
unsub-neg52.4%
associate-+l-52.4%
cancel-sign-sub-inv52.4%
metadata-eval52.4%
+-commutative52.4%
Simplified52.7%
if 7.4e18 < l Initial program 41.4%
Simplified45.8%
Taylor expanded in l around 0 53.9%
*-commutative53.9%
unpow253.9%
unpow253.9%
times-frac57.0%
associate-*r/57.0%
metadata-eval57.0%
Simplified57.0%
Final simplification56.3%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* n U))))
(if (<= l 3.9e-28)
(sqrt
(*
t_1
(+
(+ t (* (/ (* l l) Om) -2.0))
(* n (* (pow (/ l Om) 2.0) (- U* U))))))
(if (<= l 3.5e+18)
(sqrt
(*
(* 2.0 n)
(*
U
(+ (* (/ n Om) (/ (* (* l l) U*) Om)) (fma -2.0 (* l (/ l Om)) t)))))
(sqrt
(*
t_1
(+ t (* (* l l) (- (* (/ n Om) (/ (- U* U) Om)) (/ 2.0 Om))))))))))
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 <= 3.9e-28) {
tmp = sqrt((t_1 * ((t + (((l * l) / Om) * -2.0)) + (n * (pow((l / Om), 2.0) * (U_42_ - U))))));
} else if (l <= 3.5e+18) {
tmp = sqrt(((2.0 * n) * (U * (((n / Om) * (((l * l) * U_42_) / Om)) + fma(-2.0, (l * (l / Om)), t)))));
} else {
tmp = sqrt((t_1 * (t + ((l * l) * (((n / Om) * ((U_42_ - U) / Om)) - (2.0 / Om))))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(2.0 * Float64(n * U)) tmp = 0.0 if (l <= 3.9e-28) tmp = sqrt(Float64(t_1 * Float64(Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)) + Float64(n * Float64((Float64(l / Om) ^ 2.0) * Float64(U_42_ - U)))))); elseif (l <= 3.5e+18) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(Float64(Float64(n / Om) * Float64(Float64(Float64(l * l) * U_42_) / Om)) + fma(-2.0, Float64(l * Float64(l / Om)), t))))); else tmp = sqrt(Float64(t_1 * Float64(t + Float64(Float64(l * l) * Float64(Float64(Float64(n / Om) * Float64(Float64(U_42_ - U) / Om)) - Float64(2.0 / Om)))))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 3.9e-28], N[Sqrt[N[(t$95$1 * N[(N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision] + N[(n * N[(N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 3.5e+18], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(N[(N[(n / Om), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 * N[(t + N[(N[(l * l), $MachinePrecision] * N[(N[(N[(n / Om), $MachinePrecision] * N[(N[(U$42$ - U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := 2 \cdot \left(n \cdot U\right)\\
\mathbf{if}\;\ell \leq 3.9 \cdot 10^{-28}:\\
\;\;\;\;\sqrt{t_1 \cdot \left(\left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right) + n \cdot \left({\left(\frac{\ell}{Om}\right)}^{2} \cdot \left(U* - U\right)\right)\right)}\\
\mathbf{elif}\;\ell \leq 3.5 \cdot 10^{+18}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(\frac{n}{Om} \cdot \frac{\left(\ell \cdot \ell\right) \cdot U*}{Om} + \mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t_1 \cdot \left(t + \left(\ell \cdot \ell\right) \cdot \left(\frac{n}{Om} \cdot \frac{U* - U}{Om} - \frac{2}{Om}\right)\right)}\\
\end{array}
\end{array}
if l < 3.89999999999999999e-28Initial program 60.2%
Simplified59.1%
if 3.89999999999999999e-28 < l < 3.5e18Initial program 40.9%
Simplified40.9%
Taylor expanded in U around 0 52.4%
associate-*r*52.4%
*-commutative52.4%
+-commutative52.4%
mul-1-neg52.4%
unsub-neg52.4%
associate-+l-52.4%
cancel-sign-sub-inv52.4%
metadata-eval52.4%
+-commutative52.4%
Simplified52.7%
if 3.5e18 < l Initial program 41.4%
Simplified45.8%
Taylor expanded in l around 0 53.9%
*-commutative53.9%
unpow253.9%
unpow253.9%
times-frac57.0%
associate-*r/57.0%
metadata-eval57.0%
Simplified57.0%
Final simplification58.2%
(FPCore (n U t l Om U*) :precision binary64 (if (or (<= U* -2e-107) (not (<= U* 2.45e+51))) (sqrt (* (* 2.0 (* n U)) (+ t (* l (* l (* (/ (/ n Om) Om) (- U* U))))))) (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_) {
double tmp;
if ((U_42_ <= -2e-107) || !(U_42_ <= 2.45e+51)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (l * (l * (((n / Om) / Om) * (U_42_ - U)))))));
} else {
tmp = sqrt((2.0 * (n * (U * (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 ((u_42 <= (-2d-107)) .or. (.not. (u_42 <= 2.45d+51))) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (l * (l * (((n / om) / om) * (u_42 - u)))))))
else
tmp = sqrt((2.0d0 * (n * (u * (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 ((U_42_ <= -2e-107) || !(U_42_ <= 2.45e+51)) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (l * (l * (((n / Om) / Om) * (U_42_ - U)))))));
} else {
tmp = Math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if (U_42_ <= -2e-107) or not (U_42_ <= 2.45e+51): tmp = math.sqrt(((2.0 * (n * U)) * (t + (l * (l * (((n / Om) / Om) * (U_42_ - U))))))) else: tmp = math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((U_42_ <= -2e-107) || !(U_42_ <= 2.45e+51)) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n / Om) / Om) * Float64(U_42_ - U))))))); else tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if ((U_42_ <= -2e-107) || ~((U_42_ <= 2.45e+51))) tmp = sqrt(((2.0 * (n * U)) * (t + (l * (l * (((n / Om) / Om) * (U_42_ - U))))))); else tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[U$42$, -2e-107], N[Not[LessEqual[U$42$, 2.45e+51]], $MachinePrecision]], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(l * N[(l * N[(N[(N[(n / Om), $MachinePrecision] / Om), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U* \leq -2 \cdot 10^{-107} \lor \neg \left(U* \leq 2.45 \cdot 10^{+51}\right):\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{\frac{n}{Om}}{Om} \cdot \left(U* - U\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)\right)}\\
\end{array}
\end{array}
if U* < -2e-107 or 2.44999999999999992e51 < U* Initial program 53.4%
Simplified50.2%
Taylor expanded in l around 0 49.8%
*-commutative49.8%
unpow249.8%
unpow249.8%
times-frac54.9%
associate-*r/54.9%
metadata-eval54.9%
Simplified54.9%
Taylor expanded in n around -inf 47.0%
unpow247.0%
times-frac49.9%
*-commutative49.9%
associate-*l/52.4%
associate-*l*53.6%
*-commutative53.6%
unpow253.6%
associate-*l*56.9%
associate-*r/56.9%
associate-/l*56.9%
associate-/r/57.6%
Simplified57.6%
if -2e-107 < U* < 2.44999999999999992e51Initial program 55.9%
associate-*l/58.7%
Applied egg-rr58.7%
Taylor expanded in n around 0 60.2%
*-commutative60.2%
cancel-sign-sub-inv60.2%
metadata-eval60.2%
*-commutative60.2%
unpow260.2%
associate-*r/63.1%
Simplified63.1%
Final simplification59.8%
(FPCore (n U t l Om U*) :precision binary64 (if (or (<= U* -2.6e-106) (not (<= U* 1e+50))) (sqrt (* (* 2.0 (* n U)) (+ t (/ n (/ (/ Om (/ U* Om)) (* l l)))))) (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_) {
double tmp;
if ((U_42_ <= -2.6e-106) || !(U_42_ <= 1e+50)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (U_42_ / Om)) / (l * l))))));
} else {
tmp = sqrt((2.0 * (n * (U * (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 ((u_42 <= (-2.6d-106)) .or. (.not. (u_42 <= 1d+50))) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (n / ((om / (u_42 / om)) / (l * l))))))
else
tmp = sqrt((2.0d0 * (n * (u * (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 ((U_42_ <= -2.6e-106) || !(U_42_ <= 1e+50)) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (U_42_ / Om)) / (l * l))))));
} else {
tmp = Math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if (U_42_ <= -2.6e-106) or not (U_42_ <= 1e+50): tmp = math.sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (U_42_ / Om)) / (l * l)))))) else: tmp = math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((U_42_ <= -2.6e-106) || !(U_42_ <= 1e+50)) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(n / Float64(Float64(Om / Float64(U_42_ / Om)) / Float64(l * l)))))); else tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if ((U_42_ <= -2.6e-106) || ~((U_42_ <= 1e+50))) tmp = sqrt(((2.0 * (n * U)) * (t + (n / ((Om / (U_42_ / Om)) / (l * l)))))); else tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[U$42$, -2.6e-106], N[Not[LessEqual[U$42$, 1e+50]], $MachinePrecision]], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(n / N[(N[(Om / N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U* \leq -2.6 \cdot 10^{-106} \lor \neg \left(U* \leq 10^{+50}\right):\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \frac{n}{\frac{\frac{Om}{\frac{U*}{Om}}}{\ell \cdot \ell}}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)\right)}\\
\end{array}
\end{array}
if U* < -2.6000000000000001e-106 or 1.0000000000000001e50 < U* Initial program 53.4%
Simplified50.2%
Taylor expanded in l around 0 49.8%
*-commutative49.8%
unpow249.8%
unpow249.8%
times-frac54.9%
associate-*r/54.9%
metadata-eval54.9%
Simplified54.9%
Taylor expanded in U* around inf 47.0%
mul-1-neg47.0%
associate-/l*46.3%
distribute-neg-frac46.3%
*-commutative46.3%
associate-/r*51.0%
unpow251.0%
associate-/l*52.4%
unpow252.4%
Simplified52.4%
if -2.6000000000000001e-106 < U* < 1.0000000000000001e50Initial program 55.9%
associate-*l/58.7%
Applied egg-rr58.7%
Taylor expanded in n around 0 60.2%
*-commutative60.2%
cancel-sign-sub-inv60.2%
metadata-eval60.2%
*-commutative60.2%
unpow260.2%
associate-*r/63.1%
Simplified63.1%
Final simplification56.6%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1.1e-29)
(pow (* (* (* 2.0 n) U) t) 0.5)
(if (<= l 1.5e+172)
(sqrt (* 2.0 (* n (* U (+ t (* (* l (/ l Om)) -2.0))))))
(sqrt (* 2.0 (* n (* U (/ n (/ (/ (* Om Om) U*) (* l l))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.1e-29) {
tmp = pow((((2.0 * n) * U) * t), 0.5);
} else if (l <= 1.5e+172) {
tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
} else {
tmp = sqrt((2.0 * (n * (U * (n / (((Om * Om) / U_42_) / (l * 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 <= 1.1d-29) then
tmp = (((2.0d0 * n) * u) * t) ** 0.5d0
else if (l <= 1.5d+172) then
tmp = sqrt((2.0d0 * (n * (u * (t + ((l * (l / om)) * (-2.0d0)))))))
else
tmp = sqrt((2.0d0 * (n * (u * (n / (((om * om) / u_42) / (l * 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 <= 1.1e-29) {
tmp = Math.pow((((2.0 * n) * U) * t), 0.5);
} else if (l <= 1.5e+172) {
tmp = Math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
} else {
tmp = Math.sqrt((2.0 * (n * (U * (n / (((Om * Om) / U_42_) / (l * l)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.1e-29: tmp = math.pow((((2.0 * n) * U) * t), 0.5) elif l <= 1.5e+172: tmp = math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))) else: tmp = math.sqrt((2.0 * (n * (U * (n / (((Om * Om) / U_42_) / (l * l))))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.1e-29) tmp = Float64(Float64(Float64(2.0 * n) * U) * t) ^ 0.5; elseif (l <= 1.5e+172) tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0)))))); else tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * Float64(n / Float64(Float64(Float64(Om * Om) / U_42_) / Float64(l * l))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.1e-29) tmp = (((2.0 * n) * U) * t) ^ 0.5; elseif (l <= 1.5e+172) tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))); else tmp = sqrt((2.0 * (n * (U * (n / (((Om * Om) / U_42_) / (l * l))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.1e-29], N[Power[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 1.5e+172], N[Sqrt[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(n * N[(U * N[(n / N[(N[(N[(Om * Om), $MachinePrecision] / U$42$), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.1 \cdot 10^{-29}:\\
\;\;\;\;{\left(\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.5 \cdot 10^{+172}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot \frac{n}{\frac{\frac{Om \cdot Om}{U*}}{\ell \cdot \ell}}\right)\right)}\\
\end{array}
\end{array}
if l < 1.09999999999999995e-29Initial program 60.2%
associate-*l/61.9%
Applied egg-rr61.9%
Taylor expanded in t around inf 43.6%
pow1/246.5%
*-commutative46.5%
*-commutative46.5%
Applied egg-rr46.5%
if 1.09999999999999995e-29 < l < 1.5e172Initial program 57.8%
associate-*l/59.6%
Applied egg-rr59.6%
Taylor expanded in n around 0 55.5%
*-commutative55.5%
cancel-sign-sub-inv55.5%
metadata-eval55.5%
*-commutative55.5%
unpow255.5%
associate-*r/57.3%
Simplified57.3%
if 1.5e172 < l Initial program 9.6%
associate-*l/13.1%
Applied egg-rr13.1%
Taylor expanded in U* around inf 31.5%
associate-*r*31.5%
unpow231.5%
times-frac35.5%
unpow235.5%
Simplified35.5%
*-un-lft-identity35.5%
associate-*l*35.9%
associate-/l*35.9%
Applied egg-rr35.9%
*-lft-identity35.9%
associate-*l*35.9%
unpow235.9%
associate-/l*35.9%
unpow235.9%
times-frac31.7%
unpow231.7%
associate-*r*31.7%
unpow231.7%
associate-/l*31.7%
unpow231.7%
times-frac35.6%
associate-*l/35.3%
unpow235.3%
associate-*r/31.5%
Simplified31.5%
Final simplification47.1%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 9.5e-30)
(pow (* (* (* 2.0 n) U) t) 0.5)
(if (<= l 1.5e+172)
(sqrt (* 2.0 (* n (* U (+ t (* (* l (/ l Om)) -2.0))))))
(sqrt (* 2.0 (* (/ (* (* n l) (* n l)) Om) (/ (* U U*) Om)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 9.5e-30) {
tmp = pow((((2.0 * n) * U) * t), 0.5);
} else if (l <= 1.5e+172) {
tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
} else {
tmp = sqrt((2.0 * ((((n * l) * (n * l)) / Om) * ((U * U_42_) / 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 <= 9.5d-30) then
tmp = (((2.0d0 * n) * u) * t) ** 0.5d0
else if (l <= 1.5d+172) then
tmp = sqrt((2.0d0 * (n * (u * (t + ((l * (l / om)) * (-2.0d0)))))))
else
tmp = sqrt((2.0d0 * ((((n * l) * (n * l)) / om) * ((u * u_42) / 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 <= 9.5e-30) {
tmp = Math.pow((((2.0 * n) * U) * t), 0.5);
} else if (l <= 1.5e+172) {
tmp = Math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
} else {
tmp = Math.sqrt((2.0 * ((((n * l) * (n * l)) / Om) * ((U * U_42_) / Om))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 9.5e-30: tmp = math.pow((((2.0 * n) * U) * t), 0.5) elif l <= 1.5e+172: tmp = math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))) else: tmp = math.sqrt((2.0 * ((((n * l) * (n * l)) / Om) * ((U * U_42_) / Om)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 9.5e-30) tmp = Float64(Float64(Float64(2.0 * n) * U) * t) ^ 0.5; elseif (l <= 1.5e+172) tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0)))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(Float64(Float64(n * l) * Float64(n * l)) / Om) * Float64(Float64(U * U_42_) / Om)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 9.5e-30) tmp = (((2.0 * n) * U) * t) ^ 0.5; elseif (l <= 1.5e+172) tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))); else tmp = sqrt((2.0 * ((((n * l) * (n * l)) / Om) * ((U * U_42_) / Om)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 9.5e-30], N[Power[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 1.5e+172], N[Sqrt[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(N[(N[(n * l), $MachinePrecision] * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[(N[(U * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 9.5 \cdot 10^{-30}:\\
\;\;\;\;{\left(\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.5 \cdot 10^{+172}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\frac{\left(n \cdot \ell\right) \cdot \left(n \cdot \ell\right)}{Om} \cdot \frac{U \cdot U*}{Om}\right)}\\
\end{array}
\end{array}
if l < 9.49999999999999939e-30Initial program 60.2%
associate-*l/61.9%
Applied egg-rr61.9%
Taylor expanded in t around inf 43.6%
pow1/246.5%
*-commutative46.5%
*-commutative46.5%
Applied egg-rr46.5%
if 9.49999999999999939e-30 < l < 1.5e172Initial program 57.8%
associate-*l/59.6%
Applied egg-rr59.6%
Taylor expanded in n around 0 55.5%
*-commutative55.5%
cancel-sign-sub-inv55.5%
metadata-eval55.5%
*-commutative55.5%
unpow255.5%
associate-*r/57.3%
Simplified57.3%
if 1.5e172 < l Initial program 9.6%
associate-*l/13.1%
Applied egg-rr13.1%
Taylor expanded in U* around inf 26.8%
associate-*r*26.8%
unpow226.8%
times-frac31.2%
unpow231.2%
unpow231.2%
unswap-sqr35.7%
Simplified35.7%
Final simplification47.6%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* 2.0 n) U)))
(if (<= l 7.8e-30)
(pow (* t_1 t) 0.5)
(if (<= l 1.5e+172)
(sqrt (* 2.0 (* n (* U (+ t (* (* l (/ l Om)) -2.0))))))
(sqrt (* t_1 (* (/ U* Om) (/ (* n (* l l)) Om))))))))
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 <= 7.8e-30) {
tmp = pow((t_1 * t), 0.5);
} else if (l <= 1.5e+172) {
tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
} else {
tmp = sqrt((t_1 * ((U_42_ / Om) * ((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) :: t_1
real(8) :: tmp
t_1 = (2.0d0 * n) * u
if (l <= 7.8d-30) then
tmp = (t_1 * t) ** 0.5d0
else if (l <= 1.5d+172) then
tmp = sqrt((2.0d0 * (n * (u * (t + ((l * (l / om)) * (-2.0d0)))))))
else
tmp = sqrt((t_1 * ((u_42 / om) * ((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 t_1 = (2.0 * n) * U;
double tmp;
if (l <= 7.8e-30) {
tmp = Math.pow((t_1 * t), 0.5);
} else if (l <= 1.5e+172) {
tmp = Math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
} else {
tmp = Math.sqrt((t_1 * ((U_42_ / Om) * ((n * (l * l)) / Om))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (2.0 * n) * U tmp = 0 if l <= 7.8e-30: tmp = math.pow((t_1 * t), 0.5) elif l <= 1.5e+172: tmp = math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))) else: tmp = math.sqrt((t_1 * ((U_42_ / Om) * ((n * (l * l)) / Om)))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) tmp = 0.0 if (l <= 7.8e-30) tmp = Float64(t_1 * t) ^ 0.5; elseif (l <= 1.5e+172) tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0)))))); else tmp = sqrt(Float64(t_1 * Float64(Float64(U_42_ / Om) * Float64(Float64(n * Float64(l * l)) / Om)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (2.0 * n) * U; tmp = 0.0; if (l <= 7.8e-30) tmp = (t_1 * t) ^ 0.5; elseif (l <= 1.5e+172) tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))); else tmp = sqrt((t_1 * ((U_42_ / Om) * ((n * (l * l)) / Om)))); 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]}, If[LessEqual[l, 7.8e-30], N[Power[N[(t$95$1 * t), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 1.5e+172], N[Sqrt[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 * N[(N[(U$42$ / Om), $MachinePrecision] * N[(N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
\mathbf{if}\;\ell \leq 7.8 \cdot 10^{-30}:\\
\;\;\;\;{\left(t_1 \cdot t\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.5 \cdot 10^{+172}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t_1 \cdot \left(\frac{U*}{Om} \cdot \frac{n \cdot \left(\ell \cdot \ell\right)}{Om}\right)}\\
\end{array}
\end{array}
if l < 7.8000000000000007e-30Initial program 60.2%
associate-*l/61.9%
Applied egg-rr61.9%
Taylor expanded in t around inf 43.6%
pow1/246.5%
*-commutative46.5%
*-commutative46.5%
Applied egg-rr46.5%
if 7.8000000000000007e-30 < l < 1.5e172Initial program 57.8%
associate-*l/59.6%
Applied egg-rr59.6%
Taylor expanded in n around 0 55.5%
*-commutative55.5%
cancel-sign-sub-inv55.5%
metadata-eval55.5%
*-commutative55.5%
unpow255.5%
associate-*r/57.3%
Simplified57.3%
if 1.5e172 < l Initial program 9.6%
associate-*l/13.1%
Applied egg-rr13.1%
Taylor expanded in U* around inf 31.5%
associate-*r*31.5%
unpow231.5%
times-frac35.5%
unpow235.5%
Simplified35.5%
Final simplification47.5%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* 2.0 n) U)))
(if (<= l 8.2e-30)
(pow (* t_1 t) 0.5)
(if (<= l 1.5e+172)
(sqrt (* 2.0 (* n (* U (+ t (* (* l (/ l Om)) -2.0))))))
(sqrt (* t_1 (/ (* U* (/ n (/ Om (* l l)))) Om)))))))
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 <= 8.2e-30) {
tmp = pow((t_1 * t), 0.5);
} else if (l <= 1.5e+172) {
tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
} else {
tmp = sqrt((t_1 * ((U_42_ * (n / (Om / (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) :: t_1
real(8) :: tmp
t_1 = (2.0d0 * n) * u
if (l <= 8.2d-30) then
tmp = (t_1 * t) ** 0.5d0
else if (l <= 1.5d+172) then
tmp = sqrt((2.0d0 * (n * (u * (t + ((l * (l / om)) * (-2.0d0)))))))
else
tmp = sqrt((t_1 * ((u_42 * (n / (om / (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 t_1 = (2.0 * n) * U;
double tmp;
if (l <= 8.2e-30) {
tmp = Math.pow((t_1 * t), 0.5);
} else if (l <= 1.5e+172) {
tmp = Math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
} else {
tmp = Math.sqrt((t_1 * ((U_42_ * (n / (Om / (l * l)))) / Om)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (2.0 * n) * U tmp = 0 if l <= 8.2e-30: tmp = math.pow((t_1 * t), 0.5) elif l <= 1.5e+172: tmp = math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))) else: tmp = math.sqrt((t_1 * ((U_42_ * (n / (Om / (l * l)))) / Om))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) tmp = 0.0 if (l <= 8.2e-30) tmp = Float64(t_1 * t) ^ 0.5; elseif (l <= 1.5e+172) tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0)))))); else tmp = sqrt(Float64(t_1 * Float64(Float64(U_42_ * Float64(n / Float64(Om / Float64(l * l)))) / Om))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (2.0 * n) * U; tmp = 0.0; if (l <= 8.2e-30) tmp = (t_1 * t) ^ 0.5; elseif (l <= 1.5e+172) tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))); else tmp = sqrt((t_1 * ((U_42_ * (n / (Om / (l * l)))) / Om))); 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]}, If[LessEqual[l, 8.2e-30], N[Power[N[(t$95$1 * t), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 1.5e+172], N[Sqrt[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 * N[(N[(U$42$ * N[(n / N[(Om / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
\mathbf{if}\;\ell \leq 8.2 \cdot 10^{-30}:\\
\;\;\;\;{\left(t_1 \cdot t\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.5 \cdot 10^{+172}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t_1 \cdot \frac{U* \cdot \frac{n}{\frac{Om}{\ell \cdot \ell}}}{Om}}\\
\end{array}
\end{array}
if l < 8.2000000000000007e-30Initial program 60.2%
associate-*l/61.9%
Applied egg-rr61.9%
Taylor expanded in t around inf 43.6%
pow1/246.5%
*-commutative46.5%
*-commutative46.5%
Applied egg-rr46.5%
if 8.2000000000000007e-30 < l < 1.5e172Initial program 57.8%
associate-*l/59.6%
Applied egg-rr59.6%
Taylor expanded in n around 0 55.5%
*-commutative55.5%
cancel-sign-sub-inv55.5%
metadata-eval55.5%
*-commutative55.5%
unpow255.5%
associate-*r/57.3%
Simplified57.3%
if 1.5e172 < l Initial program 9.6%
associate-*l/13.1%
Applied egg-rr13.1%
Taylor expanded in U* around inf 31.5%
associate-*r*31.5%
unpow231.5%
times-frac35.5%
unpow235.5%
Simplified35.5%
associate-*r/36.2%
associate-/l*36.2%
Applied egg-rr36.2%
Final simplification47.6%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.18e-29) (pow (* (* (* 2.0 n) U) t) 0.5) (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_) {
double tmp;
if (l <= 1.18e-29) {
tmp = pow((((2.0 * n) * U) * t), 0.5);
} else {
tmp = sqrt((2.0 * (n * (U * (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 <= 1.18d-29) then
tmp = (((2.0d0 * n) * u) * t) ** 0.5d0
else
tmp = sqrt((2.0d0 * (n * (u * (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 <= 1.18e-29) {
tmp = Math.pow((((2.0 * n) * U) * t), 0.5);
} else {
tmp = Math.sqrt((2.0 * (n * (U * (t + (((l * l) / Om) * -2.0))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.18e-29: tmp = math.pow((((2.0 * n) * U) * t), 0.5) else: tmp = math.sqrt((2.0 * (n * (U * (t + (((l * l) / Om) * -2.0)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.18e-29) tmp = Float64(Float64(Float64(2.0 * n) * U) * t) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * 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 <= 1.18e-29) tmp = (((2.0 * n) * U) * t) ^ 0.5; else tmp = sqrt((2.0 * (n * (U * (t + (((l * l) / Om) * -2.0)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.18e-29], N[Power[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.18 \cdot 10^{-29}:\\
\;\;\;\;{\left(\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot \left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1.17999999999999996e-29Initial program 60.2%
associate-*l/61.9%
Applied egg-rr61.9%
Taylor expanded in t around inf 43.6%
pow1/246.5%
*-commutative46.5%
*-commutative46.5%
Applied egg-rr46.5%
if 1.17999999999999996e-29 < l Initial program 41.3%
Simplified45.0%
Taylor expanded in n around 0 40.2%
cancel-sign-sub-inv40.2%
metadata-eval40.2%
*-commutative40.2%
unpow240.2%
Simplified40.2%
Final simplification44.6%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.35e-29) (pow (* (* (* 2.0 n) U) t) 0.5) (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_) {
double tmp;
if (l <= 1.35e-29) {
tmp = pow((((2.0 * n) * U) * t), 0.5);
} else {
tmp = sqrt((2.0 * (n * (U * (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 <= 1.35d-29) then
tmp = (((2.0d0 * n) * u) * t) ** 0.5d0
else
tmp = sqrt((2.0d0 * (n * (u * (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 <= 1.35e-29) {
tmp = Math.pow((((2.0 * n) * U) * t), 0.5);
} else {
tmp = Math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.35e-29: tmp = math.pow((((2.0 * n) * U) * t), 0.5) else: tmp = math.sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.35e-29) tmp = Float64(Float64(Float64(2.0 * n) * U) * t) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.35e-29) tmp = (((2.0 * n) * U) * t) ^ 0.5; else tmp = sqrt((2.0 * (n * (U * (t + ((l * (l / Om)) * -2.0)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.35e-29], N[Power[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.35 \cdot 10^{-29}:\\
\;\;\;\;{\left(\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1.35000000000000011e-29Initial program 60.2%
associate-*l/61.9%
Applied egg-rr61.9%
Taylor expanded in t around inf 43.6%
pow1/246.5%
*-commutative46.5%
*-commutative46.5%
Applied egg-rr46.5%
if 1.35000000000000011e-29 < l Initial program 41.3%
associate-*l/43.7%
Applied egg-rr43.7%
Taylor expanded in n around 0 40.2%
*-commutative40.2%
cancel-sign-sub-inv40.2%
metadata-eval40.2%
*-commutative40.2%
unpow240.2%
associate-*r/42.6%
Simplified42.6%
Final simplification45.3%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 3.5e+107) (pow (* (* (* 2.0 n) U) t) 0.5) (sqrt (* -2.0 (* n (* 2.0 (/ (* l l) (/ Om U))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 3.5e+107) {
tmp = pow((((2.0 * n) * U) * t), 0.5);
} else {
tmp = sqrt((-2.0 * (n * (2.0 * ((l * l) / (Om / 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 <= 3.5d+107) then
tmp = (((2.0d0 * n) * u) * t) ** 0.5d0
else
tmp = sqrt(((-2.0d0) * (n * (2.0d0 * ((l * l) / (om / 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 <= 3.5e+107) {
tmp = Math.pow((((2.0 * n) * U) * t), 0.5);
} else {
tmp = Math.sqrt((-2.0 * (n * (2.0 * ((l * l) / (Om / U))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 3.5e+107: tmp = math.pow((((2.0 * n) * U) * t), 0.5) else: tmp = math.sqrt((-2.0 * (n * (2.0 * ((l * l) / (Om / U)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 3.5e+107) tmp = Float64(Float64(Float64(2.0 * n) * U) * t) ^ 0.5; else tmp = sqrt(Float64(-2.0 * Float64(n * Float64(2.0 * Float64(Float64(l * l) / Float64(Om / U)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 3.5e+107) tmp = (((2.0 * n) * U) * t) ^ 0.5; else tmp = sqrt((-2.0 * (n * (2.0 * ((l * l) / (Om / U)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 3.5e+107], N[Power[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(-2.0 * N[(n * N[(2.0 * N[(N[(l * l), $MachinePrecision] / N[(Om / U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3.5 \cdot 10^{+107}:\\
\;\;\;\;{\left(\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-2 \cdot \left(n \cdot \left(2 \cdot \frac{\ell \cdot \ell}{\frac{Om}{U}}\right)\right)}\\
\end{array}
\end{array}
if l < 3.4999999999999997e107Initial program 60.0%
associate-*l/61.4%
Applied egg-rr61.4%
Taylor expanded in t around inf 43.3%
pow1/245.7%
*-commutative45.7%
*-commutative45.7%
Applied egg-rr45.7%
if 3.4999999999999997e107 < l Initial program 25.6%
Simplified32.6%
Taylor expanded in l around inf 41.0%
unpow241.0%
associate-*r/41.0%
metadata-eval41.0%
*-commutative41.0%
unpow241.0%
Simplified41.0%
Taylor expanded in U around 0 43.0%
unpow243.0%
*-commutative43.0%
fma-def43.0%
unpow243.0%
associate-*r/43.0%
metadata-eval43.0%
Simplified43.0%
Taylor expanded in n around 0 20.1%
associate-/l*21.5%
unpow221.5%
Simplified21.5%
Final simplification41.7%
(FPCore (n U t l Om U*) :precision binary64 (if (<= n -2.8e-144) (pow (* 2.0 (* n (* U t))) 0.5) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= -2.8e-144) {
tmp = pow((2.0 * (n * (U * t))), 0.5);
} else {
tmp = sqrt((2.0 * (U * (n * 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 (n <= (-2.8d-144)) then
tmp = (2.0d0 * (n * (u * t))) ** 0.5d0
else
tmp = sqrt((2.0d0 * (u * (n * 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 (n <= -2.8e-144) {
tmp = Math.pow((2.0 * (n * (U * t))), 0.5);
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if n <= -2.8e-144: tmp = math.pow((2.0 * (n * (U * t))), 0.5) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (n <= -2.8e-144) tmp = Float64(2.0 * Float64(n * Float64(U * t))) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (n <= -2.8e-144) tmp = (2.0 * (n * (U * t))) ^ 0.5; else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, -2.8e-144], N[Power[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq -2.8 \cdot 10^{-144}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot t\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if n < -2.79999999999999998e-144Initial program 54.0%
Simplified53.7%
Taylor expanded in t around inf 35.9%
associate-*r*35.9%
*-commutative35.9%
Simplified35.9%
pow1/239.4%
associate-*l*39.4%
Applied egg-rr39.4%
if -2.79999999999999998e-144 < n Initial program 54.6%
Simplified53.3%
add-cube-cbrt53.2%
pow353.2%
*-commutative53.2%
associate-*r*56.3%
*-commutative56.3%
*-commutative56.3%
Applied egg-rr56.3%
Taylor expanded in n around inf 36.4%
associate-*r*43.8%
Simplified43.8%
Final simplification42.2%
(FPCore (n U t l Om U*) :precision binary64 (if (<= n -1.95e-143) (sqrt (* (* 2.0 n) (* U t))) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= -1.95e-143) {
tmp = sqrt(((2.0 * n) * (U * t)));
} else {
tmp = sqrt((2.0 * (U * (n * 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 (n <= (-1.95d-143)) then
tmp = sqrt(((2.0d0 * n) * (u * t)))
else
tmp = sqrt((2.0d0 * (u * (n * 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 (n <= -1.95e-143) {
tmp = Math.sqrt(((2.0 * n) * (U * t)));
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if n <= -1.95e-143: tmp = math.sqrt(((2.0 * n) * (U * t))) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (n <= -1.95e-143) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (n <= -1.95e-143) tmp = sqrt(((2.0 * n) * (U * t))); else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, -1.95e-143], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq -1.95 \cdot 10^{-143}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if n < -1.95000000000000002e-143Initial program 54.0%
Simplified53.7%
Taylor expanded in t around inf 35.9%
associate-*r*35.9%
*-commutative35.9%
Simplified35.9%
if -1.95000000000000002e-143 < n Initial program 54.6%
Simplified53.3%
add-cube-cbrt53.2%
pow353.2%
*-commutative53.2%
associate-*r*56.3%
*-commutative56.3%
*-commutative56.3%
Applied egg-rr56.3%
Taylor expanded in n around inf 36.4%
associate-*r*43.8%
Simplified43.8%
Final simplification40.9%
(FPCore (n U t l Om U*) :precision binary64 (pow (* (* (* 2.0 n) U) t) 0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((((2.0 * n) * U) * t), 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 = (((2.0d0 * n) * u) * t) ** 0.5d0
end function
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), 0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow((((2.0 * n) * U) * t), 0.5)
function code(n, U, t, l, Om, U_42_) return Float64(Float64(Float64(2.0 * n) * U) * t) ^ 0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = (((2.0 * n) * U) * t) ^ 0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\right)}^{0.5}
\end{array}
Initial program 54.4%
associate-*l/56.3%
Applied egg-rr56.3%
Taylor expanded in t around inf 38.8%
pow1/241.6%
*-commutative41.6%
*-commutative41.6%
Applied egg-rr41.6%
Final simplification41.6%
(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 54.4%
Simplified53.4%
add-cube-cbrt53.3%
pow353.3%
*-commutative53.3%
associate-*r*56.2%
*-commutative56.2%
*-commutative56.2%
Applied egg-rr56.2%
Taylor expanded in n around inf 36.2%
associate-*r*39.1%
Simplified39.1%
Final simplification39.1%
herbie shell --seed 2023273
(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*))))))