
(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 29 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 (* U (* 2.0 n)))
(t_2
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_2 2e-156)
(* (sqrt (* U (fma l_m (* (/ l_m Om) -2.0) t))) (sqrt (* 2.0 n)))
(if (<= t_2 2e+152)
t_2
(*
l_m
(sqrt
(*
t_1
(+ (/ t (* l_m l_m)) (/ (- (* n (/ (- U* U) Om)) 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 = U * (2.0 * n);
double t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = sqrt((U * fma(l_m, ((l_m / Om) * -2.0), t))) * sqrt((2.0 * n));
} else if (t_2 <= 2e+152) {
tmp = t_2;
} else {
tmp = l_m * sqrt((t_1 * ((t / (l_m * l_m)) + (((n * ((U_42_ - U) / Om)) - 2.0) / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(2.0 * n)) t_2 = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-156) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(Float64(l_m / Om) * -2.0), t))) * sqrt(Float64(2.0 * n))); elseif (t_2 <= 2e+152) tmp = t_2; else tmp = Float64(l_m * sqrt(Float64(t_1 * Float64(Float64(t / Float64(l_m * l_m)) + Float64(Float64(Float64(n * Float64(Float64(U_42_ - U) / Om)) - 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[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-156], N[(N[Sqrt[N[(U * N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+152], t$95$2, N[(l$95$m * N[Sqrt[N[(t$95$1 * N[(N[(t / N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(n * N[(N[(U$42$ - U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
t_2 := \sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \sqrt{t\_1 \cdot \left(\frac{t}{l\_m \cdot l\_m} + \frac{n \cdot \frac{U* - U}{Om} - 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.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
if 2.0000000000000001e152 < (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 24.6%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr36.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
+-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6430.7
Simplified30.7%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
Applied egg-rr20.8%
Final simplification53.7%
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 (* U (* 2.0 n)))
(t_3
(sqrt
(*
t_2
(+ (- t (* 2.0 t_1)) (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_3 2e-156)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_3 2e+152)
(sqrt (* t_2 (fma -2.0 t_1 t)))
(if (<= t_3 INFINITY)
(sqrt (* U (* (fma l_m (* (/ l_m Om) -2.0) t) (* 2.0 n))))
(/ (* (fabs (* n l_m)) (sqrt (* 2.0 (* U U*)))) Om))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (l_m * l_m) / Om;
double t_2 = U * (2.0 * n);
double t_3 = sqrt((t_2 * ((t - (2.0 * t_1)) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_3 <= 2e-156) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_3 <= 2e+152) {
tmp = sqrt((t_2 * fma(-2.0, t_1, t)));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((U * (fma(l_m, ((l_m / Om) * -2.0), t) * (2.0 * n))));
} else {
tmp = (fabs((n * l_m)) * sqrt((2.0 * (U * U_42_)))) / Om;
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(l_m * l_m) / Om) t_2 = Float64(U * Float64(2.0 * n)) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * t_1)) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_3 <= 2e-156) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_3 <= 2e+152) tmp = sqrt(Float64(t_2 * fma(-2.0, t_1, t))); elseif (t_3 <= Inf) tmp = sqrt(Float64(U * Float64(fma(l_m, Float64(Float64(l_m / Om) * -2.0), t) * Float64(2.0 * n)))); else tmp = Float64(Float64(abs(Float64(n * l_m)) * sqrt(Float64(2.0 * Float64(U * U_42_)))) / 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[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 2e-156], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+152], N[Sqrt[N[(t$95$2 * N[(-2.0 * t$95$1 + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(U * N[(N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision] * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[Abs[N[(n * l$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \frac{l\_m \cdot l\_m}{Om}\\
t_2 := U \cdot \left(2 \cdot n\right)\\
t_3 := \sqrt{t\_2 \cdot \left(\left(t - 2 \cdot t\_1\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_3 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_2 \cdot \mathsf{fma}\left(-2, t\_1, t\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{U \cdot \left(\mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right) \cdot \left(2 \cdot n\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left|n \cdot l\_m\right| \cdot \sqrt{2 \cdot \left(U \cdot U*\right)}}{Om}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000008e-156Initial program 12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr41.9%
Taylor expanded in t around inf
Simplified32.4%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr96.4%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6485.0
Simplified85.0%
if 2.0000000000000001e152 < (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 35.4%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr49.4%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6427.8
Simplified27.8%
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6437.5
Applied egg-rr37.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%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6421.3
Simplified21.3%
sqrt-divN/A
sqrt-prodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
pow1/2N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
unswap-sqrN/A
rem-sqrt-squareN/A
fabs-lowering-fabs.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6429.2
Applied egg-rr29.2%
Final simplification53.8%
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 (sqrt (* t_2 (+ t_1 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_3 2e-156)
(* (sqrt (* U (fma l_m (* (/ l_m Om) -2.0) t))) (sqrt (* 2.0 n)))
(if (<= t_3 2e+152)
(sqrt (* t_2 (+ t_1 (* (* n (/ l_m Om)) (* (/ l_m Om) (- U* U))))))
(*
l_m
(sqrt
(*
t_2
(+ (/ t (* l_m l_m)) (/ (- (* n (/ (- U* U) Om)) 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 = sqrt((t_2 * (t_1 + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_3 <= 2e-156) {
tmp = sqrt((U * fma(l_m, ((l_m / Om) * -2.0), t))) * sqrt((2.0 * n));
} else if (t_3 <= 2e+152) {
tmp = sqrt((t_2 * (t_1 + ((n * (l_m / Om)) * ((l_m / Om) * (U_42_ - U))))));
} else {
tmp = l_m * sqrt((t_2 * ((t / (l_m * l_m)) + (((n * ((U_42_ - U) / Om)) - 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 = sqrt(Float64(t_2 * Float64(t_1 + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_3 <= 2e-156) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(Float64(l_m / Om) * -2.0), t))) * sqrt(Float64(2.0 * n))); elseif (t_3 <= 2e+152) tmp = sqrt(Float64(t_2 * Float64(t_1 + Float64(Float64(n * Float64(l_m / Om)) * Float64(Float64(l_m / Om) * Float64(U_42_ - U)))))); else tmp = Float64(l_m * sqrt(Float64(t_2 * Float64(Float64(t / Float64(l_m * l_m)) + Float64(Float64(Float64(n * Float64(Float64(U_42_ - U) / Om)) - 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[Sqrt[N[(t$95$2 * N[(t$95$1 + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 2e-156], N[(N[Sqrt[N[(U * N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+152], N[Sqrt[N[(t$95$2 * N[(t$95$1 + N[(N[(n * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision] * N[(N[(l$95$m / Om), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(t$95$2 * N[(N[(t / N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(n * N[(N[(U$42$ - U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision] / 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 := \sqrt{t\_2 \cdot \left(t\_1 + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_3 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_2 \cdot \left(t\_1 + \left(n \cdot \frac{l\_m}{Om}\right) \cdot \left(\frac{l\_m}{Om} \cdot \left(U* - U\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \sqrt{t\_2 \cdot \left(\frac{t}{l\_m \cdot l\_m} + \frac{n \cdot \frac{U* - U}{Om} - 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.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
*-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6496.4
Applied egg-rr96.4%
if 2.0000000000000001e152 < (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 24.6%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr36.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
+-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6430.7
Simplified30.7%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
Applied egg-rr20.8%
Final simplification53.0%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n)))
(t_2
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_2 2e-156)
(* (sqrt (* U (fma l_m (* (/ l_m Om) -2.0) t))) (sqrt (* 2.0 n)))
(if (<= t_2 2e+152)
(sqrt
(*
t_1
(fma
(* (* n (/ l_m Om)) (- U* U))
(/ l_m Om)
(fma (* l_m -2.0) (/ l_m Om) t))))
(*
l_m
(sqrt
(*
t_1
(+ (/ t (* l_m l_m)) (/ (- (* n (/ (- U* U) Om)) 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 = U * (2.0 * n);
double t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = sqrt((U * fma(l_m, ((l_m / Om) * -2.0), t))) * sqrt((2.0 * n));
} else if (t_2 <= 2e+152) {
tmp = sqrt((t_1 * fma(((n * (l_m / Om)) * (U_42_ - U)), (l_m / Om), fma((l_m * -2.0), (l_m / Om), t))));
} else {
tmp = l_m * sqrt((t_1 * ((t / (l_m * l_m)) + (((n * ((U_42_ - U) / Om)) - 2.0) / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(2.0 * n)) t_2 = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-156) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(Float64(l_m / Om) * -2.0), t))) * sqrt(Float64(2.0 * n))); elseif (t_2 <= 2e+152) tmp = sqrt(Float64(t_1 * fma(Float64(Float64(n * Float64(l_m / Om)) * Float64(U_42_ - U)), Float64(l_m / Om), fma(Float64(l_m * -2.0), Float64(l_m / Om), t)))); else tmp = Float64(l_m * sqrt(Float64(t_1 * Float64(Float64(t / Float64(l_m * l_m)) + Float64(Float64(Float64(n * Float64(Float64(U_42_ - U) / Om)) - 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[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-156], N[(N[Sqrt[N[(U * N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+152], N[Sqrt[N[(t$95$1 * N[(N[(N[(n * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] * N[(l$95$m / Om), $MachinePrecision] + N[(N[(l$95$m * -2.0), $MachinePrecision] * N[(l$95$m / Om), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(t$95$1 * N[(N[(t / N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(n * N[(N[(U$42$ - U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
t_2 := \sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_1 \cdot \mathsf{fma}\left(\left(n \cdot \frac{l\_m}{Om}\right) \cdot \left(U* - U\right), \frac{l\_m}{Om}, \mathsf{fma}\left(l\_m \cdot -2, \frac{l\_m}{Om}, t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \sqrt{t\_1 \cdot \left(\frac{t}{l\_m \cdot l\_m} + \frac{n \cdot \frac{U* - U}{Om} - 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.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr96.4%
if 2.0000000000000001e152 < (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 24.6%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr36.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
+-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6430.7
Simplified30.7%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
Applied egg-rr20.8%
Final simplification53.0%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n)))
(t_2
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_2 2e-156)
(* (sqrt (* U (fma l_m (* (/ l_m Om) -2.0) t))) (sqrt (* 2.0 n)))
(if (<= t_2 2e+152)
(sqrt
(*
t_1
(fma
(* (/ l_m Om) (- U* U))
(* n (/ l_m Om))
(fma (* l_m -2.0) (/ l_m Om) t))))
(*
l_m
(sqrt
(*
t_1
(+ (/ t (* l_m l_m)) (/ (- (* n (/ (- U* U) Om)) 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 = U * (2.0 * n);
double t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = sqrt((U * fma(l_m, ((l_m / Om) * -2.0), t))) * sqrt((2.0 * n));
} else if (t_2 <= 2e+152) {
tmp = sqrt((t_1 * fma(((l_m / Om) * (U_42_ - U)), (n * (l_m / Om)), fma((l_m * -2.0), (l_m / Om), t))));
} else {
tmp = l_m * sqrt((t_1 * ((t / (l_m * l_m)) + (((n * ((U_42_ - U) / Om)) - 2.0) / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(2.0 * n)) t_2 = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-156) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(Float64(l_m / Om) * -2.0), t))) * sqrt(Float64(2.0 * n))); elseif (t_2 <= 2e+152) tmp = sqrt(Float64(t_1 * fma(Float64(Float64(l_m / Om) * Float64(U_42_ - U)), Float64(n * Float64(l_m / Om)), fma(Float64(l_m * -2.0), Float64(l_m / Om), t)))); else tmp = Float64(l_m * sqrt(Float64(t_1 * Float64(Float64(t / Float64(l_m * l_m)) + Float64(Float64(Float64(n * Float64(Float64(U_42_ - U) / Om)) - 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[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-156], N[(N[Sqrt[N[(U * N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+152], N[Sqrt[N[(t$95$1 * N[(N[(N[(l$95$m / Om), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] * N[(n * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision] + N[(N[(l$95$m * -2.0), $MachinePrecision] * N[(l$95$m / Om), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(t$95$1 * N[(N[(t / N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(n * N[(N[(U$42$ - U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
t_2 := \sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_1 \cdot \mathsf{fma}\left(\frac{l\_m}{Om} \cdot \left(U* - U\right), n \cdot \frac{l\_m}{Om}, \mathsf{fma}\left(l\_m \cdot -2, \frac{l\_m}{Om}, t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \sqrt{t\_1 \cdot \left(\frac{t}{l\_m \cdot l\_m} + \frac{n \cdot \frac{U* - U}{Om} - 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.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr96.4%
Taylor expanded in U around 0
mul-1-negN/A
sub-negN/A
--lowering--.f6496.4
Simplified96.4%
if 2.0000000000000001e152 < (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 24.6%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr36.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
+-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6430.7
Simplified30.7%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
Applied egg-rr20.8%
Final simplification53.0%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n)))
(t_2
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_2 2e-156)
(* (sqrt (* U (fma l_m (* (/ l_m Om) -2.0) t))) (sqrt (* 2.0 n)))
(if (<= t_2 2e+152)
(sqrt
(*
t_1
(fma
(* (/ l_m Om) U*)
(* n (/ l_m Om))
(fma (* l_m -2.0) (/ l_m Om) t))))
(*
l_m
(sqrt
(*
t_1
(+ (/ t (* l_m l_m)) (/ (- (* n (/ (- U* U) Om)) 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 = U * (2.0 * n);
double t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = sqrt((U * fma(l_m, ((l_m / Om) * -2.0), t))) * sqrt((2.0 * n));
} else if (t_2 <= 2e+152) {
tmp = sqrt((t_1 * fma(((l_m / Om) * U_42_), (n * (l_m / Om)), fma((l_m * -2.0), (l_m / Om), t))));
} else {
tmp = l_m * sqrt((t_1 * ((t / (l_m * l_m)) + (((n * ((U_42_ - U) / Om)) - 2.0) / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(2.0 * n)) t_2 = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-156) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(Float64(l_m / Om) * -2.0), t))) * sqrt(Float64(2.0 * n))); elseif (t_2 <= 2e+152) tmp = sqrt(Float64(t_1 * fma(Float64(Float64(l_m / Om) * U_42_), Float64(n * Float64(l_m / Om)), fma(Float64(l_m * -2.0), Float64(l_m / Om), t)))); else tmp = Float64(l_m * sqrt(Float64(t_1 * Float64(Float64(t / Float64(l_m * l_m)) + Float64(Float64(Float64(n * Float64(Float64(U_42_ - U) / Om)) - 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[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-156], N[(N[Sqrt[N[(U * N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+152], N[Sqrt[N[(t$95$1 * N[(N[(N[(l$95$m / Om), $MachinePrecision] * U$42$), $MachinePrecision] * N[(n * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision] + N[(N[(l$95$m * -2.0), $MachinePrecision] * N[(l$95$m / Om), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(t$95$1 * N[(N[(t / N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(n * N[(N[(U$42$ - U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
t_2 := \sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_1 \cdot \mathsf{fma}\left(\frac{l\_m}{Om} \cdot U*, n \cdot \frac{l\_m}{Om}, \mathsf{fma}\left(l\_m \cdot -2, \frac{l\_m}{Om}, t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \sqrt{t\_1 \cdot \left(\frac{t}{l\_m \cdot l\_m} + \frac{n \cdot \frac{U* - U}{Om} - 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.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr96.4%
Taylor expanded in U around 0
Simplified95.5%
if 2.0000000000000001e152 < (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 24.6%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr36.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
+-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6430.7
Simplified30.7%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
Applied egg-rr20.8%
Final simplification52.6%
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 (* U (* 2.0 n)))
(t_3
(sqrt
(*
t_2
(+ (- t (* 2.0 t_1)) (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_3 2e-156)
(* (sqrt (* U (fma l_m (* (/ l_m Om) -2.0) t))) (sqrt (* 2.0 n)))
(if (<= t_3 2e+152)
(sqrt (* t_2 (fma -2.0 t_1 t)))
(*
l_m
(sqrt
(*
t_2
(+ (/ t (* l_m l_m)) (/ (- (* n (/ (- U* U) Om)) 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 = U * (2.0 * n);
double t_3 = sqrt((t_2 * ((t - (2.0 * t_1)) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_3 <= 2e-156) {
tmp = sqrt((U * fma(l_m, ((l_m / Om) * -2.0), t))) * sqrt((2.0 * n));
} else if (t_3 <= 2e+152) {
tmp = sqrt((t_2 * fma(-2.0, t_1, t)));
} else {
tmp = l_m * sqrt((t_2 * ((t / (l_m * l_m)) + (((n * ((U_42_ - U) / Om)) - 2.0) / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(l_m * l_m) / Om) t_2 = Float64(U * Float64(2.0 * n)) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * t_1)) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_3 <= 2e-156) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(Float64(l_m / Om) * -2.0), t))) * sqrt(Float64(2.0 * n))); elseif (t_3 <= 2e+152) tmp = sqrt(Float64(t_2 * fma(-2.0, t_1, t))); else tmp = Float64(l_m * sqrt(Float64(t_2 * Float64(Float64(t / Float64(l_m * l_m)) + Float64(Float64(Float64(n * Float64(Float64(U_42_ - U) / Om)) - 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[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 2e-156], N[(N[Sqrt[N[(U * N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+152], N[Sqrt[N[(t$95$2 * N[(-2.0 * t$95$1 + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(t$95$2 * N[(N[(t / N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(n * N[(N[(U$42$ - U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \frac{l\_m \cdot l\_m}{Om}\\
t_2 := U \cdot \left(2 \cdot n\right)\\
t_3 := \sqrt{t\_2 \cdot \left(\left(t - 2 \cdot t\_1\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_3 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_2 \cdot \mathsf{fma}\left(-2, t\_1, t\right)}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \sqrt{t\_2 \cdot \left(\frac{t}{l\_m \cdot l\_m} + \frac{n \cdot \frac{U* - U}{Om} - 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.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr96.4%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6485.0
Simplified85.0%
if 2.0000000000000001e152 < (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 24.6%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr36.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
+-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6430.7
Simplified30.7%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
Applied egg-rr20.8%
Final simplification48.6%
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 (* U (* 2.0 n)))
(t_3
(sqrt
(*
t_2
(+ (- t (* 2.0 t_1)) (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_3 2e-156)
(* (sqrt (* U (fma l_m (* (/ l_m Om) -2.0) t))) (sqrt (* 2.0 n)))
(if (<= t_3 2e+152)
(sqrt (* t_2 (fma -2.0 t_1 t)))
(*
(sqrt (* (* n U) (- (/ (* n (- U* U)) (* Om Om)) (/ 2.0 Om))))
(* l_m (sqrt 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 = (l_m * l_m) / Om;
double t_2 = U * (2.0 * n);
double t_3 = sqrt((t_2 * ((t - (2.0 * t_1)) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_3 <= 2e-156) {
tmp = sqrt((U * fma(l_m, ((l_m / Om) * -2.0), t))) * sqrt((2.0 * n));
} else if (t_3 <= 2e+152) {
tmp = sqrt((t_2 * fma(-2.0, t_1, t)));
} else {
tmp = sqrt(((n * U) * (((n * (U_42_ - U)) / (Om * Om)) - (2.0 / Om)))) * (l_m * sqrt(2.0));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(l_m * l_m) / Om) t_2 = Float64(U * Float64(2.0 * n)) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * t_1)) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_3 <= 2e-156) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(Float64(l_m / Om) * -2.0), t))) * sqrt(Float64(2.0 * n))); elseif (t_3 <= 2e+152) tmp = sqrt(Float64(t_2 * fma(-2.0, t_1, t))); else tmp = Float64(sqrt(Float64(Float64(n * U) * Float64(Float64(Float64(n * Float64(U_42_ - U)) / Float64(Om * Om)) - Float64(2.0 / Om)))) * Float64(l_m * sqrt(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[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 2e-156], N[(N[Sqrt[N[(U * N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+152], N[Sqrt[N[(t$95$2 * N[(-2.0 * t$95$1 + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \frac{l\_m \cdot l\_m}{Om}\\
t_2 := U \cdot \left(2 \cdot n\right)\\
t_3 := \sqrt{t\_2 \cdot \left(\left(t - 2 \cdot t\_1\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_3 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_2 \cdot \mathsf{fma}\left(-2, t\_1, t\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(n \cdot U\right) \cdot \left(\frac{n \cdot \left(U* - U\right)}{Om \cdot Om} - \frac{2}{Om}\right)} \cdot \left(l\_m \cdot \sqrt{2}\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.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr96.4%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6485.0
Simplified85.0%
if 2.0000000000000001e152 < (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 24.6%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr36.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
Simplified17.5%
Final simplification47.0%
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 (* U (* 2.0 n)))
(t_3
(sqrt
(*
t_2
(+ (- t (* 2.0 t_1)) (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_3 2e-156)
(* (sqrt (* U (fma l_m (* (/ l_m Om) -2.0) t))) (sqrt (* 2.0 n)))
(if (<= t_3 2e+152)
(sqrt (* t_2 (fma -2.0 t_1 t)))
(*
l_m
(sqrt
(* (* n (fma (- U U*) (/ n (* Om Om)) (/ 2.0 Om))) (* U -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 = (l_m * l_m) / Om;
double t_2 = U * (2.0 * n);
double t_3 = sqrt((t_2 * ((t - (2.0 * t_1)) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_3 <= 2e-156) {
tmp = sqrt((U * fma(l_m, ((l_m / Om) * -2.0), t))) * sqrt((2.0 * n));
} else if (t_3 <= 2e+152) {
tmp = sqrt((t_2 * fma(-2.0, t_1, t)));
} else {
tmp = l_m * sqrt(((n * fma((U - U_42_), (n / (Om * Om)), (2.0 / Om))) * (U * -2.0)));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(l_m * l_m) / Om) t_2 = Float64(U * Float64(2.0 * n)) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * t_1)) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_3 <= 2e-156) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(Float64(l_m / Om) * -2.0), t))) * sqrt(Float64(2.0 * n))); elseif (t_3 <= 2e+152) tmp = sqrt(Float64(t_2 * fma(-2.0, t_1, t))); else tmp = Float64(l_m * sqrt(Float64(Float64(n * fma(Float64(U - U_42_), Float64(n / Float64(Om * Om)), Float64(2.0 / Om))) * Float64(U * -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[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 2e-156], N[(N[Sqrt[N[(U * N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+152], N[Sqrt[N[(t$95$2 * N[(-2.0 * t$95$1 + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(N[(n * N[(N[(U - U$42$), $MachinePrecision] * N[(n / N[(Om * Om), $MachinePrecision]), $MachinePrecision] + N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(U * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \frac{l\_m \cdot l\_m}{Om}\\
t_2 := U \cdot \left(2 \cdot n\right)\\
t_3 := \sqrt{t\_2 \cdot \left(\left(t - 2 \cdot t\_1\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_3 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_2 \cdot \mathsf{fma}\left(-2, t\_1, t\right)}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \sqrt{\left(n \cdot \mathsf{fma}\left(U - U*, \frac{n}{Om \cdot Om}, \frac{2}{Om}\right)\right) \cdot \left(U \cdot -2\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.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr96.4%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6485.0
Simplified85.0%
if 2.0000000000000001e152 < (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 24.6%
Taylor expanded in l around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6430.0
Simplified30.0%
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr16.7%
Final simplification46.6%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (fma l_m (* (/ l_m Om) -2.0) t))
(t_2
(sqrt
(*
(* U (* 2.0 n))
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_2 2e-156)
(* (sqrt (* U t_1)) (sqrt (* 2.0 n)))
(if (<= t_2 INFINITY)
(sqrt (* t_1 (* n (* 2.0 U))))
(sqrt (* (* n (/ l_m Om)) (* 2.0 (* U (/ (* U* (* n l_m)) Om)))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = fma(l_m, ((l_m / Om) * -2.0), t);
double t_2 = sqrt(((U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = sqrt((U * t_1)) * sqrt((2.0 * n));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * (n * (2.0 * U))));
} else {
tmp = sqrt(((n * (l_m / Om)) * (2.0 * (U * ((U_42_ * (n * l_m)) / Om)))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = fma(l_m, Float64(Float64(l_m / Om) * -2.0), t) 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 * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-156) tmp = Float64(sqrt(Float64(U * t_1)) * sqrt(Float64(2.0 * n))); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * Float64(n * Float64(2.0 * U)))); else tmp = sqrt(Float64(Float64(n * Float64(l_m / Om)) * Float64(2.0 * Float64(U * Float64(Float64(U_42_ * Float64(n * l_m)) / 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[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $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 * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-156], N[(N[Sqrt[N[(U * t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(t$95$1 * N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(n * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(U * N[(N[(U$42$ * N[(n * l$95$m), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)\\
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 {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot t\_1} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(n \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(n \cdot \frac{l\_m}{Om}\right) \cdot \left(2 \cdot \left(U \cdot \frac{U* \cdot \left(n \cdot l\_m\right)}{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*))))) < 2.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 68.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr74.0%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6457.8
Simplified57.8%
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6462.4
Applied egg-rr62.4%
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%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr6.0%
Taylor expanded in Om around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6423.7
Simplified23.7%
clear-numN/A
un-div-invN/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
times-fracN/A
times-fracN/A
un-div-invN/A
clear-numN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
Applied egg-rr41.0%
Taylor expanded in U around 0
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6440.8
Simplified40.8%
Final simplification57.5%
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 (* U (* 2.0 n)))
(t_3
(sqrt
(*
t_2
(+ (- t (* 2.0 t_1)) (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_3 2e-156)
(* (sqrt (* U (fma l_m (* (/ l_m Om) -2.0) t))) (sqrt (* 2.0 n)))
(if (<= t_3 2e+152)
(sqrt (* t_2 (fma -2.0 t_1 t)))
(* (* (fabs (* n l_m)) (sqrt (* U U*))) (sqrt (/ 2.0 (* Om 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 = U * (2.0 * n);
double t_3 = sqrt((t_2 * ((t - (2.0 * t_1)) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_3 <= 2e-156) {
tmp = sqrt((U * fma(l_m, ((l_m / Om) * -2.0), t))) * sqrt((2.0 * n));
} else if (t_3 <= 2e+152) {
tmp = sqrt((t_2 * fma(-2.0, t_1, t)));
} else {
tmp = (fabs((n * l_m)) * sqrt((U * U_42_))) * sqrt((2.0 / (Om * Om)));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(l_m * l_m) / Om) t_2 = Float64(U * Float64(2.0 * n)) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * t_1)) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_3 <= 2e-156) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(Float64(l_m / Om) * -2.0), t))) * sqrt(Float64(2.0 * n))); elseif (t_3 <= 2e+152) tmp = sqrt(Float64(t_2 * fma(-2.0, t_1, t))); else tmp = Float64(Float64(abs(Float64(n * l_m)) * sqrt(Float64(U * U_42_))) * sqrt(Float64(2.0 / Float64(Om * 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[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 2e-156], N[(N[Sqrt[N[(U * N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+152], N[Sqrt[N[(t$95$2 * N[(-2.0 * t$95$1 + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[Abs[N[(n * l$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(2.0 / N[(Om * Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \frac{l\_m \cdot l\_m}{Om}\\
t_2 := U \cdot \left(2 \cdot n\right)\\
t_3 := \sqrt{t\_2 \cdot \left(\left(t - 2 \cdot t\_1\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_3 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_2 \cdot \mathsf{fma}\left(-2, t\_1, t\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\left|n \cdot l\_m\right| \cdot \sqrt{U \cdot U*}\right) \cdot \sqrt{\frac{2}{Om \cdot Om}}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr96.4%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6485.0
Simplified85.0%
if 2.0000000000000001e152 < (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 24.6%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.4
Simplified26.4%
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr37.1%
Final simplification56.8%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (fma l_m (* (/ l_m Om) -2.0) t))
(t_2 (* U (* 2.0 n)))
(t_3
(sqrt
(*
t_2
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_3 2e-156)
(* (sqrt (* U t_1)) (sqrt (* 2.0 n)))
(if (<= t_3 INFINITY)
(sqrt (* t_1 (* n (* 2.0 U))))
(* l_m (sqrt (* t_2 (/ (* n (- U* U)) (* Om Om)))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = fma(l_m, ((l_m / Om) * -2.0), t);
double t_2 = U * (2.0 * n);
double t_3 = sqrt((t_2 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_3 <= 2e-156) {
tmp = sqrt((U * t_1)) * sqrt((2.0 * n));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * (n * (2.0 * U))));
} else {
tmp = l_m * sqrt((t_2 * ((n * (U_42_ - U)) / (Om * Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = fma(l_m, Float64(Float64(l_m / Om) * -2.0), t) t_2 = Float64(U * Float64(2.0 * n)) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_3 <= 2e-156) tmp = Float64(sqrt(Float64(U * t_1)) * sqrt(Float64(2.0 * n))); elseif (t_3 <= Inf) tmp = sqrt(Float64(t_1 * Float64(n * Float64(2.0 * U)))); else tmp = Float64(l_m * sqrt(Float64(t_2 * Float64(Float64(n * Float64(U_42_ - U)) / Float64(Om * 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[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]}, Block[{t$95$2 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 2e-156], N[(N[Sqrt[N[(U * t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(t$95$1 * N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(t$95$2 * N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)\\
t_2 := U \cdot \left(2 \cdot n\right)\\
t_3 := \sqrt{t\_2 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_3 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{U \cdot t\_1} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(n \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \sqrt{t\_2 \cdot \frac{n \cdot \left(U* - U\right)}{Om \cdot Om}}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.5%
if 2.00000000000000008e-156 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 68.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr74.0%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6457.8
Simplified57.8%
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6462.4
Applied egg-rr62.4%
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%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr6.0%
Taylor expanded in Om around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6423.7
Simplified23.7%
*-commutativeN/A
associate-/l*N/A
associate-*r/N/A
associate-*l*N/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr9.7%
Final simplification52.8%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (fma l_m (* (/ l_m Om) -2.0) t))
(t_2 (* U (* 2.0 n)))
(t_3
(sqrt
(*
t_2
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_3 2e-156)
(* (sqrt n) (sqrt (* 2.0 (* U t_1))))
(if (<= t_3 INFINITY)
(sqrt (* t_1 (* n (* 2.0 U))))
(* l_m (sqrt (* t_2 (/ (* n (- U* U)) (* Om Om)))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = fma(l_m, ((l_m / Om) * -2.0), t);
double t_2 = U * (2.0 * n);
double t_3 = sqrt((t_2 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_3 <= 2e-156) {
tmp = sqrt(n) * sqrt((2.0 * (U * t_1)));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * (n * (2.0 * U))));
} else {
tmp = l_m * sqrt((t_2 * ((n * (U_42_ - U)) / (Om * Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = fma(l_m, Float64(Float64(l_m / Om) * -2.0), t) t_2 = Float64(U * Float64(2.0 * n)) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_3 <= 2e-156) tmp = Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(U * t_1)))); elseif (t_3 <= Inf) tmp = sqrt(Float64(t_1 * Float64(n * Float64(2.0 * U)))); else tmp = Float64(l_m * sqrt(Float64(t_2 * Float64(Float64(n * Float64(U_42_ - U)) / Float64(Om * 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[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]}, Block[{t$95$2 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 2e-156], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(U * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(t$95$1 * N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(t$95$2 * N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right)\\
t_2 := U \cdot \left(2 \cdot n\right)\\
t_3 := \sqrt{t\_2 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_3 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{2 \cdot \left(U \cdot t\_1\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(n \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \sqrt{t\_2 \cdot \frac{n \cdot \left(U* - U\right)}{Om \cdot Om}}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000008e-156Initial program 12.2%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr12.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6412.2
Simplified12.2%
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr48.4%
if 2.00000000000000008e-156 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 68.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr74.0%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6457.8
Simplified57.8%
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6462.4
Applied egg-rr62.4%
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%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr6.0%
Taylor expanded in Om around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6423.7
Simplified23.7%
*-commutativeN/A
associate-/l*N/A
associate-*r/N/A
associate-*l*N/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr9.7%
Final simplification52.7%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n)))
(t_2
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_2 2e-156)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_2 INFINITY)
(sqrt (* (fma l_m (* (/ l_m Om) -2.0) t) (* n (* 2.0 U))))
(* l_m (sqrt (* t_1 (/ (* n (- U* U)) (* Om Om)))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * (2.0 * n);
double t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((fma(l_m, ((l_m / Om) * -2.0), t) * (n * (2.0 * U))));
} else {
tmp = l_m * sqrt((t_1 * ((n * (U_42_ - U)) / (Om * Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(2.0 * n)) t_2 = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-156) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_2 <= Inf) tmp = sqrt(Float64(fma(l_m, Float64(Float64(l_m / Om) * -2.0), t) * Float64(n * Float64(2.0 * U)))); else tmp = Float64(l_m * sqrt(Float64(t_1 * Float64(Float64(n * Float64(U_42_ - U)) / Float64(Om * 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[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-156], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision] * N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(t$95$1 * N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
t_2 := \sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right) \cdot \left(n \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \sqrt{t\_1 \cdot \frac{n \cdot \left(U* - U\right)}{Om \cdot Om}}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000008e-156Initial program 12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr41.9%
Taylor expanded in t around inf
Simplified32.4%
if 2.00000000000000008e-156 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 68.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr74.0%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6457.8
Simplified57.8%
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6462.4
Applied egg-rr62.4%
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%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr6.0%
Taylor expanded in Om around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6423.7
Simplified23.7%
*-commutativeN/A
associate-/l*N/A
associate-*r/N/A
associate-*l*N/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr9.7%
Final simplification50.9%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1
(sqrt
(*
(* U (* 2.0 n))
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_1 2e-156)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_1 INFINITY)
(sqrt (* (fma l_m (* (/ l_m Om) -2.0) t) (* n (* 2.0 U))))
(* (/ 1.0 Om) (* l_m (* (fabs n) (sqrt (* U* (* 2.0 U))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = sqrt(((U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_1 <= 2e-156) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((fma(l_m, ((l_m / Om) * -2.0), t) * (n * (2.0 * U))));
} else {
tmp = (1.0 / Om) * (l_m * (fabs(n) * sqrt((U_42_ * (2.0 * U)))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = sqrt(Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_1 <= 2e-156) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_1 <= Inf) tmp = sqrt(Float64(fma(l_m, Float64(Float64(l_m / Om) * -2.0), t) * Float64(n * Float64(2.0 * U)))); else tmp = Float64(Float64(1.0 / Om) * Float64(l_m * Float64(abs(n) * sqrt(Float64(U_42_ * Float64(2.0 * U)))))); 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[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 * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$1, 2e-156], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[Sqrt[N[(N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision] * N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(1.0 / Om), $MachinePrecision] * N[(l$95$m * N[(N[Abs[n], $MachinePrecision] * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \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 {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_1 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right) \cdot \left(n \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{Om} \cdot \left(l\_m \cdot \left(\left|n\right| \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}\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*))))) < 2.00000000000000008e-156Initial program 12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr41.9%
Taylor expanded in t around inf
Simplified32.4%
if 2.00000000000000008e-156 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 68.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr74.0%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6457.8
Simplified57.8%
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6462.4
Applied egg-rr62.4%
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%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6421.3
Simplified21.3%
clear-numN/A
associate-/r/N/A
sqrt-prodN/A
sqrt-divN/A
metadata-evalN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
pow1/2N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr29.2%
fabs-mulN/A
associate-*l*N/A
rem-sqrt-squareN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6411.0
Applied egg-rr11.0%
Final simplification51.1%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1
(sqrt
(*
(* U (* 2.0 n))
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_1 2e-156)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_1 INFINITY)
(sqrt (* (fma l_m (* (/ l_m Om) -2.0) t) (* n (* 2.0 U))))
(/ (* (fabs (* n l_m)) (sqrt (* 2.0 (* U U*)))) Om)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = sqrt(((U * (2.0 * n)) * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_1 <= 2e-156) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((fma(l_m, ((l_m / Om) * -2.0), t) * (n * (2.0 * U))));
} else {
tmp = (fabs((n * l_m)) * sqrt((2.0 * (U * U_42_)))) / Om;
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = sqrt(Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_1 <= 2e-156) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_1 <= Inf) tmp = sqrt(Float64(fma(l_m, Float64(Float64(l_m / Om) * -2.0), t) * Float64(n * Float64(2.0 * U)))); else tmp = Float64(Float64(abs(Float64(n * l_m)) * sqrt(Float64(2.0 * Float64(U * U_42_)))) / 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[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 * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$1, 2e-156], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[Sqrt[N[(N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision] * N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[Abs[N[(n * l$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \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 {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_1 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right) \cdot \left(n \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left|n \cdot l\_m\right| \cdot \sqrt{2 \cdot \left(U \cdot U*\right)}}{Om}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000008e-156Initial program 12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr41.9%
Taylor expanded in t around inf
Simplified32.4%
if 2.00000000000000008e-156 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 68.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr74.0%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6457.8
Simplified57.8%
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6462.4
Applied egg-rr62.4%
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%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6421.3
Simplified21.3%
sqrt-divN/A
sqrt-prodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
pow1/2N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
unswap-sqrN/A
rem-sqrt-squareN/A
fabs-lowering-fabs.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6429.2
Applied egg-rr29.2%
Final simplification53.8%
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 (* U (* 2.0 n)))
(t_3
(sqrt
(*
t_2
(+ (- t (* 2.0 t_1)) (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_3 2e-156)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_3 INFINITY)
(sqrt (* t_2 (fma -2.0 t_1 t)))
(/ (* (fabs (* n l_m)) (sqrt (* 2.0 (* U U*)))) Om)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (l_m * l_m) / Om;
double t_2 = U * (2.0 * n);
double t_3 = sqrt((t_2 * ((t - (2.0 * t_1)) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_3 <= 2e-156) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((t_2 * fma(-2.0, t_1, t)));
} else {
tmp = (fabs((n * l_m)) * sqrt((2.0 * (U * U_42_)))) / Om;
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(l_m * l_m) / Om) t_2 = Float64(U * Float64(2.0 * n)) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * t_1)) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_3 <= 2e-156) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_3 <= Inf) tmp = sqrt(Float64(t_2 * fma(-2.0, t_1, t))); else tmp = Float64(Float64(abs(Float64(n * l_m)) * sqrt(Float64(2.0 * Float64(U * U_42_)))) / 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[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 2e-156], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(t$95$2 * N[(-2.0 * t$95$1 + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[Abs[N[(n * l$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \frac{l\_m \cdot l\_m}{Om}\\
t_2 := U \cdot \left(2 \cdot n\right)\\
t_3 := \sqrt{t\_2 \cdot \left(\left(t - 2 \cdot t\_1\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_3 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{t\_2 \cdot \mathsf{fma}\left(-2, t\_1, t\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left|n \cdot l\_m\right| \cdot \sqrt{2 \cdot \left(U \cdot U*\right)}}{Om}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000008e-156Initial program 12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr41.9%
Taylor expanded in t around inf
Simplified32.4%
if 2.00000000000000008e-156 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 68.3%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr74.0%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6457.8
Simplified57.8%
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%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6421.3
Simplified21.3%
sqrt-divN/A
sqrt-prodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
pow1/2N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
unswap-sqrN/A
rem-sqrt-squareN/A
fabs-lowering-fabs.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6429.2
Applied egg-rr29.2%
Final simplification50.5%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n)))
(t_2
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_2 2e-156)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_2 2e+152)
(sqrt (* t_1 t))
(/ (* (* l_m (fabs n)) (sqrt (* U* (* 2.0 U)))) Om)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * (2.0 * n);
double t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_2 <= 2e+152) {
tmp = sqrt((t_1 * t));
} else {
tmp = ((l_m * fabs(n)) * sqrt((U_42_ * (2.0 * U)))) / 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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = u * (2.0d0 * n)
t_2 = sqrt((t_1 * ((t - (2.0d0 * ((l_m * l_m) / om))) + ((n * ((l_m / om) ** 2.0d0)) * (u_42 - u)))))
if (t_2 <= 2d-156) then
tmp = sqrt((2.0d0 * n)) * sqrt((u * t))
else if (t_2 <= 2d+152) then
tmp = sqrt((t_1 * t))
else
tmp = ((l_m * abs(n)) * sqrt((u_42 * (2.0d0 * u)))) / 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 t_1 = U * (2.0 * n);
double t_2 = Math.sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * t));
} else if (t_2 <= 2e+152) {
tmp = Math.sqrt((t_1 * t));
} else {
tmp = ((l_m * Math.abs(n)) * Math.sqrt((U_42_ * (2.0 * U)))) / Om;
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = U * (2.0 * n) t_2 = math.sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * math.pow((l_m / Om), 2.0)) * (U_42_ - U))))) tmp = 0 if t_2 <= 2e-156: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * t)) elif t_2 <= 2e+152: tmp = math.sqrt((t_1 * t)) else: tmp = ((l_m * math.fabs(n)) * math.sqrt((U_42_ * (2.0 * U)))) / Om return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(2.0 * n)) t_2 = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-156) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_2 <= 2e+152) tmp = sqrt(Float64(t_1 * t)); else tmp = Float64(Float64(Float64(l_m * abs(n)) * sqrt(Float64(U_42_ * Float64(2.0 * U)))) / Om); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = U * (2.0 * n); t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * ((l_m / Om) ^ 2.0)) * (U_42_ - U))))); tmp = 0.0; if (t_2 <= 2e-156) tmp = sqrt((2.0 * n)) * sqrt((U * t)); elseif (t_2 <= 2e+152) tmp = sqrt((t_1 * t)); else tmp = ((l_m * abs(n)) * sqrt((U_42_ * (2.0 * U)))) / Om; end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-156], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+152], N[Sqrt[N[(t$95$1 * t), $MachinePrecision]], $MachinePrecision], N[(N[(N[(l$95$m * N[Abs[n], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
t_2 := \sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_1 \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(l\_m \cdot \left|n\right|\right) \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}}{Om}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000008e-156Initial program 12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr41.9%
Taylor expanded in t around inf
Simplified32.4%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
Taylor expanded in t around inf
Simplified71.2%
if 2.0000000000000001e152 < (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 24.6%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.4
Simplified26.4%
clear-numN/A
associate-/r/N/A
sqrt-prodN/A
sqrt-divN/A
metadata-evalN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
pow1/2N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr27.1%
*-commutativeN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
fabs-mulN/A
rem-sqrt-squareN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6420.8
Applied egg-rr20.8%
Final simplification41.5%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n)))
(t_2
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_2 2e-156)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_2 2e+152)
(sqrt (* t_1 t))
(/ (* (fabs (* n l_m)) (sqrt (* 2.0 (* U U*)))) Om)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * (2.0 * n);
double t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_2 <= 2e+152) {
tmp = sqrt((t_1 * t));
} else {
tmp = (fabs((n * l_m)) * sqrt((2.0 * (U * U_42_)))) / 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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = u * (2.0d0 * n)
t_2 = sqrt((t_1 * ((t - (2.0d0 * ((l_m * l_m) / om))) + ((n * ((l_m / om) ** 2.0d0)) * (u_42 - u)))))
if (t_2 <= 2d-156) then
tmp = sqrt((2.0d0 * n)) * sqrt((u * t))
else if (t_2 <= 2d+152) then
tmp = sqrt((t_1 * t))
else
tmp = (abs((n * l_m)) * sqrt((2.0d0 * (u * u_42)))) / 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 t_1 = U * (2.0 * n);
double t_2 = Math.sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * t));
} else if (t_2 <= 2e+152) {
tmp = Math.sqrt((t_1 * t));
} else {
tmp = (Math.abs((n * l_m)) * Math.sqrt((2.0 * (U * U_42_)))) / Om;
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = U * (2.0 * n) t_2 = math.sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * math.pow((l_m / Om), 2.0)) * (U_42_ - U))))) tmp = 0 if t_2 <= 2e-156: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * t)) elif t_2 <= 2e+152: tmp = math.sqrt((t_1 * t)) else: tmp = (math.fabs((n * l_m)) * math.sqrt((2.0 * (U * U_42_)))) / Om return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(2.0 * n)) t_2 = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-156) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_2 <= 2e+152) tmp = sqrt(Float64(t_1 * t)); else tmp = Float64(Float64(abs(Float64(n * l_m)) * sqrt(Float64(2.0 * Float64(U * U_42_)))) / Om); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = U * (2.0 * n); t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * ((l_m / Om) ^ 2.0)) * (U_42_ - U))))); tmp = 0.0; if (t_2 <= 2e-156) tmp = sqrt((2.0 * n)) * sqrt((U * t)); elseif (t_2 <= 2e+152) tmp = sqrt((t_1 * t)); else tmp = (abs((n * l_m)) * sqrt((2.0 * (U * U_42_)))) / 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[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-156], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+152], N[Sqrt[N[(t$95$1 * t), $MachinePrecision]], $MachinePrecision], N[(N[(N[Abs[N[(n * l$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
t_2 := \sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_1 \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left|n \cdot l\_m\right| \cdot \sqrt{2 \cdot \left(U \cdot U*\right)}}{Om}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000008e-156Initial program 12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr41.9%
Taylor expanded in t around inf
Simplified32.4%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
Taylor expanded in t around inf
Simplified71.2%
if 2.0000000000000001e152 < (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 24.6%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.4
Simplified26.4%
sqrt-divN/A
sqrt-prodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
pow1/2N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
unswap-sqrN/A
rem-sqrt-squareN/A
fabs-lowering-fabs.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6427.1
Applied egg-rr27.1%
Final simplification44.6%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n)))
(t_2
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_2 2e-156)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_2 2e+152)
(sqrt (* t_1 t))
(* (sqrt (* U* (* 2.0 U))) (/ (* l_m (fabs n)) Om))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * (2.0 * n);
double t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_2 <= 2e+152) {
tmp = sqrt((t_1 * t));
} else {
tmp = sqrt((U_42_ * (2.0 * U))) * ((l_m * fabs(n)) / 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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = u * (2.0d0 * n)
t_2 = sqrt((t_1 * ((t - (2.0d0 * ((l_m * l_m) / om))) + ((n * ((l_m / om) ** 2.0d0)) * (u_42 - u)))))
if (t_2 <= 2d-156) then
tmp = sqrt((2.0d0 * n)) * sqrt((u * t))
else if (t_2 <= 2d+152) then
tmp = sqrt((t_1 * t))
else
tmp = sqrt((u_42 * (2.0d0 * u))) * ((l_m * abs(n)) / 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 t_1 = U * (2.0 * n);
double t_2 = Math.sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_2 <= 2e-156) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * t));
} else if (t_2 <= 2e+152) {
tmp = Math.sqrt((t_1 * t));
} else {
tmp = Math.sqrt((U_42_ * (2.0 * U))) * ((l_m * Math.abs(n)) / Om);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = U * (2.0 * n) t_2 = math.sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * math.pow((l_m / Om), 2.0)) * (U_42_ - U))))) tmp = 0 if t_2 <= 2e-156: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * t)) elif t_2 <= 2e+152: tmp = math.sqrt((t_1 * t)) else: tmp = math.sqrt((U_42_ * (2.0 * U))) * ((l_m * math.fabs(n)) / Om) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(2.0 * n)) t_2 = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 2e-156) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_2 <= 2e+152) tmp = sqrt(Float64(t_1 * t)); else tmp = Float64(sqrt(Float64(U_42_ * Float64(2.0 * U))) * Float64(Float64(l_m * abs(n)) / Om)); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = U * (2.0 * n); t_2 = sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * ((l_m / Om) ^ 2.0)) * (U_42_ - U))))); tmp = 0.0; if (t_2 <= 2e-156) tmp = sqrt((2.0 * n)) * sqrt((U * t)); elseif (t_2 <= 2e+152) tmp = sqrt((t_1 * t)); else tmp = sqrt((U_42_ * (2.0 * U))) * ((l_m * abs(n)) / 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[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 2e-156], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+152], N[Sqrt[N[(t$95$1 * t), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(l$95$m * N[Abs[n], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
t_2 := \sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_2 \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{t\_1 \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U* \cdot \left(2 \cdot U\right)} \cdot \frac{l\_m \cdot \left|n\right|}{Om}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000008e-156Initial program 12.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr41.9%
Taylor expanded in t around inf
Simplified32.4%
if 2.00000000000000008e-156 < (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.0000000000000001e152Initial program 98.3%
Taylor expanded in t around inf
Simplified71.2%
if 2.0000000000000001e152 < (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 24.6%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.4
Simplified26.4%
clear-numN/A
associate-/r/N/A
sqrt-prodN/A
sqrt-divN/A
metadata-evalN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
pow1/2N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr27.1%
associate-*r*N/A
*-lowering-*.f64N/A
associate-*l/N/A
metadata-evalN/A
fabs-mulN/A
neg-mul-1N/A
neg-fabsN/A
/-lowering-/.f64N/A
fabs-mulN/A
rem-sqrt-squareN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6419.4
Applied egg-rr19.4%
Final simplification40.7%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n))))
(if (<=
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))
2e-156)
(sqrt (* n (* t (* 2.0 U))))
(sqrt (* t_1 t)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * (2.0 * n);
double tmp;
if (sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U))))) <= 2e-156) {
tmp = sqrt((n * (t * (2.0 * U))));
} else {
tmp = sqrt((t_1 * t));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = u * (2.0d0 * n)
if (sqrt((t_1 * ((t - (2.0d0 * ((l_m * l_m) / om))) + ((n * ((l_m / om) ** 2.0d0)) * (u_42 - u))))) <= 2d-156) then
tmp = sqrt((n * (t * (2.0d0 * u))))
else
tmp = sqrt((t_1 * t))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * (2.0 * n);
double tmp;
if (Math.sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U))))) <= 2e-156) {
tmp = Math.sqrt((n * (t * (2.0 * U))));
} else {
tmp = Math.sqrt((t_1 * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = U * (2.0 * n) tmp = 0 if math.sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * math.pow((l_m / Om), 2.0)) * (U_42_ - U))))) <= 2e-156: tmp = math.sqrt((n * (t * (2.0 * U)))) else: tmp = math.sqrt((t_1 * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(2.0 * n)) tmp = 0.0 if (sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) <= 2e-156) tmp = sqrt(Float64(n * Float64(t * Float64(2.0 * U)))); else tmp = sqrt(Float64(t_1 * t)); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = U * (2.0 * n); tmp = 0.0; if (sqrt((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * ((l_m / Om) ^ 2.0)) * (U_42_ - U))))) <= 2e-156) tmp = sqrt((n * (t * (2.0 * U)))); else tmp = sqrt((t_1 * t)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2e-156], N[Sqrt[N[(n * N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 * t), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
\mathbf{if}\;\sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)} \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\sqrt{n \cdot \left(t \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 \cdot t}\\
\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.00000000000000008e-156Initial program 12.2%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6424.9
Simplified24.9%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6427.4
Applied egg-rr27.4%
if 2.00000000000000008e-156 < (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 56.5%
Taylor expanded in t around inf
Simplified35.5%
Final simplification34.6%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n))))
(if (<=
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U))))
0.0)
(sqrt (* (* 2.0 U) (* n t)))
(sqrt (* t_1 t)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * (2.0 * n);
double tmp;
if ((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))) <= 0.0) {
tmp = sqrt(((2.0 * U) * (n * t)));
} else {
tmp = sqrt((t_1 * t));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = u * (2.0d0 * n)
if ((t_1 * ((t - (2.0d0 * ((l_m * l_m) / om))) + ((n * ((l_m / om) ** 2.0d0)) * (u_42 - u)))) <= 0.0d0) then
tmp = sqrt(((2.0d0 * u) * (n * t)))
else
tmp = sqrt((t_1 * t))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * (2.0 * n);
double tmp;
if ((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U)))) <= 0.0) {
tmp = Math.sqrt(((2.0 * U) * (n * t)));
} else {
tmp = Math.sqrt((t_1 * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = U * (2.0 * n) tmp = 0 if (t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * math.pow((l_m / Om), 2.0)) * (U_42_ - U)))) <= 0.0: tmp = math.sqrt(((2.0 * U) * (n * t))) else: tmp = math.sqrt((t_1 * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * Float64(2.0 * n)) tmp = 0.0 if (Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)))) <= 0.0) tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * t))); else tmp = sqrt(Float64(t_1 * t)); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = U * (2.0 * n); tmp = 0.0; if ((t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * ((l_m / Om) ^ 2.0)) * (U_42_ - U)))) <= 0.0) tmp = sqrt(((2.0 * U) * (n * t))); else tmp = sqrt((t_1 * t)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 * t), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
\mathbf{if}\;t\_1 \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right) \leq 0:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 \cdot t}\\
\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 9.2%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6424.1
Simplified24.1%
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*)))) Initial program 57.1%
Taylor expanded in t around inf
Simplified36.0%
Final simplification34.6%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (sqrt (* (fma l_m (* (/ l_m Om) -2.0) t) (* n (* 2.0 U))))))
(if (<= Om -6e-91)
t_1
(if (<= Om -4e-310)
(* (* (fabs (* n l_m)) (sqrt (* U U*))) (- (/ (sqrt 2.0) Om)))
(if (<= Om 10000000000.0)
(/ (* (* l_m (fabs n)) (sqrt (* U* (* 2.0 U)))) Om)
t_1)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = sqrt((fma(l_m, ((l_m / Om) * -2.0), t) * (n * (2.0 * U))));
double tmp;
if (Om <= -6e-91) {
tmp = t_1;
} else if (Om <= -4e-310) {
tmp = (fabs((n * l_m)) * sqrt((U * U_42_))) * -(sqrt(2.0) / Om);
} else if (Om <= 10000000000.0) {
tmp = ((l_m * fabs(n)) * sqrt((U_42_ * (2.0 * U)))) / Om;
} else {
tmp = t_1;
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = sqrt(Float64(fma(l_m, Float64(Float64(l_m / Om) * -2.0), t) * Float64(n * Float64(2.0 * U)))) tmp = 0.0 if (Om <= -6e-91) tmp = t_1; elseif (Om <= -4e-310) tmp = Float64(Float64(abs(Float64(n * l_m)) * sqrt(Float64(U * U_42_))) * Float64(-Float64(sqrt(2.0) / Om))); elseif (Om <= 10000000000.0) tmp = Float64(Float64(Float64(l_m * abs(n)) * sqrt(Float64(U_42_ * Float64(2.0 * U)))) / Om); else tmp = t_1; 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[Sqrt[N[(N[(l$95$m * N[(N[(l$95$m / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision] * N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[Om, -6e-91], t$95$1, If[LessEqual[Om, -4e-310], N[(N[(N[Abs[N[(n * l$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / Om), $MachinePrecision])), $MachinePrecision], If[LessEqual[Om, 10000000000.0], N[(N[(N[(l$95$m * N[Abs[n], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \sqrt{\mathsf{fma}\left(l\_m, \frac{l\_m}{Om} \cdot -2, t\right) \cdot \left(n \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{if}\;Om \leq -6 \cdot 10^{-91}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;Om \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\left(\left|n \cdot l\_m\right| \cdot \sqrt{U \cdot U*}\right) \cdot \left(-\frac{\sqrt{2}}{Om}\right)\\
\mathbf{elif}\;Om \leq 10000000000:\\
\;\;\;\;\frac{\left(l\_m \cdot \left|n\right|\right) \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}}{Om}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if Om < -6.0000000000000004e-91 or 1e10 < Om Initial program 56.5%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr64.5%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6454.5
Simplified54.5%
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6460.0
Applied egg-rr60.0%
if -6.0000000000000004e-91 < Om < -3.999999999999988e-310Initial program 42.4%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6419.7
Simplified19.7%
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr31.1%
Taylor expanded in Om around -inf
mul-1-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6448.1
Simplified48.1%
if -3.999999999999988e-310 < Om < 1e10Initial program 43.3%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6433.8
Simplified33.8%
clear-numN/A
associate-/r/N/A
sqrt-prodN/A
sqrt-divN/A
metadata-evalN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
pow1/2N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr57.0%
*-commutativeN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
fabs-mulN/A
rem-sqrt-squareN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6427.3
Applied egg-rr27.3%
Final simplification51.2%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 4.4e+34) (sqrt (* (* U (* 2.0 n)) t)) (sqrt (/ (* (* U -4.0) (* n (* 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 (l_m <= 4.4e+34) {
tmp = sqrt(((U * (2.0 * n)) * t));
} else {
tmp = sqrt((((U * -4.0) * (n * (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 (l_m <= 4.4d+34) then
tmp = sqrt(((u * (2.0d0 * n)) * t))
else
tmp = sqrt((((u * (-4.0d0)) * (n * (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 (l_m <= 4.4e+34) {
tmp = Math.sqrt(((U * (2.0 * n)) * t));
} else {
tmp = Math.sqrt((((U * -4.0) * (n * (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 l_m <= 4.4e+34: tmp = math.sqrt(((U * (2.0 * n)) * t)) else: tmp = math.sqrt((((U * -4.0) * (n * (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 (l_m <= 4.4e+34) tmp = sqrt(Float64(Float64(U * Float64(2.0 * n)) * t)); else tmp = sqrt(Float64(Float64(Float64(U * -4.0) * Float64(n * Float64(l_m * 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 (l_m <= 4.4e+34) tmp = sqrt(((U * (2.0 * n)) * t)); else tmp = sqrt((((U * -4.0) * (n * (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[l$95$m, 4.4e+34], N[Sqrt[N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(U * -4.0), $MachinePrecision] * N[(n * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 4.4 \cdot 10^{+34}:\\
\;\;\;\;\sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\left(U \cdot -4\right) \cdot \left(n \cdot \left(l\_m \cdot l\_m\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 4.4000000000000005e34Initial program 55.1%
Taylor expanded in t around inf
Simplified37.3%
if 4.4000000000000005e34 < l Initial program 28.8%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr37.1%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6428.8
Simplified28.8%
Taylor expanded in l around inf
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6431.7
Simplified31.7%
Final simplification36.5%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 5.2e+76) (sqrt (* (* U (* 2.0 n)) t)) (sqrt (/ (* -4.0 (* n (* U (* 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 (l_m <= 5.2e+76) {
tmp = sqrt(((U * (2.0 * n)) * t));
} else {
tmp = sqrt(((-4.0 * (n * (U * (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 (l_m <= 5.2d+76) then
tmp = sqrt(((u * (2.0d0 * n)) * t))
else
tmp = sqrt((((-4.0d0) * (n * (u * (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 (l_m <= 5.2e+76) {
tmp = Math.sqrt(((U * (2.0 * n)) * t));
} else {
tmp = Math.sqrt(((-4.0 * (n * (U * (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 l_m <= 5.2e+76: tmp = math.sqrt(((U * (2.0 * n)) * t)) else: tmp = math.sqrt(((-4.0 * (n * (U * (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 (l_m <= 5.2e+76) tmp = sqrt(Float64(Float64(U * Float64(2.0 * n)) * t)); else tmp = sqrt(Float64(Float64(-4.0 * Float64(n * Float64(U * Float64(l_m * 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 (l_m <= 5.2e+76) tmp = sqrt(((U * (2.0 * n)) * t)); else tmp = sqrt(((-4.0 * (n * (U * (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[l$95$m, 5.2e+76], N[Sqrt[N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(-4.0 * N[(n * N[(U * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 5.2 \cdot 10^{+76}:\\
\;\;\;\;\sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-4 \cdot \left(n \cdot \left(U \cdot \left(l\_m \cdot l\_m\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 5.1999999999999999e76Initial program 54.6%
Taylor expanded in t around inf
Simplified36.5%
if 5.1999999999999999e76 < l Initial program 27.5%
Taylor expanded in l around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6428.9
Simplified28.9%
Taylor expanded in n around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6437.6
Simplified37.6%
Final simplification36.6%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= U -5e-310) (sqrt (* (* U (* 2.0 n)) t)) (* (sqrt (* 2.0 (* n t))) (sqrt U))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U <= -5e-310) {
tmp = sqrt(((U * (2.0 * n)) * t));
} else {
tmp = sqrt((2.0 * (n * t))) * sqrt(U);
}
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 <= (-5d-310)) then
tmp = sqrt(((u * (2.0d0 * n)) * t))
else
tmp = sqrt((2.0d0 * (n * t))) * sqrt(u)
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 <= -5e-310) {
tmp = Math.sqrt(((U * (2.0 * n)) * t));
} else {
tmp = Math.sqrt((2.0 * (n * t))) * Math.sqrt(U);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U <= -5e-310: tmp = math.sqrt(((U * (2.0 * n)) * t)) else: tmp = math.sqrt((2.0 * (n * t))) * math.sqrt(U) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U <= -5e-310) tmp = sqrt(Float64(Float64(U * Float64(2.0 * n)) * t)); else tmp = Float64(sqrt(Float64(2.0 * Float64(n * t))) * sqrt(U)); 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 <= -5e-310) tmp = sqrt(((U * (2.0 * n)) * t)); else tmp = sqrt((2.0 * (n * t))) * sqrt(U); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[U, -5e-310], N[Sqrt[N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[U], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot t\right)} \cdot \sqrt{U}\\
\end{array}
\end{array}
if U < -4.999999999999985e-310Initial program 49.4%
Taylor expanded in t around inf
Simplified31.5%
if -4.999999999999985e-310 < U Initial program 53.4%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.6
Simplified35.6%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6443.1
Applied egg-rr43.1%
Final simplification37.1%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= U -5e-310) (sqrt (* (* U (* 2.0 n)) t)) (* (sqrt (* n t)) (sqrt (* 2.0 U)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U <= -5e-310) {
tmp = sqrt(((U * (2.0 * n)) * t));
} else {
tmp = sqrt((n * t)) * sqrt((2.0 * U));
}
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 <= (-5d-310)) then
tmp = sqrt(((u * (2.0d0 * n)) * t))
else
tmp = sqrt((n * t)) * sqrt((2.0d0 * u))
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 <= -5e-310) {
tmp = Math.sqrt(((U * (2.0 * n)) * t));
} else {
tmp = Math.sqrt((n * t)) * Math.sqrt((2.0 * U));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U <= -5e-310: tmp = math.sqrt(((U * (2.0 * n)) * t)) else: tmp = math.sqrt((n * t)) * math.sqrt((2.0 * U)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U <= -5e-310) tmp = sqrt(Float64(Float64(U * Float64(2.0 * n)) * t)); else tmp = Float64(sqrt(Float64(n * t)) * sqrt(Float64(2.0 * U))); 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 <= -5e-310) tmp = sqrt(((U * (2.0 * n)) * t)); else tmp = sqrt((n * t)) * sqrt((2.0 * U)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[U, -5e-310], N[Sqrt[N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * t), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * U), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot t} \cdot \sqrt{2 \cdot U}\\
\end{array}
\end{array}
if U < -4.999999999999985e-310Initial program 49.4%
Taylor expanded in t around inf
Simplified31.5%
if -4.999999999999985e-310 < U Initial program 53.4%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.6
Simplified35.6%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6443.1
Applied egg-rr43.1%
Final simplification37.1%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= n 3.5e-301) (sqrt (* (* 2.0 U) (* n t))) (* (sqrt (* 2.0 n)) (sqrt (* U t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (n <= 3.5e-301) {
tmp = sqrt(((2.0 * U) * (n * t)));
} else {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (n <= 3.5d-301) then
tmp = sqrt(((2.0d0 * u) * (n * t)))
else
tmp = sqrt((2.0d0 * n)) * sqrt((u * t))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (n <= 3.5e-301) {
tmp = Math.sqrt(((2.0 * U) * (n * t)));
} else {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if n <= 3.5e-301: tmp = math.sqrt(((2.0 * U) * (n * t))) else: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= 3.5e-301) tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * t))); else tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (n <= 3.5e-301) tmp = sqrt(((2.0 * U) * (n * t))); else tmp = sqrt((2.0 * n)) * sqrt((U * t)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[n, 3.5e-301], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq 3.5 \cdot 10^{-301}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\end{array}
\end{array}
if n < 3.49999999999999992e-301Initial program 53.1%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6432.0
Simplified32.0%
if 3.49999999999999992e-301 < n Initial program 50.0%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr45.9%
Taylor expanded in t around inf
Simplified40.0%
Final simplification36.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(Float64(2.0 * 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[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\right)}
\end{array}
Initial program 51.3%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6432.0
Simplified32.0%
herbie shell --seed 2024201
(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*))))))