
(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 15 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}
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* n (pow (/ l Om) 2.0)))
(t_2
(* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* t_1 (- U U*)))))
(t_3 (* l (/ l Om))))
(if (<= t_2 5e-324)
(sqrt
(fma
-2.0
(/ (* n n) (* (/ (/ Om l) l) (/ Om (* U (- U U*)))))
(* (* 2.0 n) (* U (fma l (* (/ l Om) -2.0) t)))))
(if (<= t_2 INFINITY)
(* (sqrt 2.0) (sqrt (* (* n U) (+ t (- (* t_1 (- U* U)) (* 2.0 t_3))))))
(pow (* 2.0 (* n (* U (+ t (* -2.0 t_3))))) 0.5)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * pow((l / Om), 2.0);
double t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - (t_1 * (U - U_42_)));
double t_3 = l * (l / Om);
double tmp;
if (t_2 <= 5e-324) {
tmp = sqrt(fma(-2.0, ((n * n) / (((Om / l) / l) * (Om / (U * (U - U_42_))))), ((2.0 * n) * (U * fma(l, ((l / Om) * -2.0), t)))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(2.0) * sqrt(((n * U) * (t + ((t_1 * (U_42_ - U)) - (2.0 * t_3)))));
} else {
tmp = pow((2.0 * (n * (U * (t + (-2.0 * t_3))))), 0.5);
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n * (Float64(l / Om) ^ 2.0)) t_2 = Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(t_1 * Float64(U - U_42_)))) t_3 = Float64(l * Float64(l / Om)) tmp = 0.0 if (t_2 <= 5e-324) tmp = sqrt(fma(-2.0, Float64(Float64(n * n) / Float64(Float64(Float64(Om / l) / l) * Float64(Om / Float64(U * Float64(U - U_42_))))), Float64(Float64(2.0 * n) * Float64(U * fma(l, Float64(Float64(l / Om) * -2.0), t))))); elseif (t_2 <= Inf) tmp = Float64(sqrt(2.0) * sqrt(Float64(Float64(n * U) * Float64(t + Float64(Float64(t_1 * Float64(U_42_ - U)) - Float64(2.0 * t_3)))))); else tmp = Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(-2.0 * t_3))))) ^ 0.5; end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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[(t$95$1 * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 5e-324], N[Sqrt[N[(-2.0 * N[(N[(n * n), $MachinePrecision] / N[(N[(N[(Om / l), $MachinePrecision] / l), $MachinePrecision] * N[(Om / N[(U * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(l * N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(t$95$1 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] - N[(2.0 * t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(2.0 * N[(n * N[(U * N[(t + N[(-2.0 * t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\\
t_2 := \left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - t_1 \cdot \left(U - U*\right)\right)\\
t_3 := \ell \cdot \frac{\ell}{Om}\\
\mathbf{if}\;t_2 \leq 5 \cdot 10^{-324}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-2, \frac{n \cdot n}{\frac{\frac{Om}{\ell}}{\ell} \cdot \frac{Om}{U \cdot \left(U - U*\right)}}, \left(2 \cdot n\right) \cdot \left(U \cdot \mathsf{fma}\left(\ell, \frac{\ell}{Om} \cdot -2, t\right)\right)\right)}\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;\sqrt{2} \cdot \sqrt{\left(n \cdot U\right) \cdot \left(t + \left(t_1 \cdot \left(U* - U\right) - 2 \cdot t_3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot \left(t + -2 \cdot t_3\right)\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < 4.94066e-324Initial program 10.2%
Simplified10.2%
Taylor expanded in n around 0 39.6%
fma-def39.6%
associate-/l*42.1%
unpow242.1%
unpow242.1%
times-frac43.8%
unpow243.8%
associate-/r*43.9%
*-commutative43.9%
associate-*r*44.4%
cancel-sign-sub-inv44.4%
metadata-eval44.4%
*-commutative44.4%
+-commutative44.4%
Simplified44.4%
if 4.94066e-324 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < +inf.0Initial program 64.6%
Simplified66.5%
pow1/266.5%
associate-*l*66.4%
unpow-prod-down67.3%
pow1/267.3%
*-commutative67.3%
associate-*r*70.7%
*-commutative70.7%
*-commutative70.7%
Applied egg-rr70.7%
unpow1/270.7%
Simplified70.7%
fma-udef70.7%
Applied egg-rr70.7%
if +inf.0 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) Initial program 0.0%
Simplified3.0%
pow1/23.0%
fma-udef3.0%
associate-*l/0.1%
associate-*r*0.0%
*-commutative0.0%
associate--l-0.0%
cancel-sign-sub-inv0.0%
metadata-eval0.0%
associate-*r*0.1%
Applied egg-rr2.9%
Taylor expanded in n around 0 36.6%
*-commutative36.6%
cancel-sign-sub-inv36.6%
metadata-eval36.6%
*-commutative36.6%
unpow236.6%
associate-*r/44.1%
Simplified44.1%
Final simplification62.7%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (/ (/ Om l) l))
(t_2
(sqrt
(*
(* (* 2.0 n) U)
(-
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U U*)))))))
(if (<= t_2 4e-101)
(sqrt (fma 2.0 (* U (* n t)) (/ (* n -4.0) (/ t_1 U))))
(if (<= t_2 4e+120)
t_2
(if (<= t_2 INFINITY)
(sqrt
(* (* 2.0 (* n U)) (+ t (- (/ n (* t_1 (/ Om U*))) (/ 2.0 t_1)))))
(sqrt (* (/ 2.0 Om) (/ (* n l) (/ (/ Om (* U U*)) (* n l))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (Om / l) / l;
double t_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
double tmp;
if (t_2 <= 4e-101) {
tmp = sqrt(fma(2.0, (U * (n * t)), ((n * -4.0) / (t_1 / U))));
} else if (t_2 <= 4e+120) {
tmp = t_2;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + ((n / (t_1 * (Om / U_42_))) - (2.0 / t_1)))));
} else {
tmp = sqrt(((2.0 / Om) * ((n * l) / ((Om / (U * U_42_)) / (n * l)))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(Om / l) / l) t_2 = 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_))))) tmp = 0.0 if (t_2 <= 4e-101) tmp = sqrt(fma(2.0, Float64(U * Float64(n * t)), Float64(Float64(n * -4.0) / Float64(t_1 / U)))); elseif (t_2 <= 4e+120) tmp = t_2; elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(n / Float64(t_1 * Float64(Om / U_42_))) - Float64(2.0 / t_1))))); else tmp = sqrt(Float64(Float64(2.0 / Om) * Float64(Float64(n * l) / Float64(Float64(Om / Float64(U * U_42_)) / Float64(n * l))))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(Om / l), $MachinePrecision] / l), $MachinePrecision]}, Block[{t$95$2 = 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]}, If[LessEqual[t$95$2, 4e-101], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(N[(n * -4.0), $MachinePrecision] / N[(t$95$1 / U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, 4e+120], t$95$2, If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(n / N[(t$95$1 * N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(2.0 / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 / Om), $MachinePrecision] * N[(N[(n * l), $MachinePrecision] / N[(N[(Om / N[(U * U$42$), $MachinePrecision]), $MachinePrecision] / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\frac{Om}{\ell}}{\ell}\\
t_2 := \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)}\\
\mathbf{if}\;t_2 \leq 4 \cdot 10^{-101}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(2, U \cdot \left(n \cdot t\right), \frac{n \cdot -4}{\frac{t_1}{U}}\right)}\\
\mathbf{elif}\;t_2 \leq 4 \cdot 10^{+120}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(\frac{n}{t_1 \cdot \frac{Om}{U*}} - \frac{2}{t_1}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{Om} \cdot \frac{n \cdot \ell}{\frac{\frac{Om}{U \cdot U*}}{n \cdot \ell}}}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 4.00000000000000021e-101Initial program 25.3%
Simplified25.2%
Taylor expanded in Om around inf 47.0%
fma-def47.0%
associate-*r*49.2%
associate-/l*48.4%
associate-*r/48.4%
associate-/r*48.4%
unpow248.4%
associate-/r*48.4%
Simplified48.4%
if 4.00000000000000021e-101 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 3.9999999999999999e120Initial program 99.8%
if 3.9999999999999999e120 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < +inf.0Initial program 33.9%
Simplified41.8%
Taylor expanded in U around 0 30.7%
+-commutative30.7%
mul-1-neg30.7%
unsub-neg30.7%
associate-*r/30.7%
associate-/l*30.7%
unpow230.7%
associate-/r*30.7%
associate-/l*30.7%
unpow230.7%
times-frac33.1%
unpow233.1%
associate-/r*44.1%
Simplified44.1%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) Initial program 0.0%
Simplified2.8%
Taylor expanded in U* around inf 32.4%
associate-*r/32.4%
unpow232.4%
times-frac35.3%
associate-*r*35.3%
unpow235.3%
unpow235.3%
Simplified35.3%
*-un-lft-identity35.3%
associate-/l*34.8%
unswap-sqr40.8%
Applied egg-rr40.8%
*-lft-identity40.8%
associate-/l*43.2%
Simplified43.2%
Final simplification61.4%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* n (pow (/ l Om) 2.0)))
(t_2
(sqrt
(*
(* (* 2.0 n) U)
(- (- t (* 2.0 (/ (* l l) Om))) (* t_1 (- U U*)))))))
(if (<= t_2 4e-101)
(sqrt (fma 2.0 (* U (* n t)) (/ (* n -4.0) (/ (/ (/ Om l) l) U))))
(if (<= t_2 INFINITY)
(*
(sqrt 2.0)
(sqrt (* (* n U) (+ t (- (* t_1 (- U* U)) (* 2.0 (* l (/ l Om))))))))
(sqrt (* (/ 2.0 Om) (/ (* n l) (/ (/ Om (* U U*)) (* n l)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * pow((l / Om), 2.0);
double t_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - (t_1 * (U - U_42_)))));
double tmp;
if (t_2 <= 4e-101) {
tmp = sqrt(fma(2.0, (U * (n * t)), ((n * -4.0) / (((Om / l) / l) / U))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(2.0) * sqrt(((n * U) * (t + ((t_1 * (U_42_ - U)) - (2.0 * (l * (l / Om)))))));
} else {
tmp = sqrt(((2.0 / Om) * ((n * l) / ((Om / (U * U_42_)) / (n * l)))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n * (Float64(l / Om) ^ 2.0)) t_2 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(t_1 * Float64(U - U_42_))))) tmp = 0.0 if (t_2 <= 4e-101) tmp = sqrt(fma(2.0, Float64(U * Float64(n * t)), Float64(Float64(n * -4.0) / Float64(Float64(Float64(Om / l) / l) / U)))); elseif (t_2 <= Inf) tmp = Float64(sqrt(2.0) * sqrt(Float64(Float64(n * U) * Float64(t + Float64(Float64(t_1 * Float64(U_42_ - U)) - Float64(2.0 * Float64(l * Float64(l / Om)))))))); else tmp = sqrt(Float64(Float64(2.0 / Om) * Float64(Float64(n * l) / Float64(Float64(Om / Float64(U * U_42_)) / Float64(n * l))))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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[(t$95$1 * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 4e-101], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(N[(n * -4.0), $MachinePrecision] / N[(N[(N[(Om / l), $MachinePrecision] / l), $MachinePrecision] / U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(t$95$1 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(2.0 / Om), $MachinePrecision] * N[(N[(n * l), $MachinePrecision] / N[(N[(Om / N[(U * U$42$), $MachinePrecision]), $MachinePrecision] / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\\
t_2 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - t_1 \cdot \left(U - U*\right)\right)}\\
\mathbf{if}\;t_2 \leq 4 \cdot 10^{-101}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(2, U \cdot \left(n \cdot t\right), \frac{n \cdot -4}{\frac{\frac{\frac{Om}{\ell}}{\ell}}{U}}\right)}\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;\sqrt{2} \cdot \sqrt{\left(n \cdot U\right) \cdot \left(t + \left(t_1 \cdot \left(U* - U\right) - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{Om} \cdot \frac{n \cdot \ell}{\frac{\frac{Om}{U \cdot U*}}{n \cdot \ell}}}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 4.00000000000000021e-101Initial program 25.3%
Simplified25.2%
Taylor expanded in Om around inf 47.0%
fma-def47.0%
associate-*r*49.2%
associate-/l*48.4%
associate-*r/48.4%
associate-/r*48.4%
unpow248.4%
associate-/r*48.4%
Simplified48.4%
if 4.00000000000000021e-101 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < +inf.0Initial program 63.7%
Simplified65.7%
pow1/265.7%
associate-*l*65.7%
unpow-prod-down66.6%
pow1/266.6%
*-commutative66.6%
associate-*r*70.2%
*-commutative70.2%
*-commutative70.2%
Applied egg-rr70.2%
unpow1/270.2%
Simplified70.2%
fma-udef70.2%
Applied egg-rr70.2%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) Initial program 0.0%
Simplified2.8%
Taylor expanded in U* around inf 32.4%
associate-*r/32.4%
unpow232.4%
times-frac35.3%
associate-*r*35.3%
unpow235.3%
unpow235.3%
Simplified35.3%
*-un-lft-identity35.3%
associate-/l*34.8%
unswap-sqr40.8%
Applied egg-rr40.8%
*-lft-identity40.8%
associate-/l*43.2%
Simplified43.2%
Final simplification62.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* n (pow (/ l Om) 2.0)))
(t_2
(sqrt
(*
(* (* 2.0 n) U)
(+ (- t (* 2.0 (/ (* l l) Om))) (* t_1 (- U* U)))))))
(if (<= t_2 4e-101)
(sqrt (fma 2.0 (* U (* n t)) (/ (* n -4.0) (/ (/ (/ Om l) l) U))))
(if (<= t_2 INFINITY)
(pow
(* (* 2.0 (* n U)) (- t (fma 2.0 (* l (/ l Om)) (* t_1 (- U U*)))))
0.5)
(sqrt (* (/ 2.0 Om) (/ (* n l) (/ (/ Om (* U U*)) (* n l)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * pow((l / Om), 2.0);
double t_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + (t_1 * (U_42_ - U)))));
double tmp;
if (t_2 <= 4e-101) {
tmp = sqrt(fma(2.0, (U * (n * t)), ((n * -4.0) / (((Om / l) / l) / U))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = pow(((2.0 * (n * U)) * (t - fma(2.0, (l * (l / Om)), (t_1 * (U - U_42_))))), 0.5);
} else {
tmp = sqrt(((2.0 / Om) * ((n * l) / ((Om / (U * U_42_)) / (n * l)))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n * (Float64(l / Om) ^ 2.0)) t_2 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + Float64(t_1 * Float64(U_42_ - U))))) tmp = 0.0 if (t_2 <= 4e-101) tmp = sqrt(fma(2.0, Float64(U * Float64(n * t)), Float64(Float64(n * -4.0) / Float64(Float64(Float64(Om / l) / l) / U)))); elseif (t_2 <= Inf) tmp = Float64(Float64(2.0 * Float64(n * U)) * Float64(t - fma(2.0, Float64(l * Float64(l / Om)), Float64(t_1 * Float64(U - U_42_))))) ^ 0.5; else tmp = sqrt(Float64(Float64(2.0 / Om) * Float64(Float64(n * l) / Float64(Float64(Om / Float64(U * U_42_)) / Float64(n * l))))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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[(t$95$1 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 4e-101], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(N[(n * -4.0), $MachinePrecision] / N[(N[(N[(Om / l), $MachinePrecision] / l), $MachinePrecision] / U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Power[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(2.0 / Om), $MachinePrecision] * N[(N[(n * l), $MachinePrecision] / N[(N[(Om / N[(U * U$42$), $MachinePrecision]), $MachinePrecision] / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\\
t_2 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t_1 \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t_2 \leq 4 \cdot 10^{-101}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(2, U \cdot \left(n \cdot t\right), \frac{n \cdot -4}{\frac{\frac{\frac{Om}{\ell}}{\ell}}{U}}\right)}\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;{\left(\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - \mathsf{fma}\left(2, \ell \cdot \frac{\ell}{Om}, t_1 \cdot \left(U - U*\right)\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{Om} \cdot \frac{n \cdot \ell}{\frac{\frac{Om}{U \cdot U*}}{n \cdot \ell}}}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 4.00000000000000021e-101Initial program 25.3%
Simplified25.2%
Taylor expanded in Om around inf 47.0%
fma-def47.0%
associate-*r*49.2%
associate-/l*48.4%
associate-*r/48.4%
associate-/r*48.4%
unpow248.4%
associate-/r*48.4%
Simplified48.4%
if 4.00000000000000021e-101 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < +inf.0Initial program 63.7%
Simplified65.7%
pow1/265.7%
fma-udef65.7%
associate-*l/60.1%
associate-*r*63.7%
*-commutative63.7%
associate--l-63.7%
cancel-sign-sub-inv63.7%
metadata-eval63.7%
associate-*r*63.2%
Applied egg-rr69.4%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) Initial program 0.0%
Simplified2.8%
Taylor expanded in U* around inf 32.4%
associate-*r/32.4%
unpow232.4%
times-frac35.3%
associate-*r*35.3%
unpow235.3%
unpow235.3%
Simplified35.3%
*-un-lft-identity35.3%
associate-/l*34.8%
unswap-sqr40.8%
Applied egg-rr40.8%
*-lft-identity40.8%
associate-/l*43.2%
Simplified43.2%
Final simplification61.5%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1.1e+44)
(sqrt
(*
(* 2.0 (* n U))
(+ (+ t (* (/ (* l l) Om) -2.0)) (* n (* (pow (/ l Om) 2.0) (- U* U))))))
(pow (* 2.0 (* n (* U (+ t (* -2.0 (* l (/ l Om))))))) 0.5)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.1e+44) {
tmp = sqrt(((2.0 * (n * U)) * ((t + (((l * l) / Om) * -2.0)) + (n * (pow((l / Om), 2.0) * (U_42_ - U))))));
} else {
tmp = pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5);
}
return tmp;
}
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
real(8) :: tmp
if (l <= 1.1d+44) then
tmp = sqrt(((2.0d0 * (n * u)) * ((t + (((l * l) / om) * (-2.0d0))) + (n * (((l / om) ** 2.0d0) * (u_42 - u))))))
else
tmp = (2.0d0 * (n * (u * (t + ((-2.0d0) * (l * (l / om))))))) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.1e+44) {
tmp = Math.sqrt(((2.0 * (n * U)) * ((t + (((l * l) / Om) * -2.0)) + (n * (Math.pow((l / Om), 2.0) * (U_42_ - U))))));
} else {
tmp = Math.pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.1e+44: tmp = math.sqrt(((2.0 * (n * U)) * ((t + (((l * l) / Om) * -2.0)) + (n * (math.pow((l / Om), 2.0) * (U_42_ - U)))))) else: tmp = math.pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.1e+44) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)) + Float64(n * Float64((Float64(l / Om) ^ 2.0) * Float64(U_42_ - U)))))); else tmp = Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om))))))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.1e+44) tmp = sqrt(((2.0 * (n * U)) * ((t + (((l * l) / Om) * -2.0)) + (n * (((l / Om) ^ 2.0) * (U_42_ - U)))))); else tmp = (2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.1e+44], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision] + N[(n * N[(N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(n * N[(U * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.1 \cdot 10^{+44}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(\left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right) + n \cdot \left({\left(\frac{\ell}{Om}\right)}^{2} \cdot \left(U* - U\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 1.09999999999999998e44Initial program 52.4%
Simplified51.9%
if 1.09999999999999998e44 < l Initial program 22.6%
Simplified37.2%
pow1/237.2%
fma-udef37.2%
associate-*l/22.7%
associate-*r*22.6%
*-commutative22.6%
associate--l-22.6%
cancel-sign-sub-inv22.6%
metadata-eval22.6%
associate-*r*22.7%
Applied egg-rr37.1%
Taylor expanded in n around 0 37.8%
*-commutative37.8%
cancel-sign-sub-inv37.8%
metadata-eval37.8%
*-commutative37.8%
unpow237.8%
associate-*r/45.8%
Simplified45.8%
Final simplification50.7%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (/ (/ Om l) l)))
(if (<= l 3.05e-174)
(sqrt (* n (* t (* 2.0 U))))
(if (<= l 3e+44)
(sqrt (* (* 2.0 (* n U)) (+ t (- (/ n (* t_1 (/ Om U*))) (/ 2.0 t_1)))))
(pow (* 2.0 (* n (* U (+ t (* -2.0 (* l (/ l Om))))))) 0.5)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (Om / l) / l;
double tmp;
if (l <= 3.05e-174) {
tmp = sqrt((n * (t * (2.0 * U))));
} else if (l <= 3e+44) {
tmp = sqrt(((2.0 * (n * U)) * (t + ((n / (t_1 * (Om / U_42_))) - (2.0 / t_1)))));
} else {
tmp = pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5);
}
return tmp;
}
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
real(8) :: t_1
real(8) :: tmp
t_1 = (om / l) / l
if (l <= 3.05d-174) then
tmp = sqrt((n * (t * (2.0d0 * u))))
else if (l <= 3d+44) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + ((n / (t_1 * (om / u_42))) - (2.0d0 / t_1)))))
else
tmp = (2.0d0 * (n * (u * (t + ((-2.0d0) * (l * (l / om))))))) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (Om / l) / l;
double tmp;
if (l <= 3.05e-174) {
tmp = Math.sqrt((n * (t * (2.0 * U))));
} else if (l <= 3e+44) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + ((n / (t_1 * (Om / U_42_))) - (2.0 / t_1)))));
} else {
tmp = Math.pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (Om / l) / l tmp = 0 if l <= 3.05e-174: tmp = math.sqrt((n * (t * (2.0 * U)))) elif l <= 3e+44: tmp = math.sqrt(((2.0 * (n * U)) * (t + ((n / (t_1 * (Om / U_42_))) - (2.0 / t_1))))) else: tmp = math.pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(Om / l) / l) tmp = 0.0 if (l <= 3.05e-174) tmp = sqrt(Float64(n * Float64(t * Float64(2.0 * U)))); elseif (l <= 3e+44) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(n / Float64(t_1 * Float64(Om / U_42_))) - Float64(2.0 / t_1))))); else tmp = Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om))))))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (Om / l) / l; tmp = 0.0; if (l <= 3.05e-174) tmp = sqrt((n * (t * (2.0 * U)))); elseif (l <= 3e+44) tmp = sqrt(((2.0 * (n * U)) * (t + ((n / (t_1 * (Om / U_42_))) - (2.0 / t_1))))); else tmp = (2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(Om / l), $MachinePrecision] / l), $MachinePrecision]}, If[LessEqual[l, 3.05e-174], N[Sqrt[N[(n * N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 3e+44], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(n / N[(t$95$1 * N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(2.0 / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(n * N[(U * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\frac{Om}{\ell}}{\ell}\\
\mathbf{if}\;\ell \leq 3.05 \cdot 10^{-174}:\\
\;\;\;\;\sqrt{n \cdot \left(t \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{elif}\;\ell \leq 3 \cdot 10^{+44}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(\frac{n}{t_1 \cdot \frac{Om}{U*}} - \frac{2}{t_1}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 3.04999999999999982e-174Initial program 50.0%
Simplified50.9%
Taylor expanded in t around inf 40.9%
associate-*r*39.0%
Simplified39.0%
associate-*l*40.9%
*-commutative40.9%
expm1-log1p-u39.7%
expm1-udef22.1%
Applied egg-rr22.1%
expm1-def39.7%
expm1-log1p40.9%
*-commutative40.9%
associate-*l*41.0%
*-commutative41.0%
associate-*r*41.0%
Simplified41.0%
if 3.04999999999999982e-174 < l < 2.99999999999999987e44Initial program 59.7%
Simplified51.8%
Taylor expanded in U around 0 59.7%
+-commutative59.7%
mul-1-neg59.7%
unsub-neg59.7%
associate-*r/59.7%
associate-/l*59.7%
unpow259.7%
associate-/r*59.7%
associate-/l*61.7%
unpow261.7%
times-frac59.8%
unpow259.8%
associate-/r*61.7%
Simplified61.7%
if 2.99999999999999987e44 < l Initial program 22.6%
Simplified37.2%
pow1/237.2%
fma-udef37.2%
associate-*l/22.7%
associate-*r*22.6%
*-commutative22.6%
associate--l-22.6%
cancel-sign-sub-inv22.6%
metadata-eval22.6%
associate-*r*22.7%
Applied egg-rr37.1%
Taylor expanded in n around 0 37.8%
*-commutative37.8%
cancel-sign-sub-inv37.8%
metadata-eval37.8%
*-commutative37.8%
unpow237.8%
associate-*r/45.8%
Simplified45.8%
Final simplification46.0%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 2.25e-163)
(sqrt (* n (* t (* 2.0 U))))
(if (<= l 7.2e-22)
(pow
(* (* 2.0 (* n U)) (- t (* (/ n Om) (/ (* (* l l) (- U U*)) Om))))
0.5)
(pow (* 2.0 (* n (* U (+ t (* -2.0 (* l (/ l Om))))))) 0.5))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.25e-163) {
tmp = sqrt((n * (t * (2.0 * U))));
} else if (l <= 7.2e-22) {
tmp = pow(((2.0 * (n * U)) * (t - ((n / Om) * (((l * l) * (U - U_42_)) / Om)))), 0.5);
} else {
tmp = pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5);
}
return tmp;
}
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
real(8) :: tmp
if (l <= 2.25d-163) then
tmp = sqrt((n * (t * (2.0d0 * u))))
else if (l <= 7.2d-22) then
tmp = ((2.0d0 * (n * u)) * (t - ((n / om) * (((l * l) * (u - u_42)) / om)))) ** 0.5d0
else
tmp = (2.0d0 * (n * (u * (t + ((-2.0d0) * (l * (l / om))))))) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.25e-163) {
tmp = Math.sqrt((n * (t * (2.0 * U))));
} else if (l <= 7.2e-22) {
tmp = Math.pow(((2.0 * (n * U)) * (t - ((n / Om) * (((l * l) * (U - U_42_)) / Om)))), 0.5);
} else {
tmp = Math.pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2.25e-163: tmp = math.sqrt((n * (t * (2.0 * U)))) elif l <= 7.2e-22: tmp = math.pow(((2.0 * (n * U)) * (t - ((n / Om) * (((l * l) * (U - U_42_)) / Om)))), 0.5) else: tmp = math.pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.25e-163) tmp = sqrt(Float64(n * Float64(t * Float64(2.0 * U)))); elseif (l <= 7.2e-22) tmp = Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(Float64(n / Om) * Float64(Float64(Float64(l * l) * Float64(U - U_42_)) / Om)))) ^ 0.5; else tmp = Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om))))))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2.25e-163) tmp = sqrt((n * (t * (2.0 * U)))); elseif (l <= 7.2e-22) tmp = ((2.0 * (n * U)) * (t - ((n / Om) * (((l * l) * (U - U_42_)) / Om)))) ^ 0.5; else tmp = (2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.25e-163], N[Sqrt[N[(n * N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 7.2e-22], N[Power[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(N[(n / Om), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Power[N[(2.0 * N[(n * N[(U * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.25 \cdot 10^{-163}:\\
\;\;\;\;\sqrt{n \cdot \left(t \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{elif}\;\ell \leq 7.2 \cdot 10^{-22}:\\
\;\;\;\;{\left(\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - \frac{n}{Om} \cdot \frac{\left(\ell \cdot \ell\right) \cdot \left(U - U*\right)}{Om}\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 2.2499999999999999e-163Initial program 50.4%
Simplified51.2%
Taylor expanded in t around inf 40.8%
associate-*r*39.0%
Simplified39.0%
associate-*l*40.8%
*-commutative40.8%
expm1-log1p-u39.7%
expm1-udef22.2%
Applied egg-rr22.2%
expm1-def39.7%
expm1-log1p40.8%
*-commutative40.8%
associate-*l*40.9%
*-commutative40.9%
associate-*r*40.9%
Simplified40.9%
if 2.2499999999999999e-163 < l < 7.1999999999999996e-22Initial program 61.1%
Simplified53.1%
pow1/253.1%
fma-udef53.1%
associate-*l/53.1%
associate-*r*61.1%
*-commutative61.1%
associate--l-61.1%
cancel-sign-sub-inv61.1%
metadata-eval61.1%
associate-*r*61.1%
Applied egg-rr61.1%
Taylor expanded in Om around 0 63.9%
*-commutative63.9%
unpow263.9%
unpow263.9%
times-frac61.5%
Simplified61.5%
if 7.1999999999999996e-22 < l Initial program 27.6%
Simplified38.0%
pow1/238.0%
fma-udef38.0%
associate-*l/26.0%
associate-*r*27.6%
*-commutative27.6%
associate--l-27.6%
cancel-sign-sub-inv27.6%
metadata-eval27.6%
associate-*r*27.7%
Applied egg-rr39.6%
Taylor expanded in n around 0 43.4%
*-commutative43.4%
cancel-sign-sub-inv43.4%
metadata-eval43.4%
*-commutative43.4%
unpow243.4%
associate-*r/50.1%
Simplified50.1%
Final simplification46.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om))))
(if (<= U 2.2e-13)
(pow (* 2.0 (* n (* U (+ t (* -2.0 t_1))))) 0.5)
(pow (* (* 2.0 (* n U)) (- t (* 2.0 t_1))) 0.5))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double tmp;
if (U <= 2.2e-13) {
tmp = pow((2.0 * (n * (U * (t + (-2.0 * t_1))))), 0.5);
} else {
tmp = pow(((2.0 * (n * U)) * (t - (2.0 * t_1))), 0.5);
}
return tmp;
}
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
real(8) :: t_1
real(8) :: tmp
t_1 = l * (l / om)
if (u <= 2.2d-13) then
tmp = (2.0d0 * (n * (u * (t + ((-2.0d0) * t_1))))) ** 0.5d0
else
tmp = ((2.0d0 * (n * u)) * (t - (2.0d0 * t_1))) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double tmp;
if (U <= 2.2e-13) {
tmp = Math.pow((2.0 * (n * (U * (t + (-2.0 * t_1))))), 0.5);
} else {
tmp = Math.pow(((2.0 * (n * U)) * (t - (2.0 * t_1))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * (l / Om) tmp = 0 if U <= 2.2e-13: tmp = math.pow((2.0 * (n * (U * (t + (-2.0 * t_1))))), 0.5) else: tmp = math.pow(((2.0 * (n * U)) * (t - (2.0 * t_1))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) tmp = 0.0 if (U <= 2.2e-13) tmp = Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(-2.0 * t_1))))) ^ 0.5; else tmp = Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(2.0 * t_1))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * (l / Om); tmp = 0.0; if (U <= 2.2e-13) tmp = (2.0 * (n * (U * (t + (-2.0 * t_1))))) ^ 0.5; else tmp = ((2.0 * (n * U)) * (t - (2.0 * t_1))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[U, 2.2e-13], N[Power[N[(2.0 * N[(n * N[(U * N[(t + N[(-2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Power[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
\mathbf{if}\;U \leq 2.2 \cdot 10^{-13}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot \left(t + -2 \cdot t_1\right)\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - 2 \cdot t_1\right)\right)}^{0.5}\\
\end{array}
\end{array}
if U < 2.19999999999999997e-13Initial program 44.2%
Simplified44.6%
pow1/244.6%
fma-udef44.6%
associate-*l/41.7%
associate-*r*44.2%
*-commutative44.2%
associate--l-44.2%
cancel-sign-sub-inv44.2%
metadata-eval44.2%
associate-*r*43.7%
Applied egg-rr47.0%
Taylor expanded in n around 0 45.5%
*-commutative45.5%
cancel-sign-sub-inv45.5%
metadata-eval45.5%
*-commutative45.5%
unpow245.5%
associate-*r/49.7%
Simplified49.7%
if 2.19999999999999997e-13 < U Initial program 57.0%
Simplified64.8%
pow1/264.8%
fma-udef64.8%
associate-*l/54.9%
associate-*r*57.1%
*-commutative57.1%
associate--l-57.1%
cancel-sign-sub-inv57.1%
metadata-eval57.1%
associate-*r*57.1%
Applied egg-rr67.0%
Taylor expanded in Om around inf 57.5%
unpow257.5%
associate-*r/65.4%
Simplified65.4%
Final simplification52.7%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 2.2e-107) (pow (* n (* t (* 2.0 U))) 0.5) (sqrt (* (* 2.0 (* n U)) (- t (/ 2.0 (/ (/ Om l) l)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.2e-107) {
tmp = pow((n * (t * (2.0 * U))), 0.5);
} else {
tmp = sqrt(((2.0 * (n * U)) * (t - (2.0 / ((Om / l) / l)))));
}
return tmp;
}
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
real(8) :: tmp
if (l <= 2.2d-107) then
tmp = (n * (t * (2.0d0 * u))) ** 0.5d0
else
tmp = sqrt(((2.0d0 * (n * u)) * (t - (2.0d0 / ((om / l) / l)))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.2e-107) {
tmp = Math.pow((n * (t * (2.0 * U))), 0.5);
} else {
tmp = Math.sqrt(((2.0 * (n * U)) * (t - (2.0 / ((Om / l) / l)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2.2e-107: tmp = math.pow((n * (t * (2.0 * U))), 0.5) else: tmp = math.sqrt(((2.0 * (n * U)) * (t - (2.0 / ((Om / l) / l))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.2e-107) tmp = Float64(n * Float64(t * Float64(2.0 * U))) ^ 0.5; else tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(2.0 / Float64(Float64(Om / l) / l))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2.2e-107) tmp = (n * (t * (2.0 * U))) ^ 0.5; else tmp = sqrt(((2.0 * (n * U)) * (t - (2.0 / ((Om / l) / l))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.2e-107], N[Power[N[(n * N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(2.0 / N[(N[(Om / l), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.2 \cdot 10^{-107}:\\
\;\;\;\;{\left(n \cdot \left(t \cdot \left(2 \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - \frac{2}{\frac{\frac{Om}{\ell}}{\ell}}\right)}\\
\end{array}
\end{array}
if l < 2.20000000000000012e-107Initial program 52.4%
Simplified51.4%
Taylor expanded in t around inf 40.9%
associate-*r*40.3%
Simplified40.3%
associate-*l*40.9%
*-commutative40.9%
expm1-log1p-u39.7%
expm1-udef22.6%
Applied egg-rr22.6%
expm1-def39.7%
expm1-log1p40.9%
*-commutative40.9%
associate-*l*41.0%
*-commutative41.0%
associate-*r*41.0%
Simplified41.0%
pow1/242.1%
*-commutative42.1%
*-commutative42.1%
Applied egg-rr42.1%
if 2.20000000000000012e-107 < l Initial program 34.3%
Simplified41.9%
Taylor expanded in Om around inf 29.2%
associate-*r/29.2%
associate-/l*29.2%
unpow229.2%
associate-/r*35.7%
Simplified35.7%
Final simplification40.1%
(FPCore (n U t l Om U*) :precision binary64 (pow (* 2.0 (* n (* U (+ t (* -2.0 (* l (/ l Om))))))) 0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5);
}
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 = (2.0d0 * (n * (u * (t + ((-2.0d0) * (l * (l / om))))))) ** 0.5d0
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow((2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))), 0.5)
function code(n, U, t, l, Om, U_42_) return Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om))))))) ^ 0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = (2.0 * (n * (U * (t + (-2.0 * (l * (l / Om))))))) ^ 0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(2.0 * N[(n * N[(U * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(2 \cdot \left(n \cdot \left(U \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)\right)}^{0.5}
\end{array}
Initial program 46.7%
Simplified48.4%
pow1/248.4%
fma-udef48.4%
associate-*l/44.3%
associate-*r*46.7%
*-commutative46.7%
associate--l-46.7%
cancel-sign-sub-inv46.7%
metadata-eval46.7%
associate-*r*46.3%
Applied egg-rr50.8%
Taylor expanded in n around 0 46.6%
*-commutative46.6%
cancel-sign-sub-inv46.6%
metadata-eval46.6%
*-commutative46.6%
unpow246.6%
associate-*r/50.4%
Simplified50.4%
Final simplification50.4%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 1e-110) (pow (* 2.0 (* n (* U t))) 0.5) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1e-110) {
tmp = pow((2.0 * (n * (U * t))), 0.5);
} else {
tmp = sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
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
real(8) :: tmp
if (l <= 1d-110) then
tmp = (2.0d0 * (n * (u * t))) ** 0.5d0
else
tmp = sqrt((2.0d0 * (u * (n * t))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1e-110) {
tmp = Math.pow((2.0 * (n * (U * t))), 0.5);
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1e-110: tmp = math.pow((2.0 * (n * (U * t))), 0.5) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1e-110) tmp = Float64(2.0 * Float64(n * Float64(U * t))) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1e-110) tmp = (2.0 * (n * (U * t))) ^ 0.5; else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1e-110], N[Power[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 10^{-110}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot t\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if l < 1.0000000000000001e-110Initial program 52.1%
Simplified51.2%
pow1/251.2%
fma-udef51.2%
associate-*l/49.1%
associate-*r*52.1%
*-commutative52.1%
associate--l-52.1%
cancel-sign-sub-inv52.1%
metadata-eval52.1%
associate-*r*51.5%
Applied egg-rr54.2%
Taylor expanded in t around inf 42.2%
if 1.0000000000000001e-110 < l Initial program 35.1%
Simplified42.6%
Taylor expanded in t around inf 18.9%
associate-*r*23.5%
Simplified23.5%
Final simplification36.2%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 2e-110) (pow (* n (* t (* 2.0 U))) 0.5) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2e-110) {
tmp = pow((n * (t * (2.0 * U))), 0.5);
} else {
tmp = sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
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
real(8) :: tmp
if (l <= 2d-110) then
tmp = (n * (t * (2.0d0 * u))) ** 0.5d0
else
tmp = sqrt((2.0d0 * (u * (n * t))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2e-110) {
tmp = Math.pow((n * (t * (2.0 * U))), 0.5);
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2e-110: tmp = math.pow((n * (t * (2.0 * U))), 0.5) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2e-110) tmp = Float64(n * Float64(t * Float64(2.0 * U))) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2e-110) tmp = (n * (t * (2.0 * U))) ^ 0.5; else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2e-110], N[Power[N[(n * N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2 \cdot 10^{-110}:\\
\;\;\;\;{\left(n \cdot \left(t \cdot \left(2 \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if l < 2.0000000000000001e-110Initial program 52.1%
Simplified51.2%
Taylor expanded in t around inf 41.1%
associate-*r*39.9%
Simplified39.9%
associate-*l*41.1%
*-commutative41.1%
expm1-log1p-u39.9%
expm1-udef22.7%
Applied egg-rr22.7%
expm1-def39.9%
expm1-log1p41.1%
*-commutative41.1%
associate-*l*41.2%
*-commutative41.2%
associate-*r*41.2%
Simplified41.2%
pow1/242.3%
*-commutative42.3%
*-commutative42.3%
Applied egg-rr42.3%
if 2.0000000000000001e-110 < l Initial program 35.1%
Simplified42.6%
Taylor expanded in t around inf 18.9%
associate-*r*23.5%
Simplified23.5%
Final simplification36.3%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 7.4e-116) (sqrt (* 2.0 (* n (* U t)))) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 7.4e-116) {
tmp = sqrt((2.0 * (n * (U * t))));
} else {
tmp = sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
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
real(8) :: tmp
if (l <= 7.4d-116) then
tmp = sqrt((2.0d0 * (n * (u * t))))
else
tmp = sqrt((2.0d0 * (u * (n * t))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 7.4e-116) {
tmp = Math.sqrt((2.0 * (n * (U * t))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 7.4e-116: tmp = math.sqrt((2.0 * (n * (U * t)))) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 7.4e-116) tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * t)))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 7.4e-116) tmp = sqrt((2.0 * (n * (U * t)))); else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 7.4e-116], N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 7.4 \cdot 10^{-116}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if l < 7.4000000000000005e-116Initial program 52.1%
Simplified51.2%
Taylor expanded in t around inf 41.0%
if 7.4000000000000005e-116 < l Initial program 35.5%
Simplified42.8%
Taylor expanded in t around inf 19.6%
associate-*r*24.1%
Simplified24.1%
Final simplification35.4%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 7.5e-116) (sqrt (* n (* t (* 2.0 U)))) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 7.5e-116) {
tmp = sqrt((n * (t * (2.0 * U))));
} else {
tmp = sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
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
real(8) :: tmp
if (l <= 7.5d-116) then
tmp = sqrt((n * (t * (2.0d0 * u))))
else
tmp = sqrt((2.0d0 * (u * (n * t))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 7.5e-116) {
tmp = Math.sqrt((n * (t * (2.0 * U))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 7.5e-116: tmp = math.sqrt((n * (t * (2.0 * U)))) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 7.5e-116) tmp = sqrt(Float64(n * Float64(t * Float64(2.0 * U)))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 7.5e-116) tmp = sqrt((n * (t * (2.0 * U)))); else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 7.5e-116], N[Sqrt[N[(n * N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 7.5 \cdot 10^{-116}:\\
\;\;\;\;\sqrt{n \cdot \left(t \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if l < 7.5000000000000004e-116Initial program 52.1%
Simplified51.2%
Taylor expanded in t around inf 41.0%
associate-*r*39.8%
Simplified39.8%
associate-*l*41.0%
*-commutative41.0%
expm1-log1p-u39.8%
expm1-udef23.0%
Applied egg-rr23.0%
expm1-def39.8%
expm1-log1p41.0%
*-commutative41.0%
associate-*l*41.1%
*-commutative41.1%
associate-*r*41.1%
Simplified41.1%
if 7.5000000000000004e-116 < l Initial program 35.5%
Simplified42.8%
Taylor expanded in t around inf 19.6%
associate-*r*24.1%
Simplified24.1%
Final simplification35.5%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* n (* U t)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * (n * (U * t))));
}
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))))
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))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * (n * (U * t))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(n * Float64(U * t)))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * (n * (U * t)))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}
\end{array}
Initial program 46.7%
Simplified48.4%
Taylor expanded in t around inf 34.0%
Final simplification34.0%
herbie shell --seed 2023274
(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*))))))