
(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 12 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 (* (/ k_m l) k_m)))
(if (<= k_m 2.15e-21)
(/ 2.0 (* (* t t_1) t_1))
(/ 2.0 (* (* (/ (* (sin k_m) (* (tan k_m) k_m)) l) t) (/ k_m l))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if (k_m <= 2.15e-21) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / ((((sin(k_m) * (tan(k_m) * k_m)) / l) * t) * (k_m / 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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if (k_m <= 2.15d-21) then
tmp = 2.0d0 / ((t * t_1) * t_1)
else
tmp = 2.0d0 / ((((sin(k_m) * (tan(k_m) * k_m)) / l) * t) * (k_m / l))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if (k_m <= 2.15e-21) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / ((((Math.sin(k_m) * (Math.tan(k_m) * k_m)) / l) * t) * (k_m / l));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m tmp = 0 if k_m <= 2.15e-21: tmp = 2.0 / ((t * t_1) * t_1) else: tmp = 2.0 / ((((math.sin(k_m) * (math.tan(k_m) * k_m)) / l) * t) * (k_m / l)) return tmp
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(k_m / l) * k_m) tmp = 0.0 if (k_m <= 2.15e-21) tmp = Float64(2.0 / Float64(Float64(t * t_1) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64(sin(k_m) * Float64(tan(k_m) * k_m)) / l) * t) * Float64(k_m / l))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) t_1 = (k_m / l) * k_m; tmp = 0.0; if (k_m <= 2.15e-21) tmp = 2.0 / ((t * t_1) * t_1); else tmp = 2.0 / ((((sin(k_m) * (tan(k_m) * k_m)) / l) * t) * (k_m / l)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(k$95$m / l), $MachinePrecision] * k$95$m), $MachinePrecision]}, If[LessEqual[k$95$m, 2.15e-21], N[(2.0 / N[(N[(t * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[Tan[k$95$m], $MachinePrecision] * k$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * t), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{k\_m}{\ell} \cdot k\_m\\
\mathbf{if}\;k\_m \leq 2.15 \cdot 10^{-21}:\\
\;\;\;\;\frac{2}{\left(t \cdot t\_1\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\frac{\sin k\_m \cdot \left(\tan k\_m \cdot k\_m\right)}{\ell} \cdot t\right) \cdot \frac{k\_m}{\ell}}\\
\end{array}
\end{array}
if k < 2.1499999999999999e-21Initial program 39.7%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6470.9
Applied rewrites70.9%
Applied rewrites75.8%
Applied rewrites83.4%
if 2.1499999999999999e-21 < k Initial program 33.2%
Taylor expanded in t around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
times-fracN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites98.1%
Applied rewrites99.6%
Applied rewrites99.5%
Applied rewrites99.7%
Final simplification87.3%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= (* l l) 0.0)
(/ 2.0 (* (* t t_1) t_1))
(/ 2.0 (* (* (* (/ (* (sin k_m) t) l) (tan k_m)) k_m) (/ k_m l))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if ((l * l) <= 0.0) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / (((((sin(k_m) * t) / l) * tan(k_m)) * k_m) * (k_m / 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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if ((l * l) <= 0.0d0) then
tmp = 2.0d0 / ((t * t_1) * t_1)
else
tmp = 2.0d0 / (((((sin(k_m) * t) / l) * tan(k_m)) * k_m) * (k_m / l))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if ((l * l) <= 0.0) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / (((((Math.sin(k_m) * t) / l) * Math.tan(k_m)) * k_m) * (k_m / l));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m tmp = 0 if (l * l) <= 0.0: tmp = 2.0 / ((t * t_1) * t_1) else: tmp = 2.0 / (((((math.sin(k_m) * t) / l) * math.tan(k_m)) * k_m) * (k_m / l)) return tmp
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(k_m / l) * k_m) tmp = 0.0 if (Float64(l * l) <= 0.0) tmp = Float64(2.0 / Float64(Float64(t * t_1) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64(Float64(sin(k_m) * t) / l) * tan(k_m)) * k_m) * Float64(k_m / l))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) t_1 = (k_m / l) * k_m; tmp = 0.0; if ((l * l) <= 0.0) tmp = 2.0 / ((t * t_1) * t_1); else tmp = 2.0 / (((((sin(k_m) * t) / l) * tan(k_m)) * k_m) * (k_m / l)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(k$95$m / l), $MachinePrecision] * k$95$m), $MachinePrecision]}, If[LessEqual[N[(l * l), $MachinePrecision], 0.0], N[(2.0 / N[(N[(t * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[(N[Sin[k$95$m], $MachinePrecision] * t), $MachinePrecision] / l), $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision] * k$95$m), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{k\_m}{\ell} \cdot k\_m\\
\mathbf{if}\;\ell \cdot \ell \leq 0:\\
\;\;\;\;\frac{2}{\left(t \cdot t\_1\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\left(\frac{\sin k\_m \cdot t}{\ell} \cdot \tan k\_m\right) \cdot k\_m\right) \cdot \frac{k\_m}{\ell}}\\
\end{array}
\end{array}
if (*.f64 l l) < 0.0Initial program 19.4%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6465.2
Applied rewrites65.2%
Applied rewrites77.8%
Applied rewrites98.7%
if 0.0 < (*.f64 l l) Initial program 44.2%
Taylor expanded in t around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
times-fracN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites96.3%
Applied rewrites99.6%
Applied rewrites98.9%
Applied rewrites97.3%
Final simplification97.6%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= (* l l) 1e-289)
(/ 2.0 (* (* t t_1) t_1))
(/ 2.0 (* (* (/ (* (* t k_m) (sin k_m)) l) (tan k_m)) (/ k_m l))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if ((l * l) <= 1e-289) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / (((((t * k_m) * sin(k_m)) / l) * tan(k_m)) * (k_m / 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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if ((l * l) <= 1d-289) then
tmp = 2.0d0 / ((t * t_1) * t_1)
else
tmp = 2.0d0 / (((((t * k_m) * sin(k_m)) / l) * tan(k_m)) * (k_m / l))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if ((l * l) <= 1e-289) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / (((((t * k_m) * Math.sin(k_m)) / l) * Math.tan(k_m)) * (k_m / l));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m tmp = 0 if (l * l) <= 1e-289: tmp = 2.0 / ((t * t_1) * t_1) else: tmp = 2.0 / (((((t * k_m) * math.sin(k_m)) / l) * math.tan(k_m)) * (k_m / l)) return tmp
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(k_m / l) * k_m) tmp = 0.0 if (Float64(l * l) <= 1e-289) tmp = Float64(2.0 / Float64(Float64(t * t_1) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64(Float64(t * k_m) * sin(k_m)) / l) * tan(k_m)) * Float64(k_m / l))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) t_1 = (k_m / l) * k_m; tmp = 0.0; if ((l * l) <= 1e-289) tmp = 2.0 / ((t * t_1) * t_1); else tmp = 2.0 / (((((t * k_m) * sin(k_m)) / l) * tan(k_m)) * (k_m / l)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(k$95$m / l), $MachinePrecision] * k$95$m), $MachinePrecision]}, If[LessEqual[N[(l * l), $MachinePrecision], 1e-289], N[(2.0 / N[(N[(t * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[(t * k$95$m), $MachinePrecision] * N[Sin[k$95$m], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{k\_m}{\ell} \cdot k\_m\\
\mathbf{if}\;\ell \cdot \ell \leq 10^{-289}:\\
\;\;\;\;\frac{2}{\left(t \cdot t\_1\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\frac{\left(t \cdot k\_m\right) \cdot \sin k\_m}{\ell} \cdot \tan k\_m\right) \cdot \frac{k\_m}{\ell}}\\
\end{array}
\end{array}
if (*.f64 l l) < 1e-289Initial program 26.1%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6468.8
Applied rewrites68.8%
Applied rewrites80.0%
Applied rewrites98.8%
if 1e-289 < (*.f64 l l) Initial program 42.6%
Taylor expanded in t around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
times-fracN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites96.1%
Applied rewrites99.6%
Applied rewrites96.6%
Final simplification97.2%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= (* l l) 4e-212)
(/ 2.0 (* (* t t_1) t_1))
(/ 2.0 (* (* (/ k_m l) (* t (/ k_m l))) (pow (sin k_m) 2.0))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if ((l * l) <= 4e-212) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / (((k_m / l) * (t * (k_m / l))) * pow(sin(k_m), 2.0));
}
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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if ((l * l) <= 4d-212) then
tmp = 2.0d0 / ((t * t_1) * t_1)
else
tmp = 2.0d0 / (((k_m / l) * (t * (k_m / l))) * (sin(k_m) ** 2.0d0))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if ((l * l) <= 4e-212) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / (((k_m / l) * (t * (k_m / l))) * Math.pow(Math.sin(k_m), 2.0));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m tmp = 0 if (l * l) <= 4e-212: tmp = 2.0 / ((t * t_1) * t_1) else: tmp = 2.0 / (((k_m / l) * (t * (k_m / l))) * math.pow(math.sin(k_m), 2.0)) return tmp
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(k_m / l) * k_m) tmp = 0.0 if (Float64(l * l) <= 4e-212) tmp = Float64(2.0 / Float64(Float64(t * t_1) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(k_m / l) * Float64(t * Float64(k_m / l))) * (sin(k_m) ^ 2.0))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) t_1 = (k_m / l) * k_m; tmp = 0.0; if ((l * l) <= 4e-212) tmp = 2.0 / ((t * t_1) * t_1); else tmp = 2.0 / (((k_m / l) * (t * (k_m / l))) * (sin(k_m) ^ 2.0)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(k$95$m / l), $MachinePrecision] * k$95$m), $MachinePrecision]}, If[LessEqual[N[(l * l), $MachinePrecision], 4e-212], N[(2.0 / N[(N[(t * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(k$95$m / l), $MachinePrecision] * N[(t * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Power[N[Sin[k$95$m], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{k\_m}{\ell} \cdot k\_m\\
\mathbf{if}\;\ell \cdot \ell \leq 4 \cdot 10^{-212}:\\
\;\;\;\;\frac{2}{\left(t \cdot t\_1\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\frac{k\_m}{\ell} \cdot \left(t \cdot \frac{k\_m}{\ell}\right)\right) \cdot {\sin k\_m}^{2}}\\
\end{array}
\end{array}
if (*.f64 l l) < 3.99999999999999982e-212Initial program 25.7%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6470.3
Applied rewrites70.3%
Applied rewrites79.7%
Applied rewrites96.7%
if 3.99999999999999982e-212 < (*.f64 l l) Initial program 44.0%
Taylor expanded in t around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
times-fracN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites95.9%
Taylor expanded in k around 0
Applied rewrites70.8%
Applied rewrites71.6%
Final simplification79.7%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= (* l l) 4e-212)
(/ 2.0 (* (* t t_1) t_1))
(/ 2.0 (* (* (/ (* (pow (sin k_m) 2.0) t) l) k_m) (/ k_m l))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if ((l * l) <= 4e-212) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / ((((pow(sin(k_m), 2.0) * t) / l) * k_m) * (k_m / 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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if ((l * l) <= 4d-212) then
tmp = 2.0d0 / ((t * t_1) * t_1)
else
tmp = 2.0d0 / (((((sin(k_m) ** 2.0d0) * t) / l) * k_m) * (k_m / l))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if ((l * l) <= 4e-212) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / ((((Math.pow(Math.sin(k_m), 2.0) * t) / l) * k_m) * (k_m / l));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m tmp = 0 if (l * l) <= 4e-212: tmp = 2.0 / ((t * t_1) * t_1) else: tmp = 2.0 / ((((math.pow(math.sin(k_m), 2.0) * t) / l) * k_m) * (k_m / l)) return tmp
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(k_m / l) * k_m) tmp = 0.0 if (Float64(l * l) <= 4e-212) tmp = Float64(2.0 / Float64(Float64(t * t_1) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64((sin(k_m) ^ 2.0) * t) / l) * k_m) * Float64(k_m / l))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) t_1 = (k_m / l) * k_m; tmp = 0.0; if ((l * l) <= 4e-212) tmp = 2.0 / ((t * t_1) * t_1); else tmp = 2.0 / (((((sin(k_m) ^ 2.0) * t) / l) * k_m) * (k_m / l)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(k$95$m / l), $MachinePrecision] * k$95$m), $MachinePrecision]}, If[LessEqual[N[(l * l), $MachinePrecision], 4e-212], N[(2.0 / N[(N[(t * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[Power[N[Sin[k$95$m], $MachinePrecision], 2.0], $MachinePrecision] * t), $MachinePrecision] / l), $MachinePrecision] * k$95$m), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{k\_m}{\ell} \cdot k\_m\\
\mathbf{if}\;\ell \cdot \ell \leq 4 \cdot 10^{-212}:\\
\;\;\;\;\frac{2}{\left(t \cdot t\_1\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\frac{{\sin k\_m}^{2} \cdot t}{\ell} \cdot k\_m\right) \cdot \frac{k\_m}{\ell}}\\
\end{array}
\end{array}
if (*.f64 l l) < 3.99999999999999982e-212Initial program 25.7%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6470.3
Applied rewrites70.3%
Applied rewrites79.7%
Applied rewrites96.7%
if 3.99999999999999982e-212 < (*.f64 l l) Initial program 44.0%
Taylor expanded in t around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
times-fracN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites95.9%
Taylor expanded in k around 0
Applied rewrites70.8%
Applied rewrites71.5%
Final simplification79.6%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= k_m 2.15e-21)
(/ 2.0 (* (* t t_1) t_1))
(/ 2.0 (* (* (* (sin k_m) t) (* (/ (tan k_m) l) k_m)) (/ k_m l))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if (k_m <= 2.15e-21) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / (((sin(k_m) * t) * ((tan(k_m) / l) * k_m)) * (k_m / 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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if (k_m <= 2.15d-21) then
tmp = 2.0d0 / ((t * t_1) * t_1)
else
tmp = 2.0d0 / (((sin(k_m) * t) * ((tan(k_m) / l) * k_m)) * (k_m / l))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if (k_m <= 2.15e-21) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / (((Math.sin(k_m) * t) * ((Math.tan(k_m) / l) * k_m)) * (k_m / l));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m tmp = 0 if k_m <= 2.15e-21: tmp = 2.0 / ((t * t_1) * t_1) else: tmp = 2.0 / (((math.sin(k_m) * t) * ((math.tan(k_m) / l) * k_m)) * (k_m / l)) return tmp
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(k_m / l) * k_m) tmp = 0.0 if (k_m <= 2.15e-21) tmp = Float64(2.0 / Float64(Float64(t * t_1) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(sin(k_m) * t) * Float64(Float64(tan(k_m) / l) * k_m)) * Float64(k_m / l))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) t_1 = (k_m / l) * k_m; tmp = 0.0; if (k_m <= 2.15e-21) tmp = 2.0 / ((t * t_1) * t_1); else tmp = 2.0 / (((sin(k_m) * t) * ((tan(k_m) / l) * k_m)) * (k_m / l)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(k$95$m / l), $MachinePrecision] * k$95$m), $MachinePrecision]}, If[LessEqual[k$95$m, 2.15e-21], N[(2.0 / N[(N[(t * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[Sin[k$95$m], $MachinePrecision] * t), $MachinePrecision] * N[(N[(N[Tan[k$95$m], $MachinePrecision] / l), $MachinePrecision] * k$95$m), $MachinePrecision]), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{k\_m}{\ell} \cdot k\_m\\
\mathbf{if}\;k\_m \leq 2.15 \cdot 10^{-21}:\\
\;\;\;\;\frac{2}{\left(t \cdot t\_1\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\left(\sin k\_m \cdot t\right) \cdot \left(\frac{\tan k\_m}{\ell} \cdot k\_m\right)\right) \cdot \frac{k\_m}{\ell}}\\
\end{array}
\end{array}
if k < 2.1499999999999999e-21Initial program 39.7%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6470.9
Applied rewrites70.9%
Applied rewrites75.8%
Applied rewrites83.4%
if 2.1499999999999999e-21 < k Initial program 33.2%
Taylor expanded in t around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
times-fracN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites98.1%
Applied rewrites99.6%
Applied rewrites99.5%
Applied rewrites99.6%
Final simplification87.3%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= k_m 2.15e-21)
(/ 2.0 (* (* t t_1) t_1))
(/ 2.0 (* (* (* (* (sin k_m) (tan k_m)) (/ k_m l)) t) (/ k_m l))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if (k_m <= 2.15e-21) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / ((((sin(k_m) * tan(k_m)) * (k_m / l)) * t) * (k_m / 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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if (k_m <= 2.15d-21) then
tmp = 2.0d0 / ((t * t_1) * t_1)
else
tmp = 2.0d0 / ((((sin(k_m) * tan(k_m)) * (k_m / l)) * t) * (k_m / l))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if (k_m <= 2.15e-21) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / ((((Math.sin(k_m) * Math.tan(k_m)) * (k_m / l)) * t) * (k_m / l));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m tmp = 0 if k_m <= 2.15e-21: tmp = 2.0 / ((t * t_1) * t_1) else: tmp = 2.0 / ((((math.sin(k_m) * math.tan(k_m)) * (k_m / l)) * t) * (k_m / l)) return tmp
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(k_m / l) * k_m) tmp = 0.0 if (k_m <= 2.15e-21) tmp = Float64(2.0 / Float64(Float64(t * t_1) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64(sin(k_m) * tan(k_m)) * Float64(k_m / l)) * t) * Float64(k_m / l))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) t_1 = (k_m / l) * k_m; tmp = 0.0; if (k_m <= 2.15e-21) tmp = 2.0 / ((t * t_1) * t_1); else tmp = 2.0 / ((((sin(k_m) * tan(k_m)) * (k_m / l)) * t) * (k_m / l)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(k$95$m / l), $MachinePrecision] * k$95$m), $MachinePrecision]}, If[LessEqual[k$95$m, 2.15e-21], N[(2.0 / N[(N[(t * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[Sin[k$95$m], $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{k\_m}{\ell} \cdot k\_m\\
\mathbf{if}\;k\_m \leq 2.15 \cdot 10^{-21}:\\
\;\;\;\;\frac{2}{\left(t \cdot t\_1\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\left(\left(\sin k\_m \cdot \tan k\_m\right) \cdot \frac{k\_m}{\ell}\right) \cdot t\right) \cdot \frac{k\_m}{\ell}}\\
\end{array}
\end{array}
if k < 2.1499999999999999e-21Initial program 39.7%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6470.9
Applied rewrites70.9%
Applied rewrites75.8%
Applied rewrites83.4%
if 2.1499999999999999e-21 < k Initial program 33.2%
Taylor expanded in t around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
times-fracN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites98.1%
Applied rewrites99.6%
Applied rewrites99.5%
Final simplification87.3%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= k_m 5.0)
(/ 2.0 (* (* t t_1) t_1))
(/ 2.0 (* (* (* (pow (sin k_m) 2.0) (/ k_m l)) t) (/ k_m l))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if (k_m <= 5.0) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / (((pow(sin(k_m), 2.0) * (k_m / l)) * t) * (k_m / 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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if (k_m <= 5.0d0) then
tmp = 2.0d0 / ((t * t_1) * t_1)
else
tmp = 2.0d0 / ((((sin(k_m) ** 2.0d0) * (k_m / l)) * t) * (k_m / l))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
double tmp;
if (k_m <= 5.0) {
tmp = 2.0 / ((t * t_1) * t_1);
} else {
tmp = 2.0 / (((Math.pow(Math.sin(k_m), 2.0) * (k_m / l)) * t) * (k_m / l));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m tmp = 0 if k_m <= 5.0: tmp = 2.0 / ((t * t_1) * t_1) else: tmp = 2.0 / (((math.pow(math.sin(k_m), 2.0) * (k_m / l)) * t) * (k_m / l)) return tmp
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(k_m / l) * k_m) tmp = 0.0 if (k_m <= 5.0) tmp = Float64(2.0 / Float64(Float64(t * t_1) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64((sin(k_m) ^ 2.0) * Float64(k_m / l)) * t) * Float64(k_m / l))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) t_1 = (k_m / l) * k_m; tmp = 0.0; if (k_m <= 5.0) tmp = 2.0 / ((t * t_1) * t_1); else tmp = 2.0 / ((((sin(k_m) ^ 2.0) * (k_m / l)) * t) * (k_m / l)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(k$95$m / l), $MachinePrecision] * k$95$m), $MachinePrecision]}, If[LessEqual[k$95$m, 5.0], N[(2.0 / N[(N[(t * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[Power[N[Sin[k$95$m], $MachinePrecision], 2.0], $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{k\_m}{\ell} \cdot k\_m\\
\mathbf{if}\;k\_m \leq 5:\\
\;\;\;\;\frac{2}{\left(t \cdot t\_1\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\left({\sin k\_m}^{2} \cdot \frac{k\_m}{\ell}\right) \cdot t\right) \cdot \frac{k\_m}{\ell}}\\
\end{array}
\end{array}
if k < 5Initial program 39.0%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6470.9
Applied rewrites70.9%
Applied rewrites75.7%
Applied rewrites83.5%
if 5 < k Initial program 35.0%
Taylor expanded in t around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
times-fracN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites97.9%
Taylor expanded in k around 0
Applied rewrites56.2%
Applied rewrites56.2%
Final simplification77.7%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (/ l (* t k_m))) (t_2 (* (/ k_m l) k_m)))
(if (<= (* l l) 2e+255)
(/ 2.0 (* (* t t_2) t_2))
(/ 2.0 (* (- (/ 0.5 t_1) (/ (* (cos (+ k_m k_m)) 0.5) t_1)) (/ k_m l))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = l / (t * k_m);
double t_2 = (k_m / l) * k_m;
double tmp;
if ((l * l) <= 2e+255) {
tmp = 2.0 / ((t * t_2) * t_2);
} else {
tmp = 2.0 / (((0.5 / t_1) - ((cos((k_m + k_m)) * 0.5) / t_1)) * (k_m / 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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = l / (t * k_m)
t_2 = (k_m / l) * k_m
if ((l * l) <= 2d+255) then
tmp = 2.0d0 / ((t * t_2) * t_2)
else
tmp = 2.0d0 / (((0.5d0 / t_1) - ((cos((k_m + k_m)) * 0.5d0) / t_1)) * (k_m / l))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = l / (t * k_m);
double t_2 = (k_m / l) * k_m;
double tmp;
if ((l * l) <= 2e+255) {
tmp = 2.0 / ((t * t_2) * t_2);
} else {
tmp = 2.0 / (((0.5 / t_1) - ((Math.cos((k_m + k_m)) * 0.5) / t_1)) * (k_m / l));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = l / (t * k_m) t_2 = (k_m / l) * k_m tmp = 0 if (l * l) <= 2e+255: tmp = 2.0 / ((t * t_2) * t_2) else: tmp = 2.0 / (((0.5 / t_1) - ((math.cos((k_m + k_m)) * 0.5) / t_1)) * (k_m / l)) return tmp
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(l / Float64(t * k_m)) t_2 = Float64(Float64(k_m / l) * k_m) tmp = 0.0 if (Float64(l * l) <= 2e+255) tmp = Float64(2.0 / Float64(Float64(t * t_2) * t_2)); else tmp = Float64(2.0 / Float64(Float64(Float64(0.5 / t_1) - Float64(Float64(cos(Float64(k_m + k_m)) * 0.5) / t_1)) * Float64(k_m / l))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) t_1 = l / (t * k_m); t_2 = (k_m / l) * k_m; tmp = 0.0; if ((l * l) <= 2e+255) tmp = 2.0 / ((t * t_2) * t_2); else tmp = 2.0 / (((0.5 / t_1) - ((cos((k_m + k_m)) * 0.5) / t_1)) * (k_m / l)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(l / N[(t * k$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(k$95$m / l), $MachinePrecision] * k$95$m), $MachinePrecision]}, If[LessEqual[N[(l * l), $MachinePrecision], 2e+255], N[(2.0 / N[(N[(t * t$95$2), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(0.5 / t$95$1), $MachinePrecision] - N[(N[(N[Cos[N[(k$95$m + k$95$m), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{\ell}{t \cdot k\_m}\\
t_2 := \frac{k\_m}{\ell} \cdot k\_m\\
\mathbf{if}\;\ell \cdot \ell \leq 2 \cdot 10^{+255}:\\
\;\;\;\;\frac{2}{\left(t \cdot t\_2\right) \cdot t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\frac{0.5}{t\_1} - \frac{\cos \left(k\_m + k\_m\right) \cdot 0.5}{t\_1}\right) \cdot \frac{k\_m}{\ell}}\\
\end{array}
\end{array}
if (*.f64 l l) < 1.99999999999999998e255Initial program 38.4%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6468.9
Applied rewrites68.9%
Applied rewrites74.2%
Applied rewrites83.6%
if 1.99999999999999998e255 < (*.f64 l l) Initial program 37.6%
Taylor expanded in t around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
times-fracN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites92.5%
Taylor expanded in k around 0
Applied rewrites67.5%
Applied rewrites28.8%
Final simplification66.9%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (let* ((t_1 (* (/ k_m l) k_m))) (/ 2.0 (* (* t t_1) t_1))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
return 2.0 / ((t * t_1) * t_1);
}
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) :: t_1
t_1 = (k_m / l) * k_m
code = 2.0d0 / ((t * t_1) * t_1)
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = (k_m / l) * k_m;
return 2.0 / ((t * t_1) * t_1);
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m return 2.0 / ((t * t_1) * t_1)
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(k_m / l) * k_m) return Float64(2.0 / Float64(Float64(t * t_1) * t_1)) end
k_m = abs(k); function tmp = code(t, l, k_m) t_1 = (k_m / l) * k_m; tmp = 2.0 / ((t * t_1) * t_1); end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(k$95$m / l), $MachinePrecision] * k$95$m), $MachinePrecision]}, N[(2.0 / N[(N[(t * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{k\_m}{\ell} \cdot k\_m\\
\frac{2}{\left(t \cdot t\_1\right) \cdot t\_1}
\end{array}
\end{array}
Initial program 38.2%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6466.6
Applied rewrites66.6%
Applied rewrites70.3%
Applied rewrites76.5%
Final simplification76.5%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ 2.0 (* (* (* (* t k_m) (/ k_m l)) (/ k_m l)) k_m)))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 2.0 / ((((t * k_m) * (k_m / l)) * (k_m / l)) * 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 = 2.0d0 / ((((t * k_m) * (k_m / l)) * (k_m / l)) * k_m)
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return 2.0 / ((((t * k_m) * (k_m / l)) * (k_m / l)) * k_m);
}
k_m = math.fabs(k) def code(t, l, k_m): return 2.0 / ((((t * k_m) * (k_m / l)) * (k_m / l)) * k_m)
k_m = abs(k) function code(t, l, k_m) return Float64(2.0 / Float64(Float64(Float64(Float64(t * k_m) * Float64(k_m / l)) * Float64(k_m / l)) * k_m)) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 2.0 / ((((t * k_m) * (k_m / l)) * (k_m / l)) * k_m); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(2.0 / N[(N[(N[(N[(t * k$95$m), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision] * k$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{2}{\left(\left(\left(t \cdot k\_m\right) \cdot \frac{k\_m}{\ell}\right) \cdot \frac{k\_m}{\ell}\right) \cdot k\_m}
\end{array}
Initial program 38.2%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6466.6
Applied rewrites66.6%
Applied rewrites70.3%
Applied rewrites72.2%
Applied rewrites73.9%
Final simplification73.9%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ 2.0 (* (/ (* (* k_m k_m) (* t k_m)) (* l l)) k_m)))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 2.0 / ((((k_m * k_m) * (t * k_m)) / (l * l)) * 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 = 2.0d0 / ((((k_m * k_m) * (t * k_m)) / (l * l)) * k_m)
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return 2.0 / ((((k_m * k_m) * (t * k_m)) / (l * l)) * k_m);
}
k_m = math.fabs(k) def code(t, l, k_m): return 2.0 / ((((k_m * k_m) * (t * k_m)) / (l * l)) * k_m)
k_m = abs(k) function code(t, l, k_m) return Float64(2.0 / Float64(Float64(Float64(Float64(k_m * k_m) * Float64(t * k_m)) / Float64(l * l)) * k_m)) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 2.0 / ((((k_m * k_m) * (t * k_m)) / (l * l)) * k_m); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(2.0 / N[(N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(t * k$95$m), $MachinePrecision]), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision] * k$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{2}{\frac{\left(k\_m \cdot k\_m\right) \cdot \left(t \cdot k\_m\right)}{\ell \cdot \ell} \cdot k\_m}
\end{array}
Initial program 38.2%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6466.6
Applied rewrites66.6%
Applied rewrites70.3%
Applied rewrites72.2%
Applied rewrites64.8%
Final simplification64.8%
herbie shell --seed 2024278
(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))))