
(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 9 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 2e-44)
(/ 2.0 (* (* t_1 t) t_1))
(/ 2.0 (* (* (* (/ (sin k_m) l) k_m) (tan k_m)) (* (/ k_m l) t))))))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 <= 2e-44) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / ((((sin(k_m) / l) * k_m) * tan(k_m)) * ((k_m / l) * 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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if (k_m <= 2d-44) then
tmp = 2.0d0 / ((t_1 * t) * t_1)
else
tmp = 2.0d0 / ((((sin(k_m) / l) * k_m) * tan(k_m)) * ((k_m / l) * t))
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 <= 2e-44) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / ((((Math.sin(k_m) / l) * k_m) * Math.tan(k_m)) * ((k_m / l) * t));
}
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 <= 2e-44: tmp = 2.0 / ((t_1 * t) * t_1) else: tmp = 2.0 / ((((math.sin(k_m) / l) * k_m) * math.tan(k_m)) * ((k_m / l) * t)) 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 <= 2e-44) tmp = Float64(2.0 / Float64(Float64(t_1 * t) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64(sin(k_m) / l) * k_m) * tan(k_m)) * Float64(Float64(k_m / l) * t))); 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 <= 2e-44) tmp = 2.0 / ((t_1 * t) * t_1); else tmp = 2.0 / ((((sin(k_m) / l) * k_m) * tan(k_m)) * ((k_m / l) * t)); 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, 2e-44], N[(2.0 / N[(N[(t$95$1 * t), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[Sin[k$95$m], $MachinePrecision] / l), $MachinePrecision] * k$95$m), $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision] * N[(N[(k$95$m / l), $MachinePrecision] * t), $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 \cdot 10^{-44}:\\
\;\;\;\;\frac{2}{\left(t\_1 \cdot t\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\left(\frac{\sin k\_m}{\ell} \cdot k\_m\right) \cdot \tan k\_m\right) \cdot \left(\frac{k\_m}{\ell} \cdot t\right)}\\
\end{array}
\end{array}
if k < 1.99999999999999991e-44Initial 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.f6474.3
Applied rewrites74.3%
Applied rewrites14.5%
Applied rewrites68.4%
Applied rewrites81.4%
if 1.99999999999999991e-44 < k Initial program 26.3%
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 rewrites94.3%
Applied rewrites98.1%
Applied rewrites98.1%
Applied rewrites98.2%
Final simplification86.0%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= k_m 4500000.0)
(/ 2.0 (* (* t_1 t) 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 <= 4500000.0) {
tmp = 2.0 / ((t_1 * t) * 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 <= 4500000.0d0) then
tmp = 2.0d0 / ((t_1 * t) * 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 <= 4500000.0) {
tmp = 2.0 / ((t_1 * t) * 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 <= 4500000.0: tmp = 2.0 / ((t_1 * t) * 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 <= 4500000.0) tmp = Float64(2.0 / Float64(Float64(t_1 * t) * t_1)); else tmp = Float64(2.0 / Float64(Float64((sin(k_m) ^ 2.0) * Float64(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 <= 4500000.0) tmp = 2.0 / ((t_1 * t) * 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, 4500000.0], N[(2.0 / N[(N[(t$95$1 * t), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[Power[N[Sin[k$95$m], $MachinePrecision], 2.0], $MachinePrecision] * N[(N[(k$95$m / l), $MachinePrecision] * t), $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 4500000:\\
\;\;\;\;\frac{2}{\left(t\_1 \cdot t\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left({\sin k\_m}^{2} \cdot \left(\frac{k\_m}{\ell} \cdot t\right)\right) \cdot \frac{k\_m}{\ell}}\\
\end{array}
\end{array}
if k < 4.5e6Initial 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.f6474.4
Applied rewrites74.4%
Applied rewrites15.7%
Applied rewrites68.6%
Applied rewrites81.8%
if 4.5e6 < k Initial program 27.9%
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 rewrites93.9%
Applied rewrites98.0%
Taylor expanded in k around 0
Applied rewrites60.8%
Final simplification76.4%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ 2.0 (* (* (/ (sin k_m) l) k_m) (* (* (/ k_m l) t) (tan k_m)))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 2.0 / (((sin(k_m) / l) * k_m) * (((k_m / l) * t) * tan(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 / (((sin(k_m) / l) * k_m) * (((k_m / l) * t) * tan(k_m)))
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return 2.0 / (((Math.sin(k_m) / l) * k_m) * (((k_m / l) * t) * Math.tan(k_m)));
}
k_m = math.fabs(k) def code(t, l, k_m): return 2.0 / (((math.sin(k_m) / l) * k_m) * (((k_m / l) * t) * math.tan(k_m)))
k_m = abs(k) function code(t, l, k_m) return Float64(2.0 / Float64(Float64(Float64(sin(k_m) / l) * k_m) * Float64(Float64(Float64(k_m / l) * t) * tan(k_m)))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 2.0 / (((sin(k_m) / l) * k_m) * (((k_m / l) * t) * tan(k_m))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(2.0 / N[(N[(N[(N[Sin[k$95$m], $MachinePrecision] / l), $MachinePrecision] * k$95$m), $MachinePrecision] * N[(N[(N[(k$95$m / l), $MachinePrecision] * t), $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{2}{\left(\frac{\sin k\_m}{\ell} \cdot k\_m\right) \cdot \left(\left(\frac{k\_m}{\ell} \cdot t\right) \cdot \tan k\_m\right)}
\end{array}
Initial program 35.5%
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 rewrites90.6%
Applied rewrites96.8%
Applied rewrites98.6%
Applied rewrites99.0%
Final simplification99.0%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= k_m 3e-43)
(/ 2.0 (* (* t_1 t) t_1))
(/ 2.0 (* (/ (/ (* (* k_m k_m) t) l) l) (/ k_m (/ (cos k_m) k_m)))))))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 <= 3e-43) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / (((((k_m * k_m) * t) / l) / l) * (k_m / (cos(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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if (k_m <= 3d-43) then
tmp = 2.0d0 / ((t_1 * t) * t_1)
else
tmp = 2.0d0 / (((((k_m * k_m) * t) / l) / l) * (k_m / (cos(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 t_1 = (k_m / l) * k_m;
double tmp;
if (k_m <= 3e-43) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / (((((k_m * k_m) * t) / l) / l) * (k_m / (Math.cos(k_m) / k_m)));
}
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 <= 3e-43: tmp = 2.0 / ((t_1 * t) * t_1) else: tmp = 2.0 / (((((k_m * k_m) * t) / l) / l) * (k_m / (math.cos(k_m) / k_m))) 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 <= 3e-43) tmp = Float64(2.0 / Float64(Float64(t_1 * t) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64(Float64(k_m * k_m) * t) / l) / l) * Float64(k_m / Float64(cos(k_m) / k_m)))); 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 <= 3e-43) tmp = 2.0 / ((t_1 * t) * t_1); else tmp = 2.0 / (((((k_m * k_m) * t) / l) / l) * (k_m / (cos(k_m) / k_m))); 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, 3e-43], N[(2.0 / N[(N[(t$95$1 * t), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] * t), $MachinePrecision] / l), $MachinePrecision] / l), $MachinePrecision] * N[(k$95$m / N[(N[Cos[k$95$m], $MachinePrecision] / k$95$m), $MachinePrecision]), $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 3 \cdot 10^{-43}:\\
\;\;\;\;\frac{2}{\left(t\_1 \cdot t\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{\frac{\left(k\_m \cdot k\_m\right) \cdot t}{\ell}}{\ell} \cdot \frac{k\_m}{\frac{\cos k\_m}{k\_m}}}\\
\end{array}
\end{array}
if k < 3.00000000000000003e-43Initial 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.f6474.3
Applied rewrites74.3%
Applied rewrites14.5%
Applied rewrites68.4%
Applied rewrites81.4%
if 3.00000000000000003e-43 < k Initial program 26.3%
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 rewrites94.3%
Taylor expanded in k around 0
Applied rewrites61.9%
Applied rewrites62.0%
Final simplification76.1%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= (* l l) 5e-218)
(/ 2.0 (* (* t_1 t) t_1))
(/ 2.0 (* (* (/ (* (* k_m k_m) t) l) k_m) (/ (/ k_m (cos 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) <= 5e-218) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / (((((k_m * k_m) * t) / l) * k_m) * ((k_m / cos(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) <= 5d-218) then
tmp = 2.0d0 / ((t_1 * t) * t_1)
else
tmp = 2.0d0 / (((((k_m * k_m) * t) / l) * k_m) * ((k_m / cos(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) <= 5e-218) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / (((((k_m * k_m) * t) / l) * k_m) * ((k_m / Math.cos(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) <= 5e-218: tmp = 2.0 / ((t_1 * t) * t_1) else: tmp = 2.0 / (((((k_m * k_m) * t) / l) * k_m) * ((k_m / math.cos(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) <= 5e-218) tmp = Float64(2.0 / Float64(Float64(t_1 * t) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64(Float64(k_m * k_m) * t) / l) * k_m) * Float64(Float64(k_m / cos(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) <= 5e-218) tmp = 2.0 / ((t_1 * t) * t_1); else tmp = 2.0 / (((((k_m * k_m) * t) / l) * k_m) * ((k_m / cos(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], 5e-218], N[(2.0 / N[(N[(t$95$1 * t), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] * t), $MachinePrecision] / l), $MachinePrecision] * k$95$m), $MachinePrecision] * N[(N[(k$95$m / N[Cos[k$95$m], $MachinePrecision]), $MachinePrecision] / 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 5 \cdot 10^{-218}:\\
\;\;\;\;\frac{2}{\left(t\_1 \cdot t\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\frac{\left(k\_m \cdot k\_m\right) \cdot t}{\ell} \cdot k\_m\right) \cdot \frac{\frac{k\_m}{\cos k\_m}}{\ell}}\\
\end{array}
\end{array}
if (*.f64 l l) < 5.00000000000000041e-218Initial program 27.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.f6483.5
Applied rewrites83.5%
Applied rewrites26.3%
Applied rewrites70.7%
Applied rewrites96.3%
if 5.00000000000000041e-218 < (*.f64 l l) Initial program 39.1%
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 rewrites93.3%
Taylor expanded in k around 0
Applied rewrites68.2%
Applied rewrites68.3%
Final simplification77.0%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= (* l l) 2e-211)
(/ 2.0 (* (* t_1 t) t_1))
(/ 2.0 (/ (* (* (* (* k_m k_m) t) (/ k_m l)) k_m) (* (cos 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) <= 2e-211) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / (((((k_m * k_m) * t) * (k_m / l)) * k_m) / (cos(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) <= 2d-211) then
tmp = 2.0d0 / ((t_1 * t) * t_1)
else
tmp = 2.0d0 / (((((k_m * k_m) * t) * (k_m / l)) * k_m) / (cos(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) <= 2e-211) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / (((((k_m * k_m) * t) * (k_m / l)) * k_m) / (Math.cos(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) <= 2e-211: tmp = 2.0 / ((t_1 * t) * t_1) else: tmp = 2.0 / (((((k_m * k_m) * t) * (k_m / l)) * k_m) / (math.cos(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) <= 2e-211) tmp = Float64(2.0 / Float64(Float64(t_1 * t) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64(Float64(k_m * k_m) * t) * Float64(k_m / l)) * k_m) / Float64(cos(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) <= 2e-211) tmp = 2.0 / ((t_1 * t) * t_1); else tmp = 2.0 / (((((k_m * k_m) * t) * (k_m / l)) * k_m) / (cos(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], 2e-211], N[(2.0 / N[(N[(t$95$1 * t), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] * t), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision] * k$95$m), $MachinePrecision] / N[(N[Cos[k$95$m], $MachinePrecision] * 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 2 \cdot 10^{-211}:\\
\;\;\;\;\frac{2}{\left(t\_1 \cdot t\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{\left(\left(\left(k\_m \cdot k\_m\right) \cdot t\right) \cdot \frac{k\_m}{\ell}\right) \cdot k\_m}{\cos k\_m \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 l l) < 2.00000000000000017e-211Initial program 28.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.f6483.9
Applied rewrites83.9%
Applied rewrites25.6%
Applied rewrites71.4%
Applied rewrites96.4%
if 2.00000000000000017e-211 < (*.f64 l l) Initial program 38.9%
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 rewrites93.3%
Taylor expanded in k around 0
Applied rewrites67.9%
Applied rewrites67.9%
Final simplification77.0%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (let* ((t_1 (* (/ k_m l) k_m))) (/ 2.0 (* (* t_1 t) 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_1 * t) * 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_1 * t) * 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_1 * t) * t_1);
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m return 2.0 / ((t_1 * t) * 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_1 * t) * 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_1 * t) * 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$95$1 * t), $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\_1 \cdot t\right) \cdot t\_1}
\end{array}
\end{array}
Initial program 35.5%
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.f6469.7
Applied rewrites69.7%
Applied rewrites20.9%
Applied rewrites64.6%
Applied rewrites75.2%
Final simplification75.2%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ 2.0 (* (/ (* (* (* k_m k_m) t) k_m) l) (/ k_m l))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 2.0 / (((((k_m * k_m) * t) * k_m) / l) * (k_m / l));
}
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) * (k_m / l))
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) * (k_m / l));
}
k_m = math.fabs(k) def code(t, l, k_m): return 2.0 / (((((k_m * k_m) * t) * k_m) / l) * (k_m / l))
k_m = abs(k) function code(t, l, k_m) return Float64(2.0 / Float64(Float64(Float64(Float64(Float64(k_m * k_m) * t) * k_m) / l) * Float64(k_m / l))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 2.0 / (((((k_m * k_m) * t) * k_m) / l) * (k_m / l)); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(2.0 / N[(N[(N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] * t), $MachinePrecision] * k$95$m), $MachinePrecision] / l), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{2}{\frac{\left(\left(k\_m \cdot k\_m\right) \cdot t\right) \cdot k\_m}{\ell} \cdot \frac{k\_m}{\ell}}
\end{array}
Initial program 35.5%
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 rewrites90.6%
Taylor expanded in k around 0
Applied rewrites72.2%
Taylor expanded in k around 0
Applied rewrites70.5%
Final simplification70.5%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ 2.0 (* (* (/ (* k_m k_m) (* l l)) (* k_m k_m)) t)))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 2.0 / ((((k_m * k_m) / (l * l)) * (k_m * 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 = 2.0d0 / ((((k_m * k_m) / (l * l)) * (k_m * k_m)) * t)
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) / (l * l)) * (k_m * k_m)) * t);
}
k_m = math.fabs(k) def code(t, l, k_m): return 2.0 / ((((k_m * k_m) / (l * l)) * (k_m * k_m)) * t)
k_m = abs(k) function code(t, l, k_m) return Float64(2.0 / Float64(Float64(Float64(Float64(k_m * k_m) / Float64(l * l)) * Float64(k_m * k_m)) * t)) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 2.0 / ((((k_m * k_m) / (l * l)) * (k_m * k_m)) * t); 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[(l * l), $MachinePrecision]), $MachinePrecision] * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{2}{\left(\frac{k\_m \cdot k\_m}{\ell \cdot \ell} \cdot \left(k\_m \cdot k\_m\right)\right) \cdot t}
\end{array}
Initial program 35.5%
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.f6469.7
Applied rewrites69.7%
Applied rewrites65.8%
Final simplification65.8%
herbie shell --seed 2024242
(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))))