
(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 17 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 (- t (* 2.0 (/ (* l_m l_m) Om))))
(t_2 (* U (* 2.0 n)))
(t_3 (* n (pow (/ l_m Om) 2.0)))
(t_4 (sqrt (* t_2 (+ t_1 (* t_3 (- U* U)))))))
(if (<= t_4 2e-155)
(*
(sqrt (* 2.0 n))
(sqrt (* U (+ t (- (* t_3 U*) (* 2.0 (/ (pow l_m 2.0) Om)))))))
(if (<= t_4 2e+150)
(sqrt (* t_2 (+ t_1 (* (- U* U) (pow (cbrt t_3) 3.0)))))
(*
(* l_m (sqrt 2.0))
(sqrt (* (* n U) (fma U* (/ n (pow Om 2.0)) (/ -2.0 Om)))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = t - (2.0 * ((l_m * l_m) / Om));
double t_2 = U * (2.0 * n);
double t_3 = n * pow((l_m / Om), 2.0);
double t_4 = sqrt((t_2 * (t_1 + (t_3 * (U_42_ - U)))));
double tmp;
if (t_4 <= 2e-155) {
tmp = sqrt((2.0 * n)) * sqrt((U * (t + ((t_3 * U_42_) - (2.0 * (pow(l_m, 2.0) / Om))))));
} else if (t_4 <= 2e+150) {
tmp = sqrt((t_2 * (t_1 + ((U_42_ - U) * pow(cbrt(t_3), 3.0)))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt(((n * U) * fma(U_42_, (n / pow(Om, 2.0)), (-2.0 / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) t_2 = Float64(U * Float64(2.0 * n)) t_3 = Float64(n * (Float64(l_m / Om) ^ 2.0)) t_4 = sqrt(Float64(t_2 * Float64(t_1 + Float64(t_3 * Float64(U_42_ - U))))) tmp = 0.0 if (t_4 <= 2e-155) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * Float64(t + Float64(Float64(t_3 * U_42_) - Float64(2.0 * Float64((l_m ^ 2.0) / Om))))))); elseif (t_4 <= 2e+150) tmp = sqrt(Float64(t_2 * Float64(t_1 + Float64(Float64(U_42_ - U) * (cbrt(t_3) ^ 3.0))))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(n * U) * fma(U_42_, Float64(n / (Om ^ 2.0)), Float64(-2.0 / Om))))); 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[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(t$95$2 * N[(t$95$1 + N[(t$95$3 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$4, 2e-155], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t + N[(N[(t$95$3 * U$42$), $MachinePrecision] - N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 2e+150], N[Sqrt[N[(t$95$2 * N[(t$95$1 + N[(N[(U$42$ - U), $MachinePrecision] * N[Power[N[Power[t$95$3, 1/3], $MachinePrecision], 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(U$42$ * N[(n / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision] + N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\\
t_2 := U \cdot \left(2 \cdot n\right)\\
t_3 := n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\\
t_4 := \sqrt{t\_2 \cdot \left(t\_1 + t\_3 \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_4 \leq 2 \cdot 10^{-155}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(t + \left(t\_3 \cdot U* - 2 \cdot \frac{{l\_m}^{2}}{Om}\right)\right)}\\
\mathbf{elif}\;t\_4 \leq 2 \cdot 10^{+150}:\\
\;\;\;\;\sqrt{t\_2 \cdot \left(t\_1 + \left(U* - U\right) \cdot {\left(\sqrt[3]{t\_3}\right)}^{3}\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\left(n \cdot U\right) \cdot \mathsf{fma}\left(U*, \frac{n}{{Om}^{2}}, \frac{-2}{Om}\right)}\\
\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*))))) < 2.00000000000000003e-155Initial program 17.4%
Simplified40.7%
Taylor expanded in U around 0 35.5%
associate-/l*37.5%
unpow237.5%
unpow237.5%
times-frac40.7%
unpow240.7%
neg-mul-140.7%
distribute-lft-neg-out40.7%
*-commutative40.7%
Simplified40.7%
sqrt-prod49.6%
associate-*r/49.6%
unpow249.6%
associate-*r*53.4%
Applied egg-rr53.4%
*-commutative53.4%
fma-undefine53.4%
distribute-rgt-neg-out53.4%
unsub-neg53.4%
Simplified53.4%
if 2.00000000000000003e-155 < (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*))))) < 1.99999999999999996e150Initial program 99.6%
add-cube-cbrt99.6%
pow399.6%
Applied egg-rr99.6%
if 1.99999999999999996e150 < (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 17.6%
Simplified31.1%
Taylor expanded in U around 0 18.2%
associate-/l*17.1%
unpow217.1%
unpow217.1%
times-frac31.3%
unpow231.3%
neg-mul-131.3%
distribute-lft-neg-out31.3%
*-commutative31.3%
Simplified31.3%
*-un-lft-identity31.3%
associate-*r*28.2%
associate-*r/19.5%
unpow219.5%
associate-*r*17.7%
Applied egg-rr17.7%
*-lft-identity17.7%
associate-*l*18.9%
*-commutative18.9%
fma-undefine18.9%
distribute-rgt-neg-out18.9%
unsub-neg18.9%
Simplified18.9%
Taylor expanded in l around inf 18.0%
*-commutative18.0%
associate-*r*19.7%
associate-/l*20.0%
fma-neg20.0%
associate-*r/20.0%
metadata-eval20.0%
distribute-neg-frac20.0%
metadata-eval20.0%
Simplified20.0%
Final simplification58.7%
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)))
(t_2
(sqrt
(*
(* U (* 2.0 n))
(+ (- t (* 2.0 (/ (* l_m l_m) Om))) (* t_1 (- U* U)))))))
(if (<= t_2 2e-155)
(*
(sqrt (* 2.0 n))
(sqrt (* U (+ t (- (* t_1 U*) (* 2.0 (/ (pow l_m 2.0) Om)))))))
(if (<= t_2 2e+150)
t_2
(*
(* l_m (sqrt 2.0))
(sqrt (* (* n U) (fma U* (/ n (pow Om 2.0)) (/ -2.0 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);
double t_2 = sqrt(((U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + (t_1 * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-155) {
tmp = sqrt((2.0 * n)) * sqrt((U * (t + ((t_1 * U_42_) - (2.0 * (pow(l_m, 2.0) / Om))))));
} else if (t_2 <= 2e+150) {
tmp = t_2;
} else {
tmp = (l_m * sqrt(2.0)) * sqrt(((n * U) * fma(U_42_, (n / pow(Om, 2.0)), (-2.0 / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(n * (Float64(l_m / Om) ^ 2.0)) t_2 = sqrt(Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(t_1 * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-155) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * Float64(t + Float64(Float64(t_1 * U_42_) - Float64(2.0 * Float64((l_m ^ 2.0) / Om))))))); elseif (t_2 <= 2e+150) tmp = t_2; else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(n * U) * fma(U_42_, Float64(n / (Om ^ 2.0)), Float64(-2.0 / Om))))); 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 * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-155], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t + N[(N[(t$95$1 * U$42$), $MachinePrecision] - 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, 2e+150], t$95$2, N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(U$42$ * N[(n / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision] + N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\\
t_2 := \sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1 \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-155}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(t + \left(t\_1 \cdot U* - 2 \cdot \frac{{l\_m}^{2}}{Om}\right)\right)}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+150}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\left(n \cdot U\right) \cdot \mathsf{fma}\left(U*, \frac{n}{{Om}^{2}}, \frac{-2}{Om}\right)}\\
\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*))))) < 2.00000000000000003e-155Initial program 17.4%
Simplified40.7%
Taylor expanded in U around 0 35.5%
associate-/l*37.5%
unpow237.5%
unpow237.5%
times-frac40.7%
unpow240.7%
neg-mul-140.7%
distribute-lft-neg-out40.7%
*-commutative40.7%
Simplified40.7%
sqrt-prod49.6%
associate-*r/49.6%
unpow249.6%
associate-*r*53.4%
Applied egg-rr53.4%
*-commutative53.4%
fma-undefine53.4%
distribute-rgt-neg-out53.4%
unsub-neg53.4%
Simplified53.4%
if 2.00000000000000003e-155 < (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*))))) < 1.99999999999999996e150Initial program 99.6%
if 1.99999999999999996e150 < (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 17.6%
Simplified31.1%
Taylor expanded in U around 0 18.2%
associate-/l*17.1%
unpow217.1%
unpow217.1%
times-frac31.3%
unpow231.3%
neg-mul-131.3%
distribute-lft-neg-out31.3%
*-commutative31.3%
Simplified31.3%
*-un-lft-identity31.3%
associate-*r*28.2%
associate-*r/19.5%
unpow219.5%
associate-*r*17.7%
Applied egg-rr17.7%
*-lft-identity17.7%
associate-*l*18.9%
*-commutative18.9%
fma-undefine18.9%
distribute-rgt-neg-out18.9%
unsub-neg18.9%
Simplified18.9%
Taylor expanded in l around inf 18.0%
*-commutative18.0%
associate-*r*19.7%
associate-/l*20.0%
fma-neg20.0%
associate-*r/20.0%
metadata-eval20.0%
distribute-neg-frac20.0%
metadata-eval20.0%
Simplified20.0%
Final simplification58.7%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (pow (/ l_m Om) 2.0))
(t_2
(sqrt
(*
(* U (* 2.0 n))
(+ (- t (* 2.0 (/ (* l_m l_m) Om))) (* (* n t_1) (- U* U)))))))
(if (<= t_2 2e-155)
(*
(sqrt n)
(sqrt
(* (* 2.0 U) (- (* n (* t_1 U*)) (- (/ (* 2.0 (pow l_m 2.0)) Om) t)))))
(if (<= t_2 2e+150)
t_2
(*
(* l_m (sqrt 2.0))
(sqrt (* (* n U) (fma U* (/ n (pow Om 2.0)) (/ -2.0 Om)))))))))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 / Om), 2.0);
double t_2 = sqrt(((U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * t_1) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-155) {
tmp = sqrt(n) * sqrt(((2.0 * U) * ((n * (t_1 * U_42_)) - (((2.0 * pow(l_m, 2.0)) / Om) - t))));
} else if (t_2 <= 2e+150) {
tmp = t_2;
} else {
tmp = (l_m * sqrt(2.0)) * sqrt(((n * U) * fma(U_42_, (n / pow(Om, 2.0)), (-2.0 / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(l_m / Om) ^ 2.0 t_2 = sqrt(Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * t_1) * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-155) tmp = Float64(sqrt(n) * sqrt(Float64(Float64(2.0 * U) * Float64(Float64(n * Float64(t_1 * U_42_)) - Float64(Float64(Float64(2.0 * (l_m ^ 2.0)) / Om) - t))))); elseif (t_2 <= 2e+150) tmp = t_2; else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(n * U) * fma(U_42_, Float64(n / (Om ^ 2.0)), Float64(-2.0 / Om))))); 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[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * t$95$1), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-155], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(N[(n * N[(t$95$1 * U$42$), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+150], t$95$2, N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(U$42$ * N[(n / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision] + N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := {\left(\frac{l\_m}{Om}\right)}^{2}\\
t_2 := \sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot t\_1\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-155}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot \left(t\_1 \cdot U*\right) - \left(\frac{2 \cdot {l\_m}^{2}}{Om} - t\right)\right)}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+150}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\left(n \cdot U\right) \cdot \mathsf{fma}\left(U*, \frac{n}{{Om}^{2}}, \frac{-2}{Om}\right)}\\
\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*))))) < 2.00000000000000003e-155Initial program 17.4%
Simplified40.7%
Taylor expanded in U around 0 35.5%
associate-/l*37.5%
unpow237.5%
unpow237.5%
times-frac40.7%
unpow240.7%
neg-mul-140.7%
distribute-lft-neg-out40.7%
*-commutative40.7%
Simplified40.7%
*-un-lft-identity40.7%
associate-*r*17.2%
associate-*r/17.2%
unpow217.2%
associate-*r*17.4%
Applied egg-rr17.4%
*-lft-identity17.4%
associate-*l*44.5%
*-commutative44.5%
fma-undefine44.5%
distribute-rgt-neg-out44.5%
unsub-neg44.5%
Simplified44.5%
pow1/244.5%
associate-*l*44.5%
metadata-eval44.5%
unpow-prod-down53.4%
metadata-eval53.4%
pow1/253.4%
associate--r-53.4%
associate-*l*49.6%
metadata-eval49.6%
Applied egg-rr49.6%
unpow1/249.6%
associate-*r*49.6%
*-commutative49.6%
associate-*r/49.6%
*-commutative49.6%
Simplified49.6%
if 2.00000000000000003e-155 < (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*))))) < 1.99999999999999996e150Initial program 99.6%
if 1.99999999999999996e150 < (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 17.6%
Simplified31.1%
Taylor expanded in U around 0 18.2%
associate-/l*17.1%
unpow217.1%
unpow217.1%
times-frac31.3%
unpow231.3%
neg-mul-131.3%
distribute-lft-neg-out31.3%
*-commutative31.3%
Simplified31.3%
*-un-lft-identity31.3%
associate-*r*28.2%
associate-*r/19.5%
unpow219.5%
associate-*r*17.7%
Applied egg-rr17.7%
*-lft-identity17.7%
associate-*l*18.9%
*-commutative18.9%
fma-undefine18.9%
distribute-rgt-neg-out18.9%
unsub-neg18.9%
Simplified18.9%
Taylor expanded in l around inf 18.0%
*-commutative18.0%
associate-*r*19.7%
associate-/l*20.0%
fma-neg20.0%
associate-*r/20.0%
metadata-eval20.0%
distribute-neg-frac20.0%
metadata-eval20.0%
Simplified20.0%
Final simplification57.9%
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)))
(t_2 (* t_1 (- U* U)))
(t_3
(sqrt (* (* U (* 2.0 n)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_2)))))
(if (<= t_3 0.0)
(sqrt
(* (* 2.0 n) (* U (+ t (- (* t_1 U*) (* 2.0 (/ (pow l_m 2.0) Om)))))))
(if (<= t_3 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_2 (* 2.0 (* l_m (/ l_m Om)))))))
(*
(* l_m (sqrt 2.0))
(sqrt (* U (* n (- (/ (* n U*) (pow Om 2.0)) (/ 2.0 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);
double t_2 = t_1 * (U_42_ - U);
double t_3 = sqrt(((U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2)));
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt(((2.0 * n) * (U * (t + ((t_1 * U_42_) - (2.0 * (pow(l_m, 2.0) / Om)))))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * (((n * U_42_) / pow(Om, 2.0)) - (2.0 / 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);
double t_2 = t_1 * (U_42_ - U);
double t_3 = Math.sqrt(((U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2)));
double tmp;
if (t_3 <= 0.0) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((t_1 * U_42_) - (2.0 * (Math.pow(l_m, 2.0) / Om)))))));
} else if (t_3 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((U * (n * (((n * U_42_) / Math.pow(Om, 2.0)) - (2.0 / 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) t_2 = t_1 * (U_42_ - U) t_3 = math.sqrt(((U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2))) tmp = 0 if t_3 <= 0.0: tmp = math.sqrt(((2.0 * n) * (U * (t + ((t_1 * U_42_) - (2.0 * (math.pow(l_m, 2.0) / Om))))))) elif t_3 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l_m * (l_m / Om))))))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((U * (n * (((n * U_42_) / math.pow(Om, 2.0)) - (2.0 / Om))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(n * (Float64(l_m / Om) ^ 2.0)) t_2 = Float64(t_1 * Float64(U_42_ - U)) t_3 = sqrt(Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_2))) tmp = 0.0 if (t_3 <= 0.0) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(t_1 * U_42_) - Float64(2.0 * Float64((l_m ^ 2.0) / Om))))))); elseif (t_3 <= Inf) 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(Float64(l_m * sqrt(2.0)) * sqrt(Float64(U * Float64(n * Float64(Float64(Float64(n * U_42_) / (Om ^ 2.0)) - Float64(2.0 / 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); t_2 = t_1 * (U_42_ - U); t_3 = sqrt(((U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2))); tmp = 0.0; if (t_3 <= 0.0) tmp = sqrt(((2.0 * n) * (U * (t + ((t_1 * U_42_) - (2.0 * ((l_m ^ 2.0) / Om))))))); elseif (t_3 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l_m * (l_m / Om))))))); else tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * (((n * U_42_) / (Om ^ 2.0)) - (2.0 / 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[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(N[(U * N[(2.0 * n), $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]], $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(t$95$1 * U$42$), $MachinePrecision] - N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, Infinity], 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[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(N[(n * U$42$), $MachinePrecision] / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\\
t_2 := t\_1 \cdot \left(U* - U\right)\\
t_3 := \sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_2\right)}\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left(t\_1 \cdot U* - 2 \cdot \frac{{l\_m}^{2}}{Om}\right)\right)\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\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}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{U \cdot \left(n \cdot \left(\frac{n \cdot U*}{{Om}^{2}} - \frac{2}{Om}\right)\right)}\\
\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 11.7%
Simplified37.6%
Taylor expanded in U around 0 33.0%
associate-/l*35.1%
unpow235.1%
unpow235.1%
times-frac37.6%
unpow237.6%
neg-mul-137.6%
distribute-lft-neg-out37.6%
*-commutative37.6%
Simplified37.6%
*-un-lft-identity37.6%
associate-*r*11.5%
associate-*r/11.5%
unpow211.5%
associate-*r*11.7%
Applied egg-rr11.7%
*-lft-identity11.7%
associate-*l*41.8%
*-commutative41.8%
fma-undefine41.8%
distribute-rgt-neg-out41.8%
unsub-neg41.8%
Simplified41.8%
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 69.6%
Simplified74.5%
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.2%
Taylor expanded in U around 0 1.6%
associate-/l*1.2%
unpow21.2%
unpow21.2%
times-frac10.6%
unpow210.6%
neg-mul-110.6%
distribute-lft-neg-out10.6%
*-commutative10.6%
Simplified10.6%
*-un-lft-identity10.6%
associate-*r*4.1%
associate-*r/0.3%
unpow20.3%
associate-*r*0.3%
Applied egg-rr0.3%
*-lft-identity0.3%
associate-*l*1.0%
*-commutative1.0%
fma-undefine1.0%
distribute-rgt-neg-out1.0%
unsub-neg1.0%
Simplified1.0%
Taylor expanded in l around inf 26.0%
*-commutative26.0%
*-commutative26.0%
associate-*r/26.0%
metadata-eval26.0%
Simplified26.0%
Final simplification62.5%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (pow (/ l_m Om) 2.0))
(t_2
(*
(* U (* 2.0 n))
(+ (- t (* 2.0 (/ (* l_m l_m) Om))) (* (* n t_1) (- U* U))))))
(if (<= t_2 0.0)
(sqrt
(*
(* 2.0 n)
(* U (- t (fma 2.0 (* l_m (/ l_m Om)) (* t_1 (* n (- U U*))))))))
(if (<= t_2 5e+300)
(sqrt t_2)
(*
(* l_m (sqrt 2.0))
(sqrt (* (* n U) (fma U* (/ n (pow Om 2.0)) (/ -2.0 Om)))))))))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 / Om), 2.0);
double t_2 = (U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * t_1) * (U_42_ - U)));
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt(((2.0 * n) * (U * (t - fma(2.0, (l_m * (l_m / Om)), (t_1 * (n * (U - U_42_))))))));
} else if (t_2 <= 5e+300) {
tmp = sqrt(t_2);
} else {
tmp = (l_m * sqrt(2.0)) * sqrt(((n * U) * fma(U_42_, (n / pow(Om, 2.0)), (-2.0 / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(l_m / Om) ^ 2.0 t_2 = Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * t_1) * Float64(U_42_ - U)))) tmp = 0.0 if (t_2 <= 0.0) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - fma(2.0, Float64(l_m * Float64(l_m / Om)), Float64(t_1 * Float64(n * Float64(U - U_42_)))))))); elseif (t_2 <= 5e+300) tmp = sqrt(t_2); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(n * U) * fma(U_42_, Float64(n / (Om ^ 2.0)), Float64(-2.0 / Om))))); 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[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$2 = N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * t$95$1), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, 5e+300], N[Sqrt[t$95$2], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(U$42$ * N[(n / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision] + N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := {\left(\frac{l\_m}{Om}\right)}^{2}\\
t_2 := \left(U \cdot \left(2 \cdot n\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot t\_1\right) \cdot \left(U* - U\right)\right)\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \mathsf{fma}\left(2, l\_m \cdot \frac{l\_m}{Om}, t\_1 \cdot \left(n \cdot \left(U - U*\right)\right)\right)\right)\right)}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+300}:\\
\;\;\;\;\sqrt{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\left(n \cdot U\right) \cdot \mathsf{fma}\left(U*, \frac{n}{{Om}^{2}}, \frac{-2}{Om}\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 10.7%
Simplified36.7%
associate-*r*40.6%
sub-neg40.6%
distribute-lft-in40.6%
Applied egg-rr40.6%
*-commutative40.6%
associate-*r*40.6%
unpow240.6%
times-frac36.2%
unpow236.2%
unpow236.2%
*-commutative36.2%
associate-*r*36.1%
unpow236.1%
times-frac36.1%
unpow236.1%
unpow236.1%
distribute-rgt-out36.1%
unpow236.1%
unpow236.1%
times-frac40.5%
unpow240.5%
distribute-rgt-in40.5%
sub-neg40.5%
Simplified40.5%
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*)))) < 5.00000000000000026e300Initial program 98.2%
if 5.00000000000000026e300 < (*.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.3%
Simplified31.3%
Taylor expanded in U around 0 18.8%
associate-/l*17.8%
unpow217.8%
unpow217.8%
times-frac31.5%
unpow231.5%
neg-mul-131.5%
distribute-lft-neg-out31.5%
*-commutative31.5%
Simplified31.5%
*-un-lft-identity31.5%
associate-*r*28.3%
associate-*r/20.3%
unpow220.3%
associate-*r*18.4%
Applied egg-rr18.4%
*-lft-identity18.4%
associate-*l*19.6%
*-commutative19.6%
fma-undefine19.6%
distribute-rgt-neg-out19.6%
unsub-neg19.6%
Simplified19.6%
Taylor expanded in l around inf 18.6%
*-commutative18.6%
associate-*r*20.5%
associate-/l*20.7%
fma-neg20.7%
associate-*r/20.7%
metadata-eval20.7%
distribute-neg-frac20.7%
metadata-eval20.7%
Simplified20.7%
Final simplification57.3%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* l_m (/ l_m Om)))
(t_2 (pow (/ l_m Om) 2.0))
(t_3 (* (* n t_2) (- U* U)))
(t_4 (* (* U (* 2.0 n)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_3))))
(if (<= t_4 0.0)
(sqrt (* (* 2.0 n) (* U (- t (fma 2.0 t_1 (* t_2 (* n (- U U*))))))))
(if (<= t_4 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_3 (* 2.0 t_1)))))
(*
(* l_m (sqrt 2.0))
(sqrt (* U (* n (- (/ (* n U*) (pow Om 2.0)) (/ 2.0 Om))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = l_m * (l_m / Om);
double t_2 = pow((l_m / Om), 2.0);
double t_3 = (n * t_2) * (U_42_ - U);
double t_4 = (U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_3);
double tmp;
if (t_4 <= 0.0) {
tmp = sqrt(((2.0 * n) * (U * (t - fma(2.0, t_1, (t_2 * (n * (U - U_42_))))))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_3 - (2.0 * t_1)))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * (((n * U_42_) / pow(Om, 2.0)) - (2.0 / Om)))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(l_m * Float64(l_m / Om)) t_2 = Float64(l_m / Om) ^ 2.0 t_3 = Float64(Float64(n * t_2) * Float64(U_42_ - U)) t_4 = Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_3)) tmp = 0.0 if (t_4 <= 0.0) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - fma(2.0, t_1, Float64(t_2 * Float64(n * Float64(U - U_42_)))))))); elseif (t_4 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_3 - Float64(2.0 * t_1))))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(U * Float64(n * Float64(Float64(Float64(n * U_42_) / (Om ^ 2.0)) - Float64(2.0 / Om)))))); 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[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$3 = N[(N[(n * t$95$2), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(U * N[(2.0 * n), $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]}, If[LessEqual[t$95$4, 0.0], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * t$95$1 + N[(t$95$2 * N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$3 - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(N[(n * U$42$), $MachinePrecision] / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := l\_m \cdot \frac{l\_m}{Om}\\
t_2 := {\left(\frac{l\_m}{Om}\right)}^{2}\\
t_3 := \left(n \cdot t\_2\right) \cdot \left(U* - U\right)\\
t_4 := \left(U \cdot \left(2 \cdot n\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_3\right)\\
\mathbf{if}\;t\_4 \leq 0:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \mathsf{fma}\left(2, t\_1, t\_2 \cdot \left(n \cdot \left(U - U*\right)\right)\right)\right)\right)}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_3 - 2 \cdot t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{U \cdot \left(n \cdot \left(\frac{n \cdot U*}{{Om}^{2}} - \frac{2}{Om}\right)\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 10.7%
Simplified36.7%
associate-*r*40.6%
sub-neg40.6%
distribute-lft-in40.6%
Applied egg-rr40.6%
*-commutative40.6%
associate-*r*40.6%
unpow240.6%
times-frac36.2%
unpow236.2%
unpow236.2%
*-commutative36.2%
associate-*r*36.1%
unpow236.1%
times-frac36.1%
unpow236.1%
unpow236.1%
distribute-rgt-out36.1%
unpow236.1%
unpow236.1%
times-frac40.5%
unpow240.5%
distribute-rgt-in40.5%
sub-neg40.5%
Simplified40.5%
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 69.6%
Simplified74.5%
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%
Simplified7.9%
Taylor expanded in U around 0 1.5%
associate-/l*1.4%
unpow21.4%
unpow21.4%
times-frac8.4%
unpow28.4%
neg-mul-18.4%
distribute-lft-neg-out8.4%
*-commutative8.4%
Simplified8.4%
*-un-lft-identity8.4%
associate-*r*0.9%
associate-*r/0.4%
unpow20.4%
associate-*r*0.4%
Applied egg-rr0.4%
*-lft-identity0.4%
associate-*l*1.2%
*-commutative1.2%
fma-undefine1.2%
distribute-rgt-neg-out1.2%
unsub-neg1.2%
Simplified1.2%
Taylor expanded in l around inf 29.4%
*-commutative29.4%
*-commutative29.4%
associate-*r/29.4%
metadata-eval29.4%
Simplified29.4%
Final simplification62.9%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* l_m (/ l_m Om))))
(t_2 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_3 (* (* U (* 2.0 n)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_2))))
(if (<= t_3 0.0)
(sqrt (* 2.0 (* U (* n (- t t_1)))))
(if (<= t_3 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_2 t_1))))
(*
(* l_m (sqrt 2.0))
(sqrt (* U (* n (- (/ (* n U*) (pow Om 2.0)) (/ 2.0 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 * (l_m * (l_m / Om));
double t_2 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_3 = (U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((2.0 * (U * (n * (t - t_1)))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * (((n * U_42_) / pow(Om, 2.0)) - (2.0 / 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 * (l_m * (l_m / Om));
double t_2 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_3 = (U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double tmp;
if (t_3 <= 0.0) {
tmp = Math.sqrt((2.0 * (U * (n * (t - t_1)))));
} else if (t_3 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((U * (n * (((n * U_42_) / Math.pow(Om, 2.0)) - (2.0 / Om)))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = 2.0 * (l_m * (l_m / Om)) t_2 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_3 = (U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2) tmp = 0 if t_3 <= 0.0: tmp = math.sqrt((2.0 * (U * (n * (t - t_1))))) elif t_3 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1)))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((U * (n * (((n * U_42_) / math.pow(Om, 2.0)) - (2.0 / 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 * Float64(l_m / Om))) t_2 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_2)) tmp = 0.0 if (t_3 <= 0.0) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - t_1))))); elseif (t_3 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_2 - t_1)))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(U * Float64(n * Float64(Float64(Float64(n * U_42_) / (Om ^ 2.0)) - Float64(2.0 / 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 * (l_m / Om)); t_2 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_3 = (U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2); tmp = 0.0; if (t_3 <= 0.0) tmp = sqrt((2.0 * (U * (n * (t - t_1))))); elseif (t_3 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1)))); else tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * (((n * U_42_) / (Om ^ 2.0)) - (2.0 / 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[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $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[(2.0 * n), $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]}, If[LessEqual[t$95$3, 0.0], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$2 - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(N[(n * U$42$), $MachinePrecision] / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\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(2 \cdot n\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_2\right)\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - t\_1\right)\right)\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_2 - t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{U \cdot \left(n \cdot \left(\frac{n \cdot U*}{{Om}^{2}} - \frac{2}{Om}\right)\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 10.7%
Simplified36.7%
Taylor expanded in n around 0 36.5%
unpow236.5%
associate-*r/38.5%
*-commutative38.5%
Applied egg-rr38.5%
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 69.6%
Simplified74.5%
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%
Simplified7.9%
Taylor expanded in U around 0 1.5%
associate-/l*1.4%
unpow21.4%
unpow21.4%
times-frac8.4%
unpow28.4%
neg-mul-18.4%
distribute-lft-neg-out8.4%
*-commutative8.4%
Simplified8.4%
*-un-lft-identity8.4%
associate-*r*0.9%
associate-*r/0.4%
unpow20.4%
associate-*r*0.4%
Applied egg-rr0.4%
*-lft-identity0.4%
associate-*l*1.2%
*-commutative1.2%
fma-undefine1.2%
distribute-rgt-neg-out1.2%
unsub-neg1.2%
Simplified1.2%
Taylor expanded in l around inf 29.4%
*-commutative29.4%
*-commutative29.4%
associate-*r/29.4%
metadata-eval29.4%
Simplified29.4%
Final simplification62.5%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* l_m (/ l_m Om))))
(t_2 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_3 (* (* U (* 2.0 n)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_2))))
(if (<= t_3 0.0)
(sqrt (* 2.0 (* U (* n (- t t_1)))))
(if (<= t_3 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_2 t_1))))
(pow (* -4.0 (* U (/ (* n (pow l_m 2.0)) Om))) 0.5)))))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 * (l_m * (l_m / Om));
double t_2 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_3 = (U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((2.0 * (U * (n * (t - t_1)))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1))));
} else {
tmp = pow((-4.0 * (U * ((n * pow(l_m, 2.0)) / Om))), 0.5);
}
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 * (l_m * (l_m / Om));
double t_2 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_3 = (U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double tmp;
if (t_3 <= 0.0) {
tmp = Math.sqrt((2.0 * (U * (n * (t - t_1)))));
} else if (t_3 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1))));
} else {
tmp = Math.pow((-4.0 * (U * ((n * Math.pow(l_m, 2.0)) / Om))), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = 2.0 * (l_m * (l_m / Om)) t_2 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_3 = (U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2) tmp = 0 if t_3 <= 0.0: tmp = math.sqrt((2.0 * (U * (n * (t - t_1))))) elif t_3 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1)))) else: tmp = math.pow((-4.0 * (U * ((n * math.pow(l_m, 2.0)) / Om))), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(2.0 * Float64(l_m * Float64(l_m / Om))) t_2 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_2)) tmp = 0.0 if (t_3 <= 0.0) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - t_1))))); elseif (t_3 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_2 - t_1)))); else tmp = Float64(-4.0 * Float64(U * Float64(Float64(n * (l_m ^ 2.0)) / Om))) ^ 0.5; 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 * (l_m / Om)); t_2 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_3 = (U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2); tmp = 0.0; if (t_3 <= 0.0) tmp = sqrt((2.0 * (U * (n * (t - t_1))))); elseif (t_3 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1)))); else tmp = (-4.0 * (U * ((n * (l_m ^ 2.0)) / Om))) ^ 0.5; 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[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $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[(2.0 * n), $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]}, If[LessEqual[t$95$3, 0.0], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$2 - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(-4.0 * N[(U * N[(N[(n * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\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(2 \cdot n\right)\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_2\right)\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - t\_1\right)\right)\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_2 - t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(-4 \cdot \left(U \cdot \frac{n \cdot {l\_m}^{2}}{Om}\right)\right)}^{0.5}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 10.7%
Simplified36.7%
Taylor expanded in n around 0 36.5%
unpow236.5%
associate-*r/38.5%
*-commutative38.5%
Applied egg-rr38.5%
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 69.6%
Simplified74.5%
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%
Simplified7.9%
Taylor expanded in n around 0 2.0%
pow1/248.7%
associate-*r*47.8%
*-commutative47.8%
associate-*r/47.8%
Applied egg-rr47.8%
Taylor expanded in t around 0 55.6%
associate-/l*55.6%
*-commutative55.6%
Simplified55.6%
Final simplification65.4%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (or (<= n -6.5e-163) (not (<= n 7.5e-95))) (pow (* 2.0 (* (* n U) (- t (/ (* 2.0 (pow l_m 2.0)) Om)))) 0.5) (sqrt (* 2.0 (* U (* n (- t (* 2.0 (* l_m (/ l_m Om))))))))))
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.5e-163) || !(n <= 7.5e-95)) {
tmp = pow((2.0 * ((n * U) * (t - ((2.0 * pow(l_m, 2.0)) / Om)))), 0.5);
} else {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om))))))));
}
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.5d-163)) .or. (.not. (n <= 7.5d-95))) then
tmp = (2.0d0 * ((n * u) * (t - ((2.0d0 * (l_m ** 2.0d0)) / om)))) ** 0.5d0
else
tmp = sqrt((2.0d0 * (u * (n * (t - (2.0d0 * (l_m * (l_m / om))))))))
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.5e-163) || !(n <= 7.5e-95)) {
tmp = Math.pow((2.0 * ((n * U) * (t - ((2.0 * Math.pow(l_m, 2.0)) / Om)))), 0.5);
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om))))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if (n <= -6.5e-163) or not (n <= 7.5e-95): tmp = math.pow((2.0 * ((n * U) * (t - ((2.0 * math.pow(l_m, 2.0)) / Om)))), 0.5) else: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om)))))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if ((n <= -6.5e-163) || !(n <= 7.5e-95)) tmp = Float64(2.0 * Float64(Float64(n * U) * Float64(t - Float64(Float64(2.0 * (l_m ^ 2.0)) / Om)))) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64(l_m * Float64(l_m / Om)))))))); 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.5e-163) || ~((n <= 7.5e-95))) tmp = (2.0 * ((n * U) * (t - ((2.0 * (l_m ^ 2.0)) / Om)))) ^ 0.5; else tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om)))))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[Or[LessEqual[n, -6.5e-163], N[Not[LessEqual[n, 7.5e-95]], $MachinePrecision]], N[Power[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t - N[(N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -6.5 \cdot 10^{-163} \lor \neg \left(n \leq 7.5 \cdot 10^{-95}\right):\\
\;\;\;\;{\left(2 \cdot \left(\left(n \cdot U\right) \cdot \left(t - \frac{2 \cdot {l\_m}^{2}}{Om}\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)\right)}\\
\end{array}
\end{array}
if n < -6.4999999999999999e-163 or 7.5000000000000003e-95 < n Initial program 55.4%
Simplified60.2%
Taylor expanded in n around 0 45.7%
pow1/255.2%
associate-*r*59.2%
*-commutative59.2%
associate-*r/59.2%
Applied egg-rr59.2%
if -6.4999999999999999e-163 < n < 7.5000000000000003e-95Initial program 41.8%
Simplified45.6%
Taylor expanded in n around 0 48.9%
unpow248.9%
associate-*r/54.1%
*-commutative54.1%
Applied egg-rr54.1%
Final simplification57.4%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= n -3.9e-92)
(sqrt (* (* 2.0 n) (* U (+ t (* n (* (pow (/ l_m Om) 2.0) U*))))))
(if (<= n 4.7e-97)
(sqrt (* 2.0 (* U (* n (- t (* 2.0 (* l_m (/ l_m Om))))))))
(pow (* 2.0 (* (* n U) (- t (/ (* 2.0 (pow l_m 2.0)) Om)))) 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 (n <= -3.9e-92) {
tmp = sqrt(((2.0 * n) * (U * (t + (n * (pow((l_m / Om), 2.0) * U_42_))))));
} else if (n <= 4.7e-97) {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om))))))));
} else {
tmp = pow((2.0 * ((n * U) * (t - ((2.0 * pow(l_m, 2.0)) / Om)))), 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 (n <= (-3.9d-92)) then
tmp = sqrt(((2.0d0 * n) * (u * (t + (n * (((l_m / om) ** 2.0d0) * u_42))))))
else if (n <= 4.7d-97) then
tmp = sqrt((2.0d0 * (u * (n * (t - (2.0d0 * (l_m * (l_m / om))))))))
else
tmp = (2.0d0 * ((n * u) * (t - ((2.0d0 * (l_m ** 2.0d0)) / om)))) ** 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 (n <= -3.9e-92) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + (n * (Math.pow((l_m / Om), 2.0) * U_42_))))));
} else if (n <= 4.7e-97) {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om))))))));
} else {
tmp = Math.pow((2.0 * ((n * U) * (t - ((2.0 * Math.pow(l_m, 2.0)) / Om)))), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if n <= -3.9e-92: tmp = math.sqrt(((2.0 * n) * (U * (t + (n * (math.pow((l_m / Om), 2.0) * U_42_)))))) elif n <= 4.7e-97: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om)))))))) else: tmp = math.pow((2.0 * ((n * U) * (t - ((2.0 * math.pow(l_m, 2.0)) / Om)))), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= -3.9e-92) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(n * Float64((Float64(l_m / Om) ^ 2.0) * U_42_)))))); elseif (n <= 4.7e-97) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64(l_m * Float64(l_m / Om)))))))); else tmp = Float64(2.0 * Float64(Float64(n * U) * Float64(t - Float64(Float64(2.0 * (l_m ^ 2.0)) / Om)))) ^ 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 (n <= -3.9e-92) tmp = sqrt(((2.0 * n) * (U * (t + (n * (((l_m / Om) ^ 2.0) * U_42_)))))); elseif (n <= 4.7e-97) tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om)))))))); else tmp = (2.0 * ((n * U) * (t - ((2.0 * (l_m ^ 2.0)) / Om)))) ^ 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[n, -3.9e-92], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(n * N[(N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision] * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 4.7e-97], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t - N[(N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -3.9 \cdot 10^{-92}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + n \cdot \left({\left(\frac{l\_m}{Om}\right)}^{2} \cdot U*\right)\right)\right)}\\
\mathbf{elif}\;n \leq 4.7 \cdot 10^{-97}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(\left(n \cdot U\right) \cdot \left(t - \frac{2 \cdot {l\_m}^{2}}{Om}\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if n < -3.8999999999999997e-92Initial program 60.7%
Simplified65.7%
Taylor expanded in U around 0 56.6%
associate-/l*57.9%
unpow257.9%
unpow257.9%
times-frac65.7%
unpow265.7%
neg-mul-165.7%
distribute-lft-neg-out65.7%
*-commutative65.7%
Simplified65.7%
*-un-lft-identity65.7%
associate-*r*66.8%
associate-*r/61.9%
unpow261.9%
associate-*r*60.7%
Applied egg-rr60.7%
*-lft-identity60.7%
associate-*l*59.6%
*-commutative59.6%
fma-undefine59.6%
distribute-rgt-neg-out59.6%
unsub-neg59.6%
Simplified59.6%
Taylor expanded in Om around 0 58.0%
mul-1-neg58.0%
associate-/l*59.3%
*-commutative59.3%
associate-/l*61.4%
unpow261.4%
unpow261.4%
times-frac65.4%
unpow265.4%
distribute-rgt-neg-out65.4%
*-commutative65.4%
distribute-lft-neg-out65.4%
associate-*r*66.6%
distribute-rgt-neg-in66.6%
distribute-rgt-neg-in66.6%
Simplified66.6%
if -3.8999999999999997e-92 < n < 4.7000000000000002e-97Initial program 43.2%
Simplified47.5%
Taylor expanded in n around 0 48.7%
unpow248.7%
associate-*r/54.3%
*-commutative54.3%
Applied egg-rr54.3%
if 4.7000000000000002e-97 < n Initial program 49.9%
Simplified54.0%
Taylor expanded in n around 0 45.8%
pow1/255.6%
associate-*r*56.8%
*-commutative56.8%
associate-*r/56.8%
Applied egg-rr56.8%
Final simplification58.8%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 1.3e+221) (sqrt (* 2.0 (* U (* n (- t (* 2.0 (* l_m (/ l_m Om)))))))) (pow (* -4.0 (* U (/ (* n (pow l_m 2.0)) Om))) 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 (l_m <= 1.3e+221) {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om))))))));
} else {
tmp = pow((-4.0 * (U * ((n * pow(l_m, 2.0)) / Om))), 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 (l_m <= 1.3d+221) then
tmp = sqrt((2.0d0 * (u * (n * (t - (2.0d0 * (l_m * (l_m / om))))))))
else
tmp = ((-4.0d0) * (u * ((n * (l_m ** 2.0d0)) / om))) ** 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 (l_m <= 1.3e+221) {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om))))))));
} else {
tmp = Math.pow((-4.0 * (U * ((n * Math.pow(l_m, 2.0)) / Om))), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 1.3e+221: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om)))))))) else: tmp = math.pow((-4.0 * (U * ((n * math.pow(l_m, 2.0)) / Om))), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 1.3e+221) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64(l_m * Float64(l_m / Om)))))))); else tmp = Float64(-4.0 * Float64(U * Float64(Float64(n * (l_m ^ 2.0)) / Om))) ^ 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 (l_m <= 1.3e+221) tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om)))))))); else tmp = (-4.0 * (U * ((n * (l_m ^ 2.0)) / Om))) ^ 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[l$95$m, 1.3e+221], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(-4.0 * N[(U * N[(N[(n * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 1.3 \cdot 10^{+221}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(-4 \cdot \left(U \cdot \frac{n \cdot {l\_m}^{2}}{Om}\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 1.30000000000000002e221Initial program 52.5%
Simplified56.4%
Taylor expanded in n around 0 48.5%
unpow248.5%
associate-*r/51.7%
*-commutative51.7%
Applied egg-rr51.7%
if 1.30000000000000002e221 < l Initial program 16.1%
Simplified29.5%
Taylor expanded in n around 0 17.6%
pow1/239.0%
associate-*r*38.8%
*-commutative38.8%
associate-*r/38.8%
Applied egg-rr38.8%
Taylor expanded in t around 0 39.0%
associate-/l*39.0%
*-commutative39.0%
Simplified39.0%
Final simplification51.0%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= n -8.6e+69) (sqrt (* 2.0 (fabs (* t (* n U))))) (sqrt (* 2.0 (* U (* n (- t (* 2.0 (* l_m (/ l_m Om))))))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (n <= -8.6e+69) {
tmp = sqrt((2.0 * fabs((t * (n * U)))));
} else {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om))))))));
}
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 <= (-8.6d+69)) then
tmp = sqrt((2.0d0 * abs((t * (n * u)))))
else
tmp = sqrt((2.0d0 * (u * (n * (t - (2.0d0 * (l_m * (l_m / om))))))))
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 <= -8.6e+69) {
tmp = Math.sqrt((2.0 * Math.abs((t * (n * U)))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om))))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if n <= -8.6e+69: tmp = math.sqrt((2.0 * math.fabs((t * (n * U))))) else: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om)))))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= -8.6e+69) tmp = sqrt(Float64(2.0 * abs(Float64(t * Float64(n * U))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64(l_m * Float64(l_m / Om)))))))); 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 <= -8.6e+69) tmp = sqrt((2.0 * abs((t * (n * U))))); else tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om)))))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[n, -8.6e+69], N[Sqrt[N[(2.0 * N[Abs[N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -8.6 \cdot 10^{+69}:\\
\;\;\;\;\sqrt{2 \cdot \left|t \cdot \left(n \cdot U\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)\right)}\\
\end{array}
\end{array}
if n < -8.59999999999999986e69Initial program 66.1%
Simplified70.7%
Taylor expanded in t around inf 37.0%
associate-*r*50.6%
add-sqr-sqrt50.5%
pow1/250.5%
pow1/255.3%
pow-prod-down49.0%
pow249.0%
*-commutative49.0%
*-commutative49.0%
Applied egg-rr49.0%
unpow1/249.0%
unpow249.0%
rem-sqrt-square55.8%
*-commutative55.8%
Simplified55.8%
if -8.59999999999999986e69 < n Initial program 47.5%
Simplified51.9%
Taylor expanded in n around 0 47.6%
unpow247.6%
associate-*r/52.2%
*-commutative52.2%
Applied egg-rr52.2%
Final simplification52.8%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= n -2.5e+77) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (* 2.0 (* U (* n (- t (* 2.0 (* l_m (/ l_m Om))))))))))
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.5e+77) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om))))))));
}
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.5d+77)) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt((2.0d0 * (u * (n * (t - (2.0d0 * (l_m * (l_m / om))))))))
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.5e+77) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om))))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if n <= -2.5e+77: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om)))))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= -2.5e+77) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64(l_m * Float64(l_m / Om)))))))); 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.5e+77) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (l_m * (l_m / Om)))))))); 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.5e+77], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -2.5 \cdot 10^{+77}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)\right)}\\
\end{array}
\end{array}
if n < -2.50000000000000002e77Initial program 66.1%
Simplified70.7%
Taylor expanded in t around inf 37.0%
pow1/239.3%
associate-*r*55.3%
*-commutative55.3%
*-commutative55.3%
Applied egg-rr55.3%
if -2.50000000000000002e77 < n Initial program 47.5%
Simplified51.9%
Taylor expanded in n around 0 47.6%
unpow247.6%
associate-*r/52.2%
*-commutative52.2%
Applied egg-rr52.2%
Final simplification52.7%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= n -5e+77) (pow (* 2.0 (* t (* n U))) 0.5) (pow (* (* 2.0 U) (* 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 (n <= -5e+77) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = pow(((2.0 * U) * (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 (n <= (-5d+77)) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = ((2.0d0 * u) * (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 (n <= -5e+77) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.pow(((2.0 * U) * (n * t)), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if n <= -5e+77: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.pow(((2.0 * U) * (n * t)), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= -5e+77) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = Float64(Float64(2.0 * U) * 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 (n <= -5e+77) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = ((2.0 * U) * (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[n, -5e+77], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Power[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -5 \cdot 10^{+77}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(2 \cdot U\right) \cdot \left(n \cdot t\right)\right)}^{0.5}\\
\end{array}
\end{array}
if n < -5.00000000000000004e77Initial program 66.1%
Simplified70.7%
Taylor expanded in t around inf 37.0%
pow1/239.3%
associate-*r*55.3%
*-commutative55.3%
*-commutative55.3%
Applied egg-rr55.3%
if -5.00000000000000004e77 < n Initial program 47.5%
Simplified51.9%
Taylor expanded in t around inf 43.3%
associate-*r*43.3%
associate-*l*39.1%
*-commutative39.1%
*-commutative39.1%
*-commutative39.1%
Simplified39.1%
pow1/239.7%
associate-*r*44.0%
*-commutative44.0%
Applied egg-rr44.0%
Final simplification45.8%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= n -5e+26) (pow (* 2.0 (* t (* n U))) 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 (n <= -5e+26) {
tmp = pow((2.0 * (t * (n * U))), 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 (n <= (-5d+26)) then
tmp = (2.0d0 * (t * (n * u))) ** 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 (n <= -5e+26) {
tmp = Math.pow((2.0 * (t * (n * U))), 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 n <= -5e+26: tmp = math.pow((2.0 * (t * (n * U))), 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 (n <= -5e+26) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 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 (n <= -5e+26) tmp = (2.0 * (t * (n * U))) ^ 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[n, -5e+26], N[Power[N[(2.0 * N[(t * N[(n * U), $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}\;n \leq -5 \cdot 10^{+26}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if n < -5.0000000000000001e26Initial program 64.2%
Simplified69.3%
Taylor expanded in t around inf 40.6%
pow1/242.5%
associate-*r*54.4%
*-commutative54.4%
*-commutative54.4%
Applied egg-rr54.4%
if -5.0000000000000001e26 < n Initial program 46.7%
Simplified51.0%
Taylor expanded in t around inf 42.7%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= n -2e+72) (sqrt (* t (* n (* 2.0 U)))) (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 (n <= -2e+72) {
tmp = sqrt((t * (n * (2.0 * U))));
} 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 (n <= (-2d+72)) then
tmp = sqrt((t * (n * (2.0d0 * u))))
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 (n <= -2e+72) {
tmp = Math.sqrt((t * (n * (2.0 * U))));
} 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 n <= -2e+72: tmp = math.sqrt((t * (n * (2.0 * U)))) 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 (n <= -2e+72) tmp = sqrt(Float64(t * Float64(n * Float64(2.0 * U)))); 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 (n <= -2e+72) tmp = sqrt((t * (n * (2.0 * U)))); 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[n, -2e+72], N[Sqrt[N[(t * N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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}\;n \leq -2 \cdot 10^{+72}:\\
\;\;\;\;\sqrt{t \cdot \left(n \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if n < -1.99999999999999989e72Initial program 66.1%
Simplified70.7%
Taylor expanded in t around inf 37.0%
associate-*r*37.0%
associate-*l*50.6%
*-commutative50.6%
*-commutative50.6%
*-commutative50.6%
Simplified50.6%
if -1.99999999999999989e72 < n Initial program 47.5%
Simplified51.9%
Taylor expanded in t around inf 43.3%
Final simplification44.5%
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 50.5%
Simplified55.0%
Taylor expanded in t around inf 42.3%
herbie shell --seed 2024106
(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*))))))