
(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 21 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 (* (* 2.0 n) U))
(t_2
(*
t_1
(+
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U* U))))))
(if (<= t_2 5e-318)
(*
(sqrt (* 2.0 n))
(sqrt (* U (+ t (* (/ l Om) (fma l -2.0 (* (/ l Om) (* n (- U* U)))))))))
(if (<= t_2 INFINITY)
(sqrt
(* t_1 (+ t (* (/ l Om) (fma l -2.0 (* n (* (/ l Om) (- U* U))))))))
(*
(* l (sqrt 2.0))
(sqrt (* (/ n Om) (* U (+ -2.0 (/ (* n U*) 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 t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) + ((n * pow((l / Om), 2.0)) * (U_42_ - U)));
double tmp;
if (t_2 <= 5e-318) {
tmp = sqrt((2.0 * n)) * sqrt((U * (t + ((l / Om) * fma(l, -2.0, ((l / Om) * (n * (U_42_ - U))))))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * (t + ((l / Om) * fma(l, -2.0, (n * ((l / Om) * (U_42_ - U))))))));
} else {
tmp = (l * sqrt(2.0)) * sqrt(((n / Om) * (U * (-2.0 + ((n * U_42_) / Om)))));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) t_2 = Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)))) tmp = 0.0 if (t_2 <= 5e-318) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * Float64(t + Float64(Float64(l / Om) * fma(l, -2.0, Float64(Float64(l / Om) * Float64(n * Float64(U_42_ - U))))))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * Float64(t + Float64(Float64(l / Om) * fma(l, -2.0, Float64(n * Float64(Float64(l / Om) * Float64(U_42_ - U)))))))); else tmp = Float64(Float64(l * sqrt(2.0)) * sqrt(Float64(Float64(n / Om) * Float64(U * Float64(-2.0 + Float64(Float64(n * U_42_) / 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[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 5e-318], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(l * -2.0 + N[(N[(l / Om), $MachinePrecision] * N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(t$95$1 * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(l * -2.0 + N[(n * N[(N[(l / Om), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n / Om), $MachinePrecision] * N[(U * N[(-2.0 + N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
t_2 := t_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)\\
\mathbf{if}\;t_2 \leq 5 \cdot 10^{-318}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(t + \frac{\ell}{Om} \cdot \mathsf{fma}\left(\ell, -2, \frac{\ell}{Om} \cdot \left(n \cdot \left(U* - U\right)\right)\right)\right)}\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;\sqrt{t_1 \cdot \left(t + \frac{\ell}{Om} \cdot \mathsf{fma}\left(\ell, -2, n \cdot \left(\frac{\ell}{Om} \cdot \left(U* - U\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\ell \cdot \sqrt{2}\right) \cdot \sqrt{\frac{n}{Om} \cdot \left(U \cdot \left(-2 + \frac{n \cdot 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*)))) < 4.9999987e-318Initial program 13.5%
Simplified38.7%
sqrt-prod42.2%
Applied egg-rr42.2%
*-commutative42.2%
*-commutative42.2%
Simplified42.2%
if 4.9999987e-318 < (*.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 67.9%
Simplified60.5%
sqrt-prod30.9%
Applied egg-rr30.9%
*-commutative30.9%
*-commutative30.9%
Simplified30.9%
pow130.9%
sqrt-unprod60.5%
*-commutative60.5%
associate-*l*68.3%
Applied egg-rr68.3%
unpow168.3%
associate-*r*74.5%
Simplified74.5%
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%
Simplified31.5%
Taylor expanded in U around 0 28.9%
Taylor expanded in l around 0 29.4%
associate-/l*29.4%
unpow229.4%
sub-neg29.4%
associate-/l*29.4%
metadata-eval29.4%
Simplified29.4%
Taylor expanded in t around 0 39.8%
*-un-lft-identity39.8%
associate-/l*44.4%
*-commutative44.4%
sub-neg44.4%
associate-/l*41.9%
metadata-eval41.9%
Applied egg-rr41.9%
*-lft-identity41.9%
associate-/r/44.5%
+-commutative44.5%
associate-/l*47.0%
Simplified47.0%
Final simplification65.7%
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
(*
t_1
(-
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U U*))))))
(if (<= t_2 0.0)
(sqrt
(*
2.0
(+
(* n (* U t))
(/ (- (* l -2.0) (/ (* (- U U*) (* n l)) Om)) (/ Om (* n (* U l)))))))
(if (<= t_2 INFINITY)
(sqrt
(* t_1 (+ t (* (/ l Om) (fma l -2.0 (* n (* (/ l Om) (- U* U))))))))
(*
(* l (sqrt 2.0))
(sqrt (* (/ n Om) (* U (+ -2.0 (/ (* n U*) 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 t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt((2.0 * ((n * (U * t)) + (((l * -2.0) - (((U - U_42_) * (n * l)) / Om)) / (Om / (n * (U * l)))))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * (t + ((l / Om) * fma(l, -2.0, (n * ((l / Om) * (U_42_ - U))))))));
} else {
tmp = (l * sqrt(2.0)) * sqrt(((n / Om) * (U * (-2.0 + ((n * U_42_) / Om)))));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) t_2 = Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_)))) tmp = 0.0 if (t_2 <= 0.0) tmp = sqrt(Float64(2.0 * Float64(Float64(n * Float64(U * t)) + Float64(Float64(Float64(l * -2.0) - Float64(Float64(Float64(U - U_42_) * Float64(n * l)) / Om)) / Float64(Om / Float64(n * Float64(U * l))))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * Float64(t + Float64(Float64(l / Om) * fma(l, -2.0, Float64(n * Float64(Float64(l / Om) * Float64(U_42_ - U)))))))); else tmp = Float64(Float64(l * sqrt(2.0)) * sqrt(Float64(Float64(n / Om) * Float64(U * Float64(-2.0 + Float64(Float64(n * U_42_) / 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[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[Sqrt[N[(2.0 * N[(N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(l * -2.0), $MachinePrecision] - N[(N[(N[(U - U$42$), $MachinePrecision] * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / N[(Om / N[(n * N[(U * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(t$95$1 * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(l * -2.0 + N[(n * N[(N[(l / Om), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n / Om), $MachinePrecision] * N[(U * N[(-2.0 + N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
t_2 := t_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\\
\mathbf{if}\;t_2 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right) + \frac{\ell \cdot -2 - \frac{\left(U - U*\right) \cdot \left(n \cdot \ell\right)}{Om}}{\frac{Om}{n \cdot \left(U \cdot \ell\right)}}\right)}\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;\sqrt{t_1 \cdot \left(t + \frac{\ell}{Om} \cdot \mathsf{fma}\left(\ell, -2, n \cdot \left(\frac{\ell}{Om} \cdot \left(U* - U\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\ell \cdot \sqrt{2}\right) \cdot \sqrt{\frac{n}{Om} \cdot \left(U \cdot \left(-2 + \frac{n \cdot 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 12.3%
Simplified38.2%
sqrt-prod40.5%
Applied egg-rr40.5%
*-commutative40.5%
*-commutative40.5%
Simplified40.5%
pow140.5%
sqrt-unprod38.2%
*-commutative38.2%
associate-*l*38.1%
Applied egg-rr38.1%
unpow138.1%
associate-*r*17.9%
Simplified17.9%
Taylor expanded in t around inf 38.0%
distribute-lft-out38.0%
*-commutative38.0%
associate-/l*37.9%
+-commutative37.9%
*-commutative37.9%
associate-*r*39.6%
Simplified39.6%
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 67.8%
Simplified60.4%
sqrt-prod31.2%
Applied egg-rr31.2%
*-commutative31.2%
*-commutative31.2%
Simplified31.2%
pow131.2%
sqrt-unprod60.4%
*-commutative60.4%
associate-*l*68.2%
Applied egg-rr68.2%
unpow168.2%
associate-*r*74.4%
Simplified74.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%
Simplified31.5%
Taylor expanded in U around 0 28.9%
Taylor expanded in l around 0 29.4%
associate-/l*29.4%
unpow229.4%
sub-neg29.4%
associate-/l*29.4%
metadata-eval29.4%
Simplified29.4%
Taylor expanded in t around 0 39.8%
*-un-lft-identity39.8%
associate-/l*44.4%
*-commutative44.4%
sub-neg44.4%
associate-/l*41.9%
metadata-eval41.9%
Applied egg-rr41.9%
*-lft-identity41.9%
associate-/r/44.5%
+-commutative44.5%
associate-/l*47.0%
Simplified47.0%
Final simplification65.4%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 7.2e-250)
(sqrt (* (* 2.0 n) (* U t)))
(if (<= l 3.2e-244)
(* (sqrt (* 2.0 (* n U))) (sqrt t))
(if (<= l 8e-7)
(sqrt
(*
(* (* 2.0 n) U)
(+ t (* (/ l Om) (fma l -2.0 (/ (* n (* l U*)) Om))))))
(if (<= l 6.8e+180)
(sqrt
(*
(* 2.0 n)
(* U (+ t (* (/ l Om) (fma l -2.0 (* (/ l Om) (* n (- U* U)))))))))
(*
(* l (sqrt 2.0))
(sqrt (* (/ n Om) (* U (+ -2.0 (/ (* n U*) Om)))))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 7.2e-250) {
tmp = sqrt(((2.0 * n) * (U * t)));
} else if (l <= 3.2e-244) {
tmp = sqrt((2.0 * (n * U))) * sqrt(t);
} else if (l <= 8e-7) {
tmp = sqrt((((2.0 * n) * U) * (t + ((l / Om) * fma(l, -2.0, ((n * (l * U_42_)) / Om))))));
} else if (l <= 6.8e+180) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l / Om) * fma(l, -2.0, ((l / Om) * (n * (U_42_ - U)))))))));
} else {
tmp = (l * sqrt(2.0)) * sqrt(((n / Om) * (U * (-2.0 + ((n * U_42_) / Om)))));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 7.2e-250) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t))); elseif (l <= 3.2e-244) tmp = Float64(sqrt(Float64(2.0 * Float64(n * U))) * sqrt(t)); elseif (l <= 8e-7) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(Float64(l / Om) * fma(l, -2.0, Float64(Float64(n * Float64(l * U_42_)) / Om)))))); elseif (l <= 6.8e+180) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l / Om) * fma(l, -2.0, Float64(Float64(l / Om) * Float64(n * Float64(U_42_ - U))))))))); else tmp = Float64(Float64(l * sqrt(2.0)) * sqrt(Float64(Float64(n / Om) * Float64(U * Float64(-2.0 + Float64(Float64(n * U_42_) / Om)))))); end return tmp end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 7.2e-250], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 3.2e-244], N[(N[Sqrt[N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 8e-7], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(l * -2.0 + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 6.8e+180], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(l * -2.0 + N[(N[(l / Om), $MachinePrecision] * N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n / Om), $MachinePrecision] * N[(U * N[(-2.0 + N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 7.2 \cdot 10^{-250}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t\right)}\\
\mathbf{elif}\;\ell \leq 3.2 \cdot 10^{-244}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot U\right)} \cdot \sqrt{t}\\
\mathbf{elif}\;\ell \leq 8 \cdot 10^{-7}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \frac{\ell}{Om} \cdot \mathsf{fma}\left(\ell, -2, \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)\right)}\\
\mathbf{elif}\;\ell \leq 6.8 \cdot 10^{+180}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell}{Om} \cdot \mathsf{fma}\left(\ell, -2, \frac{\ell}{Om} \cdot \left(n \cdot \left(U* - U\right)\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\ell \cdot \sqrt{2}\right) \cdot \sqrt{\frac{n}{Om} \cdot \left(U \cdot \left(-2 + \frac{n \cdot U*}{Om}\right)\right)}\\
\end{array}
\end{array}
if l < 7.19999999999999964e-250Initial program 51.9%
Simplified51.5%
Taylor expanded in t around inf 40.8%
if 7.19999999999999964e-250 < l < 3.1999999999999998e-244Initial program 23.8%
Taylor expanded in t around inf 23.8%
sqrt-prod60.0%
associate-*l*60.0%
Applied egg-rr60.0%
if 3.1999999999999998e-244 < l < 7.9999999999999996e-7Initial program 65.1%
Simplified60.5%
sqrt-prod41.5%
Applied egg-rr41.5%
*-commutative41.5%
*-commutative41.5%
Simplified41.5%
pow141.5%
sqrt-unprod60.5%
*-commutative60.5%
associate-*l*65.9%
Applied egg-rr65.9%
unpow165.9%
associate-*r*73.4%
Simplified73.4%
Taylor expanded in U* around inf 69.7%
if 7.9999999999999996e-7 < l < 6.79999999999999969e180Initial program 53.8%
Simplified66.6%
if 6.79999999999999969e180 < l Initial program 6.0%
Simplified34.2%
Taylor expanded in U around 0 23.2%
Taylor expanded in l around 0 23.7%
associate-/l*23.7%
unpow223.7%
sub-neg23.7%
associate-/l*23.7%
metadata-eval23.7%
Simplified23.7%
Taylor expanded in t around 0 86.9%
*-un-lft-identity86.9%
associate-/l*79.4%
*-commutative79.4%
sub-neg79.4%
associate-/l*79.4%
metadata-eval79.4%
Applied egg-rr79.4%
*-lft-identity79.4%
associate-/r/76.6%
+-commutative76.6%
associate-/l*76.6%
Simplified76.6%
Final simplification54.9%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (* l (+ (* l -2.0) (/ (* n (* l U*)) Om))) Om)))))))
(if (<= l 7.2e-250)
(sqrt (* (* 2.0 n) (* U t)))
(if (<= l 1.7e-243)
(* (sqrt (* 2.0 (* n U))) (sqrt t))
(if (<= l 4.4e-182)
t_1
(if (<= l 1.1e-95)
(sqrt (* (* (* 2.0 n) U) (+ t (* -2.0 (/ l (/ Om l))))))
(if (<= l 1.1e+59)
t_1
(*
(* l (sqrt 2.0))
(sqrt (* (/ n Om) (* U (+ -2.0 (/ (* n U*) Om)))))))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)))));
double tmp;
if (l <= 7.2e-250) {
tmp = sqrt(((2.0 * n) * (U * t)));
} else if (l <= 1.7e-243) {
tmp = sqrt((2.0 * (n * U))) * sqrt(t);
} else if (l <= 4.4e-182) {
tmp = t_1;
} else if (l <= 1.1e-95) {
tmp = sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l))))));
} else if (l <= 1.1e+59) {
tmp = t_1;
} else {
tmp = (l * sqrt(2.0)) * sqrt(((n / Om) * (U * (-2.0 + ((n * U_42_) / 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 = sqrt(((2.0d0 * n) * (u * (t + ((l * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))) / om)))))
if (l <= 7.2d-250) then
tmp = sqrt(((2.0d0 * n) * (u * t)))
else if (l <= 1.7d-243) then
tmp = sqrt((2.0d0 * (n * u))) * sqrt(t)
else if (l <= 4.4d-182) then
tmp = t_1
else if (l <= 1.1d-95) then
tmp = sqrt((((2.0d0 * n) * u) * (t + ((-2.0d0) * (l / (om / l))))))
else if (l <= 1.1d+59) then
tmp = t_1
else
tmp = (l * sqrt(2.0d0)) * sqrt(((n / om) * (u * ((-2.0d0) + ((n * u_42) / 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 = Math.sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)))));
double tmp;
if (l <= 7.2e-250) {
tmp = Math.sqrt(((2.0 * n) * (U * t)));
} else if (l <= 1.7e-243) {
tmp = Math.sqrt((2.0 * (n * U))) * Math.sqrt(t);
} else if (l <= 4.4e-182) {
tmp = t_1;
} else if (l <= 1.1e-95) {
tmp = Math.sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l))))));
} else if (l <= 1.1e+59) {
tmp = t_1;
} else {
tmp = (l * Math.sqrt(2.0)) * Math.sqrt(((n / Om) * (U * (-2.0 + ((n * U_42_) / Om)))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om))))) tmp = 0 if l <= 7.2e-250: tmp = math.sqrt(((2.0 * n) * (U * t))) elif l <= 1.7e-243: tmp = math.sqrt((2.0 * (n * U))) * math.sqrt(t) elif l <= 4.4e-182: tmp = t_1 elif l <= 1.1e-95: tmp = math.sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l)))))) elif l <= 1.1e+59: tmp = t_1 else: tmp = (l * math.sqrt(2.0)) * math.sqrt(((n / Om) * (U * (-2.0 + ((n * U_42_) / Om))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))) / Om))))) tmp = 0.0 if (l <= 7.2e-250) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t))); elseif (l <= 1.7e-243) tmp = Float64(sqrt(Float64(2.0 * Float64(n * U))) * sqrt(t)); elseif (l <= 4.4e-182) tmp = t_1; elseif (l <= 1.1e-95) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))))); elseif (l <= 1.1e+59) tmp = t_1; else tmp = Float64(Float64(l * sqrt(2.0)) * sqrt(Float64(Float64(n / Om) * Float64(U * Float64(-2.0 + Float64(Float64(n * U_42_) / Om)))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om))))); tmp = 0.0; if (l <= 7.2e-250) tmp = sqrt(((2.0 * n) * (U * t))); elseif (l <= 1.7e-243) tmp = sqrt((2.0 * (n * U))) * sqrt(t); elseif (l <= 4.4e-182) tmp = t_1; elseif (l <= 1.1e-95) tmp = sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l)))))); elseif (l <= 1.1e+59) tmp = t_1; else tmp = (l * sqrt(2.0)) * sqrt(((n / Om) * (U * (-2.0 + ((n * U_42_) / 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[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, 7.2e-250], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.7e-243], N[(N[Sqrt[N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 4.4e-182], t$95$1, If[LessEqual[l, 1.1e-95], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.1e+59], t$95$1, N[(N[(l * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n / Om), $MachinePrecision] * N[(U * N[(-2.0 + N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := \sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)}{Om}\right)\right)}\\
\mathbf{if}\;\ell \leq 7.2 \cdot 10^{-250}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t\right)}\\
\mathbf{elif}\;\ell \leq 1.7 \cdot 10^{-243}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot U\right)} \cdot \sqrt{t}\\
\mathbf{elif}\;\ell \leq 4.4 \cdot 10^{-182}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;\ell \leq 1.1 \cdot 10^{-95}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right)}\\
\mathbf{elif}\;\ell \leq 1.1 \cdot 10^{+59}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;\left(\ell \cdot \sqrt{2}\right) \cdot \sqrt{\frac{n}{Om} \cdot \left(U \cdot \left(-2 + \frac{n \cdot U*}{Om}\right)\right)}\\
\end{array}
\end{array}
if l < 7.19999999999999964e-250Initial program 51.9%
Simplified51.5%
Taylor expanded in t around inf 40.8%
if 7.19999999999999964e-250 < l < 1.69999999999999998e-243Initial program 23.8%
Taylor expanded in t around inf 23.8%
sqrt-prod60.0%
associate-*l*60.0%
Applied egg-rr60.0%
if 1.69999999999999998e-243 < l < 4.3999999999999999e-182 or 1.0999999999999999e-95 < l < 1.1e59Initial program 68.0%
Simplified64.8%
Taylor expanded in U around 0 65.9%
if 4.3999999999999999e-182 < l < 1.0999999999999999e-95Initial program 53.8%
Taylor expanded in Om around inf 50.6%
unpow250.6%
associate-/l*50.6%
Simplified50.6%
if 1.1e59 < l Initial program 24.6%
Simplified51.6%
Taylor expanded in U around 0 39.0%
Taylor expanded in l around 0 39.3%
associate-/l*39.3%
unpow239.3%
sub-neg39.3%
associate-/l*39.3%
metadata-eval39.3%
Simplified39.3%
Taylor expanded in t around 0 72.5%
*-un-lft-identity72.5%
associate-/l*70.4%
*-commutative70.4%
sub-neg70.4%
associate-/l*72.4%
metadata-eval72.4%
Applied egg-rr72.4%
*-lft-identity72.4%
associate-/r/72.8%
+-commutative72.8%
associate-/l*70.9%
Simplified70.9%
Final simplification52.9%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (/ (* n (* l U*)) Om)))
(if (<= l 6.6e-250)
(sqrt (* (* 2.0 n) (* U t)))
(if (<= l 8.6e-245)
(* (sqrt (* 2.0 (* n U))) (sqrt t))
(if (<= l 5.4e-6)
(sqrt (* (* (* 2.0 n) U) (+ t (* (/ l Om) (fma l -2.0 t_1)))))
(if (<= l 2.6e+144)
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (* l l) (/ Om (+ -2.0 (/ n (/ Om U*)))))))))
(if (<= l 6e+180)
(sqrt (* 2.0 (/ (* n (* l (* U (+ (* l -2.0) t_1)))) Om)))
(*
(* l (sqrt 2.0))
(sqrt (* (/ n Om) (* U (+ -2.0 (/ (* n U*) Om)))))))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (n * (l * U_42_)) / Om;
double tmp;
if (l <= 6.6e-250) {
tmp = sqrt(((2.0 * n) * (U * t)));
} else if (l <= 8.6e-245) {
tmp = sqrt((2.0 * (n * U))) * sqrt(t);
} else if (l <= 5.4e-6) {
tmp = sqrt((((2.0 * n) * U) * (t + ((l / Om) * fma(l, -2.0, t_1)))));
} else if (l <= 2.6e+144) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_)))))))));
} else if (l <= 6e+180) {
tmp = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + t_1)))) / Om)));
} else {
tmp = (l * sqrt(2.0)) * sqrt(((n / Om) * (U * (-2.0 + ((n * U_42_) / Om)))));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(n * Float64(l * U_42_)) / Om) tmp = 0.0 if (l <= 6.6e-250) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t))); elseif (l <= 8.6e-245) tmp = Float64(sqrt(Float64(2.0 * Float64(n * U))) * sqrt(t)); elseif (l <= 5.4e-6) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(Float64(l / Om) * fma(l, -2.0, t_1))))); elseif (l <= 2.6e+144) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * l) / Float64(Om / Float64(-2.0 + Float64(n / Float64(Om / U_42_))))))))); elseif (l <= 6e+180) tmp = sqrt(Float64(2.0 * Float64(Float64(n * Float64(l * Float64(U * Float64(Float64(l * -2.0) + t_1)))) / Om))); else tmp = Float64(Float64(l * sqrt(2.0)) * sqrt(Float64(Float64(n / Om) * Float64(U * Float64(-2.0 + Float64(Float64(n * U_42_) / 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[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]}, If[LessEqual[l, 6.6e-250], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 8.6e-245], N[(N[Sqrt[N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5.4e-6], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(l * -2.0 + t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 2.6e+144], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * l), $MachinePrecision] / N[(Om / N[(-2.0 + N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 6e+180], N[Sqrt[N[(2.0 * N[(N[(n * N[(l * N[(U * N[(N[(l * -2.0), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n / Om), $MachinePrecision] * N[(U * N[(-2.0 + N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\\
\mathbf{if}\;\ell \leq 6.6 \cdot 10^{-250}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t\right)}\\
\mathbf{elif}\;\ell \leq 8.6 \cdot 10^{-245}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot U\right)} \cdot \sqrt{t}\\
\mathbf{elif}\;\ell \leq 5.4 \cdot 10^{-6}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \frac{\ell}{Om} \cdot \mathsf{fma}\left(\ell, -2, t_1\right)\right)}\\
\mathbf{elif}\;\ell \leq 2.6 \cdot 10^{+144}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \ell}{\frac{Om}{-2 + \frac{n}{\frac{Om}{U*}}}}\right)\right)}\\
\mathbf{elif}\;\ell \leq 6 \cdot 10^{+180}:\\
\;\;\;\;\sqrt{2 \cdot \frac{n \cdot \left(\ell \cdot \left(U \cdot \left(\ell \cdot -2 + t_1\right)\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\left(\ell \cdot \sqrt{2}\right) \cdot \sqrt{\frac{n}{Om} \cdot \left(U \cdot \left(-2 + \frac{n \cdot U*}{Om}\right)\right)}\\
\end{array}
\end{array}
if l < 6.6e-250Initial program 51.9%
Simplified51.5%
Taylor expanded in t around inf 40.8%
if 6.6e-250 < l < 8.60000000000000005e-245Initial program 23.8%
Taylor expanded in t around inf 23.8%
sqrt-prod60.0%
associate-*l*60.0%
Applied egg-rr60.0%
if 8.60000000000000005e-245 < l < 5.39999999999999997e-6Initial program 65.7%
Simplified61.2%
sqrt-prod42.5%
Applied egg-rr42.5%
*-commutative42.5%
*-commutative42.5%
Simplified42.5%
pow142.5%
sqrt-unprod61.2%
*-commutative61.2%
associate-*l*66.5%
Applied egg-rr66.5%
unpow166.5%
associate-*r*73.8%
Simplified73.8%
Taylor expanded in U* around inf 70.2%
if 5.39999999999999997e-6 < l < 2.5999999999999999e144Initial program 56.1%
Simplified62.0%
Taylor expanded in U around 0 59.1%
Taylor expanded in l around 0 59.1%
associate-/l*59.1%
unpow259.1%
sub-neg59.1%
associate-/l*62.5%
metadata-eval62.5%
Simplified62.5%
if 2.5999999999999999e144 < l < 6.00000000000000006e180Initial program 34.5%
Simplified83.9%
Taylor expanded in U around 0 35.1%
Taylor expanded in t around 0 100.0%
if 6.00000000000000006e180 < l Initial program 6.0%
Simplified34.2%
Taylor expanded in U around 0 23.2%
Taylor expanded in l around 0 23.7%
associate-/l*23.7%
unpow223.7%
sub-neg23.7%
associate-/l*23.7%
metadata-eval23.7%
Simplified23.7%
Taylor expanded in t around 0 86.9%
*-un-lft-identity86.9%
associate-/l*79.4%
*-commutative79.4%
sub-neg79.4%
associate-/l*79.4%
metadata-eval79.4%
Applied egg-rr79.4%
*-lft-identity79.4%
associate-/r/76.6%
+-commutative76.6%
associate-/l*76.6%
Simplified76.6%
Final simplification55.3%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ t (* -2.0 (/ l (/ Om l)))))
(t_2
(sqrt
(*
2.0
(/ (* n (* l (* U (+ (* l -2.0) (/ (* n (* l U*)) Om))))) Om)))))
(if (<= Om -2.65e-129)
(sqrt (* (* 2.0 n) (* U t_1)))
(if (<= Om 2.55e-154)
t_2
(if (<= Om 1.35e-45)
(sqrt (* (* 2.0 n) (* U (+ t (* (/ (* n (* l l)) Om) (/ U* Om))))))
(if (<= Om 2.1e-21) t_2 (sqrt (* (* (* 2.0 n) U) t_1))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = t + (-2.0 * (l / (Om / l)));
double t_2 = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om)));
double tmp;
if (Om <= -2.65e-129) {
tmp = sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 2.55e-154) {
tmp = t_2;
} else if (Om <= 1.35e-45) {
tmp = sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om))))));
} else if (Om <= 2.1e-21) {
tmp = t_2;
} else {
tmp = sqrt((((2.0 * n) * U) * t_1));
}
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) :: tmp
t_1 = t + ((-2.0d0) * (l / (om / l)))
t_2 = sqrt((2.0d0 * ((n * (l * (u * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))))) / om)))
if (om <= (-2.65d-129)) then
tmp = sqrt(((2.0d0 * n) * (u * t_1)))
else if (om <= 2.55d-154) then
tmp = t_2
else if (om <= 1.35d-45) then
tmp = sqrt(((2.0d0 * n) * (u * (t + (((n * (l * l)) / om) * (u_42 / om))))))
else if (om <= 2.1d-21) then
tmp = t_2
else
tmp = sqrt((((2.0d0 * n) * u) * t_1))
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 = t + (-2.0 * (l / (Om / l)));
double t_2 = Math.sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om)));
double tmp;
if (Om <= -2.65e-129) {
tmp = Math.sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 2.55e-154) {
tmp = t_2;
} else if (Om <= 1.35e-45) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om))))));
} else if (Om <= 2.1e-21) {
tmp = t_2;
} else {
tmp = Math.sqrt((((2.0 * n) * U) * t_1));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = t + (-2.0 * (l / (Om / l))) t_2 = math.sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om))) tmp = 0 if Om <= -2.65e-129: tmp = math.sqrt(((2.0 * n) * (U * t_1))) elif Om <= 2.55e-154: tmp = t_2 elif Om <= 1.35e-45: tmp = math.sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om)))))) elif Om <= 2.1e-21: tmp = t_2 else: tmp = math.sqrt((((2.0 * n) * U) * t_1)) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))) t_2 = sqrt(Float64(2.0 * Float64(Float64(n * Float64(l * Float64(U * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))))) / Om))) tmp = 0.0 if (Om <= -2.65e-129) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t_1))); elseif (Om <= 2.55e-154) tmp = t_2; elseif (Om <= 1.35e-45) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(Float64(n * Float64(l * l)) / Om) * Float64(U_42_ / Om)))))); elseif (Om <= 2.1e-21) tmp = t_2; else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t_1)); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = t + (-2.0 * (l / (Om / l))); t_2 = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om))); tmp = 0.0; if (Om <= -2.65e-129) tmp = sqrt(((2.0 * n) * (U * t_1))); elseif (Om <= 2.55e-154) tmp = t_2; elseif (Om <= 1.35e-45) tmp = sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om)))))); elseif (Om <= 2.1e-21) tmp = t_2; else tmp = sqrt((((2.0 * n) * U) * t_1)); 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[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(2.0 * N[(N[(n * N[(l * N[(U * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[Om, -2.65e-129], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 2.55e-154], t$95$2, If[LessEqual[Om, 1.35e-45], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 2.1e-21], t$95$2, N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\\
t_2 := \sqrt{2 \cdot \frac{n \cdot \left(\ell \cdot \left(U \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)\right)\right)}{Om}}\\
\mathbf{if}\;Om \leq -2.65 \cdot 10^{-129}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t_1\right)}\\
\mathbf{elif}\;Om \leq 2.55 \cdot 10^{-154}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;Om \leq 1.35 \cdot 10^{-45}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{n \cdot \left(\ell \cdot \ell\right)}{Om} \cdot \frac{U*}{Om}\right)\right)}\\
\mathbf{elif}\;Om \leq 2.1 \cdot 10^{-21}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t_1}\\
\end{array}
\end{array}
if Om < -2.64999999999999987e-129Initial program 49.7%
Simplified53.2%
Taylor expanded in n around 0 51.6%
*-commutative51.6%
unpow251.6%
associate-/l*58.1%
Simplified58.1%
if -2.64999999999999987e-129 < Om < 2.5499999999999999e-154 or 1.34999999999999992e-45 < Om < 2.10000000000000013e-21Initial program 36.0%
Simplified56.4%
Taylor expanded in U around 0 55.5%
Taylor expanded in t around 0 56.4%
if 2.5499999999999999e-154 < Om < 1.34999999999999992e-45Initial program 67.5%
Simplified66.7%
Taylor expanded in U around 0 64.4%
Taylor expanded in l around 0 64.2%
associate-/l*54.4%
unpow254.4%
sub-neg54.4%
associate-/l*54.2%
metadata-eval54.2%
Simplified54.2%
Taylor expanded in Om around 0 62.3%
associate-*r*62.2%
unpow262.2%
times-frac61.9%
unpow261.9%
Simplified61.9%
if 2.10000000000000013e-21 < Om Initial program 56.1%
Taylor expanded in Om around inf 56.5%
unpow256.5%
associate-/l*59.1%
Simplified59.1%
Final simplification58.3%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ t (* -2.0 (/ l (/ Om l))))))
(if (<= Om -1.24e-129)
(sqrt (* (* 2.0 n) (* U t_1)))
(if (<= Om 1.75e-154)
(sqrt
(* 2.0 (/ (* n (* l (* U (+ (* l -2.0) (/ (* n (* l U*)) Om))))) Om)))
(if (<= Om 4e-40)
(sqrt (* (* 2.0 n) (* U (+ t (* (/ (* n (* l l)) Om) (/ U* Om))))))
(if (<= Om 3.5e-12)
(sqrt
(*
2.0
(/ (* (* n l) (* U (- (* l -2.0) (* (/ n Om) (* U l))))) Om)))
(sqrt (* (* (* 2.0 n) U) t_1))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = t + (-2.0 * (l / (Om / l)));
double tmp;
if (Om <= -1.24e-129) {
tmp = sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 1.75e-154) {
tmp = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om)));
} else if (Om <= 4e-40) {
tmp = sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om))))));
} else if (Om <= 3.5e-12) {
tmp = sqrt((2.0 * (((n * l) * (U * ((l * -2.0) - ((n / Om) * (U * l))))) / Om)));
} else {
tmp = sqrt((((2.0 * n) * U) * t_1));
}
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 = t + ((-2.0d0) * (l / (om / l)))
if (om <= (-1.24d-129)) then
tmp = sqrt(((2.0d0 * n) * (u * t_1)))
else if (om <= 1.75d-154) then
tmp = sqrt((2.0d0 * ((n * (l * (u * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))))) / om)))
else if (om <= 4d-40) then
tmp = sqrt(((2.0d0 * n) * (u * (t + (((n * (l * l)) / om) * (u_42 / om))))))
else if (om <= 3.5d-12) then
tmp = sqrt((2.0d0 * (((n * l) * (u * ((l * (-2.0d0)) - ((n / om) * (u * l))))) / om)))
else
tmp = sqrt((((2.0d0 * n) * u) * t_1))
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 = t + (-2.0 * (l / (Om / l)));
double tmp;
if (Om <= -1.24e-129) {
tmp = Math.sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 1.75e-154) {
tmp = Math.sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om)));
} else if (Om <= 4e-40) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om))))));
} else if (Om <= 3.5e-12) {
tmp = Math.sqrt((2.0 * (((n * l) * (U * ((l * -2.0) - ((n / Om) * (U * l))))) / Om)));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * t_1));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = t + (-2.0 * (l / (Om / l))) tmp = 0 if Om <= -1.24e-129: tmp = math.sqrt(((2.0 * n) * (U * t_1))) elif Om <= 1.75e-154: tmp = math.sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om))) elif Om <= 4e-40: tmp = math.sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om)))))) elif Om <= 3.5e-12: tmp = math.sqrt((2.0 * (((n * l) * (U * ((l * -2.0) - ((n / Om) * (U * l))))) / Om))) else: tmp = math.sqrt((((2.0 * n) * U) * t_1)) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))) tmp = 0.0 if (Om <= -1.24e-129) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t_1))); elseif (Om <= 1.75e-154) tmp = sqrt(Float64(2.0 * Float64(Float64(n * Float64(l * Float64(U * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))))) / Om))); elseif (Om <= 4e-40) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(Float64(n * Float64(l * l)) / Om) * Float64(U_42_ / Om)))))); elseif (Om <= 3.5e-12) tmp = sqrt(Float64(2.0 * Float64(Float64(Float64(n * l) * Float64(U * Float64(Float64(l * -2.0) - Float64(Float64(n / Om) * Float64(U * l))))) / Om))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t_1)); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = t + (-2.0 * (l / (Om / l))); tmp = 0.0; if (Om <= -1.24e-129) tmp = sqrt(((2.0 * n) * (U * t_1))); elseif (Om <= 1.75e-154) tmp = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om))); elseif (Om <= 4e-40) tmp = sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om)))))); elseif (Om <= 3.5e-12) tmp = sqrt((2.0 * (((n * l) * (U * ((l * -2.0) - ((n / Om) * (U * l))))) / Om))); else tmp = sqrt((((2.0 * n) * U) * t_1)); 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[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, -1.24e-129], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 1.75e-154], N[Sqrt[N[(2.0 * N[(N[(n * N[(l * N[(U * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 4e-40], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 3.5e-12], N[Sqrt[N[(2.0 * N[(N[(N[(n * l), $MachinePrecision] * N[(U * N[(N[(l * -2.0), $MachinePrecision] - N[(N[(n / Om), $MachinePrecision] * N[(U * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\\
\mathbf{if}\;Om \leq -1.24 \cdot 10^{-129}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t_1\right)}\\
\mathbf{elif}\;Om \leq 1.75 \cdot 10^{-154}:\\
\;\;\;\;\sqrt{2 \cdot \frac{n \cdot \left(\ell \cdot \left(U \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)\right)\right)}{Om}}\\
\mathbf{elif}\;Om \leq 4 \cdot 10^{-40}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{n \cdot \left(\ell \cdot \ell\right)}{Om} \cdot \frac{U*}{Om}\right)\right)}\\
\mathbf{elif}\;Om \leq 3.5 \cdot 10^{-12}:\\
\;\;\;\;\sqrt{2 \cdot \frac{\left(n \cdot \ell\right) \cdot \left(U \cdot \left(\ell \cdot -2 - \frac{n}{Om} \cdot \left(U \cdot \ell\right)\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t_1}\\
\end{array}
\end{array}
if Om < -1.24000000000000004e-129Initial program 49.7%
Simplified53.2%
Taylor expanded in n around 0 51.6%
*-commutative51.6%
unpow251.6%
associate-/l*58.1%
Simplified58.1%
if -1.24000000000000004e-129 < Om < 1.75e-154Initial program 37.3%
Simplified59.5%
Taylor expanded in U around 0 58.5%
Taylor expanded in t around 0 55.8%
if 1.75e-154 < Om < 3.9999999999999997e-40Initial program 66.3%
Simplified65.6%
Taylor expanded in U around 0 63.5%
Taylor expanded in l around 0 63.3%
associate-/l*54.4%
unpow254.4%
sub-neg54.4%
associate-/l*54.2%
metadata-eval54.2%
Simplified54.2%
Taylor expanded in Om around 0 61.5%
associate-*r*61.5%
unpow261.5%
times-frac61.3%
unpow261.3%
Simplified61.3%
if 3.9999999999999997e-40 < Om < 3.5e-12Initial program 43.4%
Simplified17.7%
Taylor expanded in U* around 0 17.5%
associate-*r*45.0%
+-commutative45.0%
Simplified45.0%
Taylor expanded in t around 0 44.6%
associate-*r*85.3%
*-commutative85.3%
*-commutative85.3%
associate-*l/85.3%
*-commutative85.3%
Simplified85.3%
if 3.5e-12 < Om Initial program 55.0%
Taylor expanded in Om around inf 55.4%
unpow255.4%
associate-/l*58.1%
Simplified58.1%
Final simplification58.6%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= Om -5.2e+77)
(sqrt
(* 2.0 (* U (* n (+ t (/ l (/ Om (- (* l -2.0) (/ n (/ Om (* U l)))))))))))
(if (<= Om 1.35e-17)
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (* l (+ (* l -2.0) (/ (* n (* l U*)) Om))) Om)))))
(sqrt (* (* (* 2.0 n) U) (+ t (* -2.0 (/ l (/ Om l)))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= -5.2e+77) {
tmp = sqrt((2.0 * (U * (n * (t + (l / (Om / ((l * -2.0) - (n / (Om / (U * l)))))))))));
} else if (Om <= 1.35e-17) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)))));
} else {
tmp = sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l))))));
}
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 <= (-5.2d+77)) then
tmp = sqrt((2.0d0 * (u * (n * (t + (l / (om / ((l * (-2.0d0)) - (n / (om / (u * l)))))))))))
else if (om <= 1.35d-17) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((l * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))) / om)))))
else
tmp = sqrt((((2.0d0 * n) * u) * (t + ((-2.0d0) * (l / (om / l))))))
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 <= -5.2e+77) {
tmp = Math.sqrt((2.0 * (U * (n * (t + (l / (Om / ((l * -2.0) - (n / (Om / (U * l)))))))))));
} else if (Om <= 1.35e-17) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)))));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if Om <= -5.2e+77: tmp = math.sqrt((2.0 * (U * (n * (t + (l / (Om / ((l * -2.0) - (n / (Om / (U * l))))))))))) elif Om <= 1.35e-17: tmp = math.sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om))))) else: tmp = math.sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l)))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (Om <= -5.2e+77) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(l / Float64(Om / Float64(Float64(l * -2.0) - Float64(n / Float64(Om / Float64(U * l))))))))))); elseif (Om <= 1.35e-17) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))) / Om))))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (Om <= -5.2e+77) tmp = sqrt((2.0 * (U * (n * (t + (l / (Om / ((l * -2.0) - (n / (Om / (U * l))))))))))); elseif (Om <= 1.35e-17) tmp = sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om))))); else tmp = sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l)))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[Om, -5.2e+77], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(l / N[(Om / N[(N[(l * -2.0), $MachinePrecision] - N[(n / N[(Om / N[(U * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 1.35e-17], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -5.2 \cdot 10^{+77}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + \frac{\ell}{\frac{Om}{\ell \cdot -2 - \frac{n}{\frac{Om}{U \cdot \ell}}}}\right)\right)\right)}\\
\mathbf{elif}\;Om \leq 1.35 \cdot 10^{-17}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right)}\\
\end{array}
\end{array}
if Om < -5.2000000000000004e77Initial program 56.1%
Simplified53.7%
Taylor expanded in U* around 0 46.6%
associate-*r*52.5%
+-commutative52.5%
Simplified68.0%
if -5.2000000000000004e77 < Om < 1.3500000000000001e-17Initial program 41.9%
Simplified57.0%
Taylor expanded in U around 0 55.6%
if 1.3500000000000001e-17 < Om Initial program 56.1%
Taylor expanded in Om around inf 56.5%
unpow256.5%
associate-/l*59.1%
Simplified59.1%
Final simplification60.0%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 2.6e-116)
(sqrt (* 2.0 (* U (* n (+ t (* (/ (* l l) Om) -2.0))))))
(if (<= l 2.8e+139)
(sqrt
(* (* 2.0 n) (* U (+ t (/ (* l l) (/ Om (+ -2.0 (/ n (/ Om U*)))))))))
(sqrt
(* 2.0 (/ (* n (* l (* U (+ (* l -2.0) (/ (* n (* l U*)) Om))))) Om))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.6e-116) {
tmp = sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0))))));
} else if (l <= 2.8e+139) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_)))))))));
} else {
tmp = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / 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 <= 2.6d-116) then
tmp = sqrt((2.0d0 * (u * (n * (t + (((l * l) / om) * (-2.0d0)))))))
else if (l <= 2.8d+139) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((l * l) / (om / ((-2.0d0) + (n / (om / u_42)))))))))
else
tmp = sqrt((2.0d0 * ((n * (l * (u * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))))) / 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 <= 2.6e-116) {
tmp = Math.sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0))))));
} else if (l <= 2.8e+139) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_)))))))));
} else {
tmp = Math.sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om)));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2.6e-116: tmp = math.sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0)))))) elif l <= 2.8e+139: tmp = math.sqrt(((2.0 * n) * (U * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_))))))))) else: tmp = math.sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.6e-116) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)))))); elseif (l <= 2.8e+139) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * l) / Float64(Om / Float64(-2.0 + Float64(n / Float64(Om / U_42_))))))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(n * Float64(l * Float64(U * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))))) / Om))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2.6e-116) tmp = sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0)))))); elseif (l <= 2.8e+139) tmp = sqrt(((2.0 * n) * (U * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_))))))))); else tmp = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / 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, 2.6e-116], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 2.8e+139], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * l), $MachinePrecision] / N[(Om / N[(-2.0 + N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(n * N[(l * N[(U * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.6 \cdot 10^{-116}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right)\right)\right)}\\
\mathbf{elif}\;\ell \leq 2.8 \cdot 10^{+139}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \ell}{\frac{Om}{-2 + \frac{n}{\frac{Om}{U*}}}}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \frac{n \cdot \left(\ell \cdot \left(U \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 2.6e-116Initial program 54.9%
Simplified51.9%
Taylor expanded in U around 0 54.7%
Taylor expanded in n around 0 50.1%
associate-*r*52.4%
unpow252.4%
Simplified52.4%
if 2.6e-116 < l < 2.7999999999999998e139Initial program 57.6%
Simplified60.9%
Taylor expanded in U around 0 59.7%
Taylor expanded in l around 0 57.9%
associate-/l*52.4%
unpow252.4%
sub-neg52.4%
associate-/l*57.6%
metadata-eval57.6%
Simplified57.6%
if 2.7999999999999998e139 < l Initial program 11.1%
Simplified45.2%
Taylor expanded in U around 0 27.7%
Taylor expanded in t around 0 48.1%
Final simplification53.0%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= Om -4.5e-79)
(sqrt
(* 2.0 (* U (* n (+ t (/ l (/ Om (- (* l -2.0) (/ n (/ Om (* U l)))))))))))
(if (<= Om 3.3e-19)
(sqrt
(* 2.0 (/ (* n (* l (* U (+ (* l -2.0) (/ (* n (* l U*)) Om))))) Om)))
(sqrt (* (* (* 2.0 n) U) (+ t (* -2.0 (/ l (/ Om l)))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= -4.5e-79) {
tmp = sqrt((2.0 * (U * (n * (t + (l / (Om / ((l * -2.0) - (n / (Om / (U * l)))))))))));
} else if (Om <= 3.3e-19) {
tmp = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om)));
} else {
tmp = sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l))))));
}
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 <= (-4.5d-79)) then
tmp = sqrt((2.0d0 * (u * (n * (t + (l / (om / ((l * (-2.0d0)) - (n / (om / (u * l)))))))))))
else if (om <= 3.3d-19) then
tmp = sqrt((2.0d0 * ((n * (l * (u * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))))) / om)))
else
tmp = sqrt((((2.0d0 * n) * u) * (t + ((-2.0d0) * (l / (om / l))))))
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 <= -4.5e-79) {
tmp = Math.sqrt((2.0 * (U * (n * (t + (l / (Om / ((l * -2.0) - (n / (Om / (U * l)))))))))));
} else if (Om <= 3.3e-19) {
tmp = Math.sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om)));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if Om <= -4.5e-79: tmp = math.sqrt((2.0 * (U * (n * (t + (l / (Om / ((l * -2.0) - (n / (Om / (U * l))))))))))) elif Om <= 3.3e-19: tmp = math.sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om))) else: tmp = math.sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l)))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (Om <= -4.5e-79) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(l / Float64(Om / Float64(Float64(l * -2.0) - Float64(n / Float64(Om / Float64(U * l))))))))))); elseif (Om <= 3.3e-19) tmp = sqrt(Float64(2.0 * Float64(Float64(n * Float64(l * Float64(U * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))))) / Om))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (Om <= -4.5e-79) tmp = sqrt((2.0 * (U * (n * (t + (l / (Om / ((l * -2.0) - (n / (Om / (U * l))))))))))); elseif (Om <= 3.3e-19) tmp = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om))); else tmp = sqrt((((2.0 * n) * U) * (t + (-2.0 * (l / (Om / l)))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[Om, -4.5e-79], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(l / N[(Om / N[(N[(l * -2.0), $MachinePrecision] - N[(n / N[(Om / N[(U * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 3.3e-19], N[Sqrt[N[(2.0 * N[(N[(n * N[(l * N[(U * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -4.5 \cdot 10^{-79}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + \frac{\ell}{\frac{Om}{\ell \cdot -2 - \frac{n}{\frac{Om}{U \cdot \ell}}}}\right)\right)\right)}\\
\mathbf{elif}\;Om \leq 3.3 \cdot 10^{-19}:\\
\;\;\;\;\sqrt{2 \cdot \frac{n \cdot \left(\ell \cdot \left(U \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right)}\\
\end{array}
\end{array}
if Om < -4.5000000000000003e-79Initial program 50.7%
Simplified52.8%
Taylor expanded in U* around 0 45.6%
associate-*r*48.8%
+-commutative48.8%
Simplified59.7%
if -4.5000000000000003e-79 < Om < 3.2999999999999998e-19Initial program 43.3%
Simplified59.3%
Taylor expanded in U around 0 58.1%
Taylor expanded in t around 0 51.0%
if 3.2999999999999998e-19 < Om Initial program 56.1%
Taylor expanded in Om around inf 56.5%
unpow256.5%
associate-/l*59.1%
Simplified59.1%
Final simplification56.7%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ t (* -2.0 (/ l (/ Om l))))))
(if (<= Om -4.4e-133)
(sqrt (* (* 2.0 n) (* U t_1)))
(if (<= Om 1.6e-101)
(sqrt (* -2.0 (/ (* (* n (* l l)) (* U (- 2.0 (/ n (/ Om U*))))) Om)))
(sqrt (* (* (* 2.0 n) U) t_1))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = t + (-2.0 * (l / (Om / l)));
double tmp;
if (Om <= -4.4e-133) {
tmp = sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 1.6e-101) {
tmp = sqrt((-2.0 * (((n * (l * l)) * (U * (2.0 - (n / (Om / U_42_))))) / Om)));
} else {
tmp = sqrt((((2.0 * n) * U) * t_1));
}
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 = t + ((-2.0d0) * (l / (om / l)))
if (om <= (-4.4d-133)) then
tmp = sqrt(((2.0d0 * n) * (u * t_1)))
else if (om <= 1.6d-101) then
tmp = sqrt(((-2.0d0) * (((n * (l * l)) * (u * (2.0d0 - (n / (om / u_42))))) / om)))
else
tmp = sqrt((((2.0d0 * n) * u) * t_1))
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 = t + (-2.0 * (l / (Om / l)));
double tmp;
if (Om <= -4.4e-133) {
tmp = Math.sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 1.6e-101) {
tmp = Math.sqrt((-2.0 * (((n * (l * l)) * (U * (2.0 - (n / (Om / U_42_))))) / Om)));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * t_1));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = t + (-2.0 * (l / (Om / l))) tmp = 0 if Om <= -4.4e-133: tmp = math.sqrt(((2.0 * n) * (U * t_1))) elif Om <= 1.6e-101: tmp = math.sqrt((-2.0 * (((n * (l * l)) * (U * (2.0 - (n / (Om / U_42_))))) / Om))) else: tmp = math.sqrt((((2.0 * n) * U) * t_1)) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))) tmp = 0.0 if (Om <= -4.4e-133) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t_1))); elseif (Om <= 1.6e-101) tmp = sqrt(Float64(-2.0 * Float64(Float64(Float64(n * Float64(l * l)) * Float64(U * Float64(2.0 - Float64(n / Float64(Om / U_42_))))) / Om))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t_1)); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = t + (-2.0 * (l / (Om / l))); tmp = 0.0; if (Om <= -4.4e-133) tmp = sqrt(((2.0 * n) * (U * t_1))); elseif (Om <= 1.6e-101) tmp = sqrt((-2.0 * (((n * (l * l)) * (U * (2.0 - (n / (Om / U_42_))))) / Om))); else tmp = sqrt((((2.0 * n) * U) * t_1)); 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[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, -4.4e-133], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 1.6e-101], N[Sqrt[N[(-2.0 * N[(N[(N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision] * N[(U * N[(2.0 - N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\\
\mathbf{if}\;Om \leq -4.4 \cdot 10^{-133}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t_1\right)}\\
\mathbf{elif}\;Om \leq 1.6 \cdot 10^{-101}:\\
\;\;\;\;\sqrt{-2 \cdot \frac{\left(n \cdot \left(\ell \cdot \ell\right)\right) \cdot \left(U \cdot \left(2 - \frac{n}{\frac{Om}{U*}}\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t_1}\\
\end{array}
\end{array}
if Om < -4.4000000000000001e-133Initial program 48.9%
Simplified52.3%
Taylor expanded in n around 0 50.7%
*-commutative50.7%
unpow250.7%
associate-/l*57.0%
Simplified57.0%
if -4.4000000000000001e-133 < Om < 1.59999999999999989e-101Initial program 44.0%
Simplified64.2%
Taylor expanded in U around 0 62.3%
Taylor expanded in l around -inf 48.0%
associate-*r*47.5%
unpow247.5%
*-commutative47.5%
mul-1-neg47.5%
unsub-neg47.5%
associate-/l*42.2%
Simplified42.2%
if 1.59999999999999989e-101 < Om Initial program 54.7%
Taylor expanded in Om around inf 52.9%
unpow252.9%
associate-/l*55.0%
Simplified55.0%
Final simplification53.0%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ t (* -2.0 (/ l (/ Om l))))))
(if (<= Om -9.5e-133)
(sqrt (* (* 2.0 n) (* U t_1)))
(if (<= Om 1.3e-99)
(sqrt (* 2.0 (/ n (/ Om (* (* l l) (* U (+ -2.0 (* U* (/ n Om)))))))))
(sqrt (* (* (* 2.0 n) U) t_1))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = t + (-2.0 * (l / (Om / l)));
double tmp;
if (Om <= -9.5e-133) {
tmp = sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 1.3e-99) {
tmp = sqrt((2.0 * (n / (Om / ((l * l) * (U * (-2.0 + (U_42_ * (n / Om)))))))));
} else {
tmp = sqrt((((2.0 * n) * U) * t_1));
}
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 = t + ((-2.0d0) * (l / (om / l)))
if (om <= (-9.5d-133)) then
tmp = sqrt(((2.0d0 * n) * (u * t_1)))
else if (om <= 1.3d-99) then
tmp = sqrt((2.0d0 * (n / (om / ((l * l) * (u * ((-2.0d0) + (u_42 * (n / om)))))))))
else
tmp = sqrt((((2.0d0 * n) * u) * t_1))
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 = t + (-2.0 * (l / (Om / l)));
double tmp;
if (Om <= -9.5e-133) {
tmp = Math.sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 1.3e-99) {
tmp = Math.sqrt((2.0 * (n / (Om / ((l * l) * (U * (-2.0 + (U_42_ * (n / Om)))))))));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * t_1));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = t + (-2.0 * (l / (Om / l))) tmp = 0 if Om <= -9.5e-133: tmp = math.sqrt(((2.0 * n) * (U * t_1))) elif Om <= 1.3e-99: tmp = math.sqrt((2.0 * (n / (Om / ((l * l) * (U * (-2.0 + (U_42_ * (n / Om))))))))) else: tmp = math.sqrt((((2.0 * n) * U) * t_1)) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))) tmp = 0.0 if (Om <= -9.5e-133) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t_1))); elseif (Om <= 1.3e-99) tmp = sqrt(Float64(2.0 * Float64(n / Float64(Om / Float64(Float64(l * l) * Float64(U * Float64(-2.0 + Float64(U_42_ * Float64(n / Om))))))))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t_1)); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = t + (-2.0 * (l / (Om / l))); tmp = 0.0; if (Om <= -9.5e-133) tmp = sqrt(((2.0 * n) * (U * t_1))); elseif (Om <= 1.3e-99) tmp = sqrt((2.0 * (n / (Om / ((l * l) * (U * (-2.0 + (U_42_ * (n / Om))))))))); else tmp = sqrt((((2.0 * n) * U) * t_1)); 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[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, -9.5e-133], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 1.3e-99], N[Sqrt[N[(2.0 * N[(n / N[(Om / N[(N[(l * l), $MachinePrecision] * N[(U * N[(-2.0 + N[(U$42$ * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\\
\mathbf{if}\;Om \leq -9.5 \cdot 10^{-133}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t_1\right)}\\
\mathbf{elif}\;Om \leq 1.3 \cdot 10^{-99}:\\
\;\;\;\;\sqrt{2 \cdot \frac{n}{\frac{Om}{\left(\ell \cdot \ell\right) \cdot \left(U \cdot \left(-2 + U* \cdot \frac{n}{Om}\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t_1}\\
\end{array}
\end{array}
if Om < -9.4999999999999992e-133Initial program 48.9%
Simplified52.3%
Taylor expanded in n around 0 50.7%
*-commutative50.7%
unpow250.7%
associate-/l*57.0%
Simplified57.0%
if -9.4999999999999992e-133 < Om < 1.30000000000000003e-99Initial program 44.0%
Simplified64.2%
Taylor expanded in U around 0 62.3%
Taylor expanded in l around 0 54.9%
associate-/l*47.5%
unpow247.5%
sub-neg47.5%
associate-/l*45.7%
metadata-eval45.7%
Simplified45.7%
Taylor expanded in t around 0 48.0%
associate-/l*49.2%
unpow249.2%
*-commutative49.2%
sub-neg49.2%
associate-*l/47.5%
metadata-eval47.5%
+-commutative47.5%
*-commutative47.5%
Simplified47.5%
if 1.30000000000000003e-99 < Om Initial program 54.7%
Taylor expanded in Om around inf 52.9%
unpow252.9%
associate-/l*55.0%
Simplified55.0%
Final simplification54.2%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ t (* -2.0 (/ l (/ Om l))))))
(if (<= Om -9.8e-133)
(sqrt (* (* 2.0 n) (* U t_1)))
(if (<= Om 3.8e-40)
(sqrt (* (* 2.0 n) (* U (+ t (* (/ (* n (* l l)) Om) (/ U* Om))))))
(sqrt (* (* (* 2.0 n) U) t_1))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = t + (-2.0 * (l / (Om / l)));
double tmp;
if (Om <= -9.8e-133) {
tmp = sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 3.8e-40) {
tmp = sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om))))));
} else {
tmp = sqrt((((2.0 * n) * U) * t_1));
}
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 = t + ((-2.0d0) * (l / (om / l)))
if (om <= (-9.8d-133)) then
tmp = sqrt(((2.0d0 * n) * (u * t_1)))
else if (om <= 3.8d-40) then
tmp = sqrt(((2.0d0 * n) * (u * (t + (((n * (l * l)) / om) * (u_42 / om))))))
else
tmp = sqrt((((2.0d0 * n) * u) * t_1))
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 = t + (-2.0 * (l / (Om / l)));
double tmp;
if (Om <= -9.8e-133) {
tmp = Math.sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 3.8e-40) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om))))));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * t_1));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = t + (-2.0 * (l / (Om / l))) tmp = 0 if Om <= -9.8e-133: tmp = math.sqrt(((2.0 * n) * (U * t_1))) elif Om <= 3.8e-40: tmp = math.sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om)))))) else: tmp = math.sqrt((((2.0 * n) * U) * t_1)) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))) tmp = 0.0 if (Om <= -9.8e-133) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t_1))); elseif (Om <= 3.8e-40) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(Float64(n * Float64(l * l)) / Om) * Float64(U_42_ / Om)))))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t_1)); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = t + (-2.0 * (l / (Om / l))); tmp = 0.0; if (Om <= -9.8e-133) tmp = sqrt(((2.0 * n) * (U * t_1))); elseif (Om <= 3.8e-40) tmp = sqrt(((2.0 * n) * (U * (t + (((n * (l * l)) / Om) * (U_42_ / Om)))))); else tmp = sqrt((((2.0 * n) * U) * t_1)); 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[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, -9.8e-133], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 3.8e-40], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\\
\mathbf{if}\;Om \leq -9.8 \cdot 10^{-133}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t_1\right)}\\
\mathbf{elif}\;Om \leq 3.8 \cdot 10^{-40}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{n \cdot \left(\ell \cdot \ell\right)}{Om} \cdot \frac{U*}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t_1}\\
\end{array}
\end{array}
if Om < -9.79999999999999992e-133Initial program 48.9%
Simplified52.3%
Taylor expanded in n around 0 50.7%
*-commutative50.7%
unpow250.7%
associate-/l*57.0%
Simplified57.0%
if -9.79999999999999992e-133 < Om < 3.7999999999999999e-40Initial program 46.9%
Simplified63.2%
Taylor expanded in U around 0 61.8%
Taylor expanded in l around 0 55.9%
associate-/l*48.5%
unpow248.5%
sub-neg48.5%
associate-/l*47.0%
metadata-eval47.0%
Simplified47.0%
Taylor expanded in Om around 0 45.0%
associate-*r*44.5%
unpow244.5%
times-frac52.5%
unpow252.5%
Simplified52.5%
if 3.7999999999999999e-40 < Om Initial program 54.0%
Taylor expanded in Om around inf 54.4%
unpow254.4%
associate-/l*56.9%
Simplified56.9%
Final simplification55.7%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ t (* -2.0 (/ l (/ Om l))))))
(if (<= Om 6e-298)
(sqrt (* (* 2.0 n) (* U t_1)))
(if (<= Om 1.1e-191)
(/ (sqrt (* (- U* U) (* 2.0 U))) (/ Om (* n l)))
(sqrt (* (* (* 2.0 n) U) t_1))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = t + (-2.0 * (l / (Om / l)));
double tmp;
if (Om <= 6e-298) {
tmp = sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 1.1e-191) {
tmp = sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l));
} else {
tmp = sqrt((((2.0 * n) * U) * t_1));
}
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 = t + ((-2.0d0) * (l / (om / l)))
if (om <= 6d-298) then
tmp = sqrt(((2.0d0 * n) * (u * t_1)))
else if (om <= 1.1d-191) then
tmp = sqrt(((u_42 - u) * (2.0d0 * u))) / (om / (n * l))
else
tmp = sqrt((((2.0d0 * n) * u) * t_1))
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 = t + (-2.0 * (l / (Om / l)));
double tmp;
if (Om <= 6e-298) {
tmp = Math.sqrt(((2.0 * n) * (U * t_1)));
} else if (Om <= 1.1e-191) {
tmp = Math.sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * t_1));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = t + (-2.0 * (l / (Om / l))) tmp = 0 if Om <= 6e-298: tmp = math.sqrt(((2.0 * n) * (U * t_1))) elif Om <= 1.1e-191: tmp = math.sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l)) else: tmp = math.sqrt((((2.0 * n) * U) * t_1)) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l)))) tmp = 0.0 if (Om <= 6e-298) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t_1))); elseif (Om <= 1.1e-191) tmp = Float64(sqrt(Float64(Float64(U_42_ - U) * Float64(2.0 * U))) / Float64(Om / Float64(n * l))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t_1)); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = t + (-2.0 * (l / (Om / l))); tmp = 0.0; if (Om <= 6e-298) tmp = sqrt(((2.0 * n) * (U * t_1))); elseif (Om <= 1.1e-191) tmp = sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l)); else tmp = sqrt((((2.0 * n) * U) * t_1)); 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[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, 6e-298], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 1.1e-191], N[(N[Sqrt[N[(N[(U$42$ - U), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(Om / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\\
\mathbf{if}\;Om \leq 6 \cdot 10^{-298}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t_1\right)}\\
\mathbf{elif}\;Om \leq 1.1 \cdot 10^{-191}:\\
\;\;\;\;\frac{\sqrt{\left(U* - U\right) \cdot \left(2 \cdot U\right)}}{\frac{Om}{n \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t_1}\\
\end{array}
\end{array}
if Om < 5.9999999999999999e-298Initial program 48.5%
Simplified55.7%
Taylor expanded in n around 0 47.2%
*-commutative47.2%
unpow247.2%
associate-/l*52.1%
Simplified52.1%
if 5.9999999999999999e-298 < Om < 1.09999999999999999e-191Initial program 20.7%
Simplified49.2%
Taylor expanded in n around inf 46.4%
associate-/l*46.4%
*-commutative46.4%
Simplified46.4%
associate-*l/46.5%
Applied egg-rr46.5%
div-inv46.4%
sqrt-unprod46.7%
associate-/r*46.7%
Applied egg-rr46.7%
associate-*r/46.7%
*-rgt-identity46.7%
associate-*r*46.7%
associate-/l/46.7%
*-commutative46.7%
Simplified46.7%
if 1.09999999999999999e-191 < Om Initial program 56.1%
Taylor expanded in Om around inf 51.8%
unpow251.8%
associate-/l*53.7%
Simplified53.7%
Final simplification52.4%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= l 7.8e+197) (sqrt (* 2.0 (* U (* n (+ t (* (/ (* l l) Om) -2.0)))))) (/ (sqrt (* (- U* U) (* 2.0 U))) (/ Om (* n l)))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 7.8e+197) {
tmp = sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0))))));
} else {
tmp = sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l));
}
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 <= 7.8d+197) then
tmp = sqrt((2.0d0 * (u * (n * (t + (((l * l) / om) * (-2.0d0)))))))
else
tmp = sqrt(((u_42 - u) * (2.0d0 * u))) / (om / (n * l))
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 <= 7.8e+197) {
tmp = Math.sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0))))));
} else {
tmp = Math.sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 7.8e+197: tmp = math.sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0)))))) else: tmp = math.sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l)) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 7.8e+197) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)))))); else tmp = Float64(sqrt(Float64(Float64(U_42_ - U) * Float64(2.0 * U))) / Float64(Om / Float64(n * l))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 7.8e+197) tmp = sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0)))))); else tmp = sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l)); 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, 7.8e+197], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(N[(U$42$ - U), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(Om / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 7.8 \cdot 10^{+197}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(U* - U\right) \cdot \left(2 \cdot U\right)}}{\frac{Om}{n \cdot \ell}}\\
\end{array}
\end{array}
if l < 7.8e197Initial program 54.4%
Simplified54.7%
Taylor expanded in U around 0 55.2%
Taylor expanded in n around 0 49.1%
associate-*r*50.3%
unpow250.3%
Simplified50.3%
if 7.8e197 < l Initial program 6.5%
Simplified36.7%
Taylor expanded in n around inf 21.6%
associate-/l*21.6%
*-commutative21.6%
Simplified21.6%
associate-*l/21.6%
Applied egg-rr21.6%
div-inv21.6%
sqrt-unprod21.6%
associate-/r*25.1%
Applied egg-rr25.1%
associate-*r/25.1%
*-rgt-identity25.1%
associate-*r*25.1%
associate-/l/21.6%
*-commutative21.6%
Simplified21.6%
Final simplification47.6%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= U -2.25e+91) (sqrt (* 2.0 (* U (* n (+ t (* (/ (* l l) Om) -2.0)))))) (sqrt (* (* 2.0 n) (* U (+ t (* -2.0 (/ l (/ Om l)))))))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= -2.25e+91) {
tmp = sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0))))));
} else {
tmp = sqrt(((2.0 * n) * (U * (t + (-2.0 * (l / (Om / l)))))));
}
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 (u <= (-2.25d+91)) then
tmp = sqrt((2.0d0 * (u * (n * (t + (((l * l) / om) * (-2.0d0)))))))
else
tmp = sqrt(((2.0d0 * n) * (u * (t + ((-2.0d0) * (l / (om / l)))))))
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 (U <= -2.25e+91) {
tmp = Math.sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0))))));
} else {
tmp = Math.sqrt(((2.0 * n) * (U * (t + (-2.0 * (l / (Om / l)))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if U <= -2.25e+91: tmp = math.sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0)))))) else: tmp = math.sqrt(((2.0 * n) * (U * (t + (-2.0 * (l / (Om / l))))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U <= -2.25e+91) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)))))); else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(-2.0 * Float64(l / Float64(Om / l))))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U <= -2.25e+91) tmp = sqrt((2.0 * (U * (n * (t + (((l * l) / Om) * -2.0)))))); else tmp = sqrt(((2.0 * n) * (U * (t + (-2.0 * (l / (Om / l))))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U, -2.25e+91], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(-2.0 * N[(l / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;U \leq -2.25 \cdot 10^{+91}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + -2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right)\right)}\\
\end{array}
\end{array}
if U < -2.25e91Initial program 60.3%
Simplified43.3%
Taylor expanded in U around 0 47.5%
Taylor expanded in n around 0 41.9%
associate-*r*56.2%
unpow256.2%
Simplified56.2%
if -2.25e91 < U Initial program 48.3%
Simplified54.5%
Taylor expanded in n around 0 45.8%
*-commutative45.8%
unpow245.8%
associate-/l*49.7%
Simplified49.7%
Final simplification50.6%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.95e+106) (pow (* (* 2.0 n) (* U t)) 0.5) (* (* n l) (/ (sqrt (* 2.0 (* U (- U* U)))) Om))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.95e+106) {
tmp = pow(((2.0 * n) * (U * t)), 0.5);
} else {
tmp = (n * l) * (sqrt((2.0 * (U * (U_42_ - U)))) / 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 <= 1.95d+106) then
tmp = ((2.0d0 * n) * (u * t)) ** 0.5d0
else
tmp = (n * l) * (sqrt((2.0d0 * (u * (u_42 - u)))) / 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 <= 1.95e+106) {
tmp = Math.pow(((2.0 * n) * (U * t)), 0.5);
} else {
tmp = (n * l) * (Math.sqrt((2.0 * (U * (U_42_ - U)))) / Om);
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.95e+106: tmp = math.pow(((2.0 * n) * (U * t)), 0.5) else: tmp = (n * l) * (math.sqrt((2.0 * (U * (U_42_ - U)))) / Om) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.95e+106) tmp = Float64(Float64(2.0 * n) * Float64(U * t)) ^ 0.5; else tmp = Float64(Float64(n * l) * Float64(sqrt(Float64(2.0 * Float64(U * Float64(U_42_ - U)))) / Om)); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.95e+106) tmp = ((2.0 * n) * (U * t)) ^ 0.5; else tmp = (n * l) * (sqrt((2.0 * (U * (U_42_ - U)))) / 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, 1.95e+106], N[Power[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[(N[(n * l), $MachinePrecision] * N[(N[Sqrt[N[(2.0 * N[(U * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.95 \cdot 10^{+106}:\\
\;\;\;\;{\left(\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\left(n \cdot \ell\right) \cdot \frac{\sqrt{2 \cdot \left(U \cdot \left(U* - U\right)\right)}}{Om}\\
\end{array}
\end{array}
if l < 1.94999999999999984e106Initial program 54.8%
Simplified53.3%
Taylor expanded in t around inf 39.0%
pow1/240.9%
Applied egg-rr40.9%
if 1.94999999999999984e106 < l Initial program 20.7%
Simplified51.1%
Taylor expanded in n around inf 19.5%
associate-/l*19.5%
*-commutative19.5%
Simplified19.5%
associate-*l/19.5%
Applied egg-rr19.5%
associate-/r/19.5%
sqrt-unprod19.5%
Applied egg-rr19.5%
Final simplification37.8%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.25e+108) (pow (* (* 2.0 n) (* U t)) 0.5) (/ (sqrt (* (- U* U) (* 2.0 U))) (/ Om (* n l)))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.25e+108) {
tmp = pow(((2.0 * n) * (U * t)), 0.5);
} else {
tmp = sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l));
}
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.25d+108) then
tmp = ((2.0d0 * n) * (u * t)) ** 0.5d0
else
tmp = sqrt(((u_42 - u) * (2.0d0 * u))) / (om / (n * l))
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.25e+108) {
tmp = Math.pow(((2.0 * n) * (U * t)), 0.5);
} else {
tmp = Math.sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.25e+108: tmp = math.pow(((2.0 * n) * (U * t)), 0.5) else: tmp = math.sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l)) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.25e+108) tmp = Float64(Float64(2.0 * n) * Float64(U * t)) ^ 0.5; else tmp = Float64(sqrt(Float64(Float64(U_42_ - U) * Float64(2.0 * U))) / Float64(Om / Float64(n * l))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.25e+108) tmp = ((2.0 * n) * (U * t)) ^ 0.5; else tmp = sqrt(((U_42_ - U) * (2.0 * U))) / (Om / (n * l)); 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.25e+108], N[Power[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[(N[Sqrt[N[(N[(U$42$ - U), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(Om / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.25 \cdot 10^{+108}:\\
\;\;\;\;{\left(\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(U* - U\right) \cdot \left(2 \cdot U\right)}}{\frac{Om}{n \cdot \ell}}\\
\end{array}
\end{array}
if l < 1.24999999999999998e108Initial program 54.8%
Simplified53.3%
Taylor expanded in t around inf 39.0%
pow1/240.9%
Applied egg-rr40.9%
if 1.24999999999999998e108 < l Initial program 20.7%
Simplified51.1%
Taylor expanded in n around inf 19.5%
associate-/l*19.5%
*-commutative19.5%
Simplified19.5%
associate-*l/19.5%
Applied egg-rr19.5%
div-inv19.5%
sqrt-unprod19.5%
associate-/r*21.8%
Applied egg-rr21.8%
associate-*r/21.8%
*-rgt-identity21.8%
associate-*r*21.8%
associate-/l/19.5%
*-commutative19.5%
Simplified19.5%
Final simplification37.8%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= U -2.1e+109) (sqrt (* (* (* 2.0 n) U) t)) (pow (* (* 2.0 n) (* U t)) 0.5)))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= -2.1e+109) {
tmp = sqrt((((2.0 * n) * U) * t));
} else {
tmp = pow(((2.0 * n) * (U * t)), 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 (u <= (-2.1d+109)) then
tmp = sqrt((((2.0d0 * n) * u) * t))
else
tmp = ((2.0d0 * n) * (u * t)) ** 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 (U <= -2.1e+109) {
tmp = Math.sqrt((((2.0 * n) * U) * t));
} else {
tmp = Math.pow(((2.0 * n) * (U * t)), 0.5);
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if U <= -2.1e+109: tmp = math.sqrt((((2.0 * n) * U) * t)) else: tmp = math.pow(((2.0 * n) * (U * t)), 0.5) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U <= -2.1e+109) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t)); else tmp = Float64(Float64(2.0 * n) * Float64(U * t)) ^ 0.5; end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U <= -2.1e+109) tmp = sqrt((((2.0 * n) * U) * t)); else tmp = ((2.0 * n) * (U * t)) ^ 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[U, -2.1e+109], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[Power[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;U \leq -2.1 \cdot 10^{+109}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right)}^{0.5}\\
\end{array}
\end{array}
if U < -2.1000000000000001e109Initial program 62.4%
Taylor expanded in t around inf 55.6%
if -2.1000000000000001e109 < U Initial program 48.3%
Simplified54.0%
Taylor expanded in t around inf 34.1%
pow1/235.9%
Applied egg-rr35.9%
Final simplification38.1%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= U -1e+108) (sqrt (* (* (* 2.0 n) U) t)) (sqrt (* (* 2.0 n) (* U t)))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= -1e+108) {
tmp = sqrt((((2.0 * n) * U) * t));
} else {
tmp = sqrt(((2.0 * n) * (U * t)));
}
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 (u <= (-1d+108)) then
tmp = sqrt((((2.0d0 * n) * u) * t))
else
tmp = sqrt(((2.0d0 * n) * (u * t)))
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 (U <= -1e+108) {
tmp = Math.sqrt((((2.0 * n) * U) * t));
} else {
tmp = Math.sqrt(((2.0 * n) * (U * t)));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if U <= -1e+108: tmp = math.sqrt((((2.0 * n) * U) * t)) else: tmp = math.sqrt(((2.0 * n) * (U * t))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U <= -1e+108) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t)); else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U <= -1e+108) tmp = sqrt((((2.0 * n) * U) * t)); else tmp = sqrt(((2.0 * n) * (U * t))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U, -1e+108], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;U \leq -1 \cdot 10^{+108}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t\right)}\\
\end{array}
\end{array}
if U < -1e108Initial program 62.4%
Taylor expanded in t around inf 55.6%
if -1e108 < U Initial program 48.3%
Simplified54.0%
Taylor expanded in t around inf 34.1%
Final simplification36.4%
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(Float64(2.0 * 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[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l = |l|\\
\\
\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t\right)}
\end{array}
Initial program 49.9%
Simplified53.0%
Taylor expanded in t around inf 34.2%
Final simplification34.2%
herbie shell --seed 2023238
(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*))))))