
(FPCore (t l k) :precision binary64 (/ 2.0 (* (* (* (/ (pow t 3.0) (* l l)) (sin k)) (tan k)) (+ (+ 1.0 (pow (/ k t) 2.0)) 1.0))))
double code(double t, double l, double k) {
return 2.0 / ((((pow(t, 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + pow((k / t), 2.0)) + 1.0));
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
code = 2.0d0 / (((((t ** 3.0d0) / (l * l)) * sin(k)) * tan(k)) * ((1.0d0 + ((k / t) ** 2.0d0)) + 1.0d0))
end function
public static double code(double t, double l, double k) {
return 2.0 / ((((Math.pow(t, 3.0) / (l * l)) * Math.sin(k)) * Math.tan(k)) * ((1.0 + Math.pow((k / t), 2.0)) + 1.0));
}
def code(t, l, k): return 2.0 / ((((math.pow(t, 3.0) / (l * l)) * math.sin(k)) * math.tan(k)) * ((1.0 + math.pow((k / t), 2.0)) + 1.0))
function code(t, l, k) return Float64(2.0 / Float64(Float64(Float64(Float64((t ^ 3.0) / Float64(l * l)) * sin(k)) * tan(k)) * Float64(Float64(1.0 + (Float64(k / t) ^ 2.0)) + 1.0))) end
function tmp = code(t, l, k) tmp = 2.0 / (((((t ^ 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + ((k / t) ^ 2.0)) + 1.0)); end
code[t_, l_, k_] := N[(2.0 / N[(N[(N[(N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision] * N[Sin[k], $MachinePrecision]), $MachinePrecision] * N[Tan[k], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\left(\left(\frac{{t}^{3}}{\ell \cdot \ell} \cdot \sin k\right) \cdot \tan k\right) \cdot \left(\left(1 + {\left(\frac{k}{t}\right)}^{2}\right) + 1\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (t l k) :precision binary64 (/ 2.0 (* (* (* (/ (pow t 3.0) (* l l)) (sin k)) (tan k)) (+ (+ 1.0 (pow (/ k t) 2.0)) 1.0))))
double code(double t, double l, double k) {
return 2.0 / ((((pow(t, 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + pow((k / t), 2.0)) + 1.0));
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
code = 2.0d0 / (((((t ** 3.0d0) / (l * l)) * sin(k)) * tan(k)) * ((1.0d0 + ((k / t) ** 2.0d0)) + 1.0d0))
end function
public static double code(double t, double l, double k) {
return 2.0 / ((((Math.pow(t, 3.0) / (l * l)) * Math.sin(k)) * Math.tan(k)) * ((1.0 + Math.pow((k / t), 2.0)) + 1.0));
}
def code(t, l, k): return 2.0 / ((((math.pow(t, 3.0) / (l * l)) * math.sin(k)) * math.tan(k)) * ((1.0 + math.pow((k / t), 2.0)) + 1.0))
function code(t, l, k) return Float64(2.0 / Float64(Float64(Float64(Float64((t ^ 3.0) / Float64(l * l)) * sin(k)) * tan(k)) * Float64(Float64(1.0 + (Float64(k / t) ^ 2.0)) + 1.0))) end
function tmp = code(t, l, k) tmp = 2.0 / (((((t ^ 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + ((k / t) ^ 2.0)) + 1.0)); end
code[t_, l_, k_] := N[(2.0 / N[(N[(N[(N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision] * N[Sin[k], $MachinePrecision]), $MachinePrecision] * N[Tan[k], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\left(\left(\frac{{t}^{3}}{\ell \cdot \ell} \cdot \sin k\right) \cdot \tan k\right) \cdot \left(\left(1 + {\left(\frac{k}{t}\right)}^{2}\right) + 1\right)}
\end{array}
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= k_m 6.6e-87)
(* (/ l (* t (* t k_m))) (/ l (* t k_m)))
(if (<= k_m 7.2e+144)
(/
2.0
(*
(/ t l)
(* (/ (sin k_m) l) (* (tan k_m) (fma k_m k_m (* 2.0 (* t t)))))))
(/
(* (cos k_m) (* 2.0 (* l l)))
(* k_m (* k_m (* t (pow (sin k_m) 2.0))))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 6.6e-87) {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
} else if (k_m <= 7.2e+144) {
tmp = 2.0 / ((t / l) * ((sin(k_m) / l) * (tan(k_m) * fma(k_m, k_m, (2.0 * (t * t))))));
} else {
tmp = (cos(k_m) * (2.0 * (l * l))) / (k_m * (k_m * (t * pow(sin(k_m), 2.0))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 6.6e-87) tmp = Float64(Float64(l / Float64(t * Float64(t * k_m))) * Float64(l / Float64(t * k_m))); elseif (k_m <= 7.2e+144) tmp = Float64(2.0 / Float64(Float64(t / l) * Float64(Float64(sin(k_m) / l) * Float64(tan(k_m) * fma(k_m, k_m, Float64(2.0 * Float64(t * t))))))); else tmp = Float64(Float64(cos(k_m) * Float64(2.0 * Float64(l * l))) / Float64(k_m * Float64(k_m * Float64(t * (sin(k_m) ^ 2.0))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 6.6e-87], N[(N[(l / N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k$95$m, 7.2e+144], N[(2.0 / N[(N[(t / l), $MachinePrecision] * N[(N[(N[Sin[k$95$m], $MachinePrecision] / l), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(k$95$m * k$95$m + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Cos[k$95$m], $MachinePrecision] * N[(2.0 * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k$95$m * N[(k$95$m * N[(t * N[Power[N[Sin[k$95$m], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 6.6 \cdot 10^{-87}:\\
\;\;\;\;\frac{\ell}{t \cdot \left(t \cdot k\_m\right)} \cdot \frac{\ell}{t \cdot k\_m}\\
\mathbf{elif}\;k\_m \leq 7.2 \cdot 10^{+144}:\\
\;\;\;\;\frac{2}{\frac{t}{\ell} \cdot \left(\frac{\sin k\_m}{\ell} \cdot \left(\tan k\_m \cdot \mathsf{fma}\left(k\_m, k\_m, 2 \cdot \left(t \cdot t\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos k\_m \cdot \left(2 \cdot \left(\ell \cdot \ell\right)\right)}{k\_m \cdot \left(k\_m \cdot \left(t \cdot {\sin k\_m}^{2}\right)\right)}\\
\end{array}
\end{array}
if k < 6.6000000000000001e-87Initial program 53.2%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6446.6
Applied rewrites46.6%
Applied rewrites59.0%
Applied rewrites66.1%
Applied rewrites73.4%
if 6.6000000000000001e-87 < k < 7.1999999999999995e144Initial program 52.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites69.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites73.1%
Taylor expanded in k around 0
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6493.1
Applied rewrites93.1%
if 7.1999999999999995e144 < k Initial program 38.2%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6438.4
Applied rewrites38.4%
Applied rewrites43.5%
Taylor expanded in t around 0
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-cos.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-pow.f64N/A
lower-sin.f6467.6
Applied rewrites67.6%
Final simplification76.1%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= t 5.5e-129)
(/ 2.0 (/ (* (* k_m k_m) (* (pow (sin k_m) 2.0) (/ t (* l (cos k_m))))) l))
(/
2.0
(*
(/ (* t (* t (sin k_m))) l)
(* (/ t l) (* (tan k_m) (fma k_m (/ k_m (* t t)) 2.0)))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (t <= 5.5e-129) {
tmp = 2.0 / (((k_m * k_m) * (pow(sin(k_m), 2.0) * (t / (l * cos(k_m))))) / l);
} else {
tmp = 2.0 / (((t * (t * sin(k_m))) / l) * ((t / l) * (tan(k_m) * fma(k_m, (k_m / (t * t)), 2.0))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (t <= 5.5e-129) tmp = Float64(2.0 / Float64(Float64(Float64(k_m * k_m) * Float64((sin(k_m) ^ 2.0) * Float64(t / Float64(l * cos(k_m))))) / l)); else tmp = Float64(2.0 / Float64(Float64(Float64(t * Float64(t * sin(k_m))) / l) * Float64(Float64(t / l) * Float64(tan(k_m) * fma(k_m, Float64(k_m / Float64(t * t)), 2.0))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[t, 5.5e-129], N[(2.0 / N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(N[Power[N[Sin[k$95$m], $MachinePrecision], 2.0], $MachinePrecision] * N[(t / N[(l * N[Cos[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(t * N[(t * N[Sin[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(N[(t / l), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(k$95$m * N[(k$95$m / N[(t * t), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 5.5 \cdot 10^{-129}:\\
\;\;\;\;\frac{2}{\frac{\left(k\_m \cdot k\_m\right) \cdot \left({\sin k\_m}^{2} \cdot \frac{t}{\ell \cdot \cos k\_m}\right)}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{t \cdot \left(t \cdot \sin k\_m\right)}{\ell} \cdot \left(\frac{t}{\ell} \cdot \left(\tan k\_m \cdot \mathsf{fma}\left(k\_m, \frac{k\_m}{t \cdot t}, 2\right)\right)\right)}\\
\end{array}
\end{array}
if t < 5.50000000000000023e-129Initial program 44.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites36.7%
Taylor expanded in k around inf
associate-/l*N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-pow.f64N/A
lower-sin.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-cos.f6471.3
Applied rewrites71.3%
if 5.50000000000000023e-129 < t Initial program 62.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites67.9%
Applied rewrites88.0%
Final simplification77.5%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= t 5.5e-129)
(/ 2.0 (* (/ t l) (* (/ (sin k_m) l) (* (tan k_m) (* k_m k_m)))))
(/
2.0
(*
(/ (* t (* t (sin k_m))) l)
(* (/ t l) (* (tan k_m) (fma k_m (/ k_m (* t t)) 2.0)))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (t <= 5.5e-129) {
tmp = 2.0 / ((t / l) * ((sin(k_m) / l) * (tan(k_m) * (k_m * k_m))));
} else {
tmp = 2.0 / (((t * (t * sin(k_m))) / l) * ((t / l) * (tan(k_m) * fma(k_m, (k_m / (t * t)), 2.0))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (t <= 5.5e-129) tmp = Float64(2.0 / Float64(Float64(t / l) * Float64(Float64(sin(k_m) / l) * Float64(tan(k_m) * Float64(k_m * k_m))))); else tmp = Float64(2.0 / Float64(Float64(Float64(t * Float64(t * sin(k_m))) / l) * Float64(Float64(t / l) * Float64(tan(k_m) * fma(k_m, Float64(k_m / Float64(t * t)), 2.0))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[t, 5.5e-129], N[(2.0 / N[(N[(t / l), $MachinePrecision] * N[(N[(N[Sin[k$95$m], $MachinePrecision] / l), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(t * N[(t * N[Sin[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(N[(t / l), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(k$95$m * N[(k$95$m / N[(t * t), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 5.5 \cdot 10^{-129}:\\
\;\;\;\;\frac{2}{\frac{t}{\ell} \cdot \left(\frac{\sin k\_m}{\ell} \cdot \left(\tan k\_m \cdot \left(k\_m \cdot k\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{t \cdot \left(t \cdot \sin k\_m\right)}{\ell} \cdot \left(\frac{t}{\ell} \cdot \left(\tan k\_m \cdot \mathsf{fma}\left(k\_m, \frac{k\_m}{t \cdot t}, 2\right)\right)\right)}\\
\end{array}
\end{array}
if t < 5.50000000000000023e-129Initial program 44.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites41.3%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites46.8%
Taylor expanded in k around inf
unpow2N/A
lower-*.f6470.1
Applied rewrites70.1%
if 5.50000000000000023e-129 < t Initial program 62.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites67.9%
Applied rewrites88.0%
Final simplification76.7%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= k_m 6.6e-87)
(* (/ l (* t (* t k_m))) (/ l (* t k_m)))
(/
2.0
(*
(/ t l)
(* (/ (sin k_m) l) (* (tan k_m) (fma k_m k_m (* 2.0 (* t t)))))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 6.6e-87) {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
} else {
tmp = 2.0 / ((t / l) * ((sin(k_m) / l) * (tan(k_m) * fma(k_m, k_m, (2.0 * (t * t))))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 6.6e-87) tmp = Float64(Float64(l / Float64(t * Float64(t * k_m))) * Float64(l / Float64(t * k_m))); else tmp = Float64(2.0 / Float64(Float64(t / l) * Float64(Float64(sin(k_m) / l) * Float64(tan(k_m) * fma(k_m, k_m, Float64(2.0 * Float64(t * t))))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 6.6e-87], N[(N[(l / N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(t / l), $MachinePrecision] * N[(N[(N[Sin[k$95$m], $MachinePrecision] / l), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(k$95$m * k$95$m + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 6.6 \cdot 10^{-87}:\\
\;\;\;\;\frac{\ell}{t \cdot \left(t \cdot k\_m\right)} \cdot \frac{\ell}{t \cdot k\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{t}{\ell} \cdot \left(\frac{\sin k\_m}{\ell} \cdot \left(\tan k\_m \cdot \mathsf{fma}\left(k\_m, k\_m, 2 \cdot \left(t \cdot t\right)\right)\right)\right)}\\
\end{array}
\end{array}
if k < 6.6000000000000001e-87Initial program 53.2%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6446.6
Applied rewrites46.6%
Applied rewrites59.0%
Applied rewrites66.1%
Applied rewrites73.4%
if 6.6000000000000001e-87 < k Initial program 46.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites51.1%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites63.8%
Taylor expanded in k around 0
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6480.5
Applied rewrites80.5%
Final simplification75.6%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= t 5.6e+51) (/ 2.0 (* (/ t l) (* (/ (sin k_m) l) (* (tan k_m) (* k_m k_m))))) (* (/ l (* t (* t k_m))) (/ l (* t k_m)))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (t <= 5.6e+51) {
tmp = 2.0 / ((t / l) * ((sin(k_m) / l) * (tan(k_m) * (k_m * k_m))));
} else {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (t <= 5.6d+51) then
tmp = 2.0d0 / ((t / l) * ((sin(k_m) / l) * (tan(k_m) * (k_m * k_m))))
else
tmp = (l / (t * (t * k_m))) * (l / (t * k_m))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (t <= 5.6e+51) {
tmp = 2.0 / ((t / l) * ((Math.sin(k_m) / l) * (Math.tan(k_m) * (k_m * k_m))));
} else {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if t <= 5.6e+51: tmp = 2.0 / ((t / l) * ((math.sin(k_m) / l) * (math.tan(k_m) * (k_m * k_m)))) else: tmp = (l / (t * (t * k_m))) * (l / (t * k_m)) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (t <= 5.6e+51) tmp = Float64(2.0 / Float64(Float64(t / l) * Float64(Float64(sin(k_m) / l) * Float64(tan(k_m) * Float64(k_m * k_m))))); else tmp = Float64(Float64(l / Float64(t * Float64(t * k_m))) * Float64(l / Float64(t * k_m))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (t <= 5.6e+51) tmp = 2.0 / ((t / l) * ((sin(k_m) / l) * (tan(k_m) * (k_m * k_m)))); else tmp = (l / (t * (t * k_m))) * (l / (t * k_m)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[t, 5.6e+51], N[(2.0 / N[(N[(t / l), $MachinePrecision] * N[(N[(N[Sin[k$95$m], $MachinePrecision] / l), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(l / N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 5.6 \cdot 10^{+51}:\\
\;\;\;\;\frac{2}{\frac{t}{\ell} \cdot \left(\frac{\sin k\_m}{\ell} \cdot \left(\tan k\_m \cdot \left(k\_m \cdot k\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell}{t \cdot \left(t \cdot k\_m\right)} \cdot \frac{\ell}{t \cdot k\_m}\\
\end{array}
\end{array}
if t < 5.60000000000000009e51Initial program 48.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites48.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites52.1%
Taylor expanded in k around inf
unpow2N/A
lower-*.f6470.9
Applied rewrites70.9%
if 5.60000000000000009e51 < t Initial program 59.6%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6449.7
Applied rewrites49.7%
Applied rewrites62.4%
Applied rewrites76.8%
Applied rewrites89.0%
Final simplification75.2%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= t 8.6e-13)
(/
2.0
(*
(/ (sin k_m) l)
(*
k_m
(fma
2.0
(/ (* t (* t t)) l)
(* (* t (fma (* t t) 0.6666666666666666 1.0)) (/ (* k_m k_m) l))))))
(* (/ l (* t (* t k_m))) (/ l (* t k_m)))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (t <= 8.6e-13) {
tmp = 2.0 / ((sin(k_m) / l) * (k_m * fma(2.0, ((t * (t * t)) / l), ((t * fma((t * t), 0.6666666666666666, 1.0)) * ((k_m * k_m) / l)))));
} else {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (t <= 8.6e-13) tmp = Float64(2.0 / Float64(Float64(sin(k_m) / l) * Float64(k_m * fma(2.0, Float64(Float64(t * Float64(t * t)) / l), Float64(Float64(t * fma(Float64(t * t), 0.6666666666666666, 1.0)) * Float64(Float64(k_m * k_m) / l)))))); else tmp = Float64(Float64(l / Float64(t * Float64(t * k_m))) * Float64(l / Float64(t * k_m))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[t, 8.6e-13], N[(2.0 / N[(N[(N[Sin[k$95$m], $MachinePrecision] / l), $MachinePrecision] * N[(k$95$m * N[(2.0 * N[(N[(t * N[(t * t), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] + N[(N[(t * N[(N[(t * t), $MachinePrecision] * 0.6666666666666666 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(k$95$m * k$95$m), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(l / N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 8.6 \cdot 10^{-13}:\\
\;\;\;\;\frac{2}{\frac{\sin k\_m}{\ell} \cdot \left(k\_m \cdot \mathsf{fma}\left(2, \frac{t \cdot \left(t \cdot t\right)}{\ell}, \left(t \cdot \mathsf{fma}\left(t \cdot t, 0.6666666666666666, 1\right)\right) \cdot \frac{k\_m \cdot k\_m}{\ell}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell}{t \cdot \left(t \cdot k\_m\right)} \cdot \frac{\ell}{t \cdot k\_m}\\
\end{array}
\end{array}
if t < 8.5999999999999997e-13Initial program 47.7%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites47.3%
Taylor expanded in k around 0
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites66.8%
if 8.5999999999999997e-13 < t Initial program 60.0%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6449.8
Applied rewrites49.8%
Applied rewrites61.1%
Applied rewrites73.8%
Applied rewrites84.7%
Final simplification71.6%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= t 8.4e-48)
(/
2.0
(*
(/ t l)
(*
(* k_m k_m)
(fma
(* k_m k_m)
(/ (fma (* t t) 0.3333333333333333 1.0) l)
(* 2.0 (/ (* t t) l))))))
(* (/ l (* t (* t k_m))) (/ l (* t k_m)))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (t <= 8.4e-48) {
tmp = 2.0 / ((t / l) * ((k_m * k_m) * fma((k_m * k_m), (fma((t * t), 0.3333333333333333, 1.0) / l), (2.0 * ((t * t) / l)))));
} else {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (t <= 8.4e-48) tmp = Float64(2.0 / Float64(Float64(t / l) * Float64(Float64(k_m * k_m) * fma(Float64(k_m * k_m), Float64(fma(Float64(t * t), 0.3333333333333333, 1.0) / l), Float64(2.0 * Float64(Float64(t * t) / l)))))); else tmp = Float64(Float64(l / Float64(t * Float64(t * k_m))) * Float64(l / Float64(t * k_m))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[t, 8.4e-48], N[(2.0 / N[(N[(t / l), $MachinePrecision] * N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(N[(N[(t * t), $MachinePrecision] * 0.3333333333333333 + 1.0), $MachinePrecision] / l), $MachinePrecision] + N[(2.0 * N[(N[(t * t), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(l / N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 8.4 \cdot 10^{-48}:\\
\;\;\;\;\frac{2}{\frac{t}{\ell} \cdot \left(\left(k\_m \cdot k\_m\right) \cdot \mathsf{fma}\left(k\_m \cdot k\_m, \frac{\mathsf{fma}\left(t \cdot t, 0.3333333333333333, 1\right)}{\ell}, 2 \cdot \frac{t \cdot t}{\ell}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell}{t \cdot \left(t \cdot k\_m\right)} \cdot \frac{\ell}{t \cdot k\_m}\\
\end{array}
\end{array}
if t < 8.39999999999999954e-48Initial program 46.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites45.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites50.2%
Taylor expanded in k around 0
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
associate-/l*N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-inN/A
rgt-mult-inverseN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6466.8
Applied rewrites66.8%
if 8.39999999999999954e-48 < t Initial program 62.0%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6448.2
Applied rewrites48.2%
Applied rewrites58.4%
Applied rewrites69.6%
Applied rewrites80.6%
Final simplification71.0%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 2.4e-15) (* (/ l (* t (* t k_m))) (/ l (* t k_m))) (/ 2.0 (* (* k_m k_m) (/ (* t (* k_m k_m)) (* l l))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.4e-15) {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
} else {
tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l)));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 2.4d-15) then
tmp = (l / (t * (t * k_m))) * (l / (t * k_m))
else
tmp = 2.0d0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l)))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.4e-15) {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
} else {
tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l)));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 2.4e-15: tmp = (l / (t * (t * k_m))) * (l / (t * k_m)) else: tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l))) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 2.4e-15) tmp = Float64(Float64(l / Float64(t * Float64(t * k_m))) * Float64(l / Float64(t * k_m))); else tmp = Float64(2.0 / Float64(Float64(k_m * k_m) * Float64(Float64(t * Float64(k_m * k_m)) / Float64(l * l)))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 2.4e-15) tmp = (l / (t * (t * k_m))) * (l / (t * k_m)); else tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 2.4e-15], N[(N[(l / N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 2.4 \cdot 10^{-15}:\\
\;\;\;\;\frac{\ell}{t \cdot \left(t \cdot k\_m\right)} \cdot \frac{\ell}{t \cdot k\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(k\_m \cdot k\_m\right) \cdot \frac{t \cdot \left(k\_m \cdot k\_m\right)}{\ell \cdot \ell}}\\
\end{array}
\end{array}
if k < 2.39999999999999995e-15Initial program 53.3%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6447.2
Applied rewrites47.2%
Applied rewrites59.2%
Applied rewrites65.8%
Applied rewrites73.0%
if 2.39999999999999995e-15 < k Initial program 44.2%
Taylor expanded in k around 0
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites41.7%
Taylor expanded in t around 0
Applied rewrites52.7%
Final simplification67.9%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 2.65e+50) (* (/ l (* t (* t k_m))) (/ l (* t k_m))) (/ (/ (* l l) t) (* t (* t (* k_m k_m))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.65e+50) {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
} else {
tmp = ((l * l) / t) / (t * (t * (k_m * k_m)));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 2.65d+50) then
tmp = (l / (t * (t * k_m))) * (l / (t * k_m))
else
tmp = ((l * l) / t) / (t * (t * (k_m * k_m)))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.65e+50) {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
} else {
tmp = ((l * l) / t) / (t * (t * (k_m * k_m)));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 2.65e+50: tmp = (l / (t * (t * k_m))) * (l / (t * k_m)) else: tmp = ((l * l) / t) / (t * (t * (k_m * k_m))) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 2.65e+50) tmp = Float64(Float64(l / Float64(t * Float64(t * k_m))) * Float64(l / Float64(t * k_m))); else tmp = Float64(Float64(Float64(l * l) / t) / Float64(t * Float64(t * Float64(k_m * k_m)))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 2.65e+50) tmp = (l / (t * (t * k_m))) * (l / (t * k_m)); else tmp = ((l * l) / t) / (t * (t * (k_m * k_m))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 2.65e+50], N[(N[(l / N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(l * l), $MachinePrecision] / t), $MachinePrecision] / N[(t * N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 2.65 \cdot 10^{+50}:\\
\;\;\;\;\frac{\ell}{t \cdot \left(t \cdot k\_m\right)} \cdot \frac{\ell}{t \cdot k\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\ell \cdot \ell}{t}}{t \cdot \left(t \cdot \left(k\_m \cdot k\_m\right)\right)}\\
\end{array}
\end{array}
if k < 2.6500000000000001e50Initial program 54.1%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6446.7
Applied rewrites46.7%
Applied rewrites57.8%
Applied rewrites63.8%
Applied rewrites70.8%
if 2.6500000000000001e50 < k Initial program 37.7%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6436.0
Applied rewrites36.0%
Applied rewrites52.8%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 2.4e-173) (* (/ l (* t (* t k_m))) (/ l (* t k_m))) (* (/ l t) (/ l (* t (* t (* k_m k_m)))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.4e-173) {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
} else {
tmp = (l / t) * (l / (t * (t * (k_m * k_m))));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 2.4d-173) then
tmp = (l / (t * (t * k_m))) * (l / (t * k_m))
else
tmp = (l / t) * (l / (t * (t * (k_m * k_m))))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.4e-173) {
tmp = (l / (t * (t * k_m))) * (l / (t * k_m));
} else {
tmp = (l / t) * (l / (t * (t * (k_m * k_m))));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 2.4e-173: tmp = (l / (t * (t * k_m))) * (l / (t * k_m)) else: tmp = (l / t) * (l / (t * (t * (k_m * k_m)))) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 2.4e-173) tmp = Float64(Float64(l / Float64(t * Float64(t * k_m))) * Float64(l / Float64(t * k_m))); else tmp = Float64(Float64(l / t) * Float64(l / Float64(t * Float64(t * Float64(k_m * k_m))))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 2.4e-173) tmp = (l / (t * (t * k_m))) * (l / (t * k_m)); else tmp = (l / t) * (l / (t * (t * (k_m * k_m)))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 2.4e-173], N[(N[(l / N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(l / t), $MachinePrecision] * N[(l / N[(t * N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 2.4 \cdot 10^{-173}:\\
\;\;\;\;\frac{\ell}{t \cdot \left(t \cdot k\_m\right)} \cdot \frac{\ell}{t \cdot k\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell}{t} \cdot \frac{\ell}{t \cdot \left(t \cdot \left(k\_m \cdot k\_m\right)\right)}\\
\end{array}
\end{array}
if k < 2.40000000000000017e-173Initial program 50.7%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6443.6
Applied rewrites43.6%
Applied rewrites56.3%
Applied rewrites63.9%
Applied rewrites71.6%
if 2.40000000000000017e-173 < k Initial program 51.7%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6446.7
Applied rewrites46.7%
Applied rewrites59.6%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 2.4e-173) (* l (/ l (* (* t k_m) (* t (* t k_m))))) (* (/ l t) (/ l (* t (* t (* k_m k_m)))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.4e-173) {
tmp = l * (l / ((t * k_m) * (t * (t * k_m))));
} else {
tmp = (l / t) * (l / (t * (t * (k_m * k_m))));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 2.4d-173) then
tmp = l * (l / ((t * k_m) * (t * (t * k_m))))
else
tmp = (l / t) * (l / (t * (t * (k_m * k_m))))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.4e-173) {
tmp = l * (l / ((t * k_m) * (t * (t * k_m))));
} else {
tmp = (l / t) * (l / (t * (t * (k_m * k_m))));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 2.4e-173: tmp = l * (l / ((t * k_m) * (t * (t * k_m)))) else: tmp = (l / t) * (l / (t * (t * (k_m * k_m)))) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 2.4e-173) tmp = Float64(l * Float64(l / Float64(Float64(t * k_m) * Float64(t * Float64(t * k_m))))); else tmp = Float64(Float64(l / t) * Float64(l / Float64(t * Float64(t * Float64(k_m * k_m))))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 2.4e-173) tmp = l * (l / ((t * k_m) * (t * (t * k_m)))); else tmp = (l / t) * (l / (t * (t * (k_m * k_m)))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 2.4e-173], N[(l * N[(l / N[(N[(t * k$95$m), $MachinePrecision] * N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(l / t), $MachinePrecision] * N[(l / N[(t * N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 2.4 \cdot 10^{-173}:\\
\;\;\;\;\ell \cdot \frac{\ell}{\left(t \cdot k\_m\right) \cdot \left(t \cdot \left(t \cdot k\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell}{t} \cdot \frac{\ell}{t \cdot \left(t \cdot \left(k\_m \cdot k\_m\right)\right)}\\
\end{array}
\end{array}
if k < 2.40000000000000017e-173Initial program 50.7%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6443.6
Applied rewrites43.6%
Applied rewrites56.3%
Applied rewrites63.9%
Applied rewrites70.3%
if 2.40000000000000017e-173 < k Initial program 51.7%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6446.7
Applied rewrites46.7%
Applied rewrites59.6%
Final simplification66.5%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 2.65e+50) (* l (/ l (* (* t k_m) (* t (* t k_m))))) (/ (* l l) (* t (* t (* t (* k_m k_m)))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.65e+50) {
tmp = l * (l / ((t * k_m) * (t * (t * k_m))));
} else {
tmp = (l * l) / (t * (t * (t * (k_m * k_m))));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 2.65d+50) then
tmp = l * (l / ((t * k_m) * (t * (t * k_m))))
else
tmp = (l * l) / (t * (t * (t * (k_m * k_m))))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.65e+50) {
tmp = l * (l / ((t * k_m) * (t * (t * k_m))));
} else {
tmp = (l * l) / (t * (t * (t * (k_m * k_m))));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 2.65e+50: tmp = l * (l / ((t * k_m) * (t * (t * k_m)))) else: tmp = (l * l) / (t * (t * (t * (k_m * k_m)))) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 2.65e+50) tmp = Float64(l * Float64(l / Float64(Float64(t * k_m) * Float64(t * Float64(t * k_m))))); else tmp = Float64(Float64(l * l) / Float64(t * Float64(t * Float64(t * Float64(k_m * k_m))))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 2.65e+50) tmp = l * (l / ((t * k_m) * (t * (t * k_m)))); else tmp = (l * l) / (t * (t * (t * (k_m * k_m)))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 2.65e+50], N[(l * N[(l / N[(N[(t * k$95$m), $MachinePrecision] * N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(l * l), $MachinePrecision] / N[(t * N[(t * N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 2.65 \cdot 10^{+50}:\\
\;\;\;\;\ell \cdot \frac{\ell}{\left(t \cdot k\_m\right) \cdot \left(t \cdot \left(t \cdot k\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell \cdot \ell}{t \cdot \left(t \cdot \left(t \cdot \left(k\_m \cdot k\_m\right)\right)\right)}\\
\end{array}
\end{array}
if k < 2.6500000000000001e50Initial program 54.1%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6446.7
Applied rewrites46.7%
Applied rewrites57.8%
Applied rewrites63.8%
Applied rewrites69.4%
if 2.6500000000000001e50 < k Initial program 37.7%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6436.0
Applied rewrites36.0%
Applied rewrites50.8%
Final simplification65.9%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* l (/ l (* (* t k_m) (* t (* t k_m))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return l * (l / ((t * k_m) * (t * (t * k_m))));
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = l * (l / ((t * k_m) * (t * (t * k_m))))
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return l * (l / ((t * k_m) * (t * (t * k_m))));
}
k_m = math.fabs(k) def code(t, l, k_m): return l * (l / ((t * k_m) * (t * (t * k_m))))
k_m = abs(k) function code(t, l, k_m) return Float64(l * Float64(l / Float64(Float64(t * k_m) * Float64(t * Float64(t * k_m))))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = l * (l / ((t * k_m) * (t * (t * k_m)))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(l * N[(l / N[(N[(t * k$95$m), $MachinePrecision] * N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\ell \cdot \frac{\ell}{\left(t \cdot k\_m\right) \cdot \left(t \cdot \left(t \cdot k\_m\right)\right)}
\end{array}
Initial program 51.0%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6444.7
Applied rewrites44.7%
Applied rewrites54.4%
Applied rewrites59.8%
Applied rewrites64.7%
Final simplification64.7%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* l (/ l (* k_m (* t (* t (* t k_m)))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return l * (l / (k_m * (t * (t * (t * k_m)))));
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = l * (l / (k_m * (t * (t * (t * k_m)))))
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return l * (l / (k_m * (t * (t * (t * k_m)))));
}
k_m = math.fabs(k) def code(t, l, k_m): return l * (l / (k_m * (t * (t * (t * k_m)))))
k_m = abs(k) function code(t, l, k_m) return Float64(l * Float64(l / Float64(k_m * Float64(t * Float64(t * Float64(t * k_m)))))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = l * (l / (k_m * (t * (t * (t * k_m))))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(l * N[(l / N[(k$95$m * N[(t * N[(t * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\ell \cdot \frac{\ell}{k\_m \cdot \left(t \cdot \left(t \cdot \left(t \cdot k\_m\right)\right)\right)}
\end{array}
Initial program 51.0%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6444.7
Applied rewrites44.7%
Applied rewrites54.4%
Applied rewrites60.9%
Final simplification60.9%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* l (/ l (* k_m (* (* t t) (* t k_m))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return l * (l / (k_m * ((t * t) * (t * k_m))));
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = l * (l / (k_m * ((t * t) * (t * k_m))))
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return l * (l / (k_m * ((t * t) * (t * k_m))));
}
k_m = math.fabs(k) def code(t, l, k_m): return l * (l / (k_m * ((t * t) * (t * k_m))))
k_m = abs(k) function code(t, l, k_m) return Float64(l * Float64(l / Float64(k_m * Float64(Float64(t * t) * Float64(t * k_m))))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = l * (l / (k_m * ((t * t) * (t * k_m)))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(l * N[(l / N[(k$95$m * N[(N[(t * t), $MachinePrecision] * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\ell \cdot \frac{\ell}{k\_m \cdot \left(\left(t \cdot t\right) \cdot \left(t \cdot k\_m\right)\right)}
\end{array}
Initial program 51.0%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6444.7
Applied rewrites44.7%
Applied rewrites54.4%
Applied rewrites59.8%
Final simplification59.8%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* l (/ l (* k_m (* k_m (* t (* t t)))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return l * (l / (k_m * (k_m * (t * (t * t)))));
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = l * (l / (k_m * (k_m * (t * (t * t)))))
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return l * (l / (k_m * (k_m * (t * (t * t)))));
}
k_m = math.fabs(k) def code(t, l, k_m): return l * (l / (k_m * (k_m * (t * (t * t)))))
k_m = abs(k) function code(t, l, k_m) return Float64(l * Float64(l / Float64(k_m * Float64(k_m * Float64(t * Float64(t * t)))))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = l * (l / (k_m * (k_m * (t * (t * t))))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(l * N[(l / N[(k$95$m * N[(k$95$m * N[(t * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\ell \cdot \frac{\ell}{k\_m \cdot \left(k\_m \cdot \left(t \cdot \left(t \cdot t\right)\right)\right)}
\end{array}
Initial program 51.0%
Taylor expanded in k around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6444.7
Applied rewrites44.7%
Applied rewrites54.4%
Final simplification54.4%
herbie shell --seed 2024221
(FPCore (t l k)
:name "Toniolo and Linder, Equation (10+)"
:precision binary64
(/ 2.0 (* (* (* (/ (pow t 3.0) (* l l)) (sin k)) (tan k)) (+ (+ 1.0 (pow (/ k t) 2.0)) 1.0))))