
(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 18 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
(let* ((t_1 (/ (tan k_m) l)) (t_2 (* 2.0 (* t t))))
(if (<= k_m 5e-74)
(* l (/ (/ l (* k_m t)) (* t (* k_m t))))
(if (<= k_m 1.66e+137)
(* (/ 2.0 (* (* (sin k_m) t_1) (fma k_m k_m t_2))) (/ l t))
(/
2.0
(/
(fma
(/ (* t_2 (* (sin k_m) (tan k_m))) l)
t
(* (* k_m t) (* t_1 (* k_m (sin k_m)))))
l))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = tan(k_m) / l;
double t_2 = 2.0 * (t * t);
double tmp;
if (k_m <= 5e-74) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} else if (k_m <= 1.66e+137) {
tmp = (2.0 / ((sin(k_m) * t_1) * fma(k_m, k_m, t_2))) * (l / t);
} else {
tmp = 2.0 / (fma(((t_2 * (sin(k_m) * tan(k_m))) / l), t, ((k_m * t) * (t_1 * (k_m * sin(k_m))))) / l);
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(tan(k_m) / l) t_2 = Float64(2.0 * Float64(t * t)) tmp = 0.0 if (k_m <= 5e-74) tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); elseif (k_m <= 1.66e+137) tmp = Float64(Float64(2.0 / Float64(Float64(sin(k_m) * t_1) * fma(k_m, k_m, t_2))) * Float64(l / t)); else tmp = Float64(2.0 / Float64(fma(Float64(Float64(t_2 * Float64(sin(k_m) * tan(k_m))) / l), t, Float64(Float64(k_m * t) * Float64(t_1 * Float64(k_m * sin(k_m))))) / l)); end return tmp end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[Tan[k$95$m], $MachinePrecision] / l), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k$95$m, 5e-74], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k$95$m, 1.66e+137], N[(N[(2.0 / N[(N[(N[Sin[k$95$m], $MachinePrecision] * t$95$1), $MachinePrecision] * N[(k$95$m * k$95$m + t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / t), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(t$95$2 * N[(N[Sin[k$95$m], $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * t + N[(N[(k$95$m * t), $MachinePrecision] * N[(t$95$1 * N[(k$95$m * N[Sin[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{\tan k\_m}{\ell}\\
t_2 := 2 \cdot \left(t \cdot t\right)\\
\mathbf{if}\;k\_m \leq 5 \cdot 10^{-74}:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\right)}\\
\mathbf{elif}\;k\_m \leq 1.66 \cdot 10^{+137}:\\
\;\;\;\;\frac{2}{\left(\sin k\_m \cdot t\_1\right) \cdot \mathsf{fma}\left(k\_m, k\_m, t\_2\right)} \cdot \frac{\ell}{t}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{\mathsf{fma}\left(\frac{t\_2 \cdot \left(\sin k\_m \cdot \tan k\_m\right)}{\ell}, t, \left(k\_m \cdot t\right) \cdot \left(t\_1 \cdot \left(k\_m \cdot \sin k\_m\right)\right)\right)}{\ell}}\\
\end{array}
\end{array}
if k < 4.99999999999999998e-74Initial program 57.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.0
Simplified57.0%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.1
Applied egg-rr63.1%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.2
Applied egg-rr73.2%
if 4.99999999999999998e-74 < k < 1.65999999999999991e137Initial program 52.8%
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr64.4%
Taylor expanded in t around 0
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
/-lowering-/.f64N/A
Simplified91.8%
+-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr91.7%
associate-/r/N/A
associate-*l/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr95.9%
if 1.65999999999999991e137 < k Initial program 45.3%
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr20.8%
Taylor expanded in t around 0
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
/-lowering-/.f64N/A
Simplified65.7%
+-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr76.4%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr84.5%
Final simplification79.2%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (sin k_m) (/ (tan k_m) l))))
(if (<= k_m 4.6e-74)
(* l (/ (/ l (* k_m t)) (* t (* k_m t))))
(if (<= k_m 5.4e+215)
(/ 2.0 (/ (* t (fma k_m (* k_m t_1) (* 2.0 (* t_1 (* t t))))) l))
(/ 2.0 (* k_m (* (* k_m t) (* (tan k_m) (/ (sin k_m) (* l l))))))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = sin(k_m) * (tan(k_m) / l);
double tmp;
if (k_m <= 4.6e-74) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} else if (k_m <= 5.4e+215) {
tmp = 2.0 / ((t * fma(k_m, (k_m * t_1), (2.0 * (t_1 * (t * t))))) / l);
} else {
tmp = 2.0 / (k_m * ((k_m * t) * (tan(k_m) * (sin(k_m) / (l * l)))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(sin(k_m) * Float64(tan(k_m) / l)) tmp = 0.0 if (k_m <= 4.6e-74) tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); elseif (k_m <= 5.4e+215) tmp = Float64(2.0 / Float64(Float64(t * fma(k_m, Float64(k_m * t_1), Float64(2.0 * Float64(t_1 * Float64(t * t))))) / l)); else tmp = Float64(2.0 / Float64(k_m * Float64(Float64(k_m * t) * Float64(tan(k_m) * Float64(sin(k_m) / Float64(l * l)))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k$95$m, 4.6e-74], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k$95$m, 5.4e+215], N[(2.0 / N[(N[(t * N[(k$95$m * N[(k$95$m * t$95$1), $MachinePrecision] + N[(2.0 * N[(t$95$1 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(k$95$m * N[(N[(k$95$m * t), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \sin k\_m \cdot \frac{\tan k\_m}{\ell}\\
\mathbf{if}\;k\_m \leq 4.6 \cdot 10^{-74}:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\right)}\\
\mathbf{elif}\;k\_m \leq 5.4 \cdot 10^{+215}:\\
\;\;\;\;\frac{2}{\frac{t \cdot \mathsf{fma}\left(k\_m, k\_m \cdot t\_1, 2 \cdot \left(t\_1 \cdot \left(t \cdot t\right)\right)\right)}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{k\_m \cdot \left(\left(k\_m \cdot t\right) \cdot \left(\tan k\_m \cdot \frac{\sin k\_m}{\ell \cdot \ell}\right)\right)}\\
\end{array}
\end{array}
if k < 4.59999999999999961e-74Initial program 57.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.0
Simplified57.0%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.1
Applied egg-rr63.1%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.2
Applied egg-rr73.2%
if 4.59999999999999961e-74 < k < 5.4e215Initial program 51.5%
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr54.3%
Taylor expanded in t around 0
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
/-lowering-/.f64N/A
Simplified89.1%
+-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr93.5%
if 5.4e215 < k Initial program 43.8%
Taylor expanded in k around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
times-fracN/A
associate-*r*N/A
associate-/l*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
Simplified19.8%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr43.0%
Taylor expanded in k around inf
*-lowering-*.f6477.2
Simplified77.2%
Final simplification78.7%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= k_m 3.2e-74)
(* l (/ (/ l (* k_m t)) (* t (* k_m t))))
(if (<= k_m 1.05e+139)
(*
(/ 2.0 (* (* (sin k_m) (/ (tan k_m) l)) (fma k_m k_m (* 2.0 (* t t)))))
(/ l t))
(/ 2.0 (* k_m (* (* k_m t) (* (tan k_m) (/ (sin k_m) (* l l)))))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 3.2e-74) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} else if (k_m <= 1.05e+139) {
tmp = (2.0 / ((sin(k_m) * (tan(k_m) / l)) * fma(k_m, k_m, (2.0 * (t * t))))) * (l / t);
} else {
tmp = 2.0 / (k_m * ((k_m * t) * (tan(k_m) * (sin(k_m) / (l * l)))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 3.2e-74) tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); elseif (k_m <= 1.05e+139) tmp = Float64(Float64(2.0 / Float64(Float64(sin(k_m) * Float64(tan(k_m) / l)) * fma(k_m, k_m, Float64(2.0 * Float64(t * t))))) * Float64(l / t)); else tmp = Float64(2.0 / Float64(k_m * Float64(Float64(k_m * t) * Float64(tan(k_m) * Float64(sin(k_m) / Float64(l * l)))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 3.2e-74], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k$95$m, 1.05e+139], N[(N[(2.0 / N[(N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(k$95$m * k$95$m + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / t), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(k$95$m * N[(N[(k$95$m * t), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 3.2 \cdot 10^{-74}:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\right)}\\
\mathbf{elif}\;k\_m \leq 1.05 \cdot 10^{+139}:\\
\;\;\;\;\frac{2}{\left(\sin k\_m \cdot \frac{\tan k\_m}{\ell}\right) \cdot \mathsf{fma}\left(k\_m, k\_m, 2 \cdot \left(t \cdot t\right)\right)} \cdot \frac{\ell}{t}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{k\_m \cdot \left(\left(k\_m \cdot t\right) \cdot \left(\tan k\_m \cdot \frac{\sin k\_m}{\ell \cdot \ell}\right)\right)}\\
\end{array}
\end{array}
if k < 3.1999999999999999e-74Initial program 57.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.0
Simplified57.0%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.1
Applied egg-rr63.1%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.2
Applied egg-rr73.2%
if 3.1999999999999999e-74 < k < 1.0499999999999999e139Initial program 52.8%
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr64.4%
Taylor expanded in t around 0
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
/-lowering-/.f64N/A
Simplified91.8%
+-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr91.7%
associate-/r/N/A
associate-*l/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr95.9%
if 1.0499999999999999e139 < k Initial program 45.3%
Taylor expanded in k around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
times-fracN/A
associate-*r*N/A
associate-/l*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
Simplified28.4%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr45.2%
Taylor expanded in k around inf
*-lowering-*.f6478.9
Simplified78.9%
Final simplification78.4%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (/ (* t t) l)))
(if (<= k_m 3.1e-74)
(* l (/ (/ l (* k_m t)) (* t (* k_m t))))
(if (<= k_m 13500000.0)
(/
2.0
(/
(*
t
(*
(* k_m k_m)
(fma
2.0
t_1
(* (* k_m k_m) (fma t_1 0.3333333333333333 (/ 1.0 l))))))
l))
(if (<= k_m 4e+127)
(/ 2.0 (/ (* (* (sin k_m) (tan k_m)) (/ (* t (* k_m k_m)) l)) l))
(/ 2.0 (* k_m (* (* k_m t) (* (tan k_m) (/ (sin k_m) (* l l)))))))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (t * t) / l;
double tmp;
if (k_m <= 3.1e-74) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} else if (k_m <= 13500000.0) {
tmp = 2.0 / ((t * ((k_m * k_m) * fma(2.0, t_1, ((k_m * k_m) * fma(t_1, 0.3333333333333333, (1.0 / l)))))) / l);
} else if (k_m <= 4e+127) {
tmp = 2.0 / (((sin(k_m) * tan(k_m)) * ((t * (k_m * k_m)) / l)) / l);
} else {
tmp = 2.0 / (k_m * ((k_m * t) * (tan(k_m) * (sin(k_m) / (l * l)))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(t * t) / l) tmp = 0.0 if (k_m <= 3.1e-74) tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); elseif (k_m <= 13500000.0) tmp = Float64(2.0 / Float64(Float64(t * Float64(Float64(k_m * k_m) * fma(2.0, t_1, Float64(Float64(k_m * k_m) * fma(t_1, 0.3333333333333333, Float64(1.0 / l)))))) / l)); elseif (k_m <= 4e+127) tmp = Float64(2.0 / Float64(Float64(Float64(sin(k_m) * tan(k_m)) * Float64(Float64(t * Float64(k_m * k_m)) / l)) / l)); else tmp = Float64(2.0 / Float64(k_m * Float64(Float64(k_m * t) * Float64(tan(k_m) * Float64(sin(k_m) / Float64(l * l)))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(t * t), $MachinePrecision] / l), $MachinePrecision]}, If[LessEqual[k$95$m, 3.1e-74], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k$95$m, 13500000.0], N[(2.0 / N[(N[(t * N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(2.0 * t$95$1 + N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(t$95$1 * 0.3333333333333333 + N[(1.0 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision], If[LessEqual[k$95$m, 4e+127], N[(2.0 / N[(N[(N[(N[Sin[k$95$m], $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision] * N[(N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(k$95$m * N[(N[(k$95$m * t), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{t \cdot t}{\ell}\\
\mathbf{if}\;k\_m \leq 3.1 \cdot 10^{-74}:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\right)}\\
\mathbf{elif}\;k\_m \leq 13500000:\\
\;\;\;\;\frac{2}{\frac{t \cdot \left(\left(k\_m \cdot k\_m\right) \cdot \mathsf{fma}\left(2, t\_1, \left(k\_m \cdot k\_m\right) \cdot \mathsf{fma}\left(t\_1, 0.3333333333333333, \frac{1}{\ell}\right)\right)\right)}{\ell}}\\
\mathbf{elif}\;k\_m \leq 4 \cdot 10^{+127}:\\
\;\;\;\;\frac{2}{\frac{\left(\sin k\_m \cdot \tan k\_m\right) \cdot \frac{t \cdot \left(k\_m \cdot k\_m\right)}{\ell}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{k\_m \cdot \left(\left(k\_m \cdot t\right) \cdot \left(\tan k\_m \cdot \frac{\sin k\_m}{\ell \cdot \ell}\right)\right)}\\
\end{array}
\end{array}
if k < 3.1000000000000002e-74Initial program 57.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.0
Simplified57.0%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.1
Applied egg-rr63.1%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.2
Applied egg-rr73.2%
if 3.1000000000000002e-74 < k < 1.35e7Initial program 52.5%
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr65.8%
Taylor expanded in t around 0
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
/-lowering-/.f64N/A
Simplified92.6%
+-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr92.6%
Taylor expanded in k around 0
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.4
Simplified89.4%
if 1.35e7 < k < 3.99999999999999982e127Initial program 55.9%
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr65.6%
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr66.0%
Taylor expanded in k around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6490.4
Simplified90.4%
if 3.99999999999999982e127 < k Initial program 44.0%
Taylor expanded in k around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
times-fracN/A
associate-*r*N/A
associate-/l*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
Simplified30.3%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr46.6%
Taylor expanded in k around inf
*-lowering-*.f6479.4
Simplified79.4%
Final simplification77.3%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= k_m 2.9e-74)
(* l (/ (/ l (* k_m t)) (* t (* k_m t))))
(if (<= k_m 3.8e+127)
(*
l
(/
2.0
(* t (* (* (sin k_m) (/ (tan k_m) l)) (fma k_m k_m (* 2.0 (* t t)))))))
(/ 2.0 (* k_m (* (* k_m t) (* (tan k_m) (/ (sin k_m) (* l l)))))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 2.9e-74) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} else if (k_m <= 3.8e+127) {
tmp = l * (2.0 / (t * ((sin(k_m) * (tan(k_m) / l)) * fma(k_m, k_m, (2.0 * (t * t))))));
} else {
tmp = 2.0 / (k_m * ((k_m * t) * (tan(k_m) * (sin(k_m) / (l * l)))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 2.9e-74) tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); elseif (k_m <= 3.8e+127) tmp = Float64(l * Float64(2.0 / Float64(t * Float64(Float64(sin(k_m) * Float64(tan(k_m) / l)) * fma(k_m, k_m, Float64(2.0 * Float64(t * t))))))); else tmp = Float64(2.0 / Float64(k_m * Float64(Float64(k_m * t) * Float64(tan(k_m) * Float64(sin(k_m) / Float64(l * l)))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 2.9e-74], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k$95$m, 3.8e+127], N[(l * N[(2.0 / N[(t * N[(N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(k$95$m * k$95$m + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(k$95$m * N[(N[(k$95$m * t), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 2.9 \cdot 10^{-74}:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\right)}\\
\mathbf{elif}\;k\_m \leq 3.8 \cdot 10^{+127}:\\
\;\;\;\;\ell \cdot \frac{2}{t \cdot \left(\left(\sin k\_m \cdot \frac{\tan k\_m}{\ell}\right) \cdot \mathsf{fma}\left(k\_m, k\_m, 2 \cdot \left(t \cdot t\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{k\_m \cdot \left(\left(k\_m \cdot t\right) \cdot \left(\tan k\_m \cdot \frac{\sin k\_m}{\ell \cdot \ell}\right)\right)}\\
\end{array}
\end{array}
if k < 2.9e-74Initial program 57.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.0
Simplified57.0%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.1
Applied egg-rr63.1%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.2
Applied egg-rr73.2%
if 2.9e-74 < k < 3.7999999999999998e127Initial program 53.9%
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr65.7%
Taylor expanded in t around 0
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
/-lowering-/.f64N/A
Simplified91.6%
+-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr91.6%
associate-/r/N/A
*-lowering-*.f64N/A
Applied egg-rr92.0%
if 3.7999999999999998e127 < k Initial program 44.0%
Taylor expanded in k around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
times-fracN/A
associate-*r*N/A
associate-/l*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
Simplified30.3%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr46.6%
Taylor expanded in k around inf
*-lowering-*.f6479.4
Simplified79.4%
Final simplification77.7%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (/ (* t t) l)))
(if (<= k_m 2.8e-74)
(* l (/ (/ l (* k_m t)) (* t (* k_m t))))
(if (<= k_m 13500000.0)
(/
2.0
(/
(*
t
(*
(* k_m k_m)
(fma
2.0
t_1
(* (* k_m k_m) (fma t_1 0.3333333333333333 (/ 1.0 l))))))
l))
(/ 2.0 (* k_m (* (* k_m t) (* (tan k_m) (/ (sin k_m) (* l l))))))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (t * t) / l;
double tmp;
if (k_m <= 2.8e-74) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} else if (k_m <= 13500000.0) {
tmp = 2.0 / ((t * ((k_m * k_m) * fma(2.0, t_1, ((k_m * k_m) * fma(t_1, 0.3333333333333333, (1.0 / l)))))) / l);
} else {
tmp = 2.0 / (k_m * ((k_m * t) * (tan(k_m) * (sin(k_m) / (l * l)))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(t * t) / l) tmp = 0.0 if (k_m <= 2.8e-74) tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); elseif (k_m <= 13500000.0) tmp = Float64(2.0 / Float64(Float64(t * Float64(Float64(k_m * k_m) * fma(2.0, t_1, Float64(Float64(k_m * k_m) * fma(t_1, 0.3333333333333333, Float64(1.0 / l)))))) / l)); else tmp = Float64(2.0 / Float64(k_m * Float64(Float64(k_m * t) * Float64(tan(k_m) * Float64(sin(k_m) / Float64(l * l)))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(t * t), $MachinePrecision] / l), $MachinePrecision]}, If[LessEqual[k$95$m, 2.8e-74], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k$95$m, 13500000.0], N[(2.0 / N[(N[(t * N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(2.0 * t$95$1 + N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(t$95$1 * 0.3333333333333333 + N[(1.0 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(k$95$m * N[(N[(k$95$m * t), $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{t \cdot t}{\ell}\\
\mathbf{if}\;k\_m \leq 2.8 \cdot 10^{-74}:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\right)}\\
\mathbf{elif}\;k\_m \leq 13500000:\\
\;\;\;\;\frac{2}{\frac{t \cdot \left(\left(k\_m \cdot k\_m\right) \cdot \mathsf{fma}\left(2, t\_1, \left(k\_m \cdot k\_m\right) \cdot \mathsf{fma}\left(t\_1, 0.3333333333333333, \frac{1}{\ell}\right)\right)\right)}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{k\_m \cdot \left(\left(k\_m \cdot t\right) \cdot \left(\tan k\_m \cdot \frac{\sin k\_m}{\ell \cdot \ell}\right)\right)}\\
\end{array}
\end{array}
if k < 2.79999999999999988e-74Initial program 57.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.0
Simplified57.0%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.1
Applied egg-rr63.1%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.2
Applied egg-rr73.2%
if 2.79999999999999988e-74 < k < 1.35e7Initial program 52.5%
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr65.8%
Taylor expanded in t around 0
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
/-lowering-/.f64N/A
Simplified92.6%
+-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr92.6%
Taylor expanded in k around 0
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.4
Simplified89.4%
if 1.35e7 < k Initial program 48.2%
Taylor expanded in k around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
times-fracN/A
associate-*r*N/A
associate-/l*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
Simplified49.6%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr60.2%
Taylor expanded in k around inf
*-lowering-*.f6481.5
Simplified81.5%
Final simplification76.9%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (/ (* t t) l)))
(if (<= t 1.6e-33)
(/
2.0
(/
(*
t
(*
(* k_m k_m)
(fma 2.0 t_1 (* (* k_m k_m) (fma t_1 0.3333333333333333 (/ 1.0 l))))))
l))
(* (/ l (* k_m t)) (/ (* l (/ 1.0 t)) (* k_m t))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (t * t) / l;
double tmp;
if (t <= 1.6e-33) {
tmp = 2.0 / ((t * ((k_m * k_m) * fma(2.0, t_1, ((k_m * k_m) * fma(t_1, 0.3333333333333333, (1.0 / l)))))) / l);
} else {
tmp = (l / (k_m * t)) * ((l * (1.0 / t)) / (k_m * t));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(t * t) / l) tmp = 0.0 if (t <= 1.6e-33) tmp = Float64(2.0 / Float64(Float64(t * Float64(Float64(k_m * k_m) * fma(2.0, t_1, Float64(Float64(k_m * k_m) * fma(t_1, 0.3333333333333333, Float64(1.0 / l)))))) / l)); else tmp = Float64(Float64(l / Float64(k_m * t)) * Float64(Float64(l * Float64(1.0 / t)) / Float64(k_m * t))); end return tmp end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(t * t), $MachinePrecision] / l), $MachinePrecision]}, If[LessEqual[t, 1.6e-33], N[(2.0 / N[(N[(t * N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(2.0 * t$95$1 + N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(t$95$1 * 0.3333333333333333 + N[(1.0 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision], N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] * N[(N[(l * N[(1.0 / t), $MachinePrecision]), $MachinePrecision] / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{t \cdot t}{\ell}\\
\mathbf{if}\;t \leq 1.6 \cdot 10^{-33}:\\
\;\;\;\;\frac{2}{\frac{t \cdot \left(\left(k\_m \cdot k\_m\right) \cdot \mathsf{fma}\left(2, t\_1, \left(k\_m \cdot k\_m\right) \cdot \mathsf{fma}\left(t\_1, 0.3333333333333333, \frac{1}{\ell}\right)\right)\right)}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell}{k\_m \cdot t} \cdot \frac{\ell \cdot \frac{1}{t}}{k\_m \cdot t}\\
\end{array}
\end{array}
if t < 1.59999999999999988e-33Initial program 45.1%
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr39.0%
Taylor expanded in t around 0
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
/-lowering-/.f64N/A
Simplified74.0%
+-commutativeN/A
associate-/l*N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr79.3%
Taylor expanded in k around 0
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6460.7
Simplified60.7%
if 1.59999999999999988e-33 < t Initial program 78.8%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6475.2
Simplified75.2%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6479.7
Applied egg-rr79.7%
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6478.4
Applied egg-rr78.4%
associate-/r*N/A
associate-*l/N/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
associate-/l/N/A
times-fracN/A
div-invN/A
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6488.8
Applied egg-rr88.8%
Final simplification68.7%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= k_m 2.5e-61)
(* l (/ (/ l (* k_m t)) (* t (* k_m t))))
(/
2.0
(*
t
(*
(*
(* k_m k_m)
(fma (/ (* k_m k_m) (* l l)) 0.16666666666666666 (/ 1.0 (* l l))))
(fma 2.0 (* 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.5e-61) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} else {
tmp = 2.0 / (t * (((k_m * k_m) * fma(((k_m * k_m) / (l * l)), 0.16666666666666666, (1.0 / (l * l)))) * fma(2.0, (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.5e-61) tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); else tmp = Float64(2.0 / Float64(t * Float64(Float64(Float64(k_m * k_m) * fma(Float64(Float64(k_m * k_m) / Float64(l * l)), 0.16666666666666666, Float64(1.0 / Float64(l * l)))) * fma(2.0, Float64(t * t), Float64(k_m * k_m))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 2.5e-61], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(t * N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision] * 0.16666666666666666 + N[(1.0 / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(t * t), $MachinePrecision] + 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.5 \cdot 10^{-61}:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{t \cdot \left(\left(\left(k\_m \cdot k\_m\right) \cdot \mathsf{fma}\left(\frac{k\_m \cdot k\_m}{\ell \cdot \ell}, 0.16666666666666666, \frac{1}{\ell \cdot \ell}\right)\right) \cdot \mathsf{fma}\left(2, t \cdot t, k\_m \cdot k\_m\right)\right)}\\
\end{array}
\end{array}
if k < 2.4999999999999999e-61Initial program 56.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.1
Simplified57.1%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.2
Applied egg-rr63.2%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.1
Applied egg-rr73.1%
if 2.4999999999999999e-61 < k Initial program 51.4%
Taylor expanded in t around 0
*-lowering-*.f64N/A
associate-/l*N/A
associate-*r*N/A
associate-/l*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
Simplified77.3%
Taylor expanded in k around 0
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6465.9
Simplified65.9%
Final simplification70.8%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 5.2e-74) (* l (/ (/ l (* k_m t)) (* t (* k_m t)))) (/ 2.0 (* t (* (/ (* k_m k_m) (* l l)) (fma 2.0 (* t t) (* k_m k_m)))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 5.2e-74) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} else {
tmp = 2.0 / (t * (((k_m * k_m) / (l * l)) * fma(2.0, (t * t), (k_m * k_m))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 5.2e-74) tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); else tmp = Float64(2.0 / Float64(t * Float64(Float64(Float64(k_m * k_m) / Float64(l * l)) * fma(2.0, Float64(t * t), Float64(k_m * k_m))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 5.2e-74], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(t * N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(t * t), $MachinePrecision] + 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 5.2 \cdot 10^{-74}:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{t \cdot \left(\frac{k\_m \cdot k\_m}{\ell \cdot \ell} \cdot \mathsf{fma}\left(2, t \cdot t, k\_m \cdot k\_m\right)\right)}\\
\end{array}
\end{array}
if k < 5.2000000000000002e-74Initial program 57.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.0
Simplified57.0%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.1
Applied egg-rr63.1%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.2
Applied egg-rr73.2%
if 5.2000000000000002e-74 < k Initial program 49.6%
Taylor expanded in t around 0
*-lowering-*.f64N/A
associate-/l*N/A
associate-*r*N/A
associate-/l*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
Simplified77.0%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6465.9
Simplified65.9%
Final simplification70.8%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= t 2.75e-39) (/ 2.0 (* (* k_m k_m) (/ (* t (* k_m k_m)) (* l l)))) (* (/ l (* k_m t)) (/ (* l (/ 1.0 t)) (* k_m t)))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (t <= 2.75e-39) {
tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l)));
} else {
tmp = (l / (k_m * t)) * ((l * (1.0 / t)) / (k_m * t));
}
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 <= 2.75d-39) then
tmp = 2.0d0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l)))
else
tmp = (l / (k_m * t)) * ((l * (1.0d0 / t)) / (k_m * t))
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 <= 2.75e-39) {
tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l)));
} else {
tmp = (l / (k_m * t)) * ((l * (1.0 / t)) / (k_m * t));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if t <= 2.75e-39: tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l))) else: tmp = (l / (k_m * t)) * ((l * (1.0 / t)) / (k_m * t)) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (t <= 2.75e-39) tmp = Float64(2.0 / Float64(Float64(k_m * k_m) * Float64(Float64(t * Float64(k_m * k_m)) / Float64(l * l)))); else tmp = Float64(Float64(l / Float64(k_m * t)) * Float64(Float64(l * Float64(1.0 / t)) / Float64(k_m * t))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (t <= 2.75e-39) tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l))); else tmp = (l / (k_m * t)) * ((l * (1.0 / t)) / (k_m * t)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[t, 2.75e-39], 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], N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] * N[(N[(l * N[(1.0 / t), $MachinePrecision]), $MachinePrecision] / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 2.75 \cdot 10^{-39}:\\
\;\;\;\;\frac{2}{\left(k\_m \cdot k\_m\right) \cdot \frac{t \cdot \left(k\_m \cdot k\_m\right)}{\ell \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell}{k\_m \cdot t} \cdot \frac{\ell \cdot \frac{1}{t}}{k\_m \cdot t}\\
\end{array}
\end{array}
if t < 2.75000000000000009e-39Initial program 45.4%
Taylor expanded in k around 0
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Simplified54.3%
Taylor expanded in t around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6450.6
Simplified50.6%
if 2.75000000000000009e-39 < t Initial program 77.7%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6474.3
Simplified74.3%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6478.7
Applied egg-rr78.7%
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6477.4
Applied egg-rr77.4%
associate-/r*N/A
associate-*l/N/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
associate-/l/N/A
times-fracN/A
div-invN/A
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6487.7
Applied egg-rr87.7%
Final simplification61.4%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= t 9.6e-40) (/ 2.0 (* (* k_m k_m) (/ (* t (* k_m k_m)) (* l l)))) (* l (/ (/ l (* k_m t)) (* t (* k_m t))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (t <= 9.6e-40) {
tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l)));
} else {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
}
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 <= 9.6d-40) then
tmp = 2.0d0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l)))
else
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)))
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 <= 9.6e-40) {
tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l)));
} else {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if t <= 9.6e-40: tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l))) else: tmp = l * ((l / (k_m * t)) / (t * (k_m * t))) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (t <= 9.6e-40) tmp = Float64(2.0 / Float64(Float64(k_m * k_m) * Float64(Float64(t * Float64(k_m * k_m)) / Float64(l * l)))); else tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (t <= 9.6e-40) tmp = 2.0 / ((k_m * k_m) * ((t * (k_m * k_m)) / (l * l))); else tmp = l * ((l / (k_m * t)) / (t * (k_m * t))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[t, 9.6e-40], 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], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 9.6 \cdot 10^{-40}:\\
\;\;\;\;\frac{2}{\left(k\_m \cdot k\_m\right) \cdot \frac{t \cdot \left(k\_m \cdot k\_m\right)}{\ell \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\right)}\\
\end{array}
\end{array}
if t < 9.59999999999999965e-40Initial program 45.4%
Taylor expanded in k around 0
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Simplified54.3%
Taylor expanded in t around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6450.6
Simplified50.6%
if 9.59999999999999965e-40 < t Initial program 77.7%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6474.3
Simplified74.3%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6478.7
Applied egg-rr78.7%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6486.4
Applied egg-rr86.4%
Final simplification61.0%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 3.8e-13) (* l (/ (/ l (* k_m t)) (* t (* k_m t)))) (/ (/ (* 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 <= 3.8e-13) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} 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 <= 3.8d-13) then
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)))
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 <= 3.8e-13) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} 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 <= 3.8e-13: tmp = l * ((l / (k_m * t)) / (t * (k_m * t))) 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 <= 3.8e-13) tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); 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 <= 3.8e-13) tmp = l * ((l / (k_m * t)) / (t * (k_m * t))); 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, 3.8e-13], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $MachinePrecision]), $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 3.8 \cdot 10^{-13}:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\right)}\\
\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 < 3.8e-13Initial program 56.5%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6458.0
Simplified58.0%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6464.0
Applied egg-rr64.0%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.6
Applied egg-rr73.6%
if 3.8e-13 < k Initial program 49.5%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6450.9
Simplified50.9%
associate-*l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6459.9
Applied egg-rr59.9%
Final simplification70.1%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 240000000.0) (* l (/ (/ l (* k_m t)) (* t (* k_m t)))) (/ (* 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 <= 240000000.0) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} 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 <= 240000000.0d0) then
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)))
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 <= 240000000.0) {
tmp = l * ((l / (k_m * t)) / (t * (k_m * t)));
} 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 <= 240000000.0: tmp = l * ((l / (k_m * t)) / (t * (k_m * t))) 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 <= 240000000.0) tmp = Float64(l * Float64(Float64(l / Float64(k_m * t)) / Float64(t * Float64(k_m * t)))); 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 <= 240000000.0) tmp = l * ((l / (k_m * t)) / (t * (k_m * t))); 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, 240000000.0], N[(l * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / N[(t * N[(k$95$m * t), $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 240000000:\\
\;\;\;\;\ell \cdot \frac{\frac{\ell}{k\_m \cdot t}}{t \cdot \left(k\_m \cdot t\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.4e8Initial program 56.6%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6458.4
Simplified58.4%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6464.2
Applied egg-rr64.2%
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.4
Applied egg-rr73.4%
if 2.4e8 < k Initial program 48.2%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6448.3
Simplified48.3%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.4
Applied egg-rr57.4%
Final simplification69.8%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 4.5e-159) (* l (/ l (* t (* k_m (* t (* k_m t)))))) (* (/ 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 <= 4.5e-159) {
tmp = l * (l / (t * (k_m * (t * (k_m * t)))));
} 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 <= 4.5d-159) then
tmp = l * (l / (t * (k_m * (t * (k_m * t)))))
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 <= 4.5e-159) {
tmp = l * (l / (t * (k_m * (t * (k_m * t)))));
} 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 <= 4.5e-159: tmp = l * (l / (t * (k_m * (t * (k_m * t))))) 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 <= 4.5e-159) tmp = Float64(l * Float64(l / Float64(t * Float64(k_m * Float64(t * Float64(k_m * t)))))); 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 <= 4.5e-159) tmp = l * (l / (t * (k_m * (t * (k_m * t))))); 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, 4.5e-159], N[(l * N[(l / N[(t * N[(k$95$m * N[(t * N[(k$95$m * t), $MachinePrecision]), $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 4.5 \cdot 10^{-159}:\\
\;\;\;\;\ell \cdot \frac{\ell}{t \cdot \left(k\_m \cdot \left(t \cdot \left(k\_m \cdot t\right)\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 < 4.49999999999999989e-159Initial program 53.6%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.6
Simplified52.6%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6459.5
Applied egg-rr59.5%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6467.2
Applied egg-rr67.2%
if 4.49999999999999989e-159 < k Initial program 56.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6461.2
Simplified61.2%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.4
Applied egg-rr69.4%
Final simplification68.1%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 15500000.0) (* l (/ l (* (* k_m t) (* t (* k_m t))))) (/ (* 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 <= 15500000.0) {
tmp = l * (l / ((k_m * t) * (t * (k_m * t))));
} 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 <= 15500000.0d0) then
tmp = l * (l / ((k_m * t) * (t * (k_m * t))))
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 <= 15500000.0) {
tmp = l * (l / ((k_m * t) * (t * (k_m * t))));
} 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 <= 15500000.0: tmp = l * (l / ((k_m * t) * (t * (k_m * t)))) 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 <= 15500000.0) tmp = Float64(l * Float64(l / Float64(Float64(k_m * t) * Float64(t * Float64(k_m * t))))); 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 <= 15500000.0) tmp = l * (l / ((k_m * t) * (t * (k_m * t)))); 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, 15500000.0], N[(l * N[(l / N[(N[(k$95$m * t), $MachinePrecision] * N[(t * N[(k$95$m * t), $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 15500000:\\
\;\;\;\;\ell \cdot \frac{\ell}{\left(k\_m \cdot t\right) \cdot \left(t \cdot \left(k\_m \cdot t\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 < 1.55e7Initial program 56.6%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6458.4
Simplified58.4%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6464.2
Applied egg-rr64.2%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6470.0
Applied egg-rr70.0%
if 1.55e7 < k Initial program 48.2%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6448.3
Simplified48.3%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.4
Applied egg-rr57.4%
Final simplification67.2%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* l (/ l (* t (* k_m (* t (* k_m t)))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return l * (l / (t * (k_m * (t * (k_m * 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 / (t * (k_m * (t * (k_m * t)))))
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 * (k_m * t)))));
}
k_m = math.fabs(k) def code(t, l, k_m): return l * (l / (t * (k_m * (t * (k_m * t)))))
k_m = abs(k) function code(t, l, k_m) return Float64(l * Float64(l / Float64(t * Float64(k_m * Float64(t * Float64(k_m * t)))))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = l * (l / (t * (k_m * (t * (k_m * t))))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(l * N[(l / N[(t * N[(k$95$m * N[(t * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\ell \cdot \frac{\ell}{t \cdot \left(k\_m \cdot \left(t \cdot \left(k\_m \cdot t\right)\right)\right)}
\end{array}
Initial program 54.7%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6456.2
Simplified56.2%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6460.9
Applied egg-rr60.9%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6465.8
Applied egg-rr65.8%
Final simplification65.8%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* l (/ l (* t (* k_m (* k_m (* t t)))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return l * (l / (t * (k_m * (k_m * (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 / (t * (k_m * (k_m * (t * t)))))
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return l * (l / (t * (k_m * (k_m * (t * t)))));
}
k_m = math.fabs(k) def code(t, l, k_m): return l * (l / (t * (k_m * (k_m * (t * t)))))
k_m = abs(k) function code(t, l, k_m) return Float64(l * Float64(l / Float64(t * Float64(k_m * Float64(k_m * Float64(t * t)))))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = l * (l / (t * (k_m * (k_m * (t * t))))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(l * N[(l / N[(t * N[(k$95$m * N[(k$95$m * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\ell \cdot \frac{\ell}{t \cdot \left(k\_m \cdot \left(k\_m \cdot \left(t \cdot t\right)\right)\right)}
\end{array}
Initial program 54.7%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6456.2
Simplified56.2%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6460.9
Applied egg-rr60.9%
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6460.0
Applied egg-rr60.0%
associate-*r*N/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6461.7
Applied egg-rr61.7%
Final simplification61.7%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* l (/ l (* k_m (* t (* k_m (* t t)))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return l * (l / (k_m * (t * (k_m * (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 * (t * (k_m * (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 * (t * (k_m * (t * t)))));
}
k_m = math.fabs(k) def code(t, l, k_m): return l * (l / (k_m * (t * (k_m * (t * t)))))
k_m = abs(k) function code(t, l, k_m) return Float64(l * Float64(l / Float64(k_m * Float64(t * Float64(k_m * Float64(t * t)))))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = l * (l / (k_m * (t * (k_m * (t * t))))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(l * N[(l / N[(k$95$m * N[(t * N[(k$95$m * 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(t \cdot \left(k\_m \cdot \left(t \cdot t\right)\right)\right)}
\end{array}
Initial program 54.7%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6456.2
Simplified56.2%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6460.9
Applied egg-rr60.9%
Final simplification60.9%
herbie shell --seed 2024199
(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))))