
(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 1e-53)
(/ 2.0 (* (* t_1 t) t_1))
(/
2.0
(* (* (* (pow (sin k_m) 2.0) 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 (k_m <= 1e-53) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / (((pow(sin(k_m), 2.0) * 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 (k_m <= 1d-53) then
tmp = 2.0d0 / ((t_1 * t) * t_1)
else
tmp = 2.0d0 / ((((sin(k_m) ** 2.0d0) * 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 (k_m <= 1e-53) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / (((Math.pow(Math.sin(k_m), 2.0) * 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 k_m <= 1e-53: tmp = 2.0 / ((t_1 * t) * t_1) else: tmp = 2.0 / (((math.pow(math.sin(k_m), 2.0) * 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 (k_m <= 1e-53) tmp = Float64(2.0 / Float64(Float64(t_1 * t) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64((sin(k_m) ^ 2.0) * t) * Float64(k_m / l)) * Float64(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 (k_m <= 1e-53) tmp = 2.0 / ((t_1 * t) * t_1); else tmp = 2.0 / ((((sin(k_m) ^ 2.0) * 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[k$95$m, 1e-53], N[(2.0 / N[(N[(t$95$1 * t), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[Power[N[Sin[k$95$m], $MachinePrecision], 2.0], $MachinePrecision] * t), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision] * N[(k$95$m / N[(N[Cos[k$95$m], $MachinePrecision] * l), $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 10^{-53}:\\
\;\;\;\;\frac{2}{\left(t\_1 \cdot t\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\left({\sin k\_m}^{2} \cdot t\right) \cdot \frac{k\_m}{\ell}\right) \cdot \frac{k\_m}{\cos k\_m \cdot \ell}}\\
\end{array}
\end{array}
if k < 1.00000000000000003e-53Initial program 45.6%
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.f6475.6
Applied rewrites75.6%
Applied rewrites82.7%
Applied rewrites87.5%
if 1.00000000000000003e-53 < k Initial program 29.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 rewrites98.3%
Applied rewrites99.5%
Applied rewrites99.5%
Final simplification91.2%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= k_m 7.8e-60)
(/ 2.0 (* (* t_1 t) t_1))
(/ 2.0 (* (* (tan k_m) (sin k_m)) (/ (* (/ k_m l) t) (/ l 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 <= 7.8e-60) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / ((tan(k_m) * sin(k_m)) * (((k_m / l) * t) / (l / 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 <= 7.8d-60) then
tmp = 2.0d0 / ((t_1 * t) * t_1)
else
tmp = 2.0d0 / ((tan(k_m) * sin(k_m)) * (((k_m / l) * t) / (l / 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 <= 7.8e-60) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / ((Math.tan(k_m) * Math.sin(k_m)) * (((k_m / l) * t) / (l / 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 <= 7.8e-60: tmp = 2.0 / ((t_1 * t) * t_1) else: tmp = 2.0 / ((math.tan(k_m) * math.sin(k_m)) * (((k_m / l) * t) / (l / 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 <= 7.8e-60) tmp = Float64(2.0 / Float64(Float64(t_1 * t) * t_1)); else tmp = Float64(2.0 / Float64(Float64(tan(k_m) * sin(k_m)) * Float64(Float64(Float64(k_m / l) * t) / Float64(l / 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 <= 7.8e-60) tmp = 2.0 / ((t_1 * t) * t_1); else tmp = 2.0 / ((tan(k_m) * sin(k_m)) * (((k_m / l) * t) / (l / 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, 7.8e-60], N[(2.0 / N[(N[(t$95$1 * t), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[Tan[k$95$m], $MachinePrecision] * N[Sin[k$95$m], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(k$95$m / l), $MachinePrecision] * t), $MachinePrecision] / N[(l / 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 7.8 \cdot 10^{-60}:\\
\;\;\;\;\frac{2}{\left(t\_1 \cdot t\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\tan k\_m \cdot \sin k\_m\right) \cdot \frac{\frac{k\_m}{\ell} \cdot t}{\frac{\ell}{k\_m}}}\\
\end{array}
\end{array}
if k < 7.8000000000000004e-60Initial program 45.6%
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.f6475.6
Applied rewrites75.6%
Applied rewrites82.7%
Applied rewrites87.5%
if 7.8000000000000004e-60 < k Initial program 29.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 rewrites98.3%
Applied rewrites99.5%
Applied rewrites99.5%
Final simplification91.2%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= k_m 5.1e-5)
(/ 2.0 (* (* t_1 t) t_1))
(/ 2.0 (* (/ k_m l) (* (* (pow (sin k_m) 2.0) 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.1e-5) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / ((k_m / l) * ((pow(sin(k_m), 2.0) * 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.1d-5) then
tmp = 2.0d0 / ((t_1 * t) * t_1)
else
tmp = 2.0d0 / ((k_m / l) * (((sin(k_m) ** 2.0d0) * 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.1e-5) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / ((k_m / l) * ((Math.pow(Math.sin(k_m), 2.0) * 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.1e-5: tmp = 2.0 / ((t_1 * t) * t_1) else: tmp = 2.0 / ((k_m / l) * ((math.pow(math.sin(k_m), 2.0) * 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.1e-5) tmp = Float64(2.0 / Float64(Float64(t_1 * t) * t_1)); else tmp = Float64(2.0 / Float64(Float64(k_m / l) * Float64(Float64((sin(k_m) ^ 2.0) * 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.1e-5) tmp = 2.0 / ((t_1 * t) * t_1); else tmp = 2.0 / ((k_m / l) * (((sin(k_m) ^ 2.0) * 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.1e-5], N[(2.0 / N[(N[(t$95$1 * t), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(k$95$m / l), $MachinePrecision] * N[(N[(N[Power[N[Sin[k$95$m], $MachinePrecision], 2.0], $MachinePrecision] * t), $MachinePrecision] * N[(k$95$m / l), $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 5.1 \cdot 10^{-5}:\\
\;\;\;\;\frac{2}{\left(t\_1 \cdot t\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{k\_m}{\ell} \cdot \left(\left({\sin k\_m}^{2} \cdot t\right) \cdot \frac{k\_m}{\ell}\right)}\\
\end{array}
\end{array}
if k < 5.09999999999999996e-5Initial program 44.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.f6476.3
Applied rewrites76.3%
Applied rewrites83.0%
Applied rewrites88.1%
if 5.09999999999999996e-5 < k Initial program 30.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 rewrites98.1%
Applied rewrites99.5%
Taylor expanded in k around 0
Applied rewrites55.2%
Final simplification79.1%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (* (/ k_m l) k_m)))
(if (<= k_m 38000.0)
(/ 2.0 (* (* t_1 t) t_1))
(/ 2.0 (* (* (/ k_m (cos k_m)) (/ (/ k_m l) l)) (* (* k_m k_m) 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 <= 38000.0) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / (((k_m / cos(k_m)) * ((k_m / l) / l)) * ((k_m * 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) :: t_1
real(8) :: tmp
t_1 = (k_m / l) * k_m
if (k_m <= 38000.0d0) then
tmp = 2.0d0 / ((t_1 * t) * t_1)
else
tmp = 2.0d0 / (((k_m / cos(k_m)) * ((k_m / l) / l)) * ((k_m * 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 t_1 = (k_m / l) * k_m;
double tmp;
if (k_m <= 38000.0) {
tmp = 2.0 / ((t_1 * t) * t_1);
} else {
tmp = 2.0 / (((k_m / Math.cos(k_m)) * ((k_m / l) / l)) * ((k_m * k_m) * 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 <= 38000.0: tmp = 2.0 / ((t_1 * t) * t_1) else: tmp = 2.0 / (((k_m / math.cos(k_m)) * ((k_m / l) / l)) * ((k_m * k_m) * 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 <= 38000.0) tmp = Float64(2.0 / Float64(Float64(t_1 * t) * t_1)); else tmp = Float64(2.0 / Float64(Float64(Float64(k_m / cos(k_m)) * Float64(Float64(k_m / l) / l)) * Float64(Float64(k_m * k_m) * 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 <= 38000.0) tmp = 2.0 / ((t_1 * t) * t_1); else tmp = 2.0 / (((k_m / cos(k_m)) * ((k_m / l) / l)) * ((k_m * k_m) * 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, 38000.0], N[(2.0 / N[(N[(t$95$1 * t), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(k$95$m / N[Cos[k$95$m], $MachinePrecision]), $MachinePrecision] * N[(N[(k$95$m / l), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(N[(k$95$m * k$95$m), $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 38000:\\
\;\;\;\;\frac{2}{\left(t\_1 \cdot t\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\frac{k\_m}{\cos k\_m} \cdot \frac{\frac{k\_m}{\ell}}{\ell}\right) \cdot \left(\left(k\_m \cdot k\_m\right) \cdot t\right)}\\
\end{array}
\end{array}
if k < 38000Initial program 44.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.f6476.2
Applied rewrites76.2%
Applied rewrites82.9%
Applied rewrites87.8%
if 38000 < k Initial program 30.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%
Taylor expanded in k around 0
Applied rewrites48.9%
Applied rewrites53.1%
Final simplification78.7%
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 40.6%
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.5
Applied rewrites68.5%
Applied rewrites73.8%
Applied rewrites77.1%
Final simplification77.1%
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_1) t))))
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_1) * 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
real(8) :: t_1
t_1 = (k_m / l) * k_m
code = 2.0d0 / ((t_1 * t_1) * t)
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_1) * t);
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = (k_m / l) * k_m return 2.0 / ((t_1 * t_1) * t)
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_1) * t)) 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_1) * t); 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$95$1), $MachinePrecision] * t), $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\_1\right) \cdot t}
\end{array}
\end{array}
Initial program 40.6%
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.5
Applied rewrites68.5%
Applied rewrites73.8%
Applied rewrites75.3%
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(k_m * k_m) * t) * Float64(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[(k$95$m * k$95$m), $MachinePrecision] * t), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{2}{\left(\left(\left(k\_m \cdot k\_m\right) \cdot t\right) \cdot \frac{k\_m}{\ell}\right) \cdot \frac{k\_m}{\ell}}
\end{array}
Initial program 40.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 rewrites91.7%
Taylor expanded in k around 0
Applied rewrites72.2%
Taylor expanded in k around 0
Applied rewrites71.6%
Applied rewrites73.8%
Final simplification73.8%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ 2.0 (* (/ (* (* (* t k_m) k_m) k_m) l) (/ k_m l))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 2.0 / (((((t * k_m) * k_m) * 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 / (((((t * k_m) * k_m) * 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 / (((((t * k_m) * k_m) * k_m) / l) * (k_m / l));
}
k_m = math.fabs(k) def code(t, l, k_m): return 2.0 / (((((t * k_m) * k_m) * 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(t * k_m) * k_m) * k_m) / l) * Float64(k_m / l))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 2.0 / (((((t * k_m) * k_m) * 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[(t * k$95$m), $MachinePrecision] * k$95$m), $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(t \cdot k\_m\right) \cdot k\_m\right) \cdot k\_m}{\ell} \cdot \frac{k\_m}{\ell}}
\end{array}
Initial program 40.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 rewrites91.7%
Taylor expanded in k around 0
Applied rewrites72.2%
Taylor expanded in k around 0
Applied rewrites71.6%
Taylor expanded in k around 0
Applied rewrites71.8%
Final simplification71.8%
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 40.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 rewrites91.7%
Taylor expanded in k around 0
Applied rewrites72.2%
Taylor expanded in k around 0
Applied rewrites71.6%
Final simplification71.6%
herbie shell --seed 2024268
(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))))