
(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 23 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
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U))))))
(if (<= t_2 0.0)
(* (sqrt (* U (fma l_m (/ l_m (* Om -0.5)) t))) (sqrt (* 2.0 n)))
(if (<= t_2 1e+307)
(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 2.0))
(sqrt (* (* n U) (fma U* (/ n (* Om 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 = 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 <= 0.0) {
tmp = sqrt((U * fma(l_m, (l_m / (Om * -0.5)), t))) * sqrt((2.0 * n));
} else if (t_2 <= 1e+307) {
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(2.0)) * sqrt(((n * U) * fma(U_42_, (n / (Om * 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 = 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 <= 0.0) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t))) * sqrt(Float64(2.0 * n))); elseif (t_2 <= 1e+307) 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(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(n * U) * fma(U_42_, Float64(n / Float64(Om * Om)), Float64(-2.0 / Om))))); end return tmp end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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]}, If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[(U * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+307], 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[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(U$42$ * N[(n / N[(Om * Om), $MachinePrecision]), $MachinePrecision] + N[(-2.0 / 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 := 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 0:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_2 \leq 10^{+307}:\\
\;\;\;\;\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}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\left(n \cdot U\right) \cdot \mathsf{fma}\left(U*, \frac{n}{Om \cdot Om}, \frac{-2}{Om}\right)}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 12.2%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6418.1
Simplified18.1%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.7%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 9.99999999999999986e306Initial program 98.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-rr99.2%
if 9.99999999999999986e306 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 20.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-rr26.5%
Taylor expanded in U around 0
Simplified26.7%
Taylor expanded in l around inf
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sub-negN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6420.0
Simplified20.0%
Final simplification53.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
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U))))))
(if (<= t_2 0.0)
(* (sqrt (* U (fma l_m (/ l_m (* Om -0.5)) t))) (sqrt (* 2.0 n)))
(if (<= t_2 1e+307)
(sqrt
(*
t_1
(fma
(* (/ l_m Om) U*)
(* n (/ l_m Om))
(fma (* l_m -2.0) (/ l_m Om) t))))
(*
(* l_m (sqrt 2.0))
(sqrt (* (* n U) (fma U* (/ n (* Om 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 = 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 <= 0.0) {
tmp = sqrt((U * fma(l_m, (l_m / (Om * -0.5)), t))) * sqrt((2.0 * n));
} else if (t_2 <= 1e+307) {
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(2.0)) * sqrt(((n * U) * fma(U_42_, (n / (Om * 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 = 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 <= 0.0) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t))) * sqrt(Float64(2.0 * n))); elseif (t_2 <= 1e+307) 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(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(n * U) * fma(U_42_, Float64(n / Float64(Om * Om)), Float64(-2.0 / Om))))); end return tmp end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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]}, If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[(U * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+307], 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[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(U$42$ * N[(n / N[(Om * Om), $MachinePrecision]), $MachinePrecision] + N[(-2.0 / 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 := 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 0:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_2 \leq 10^{+307}:\\
\;\;\;\;\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}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\left(n \cdot U\right) \cdot \mathsf{fma}\left(U*, \frac{n}{Om \cdot Om}, \frac{-2}{Om}\right)}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 12.2%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6418.1
Simplified18.1%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.7%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 9.99999999999999986e306Initial program 98.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-rr99.2%
Taylor expanded in U around 0
Simplified98.8%
if 9.99999999999999986e306 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 20.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-rr26.5%
Taylor expanded in U around 0
Simplified26.7%
Taylor expanded in l around inf
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sub-negN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6420.0
Simplified20.0%
Final simplification53.4%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n)))
(t_2
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U))))))
(if (<= t_2 0.0)
(* (sqrt (* U (fma l_m (/ l_m (* Om -0.5)) t))) (sqrt (* 2.0 n)))
(if (<= t_2 1e+307)
(sqrt (* t_1 (- t (/ (* (* l_m l_m) (fma n (/ (- U U*) Om) 2.0)) Om))))
(*
(* l_m (sqrt 2.0))
(sqrt (* (* n U) (fma U* (/ n (* Om 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 = 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 <= 0.0) {
tmp = sqrt((U * fma(l_m, (l_m / (Om * -0.5)), t))) * sqrt((2.0 * n));
} else if (t_2 <= 1e+307) {
tmp = sqrt((t_1 * (t - (((l_m * l_m) * fma(n, ((U - U_42_) / Om), 2.0)) / Om))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt(((n * U) * fma(U_42_, (n / (Om * 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 = 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 <= 0.0) tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t))) * sqrt(Float64(2.0 * n))); elseif (t_2 <= 1e+307) tmp = sqrt(Float64(t_1 * Float64(t - Float64(Float64(Float64(l_m * l_m) * fma(n, Float64(Float64(U - U_42_) / Om), 2.0)) / Om)))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(n * U) * fma(U_42_, Float64(n / Float64(Om * Om)), Float64(-2.0 / Om))))); end return tmp end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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]}, If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[(U * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+307], N[Sqrt[N[(t$95$1 * N[(t - N[(N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(n * N[(N[(U - U$42$), $MachinePrecision] / Om), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(U$42$ * N[(n / N[(Om * Om), $MachinePrecision]), $MachinePrecision] + N[(-2.0 / 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 := 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 0:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_2 \leq 10^{+307}:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t - \frac{\left(l\_m \cdot l\_m\right) \cdot \mathsf{fma}\left(n, \frac{U - U*}{Om}, 2\right)}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\left(n \cdot U\right) \cdot \mathsf{fma}\left(U*, \frac{n}{Om \cdot Om}, \frac{-2}{Om}\right)}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 12.2%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6418.1
Simplified18.1%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.7%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 9.99999999999999986e306Initial program 98.2%
Taylor expanded in t around 0
--lowering--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
div-subN/A
/-lowering-/.f64N/A
Simplified88.7%
if 9.99999999999999986e306 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 20.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-rr26.5%
Taylor expanded in U around 0
Simplified26.7%
Taylor expanded in l around inf
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sub-negN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6420.0
Simplified20.0%
Final simplification49.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 0.0)
(* (sqrt (* t (* 2.0 U))) (sqrt n))
(if (<= t_2 2e+147)
(sqrt (* t_1 (fma (* l_m l_m) (/ -2.0 Om) t)))
(sqrt (* (* U (fma l_m (/ l_m (* Om -0.5)) t)) (* 2.0 n)))))))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 <= 0.0) {
tmp = sqrt((t * (2.0 * U))) * sqrt(n);
} else if (t_2 <= 2e+147) {
tmp = sqrt((t_1 * fma((l_m * l_m), (-2.0 / Om), t)));
} else {
tmp = sqrt(((U * fma(l_m, (l_m / (Om * -0.5)), t)) * (2.0 * n)));
}
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 <= 0.0) tmp = Float64(sqrt(Float64(t * Float64(2.0 * U))) * sqrt(n)); elseif (t_2 <= 2e+147) tmp = sqrt(Float64(t_1 * fma(Float64(l_m * l_m), Float64(-2.0 / Om), t))); else tmp = sqrt(Float64(Float64(U * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t)) * Float64(2.0 * n))); 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, 0.0], N[(N[Sqrt[N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+147], N[Sqrt[N[(t$95$1 * N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(-2.0 / Om), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(U * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision] * N[(2.0 * n), $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 0:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot U\right)} \cdot \sqrt{n}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+147}:\\
\;\;\;\;\sqrt{t\_1 \cdot \mathsf{fma}\left(l\_m \cdot l\_m, \frac{-2}{Om}, t\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)\right) \cdot \left(2 \cdot n\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 14.3%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.0
Simplified34.0%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6446.9
Applied egg-rr46.9%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2e147Initial program 98.1%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6487.5
Simplified87.5%
if 2e147 < (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 21.0%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6418.4
Simplified18.4%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr24.5%
Final simplification49.9%
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 0.0)
(* (sqrt (* t (* 2.0 U))) (sqrt n))
(if (<= t_2 5e+153)
(sqrt (* t_1 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 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 <= 0.0) {
tmp = sqrt((t * (2.0 * U))) * sqrt(n);
} else if (t_2 <= 5e+153) {
tmp = sqrt((t_1 * 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) :: 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 <= 0.0d0) then
tmp = sqrt((t * (2.0d0 * u))) * sqrt(n)
else if (t_2 <= 5d+153) then
tmp = sqrt((t_1 * 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 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 <= 0.0) {
tmp = Math.sqrt((t * (2.0 * U))) * Math.sqrt(n);
} else if (t_2 <= 5e+153) {
tmp = Math.sqrt((t_1 * 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_): 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 <= 0.0: tmp = math.sqrt((t * (2.0 * U))) * math.sqrt(n) elif t_2 <= 5e+153: tmp = math.sqrt((t_1 * 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_) 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 <= 0.0) tmp = Float64(sqrt(Float64(t * Float64(2.0 * U))) * sqrt(n)); elseif (t_2 <= 5e+153) tmp = sqrt(Float64(t_1 * 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_) 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 <= 0.0) tmp = sqrt((t * (2.0 * U))) * sqrt(n); elseif (t_2 <= 5e+153) tmp = sqrt((t_1 * 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$_] := 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, 0.0], N[(N[Sqrt[N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e+153], N[Sqrt[N[(t$95$1 * 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}
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 0:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot U\right)} \cdot \sqrt{n}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+153}:\\
\;\;\;\;\sqrt{t\_1 \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 (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 14.3%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.0
Simplified34.0%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6446.9
Applied egg-rr46.9%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 5.00000000000000018e153Initial program 98.2%
Taylor expanded in t around inf
Simplified73.2%
if 5.00000000000000018e153 < (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 19.1%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6416.5
Simplified16.5%
Taylor expanded in l around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6417.3
Simplified17.3%
Final simplification41.8%
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 0.0)
(* (sqrt (* t (* 2.0 U))) (sqrt n))
(if (<= t_2 5e+153)
(sqrt (* t_1 t))
(sqrt (/ (* -4.0 (* U (* 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 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 <= 0.0) {
tmp = sqrt((t * (2.0 * U))) * sqrt(n);
} else if (t_2 <= 5e+153) {
tmp = sqrt((t_1 * t));
} else {
tmp = sqrt(((-4.0 * (U * (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) :: 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 <= 0.0d0) then
tmp = sqrt((t * (2.0d0 * u))) * sqrt(n)
else if (t_2 <= 5d+153) then
tmp = sqrt((t_1 * t))
else
tmp = sqrt((((-4.0d0) * (u * (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 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 <= 0.0) {
tmp = Math.sqrt((t * (2.0 * U))) * Math.sqrt(n);
} else if (t_2 <= 5e+153) {
tmp = Math.sqrt((t_1 * t));
} else {
tmp = Math.sqrt(((-4.0 * (U * (n * (l_m * l_m)))) / 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 <= 0.0: tmp = math.sqrt((t * (2.0 * U))) * math.sqrt(n) elif t_2 <= 5e+153: tmp = math.sqrt((t_1 * t)) else: tmp = math.sqrt(((-4.0 * (U * (n * (l_m * l_m)))) / 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 <= 0.0) tmp = Float64(sqrt(Float64(t * Float64(2.0 * U))) * sqrt(n)); elseif (t_2 <= 5e+153) tmp = sqrt(Float64(t_1 * t)); else tmp = sqrt(Float64(Float64(-4.0 * Float64(U * 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_) 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 <= 0.0) tmp = sqrt((t * (2.0 * U))) * sqrt(n); elseif (t_2 <= 5e+153) tmp = sqrt((t_1 * t)); else tmp = sqrt(((-4.0 * (U * (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$_] := 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, 0.0], N[(N[Sqrt[N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e+153], N[Sqrt[N[(t$95$1 * t), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(-4.0 * N[(U * N[(n * 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}
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 0:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot U\right)} \cdot \sqrt{n}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+153}:\\
\;\;\;\;\sqrt{t\_1 \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-4 \cdot \left(U \cdot \left(n \cdot \left(l\_m \cdot l\_m\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 14.3%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.0
Simplified34.0%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6446.9
Applied egg-rr46.9%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 5.00000000000000018e153Initial program 98.2%
Taylor expanded in t around inf
Simplified73.2%
if 5.00000000000000018e153 < (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 19.1%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6417.0
Simplified17.0%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6417.0
Simplified17.0%
Final simplification41.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
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U))))))
(if (<= t_2 0.0)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_2 INFINITY)
(sqrt (* t_1 (fma l_m (/ l_m (* Om -0.5)) t)))
(* (sqrt (* U (- U* U))) (* (/ (* n (sqrt 2.0)) Om) (- l_m)))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * (2.0 * n);
double t_2 = 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 <= 0.0) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * fma(l_m, (l_m / (Om * -0.5)), t)));
} else {
tmp = sqrt((U * (U_42_ - U))) * (((n * sqrt(2.0)) / Om) * -l_m);
}
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 = 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 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t))); else tmp = Float64(sqrt(Float64(U * Float64(U_42_ - U))) * Float64(Float64(Float64(n * sqrt(2.0)) / Om) * Float64(-l_m))); end return tmp end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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]}, If[LessEqual[t$95$2, 0.0], 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[(t$95$1 * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(N[(n * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * (-l$95$m)), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
t_2 := 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 0:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \left(U* - U\right)} \cdot \left(\frac{n \cdot \sqrt{2}}{Om} \cdot \left(-l\_m\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 12.2%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6429.4
Simplified29.4%
associate-*r*N/A
*-commutativeN/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
*-lowering-*.f6429.4
Applied egg-rr29.4%
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6442.7
Applied egg-rr42.7%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 66.3%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6457.2
Simplified57.2%
distribute-lft-inN/A
*-commutativeN/A
associate-*l/N/A
associate-*l*N/A
associate-*r/N/A
distribute-lft-inN/A
*-commutativeN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr60.5%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
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-rr0.6%
Taylor expanded in Om around inf
+-commutativeN/A
distribute-lft-outN/A
accelerator-lowering-fma.f64N/A
Simplified5.2%
Taylor expanded in n around -inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
--lowering--.f6415.4
Simplified15.4%
Final simplification50.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
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U))))))
(if (<= t_2 0.0)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_2 INFINITY)
(sqrt (* t_1 (fma l_m (/ l_m (* Om -0.5)) t)))
(* (* l_m (/ (* n (sqrt 2.0)) Om)) (sqrt (* U U*)))))))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 = 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 <= 0.0) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * fma(l_m, (l_m / (Om * -0.5)), t)));
} else {
tmp = (l_m * ((n * sqrt(2.0)) / Om)) * sqrt((U * U_42_));
}
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 = 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 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t))); else tmp = Float64(Float64(l_m * Float64(Float64(n * sqrt(2.0)) / Om)) * sqrt(Float64(U * U_42_))); end return tmp end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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]}, If[LessEqual[t$95$2, 0.0], 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[(t$95$1 * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[(N[(n * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * U$42$), $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 := 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 0:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \frac{n \cdot \sqrt{2}}{Om}\right) \cdot \sqrt{U \cdot U*}\\
\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 12.2%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6429.4
Simplified29.4%
associate-*r*N/A
*-commutativeN/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
*-lowering-*.f6429.4
Applied egg-rr29.4%
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6442.7
Applied egg-rr42.7%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 66.3%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6457.2
Simplified57.2%
distribute-lft-inN/A
*-commutativeN/A
associate-*l/N/A
associate-*l*N/A
associate-*r/N/A
distribute-lft-inN/A
*-commutativeN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr60.5%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
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-rr0.6%
Taylor expanded in U* around inf
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6431.3
Simplified31.3%
Final simplification53.1%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (* 2.0 n)))
(t_2
(*
t_1
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))
(t_3 (sqrt (fabs (* U (* 2.0 (* n t)))))))
(if (<= t_2 5e-307) t_3 (if (<= t_2 1e+307) (sqrt (* t_1 t)) t_3))))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 = t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)));
double t_3 = sqrt(fabs((U * (2.0 * (n * t)))));
double tmp;
if (t_2 <= 5e-307) {
tmp = t_3;
} else if (t_2 <= 1e+307) {
tmp = sqrt((t_1 * t));
} else {
tmp = t_3;
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = u * (2.0d0 * n)
t_2 = t_1 * ((t - (2.0d0 * ((l_m * l_m) / om))) + ((n * ((l_m / om) ** 2.0d0)) * (u_42 - u)))
t_3 = sqrt(abs((u * (2.0d0 * (n * t)))))
if (t_2 <= 5d-307) then
tmp = t_3
else if (t_2 <= 1d+307) then
tmp = sqrt((t_1 * t))
else
tmp = t_3
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 = t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U)));
double t_3 = Math.sqrt(Math.abs((U * (2.0 * (n * t)))));
double tmp;
if (t_2 <= 5e-307) {
tmp = t_3;
} else if (t_2 <= 1e+307) {
tmp = Math.sqrt((t_1 * t));
} else {
tmp = t_3;
}
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 = t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * math.pow((l_m / Om), 2.0)) * (U_42_ - U))) t_3 = math.sqrt(math.fabs((U * (2.0 * (n * t))))) tmp = 0 if t_2 <= 5e-307: tmp = t_3 elif t_2 <= 1e+307: tmp = math.sqrt((t_1 * t)) else: tmp = t_3 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 = 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)))) t_3 = sqrt(abs(Float64(U * Float64(2.0 * Float64(n * t))))) tmp = 0.0 if (t_2 <= 5e-307) tmp = t_3; elseif (t_2 <= 1e+307) tmp = sqrt(Float64(t_1 * t)); else tmp = t_3; 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 = t_1 * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * ((l_m / Om) ^ 2.0)) * (U_42_ - U))); t_3 = sqrt(abs((U * (2.0 * (n * t))))); tmp = 0.0; if (t_2 <= 5e-307) tmp = t_3; elseif (t_2 <= 1e+307) tmp = sqrt((t_1 * t)); else tmp = t_3; 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[(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]}, Block[{t$95$3 = N[Sqrt[N[Abs[N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 5e-307], t$95$3, If[LessEqual[t$95$2, 1e+307], N[Sqrt[N[(t$95$1 * t), $MachinePrecision]], $MachinePrecision], t$95$3]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \left(2 \cdot n\right)\\
t_2 := 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)\\
t_3 := \sqrt{\left|U \cdot \left(2 \cdot \left(n \cdot t\right)\right)\right|}\\
\mathbf{if}\;t\_2 \leq 5 \cdot 10^{-307}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq 10^{+307}:\\
\;\;\;\;\sqrt{t\_1 \cdot t}\\
\mathbf{else}:\\
\;\;\;\;t\_3\\
\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*)))) < 5.00000000000000014e-307 or 9.99999999999999986e306 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 18.6%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6412.2
Simplified12.2%
associate-*r*N/A
rem-square-sqrtN/A
sqrt-unprodN/A
rem-sqrt-squareN/A
fabs-lowering-fabs.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6417.0
Applied egg-rr17.0%
if 5.00000000000000014e-307 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 9.99999999999999986e306Initial program 98.2%
Taylor expanded in t around inf
Simplified73.9%
Final simplification37.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)))))
0.0)
(* (sqrt (* t (* 2.0 U))) (sqrt n))
(sqrt (* t_1 (fma l_m (/ l_m (* Om -0.5)) 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))))) <= 0.0) {
tmp = sqrt((t * (2.0 * U))) * sqrt(n);
} else {
tmp = sqrt((t_1 * fma(l_m, (l_m / (Om * -0.5)), 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))))) <= 0.0) tmp = Float64(sqrt(Float64(t * Float64(2.0 * U))) * sqrt(n)); else tmp = sqrt(Float64(t_1 * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t))); 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]}, 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], 0.0], N[(N[Sqrt[N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(t$95$1 * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $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 0:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot U\right)} \cdot \sqrt{n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 14.3%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.0
Simplified34.0%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6446.9
Applied egg-rr46.9%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 52.6%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6446.7
Simplified46.7%
distribute-lft-inN/A
*-commutativeN/A
associate-*l/N/A
associate-*l*N/A
associate-*r/N/A
distribute-lft-inN/A
*-commutativeN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr49.4%
Final simplification49.0%
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)))))
0.0)
(* (sqrt (* t (* 2.0 U))) (sqrt n))
(sqrt (* t_1 (fma (* l_m l_m) (/ -2.0 Om) t))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = 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))))) <= 0.0) {
tmp = sqrt((t * (2.0 * U))) * sqrt(n);
} else {
tmp = sqrt((t_1 * fma((l_m * l_m), (-2.0 / Om), 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))))) <= 0.0) tmp = Float64(sqrt(Float64(t * Float64(2.0 * U))) * sqrt(n)); else tmp = sqrt(Float64(t_1 * fma(Float64(l_m * l_m), Float64(-2.0 / Om), t))); 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]}, 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], 0.0], N[(N[Sqrt[N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(t$95$1 * N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(-2.0 / Om), $MachinePrecision] + t), $MachinePrecision]), $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 0:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot U\right)} \cdot \sqrt{n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 \cdot \mathsf{fma}\left(l\_m \cdot l\_m, \frac{-2}{Om}, t\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 14.3%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.0
Simplified34.0%
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6446.9
Applied egg-rr46.9%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 52.6%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6446.7
Simplified46.7%
Final simplification46.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)))))
0.0)
(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))))) <= 0.0) {
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))))) <= 0.0d0) 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))))) <= 0.0) {
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))))) <= 0.0: 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))))) <= 0.0) tmp = sqrt(Float64(Float64(n * 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))))) <= 0.0) 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], 0.0], N[Sqrt[N[(N[(n * t), $MachinePrecision] * N[(2.0 * U), $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 0:\\
\;\;\;\;\sqrt{\left(n \cdot t\right) \cdot \left(2 \cdot U\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*))))) < 0.0Initial program 14.3%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.0
Simplified34.0%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 52.6%
Taylor expanded in t around inf
Simplified34.3%
Final simplification34.3%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 2.3e+152)
(sqrt
(*
(* 2.0 n)
(*
U
(-
t
(/ (fma (* n (* (/ l_m Om) (- U U*))) l_m (* 2.0 (* l_m l_m))) Om)))))
(*
(* l_m (sqrt 2.0))
(sqrt (* (* n U) (fma U* (/ n (* Om 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 tmp;
if (l_m <= 2.3e+152) {
tmp = sqrt(((2.0 * n) * (U * (t - (fma((n * ((l_m / Om) * (U - U_42_))), l_m, (2.0 * (l_m * l_m))) / Om)))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt(((n * U) * fma(U_42_, (n / (Om * Om)), (-2.0 / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 2.3e+152) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(fma(Float64(n * Float64(Float64(l_m / Om) * Float64(U - U_42_))), l_m, Float64(2.0 * Float64(l_m * l_m))) / Om))))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(n * U) * fma(U_42_, Float64(n / Float64(Om * Om)), Float64(-2.0 / Om))))); end return tmp end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 2.3e+152], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(N[(N[(n * N[(N[(l$95$m / Om), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * l$95$m + N[(2.0 * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(U$42$ * N[(n / N[(Om * Om), $MachinePrecision]), $MachinePrecision] + N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 2.3 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \frac{\mathsf{fma}\left(n \cdot \left(\frac{l\_m}{Om} \cdot \left(U - U*\right)\right), l\_m, 2 \cdot \left(l\_m \cdot l\_m\right)\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\left(n \cdot U\right) \cdot \mathsf{fma}\left(U*, \frac{n}{Om \cdot Om}, \frac{-2}{Om}\right)}\\
\end{array}
\end{array}
if l < 2.29999999999999985e152Initial program 51.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-rr56.2%
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-commutativeN/A
associate-*l*N/A
metadata-evalN/A
associate-/l*N/A
cancel-sign-sub-invN/A
associate-+l-N/A
--lowering--.f64N/A
Applied egg-rr53.8%
sub-negN/A
+-commutativeN/A
distribute-lft-neg-inN/A
distribute-frac-negN/A
remove-double-negN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6456.0
Applied egg-rr56.0%
if 2.29999999999999985e152 < l Initial program 12.9%
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-rr19.9%
Taylor expanded in U around 0
Simplified20.4%
Taylor expanded in l around inf
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sub-negN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6459.2
Simplified59.2%
Final simplification56.4%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 4e+144)
(sqrt
(*
(* 2.0 n)
(*
U
(+ t (/ (- (* (/ (* l_m U*) Om) (* n l_m)) (* 2.0 (* l_m l_m))) Om)))))
(*
(* l_m (sqrt 2.0))
(sqrt (* (* n U) (fma U* (/ n (* Om 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 tmp;
if (l_m <= 4e+144) {
tmp = sqrt(((2.0 * n) * (U * (t + (((((l_m * U_42_) / Om) * (n * l_m)) - (2.0 * (l_m * l_m))) / Om)))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt(((n * U) * fma(U_42_, (n / (Om * Om)), (-2.0 / Om))));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 4e+144) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(Float64(Float64(Float64(l_m * U_42_) / Om) * Float64(n * l_m)) - Float64(2.0 * Float64(l_m * l_m))) / Om))))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(n * U) * fma(U_42_, Float64(n / Float64(Om * Om)), Float64(-2.0 / Om))))); end return tmp end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 4e+144], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(N[(N[(l$95$m * U$42$), $MachinePrecision] / Om), $MachinePrecision] * N[(n * l$95$m), $MachinePrecision]), $MachinePrecision] - N[(2.0 * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(U$42$ * N[(n / N[(Om * Om), $MachinePrecision]), $MachinePrecision] + N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 4 \cdot 10^{+144}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\frac{l\_m \cdot U*}{Om} \cdot \left(n \cdot l\_m\right) - 2 \cdot \left(l\_m \cdot l\_m\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\left(n \cdot U\right) \cdot \mathsf{fma}\left(U*, \frac{n}{Om \cdot Om}, \frac{-2}{Om}\right)}\\
\end{array}
\end{array}
if l < 4.00000000000000009e144Initial program 51.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-rr56.2%
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-commutativeN/A
associate-*l*N/A
metadata-evalN/A
associate-/l*N/A
cancel-sign-sub-invN/A
associate-+l-N/A
--lowering--.f64N/A
Applied egg-rr53.8%
Taylor expanded in U around 0
*-lowering-*.f6454.3
Simplified54.3%
if 4.00000000000000009e144 < l Initial program 12.9%
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-rr19.9%
Taylor expanded in U around 0
Simplified20.4%
Taylor expanded in l around inf
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sub-negN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6459.2
Simplified59.2%
Final simplification54.8%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= n -3.8e+22)
(sqrt
(*
(* U (* 2.0 n))
(- t (/ (* (* l_m l_m) (fma n (/ (- U U*) Om) 2.0)) Om))))
(if (<= n 5.5e-277)
(sqrt (fma 2.0 (* U (* n t)) (/ (* (* (* n l_m) (* U l_m)) -4.0) Om)))
(* (sqrt (* U (fma l_m (/ l_m (* Om -0.5)) t))) (sqrt (* 2.0 n))))))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.8e+22) {
tmp = sqrt(((U * (2.0 * n)) * (t - (((l_m * l_m) * fma(n, ((U - U_42_) / Om), 2.0)) / Om))));
} else if (n <= 5.5e-277) {
tmp = sqrt(fma(2.0, (U * (n * t)), ((((n * l_m) * (U * l_m)) * -4.0) / Om)));
} else {
tmp = sqrt((U * fma(l_m, (l_m / (Om * -0.5)), t))) * sqrt((2.0 * n));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= -3.8e+22) tmp = sqrt(Float64(Float64(U * Float64(2.0 * n)) * Float64(t - Float64(Float64(Float64(l_m * l_m) * fma(n, Float64(Float64(U - U_42_) / Om), 2.0)) / Om)))); elseif (n <= 5.5e-277) tmp = sqrt(fma(2.0, Float64(U * Float64(n * t)), Float64(Float64(Float64(Float64(n * l_m) * Float64(U * l_m)) * -4.0) / Om))); else tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t))) * sqrt(Float64(2.0 * n))); end return tmp end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[n, -3.8e+22], N[Sqrt[N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * N[(t - N[(N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(n * N[(N[(U - U$42$), $MachinePrecision] / Om), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 5.5e-277], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(N[(n * l$95$m), $MachinePrecision] * N[(U * l$95$m), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -3.8 \cdot 10^{+22}:\\
\;\;\;\;\sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot \left(t - \frac{\left(l\_m \cdot l\_m\right) \cdot \mathsf{fma}\left(n, \frac{U - U*}{Om}, 2\right)}{Om}\right)}\\
\mathbf{elif}\;n \leq 5.5 \cdot 10^{-277}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(2, U \cdot \left(n \cdot t\right), \frac{\left(\left(n \cdot l\_m\right) \cdot \left(U \cdot l\_m\right)\right) \cdot -4}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)} \cdot \sqrt{2 \cdot n}\\
\end{array}
\end{array}
if n < -3.8000000000000004e22Initial program 52.9%
Taylor expanded in t around 0
--lowering--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
div-subN/A
/-lowering-/.f64N/A
Simplified60.8%
if -3.8000000000000004e22 < n < 5.49999999999999952e-277Initial program 44.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6444.4
Simplified44.4%
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6456.1
Applied egg-rr56.1%
if 5.49999999999999952e-277 < n Initial program 46.8%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6442.2
Simplified42.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr55.8%
Final simplification57.1%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= n -8.2e+72)
(sqrt (* (* 2.0 n) (* U (+ t (/ (/ (* U* (* n (* l_m l_m))) Om) Om)))))
(if (<= n 3.6e-277)
(sqrt (fma 2.0 (* U (* n t)) (/ (* (* (* n l_m) (* U l_m)) -4.0) Om)))
(* (sqrt (* U (fma l_m (/ l_m (* Om -0.5)) t))) (sqrt (* 2.0 n))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (n <= -8.2e+72) {
tmp = sqrt(((2.0 * n) * (U * (t + (((U_42_ * (n * (l_m * l_m))) / Om) / Om)))));
} else if (n <= 3.6e-277) {
tmp = sqrt(fma(2.0, (U * (n * t)), ((((n * l_m) * (U * l_m)) * -4.0) / Om)));
} else {
tmp = sqrt((U * fma(l_m, (l_m / (Om * -0.5)), t))) * sqrt((2.0 * n));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= -8.2e+72) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(Float64(U_42_ * Float64(n * Float64(l_m * l_m))) / Om) / Om))))); elseif (n <= 3.6e-277) tmp = sqrt(fma(2.0, Float64(U * Float64(n * t)), Float64(Float64(Float64(Float64(n * l_m) * Float64(U * l_m)) * -4.0) / Om))); else tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t))) * sqrt(Float64(2.0 * n))); end return tmp end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[n, -8.2e+72], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(U$42$ * N[(n * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 3.6e-277], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(N[(n * l$95$m), $MachinePrecision] * N[(U * l$95$m), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -8.2 \cdot 10^{+72}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\frac{U* \cdot \left(n \cdot \left(l\_m \cdot l\_m\right)\right)}{Om}}{Om}\right)\right)}\\
\mathbf{elif}\;n \leq 3.6 \cdot 10^{-277}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(2, U \cdot \left(n \cdot t\right), \frac{\left(\left(n \cdot l\_m\right) \cdot \left(U \cdot l\_m\right)\right) \cdot -4}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)} \cdot \sqrt{2 \cdot n}\\
\end{array}
\end{array}
if n < -8.19999999999999926e72Initial program 51.1%
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-rr57.4%
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-commutativeN/A
associate-*l*N/A
metadata-evalN/A
associate-/l*N/A
cancel-sign-sub-invN/A
associate-+l-N/A
--lowering--.f64N/A
Applied egg-rr60.1%
Taylor expanded in U* around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6461.9
Simplified61.9%
if -8.19999999999999926e72 < n < 3.59999999999999984e-277Initial program 46.6%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6443.5
Simplified43.5%
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6454.4
Applied egg-rr54.4%
if 3.59999999999999984e-277 < n Initial program 46.8%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6442.2
Simplified42.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr55.8%
Final simplification56.4%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= n -3.8e+22)
(sqrt
(* (* U (* 2.0 n)) (+ t (* (- U* U) (* n (* l_m (/ l_m (* Om Om))))))))
(if (<= n 3.1e-276)
(sqrt (fma 2.0 (* U (* n t)) (/ (* (* (* n l_m) (* U l_m)) -4.0) Om)))
(* (sqrt (* U (fma l_m (/ l_m (* Om -0.5)) t))) (sqrt (* 2.0 n))))))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.8e+22) {
tmp = sqrt(((U * (2.0 * n)) * (t + ((U_42_ - U) * (n * (l_m * (l_m / (Om * Om))))))));
} else if (n <= 3.1e-276) {
tmp = sqrt(fma(2.0, (U * (n * t)), ((((n * l_m) * (U * l_m)) * -4.0) / Om)));
} else {
tmp = sqrt((U * fma(l_m, (l_m / (Om * -0.5)), t))) * sqrt((2.0 * n));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= -3.8e+22) tmp = sqrt(Float64(Float64(U * Float64(2.0 * n)) * Float64(t + Float64(Float64(U_42_ - U) * Float64(n * Float64(l_m * Float64(l_m / Float64(Om * Om)))))))); elseif (n <= 3.1e-276) tmp = sqrt(fma(2.0, Float64(U * Float64(n * t)), Float64(Float64(Float64(Float64(n * l_m) * Float64(U * l_m)) * -4.0) / Om))); else tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t))) * sqrt(Float64(2.0 * n))); end return tmp end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[n, -3.8e+22], N[Sqrt[N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * N[(l$95$m * N[(l$95$m / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 3.1e-276], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(N[(n * l$95$m), $MachinePrecision] * N[(U * l$95$m), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -3.8 \cdot 10^{+22}:\\
\;\;\;\;\sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot \left(t + \left(U* - U\right) \cdot \left(n \cdot \left(l\_m \cdot \frac{l\_m}{Om \cdot Om}\right)\right)\right)}\\
\mathbf{elif}\;n \leq 3.1 \cdot 10^{-276}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(2, U \cdot \left(n \cdot t\right), \frac{\left(\left(n \cdot l\_m\right) \cdot \left(U \cdot l\_m\right)\right) \cdot -4}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)} \cdot \sqrt{2 \cdot n}\\
\end{array}
\end{array}
if n < -3.8000000000000004e22Initial program 52.9%
Taylor expanded in l around 0
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6451.2
Simplified51.2%
Taylor expanded in t around inf
Simplified56.3%
if -3.8000000000000004e22 < n < 3.09999999999999989e-276Initial program 44.2%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6444.4
Simplified44.4%
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6456.1
Applied egg-rr56.1%
if 3.09999999999999989e-276 < n Initial program 46.8%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6442.2
Simplified42.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr55.8%
Final simplification56.0%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= n -1e+73)
(sqrt (* (* 2.0 n) (* U (+ t (* U* (/ (* n (* l_m l_m)) (* Om Om)))))))
(if (<= n 5.2e-277)
(sqrt (fma 2.0 (* U (* n t)) (/ (* (* (* n l_m) (* U l_m)) -4.0) Om)))
(* (sqrt (* U (fma l_m (/ l_m (* Om -0.5)) t))) (sqrt (* 2.0 n))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (n <= -1e+73) {
tmp = sqrt(((2.0 * n) * (U * (t + (U_42_ * ((n * (l_m * l_m)) / (Om * Om)))))));
} else if (n <= 5.2e-277) {
tmp = sqrt(fma(2.0, (U * (n * t)), ((((n * l_m) * (U * l_m)) * -4.0) / Om)));
} else {
tmp = sqrt((U * fma(l_m, (l_m / (Om * -0.5)), t))) * sqrt((2.0 * n));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= -1e+73) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(U_42_ * Float64(Float64(n * Float64(l_m * l_m)) / Float64(Om * Om))))))); elseif (n <= 5.2e-277) tmp = sqrt(fma(2.0, Float64(U * Float64(n * t)), Float64(Float64(Float64(Float64(n * l_m) * Float64(U * l_m)) * -4.0) / Om))); else tmp = Float64(sqrt(Float64(U * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t))) * sqrt(Float64(2.0 * n))); end return tmp end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[n, -1e+73], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(U$42$ * N[(N[(n * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 5.2e-277], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(N[(n * l$95$m), $MachinePrecision] * N[(U * l$95$m), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * N[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -1 \cdot 10^{+73}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + U* \cdot \frac{n \cdot \left(l\_m \cdot l\_m\right)}{Om \cdot Om}\right)\right)}\\
\mathbf{elif}\;n \leq 5.2 \cdot 10^{-277}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(2, U \cdot \left(n \cdot t\right), \frac{\left(\left(n \cdot l\_m\right) \cdot \left(U \cdot l\_m\right)\right) \cdot -4}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)} \cdot \sqrt{2 \cdot n}\\
\end{array}
\end{array}
if n < -9.99999999999999983e72Initial program 51.1%
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-rr57.4%
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-commutativeN/A
associate-*l*N/A
metadata-evalN/A
associate-/l*N/A
cancel-sign-sub-invN/A
associate-+l-N/A
--lowering--.f64N/A
Applied egg-rr60.1%
Taylor expanded in U* around inf
mul-1-negN/A
associate-/l*N/A
distribute-lft-neg-inN/A
neg-mul-1N/A
*-lowering-*.f64N/A
neg-mul-1N/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.5
Simplified57.5%
if -9.99999999999999983e72 < n < 5.2e-277Initial program 46.6%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6443.5
Simplified43.5%
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6454.4
Applied egg-rr54.4%
if 5.2e-277 < n Initial program 46.8%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6442.2
Simplified42.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr55.8%
Final simplification55.6%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* U (fma l_m (/ l_m (* Om -0.5)) t))))
(if (<= n -9.5e+72)
(sqrt (* t_1 (* 2.0 n)))
(if (<= n 3.1e-276)
(sqrt (fma 2.0 (* U (* n t)) (/ (* (* (* n l_m) (* U l_m)) -4.0) Om)))
(* (sqrt t_1) (sqrt (* 2.0 n)))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = U * fma(l_m, (l_m / (Om * -0.5)), t);
double tmp;
if (n <= -9.5e+72) {
tmp = sqrt((t_1 * (2.0 * n)));
} else if (n <= 3.1e-276) {
tmp = sqrt(fma(2.0, (U * (n * t)), ((((n * l_m) * (U * l_m)) * -4.0) / Om)));
} else {
tmp = sqrt(t_1) * sqrt((2.0 * n));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(U * fma(l_m, Float64(l_m / Float64(Om * -0.5)), t)) tmp = 0.0 if (n <= -9.5e+72) tmp = sqrt(Float64(t_1 * Float64(2.0 * n))); elseif (n <= 3.1e-276) tmp = sqrt(fma(2.0, Float64(U * Float64(n * t)), Float64(Float64(Float64(Float64(n * l_m) * Float64(U * l_m)) * -4.0) / Om))); else tmp = Float64(sqrt(t_1) * sqrt(Float64(2.0 * n))); 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[(l$95$m * N[(l$95$m / N[(Om * -0.5), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -9.5e+72], N[Sqrt[N[(t$95$1 * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 3.1e-276], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(N[(n * l$95$m), $MachinePrecision] * N[(U * l$95$m), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := U \cdot \mathsf{fma}\left(l\_m, \frac{l\_m}{Om \cdot -0.5}, t\right)\\
\mathbf{if}\;n \leq -9.5 \cdot 10^{+72}:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(2 \cdot n\right)}\\
\mathbf{elif}\;n \leq 3.1 \cdot 10^{-276}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(2, U \cdot \left(n \cdot t\right), \frac{\left(\left(n \cdot l\_m\right) \cdot \left(U \cdot l\_m\right)\right) \cdot -4}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1} \cdot \sqrt{2 \cdot n}\\
\end{array}
\end{array}
if n < -9.50000000000000054e72Initial program 51.1%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6442.7
Simplified42.7%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr46.8%
if -9.50000000000000054e72 < n < 3.09999999999999989e-276Initial program 46.6%
Taylor expanded in Om around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6443.5
Simplified43.5%
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6454.4
Applied egg-rr54.4%
if 3.09999999999999989e-276 < n Initial program 46.8%
Taylor expanded in Om around inf
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6442.2
Simplified42.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr55.8%
Final simplification53.7%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= t 1.15e+130) (sqrt (* (* 2.0 U) (* n (fma -2.0 (/ (* l_m l_m) Om) t)))) (* (sqrt (* n U)) (sqrt (* 2.0 t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (t <= 1.15e+130) {
tmp = sqrt(((2.0 * U) * (n * fma(-2.0, ((l_m * l_m) / Om), t))));
} else {
tmp = sqrt((n * U)) * sqrt((2.0 * t));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (t <= 1.15e+130) tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * fma(-2.0, Float64(Float64(l_m * l_m) / Om), t)))); else tmp = Float64(sqrt(Float64(n * U)) * sqrt(Float64(2.0 * t))); end return tmp end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[t, 1.15e+130], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * N[(-2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 1.15 \cdot 10^{+130}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot \mathsf{fma}\left(-2, \frac{l\_m \cdot l\_m}{Om}, t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot U} \cdot \sqrt{2 \cdot t}\\
\end{array}
\end{array}
if t < 1.15000000000000011e130Initial program 45.7%
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-rr50.8%
Taylor expanded in n around 0
associate-*r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6440.9
Simplified40.9%
if 1.15000000000000011e130 < t Initial program 57.4%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6443.3
Simplified43.3%
associate-*r*N/A
*-commutativeN/A
associate-*r*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
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6466.1
Applied egg-rr66.1%
Final simplification44.7%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= n 2.2e-304) (sqrt (fabs (* U (* 2.0 (* 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 <= 2.2e-304) {
tmp = sqrt(fabs((U * (2.0 * (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 <= 2.2d-304) then
tmp = sqrt(abs((u * (2.0d0 * (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 <= 2.2e-304) {
tmp = Math.sqrt(Math.abs((U * (2.0 * (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 <= 2.2e-304: tmp = math.sqrt(math.fabs((U * (2.0 * (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 <= 2.2e-304) tmp = sqrt(abs(Float64(U * Float64(2.0 * 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 <= 2.2e-304) tmp = sqrt(abs((U * (2.0 * (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, 2.2e-304], N[Sqrt[N[Abs[N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $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 2.2 \cdot 10^{-304}:\\
\;\;\;\;\sqrt{\left|U \cdot \left(2 \cdot \left(n \cdot t\right)\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\end{array}
\end{array}
if n < 2.2e-304Initial program 49.5%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6428.5
Simplified28.5%
associate-*r*N/A
rem-square-sqrtN/A
sqrt-unprodN/A
rem-sqrt-squareN/A
fabs-lowering-fabs.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6432.8
Applied egg-rr32.8%
if 2.2e-304 < n Initial program 45.6%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6432.5
Simplified32.5%
associate-*r*N/A
*-commutativeN/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
*-lowering-*.f6432.5
Applied egg-rr32.5%
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6443.3
Applied egg-rr43.3%
Final simplification38.2%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= t 2.6e-308) (sqrt (fabs (* U (* 2.0 (* n t))))) (* (sqrt (* n U)) (sqrt (* 2.0 t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (t <= 2.6e-308) {
tmp = sqrt(fabs((U * (2.0 * (n * t)))));
} else {
tmp = sqrt((n * U)) * sqrt((2.0 * 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 (t <= 2.6d-308) then
tmp = sqrt(abs((u * (2.0d0 * (n * t)))))
else
tmp = sqrt((n * u)) * sqrt((2.0d0 * 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 (t <= 2.6e-308) {
tmp = Math.sqrt(Math.abs((U * (2.0 * (n * t)))));
} else {
tmp = Math.sqrt((n * U)) * Math.sqrt((2.0 * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if t <= 2.6e-308: tmp = math.sqrt(math.fabs((U * (2.0 * (n * t))))) else: tmp = math.sqrt((n * U)) * math.sqrt((2.0 * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (t <= 2.6e-308) tmp = sqrt(abs(Float64(U * Float64(2.0 * Float64(n * t))))); else tmp = Float64(sqrt(Float64(n * U)) * sqrt(Float64(2.0 * 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 (t <= 2.6e-308) tmp = sqrt(abs((U * (2.0 * (n * t))))); else tmp = sqrt((n * U)) * sqrt((2.0 * t)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[t, 2.6e-308], N[Sqrt[N[Abs[N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 2.6 \cdot 10^{-308}:\\
\;\;\;\;\sqrt{\left|U \cdot \left(2 \cdot \left(n \cdot t\right)\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot U} \cdot \sqrt{2 \cdot t}\\
\end{array}
\end{array}
if t < 2.6e-308Initial program 47.1%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6431.3
Simplified31.3%
associate-*r*N/A
rem-square-sqrtN/A
sqrt-unprodN/A
rem-sqrt-squareN/A
fabs-lowering-fabs.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.2
Applied egg-rr35.2%
if 2.6e-308 < t Initial program 47.9%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6429.7
Simplified29.7%
associate-*r*N/A
*-commutativeN/A
associate-*r*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
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6440.8
Applied egg-rr40.8%
Final simplification37.9%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (sqrt (* (* n t) (* 2.0 U))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return sqrt(((n * t) * (2.0 * U)));
}
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(((n * t) * (2.0d0 * u)))
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(((n * t) * (2.0 * U)));
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): return math.sqrt(((n * t) * (2.0 * U)))
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) return sqrt(Float64(Float64(n * t) * Float64(2.0 * U))) end
l_m = abs(l); function tmp = code(n, U, t, l_m, Om, U_42_) tmp = sqrt(((n * t) * (2.0 * U))); end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := N[Sqrt[N[(N[(n * t), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\sqrt{\left(n \cdot t\right) \cdot \left(2 \cdot U\right)}
\end{array}
Initial program 47.5%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6430.5
Simplified30.5%
Final simplification30.5%
herbie shell --seed 2024199
(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*))))))