
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
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))))
(if (<= n -1.65e-184)
(sqrt
(*
(* 2.0 (* n U))
(+ t (- (* t_1 (- U* U)) (* 2.0 (* l_m (/ l_m Om)))))))
(if (<= n 1.85e-239)
(sqrt
(* 2.0 (* U (* n (+ t (* 2.0 (/ -1.0 (* (/ 1.0 l_m) (/ Om l_m)))))))))
(*
(sqrt (* n 2.0))
(sqrt
(*
U
(-
t
(fma
(- U U*)
t_1
(* (* 2.0 (/ (pow l_m 1.5) Om)) (sqrt l_m)))))))))))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 tmp;
if (n <= -1.65e-184) {
tmp = sqrt(((2.0 * (n * U)) * (t + ((t_1 * (U_42_ - U)) - (2.0 * (l_m * (l_m / Om)))))));
} else if (n <= 1.85e-239) {
tmp = sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
} else {
tmp = sqrt((n * 2.0)) * sqrt((U * (t - fma((U - U_42_), t_1, ((2.0 * (pow(l_m, 1.5) / Om)) * sqrt(l_m))))));
}
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)) tmp = 0.0 if (n <= -1.65e-184) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(t_1 * Float64(U_42_ - U)) - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); elseif (n <= 1.85e-239) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(2.0 * Float64(-1.0 / Float64(Float64(1.0 / l_m) * Float64(Om / l_m))))))))); else tmp = Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(U * Float64(t - fma(Float64(U - U_42_), t_1, Float64(Float64(2.0 * Float64((l_m ^ 1.5) / Om)) * sqrt(l_m))))))); 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]}, If[LessEqual[n, -1.65e-184], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(t$95$1 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 1.85e-239], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(2.0 * N[(-1.0 / N[(N[(1.0 / l$95$m), $MachinePrecision] * N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t - N[(N[(U - U$42$), $MachinePrecision] * t$95$1 + N[(N[(2.0 * N[(N[Power[l$95$m, 1.5], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * N[Sqrt[l$95$m], $MachinePrecision]), $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}\\
\mathbf{if}\;n \leq -1.65 \cdot 10^{-184}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_1 \cdot \left(U* - U\right) - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{elif}\;n \leq 1.85 \cdot 10^{-239}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + 2 \cdot \frac{-1}{\frac{1}{l\_m} \cdot \frac{Om}{l\_m}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{U \cdot \left(t - \mathsf{fma}\left(U - U*, t\_1, \left(2 \cdot \frac{{l\_m}^{1.5}}{Om}\right) \cdot \sqrt{l\_m}\right)\right)}\\
\end{array}
\end{array}
if n < -1.6499999999999999e-184Initial program 59.7%
Simplified60.7%
if -1.6499999999999999e-184 < n < 1.85000000000000008e-239Initial program 45.7%
Simplified47.9%
Taylor expanded in n around 0 60.5%
clear-num60.5%
inv-pow60.5%
Applied egg-rr60.5%
unpow-160.5%
Simplified60.5%
*-un-lft-identity60.5%
unpow260.5%
times-frac62.9%
Applied egg-rr62.9%
if 1.85000000000000008e-239 < n Initial program 51.2%
Simplified52.6%
sqrt-prod69.8%
fma-undefine69.8%
associate-*r*70.7%
+-commutative70.7%
*-commutative70.7%
fma-define70.7%
associate-*r/67.2%
pow267.2%
Applied egg-rr67.2%
*-commutative67.2%
associate-*r/67.2%
Simplified67.2%
associate-/l*67.2%
unpow267.2%
associate-*r/70.7%
*-commutative70.7%
add-sqr-sqrt25.2%
associate-*l*25.2%
associate-*r*25.2%
associate-*l/23.5%
pow123.5%
pow1/223.5%
pow-prod-up23.5%
metadata-eval23.5%
Applied egg-rr23.5%
Final simplification45.2%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* n 2.0)))
(t_2 (pow (/ l_m Om) 2.0))
(t_3 (* (* n t_2) (- U* U)))
(t_4 (* t_1 (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_3))))
(if (<= t_4 0.0)
(*
(sqrt (* n 2.0))
(sqrt
(* U (+ t (- (* n (* t_2 (- U* U))) (* 2.0 (/ (pow l_m 2.0) Om)))))))
(if (<= t_4 INFINITY)
(sqrt
(* t_1 (+ (- t (* 2.0 (* (sqrt l_m) (* (/ l_m Om) (sqrt l_m))))) t_3)))
(sqrt
(*
-2.0
(*
U
(*
(* n (pow l_m 2.0))
(- (/ 2.0 Om) (* n (/ U* (pow Om 2.0))))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * (n * 2.0);
double t_2 = pow((l_m / Om), 2.0);
double t_3 = (n * t_2) * (U_42_ - U);
double t_4 = t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + t_3);
double tmp;
if (t_4 <= 0.0) {
tmp = sqrt((n * 2.0)) * sqrt((U * (t + ((n * (t_2 * (U_42_ - U))) - (2.0 * (pow(l_m, 2.0) / Om))))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * ((t - (2.0 * (sqrt(l_m) * ((l_m / Om) * sqrt(l_m))))) + t_3)));
} else {
tmp = sqrt((-2.0 * (U * ((n * pow(l_m, 2.0)) * ((2.0 / Om) - (n * (U_42_ / pow(Om, 2.0))))))));
}
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 = U * (n * 2.0);
double t_2 = Math.pow((l_m / Om), 2.0);
double t_3 = (n * t_2) * (U_42_ - U);
double t_4 = t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + t_3);
double tmp;
if (t_4 <= 0.0) {
tmp = Math.sqrt((n * 2.0)) * Math.sqrt((U * (t + ((n * (t_2 * (U_42_ - U))) - (2.0 * (Math.pow(l_m, 2.0) / Om))))));
} else if (t_4 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_1 * ((t - (2.0 * (Math.sqrt(l_m) * ((l_m / Om) * Math.sqrt(l_m))))) + t_3)));
} else {
tmp = Math.sqrt((-2.0 * (U * ((n * Math.pow(l_m, 2.0)) * ((2.0 / Om) - (n * (U_42_ / Math.pow(Om, 2.0))))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = U * (n * 2.0) t_2 = math.pow((l_m / Om), 2.0) t_3 = (n * t_2) * (U_42_ - U) t_4 = t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + t_3) tmp = 0 if t_4 <= 0.0: tmp = math.sqrt((n * 2.0)) * math.sqrt((U * (t + ((n * (t_2 * (U_42_ - U))) - (2.0 * (math.pow(l_m, 2.0) / Om)))))) elif t_4 <= math.inf: tmp = math.sqrt((t_1 * ((t - (2.0 * (math.sqrt(l_m) * ((l_m / Om) * math.sqrt(l_m))))) + t_3))) else: tmp = math.sqrt((-2.0 * (U * ((n * math.pow(l_m, 2.0)) * ((2.0 / Om) - (n * (U_42_ / math.pow(Om, 2.0)))))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(n * 2.0)) t_2 = Float64(l_m / Om) ^ 2.0 t_3 = Float64(Float64(n * t_2) * Float64(U_42_ - U)) t_4 = Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_3)) tmp = 0.0 if (t_4 <= 0.0) tmp = Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(U * Float64(t + Float64(Float64(n * Float64(t_2 * Float64(U_42_ - U))) - Float64(2.0 * Float64((l_m ^ 2.0) / Om))))))); elseif (t_4 <= Inf) tmp = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(sqrt(l_m) * Float64(Float64(l_m / Om) * sqrt(l_m))))) + t_3))); else tmp = sqrt(Float64(-2.0 * Float64(U * Float64(Float64(n * (l_m ^ 2.0)) * Float64(Float64(2.0 / Om) - Float64(n * Float64(U_42_ / (Om ^ 2.0)))))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = U * (n * 2.0); t_2 = (l_m / Om) ^ 2.0; t_3 = (n * t_2) * (U_42_ - U); t_4 = t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + t_3); tmp = 0.0; if (t_4 <= 0.0) tmp = sqrt((n * 2.0)) * sqrt((U * (t + ((n * (t_2 * (U_42_ - U))) - (2.0 * ((l_m ^ 2.0) / Om)))))); elseif (t_4 <= Inf) tmp = sqrt((t_1 * ((t - (2.0 * (sqrt(l_m) * ((l_m / Om) * sqrt(l_m))))) + t_3))); else tmp = sqrt((-2.0 * (U * ((n * (l_m ^ 2.0)) * ((2.0 / Om) - (n * (U_42_ / (Om ^ 2.0)))))))); 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[(U * N[(n * 2.0), $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[(t$95$1 * 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[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t + N[(N[(n * N[(t$95$2 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $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, Infinity], N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[Sqrt[l$95$m], $MachinePrecision] * N[(N[(l$95$m / Om), $MachinePrecision] * N[Sqrt[l$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(-2.0 * N[(U * N[(N[(n * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 / Om), $MachinePrecision] - N[(n * N[(U$42$ / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(n \cdot 2\right)\\
t_2 := {\left(\frac{l\_m}{Om}\right)}^{2}\\
t_3 := \left(n \cdot t\_2\right) \cdot \left(U* - U\right)\\
t_4 := t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_3\right)\\
\mathbf{if}\;t\_4 \leq 0:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{U \cdot \left(t + \left(n \cdot \left(t\_2 \cdot \left(U* - U\right)\right) - 2 \cdot \frac{{l\_m}^{2}}{Om}\right)\right)}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \left(\sqrt{l\_m} \cdot \left(\frac{l\_m}{Om} \cdot \sqrt{l\_m}\right)\right)\right) + t\_3\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-2 \cdot \left(U \cdot \left(\left(n \cdot {l\_m}^{2}\right) \cdot \left(\frac{2}{Om} - n \cdot \frac{U*}{{Om}^{2}}\right)\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 13.6%
Simplified46.2%
sqrt-prod50.2%
fma-undefine50.2%
associate-*r*52.8%
+-commutative52.8%
*-commutative52.8%
fma-define52.8%
associate-*r/52.7%
pow252.7%
Applied egg-rr52.7%
*-commutative52.7%
associate-*r/52.7%
Simplified52.7%
fma-undefine52.7%
*-commutative52.7%
associate-*l*50.2%
associate-/l*50.2%
Applied egg-rr50.2%
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.9%
associate-*r/71.4%
*-commutative71.4%
add-sqr-sqrt32.2%
associate-*r*32.2%
Applied egg-rr32.2%
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%
associate-*r/0.2%
*-commutative0.2%
add-sqr-sqrt0.2%
associate-*r*0.2%
Applied egg-rr0.2%
Taylor expanded in l around inf 31.9%
associate-*r*32.0%
associate-*r/32.0%
metadata-eval32.0%
metadata-eval32.0%
rem-square-sqrt0.0%
unpow20.0%
associate-*r/0.0%
associate-*r/0.0%
unpow20.0%
rem-square-sqrt32.0%
metadata-eval32.0%
associate-/l*32.0%
Simplified32.0%
Taylor expanded in U around 0 32.0%
associate-*r/32.0%
neg-mul-132.0%
Simplified32.0%
Final simplification34.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 (* U (* n 2.0)))
(t_4 (* t_3 (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_2))))
(if (<= t_4 0.0)
(*
(sqrt (* n 2.0))
(sqrt (* U (- t (fma (- U U*) t_1 (/ (* 2.0 (pow l_m 2.0)) Om))))))
(if (<= t_4 INFINITY)
(sqrt
(* t_3 (+ (- t (* 2.0 (* (sqrt l_m) (* (/ l_m Om) (sqrt l_m))))) t_2)))
(sqrt
(*
-2.0
(*
U
(*
(* n (pow l_m 2.0))
(- (/ 2.0 Om) (* n (/ U* (pow Om 2.0))))))))))))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 = U * (n * 2.0);
double t_4 = t_3 * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double tmp;
if (t_4 <= 0.0) {
tmp = sqrt((n * 2.0)) * sqrt((U * (t - fma((U - U_42_), t_1, ((2.0 * pow(l_m, 2.0)) / Om)))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_3 * ((t - (2.0 * (sqrt(l_m) * ((l_m / Om) * sqrt(l_m))))) + t_2)));
} else {
tmp = sqrt((-2.0 * (U * ((n * pow(l_m, 2.0)) * ((2.0 / Om) - (n * (U_42_ / pow(Om, 2.0))))))));
}
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 = Float64(U * Float64(n * 2.0)) t_4 = Float64(t_3 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_2)) tmp = 0.0 if (t_4 <= 0.0) tmp = Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(U * Float64(t - fma(Float64(U - U_42_), t_1, Float64(Float64(2.0 * (l_m ^ 2.0)) / Om)))))); elseif (t_4 <= Inf) tmp = sqrt(Float64(t_3 * Float64(Float64(t - Float64(2.0 * Float64(sqrt(l_m) * Float64(Float64(l_m / Om) * sqrt(l_m))))) + t_2))); else tmp = sqrt(Float64(-2.0 * Float64(U * Float64(Float64(n * (l_m ^ 2.0)) * Float64(Float64(2.0 / Om) - Float64(n * Float64(U_42_ / (Om ^ 2.0)))))))); 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[(t$95$1 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(U * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 * 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$4, 0.0], N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t - N[(N[(U - U$42$), $MachinePrecision] * t$95$1 + N[(N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[(t$95$3 * N[(N[(t - N[(2.0 * N[(N[Sqrt[l$95$m], $MachinePrecision] * N[(N[(l$95$m / Om), $MachinePrecision] * N[Sqrt[l$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(-2.0 * N[(U * N[(N[(n * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 / Om), $MachinePrecision] - N[(n * N[(U$42$ / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision]), $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 := U \cdot \left(n \cdot 2\right)\\
t_4 := t\_3 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_2\right)\\
\mathbf{if}\;t\_4 \leq 0:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{U \cdot \left(t - \mathsf{fma}\left(U - U*, t\_1, \frac{2 \cdot {l\_m}^{2}}{Om}\right)\right)}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{t\_3 \cdot \left(\left(t - 2 \cdot \left(\sqrt{l\_m} \cdot \left(\frac{l\_m}{Om} \cdot \sqrt{l\_m}\right)\right)\right) + t\_2\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-2 \cdot \left(U \cdot \left(\left(n \cdot {l\_m}^{2}\right) \cdot \left(\frac{2}{Om} - n \cdot \frac{U*}{{Om}^{2}}\right)\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 13.6%
Simplified46.2%
sqrt-prod50.2%
fma-undefine50.2%
associate-*r*52.8%
+-commutative52.8%
*-commutative52.8%
fma-define52.8%
associate-*r/52.7%
pow252.7%
Applied egg-rr52.7%
*-commutative52.7%
associate-*r/52.7%
Simplified52.7%
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.9%
associate-*r/71.4%
*-commutative71.4%
add-sqr-sqrt32.2%
associate-*r*32.2%
Applied egg-rr32.2%
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%
associate-*r/0.2%
*-commutative0.2%
add-sqr-sqrt0.2%
associate-*r*0.2%
Applied egg-rr0.2%
Taylor expanded in l around inf 31.9%
associate-*r*32.0%
associate-*r/32.0%
metadata-eval32.0%
metadata-eval32.0%
rem-square-sqrt0.0%
unpow20.0%
associate-*r/0.0%
associate-*r/0.0%
unpow20.0%
rem-square-sqrt32.0%
metadata-eval32.0%
associate-/l*32.0%
Simplified32.0%
Taylor expanded in U around 0 32.0%
associate-*r/32.0%
neg-mul-132.0%
Simplified32.0%
Final simplification35.2%
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)) (sqrt (* 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)))))))
(sqrt
(*
-2.0
(*
U
(*
(pow l_m 2.0)
(* n (- (/ 2.0 Om) (* U* (/ n (pow Om 2.0)))))))))))))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)) * sqrt((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 = sqrt((-2.0 * (U * (pow(l_m, 2.0) * (n * ((2.0 / Om) - (U_42_ * (n / pow(Om, 2.0)))))))));
}
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)) * Math.sqrt((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 = Math.sqrt((-2.0 * (U * (Math.pow(l_m, 2.0) * (n * ((2.0 / Om) - (U_42_ * (n / Math.pow(Om, 2.0)))))))));
}
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)) * math.sqrt((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 = math.sqrt((-2.0 * (U * (math.pow(l_m, 2.0) * (n * ((2.0 / Om) - (U_42_ * (n / math.pow(Om, 2.0))))))))) 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(Float64(n * 2.0)) * sqrt(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 = sqrt(Float64(-2.0 * Float64(U * Float64((l_m ^ 2.0) * Float64(n * Float64(Float64(2.0 / Om) - Float64(U_42_ * Float64(n / (Om ^ 2.0))))))))); 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)) * sqrt((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 = sqrt((-2.0 * (U * ((l_m ^ 2.0) * (n * ((2.0 / Om) - (U_42_ * (n / (Om ^ 2.0))))))))); 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[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[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[Sqrt[N[(-2.0 * N[(U * N[(N[Power[l$95$m, 2.0], $MachinePrecision] * N[(n * N[(N[(2.0 / Om), $MachinePrecision] - N[(U$42$ * N[(n / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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{n \cdot 2} \cdot \sqrt{U \cdot \left(t - 2 \cdot \frac{{l\_m}^{2}}{Om}\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}:\\
\;\;\;\;\sqrt{-2 \cdot \left(U \cdot \left({l\_m}^{2} \cdot \left(n \cdot \left(\frac{2}{Om} - U* \cdot \frac{n}{{Om}^{2}}\right)\right)\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 13.6%
Simplified46.2%
sqrt-prod50.2%
fma-undefine50.2%
associate-*r*52.8%
+-commutative52.8%
*-commutative52.8%
fma-define52.8%
associate-*r/52.7%
pow252.7%
Applied egg-rr52.7%
*-commutative52.7%
associate-*r/52.7%
Simplified52.7%
Taylor expanded in n around 0 47.9%
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.9%
Simplified71.4%
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%
associate-*r/0.2%
*-commutative0.2%
add-sqr-sqrt0.2%
associate-*r*0.2%
Applied egg-rr0.2%
Taylor expanded in l around inf 31.9%
associate-*r*32.0%
associate-*r/32.0%
metadata-eval32.0%
metadata-eval32.0%
rem-square-sqrt0.0%
unpow20.0%
associate-*r/0.0%
associate-*r/0.0%
unpow20.0%
rem-square-sqrt32.0%
metadata-eval32.0%
associate-/l*32.0%
Simplified32.0%
Taylor expanded in U around 0 31.9%
+-commutative31.9%
mul-1-neg31.9%
unsub-neg31.9%
associate-*r/31.9%
metadata-eval31.9%
associate-/l*31.8%
Simplified31.8%
Final simplification63.6%
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)) (sqrt (* 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)))))))
(sqrt
(*
-2.0
(*
U
(*
(* n (pow l_m 2.0))
(- (/ 2.0 Om) (* n (/ U* (pow Om 2.0))))))))))))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)) * sqrt((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 = sqrt((-2.0 * (U * ((n * pow(l_m, 2.0)) * ((2.0 / Om) - (n * (U_42_ / pow(Om, 2.0))))))));
}
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)) * Math.sqrt((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 = Math.sqrt((-2.0 * (U * ((n * Math.pow(l_m, 2.0)) * ((2.0 / Om) - (n * (U_42_ / Math.pow(Om, 2.0))))))));
}
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)) * math.sqrt((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 = math.sqrt((-2.0 * (U * ((n * math.pow(l_m, 2.0)) * ((2.0 / Om) - (n * (U_42_ / math.pow(Om, 2.0)))))))) 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(Float64(n * 2.0)) * sqrt(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 = sqrt(Float64(-2.0 * Float64(U * Float64(Float64(n * (l_m ^ 2.0)) * Float64(Float64(2.0 / Om) - Float64(n * Float64(U_42_ / (Om ^ 2.0)))))))); 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)) * sqrt((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 = sqrt((-2.0 * (U * ((n * (l_m ^ 2.0)) * ((2.0 / Om) - (n * (U_42_ / (Om ^ 2.0)))))))); 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[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[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[Sqrt[N[(-2.0 * N[(U * N[(N[(n * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 / Om), $MachinePrecision] - N[(n * N[(U$42$ / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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{n \cdot 2} \cdot \sqrt{U \cdot \left(t - 2 \cdot \frac{{l\_m}^{2}}{Om}\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}:\\
\;\;\;\;\sqrt{-2 \cdot \left(U \cdot \left(\left(n \cdot {l\_m}^{2}\right) \cdot \left(\frac{2}{Om} - n \cdot \frac{U*}{{Om}^{2}}\right)\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 13.6%
Simplified46.2%
sqrt-prod50.2%
fma-undefine50.2%
associate-*r*52.8%
+-commutative52.8%
*-commutative52.8%
fma-define52.8%
associate-*r/52.7%
pow252.7%
Applied egg-rr52.7%
*-commutative52.7%
associate-*r/52.7%
Simplified52.7%
Taylor expanded in n around 0 47.9%
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.9%
Simplified71.4%
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%
associate-*r/0.2%
*-commutative0.2%
add-sqr-sqrt0.2%
associate-*r*0.2%
Applied egg-rr0.2%
Taylor expanded in l around inf 31.9%
associate-*r*32.0%
associate-*r/32.0%
metadata-eval32.0%
metadata-eval32.0%
rem-square-sqrt0.0%
unpow20.0%
associate-*r/0.0%
associate-*r/0.0%
unpow20.0%
rem-square-sqrt32.0%
metadata-eval32.0%
associate-/l*32.0%
Simplified32.0%
Taylor expanded in U around 0 32.0%
associate-*r/32.0%
neg-mul-132.0%
Simplified32.0%
Final simplification63.6%
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 (* (* n t_1) (- U* U)))
(t_3 (* (* U (* n 2.0)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_2))))
(if (<= t_3 0.0)
(*
(sqrt (* n 2.0))
(sqrt
(* U (+ t (- (* n (* t_1 (- U* 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)))))))
(sqrt
(*
-2.0
(*
U
(*
(* n (pow l_m 2.0))
(- (/ 2.0 Om) (* n (/ U* (pow Om 2.0))))))))))))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 = (n * t_1) * (U_42_ - U);
double t_3 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((n * 2.0)) * sqrt((U * (t + ((n * (t_1 * (U_42_ - U))) - (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 = sqrt((-2.0 * (U * ((n * pow(l_m, 2.0)) * ((2.0 / Om) - (n * (U_42_ / pow(Om, 2.0))))))));
}
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 = Math.pow((l_m / Om), 2.0);
double t_2 = (n * t_1) * (U_42_ - U);
double t_3 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double tmp;
if (t_3 <= 0.0) {
tmp = Math.sqrt((n * 2.0)) * Math.sqrt((U * (t + ((n * (t_1 * (U_42_ - U))) - (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 = Math.sqrt((-2.0 * (U * ((n * Math.pow(l_m, 2.0)) * ((2.0 / Om) - (n * (U_42_ / Math.pow(Om, 2.0))))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = math.pow((l_m / Om), 2.0) t_2 = (n * t_1) * (U_42_ - U) t_3 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2) tmp = 0 if t_3 <= 0.0: tmp = math.sqrt((n * 2.0)) * math.sqrt((U * (t + ((n * (t_1 * (U_42_ - U))) - (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 = math.sqrt((-2.0 * (U * ((n * math.pow(l_m, 2.0)) * ((2.0 / Om) - (n * (U_42_ / math.pow(Om, 2.0)))))))) 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(n * t_1) * 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)) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(U * Float64(t + Float64(Float64(n * Float64(t_1 * Float64(U_42_ - U))) - 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 = sqrt(Float64(-2.0 * Float64(U * Float64(Float64(n * (l_m ^ 2.0)) * Float64(Float64(2.0 / Om) - Float64(n * Float64(U_42_ / (Om ^ 2.0)))))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (l_m / Om) ^ 2.0; t_2 = (n * t_1) * (U_42_ - U); t_3 = (U * (n * 2.0)) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2); tmp = 0.0; if (t_3 <= 0.0) tmp = sqrt((n * 2.0)) * sqrt((U * (t + ((n * (t_1 * (U_42_ - U))) - (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 = sqrt((-2.0 * (U * ((n * (l_m ^ 2.0)) * ((2.0 / Om) - (n * (U_42_ / (Om ^ 2.0)))))))); 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[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$2 = N[(N[(n * t$95$1), $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]}, If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t + N[(N[(n * N[(t$95$1 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $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[Sqrt[N[(-2.0 * N[(U * N[(N[(n * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 / Om), $MachinePrecision] - N[(n * N[(U$42$ / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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(n \cdot t\_1\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)\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{U \cdot \left(t + \left(n \cdot \left(t\_1 \cdot \left(U* - U\right)\right) - 2 \cdot \frac{{l\_m}^{2}}{Om}\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}:\\
\;\;\;\;\sqrt{-2 \cdot \left(U \cdot \left(\left(n \cdot {l\_m}^{2}\right) \cdot \left(\frac{2}{Om} - n \cdot \frac{U*}{{Om}^{2}}\right)\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 13.6%
Simplified46.2%
sqrt-prod50.2%
fma-undefine50.2%
associate-*r*52.8%
+-commutative52.8%
*-commutative52.8%
fma-define52.8%
associate-*r/52.7%
pow252.7%
Applied egg-rr52.7%
*-commutative52.7%
associate-*r/52.7%
Simplified52.7%
fma-undefine52.7%
*-commutative52.7%
associate-*l*50.2%
associate-/l*50.2%
Applied egg-rr50.2%
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.9%
Simplified71.4%
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%
associate-*r/0.2%
*-commutative0.2%
add-sqr-sqrt0.2%
associate-*r*0.2%
Applied egg-rr0.2%
Taylor expanded in l around inf 31.9%
associate-*r*32.0%
associate-*r/32.0%
metadata-eval32.0%
metadata-eval32.0%
rem-square-sqrt0.0%
unpow20.0%
associate-*r/0.0%
associate-*r/0.0%
unpow20.0%
rem-square-sqrt32.0%
metadata-eval32.0%
associate-/l*32.0%
Simplified32.0%
Taylor expanded in U around 0 32.0%
associate-*r/32.0%
neg-mul-132.0%
Simplified32.0%
Final simplification63.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)) (- U* U)))
(t_2 (* (* U (* n 2.0)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1))))
(if (<= t_2 0.0)
(sqrt
(* 2.0 (* U (* n (+ t (* 2.0 (/ -1.0 (* (/ 1.0 l_m) (/ Om l_m)))))))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 (* 2.0 (* l_m (/ l_m Om)))))))
(* (* (sqrt U*) (sqrt U)) (* l_m (/ (* n (sqrt 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)) * (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((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = (sqrt(U_42_) * sqrt(U)) * (l_m * ((n * sqrt(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)) * (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((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
} 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 = (Math.sqrt(U_42_) * Math.sqrt(U)) * (l_m * ((n * Math.sqrt(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)) * (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((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m))))))))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om))))))) else: tmp = (math.sqrt(U_42_) * math.sqrt(U)) * (l_m * ((n * math.sqrt(2.0)) / 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(2.0 * Float64(U * Float64(n * Float64(t + Float64(2.0 * Float64(-1.0 / Float64(Float64(1.0 / l_m) * Float64(Om / l_m))))))))); 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(sqrt(U_42_) * sqrt(U)) * Float64(l_m * Float64(Float64(n * sqrt(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)) * (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((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m))))))))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om))))))); else tmp = (sqrt(U_42_) * sqrt(U)) * (l_m * ((n * sqrt(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 * 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[(2.0 * N[(U * N[(n * N[(t + N[(2.0 * N[(-1.0 / N[(N[(1.0 / l$95$m), $MachinePrecision] * N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $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[Sqrt[U$42$], $MachinePrecision] * N[Sqrt[U], $MachinePrecision]), $MachinePrecision] * N[(l$95$m * N[(N[(n * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $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{2 \cdot \left(U \cdot \left(n \cdot \left(t + 2 \cdot \frac{-1}{\frac{1}{l\_m} \cdot \frac{Om}{l\_m}}\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}:\\
\;\;\;\;\left(\sqrt{U*} \cdot \sqrt{U}\right) \cdot \left(l\_m \cdot \frac{n \cdot \sqrt{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 13.6%
Simplified46.2%
Taylor expanded in n around 0 41.3%
clear-num41.3%
inv-pow41.3%
Applied egg-rr41.3%
unpow-141.3%
Simplified41.3%
*-un-lft-identity41.3%
unpow241.3%
times-frac43.9%
Applied egg-rr43.9%
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.9%
Simplified71.4%
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%
Simplified0.8%
Taylor expanded in U* around -inf 0.0%
mul-1-neg0.0%
*-commutative0.0%
distribute-rgt-neg-in0.0%
associate-/l*0.0%
associate-*r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt22.3%
neg-mul-122.3%
Simplified22.3%
pow1/222.3%
*-commutative22.3%
unpow-prod-down11.4%
pow1/211.4%
pow1/211.4%
Applied egg-rr11.4%
Final simplification60.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)) (- U* U)))
(t_2 (* (* U (* n 2.0)) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1))))
(if (<= t_2 0.0)
(sqrt
(* 2.0 (* U (* n (+ t (* 2.0 (/ -1.0 (* (/ 1.0 l_m) (/ Om l_m)))))))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 (* 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 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((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (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 = 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((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
} 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 = 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_): 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((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m))))))))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (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_) 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(2.0 * Float64(U * Float64(n * Float64(t + Float64(2.0 * Float64(-1.0 / Float64(Float64(1.0 / l_m) * Float64(Om / l_m))))))))); 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(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_) 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((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m))))))))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (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$_] := 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[(2.0 * N[(U * N[(n * N[(t + N[(2.0 * N[(-1.0 / N[(N[(1.0 / l$95$m), $MachinePrecision] * N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $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[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}
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{2 \cdot \left(U \cdot \left(n \cdot \left(t + 2 \cdot \frac{-1}{\frac{1}{l\_m} \cdot \frac{Om}{l\_m}}\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}:\\
\;\;\;\;{\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 (*.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 13.6%
Simplified46.2%
Taylor expanded in n around 0 41.3%
clear-num41.3%
inv-pow41.3%
Applied egg-rr41.3%
unpow-141.3%
Simplified41.3%
*-un-lft-identity41.3%
unpow241.3%
times-frac43.9%
Applied egg-rr43.9%
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.9%
Simplified71.4%
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%
Simplified0.8%
Taylor expanded in n around 0 4.6%
pow1/228.9%
associate-*r*24.8%
*-commutative24.8%
associate-*r/24.8%
Applied egg-rr24.8%
Final simplification62.2%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= U -2.3e-148)
(sqrt
(*
(* 2.0 (* n U))
(+
t
(- (* (* n (pow (/ l_m Om) 2.0)) (- U* U)) (* 2.0 (* l_m (/ l_m Om)))))))
(if (<= U -5e-310)
(sqrt (* 2.0 (* U (* n (- t (* 2.0 (/ (pow l_m 2.0) Om)))))))
(* (sqrt (* 2.0 U)) (sqrt (* n (- t (/ (* 2.0 (pow l_m 2.0)) Om))))))))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.3e-148) {
tmp = sqrt(((2.0 * (n * U)) * (t + (((n * pow((l_m / Om), 2.0)) * (U_42_ - U)) - (2.0 * (l_m * (l_m / Om)))))));
} else if (U <= -5e-310) {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (pow(l_m, 2.0) / Om)))))));
} else {
tmp = sqrt((2.0 * U)) * sqrt((n * (t - ((2.0 * pow(l_m, 2.0)) / 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 (u <= (-2.3d-148)) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (((n * ((l_m / om) ** 2.0d0)) * (u_42 - u)) - (2.0d0 * (l_m * (l_m / om)))))))
else if (u <= (-5d-310)) then
tmp = sqrt((2.0d0 * (u * (n * (t - (2.0d0 * ((l_m ** 2.0d0) / om)))))))
else
tmp = sqrt((2.0d0 * u)) * sqrt((n * (t - ((2.0d0 * (l_m ** 2.0d0)) / 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 (U <= -2.3e-148) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (((n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U)) - (2.0 * (l_m * (l_m / Om)))))));
} else if (U <= -5e-310) {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * (Math.pow(l_m, 2.0) / Om)))))));
} else {
tmp = Math.sqrt((2.0 * U)) * Math.sqrt((n * (t - ((2.0 * Math.pow(l_m, 2.0)) / Om))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U <= -2.3e-148: tmp = math.sqrt(((2.0 * (n * U)) * (t + (((n * math.pow((l_m / Om), 2.0)) * (U_42_ - U)) - (2.0 * (l_m * (l_m / Om))))))) elif U <= -5e-310: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * (math.pow(l_m, 2.0) / Om))))))) else: tmp = math.sqrt((2.0 * U)) * math.sqrt((n * (t - ((2.0 * math.pow(l_m, 2.0)) / Om)))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U <= -2.3e-148) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); elseif (U <= -5e-310) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64((l_m ^ 2.0) / Om))))))); else tmp = Float64(sqrt(Float64(2.0 * U)) * sqrt(Float64(n * Float64(t - Float64(Float64(2.0 * (l_m ^ 2.0)) / 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 (U <= -2.3e-148) tmp = sqrt(((2.0 * (n * U)) * (t + (((n * ((l_m / Om) ^ 2.0)) * (U_42_ - U)) - (2.0 * (l_m * (l_m / Om))))))); elseif (U <= -5e-310) tmp = sqrt((2.0 * (U * (n * (t - (2.0 * ((l_m ^ 2.0) / Om))))))); else tmp = sqrt((2.0 * U)) * sqrt((n * (t - ((2.0 * (l_m ^ 2.0)) / Om)))); 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.3e-148], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[U, -5e-310], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(2.0 * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * N[(t - N[(N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U \leq -2.3 \cdot 10^{-148}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(\left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right) - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{elif}\;U \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{l\_m}^{2}}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot U} \cdot \sqrt{n \cdot \left(t - \frac{2 \cdot {l\_m}^{2}}{Om}\right)}\\
\end{array}
\end{array}
if U < -2.29999999999999997e-148Initial program 66.5%
Simplified70.1%
if -2.29999999999999997e-148 < U < -4.999999999999985e-310Initial program 35.4%
Simplified46.8%
Taylor expanded in n around 0 48.3%
if -4.999999999999985e-310 < U Initial program 51.2%
Simplified51.4%
Taylor expanded in n around 0 51.3%
pow1/253.3%
associate-*r*53.3%
unpow-prod-down64.9%
pow1/263.0%
associate-*r/63.0%
Applied egg-rr63.0%
unpow1/263.0%
Simplified63.0%
Final simplification63.1%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= U -8.2e-110)
(pow (* 2.0 (* (* n U) (- t (/ (* 2.0 (pow l_m 2.0)) Om)))) 0.5)
(if (<= U 2.65e+141)
(sqrt (* 2.0 (* U (* n (+ t (* 2.0 (/ -1.0 (/ Om (pow l_m 2.0)))))))))
(* (sqrt (* 2.0 U)) (sqrt (* 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 <= -8.2e-110) {
tmp = pow((2.0 * ((n * U) * (t - ((2.0 * pow(l_m, 2.0)) / Om)))), 0.5);
} else if (U <= 2.65e+141) {
tmp = sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / (Om / pow(l_m, 2.0)))))))));
} else {
tmp = sqrt((2.0 * U)) * sqrt((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 <= (-8.2d-110)) then
tmp = (2.0d0 * ((n * u) * (t - ((2.0d0 * (l_m ** 2.0d0)) / om)))) ** 0.5d0
else if (u <= 2.65d+141) then
tmp = sqrt((2.0d0 * (u * (n * (t + (2.0d0 * ((-1.0d0) / (om / (l_m ** 2.0d0)))))))))
else
tmp = sqrt((2.0d0 * u)) * sqrt((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 <= -8.2e-110) {
tmp = Math.pow((2.0 * ((n * U) * (t - ((2.0 * Math.pow(l_m, 2.0)) / Om)))), 0.5);
} else if (U <= 2.65e+141) {
tmp = Math.sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / (Om / Math.pow(l_m, 2.0)))))))));
} else {
tmp = Math.sqrt((2.0 * U)) * Math.sqrt((n * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U <= -8.2e-110: tmp = math.pow((2.0 * ((n * U) * (t - ((2.0 * math.pow(l_m, 2.0)) / Om)))), 0.5) elif U <= 2.65e+141: tmp = math.sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / (Om / math.pow(l_m, 2.0))))))))) else: tmp = math.sqrt((2.0 * U)) * math.sqrt((n * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U <= -8.2e-110) tmp = Float64(2.0 * Float64(Float64(n * U) * Float64(t - Float64(Float64(2.0 * (l_m ^ 2.0)) / Om)))) ^ 0.5; elseif (U <= 2.65e+141) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(2.0 * Float64(-1.0 / Float64(Om / (l_m ^ 2.0))))))))); else tmp = Float64(sqrt(Float64(2.0 * U)) * sqrt(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 <= -8.2e-110) tmp = (2.0 * ((n * U) * (t - ((2.0 * (l_m ^ 2.0)) / Om)))) ^ 0.5; elseif (U <= 2.65e+141) tmp = sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / (Om / (l_m ^ 2.0))))))))); else tmp = sqrt((2.0 * U)) * sqrt((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, -8.2e-110], 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], If[LessEqual[U, 2.65e+141], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(2.0 * N[(-1.0 / N[(Om / N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(2.0 * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U \leq -8.2 \cdot 10^{-110}:\\
\;\;\;\;{\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{elif}\;U \leq 2.65 \cdot 10^{+141}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + 2 \cdot \frac{-1}{\frac{Om}{{l\_m}^{2}}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot U} \cdot \sqrt{n \cdot t}\\
\end{array}
\end{array}
if U < -8.19999999999999965e-110Initial program 65.0%
Simplified57.0%
Taylor expanded in n around 0 54.1%
pow1/258.6%
associate-*r*63.5%
*-commutative63.5%
associate-*r/63.5%
Applied egg-rr63.5%
if -8.19999999999999965e-110 < U < 2.65e141Initial program 49.0%
Simplified50.7%
Taylor expanded in n around 0 49.5%
clear-num49.6%
inv-pow49.6%
Applied egg-rr49.6%
unpow-149.6%
Simplified49.6%
if 2.65e141 < U Initial program 52.2%
Simplified60.6%
Taylor expanded in t around inf 56.9%
pow1/261.5%
associate-*r*61.5%
unpow-prod-down78.1%
pow1/278.1%
Applied egg-rr78.1%
unpow1/278.1%
Simplified78.1%
Final simplification56.0%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= U -8.2e-110)
(pow (* 2.0 (* (* n U) (- t (/ (* 2.0 (pow l_m 2.0)) Om)))) 0.5)
(if (<= U 1.12e+141)
(sqrt
(* 2.0 (* U (* n (+ t (* 2.0 (/ -1.0 (* (/ 1.0 l_m) (/ Om l_m)))))))))
(* (sqrt (* 2.0 U)) (sqrt (* 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 <= -8.2e-110) {
tmp = pow((2.0 * ((n * U) * (t - ((2.0 * pow(l_m, 2.0)) / Om)))), 0.5);
} else if (U <= 1.12e+141) {
tmp = sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
} else {
tmp = sqrt((2.0 * U)) * sqrt((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 <= (-8.2d-110)) then
tmp = (2.0d0 * ((n * u) * (t - ((2.0d0 * (l_m ** 2.0d0)) / om)))) ** 0.5d0
else if (u <= 1.12d+141) then
tmp = sqrt((2.0d0 * (u * (n * (t + (2.0d0 * ((-1.0d0) / ((1.0d0 / l_m) * (om / l_m)))))))))
else
tmp = sqrt((2.0d0 * u)) * sqrt((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 <= -8.2e-110) {
tmp = Math.pow((2.0 * ((n * U) * (t - ((2.0 * Math.pow(l_m, 2.0)) / Om)))), 0.5);
} else if (U <= 1.12e+141) {
tmp = Math.sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
} else {
tmp = Math.sqrt((2.0 * U)) * Math.sqrt((n * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U <= -8.2e-110: tmp = math.pow((2.0 * ((n * U) * (t - ((2.0 * math.pow(l_m, 2.0)) / Om)))), 0.5) elif U <= 1.12e+141: tmp = math.sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m))))))))) else: tmp = math.sqrt((2.0 * U)) * math.sqrt((n * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U <= -8.2e-110) tmp = Float64(2.0 * Float64(Float64(n * U) * Float64(t - Float64(Float64(2.0 * (l_m ^ 2.0)) / Om)))) ^ 0.5; elseif (U <= 1.12e+141) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(2.0 * Float64(-1.0 / Float64(Float64(1.0 / l_m) * Float64(Om / l_m))))))))); else tmp = Float64(sqrt(Float64(2.0 * U)) * sqrt(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 <= -8.2e-110) tmp = (2.0 * ((n * U) * (t - ((2.0 * (l_m ^ 2.0)) / Om)))) ^ 0.5; elseif (U <= 1.12e+141) tmp = sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m))))))))); else tmp = sqrt((2.0 * U)) * sqrt((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, -8.2e-110], 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], If[LessEqual[U, 1.12e+141], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(2.0 * N[(-1.0 / N[(N[(1.0 / l$95$m), $MachinePrecision] * N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(2.0 * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U \leq -8.2 \cdot 10^{-110}:\\
\;\;\;\;{\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{elif}\;U \leq 1.12 \cdot 10^{+141}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + 2 \cdot \frac{-1}{\frac{1}{l\_m} \cdot \frac{Om}{l\_m}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot U} \cdot \sqrt{n \cdot t}\\
\end{array}
\end{array}
if U < -8.19999999999999965e-110Initial program 65.0%
Simplified57.0%
Taylor expanded in n around 0 54.1%
pow1/258.6%
associate-*r*63.5%
*-commutative63.5%
associate-*r/63.5%
Applied egg-rr63.5%
if -8.19999999999999965e-110 < U < 1.11999999999999993e141Initial program 49.0%
Simplified50.7%
Taylor expanded in n around 0 49.5%
clear-num49.6%
inv-pow49.6%
Applied egg-rr49.6%
unpow-149.6%
Simplified49.6%
*-un-lft-identity49.6%
unpow249.6%
times-frac49.6%
Applied egg-rr49.6%
if 1.11999999999999993e141 < U Initial program 52.2%
Simplified60.6%
Taylor expanded in t around inf 56.9%
pow1/261.5%
associate-*r*61.5%
unpow-prod-down78.1%
pow1/278.1%
Applied egg-rr78.1%
unpow1/278.1%
Simplified78.1%
Final simplification56.0%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= U 1.8e+141) (sqrt (* 2.0 (* U (* n (+ t (* 2.0 (/ -1.0 (* (/ 1.0 l_m) (/ Om l_m))))))))) (* (sqrt (* 2.0 U)) (sqrt (* 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 <= 1.8e+141) {
tmp = sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
} else {
tmp = sqrt((2.0 * U)) * sqrt((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 <= 1.8d+141) then
tmp = sqrt((2.0d0 * (u * (n * (t + (2.0d0 * ((-1.0d0) / ((1.0d0 / l_m) * (om / l_m)))))))))
else
tmp = sqrt((2.0d0 * u)) * sqrt((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 <= 1.8e+141) {
tmp = Math.sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
} else {
tmp = Math.sqrt((2.0 * U)) * Math.sqrt((n * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U <= 1.8e+141: tmp = math.sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m))))))))) else: tmp = math.sqrt((2.0 * U)) * math.sqrt((n * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U <= 1.8e+141) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(2.0 * Float64(-1.0 / Float64(Float64(1.0 / l_m) * Float64(Om / l_m))))))))); else tmp = Float64(sqrt(Float64(2.0 * U)) * sqrt(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 <= 1.8e+141) tmp = sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m))))))))); else tmp = sqrt((2.0 * U)) * sqrt((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, 1.8e+141], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(2.0 * N[(-1.0 / N[(N[(1.0 / l$95$m), $MachinePrecision] * N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(2.0 * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U \leq 1.8 \cdot 10^{+141}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + 2 \cdot \frac{-1}{\frac{1}{l\_m} \cdot \frac{Om}{l\_m}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot U} \cdot \sqrt{n \cdot t}\\
\end{array}
\end{array}
if U < 1.8000000000000001e141Initial program 54.0%
Simplified52.7%
Taylor expanded in n around 0 51.0%
clear-num51.0%
inv-pow51.0%
Applied egg-rr51.0%
unpow-151.0%
Simplified51.0%
*-un-lft-identity51.0%
unpow251.0%
times-frac52.2%
Applied egg-rr52.2%
if 1.8000000000000001e141 < U Initial program 52.2%
Simplified60.6%
Taylor expanded in t around inf 56.9%
pow1/261.5%
associate-*r*61.5%
unpow-prod-down78.1%
pow1/278.1%
Applied egg-rr78.1%
unpow1/278.1%
Simplified78.1%
Final simplification54.5%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (sqrt (* 2.0 (* U (* n (+ t (* 2.0 (/ -1.0 (* (/ 1.0 l_m) (/ Om l_m))))))))))
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 + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
}
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 + (2.0d0 * ((-1.0d0) / ((1.0d0 / l_m) * (om / l_m)))))))))
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 + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))));
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): return math.sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m)))))))))
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) return sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(2.0 * Float64(-1.0 / Float64(Float64(1.0 / l_m) * Float64(Om / l_m))))))))) end
l_m = abs(l); function tmp = code(n, U, t, l_m, Om, U_42_) tmp = sqrt((2.0 * (U * (n * (t + (2.0 * (-1.0 / ((1.0 / l_m) * (Om / l_m))))))))); 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 * N[(t + N[(2.0 * N[(-1.0 / N[(N[(1.0 / l$95$m), $MachinePrecision] * N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + 2 \cdot \frac{-1}{\frac{1}{l\_m} \cdot \frac{Om}{l\_m}}\right)\right)\right)}
\end{array}
Initial program 53.9%
Simplified53.4%
Taylor expanded in n around 0 51.5%
clear-num51.5%
inv-pow51.5%
Applied egg-rr51.5%
unpow-151.5%
Simplified51.5%
*-un-lft-identity51.5%
unpow251.5%
times-frac52.7%
Applied egg-rr52.7%
Final simplification52.7%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= U -6.5e-121) (sqrt (* 2.0 (* (* n U) t))) (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 <= -6.5e-121) {
tmp = sqrt((2.0 * ((n * U) * t)));
} 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 <= (-6.5d-121)) then
tmp = sqrt((2.0d0 * ((n * u) * t)))
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 <= -6.5e-121) {
tmp = Math.sqrt((2.0 * ((n * U) * t)));
} 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 <= -6.5e-121: tmp = math.sqrt((2.0 * ((n * U) * t))) 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 <= -6.5e-121) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * t))); 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 <= -6.5e-121) tmp = sqrt((2.0 * ((n * U) * t))); 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, -6.5e-121], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * t), $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}\;U \leq -6.5 \cdot 10^{-121}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if U < -6.5000000000000003e-121Initial program 66.3%
Simplified58.7%
Taylor expanded in t around inf 42.1%
associate-*r*48.3%
Simplified48.3%
if -6.5000000000000003e-121 < U Initial program 48.5%
Simplified51.1%
Taylor expanded in t around inf 40.4%
Final simplification42.8%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (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_) {
return pow((2.0 * (U * (n * t))), 0.5);
}
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 = (2.0d0 * (u * (n * t))) ** 0.5d0
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.pow((2.0 * (U * (n * t))), 0.5);
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): return math.pow((2.0 * (U * (n * t))), 0.5)
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) return Float64(2.0 * Float64(U * Float64(n * t))) ^ 0.5 end
l_m = abs(l); function tmp = code(n, U, t, l_m, Om, U_42_) tmp = (2.0 * (U * (n * t))) ^ 0.5; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := N[Power[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
{\left(2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)}^{0.5}
\end{array}
Initial program 53.9%
Simplified53.4%
Taylor expanded in t around inf 40.9%
pow1/243.8%
Applied egg-rr43.8%
Final simplification43.8%
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 53.9%
Simplified53.4%
Taylor expanded in t around inf 40.9%
Final simplification40.9%
herbie shell --seed 2024079
(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*))))))