
(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 18 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}
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (/ (pow l_m 2.0) Om))
(t_2 (sqrt (fabs n)))
(t_3 (sqrt (* (fabs U) 2.0))))
(if (<= l_m 1e-6)
(*
t_2
(*
t_3
(sqrt
(fabs (- t (fma (- U U*) (* n (pow (/ l_m Om) 2.0)) (* 2.0 t_1)))))))
(if (<= l_m 1.2e+167)
(*
t_2
(* t_3 (sqrt (fabs (- t (* t_1 (+ 2.0 (* n (/ (- U U*) Om)))))))))
(*
(/ (* l_m (sqrt 2.0)) Om)
(sqrt (* U (* n (+ (* Om -2.0) (* n U*))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = pow(l_m, 2.0) / Om;
double t_2 = sqrt(fabs(n));
double t_3 = sqrt((fabs(U) * 2.0));
double tmp;
if (l_m <= 1e-6) {
tmp = t_2 * (t_3 * sqrt(fabs((t - fma((U - U_42_), (n * pow((l_m / Om), 2.0)), (2.0 * t_1))))));
} else if (l_m <= 1.2e+167) {
tmp = t_2 * (t_3 * sqrt(fabs((t - (t_1 * (2.0 + (n * ((U - U_42_) / Om))))))));
} else {
tmp = ((l_m * sqrt(2.0)) / Om) * sqrt((U * (n * ((Om * -2.0) + (n * U_42_)))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64((l_m ^ 2.0) / Om) t_2 = sqrt(abs(n)) t_3 = sqrt(Float64(abs(U) * 2.0)) tmp = 0.0 if (l_m <= 1e-6) tmp = Float64(t_2 * Float64(t_3 * sqrt(abs(Float64(t - fma(Float64(U - U_42_), Float64(n * (Float64(l_m / Om) ^ 2.0)), Float64(2.0 * t_1))))))); elseif (l_m <= 1.2e+167) tmp = Float64(t_2 * Float64(t_3 * sqrt(abs(Float64(t - Float64(t_1 * Float64(2.0 + Float64(n * Float64(Float64(U - U_42_) / Om))))))))); else tmp = Float64(Float64(Float64(l_m * sqrt(2.0)) / Om) * sqrt(Float64(U * Float64(n * Float64(Float64(Om * -2.0) + Float64(n * U_42_)))))); end return tmp end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[Abs[n], $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(N[Abs[U], $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l$95$m, 1e-6], N[(t$95$2 * N[(t$95$3 * N[Sqrt[N[Abs[N[(t - N[(N[(U - U$42$), $MachinePrecision] * N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 1.2e+167], N[(t$95$2 * N[(t$95$3 * N[Sqrt[N[Abs[N[(t - N[(t$95$1 * N[(2.0 + N[(n * N[(N[(U - U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(Om * -2.0), $MachinePrecision] + N[(n * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \frac{{l\_m}^{2}}{Om}\\
t_2 := \sqrt{\left|n\right|}\\
t_3 := \sqrt{\left|U\right| \cdot 2}\\
\mathbf{if}\;l\_m \leq 10^{-6}:\\
\;\;\;\;t\_2 \cdot \left(t\_3 \cdot \sqrt{\left|t - \mathsf{fma}\left(U - U*, n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}, 2 \cdot t\_1\right)\right|}\right)\\
\mathbf{elif}\;l\_m \leq 1.2 \cdot 10^{+167}:\\
\;\;\;\;t\_2 \cdot \left(t\_3 \cdot \sqrt{\left|t - t\_1 \cdot \left(2 + n \cdot \frac{U - U*}{Om}\right)\right|}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{l\_m \cdot \sqrt{2}}{Om} \cdot \sqrt{U \cdot \left(n \cdot \left(Om \cdot -2 + n \cdot U*\right)\right)}\\
\end{array}
\end{array}
if l < 9.99999999999999955e-7Initial program 54.0%
Simplified56.7%
Applied egg-rr36.2%
unpow1/236.2%
unpow236.2%
rem-sqrt-square54.7%
associate-*r*54.8%
*-commutative54.8%
associate-*r/54.8%
Simplified54.8%
pow1/254.8%
fabs-mul54.8%
unpow-prod-down64.1%
associate-*l*64.1%
Applied egg-rr64.1%
unpow1/264.1%
unpow1/264.1%
associate-*r*64.1%
Simplified64.1%
pow1/264.1%
fabs-mul64.1%
metadata-eval64.1%
unpow-prod-down75.2%
metadata-eval75.2%
metadata-eval75.2%
Applied egg-rr75.2%
unpow1/275.2%
fabs-mul75.2%
metadata-eval75.2%
unpow1/275.2%
fabs-sub75.2%
Simplified75.2%
if 9.99999999999999955e-7 < l < 1.19999999999999999e167Initial program 39.7%
Simplified35.9%
Applied egg-rr25.8%
unpow1/225.8%
unpow225.8%
rem-sqrt-square40.0%
associate-*r*40.0%
*-commutative40.0%
associate-*r/40.0%
Simplified40.0%
pow1/240.0%
fabs-mul40.0%
unpow-prod-down53.8%
associate-*l*53.8%
Applied egg-rr53.8%
unpow1/253.8%
unpow1/253.8%
associate-*r*53.8%
Simplified53.8%
pow1/253.8%
fabs-mul53.8%
metadata-eval53.8%
unpow-prod-down67.5%
metadata-eval67.5%
metadata-eval67.5%
Applied egg-rr67.5%
unpow1/267.5%
fabs-mul67.5%
metadata-eval67.5%
unpow1/267.5%
fabs-sub67.5%
Simplified67.5%
Taylor expanded in U around -inf 52.7%
Simplified85.9%
if 1.19999999999999999e167 < l Initial program 6.7%
Simplified31.5%
Taylor expanded in Om around 0 5.0%
Taylor expanded in l around inf 41.0%
Taylor expanded in U around 0 45.6%
Final simplification74.0%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (/ (pow l_m 2.0) Om)))
(t_2 (* n (pow (/ l_m Om) 2.0)))
(t_3 (* t_2 (- U* U)))
(t_4 (* (* U (* n 2.0)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_3)))
(t_5 (sqrt (fabs n))))
(if (<= t_4 0.0)
(* t_5 (sqrt (fabs (* (* U 2.0) (- t t_1)))))
(if (<= t_4 1e+307)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_3 (* 2.0 (* l_m (/ l_m Om)))))))
(if (<= t_4 INFINITY)
(* t_5 (sqrt (fabs (* (* U 2.0) (- (+ t_1 (* (- U U*) t_2)) t)))))
(/
(*
(* l_m (sqrt 2.0))
(sqrt (* n (+ (* -2.0 (* U Om)) (* (- U* U) (* n U))))))
Om))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = 2.0 * (pow(l_m, 2.0) / Om);
double t_2 = n * pow((l_m / Om), 2.0);
double t_3 = t_2 * (U_42_ - U);
double t_4 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_3);
double t_5 = sqrt(fabs(n));
double tmp;
if (t_4 <= 0.0) {
tmp = t_5 * sqrt(fabs(((U * 2.0) * (t - t_1))));
} else if (t_4 <= 1e+307) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_3 - (2.0 * (l_m * (l_m / Om)))))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = t_5 * sqrt(fabs(((U * 2.0) * ((t_1 + ((U - U_42_) * t_2)) - t))));
} else {
tmp = ((l_m * sqrt(2.0)) * sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om;
}
return tmp;
}
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = 2.0 * (Math.pow(l_m, 2.0) / Om);
double t_2 = n * Math.pow((l_m / Om), 2.0);
double t_3 = t_2 * (U_42_ - U);
double t_4 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_3);
double t_5 = Math.sqrt(Math.abs(n));
double tmp;
if (t_4 <= 0.0) {
tmp = t_5 * Math.sqrt(Math.abs(((U * 2.0) * (t - t_1))));
} else if (t_4 <= 1e+307) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_3 - (2.0 * (l_m * (l_m / Om)))))));
} else if (t_4 <= Double.POSITIVE_INFINITY) {
tmp = t_5 * Math.sqrt(Math.abs(((U * 2.0) * ((t_1 + ((U - U_42_) * t_2)) - t))));
} else {
tmp = ((l_m * Math.sqrt(2.0)) * Math.sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om;
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = 2.0 * (math.pow(l_m, 2.0) / Om) t_2 = n * math.pow((l_m / Om), 2.0) t_3 = t_2 * (U_42_ - U) t_4 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_3) t_5 = math.sqrt(math.fabs(n)) tmp = 0 if t_4 <= 0.0: tmp = t_5 * math.sqrt(math.fabs(((U * 2.0) * (t - t_1)))) elif t_4 <= 1e+307: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_3 - (2.0 * (l_m * (l_m / Om))))))) elif t_4 <= math.inf: tmp = t_5 * math.sqrt(math.fabs(((U * 2.0) * ((t_1 + ((U - U_42_) * t_2)) - t)))) else: tmp = ((l_m * math.sqrt(2.0)) * math.sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(2.0 * Float64((l_m ^ 2.0) / Om)) t_2 = Float64(n * (Float64(l_m / Om) ^ 2.0)) t_3 = Float64(t_2 * Float64(U_42_ - U)) t_4 = Float64(Float64(U * Float64(n * 2.0)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_3)) t_5 = sqrt(abs(n)) tmp = 0.0 if (t_4 <= 0.0) tmp = Float64(t_5 * sqrt(abs(Float64(Float64(U * 2.0) * Float64(t - t_1))))); elseif (t_4 <= 1e+307) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_3 - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); elseif (t_4 <= Inf) tmp = Float64(t_5 * sqrt(abs(Float64(Float64(U * 2.0) * Float64(Float64(t_1 + Float64(Float64(U - U_42_) * t_2)) - t))))); else tmp = Float64(Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(n * Float64(Float64(-2.0 * Float64(U * Om)) + Float64(Float64(U_42_ - U) * Float64(n * U)))))) / Om); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = 2.0 * ((l_m ^ 2.0) / Om); t_2 = n * ((l_m / Om) ^ 2.0); t_3 = t_2 * (U_42_ - U); t_4 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_3); t_5 = sqrt(abs(n)); tmp = 0.0; if (t_4 <= 0.0) tmp = t_5 * sqrt(abs(((U * 2.0) * (t - t_1)))); elseif (t_4 <= 1e+307) tmp = sqrt(((2.0 * (n * U)) * (t + (t_3 - (2.0 * (l_m * (l_m / Om))))))); elseif (t_4 <= Inf) tmp = t_5 * sqrt(abs(((U * 2.0) * ((t_1 + ((U - U_42_) * t_2)) - t)))); else tmp = ((l_m * sqrt(2.0)) * sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om; end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[Abs[n], $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$4, 0.0], N[(t$95$5 * N[Sqrt[N[Abs[N[(N[(U * 2.0), $MachinePrecision] * N[(t - t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 1e+307], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$3 - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(t$95$5 * N[Sqrt[N[Abs[N[(N[(U * 2.0), $MachinePrecision] * N[(N[(t$95$1 + N[(N[(U - U$42$), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(n * N[(N[(-2.0 * N[(U * Om), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]]]]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := 2 \cdot \frac{{l\_m}^{2}}{Om}\\
t_2 := n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\\
t_3 := t\_2 \cdot \left(U* - U\right)\\
t_4 := \left(U \cdot \left(n \cdot 2\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_3\right)\\
t_5 := \sqrt{\left|n\right|}\\
\mathbf{if}\;t\_4 \leq 0:\\
\;\;\;\;t\_5 \cdot \sqrt{\left|\left(U \cdot 2\right) \cdot \left(t - t\_1\right)\right|}\\
\mathbf{elif}\;t\_4 \leq 10^{+307}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_3 - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;t\_5 \cdot \sqrt{\left|\left(U \cdot 2\right) \cdot \left(\left(t\_1 + \left(U - U*\right) \cdot t\_2\right) - t\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{n \cdot \left(-2 \cdot \left(U \cdot Om\right) + \left(U* - U\right) \cdot \left(n \cdot U\right)\right)}}{Om}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 15.0%
Simplified43.5%
Applied egg-rr26.9%
unpow1/226.9%
unpow226.9%
rem-sqrt-square46.4%
associate-*r*46.4%
*-commutative46.4%
associate-*r/46.4%
Simplified46.4%
pow1/246.4%
fabs-mul46.4%
unpow-prod-down70.2%
associate-*l*70.2%
Applied egg-rr70.2%
unpow1/270.2%
unpow1/270.2%
associate-*r*70.2%
Simplified70.2%
Taylor expanded in n around 0 74.6%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 9.99999999999999986e306Initial program 98.1%
Simplified98.1%
if 9.99999999999999986e306 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 29.0%
Simplified39.3%
Applied egg-rr29.0%
unpow1/229.0%
unpow229.0%
rem-sqrt-square31.6%
associate-*r*31.6%
*-commutative31.6%
associate-*r/31.6%
Simplified31.6%
pow1/231.6%
fabs-mul31.6%
unpow-prod-down49.6%
associate-*l*49.6%
Applied egg-rr49.6%
unpow1/249.6%
unpow1/249.6%
associate-*r*49.6%
Simplified49.6%
fma-undefine49.6%
Applied egg-rr49.6%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
Simplified12.2%
Taylor expanded in Om around 0 5.4%
Taylor expanded in l around inf 35.9%
associate-*l/34.1%
fma-define34.1%
mul-1-neg34.1%
fmm-undef34.1%
*-commutative34.1%
associate-*r*34.1%
Applied egg-rr34.1%
Final simplification70.2%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (sqrt (fabs n)))
(t_2 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_3 (* (* U (* n 2.0)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_2)))
(t_4 (/ (pow l_m 2.0) Om)))
(if (<= t_3 0.0)
(* t_1 (sqrt (fabs (* (* U 2.0) (- t (* 2.0 t_4))))))
(if (<= t_3 1e+307)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_2 (* 2.0 (* l_m (/ l_m Om)))))))
(*
t_1
(sqrt
(*
(* (fabs U) 2.0)
(fabs (- (* t_4 (+ 2.0 (* n (/ (- U U*) Om)))) t)))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = sqrt(fabs(n));
double t_2 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_3 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double t_4 = pow(l_m, 2.0) / Om;
double tmp;
if (t_3 <= 0.0) {
tmp = t_1 * sqrt(fabs(((U * 2.0) * (t - (2.0 * t_4)))));
} else if (t_3 <= 1e+307) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = t_1 * sqrt(((fabs(U) * 2.0) * fabs(((t_4 * (2.0 + (n * ((U - U_42_) / Om)))) - t))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: tmp
t_1 = sqrt(abs(n))
t_2 = (n * ((l_m / om) ** 2.0d0)) * (u_42 - u)
t_3 = (u * (n * 2.0d0)) * ((t - (2.0d0 * ((l_m * l_m) / om))) + t_2)
t_4 = (l_m ** 2.0d0) / om
if (t_3 <= 0.0d0) then
tmp = t_1 * sqrt(abs(((u * 2.0d0) * (t - (2.0d0 * t_4)))))
else if (t_3 <= 1d+307) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (t_2 - (2.0d0 * (l_m * (l_m / om)))))))
else
tmp = t_1 * sqrt(((abs(u) * 2.0d0) * abs(((t_4 * (2.0d0 + (n * ((u - u_42) / om)))) - t))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = Math.sqrt(Math.abs(n));
double t_2 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_3 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double t_4 = Math.pow(l_m, 2.0) / Om;
double tmp;
if (t_3 <= 0.0) {
tmp = t_1 * Math.sqrt(Math.abs(((U * 2.0) * (t - (2.0 * t_4)))));
} else if (t_3 <= 1e+307) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = t_1 * Math.sqrt(((Math.abs(U) * 2.0) * Math.abs(((t_4 * (2.0 + (n * ((U - U_42_) / Om)))) - t))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = math.sqrt(math.fabs(n)) t_2 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_3 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2) t_4 = math.pow(l_m, 2.0) / Om tmp = 0 if t_3 <= 0.0: tmp = t_1 * math.sqrt(math.fabs(((U * 2.0) * (t - (2.0 * t_4))))) elif t_3 <= 1e+307: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l_m * (l_m / Om))))))) else: tmp = t_1 * math.sqrt(((math.fabs(U) * 2.0) * math.fabs(((t_4 * (2.0 + (n * ((U - U_42_) / Om)))) - t)))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = sqrt(abs(n)) t_2 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = Float64(Float64(U * Float64(n * 2.0)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_2)) t_4 = Float64((l_m ^ 2.0) / Om) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(t_1 * sqrt(abs(Float64(Float64(U * 2.0) * Float64(t - Float64(2.0 * t_4)))))); elseif (t_3 <= 1e+307) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_2 - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); else tmp = Float64(t_1 * sqrt(Float64(Float64(abs(U) * 2.0) * abs(Float64(Float64(t_4 * Float64(2.0 + Float64(n * Float64(Float64(U - U_42_) / Om)))) - t))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = sqrt(abs(n)); t_2 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_3 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2); t_4 = (l_m ^ 2.0) / Om; tmp = 0.0; if (t_3 <= 0.0) tmp = t_1 * sqrt(abs(((U * 2.0) * (t - (2.0 * t_4))))); elseif (t_3 <= 1e+307) tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l_m * (l_m / Om))))))); else tmp = t_1 * sqrt(((abs(U) * 2.0) * abs(((t_4 * (2.0 + (n * ((U - U_42_) / Om)))) - t)))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[Abs[n], $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[(t$95$1 * N[Sqrt[N[Abs[N[(N[(U * 2.0), $MachinePrecision] * N[(t - N[(2.0 * t$95$4), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 1e+307], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$2 - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(t$95$1 * N[Sqrt[N[(N[(N[Abs[U], $MachinePrecision] * 2.0), $MachinePrecision] * N[Abs[N[(N[(t$95$4 * N[(2.0 + N[(n * N[(N[(U - U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \sqrt{\left|n\right|}\\
t_2 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_3 := \left(U \cdot \left(n \cdot 2\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_2\right)\\
t_4 := \frac{{l\_m}^{2}}{Om}\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;t\_1 \cdot \sqrt{\left|\left(U \cdot 2\right) \cdot \left(t - 2 \cdot t\_4\right)\right|}\\
\mathbf{elif}\;t\_3 \leq 10^{+307}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_2 - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \sqrt{\left(\left|U\right| \cdot 2\right) \cdot \left|t\_4 \cdot \left(2 + n \cdot \frac{U - U*}{Om}\right) - t\right|}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 15.0%
Simplified43.5%
Applied egg-rr26.9%
unpow1/226.9%
unpow226.9%
rem-sqrt-square46.4%
associate-*r*46.4%
*-commutative46.4%
associate-*r/46.4%
Simplified46.4%
pow1/246.4%
fabs-mul46.4%
unpow-prod-down70.2%
associate-*l*70.2%
Applied egg-rr70.2%
unpow1/270.2%
unpow1/270.2%
associate-*r*70.2%
Simplified70.2%
Taylor expanded in n around 0 74.6%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 9.99999999999999986e306Initial program 98.1%
Simplified98.1%
if 9.99999999999999986e306 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 18.8%
Simplified29.7%
Applied egg-rr19.1%
unpow1/219.1%
unpow219.1%
rem-sqrt-square20.8%
associate-*r*20.8%
*-commutative20.8%
associate-*r/20.8%
Simplified20.8%
pow1/220.8%
fabs-mul20.8%
unpow-prod-down32.4%
associate-*l*32.4%
Applied egg-rr32.4%
unpow1/232.4%
unpow1/232.4%
associate-*r*32.4%
Simplified32.4%
pow1/232.4%
fabs-mul32.4%
metadata-eval32.4%
unpow-prod-down39.7%
metadata-eval39.7%
metadata-eval39.7%
Applied egg-rr39.7%
unpow1/239.7%
fabs-mul39.7%
metadata-eval39.7%
unpow1/239.7%
fabs-sub39.7%
Simplified39.7%
pow139.7%
sqrt-unprod32.4%
fabs-sub32.4%
Applied egg-rr32.4%
Simplified39.3%
Final simplification68.1%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (/ (pow l_m 2.0) Om))
(t_2 (sqrt (fabs n)))
(t_3 (sqrt (* (fabs U) 2.0))))
(if (<= l_m 1.02e-127)
(* t_2 (* t_3 (sqrt (fabs (- t (* 2.0 t_1))))))
(if (<= l_m 4.4e+166)
(*
t_2
(* t_3 (sqrt (fabs (- t (* t_1 (+ 2.0 (* n (/ (- U U*) Om)))))))))
(*
(/ (* l_m (sqrt 2.0)) Om)
(sqrt (* U (* n (+ (* Om -2.0) (* n U*))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = pow(l_m, 2.0) / Om;
double t_2 = sqrt(fabs(n));
double t_3 = sqrt((fabs(U) * 2.0));
double tmp;
if (l_m <= 1.02e-127) {
tmp = t_2 * (t_3 * sqrt(fabs((t - (2.0 * t_1)))));
} else if (l_m <= 4.4e+166) {
tmp = t_2 * (t_3 * sqrt(fabs((t - (t_1 * (2.0 + (n * ((U - U_42_) / Om))))))));
} else {
tmp = ((l_m * sqrt(2.0)) / Om) * sqrt((U * (n * ((Om * -2.0) + (n * U_42_)))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = (l_m ** 2.0d0) / om
t_2 = sqrt(abs(n))
t_3 = sqrt((abs(u) * 2.0d0))
if (l_m <= 1.02d-127) then
tmp = t_2 * (t_3 * sqrt(abs((t - (2.0d0 * t_1)))))
else if (l_m <= 4.4d+166) then
tmp = t_2 * (t_3 * sqrt(abs((t - (t_1 * (2.0d0 + (n * ((u - u_42) / om))))))))
else
tmp = ((l_m * sqrt(2.0d0)) / om) * sqrt((u * (n * ((om * (-2.0d0)) + (n * u_42)))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = Math.pow(l_m, 2.0) / Om;
double t_2 = Math.sqrt(Math.abs(n));
double t_3 = Math.sqrt((Math.abs(U) * 2.0));
double tmp;
if (l_m <= 1.02e-127) {
tmp = t_2 * (t_3 * Math.sqrt(Math.abs((t - (2.0 * t_1)))));
} else if (l_m <= 4.4e+166) {
tmp = t_2 * (t_3 * Math.sqrt(Math.abs((t - (t_1 * (2.0 + (n * ((U - U_42_) / Om))))))));
} else {
tmp = ((l_m * Math.sqrt(2.0)) / Om) * Math.sqrt((U * (n * ((Om * -2.0) + (n * U_42_)))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = math.pow(l_m, 2.0) / Om t_2 = math.sqrt(math.fabs(n)) t_3 = math.sqrt((math.fabs(U) * 2.0)) tmp = 0 if l_m <= 1.02e-127: tmp = t_2 * (t_3 * math.sqrt(math.fabs((t - (2.0 * t_1))))) elif l_m <= 4.4e+166: tmp = t_2 * (t_3 * math.sqrt(math.fabs((t - (t_1 * (2.0 + (n * ((U - U_42_) / Om)))))))) else: tmp = ((l_m * math.sqrt(2.0)) / Om) * math.sqrt((U * (n * ((Om * -2.0) + (n * U_42_))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64((l_m ^ 2.0) / Om) t_2 = sqrt(abs(n)) t_3 = sqrt(Float64(abs(U) * 2.0)) tmp = 0.0 if (l_m <= 1.02e-127) tmp = Float64(t_2 * Float64(t_3 * sqrt(abs(Float64(t - Float64(2.0 * t_1)))))); elseif (l_m <= 4.4e+166) tmp = Float64(t_2 * Float64(t_3 * sqrt(abs(Float64(t - Float64(t_1 * Float64(2.0 + Float64(n * Float64(Float64(U - U_42_) / Om))))))))); else tmp = Float64(Float64(Float64(l_m * sqrt(2.0)) / Om) * sqrt(Float64(U * Float64(n * Float64(Float64(Om * -2.0) + Float64(n * U_42_)))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (l_m ^ 2.0) / Om; t_2 = sqrt(abs(n)); t_3 = sqrt((abs(U) * 2.0)); tmp = 0.0; if (l_m <= 1.02e-127) tmp = t_2 * (t_3 * sqrt(abs((t - (2.0 * t_1))))); elseif (l_m <= 4.4e+166) tmp = t_2 * (t_3 * sqrt(abs((t - (t_1 * (2.0 + (n * ((U - U_42_) / Om)))))))); else tmp = ((l_m * sqrt(2.0)) / Om) * sqrt((U * (n * ((Om * -2.0) + (n * U_42_))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[Abs[n], $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(N[Abs[U], $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l$95$m, 1.02e-127], N[(t$95$2 * N[(t$95$3 * N[Sqrt[N[Abs[N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 4.4e+166], N[(t$95$2 * N[(t$95$3 * N[Sqrt[N[Abs[N[(t - N[(t$95$1 * N[(2.0 + N[(n * N[(N[(U - U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(Om * -2.0), $MachinePrecision] + N[(n * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \frac{{l\_m}^{2}}{Om}\\
t_2 := \sqrt{\left|n\right|}\\
t_3 := \sqrt{\left|U\right| \cdot 2}\\
\mathbf{if}\;l\_m \leq 1.02 \cdot 10^{-127}:\\
\;\;\;\;t\_2 \cdot \left(t\_3 \cdot \sqrt{\left|t - 2 \cdot t\_1\right|}\right)\\
\mathbf{elif}\;l\_m \leq 4.4 \cdot 10^{+166}:\\
\;\;\;\;t\_2 \cdot \left(t\_3 \cdot \sqrt{\left|t - t\_1 \cdot \left(2 + n \cdot \frac{U - U*}{Om}\right)\right|}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{l\_m \cdot \sqrt{2}}{Om} \cdot \sqrt{U \cdot \left(n \cdot \left(Om \cdot -2 + n \cdot U*\right)\right)}\\
\end{array}
\end{array}
if l < 1.02000000000000008e-127Initial program 54.4%
Simplified56.4%
Applied egg-rr35.3%
unpow1/235.3%
unpow235.3%
rem-sqrt-square53.7%
associate-*r*53.7%
*-commutative53.7%
associate-*r/53.7%
Simplified53.7%
pow1/253.7%
fabs-mul53.7%
unpow-prod-down63.0%
associate-*l*63.0%
Applied egg-rr63.0%
unpow1/263.0%
unpow1/263.0%
associate-*r*63.0%
Simplified63.0%
pow1/263.0%
fabs-mul63.0%
metadata-eval63.0%
unpow-prod-down73.8%
metadata-eval73.8%
metadata-eval73.8%
Applied egg-rr73.8%
unpow1/273.8%
fabs-mul73.8%
metadata-eval73.8%
unpow1/273.8%
fabs-sub73.8%
Simplified73.8%
Taylor expanded in n around 0 66.8%
if 1.02000000000000008e-127 < l < 4.3999999999999998e166Initial program 44.0%
Simplified46.0%
Applied egg-rr33.8%
unpow1/233.8%
unpow233.8%
rem-sqrt-square50.4%
associate-*r*50.4%
*-commutative50.4%
associate-*r/50.4%
Simplified50.4%
pow1/250.4%
fabs-mul50.4%
unpow-prod-down62.4%
associate-*l*62.4%
Applied egg-rr62.4%
unpow1/262.4%
unpow1/262.4%
associate-*r*62.4%
Simplified62.4%
pow1/262.4%
fabs-mul62.4%
metadata-eval62.4%
unpow-prod-down76.6%
metadata-eval76.6%
metadata-eval76.6%
Applied egg-rr76.6%
unpow1/276.6%
fabs-mul76.6%
metadata-eval76.6%
unpow1/276.6%
fabs-sub76.6%
Simplified76.6%
Taylor expanded in U around -inf 61.5%
Simplified83.3%
if 4.3999999999999998e166 < l Initial program 6.7%
Simplified31.5%
Taylor expanded in Om around 0 5.0%
Taylor expanded in l around inf 41.0%
Taylor expanded in U around 0 45.6%
Final simplification68.1%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (/ (pow l_m 2.0) Om)))
(t_2 (sqrt (fabs n)))
(t_3 (* t_2 (* (sqrt (* (fabs U) 2.0)) (sqrt (fabs (- t t_1)))))))
(if (<= l_m 1.7e-78)
t_3
(if (<= l_m 2.65e+76)
(*
t_2
(sqrt
(fabs
(*
(* U 2.0)
(- (+ t_1 (* (- U U*) (* n (pow (/ l_m Om) 2.0)))) t)))))
(if (<= l_m 1.2e+165)
t_3
(*
(/ (* l_m (sqrt 2.0)) Om)
(sqrt (* U (* n (+ (* Om -2.0) (* n U*)))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = 2.0 * (pow(l_m, 2.0) / Om);
double t_2 = sqrt(fabs(n));
double t_3 = t_2 * (sqrt((fabs(U) * 2.0)) * sqrt(fabs((t - t_1))));
double tmp;
if (l_m <= 1.7e-78) {
tmp = t_3;
} else if (l_m <= 2.65e+76) {
tmp = t_2 * sqrt(fabs(((U * 2.0) * ((t_1 + ((U - U_42_) * (n * pow((l_m / Om), 2.0)))) - t))));
} else if (l_m <= 1.2e+165) {
tmp = t_3;
} else {
tmp = ((l_m * sqrt(2.0)) / Om) * sqrt((U * (n * ((Om * -2.0) + (n * U_42_)))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = 2.0d0 * ((l_m ** 2.0d0) / om)
t_2 = sqrt(abs(n))
t_3 = t_2 * (sqrt((abs(u) * 2.0d0)) * sqrt(abs((t - t_1))))
if (l_m <= 1.7d-78) then
tmp = t_3
else if (l_m <= 2.65d+76) then
tmp = t_2 * sqrt(abs(((u * 2.0d0) * ((t_1 + ((u - u_42) * (n * ((l_m / om) ** 2.0d0)))) - t))))
else if (l_m <= 1.2d+165) then
tmp = t_3
else
tmp = ((l_m * sqrt(2.0d0)) / om) * sqrt((u * (n * ((om * (-2.0d0)) + (n * u_42)))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = 2.0 * (Math.pow(l_m, 2.0) / Om);
double t_2 = Math.sqrt(Math.abs(n));
double t_3 = t_2 * (Math.sqrt((Math.abs(U) * 2.0)) * Math.sqrt(Math.abs((t - t_1))));
double tmp;
if (l_m <= 1.7e-78) {
tmp = t_3;
} else if (l_m <= 2.65e+76) {
tmp = t_2 * Math.sqrt(Math.abs(((U * 2.0) * ((t_1 + ((U - U_42_) * (n * Math.pow((l_m / Om), 2.0)))) - t))));
} else if (l_m <= 1.2e+165) {
tmp = t_3;
} else {
tmp = ((l_m * Math.sqrt(2.0)) / Om) * Math.sqrt((U * (n * ((Om * -2.0) + (n * U_42_)))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = 2.0 * (math.pow(l_m, 2.0) / Om) t_2 = math.sqrt(math.fabs(n)) t_3 = t_2 * (math.sqrt((math.fabs(U) * 2.0)) * math.sqrt(math.fabs((t - t_1)))) tmp = 0 if l_m <= 1.7e-78: tmp = t_3 elif l_m <= 2.65e+76: tmp = t_2 * math.sqrt(math.fabs(((U * 2.0) * ((t_1 + ((U - U_42_) * (n * math.pow((l_m / Om), 2.0)))) - t)))) elif l_m <= 1.2e+165: tmp = t_3 else: tmp = ((l_m * math.sqrt(2.0)) / Om) * math.sqrt((U * (n * ((Om * -2.0) + (n * U_42_))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(2.0 * Float64((l_m ^ 2.0) / Om)) t_2 = sqrt(abs(n)) t_3 = Float64(t_2 * Float64(sqrt(Float64(abs(U) * 2.0)) * sqrt(abs(Float64(t - t_1))))) tmp = 0.0 if (l_m <= 1.7e-78) tmp = t_3; elseif (l_m <= 2.65e+76) tmp = Float64(t_2 * sqrt(abs(Float64(Float64(U * 2.0) * Float64(Float64(t_1 + Float64(Float64(U - U_42_) * Float64(n * (Float64(l_m / Om) ^ 2.0)))) - t))))); elseif (l_m <= 1.2e+165) tmp = t_3; else tmp = Float64(Float64(Float64(l_m * sqrt(2.0)) / Om) * sqrt(Float64(U * Float64(n * Float64(Float64(Om * -2.0) + Float64(n * U_42_)))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = 2.0 * ((l_m ^ 2.0) / Om); t_2 = sqrt(abs(n)); t_3 = t_2 * (sqrt((abs(U) * 2.0)) * sqrt(abs((t - t_1)))); tmp = 0.0; if (l_m <= 1.7e-78) tmp = t_3; elseif (l_m <= 2.65e+76) tmp = t_2 * sqrt(abs(((U * 2.0) * ((t_1 + ((U - U_42_) * (n * ((l_m / Om) ^ 2.0)))) - t)))); elseif (l_m <= 1.2e+165) tmp = t_3; else tmp = ((l_m * sqrt(2.0)) / Om) * sqrt((U * (n * ((Om * -2.0) + (n * U_42_))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[Abs[n], $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[(N[Sqrt[N[(N[Abs[U], $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[N[(t - t$95$1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l$95$m, 1.7e-78], t$95$3, If[LessEqual[l$95$m, 2.65e+76], N[(t$95$2 * N[Sqrt[N[Abs[N[(N[(U * 2.0), $MachinePrecision] * N[(N[(t$95$1 + N[(N[(U - U$42$), $MachinePrecision] * N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 1.2e+165], t$95$3, N[(N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(Om * -2.0), $MachinePrecision] + N[(n * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := 2 \cdot \frac{{l\_m}^{2}}{Om}\\
t_2 := \sqrt{\left|n\right|}\\
t_3 := t\_2 \cdot \left(\sqrt{\left|U\right| \cdot 2} \cdot \sqrt{\left|t - t\_1\right|}\right)\\
\mathbf{if}\;l\_m \leq 1.7 \cdot 10^{-78}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;l\_m \leq 2.65 \cdot 10^{+76}:\\
\;\;\;\;t\_2 \cdot \sqrt{\left|\left(U \cdot 2\right) \cdot \left(\left(t\_1 + \left(U - U*\right) \cdot \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right)\right) - t\right)\right|}\\
\mathbf{elif}\;l\_m \leq 1.2 \cdot 10^{+165}:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{l\_m \cdot \sqrt{2}}{Om} \cdot \sqrt{U \cdot \left(n \cdot \left(Om \cdot -2 + n \cdot U*\right)\right)}\\
\end{array}
\end{array}
if l < 1.70000000000000006e-78 or 2.65000000000000008e76 < l < 1.2e165Initial program 52.8%
Simplified54.5%
Applied egg-rr33.7%
unpow1/233.7%
unpow233.7%
rem-sqrt-square52.6%
associate-*r*52.7%
*-commutative52.7%
associate-*r/52.7%
Simplified52.7%
pow1/252.7%
fabs-mul52.7%
unpow-prod-down61.5%
associate-*l*61.5%
Applied egg-rr61.5%
unpow1/261.5%
unpow1/261.5%
associate-*r*61.5%
Simplified61.5%
pow1/261.5%
fabs-mul61.5%
metadata-eval61.5%
unpow-prod-down73.0%
metadata-eval73.0%
metadata-eval73.0%
Applied egg-rr73.0%
unpow1/273.0%
fabs-mul73.0%
metadata-eval73.0%
unpow1/273.0%
fabs-sub73.0%
Simplified73.0%
Taylor expanded in n around 0 68.5%
if 1.70000000000000006e-78 < l < 2.65000000000000008e76Initial program 49.2%
Simplified52.7%
Applied egg-rr45.6%
unpow1/245.6%
unpow245.6%
rem-sqrt-square56.5%
associate-*r*56.5%
*-commutative56.5%
associate-*r/56.5%
Simplified56.5%
pow1/256.5%
fabs-mul56.5%
unpow-prod-down74.2%
associate-*l*74.2%
Applied egg-rr74.2%
unpow1/274.2%
unpow1/274.2%
associate-*r*74.2%
Simplified74.2%
fma-undefine74.2%
Applied egg-rr74.2%
if 1.2e165 < l Initial program 6.7%
Simplified31.5%
Taylor expanded in Om around 0 5.0%
Taylor expanded in l around inf 41.0%
Taylor expanded in U around 0 45.6%
Final simplification67.3%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_2
(sqrt (* (* U (* n 2.0)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1)))))
(if (<= t_2 0.0)
(* (sqrt (fabs n)) (sqrt (fabs (* 2.0 (* U t)))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 (* 2.0 (* l_m (/ l_m Om)))))))
(/
(*
(* l_m (sqrt 2.0))
(sqrt (* n (+ (* -2.0 (* U Om)) (* (- U* U) (* n U))))))
Om)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = sqrt(((U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1)));
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt(fabs(n)) * sqrt(fabs((2.0 * (U * t))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = ((l_m * sqrt(2.0)) * sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om;
}
return tmp;
}
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = Math.sqrt(((U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1)));
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt(Math.abs(n)) * Math.sqrt(Math.abs((2.0 * (U * t))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = ((l_m * Math.sqrt(2.0)) * Math.sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om;
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_2 = math.sqrt(((U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1))) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt(math.fabs(n)) * math.sqrt(math.fabs((2.0 * (U * t)))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om))))))) else: tmp = ((l_m * math.sqrt(2.0)) * math.sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = sqrt(Float64(Float64(U * Float64(n * 2.0)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_1))) tmp = 0.0 if (t_2 <= 0.0) tmp = Float64(sqrt(abs(n)) * sqrt(abs(Float64(2.0 * Float64(U * t))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_1 - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); else tmp = Float64(Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(n * Float64(Float64(-2.0 * Float64(U * Om)) + Float64(Float64(U_42_ - U) * Float64(n * U)))))) / Om); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_2 = sqrt(((U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1))); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt(abs(n)) * sqrt(abs((2.0 * (U * t)))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om))))))); else tmp = ((l_m * sqrt(2.0)) * sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om; end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[Abs[n], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[N[(2.0 * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$1 - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(n * N[(N[(-2.0 * N[(U * Om), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \sqrt{\left(U \cdot \left(n \cdot 2\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1\right)}\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\left|n\right|} \cdot \sqrt{\left|2 \cdot \left(U \cdot t\right)\right|}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_1 - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{n \cdot \left(-2 \cdot \left(U \cdot Om\right) + \left(U* - U\right) \cdot \left(n \cdot U\right)\right)}}{Om}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 17.9%
Simplified51.4%
Applied egg-rr30.9%
unpow1/230.9%
unpow230.9%
rem-sqrt-square54.1%
associate-*r*54.1%
*-commutative54.1%
associate-*r/54.1%
Simplified54.1%
pow1/254.1%
fabs-mul54.1%
unpow-prod-down82.5%
associate-*l*82.5%
Applied egg-rr82.5%
unpow1/282.5%
unpow1/282.5%
associate-*r*82.5%
Simplified82.5%
Taylor expanded in t around inf 72.6%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 68.8%
Simplified73.3%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 0.0%
Simplified10.7%
Taylor expanded in Om around 0 8.9%
Taylor expanded in l around inf 32.9%
associate-*l/31.3%
fma-define31.3%
mul-1-neg31.3%
fmm-undef31.3%
*-commutative31.3%
associate-*r*31.3%
Applied egg-rr31.3%
Final simplification65.5%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_2 (* (* U (* n 2.0)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1))))
(if (<= t_2 0.0)
(*
(sqrt (fabs n))
(sqrt (fabs (* (* U 2.0) (- t (* 2.0 (/ (pow l_m 2.0) Om)))))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 (* 2.0 (* l_m (/ l_m Om)))))))
(/
(*
(* l_m (sqrt 2.0))
(sqrt (* n (+ (* -2.0 (* U Om)) (* (- U* U) (* n U))))))
Om)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt(fabs(n)) * sqrt(fabs(((U * 2.0) * (t - (2.0 * (pow(l_m, 2.0) / Om))))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = ((l_m * sqrt(2.0)) * sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om;
}
return tmp;
}
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt(Math.abs(n)) * Math.sqrt(Math.abs(((U * 2.0) * (t - (2.0 * (Math.pow(l_m, 2.0) / Om))))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = ((l_m * Math.sqrt(2.0)) * Math.sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om;
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt(math.fabs(n)) * math.sqrt(math.fabs(((U * 2.0) * (t - (2.0 * (math.pow(l_m, 2.0) / Om)))))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om))))))) else: tmp = ((l_m * math.sqrt(2.0)) * math.sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = Float64(Float64(U * Float64(n * 2.0)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_1)) tmp = 0.0 if (t_2 <= 0.0) tmp = Float64(sqrt(abs(n)) * sqrt(abs(Float64(Float64(U * 2.0) * Float64(t - Float64(2.0 * Float64((l_m ^ 2.0) / Om))))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_1 - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); else tmp = Float64(Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(n * Float64(Float64(-2.0 * Float64(U * Om)) + Float64(Float64(U_42_ - U) * Float64(n * U)))))) / Om); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt(abs(n)) * sqrt(abs(((U * 2.0) * (t - (2.0 * ((l_m ^ 2.0) / Om)))))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om))))))); else tmp = ((l_m * sqrt(2.0)) * sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om; end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[Abs[n], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[N[(N[(U * 2.0), $MachinePrecision] * N[(t - N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$1 - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(n * N[(N[(-2.0 * N[(U * Om), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \left(U \cdot \left(n \cdot 2\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1\right)\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\left|n\right|} \cdot \sqrt{\left|\left(U \cdot 2\right) \cdot \left(t - 2 \cdot \frac{{l\_m}^{2}}{Om}\right)\right|}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_1 - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{n \cdot \left(-2 \cdot \left(U \cdot Om\right) + \left(U* - U\right) \cdot \left(n \cdot U\right)\right)}}{Om}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 15.0%
Simplified43.5%
Applied egg-rr26.9%
unpow1/226.9%
unpow226.9%
rem-sqrt-square46.4%
associate-*r*46.4%
*-commutative46.4%
associate-*r/46.4%
Simplified46.4%
pow1/246.4%
fabs-mul46.4%
unpow-prod-down70.2%
associate-*l*70.2%
Applied egg-rr70.2%
unpow1/270.2%
unpow1/270.2%
associate-*r*70.2%
Simplified70.2%
Taylor expanded in n around 0 74.6%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 68.8%
Simplified73.3%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
Simplified12.2%
Taylor expanded in Om around 0 5.4%
Taylor expanded in l around inf 35.9%
associate-*l/34.1%
fma-define34.1%
mul-1-neg34.1%
fmm-undef34.1%
*-commutative34.1%
associate-*r*34.1%
Applied egg-rr34.1%
Final simplification67.4%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_2 (* (* U (* n 2.0)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1))))
(if (<= t_2 0.0)
(sqrt (fabs (* n (* (* U 2.0) (- (* 2.0 (/ (pow l_m 2.0) Om)) t)))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 (* 2.0 (* l_m (/ l_m Om)))))))
(/
(*
(* l_m (sqrt 2.0))
(sqrt (* n (+ (* -2.0 (* U Om)) (* (- U* U) (* n U))))))
Om)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt(fabs((n * ((U * 2.0) * ((2.0 * (pow(l_m, 2.0) / Om)) - t)))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = ((l_m * sqrt(2.0)) * sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om;
}
return tmp;
}
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt(Math.abs((n * ((U * 2.0) * ((2.0 * (Math.pow(l_m, 2.0) / Om)) - t)))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = ((l_m * Math.sqrt(2.0)) * Math.sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om;
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt(math.fabs((n * ((U * 2.0) * ((2.0 * (math.pow(l_m, 2.0) / Om)) - t))))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om))))))) else: tmp = ((l_m * math.sqrt(2.0)) * math.sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = Float64(Float64(U * Float64(n * 2.0)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_1)) tmp = 0.0 if (t_2 <= 0.0) tmp = sqrt(abs(Float64(n * Float64(Float64(U * 2.0) * Float64(Float64(2.0 * Float64((l_m ^ 2.0) / Om)) - t))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_1 - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); else tmp = Float64(Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(n * Float64(Float64(-2.0 * Float64(U * Om)) + Float64(Float64(U_42_ - U) * Float64(n * U)))))) / Om); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt(abs((n * ((U * 2.0) * ((2.0 * ((l_m ^ 2.0) / Om)) - t))))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om))))))); else tmp = ((l_m * sqrt(2.0)) * sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om; end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[Sqrt[N[Abs[N[(n * N[(N[(U * 2.0), $MachinePrecision] * N[(N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$1 - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(n * N[(N[(-2.0 * N[(U * Om), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \left(U \cdot \left(n \cdot 2\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1\right)\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\left|n \cdot \left(\left(U \cdot 2\right) \cdot \left(2 \cdot \frac{{l\_m}^{2}}{Om} - t\right)\right)\right|}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_1 - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{n \cdot \left(-2 \cdot \left(U \cdot Om\right) + \left(U* - U\right) \cdot \left(n \cdot U\right)\right)}}{Om}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 15.0%
Simplified43.5%
Applied egg-rr26.9%
unpow1/226.9%
unpow226.9%
rem-sqrt-square46.4%
associate-*r*46.4%
*-commutative46.4%
associate-*r/46.4%
Simplified46.4%
Taylor expanded in n around 0 50.8%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 68.8%
Simplified73.3%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
Simplified12.2%
Taylor expanded in Om around 0 5.4%
Taylor expanded in l around inf 35.9%
associate-*l/34.1%
fma-define34.1%
mul-1-neg34.1%
fmm-undef34.1%
*-commutative34.1%
associate-*r*34.1%
Applied egg-rr34.1%
Final simplification63.3%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_2 (* (* U (* n 2.0)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1))))
(if (<= t_2 0.0)
(sqrt (* (* n 2.0) (* U (- t (* 2.0 (/ (pow l_m 2.0) Om))))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 (* 2.0 (* l_m (/ l_m Om)))))))
(/
(*
(* l_m (sqrt 2.0))
(sqrt (* n (+ (* -2.0 (* U Om)) (* (- U* U) (* n U))))))
Om)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt(((n * 2.0) * (U * (t - (2.0 * (pow(l_m, 2.0) / Om))))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = ((l_m * sqrt(2.0)) * sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om;
}
return tmp;
}
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt(((n * 2.0) * (U * (t - (2.0 * (Math.pow(l_m, 2.0) / Om))))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = ((l_m * Math.sqrt(2.0)) * Math.sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om;
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt(((n * 2.0) * (U * (t - (2.0 * (math.pow(l_m, 2.0) / Om)))))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om))))))) else: tmp = ((l_m * math.sqrt(2.0)) * math.sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = Float64(Float64(U * Float64(n * 2.0)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_1)) tmp = 0.0 if (t_2 <= 0.0) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t - Float64(2.0 * Float64((l_m ^ 2.0) / Om)))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_1 - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); else tmp = Float64(Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(n * Float64(Float64(-2.0 * Float64(U * Om)) + Float64(Float64(U_42_ - U) * Float64(n * U)))))) / Om); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_2 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt(((n * 2.0) * (U * (t - (2.0 * ((l_m ^ 2.0) / Om)))))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om))))))); else tmp = ((l_m * sqrt(2.0)) * sqrt((n * ((-2.0 * (U * Om)) + ((U_42_ - U) * (n * U)))))) / Om; end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$1 - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(n * N[(N[(-2.0 * N[(U * Om), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \left(U \cdot \left(n \cdot 2\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1\right)\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t - 2 \cdot \frac{{l\_m}^{2}}{Om}\right)\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_1 - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{n \cdot \left(-2 \cdot \left(U \cdot Om\right) + \left(U* - U\right) \cdot \left(n \cdot U\right)\right)}}{Om}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 15.0%
Simplified43.5%
Taylor expanded in n around 0 50.0%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 68.8%
Simplified73.3%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
Simplified12.2%
Taylor expanded in Om around 0 5.4%
Taylor expanded in l around inf 35.9%
associate-*l/34.1%
fma-define34.1%
mul-1-neg34.1%
fmm-undef34.1%
*-commutative34.1%
associate-*r*34.1%
Applied egg-rr34.1%
Final simplification63.2%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= n -2.7e+215)
(pow (* t (* U (* n 2.0))) 0.5)
(if (<= n 6e+42)
(sqrt (* (* U 2.0) (* n (+ t (/ (* (pow l_m 2.0) -2.0) Om)))))
(* (sqrt (* n 2.0)) (sqrt (* U t))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (n <= -2.7e+215) {
tmp = pow((t * (U * (n * 2.0))), 0.5);
} else if (n <= 6e+42) {
tmp = sqrt(((U * 2.0) * (n * (t + ((pow(l_m, 2.0) * -2.0) / Om)))));
} else {
tmp = sqrt((n * 2.0)) * sqrt((U * t));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (n <= (-2.7d+215)) then
tmp = (t * (u * (n * 2.0d0))) ** 0.5d0
else if (n <= 6d+42) then
tmp = sqrt(((u * 2.0d0) * (n * (t + (((l_m ** 2.0d0) * (-2.0d0)) / om)))))
else
tmp = sqrt((n * 2.0d0)) * sqrt((u * t))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (n <= -2.7e+215) {
tmp = Math.pow((t * (U * (n * 2.0))), 0.5);
} else if (n <= 6e+42) {
tmp = Math.sqrt(((U * 2.0) * (n * (t + ((Math.pow(l_m, 2.0) * -2.0) / Om)))));
} else {
tmp = Math.sqrt((n * 2.0)) * Math.sqrt((U * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if n <= -2.7e+215: tmp = math.pow((t * (U * (n * 2.0))), 0.5) elif n <= 6e+42: tmp = math.sqrt(((U * 2.0) * (n * (t + ((math.pow(l_m, 2.0) * -2.0) / Om))))) else: tmp = math.sqrt((n * 2.0)) * math.sqrt((U * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= -2.7e+215) tmp = Float64(t * Float64(U * Float64(n * 2.0))) ^ 0.5; elseif (n <= 6e+42) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t + Float64(Float64((l_m ^ 2.0) * -2.0) / Om))))); else tmp = Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(U * t))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (n <= -2.7e+215) tmp = (t * (U * (n * 2.0))) ^ 0.5; elseif (n <= 6e+42) tmp = sqrt(((U * 2.0) * (n * (t + (((l_m ^ 2.0) * -2.0) / Om))))); else tmp = sqrt((n * 2.0)) * sqrt((U * t)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[n, -2.7e+215], N[Power[N[(t * N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[n, 6e+42], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t + N[(N[(N[Power[l$95$m, 2.0], $MachinePrecision] * -2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -2.7 \cdot 10^{+215}:\\
\;\;\;\;{\left(t \cdot \left(U \cdot \left(n \cdot 2\right)\right)\right)}^{0.5}\\
\mathbf{elif}\;n \leq 6 \cdot 10^{+42}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t + \frac{{l\_m}^{2} \cdot -2}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{U \cdot t}\\
\end{array}
\end{array}
if n < -2.7e215Initial program 39.6%
Simplified43.9%
Taylor expanded in Om around 0 34.2%
Taylor expanded in t around inf 33.9%
pow1/245.9%
*-commutative45.9%
associate-*r*45.9%
Applied egg-rr45.9%
if -2.7e215 < n < 6.00000000000000058e42Initial program 49.5%
Simplified53.6%
Taylor expanded in n around 0 51.6%
associate-*r*51.6%
*-commutative51.6%
cancel-sign-sub-inv51.6%
metadata-eval51.6%
associate-*r/51.6%
*-commutative51.6%
Simplified51.6%
if 6.00000000000000058e42 < n Initial program 50.9%
Simplified51.0%
Taylor expanded in t around inf 44.3%
sqrt-prod58.3%
*-commutative58.3%
Applied egg-rr58.3%
Final simplification52.2%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= U -0.00034)
(pow (* t (* U (* n 2.0))) 0.5)
(if (<= U 760000000000.0)
(sqrt (* (* n 2.0) (* U (- t (* 2.0 (/ (pow l_m 2.0) Om))))))
(sqrt (fabs (* (* U 2.0) (* n t)))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U <= -0.00034) {
tmp = pow((t * (U * (n * 2.0))), 0.5);
} else if (U <= 760000000000.0) {
tmp = sqrt(((n * 2.0) * (U * (t - (2.0 * (pow(l_m, 2.0) / Om))))));
} else {
tmp = sqrt(fabs(((U * 2.0) * (n * t))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u <= (-0.00034d0)) then
tmp = (t * (u * (n * 2.0d0))) ** 0.5d0
else if (u <= 760000000000.0d0) then
tmp = sqrt(((n * 2.0d0) * (u * (t - (2.0d0 * ((l_m ** 2.0d0) / om))))))
else
tmp = sqrt(abs(((u * 2.0d0) * (n * t))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U <= -0.00034) {
tmp = Math.pow((t * (U * (n * 2.0))), 0.5);
} else if (U <= 760000000000.0) {
tmp = Math.sqrt(((n * 2.0) * (U * (t - (2.0 * (Math.pow(l_m, 2.0) / Om))))));
} else {
tmp = Math.sqrt(Math.abs(((U * 2.0) * (n * t))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U <= -0.00034: tmp = math.pow((t * (U * (n * 2.0))), 0.5) elif U <= 760000000000.0: tmp = math.sqrt(((n * 2.0) * (U * (t - (2.0 * (math.pow(l_m, 2.0) / Om)))))) else: tmp = math.sqrt(math.fabs(((U * 2.0) * (n * t)))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U <= -0.00034) tmp = Float64(t * Float64(U * Float64(n * 2.0))) ^ 0.5; elseif (U <= 760000000000.0) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t - Float64(2.0 * Float64((l_m ^ 2.0) / Om)))))); else tmp = sqrt(abs(Float64(Float64(U * 2.0) * Float64(n * t)))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (U <= -0.00034) tmp = (t * (U * (n * 2.0))) ^ 0.5; elseif (U <= 760000000000.0) tmp = sqrt(((n * 2.0) * (U * (t - (2.0 * ((l_m ^ 2.0) / Om)))))); else tmp = sqrt(abs(((U * 2.0) * (n * t)))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[U, -0.00034], N[Power[N[(t * N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[U, 760000000000.0], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[Abs[N[(N[(U * 2.0), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U \leq -0.00034:\\
\;\;\;\;{\left(t \cdot \left(U \cdot \left(n \cdot 2\right)\right)\right)}^{0.5}\\
\mathbf{elif}\;U \leq 760000000000:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t - 2 \cdot \frac{{l\_m}^{2}}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left|\left(U \cdot 2\right) \cdot \left(n \cdot t\right)\right|}\\
\end{array}
\end{array}
if U < -3.4e-4Initial program 54.6%
Simplified58.4%
Taylor expanded in Om around 0 55.7%
Taylor expanded in t around inf 49.2%
pow1/255.0%
*-commutative55.0%
associate-*r*55.0%
Applied egg-rr55.0%
if -3.4e-4 < U < 7.6e11Initial program 47.5%
Simplified58.9%
Taylor expanded in n around 0 50.5%
if 7.6e11 < U Initial program 46.8%
Simplified41.0%
Taylor expanded in t around inf 38.8%
add-sqr-sqrt38.8%
pow1/238.8%
pow1/242.7%
pow-prod-down27.0%
pow227.0%
associate-*r*27.0%
*-commutative27.0%
Applied egg-rr27.0%
unpow1/227.0%
unpow227.0%
rem-sqrt-square43.9%
Simplified43.9%
Final simplification50.1%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 2.8e+159) (sqrt (* (* U 2.0) (* n (+ t (/ (* (pow l_m 2.0) -2.0) Om))))) (* (/ (* l_m (sqrt 2.0)) Om) (sqrt (* U (* n (+ (* Om -2.0) (* n U*))))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 2.8e+159) {
tmp = sqrt(((U * 2.0) * (n * (t + ((pow(l_m, 2.0) * -2.0) / Om)))));
} else {
tmp = ((l_m * sqrt(2.0)) / Om) * sqrt((U * (n * ((Om * -2.0) + (n * U_42_)))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 2.8d+159) then
tmp = sqrt(((u * 2.0d0) * (n * (t + (((l_m ** 2.0d0) * (-2.0d0)) / om)))))
else
tmp = ((l_m * sqrt(2.0d0)) / om) * sqrt((u * (n * ((om * (-2.0d0)) + (n * u_42)))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 2.8e+159) {
tmp = Math.sqrt(((U * 2.0) * (n * (t + ((Math.pow(l_m, 2.0) * -2.0) / Om)))));
} else {
tmp = ((l_m * Math.sqrt(2.0)) / Om) * Math.sqrt((U * (n * ((Om * -2.0) + (n * U_42_)))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 2.8e+159: tmp = math.sqrt(((U * 2.0) * (n * (t + ((math.pow(l_m, 2.0) * -2.0) / Om))))) else: tmp = ((l_m * math.sqrt(2.0)) / Om) * math.sqrt((U * (n * ((Om * -2.0) + (n * U_42_))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 2.8e+159) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t + Float64(Float64((l_m ^ 2.0) * -2.0) / Om))))); else tmp = Float64(Float64(Float64(l_m * sqrt(2.0)) / Om) * sqrt(Float64(U * Float64(n * Float64(Float64(Om * -2.0) + Float64(n * U_42_)))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 2.8e+159) tmp = sqrt(((U * 2.0) * (n * (t + (((l_m ^ 2.0) * -2.0) / Om))))); else tmp = ((l_m * sqrt(2.0)) / Om) * sqrt((U * (n * ((Om * -2.0) + (n * U_42_))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 2.8e+159], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t + N[(N[(N[Power[l$95$m, 2.0], $MachinePrecision] * -2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(Om * -2.0), $MachinePrecision] + N[(n * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 2.8 \cdot 10^{+159}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t + \frac{{l\_m}^{2} \cdot -2}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{l\_m \cdot \sqrt{2}}{Om} \cdot \sqrt{U \cdot \left(n \cdot \left(Om \cdot -2 + n \cdot U*\right)\right)}\\
\end{array}
\end{array}
if l < 2.8000000000000001e159Initial program 52.4%
Simplified54.3%
Taylor expanded in n around 0 50.4%
associate-*r*50.4%
*-commutative50.4%
cancel-sign-sub-inv50.4%
metadata-eval50.4%
associate-*r/50.4%
*-commutative50.4%
Simplified50.4%
if 2.8000000000000001e159 < l Initial program 6.7%
Simplified31.5%
Taylor expanded in Om around 0 5.0%
Taylor expanded in l around inf 41.0%
Taylor expanded in U around 0 45.6%
Final simplification50.0%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= n 6.8e-97) (sqrt (fabs (* (* U 2.0) (* n t)))) (* (sqrt (* n 2.0)) (sqrt (* U t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (n <= 6.8e-97) {
tmp = sqrt(fabs(((U * 2.0) * (n * t))));
} else {
tmp = sqrt((n * 2.0)) * sqrt((U * t));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (n <= 6.8d-97) then
tmp = sqrt(abs(((u * 2.0d0) * (n * t))))
else
tmp = sqrt((n * 2.0d0)) * sqrt((u * t))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (n <= 6.8e-97) {
tmp = Math.sqrt(Math.abs(((U * 2.0) * (n * t))));
} else {
tmp = Math.sqrt((n * 2.0)) * Math.sqrt((U * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if n <= 6.8e-97: tmp = math.sqrt(math.fabs(((U * 2.0) * (n * t)))) else: tmp = math.sqrt((n * 2.0)) * math.sqrt((U * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= 6.8e-97) tmp = sqrt(abs(Float64(Float64(U * 2.0) * Float64(n * t)))); else tmp = Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(U * t))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (n <= 6.8e-97) tmp = sqrt(abs(((U * 2.0) * (n * t)))); else tmp = sqrt((n * 2.0)) * sqrt((U * t)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[n, 6.8e-97], N[Sqrt[N[Abs[N[(N[(U * 2.0), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq 6.8 \cdot 10^{-97}:\\
\;\;\;\;\sqrt{\left|\left(U \cdot 2\right) \cdot \left(n \cdot t\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{U \cdot t}\\
\end{array}
\end{array}
if n < 6.7999999999999998e-97Initial program 46.1%
Simplified50.2%
Taylor expanded in t around inf 41.5%
add-sqr-sqrt41.5%
pow1/241.5%
pow1/242.8%
pow-prod-down29.0%
pow229.0%
associate-*r*29.0%
*-commutative29.0%
Applied egg-rr29.0%
unpow1/229.0%
unpow229.0%
rem-sqrt-square43.6%
Simplified43.6%
if 6.7999999999999998e-97 < n Initial program 55.4%
Simplified58.2%
Taylor expanded in t around inf 45.3%
sqrt-prod54.1%
*-commutative54.1%
Applied egg-rr54.1%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (sqrt (fabs (* (* U 2.0) (* n t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return sqrt(fabs(((U * 2.0) * (n * t))));
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt(abs(((u * 2.0d0) * (n * t))))
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return Math.sqrt(Math.abs(((U * 2.0) * (n * t))));
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): return math.sqrt(math.fabs(((U * 2.0) * (n * t))))
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) return sqrt(abs(Float64(Float64(U * 2.0) * Float64(n * t)))) end
l_m = abs(l); function tmp = code(n, U, t, l_m, Om, U_42_) tmp = sqrt(abs(((U * 2.0) * (n * t)))); end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := N[Sqrt[N[Abs[N[(N[(U * 2.0), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\sqrt{\left|\left(U \cdot 2\right) \cdot \left(n \cdot t\right)\right|}
\end{array}
Initial program 48.8%
Simplified52.5%
Taylor expanded in t around inf 41.8%
add-sqr-sqrt41.8%
pow1/241.8%
pow1/243.5%
pow-prod-down30.0%
pow230.0%
associate-*r*30.0%
*-commutative30.0%
Applied egg-rr30.0%
unpow1/230.0%
unpow230.0%
rem-sqrt-square44.3%
Simplified44.3%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= U -2.7e-138) (pow (* t (* U (* n 2.0))) 0.5) (pow (* (* U 2.0) (* n t)) 0.5)))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U <= -2.7e-138) {
tmp = pow((t * (U * (n * 2.0))), 0.5);
} else {
tmp = pow(((U * 2.0) * (n * t)), 0.5);
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u <= (-2.7d-138)) then
tmp = (t * (u * (n * 2.0d0))) ** 0.5d0
else
tmp = ((u * 2.0d0) * (n * t)) ** 0.5d0
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U <= -2.7e-138) {
tmp = Math.pow((t * (U * (n * 2.0))), 0.5);
} else {
tmp = Math.pow(((U * 2.0) * (n * t)), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U <= -2.7e-138: tmp = math.pow((t * (U * (n * 2.0))), 0.5) else: tmp = math.pow(((U * 2.0) * (n * t)), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U <= -2.7e-138) tmp = Float64(t * Float64(U * Float64(n * 2.0))) ^ 0.5; else tmp = Float64(Float64(U * 2.0) * Float64(n * t)) ^ 0.5; end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (U <= -2.7e-138) tmp = (t * (U * (n * 2.0))) ^ 0.5; else tmp = ((U * 2.0) * (n * t)) ^ 0.5; end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[U, -2.7e-138], N[Power[N[(t * N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Power[N[(N[(U * 2.0), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U \leq -2.7 \cdot 10^{-138}:\\
\;\;\;\;{\left(t \cdot \left(U \cdot \left(n \cdot 2\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(U \cdot 2\right) \cdot \left(n \cdot t\right)\right)}^{0.5}\\
\end{array}
\end{array}
if U < -2.70000000000000029e-138Initial program 51.4%
Simplified55.8%
Taylor expanded in Om around 0 50.8%
Taylor expanded in t around inf 44.9%
pow1/248.4%
*-commutative48.4%
associate-*r*48.4%
Applied egg-rr48.4%
if -2.70000000000000029e-138 < U Initial program 47.5%
Simplified54.2%
Taylor expanded in t around inf 41.7%
pow1/243.6%
associate-*r*43.6%
*-commutative43.6%
Applied egg-rr43.6%
Final simplification45.3%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= U -2.4e-138) (pow (* t (* U (* n 2.0))) 0.5) (sqrt (* 2.0 (* U (* n t))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U <= -2.4e-138) {
tmp = pow((t * (U * (n * 2.0))), 0.5);
} else {
tmp = sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u <= (-2.4d-138)) then
tmp = (t * (u * (n * 2.0d0))) ** 0.5d0
else
tmp = sqrt((2.0d0 * (u * (n * t))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U <= -2.4e-138) {
tmp = Math.pow((t * (U * (n * 2.0))), 0.5);
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U <= -2.4e-138: tmp = math.pow((t * (U * (n * 2.0))), 0.5) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U <= -2.4e-138) tmp = Float64(t * Float64(U * Float64(n * 2.0))) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (U <= -2.4e-138) tmp = (t * (U * (n * 2.0))) ^ 0.5; else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[U, -2.4e-138], N[Power[N[(t * N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U \leq -2.4 \cdot 10^{-138}:\\
\;\;\;\;{\left(t \cdot \left(U \cdot \left(n \cdot 2\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if U < -2.3999999999999999e-138Initial program 51.4%
Simplified55.8%
Taylor expanded in Om around 0 50.8%
Taylor expanded in t around inf 44.9%
pow1/248.4%
*-commutative48.4%
associate-*r*48.4%
Applied egg-rr48.4%
if -2.3999999999999999e-138 < U Initial program 47.5%
Simplified54.2%
Taylor expanded in t around inf 41.7%
Final simplification44.0%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= Om 2.4e+38) (sqrt (* 2.0 (* U (* n t)))) (pow (* 2.0 (* n (* U t))) 0.5)))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (Om <= 2.4e+38) {
tmp = sqrt((2.0 * (U * (n * t))));
} else {
tmp = pow((2.0 * (n * (U * t))), 0.5);
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (om <= 2.4d+38) then
tmp = sqrt((2.0d0 * (u * (n * t))))
else
tmp = (2.0d0 * (n * (u * t))) ** 0.5d0
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (Om <= 2.4e+38) {
tmp = Math.sqrt((2.0 * (U * (n * t))));
} else {
tmp = Math.pow((2.0 * (n * (U * t))), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if Om <= 2.4e+38: tmp = math.sqrt((2.0 * (U * (n * t)))) else: tmp = math.pow((2.0 * (n * (U * t))), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (Om <= 2.4e+38) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); else tmp = Float64(2.0 * Float64(n * Float64(U * t))) ^ 0.5; end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (Om <= 2.4e+38) tmp = sqrt((2.0 * (U * (n * t)))); else tmp = (2.0 * (n * (U * t))) ^ 0.5; end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[Om, 2.4e+38], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;Om \leq 2.4 \cdot 10^{+38}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot t\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if Om < 2.40000000000000017e38Initial program 48.1%
Simplified48.3%
Taylor expanded in t around inf 41.1%
if 2.40000000000000017e38 < Om Initial program 51.2%
Simplified67.3%
Taylor expanded in t around inf 51.1%
pow1/253.0%
associate-*l*53.0%
Applied egg-rr53.0%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (sqrt (* 2.0 (* U (* n t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return sqrt((2.0 * (U * (n * t))));
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((2.0d0 * (u * (n * t))))
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return Math.sqrt((2.0 * (U * (n * t))));
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): return math.sqrt((2.0 * (U * (n * t))))
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) return sqrt(Float64(2.0 * Float64(U * Float64(n * t)))) end
l_m = abs(l); function tmp = code(n, U, t, l_m, Om, U_42_) tmp = sqrt((2.0 * (U * (n * t)))); end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}
\end{array}
Initial program 48.8%
Simplified52.5%
Taylor expanded in t around inf 41.8%
herbie shell --seed 2024166
(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*))))))