
(FPCore (t l k) :precision binary64 (/ 2.0 (* (* (* (/ (pow t 3.0) (* l l)) (sin k)) (tan k)) (- (+ 1.0 (pow (/ k t) 2.0)) 1.0))))
double code(double t, double l, double k) {
return 2.0 / ((((pow(t, 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + pow((k / t), 2.0)) - 1.0));
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
code = 2.0d0 / (((((t ** 3.0d0) / (l * l)) * sin(k)) * tan(k)) * ((1.0d0 + ((k / t) ** 2.0d0)) - 1.0d0))
end function
public static double code(double t, double l, double k) {
return 2.0 / ((((Math.pow(t, 3.0) / (l * l)) * Math.sin(k)) * Math.tan(k)) * ((1.0 + Math.pow((k / t), 2.0)) - 1.0));
}
def code(t, l, k): return 2.0 / ((((math.pow(t, 3.0) / (l * l)) * math.sin(k)) * math.tan(k)) * ((1.0 + math.pow((k / t), 2.0)) - 1.0))
function code(t, l, k) return Float64(2.0 / Float64(Float64(Float64(Float64((t ^ 3.0) / Float64(l * l)) * sin(k)) * tan(k)) * Float64(Float64(1.0 + (Float64(k / t) ^ 2.0)) - 1.0))) end
function tmp = code(t, l, k) tmp = 2.0 / (((((t ^ 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + ((k / t) ^ 2.0)) - 1.0)); end
code[t_, l_, k_] := N[(2.0 / N[(N[(N[(N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision] * N[Sin[k], $MachinePrecision]), $MachinePrecision] * N[Tan[k], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\left(\left(\frac{{t}^{3}}{\ell \cdot \ell} \cdot \sin k\right) \cdot \tan k\right) \cdot \left(\left(1 + {\left(\frac{k}{t}\right)}^{2}\right) - 1\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (t l k) :precision binary64 (/ 2.0 (* (* (* (/ (pow t 3.0) (* l l)) (sin k)) (tan k)) (- (+ 1.0 (pow (/ k t) 2.0)) 1.0))))
double code(double t, double l, double k) {
return 2.0 / ((((pow(t, 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + pow((k / t), 2.0)) - 1.0));
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
code = 2.0d0 / (((((t ** 3.0d0) / (l * l)) * sin(k)) * tan(k)) * ((1.0d0 + ((k / t) ** 2.0d0)) - 1.0d0))
end function
public static double code(double t, double l, double k) {
return 2.0 / ((((Math.pow(t, 3.0) / (l * l)) * Math.sin(k)) * Math.tan(k)) * ((1.0 + Math.pow((k / t), 2.0)) - 1.0));
}
def code(t, l, k): return 2.0 / ((((math.pow(t, 3.0) / (l * l)) * math.sin(k)) * math.tan(k)) * ((1.0 + math.pow((k / t), 2.0)) - 1.0))
function code(t, l, k) return Float64(2.0 / Float64(Float64(Float64(Float64((t ^ 3.0) / Float64(l * l)) * sin(k)) * tan(k)) * Float64(Float64(1.0 + (Float64(k / t) ^ 2.0)) - 1.0))) end
function tmp = code(t, l, k) tmp = 2.0 / (((((t ^ 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + ((k / t) ^ 2.0)) - 1.0)); end
code[t_, l_, k_] := N[(2.0 / N[(N[(N[(N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision] * N[Sin[k], $MachinePrecision]), $MachinePrecision] * N[Tan[k], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\left(\left(\frac{{t}^{3}}{\ell \cdot \ell} \cdot \sin k\right) \cdot \tan k\right) \cdot \left(\left(1 + {\left(\frac{k}{t}\right)}^{2}\right) - 1\right)}
\end{array}
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 1e-118) (/ 2.0 (* (* (pow (/ k_m l) 2.0) k_m) (* k_m t))) (/ 2.0 (* (* (* (tan k_m) (sin k_m)) (/ k_m l)) (* (/ k_m l) t)))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 1e-118) {
tmp = 2.0 / ((pow((k_m / l), 2.0) * k_m) * (k_m * t));
} else {
tmp = 2.0 / (((tan(k_m) * sin(k_m)) * (k_m / l)) * ((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) :: tmp
if (k_m <= 1d-118) then
tmp = 2.0d0 / ((((k_m / l) ** 2.0d0) * k_m) * (k_m * t))
else
tmp = 2.0d0 / (((tan(k_m) * sin(k_m)) * (k_m / l)) * ((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 tmp;
if (k_m <= 1e-118) {
tmp = 2.0 / ((Math.pow((k_m / l), 2.0) * k_m) * (k_m * t));
} else {
tmp = 2.0 / (((Math.tan(k_m) * Math.sin(k_m)) * (k_m / l)) * ((k_m / l) * t));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 1e-118: tmp = 2.0 / ((math.pow((k_m / l), 2.0) * k_m) * (k_m * t)) else: tmp = 2.0 / (((math.tan(k_m) * math.sin(k_m)) * (k_m / l)) * ((k_m / l) * t)) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 1e-118) tmp = Float64(2.0 / Float64(Float64((Float64(k_m / l) ^ 2.0) * k_m) * Float64(k_m * t))); else tmp = Float64(2.0 / Float64(Float64(Float64(tan(k_m) * sin(k_m)) * Float64(k_m / l)) * Float64(Float64(k_m / l) * t))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 1e-118) tmp = 2.0 / ((((k_m / l) ^ 2.0) * k_m) * (k_m * t)); else tmp = 2.0 / (((tan(k_m) * sin(k_m)) * (k_m / l)) * ((k_m / l) * t)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 1e-118], N[(2.0 / N[(N[(N[Power[N[(k$95$m / l), $MachinePrecision], 2.0], $MachinePrecision] * k$95$m), $MachinePrecision] * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[Tan[k$95$m], $MachinePrecision] * N[Sin[k$95$m], $MachinePrecision]), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision] * N[(N[(k$95$m / l), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 10^{-118}:\\
\;\;\;\;\frac{2}{\left({\left(\frac{k\_m}{\ell}\right)}^{2} \cdot k\_m\right) \cdot \left(k\_m \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\left(\left(\tan k\_m \cdot \sin k\_m\right) \cdot \frac{k\_m}{\ell}\right) \cdot \left(\frac{k\_m}{\ell} \cdot t\right)}\\
\end{array}
\end{array}
if k < 9.99999999999999985e-119Initial program 35.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.f6466.5
Applied rewrites66.5%
Applied rewrites64.1%
Applied rewrites74.8%
if 9.99999999999999985e-119 < k Initial program 33.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites90.0%
Applied rewrites99.5%
Applied rewrites91.0%
Applied rewrites99.5%
Final simplification83.5%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 1.2e-79) (/ 2.0 (* (* (pow (/ k_m l) 2.0) k_m) (* k_m t))) (/ 2.0 (/ (* (* (* (tan k_m) (sin k_m)) (* k_m t)) k_m) (* l l)))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 1.2e-79) {
tmp = 2.0 / ((pow((k_m / l), 2.0) * k_m) * (k_m * t));
} else {
tmp = 2.0 / ((((tan(k_m) * sin(k_m)) * (k_m * t)) * k_m) / (l * l));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 1.2d-79) then
tmp = 2.0d0 / ((((k_m / l) ** 2.0d0) * k_m) * (k_m * t))
else
tmp = 2.0d0 / ((((tan(k_m) * sin(k_m)) * (k_m * t)) * k_m) / (l * l))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 1.2e-79) {
tmp = 2.0 / ((Math.pow((k_m / l), 2.0) * k_m) * (k_m * t));
} else {
tmp = 2.0 / ((((Math.tan(k_m) * Math.sin(k_m)) * (k_m * t)) * k_m) / (l * l));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 1.2e-79: tmp = 2.0 / ((math.pow((k_m / l), 2.0) * k_m) * (k_m * t)) else: tmp = 2.0 / ((((math.tan(k_m) * math.sin(k_m)) * (k_m * t)) * k_m) / (l * l)) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 1.2e-79) tmp = Float64(2.0 / Float64(Float64((Float64(k_m / l) ^ 2.0) * k_m) * Float64(k_m * t))); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64(tan(k_m) * sin(k_m)) * Float64(k_m * t)) * k_m) / Float64(l * l))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 1.2e-79) tmp = 2.0 / ((((k_m / l) ^ 2.0) * k_m) * (k_m * t)); else tmp = 2.0 / ((((tan(k_m) * sin(k_m)) * (k_m * t)) * k_m) / (l * l)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 1.2e-79], N[(2.0 / N[(N[(N[Power[N[(k$95$m / l), $MachinePrecision], 2.0], $MachinePrecision] * k$95$m), $MachinePrecision] * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[Tan[k$95$m], $MachinePrecision] * N[Sin[k$95$m], $MachinePrecision]), $MachinePrecision] * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] * k$95$m), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 1.2 \cdot 10^{-79}:\\
\;\;\;\;\frac{2}{\left({\left(\frac{k\_m}{\ell}\right)}^{2} \cdot k\_m\right) \cdot \left(k\_m \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{\left(\left(\tan k\_m \cdot \sin k\_m\right) \cdot \left(k\_m \cdot t\right)\right) \cdot k\_m}{\ell \cdot \ell}}\\
\end{array}
\end{array}
if k < 1.20000000000000003e-79Initial program 36.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.8
Applied rewrites66.8%
Applied rewrites64.1%
Applied rewrites75.3%
if 1.20000000000000003e-79 < k Initial program 32.8%
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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites90.8%
Applied rewrites99.5%
Applied rewrites90.7%
Applied rewrites70.0%
Final simplification73.5%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ 2.0 (* (* (tan k_m) (* (sin k_m) (* (/ k_m l) t))) (/ k_m l))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 2.0 / ((tan(k_m) * (sin(k_m) * ((k_m / l) * t))) * (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 / ((tan(k_m) * (sin(k_m) * ((k_m / l) * t))) * (k_m / l))
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return 2.0 / ((Math.tan(k_m) * (Math.sin(k_m) * ((k_m / l) * t))) * (k_m / l));
}
k_m = math.fabs(k) def code(t, l, k_m): return 2.0 / ((math.tan(k_m) * (math.sin(k_m) * ((k_m / l) * t))) * (k_m / l))
k_m = abs(k) function code(t, l, k_m) return Float64(2.0 / Float64(Float64(tan(k_m) * Float64(sin(k_m) * Float64(Float64(k_m / l) * t))) * Float64(k_m / l))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 2.0 / ((tan(k_m) * (sin(k_m) * ((k_m / l) * t))) * (k_m / l)); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(2.0 / N[(N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[(k$95$m / l), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{2}{\left(\tan k\_m \cdot \left(\sin k\_m \cdot \left(\frac{k\_m}{\ell} \cdot t\right)\right)\right) \cdot \frac{k\_m}{\ell}}
\end{array}
Initial program 35.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites91.3%
Applied rewrites96.5%
Applied rewrites91.9%
Applied rewrites98.6%
Final simplification98.6%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 1.2e-79) (/ 2.0 (* (* (pow (/ k_m l) 2.0) k_m) (* k_m t))) (/ 2.0 (/ (* (* (* (* k_m k_m) t) k_m) k_m) (* (* (cos k_m) l) l)))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 1.2e-79) {
tmp = 2.0 / ((pow((k_m / l), 2.0) * k_m) * (k_m * t));
} else {
tmp = 2.0 / (((((k_m * k_m) * t) * k_m) * k_m) / ((cos(k_m) * l) * l));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 1.2d-79) then
tmp = 2.0d0 / ((((k_m / l) ** 2.0d0) * k_m) * (k_m * t))
else
tmp = 2.0d0 / (((((k_m * k_m) * t) * k_m) * k_m) / ((cos(k_m) * l) * l))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 1.2e-79) {
tmp = 2.0 / ((Math.pow((k_m / l), 2.0) * k_m) * (k_m * t));
} else {
tmp = 2.0 / (((((k_m * k_m) * t) * k_m) * k_m) / ((Math.cos(k_m) * l) * l));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 1.2e-79: tmp = 2.0 / ((math.pow((k_m / l), 2.0) * k_m) * (k_m * t)) else: tmp = 2.0 / (((((k_m * k_m) * t) * k_m) * k_m) / ((math.cos(k_m) * l) * l)) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 1.2e-79) tmp = Float64(2.0 / Float64(Float64((Float64(k_m / l) ^ 2.0) * k_m) * Float64(k_m * t))); else tmp = Float64(2.0 / Float64(Float64(Float64(Float64(Float64(k_m * k_m) * t) * k_m) * k_m) / Float64(Float64(cos(k_m) * l) * l))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 1.2e-79) tmp = 2.0 / ((((k_m / l) ^ 2.0) * k_m) * (k_m * t)); else tmp = 2.0 / (((((k_m * k_m) * t) * k_m) * k_m) / ((cos(k_m) * l) * l)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 1.2e-79], N[(2.0 / N[(N[(N[Power[N[(k$95$m / l), $MachinePrecision], 2.0], $MachinePrecision] * k$95$m), $MachinePrecision] * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] * t), $MachinePrecision] * k$95$m), $MachinePrecision] * k$95$m), $MachinePrecision] / N[(N[(N[Cos[k$95$m], $MachinePrecision] * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 1.2 \cdot 10^{-79}:\\
\;\;\;\;\frac{2}{\left({\left(\frac{k\_m}{\ell}\right)}^{2} \cdot k\_m\right) \cdot \left(k\_m \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{\left(\left(\left(k\_m \cdot k\_m\right) \cdot t\right) \cdot k\_m\right) \cdot k\_m}{\left(\cos k\_m \cdot \ell\right) \cdot \ell}}\\
\end{array}
\end{array}
if k < 1.20000000000000003e-79Initial program 36.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.8
Applied rewrites66.8%
Applied rewrites64.1%
Applied rewrites75.3%
if 1.20000000000000003e-79 < k Initial program 32.8%
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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites90.8%
Applied rewrites70.1%
Taylor expanded in k around 0
Applied rewrites56.7%
Final simplification69.0%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ 2.0 (* (* (* (pow (/ k_m l) 2.0) t) k_m) k_m)))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 2.0 / (((pow((k_m / l), 2.0) * t) * k_m) * 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 / l) ** 2.0d0) * t) * k_m) * k_m)
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return 2.0 / (((Math.pow((k_m / l), 2.0) * t) * k_m) * k_m);
}
k_m = math.fabs(k) def code(t, l, k_m): return 2.0 / (((math.pow((k_m / l), 2.0) * t) * k_m) * k_m)
k_m = abs(k) function code(t, l, k_m) return Float64(2.0 / Float64(Float64(Float64((Float64(k_m / l) ^ 2.0) * t) * k_m) * k_m)) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 2.0 / (((((k_m / l) ^ 2.0) * t) * k_m) * k_m); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(2.0 / N[(N[(N[(N[Power[N[(k$95$m / l), $MachinePrecision], 2.0], $MachinePrecision] * t), $MachinePrecision] * k$95$m), $MachinePrecision] * k$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{2}{\left(\left({\left(\frac{k\_m}{\ell}\right)}^{2} \cdot t\right) \cdot k\_m\right) \cdot k\_m}
\end{array}
Initial program 35.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.f6462.7
Applied rewrites62.7%
Applied rewrites60.9%
Applied rewrites68.9%
Final simplification68.9%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= k_m 5400.0)
(/
2.0
(*
(*
(/ (* k_m t) l)
(*
(*
(fma
(fma 0.08611111111111111 (* k_m k_m) 0.16666666666666666)
(* k_m k_m)
1.0)
k_m)
k_m))
(/ k_m l)))
(* (/ -0.3333333333333333 k_m) (/ (/ (* l l) t) k_m))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 5400.0) {
tmp = 2.0 / ((((k_m * t) / l) * ((fma(fma(0.08611111111111111, (k_m * k_m), 0.16666666666666666), (k_m * k_m), 1.0) * k_m) * k_m)) * (k_m / l));
} else {
tmp = (-0.3333333333333333 / k_m) * (((l * l) / t) / k_m);
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 5400.0) tmp = Float64(2.0 / Float64(Float64(Float64(Float64(k_m * t) / l) * Float64(Float64(fma(fma(0.08611111111111111, Float64(k_m * k_m), 0.16666666666666666), Float64(k_m * k_m), 1.0) * k_m) * k_m)) * Float64(k_m / l))); else tmp = Float64(Float64(-0.3333333333333333 / k_m) * Float64(Float64(Float64(l * l) / t) / k_m)); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 5400.0], N[(2.0 / N[(N[(N[(N[(k$95$m * t), $MachinePrecision] / l), $MachinePrecision] * N[(N[(N[(N[(0.08611111111111111 * N[(k$95$m * k$95$m), $MachinePrecision] + 0.16666666666666666), $MachinePrecision] * N[(k$95$m * k$95$m), $MachinePrecision] + 1.0), $MachinePrecision] * k$95$m), $MachinePrecision] * k$95$m), $MachinePrecision]), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-0.3333333333333333 / k$95$m), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] / t), $MachinePrecision] / k$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 5400:\\
\;\;\;\;\frac{2}{\left(\frac{k\_m \cdot t}{\ell} \cdot \left(\left(\mathsf{fma}\left(\mathsf{fma}\left(0.08611111111111111, k\_m \cdot k\_m, 0.16666666666666666\right), k\_m \cdot k\_m, 1\right) \cdot k\_m\right) \cdot k\_m\right)\right) \cdot \frac{k\_m}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-0.3333333333333333}{k\_m} \cdot \frac{\frac{\ell \cdot \ell}{t}}{k\_m}\\
\end{array}
\end{array}
if k < 5400Initial program 36.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites91.9%
Applied rewrites95.5%
Applied rewrites92.7%
Taylor expanded in k around 0
Applied rewrites73.8%
if 5400 < k Initial program 32.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites89.8%
Taylor expanded in k around 0
+-commutativeN/A
div-addN/A
associate-*r/N/A
associate-/r*N/A
*-commutativeN/A
associate-*r/N/A
associate-/l/N/A
*-commutativeN/A
div-add-revN/A
lower-/.f64N/A
Applied rewrites19.9%
Taylor expanded in k around inf
Applied rewrites47.3%
Final simplification66.7%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<= k_m 5400.0)
(/
2.0
(*
(*
(* (* (fma 0.16666666666666666 (* k_m k_m) 1.0) k_m) k_m)
(/ (* k_m t) l))
(/ k_m l)))
(* (/ -0.3333333333333333 k_m) (/ (/ (* l l) t) k_m))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 5400.0) {
tmp = 2.0 / ((((fma(0.16666666666666666, (k_m * k_m), 1.0) * k_m) * k_m) * ((k_m * t) / l)) * (k_m / l));
} else {
tmp = (-0.3333333333333333 / k_m) * (((l * l) / t) / k_m);
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 5400.0) tmp = Float64(2.0 / Float64(Float64(Float64(Float64(fma(0.16666666666666666, Float64(k_m * k_m), 1.0) * k_m) * k_m) * Float64(Float64(k_m * t) / l)) * Float64(k_m / l))); else tmp = Float64(Float64(-0.3333333333333333 / k_m) * Float64(Float64(Float64(l * l) / t) / k_m)); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 5400.0], N[(2.0 / N[(N[(N[(N[(N[(0.16666666666666666 * N[(k$95$m * k$95$m), $MachinePrecision] + 1.0), $MachinePrecision] * k$95$m), $MachinePrecision] * k$95$m), $MachinePrecision] * N[(N[(k$95$m * t), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(k$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-0.3333333333333333 / k$95$m), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] / t), $MachinePrecision] / k$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 5400:\\
\;\;\;\;\frac{2}{\left(\left(\left(\mathsf{fma}\left(0.16666666666666666, k\_m \cdot k\_m, 1\right) \cdot k\_m\right) \cdot k\_m\right) \cdot \frac{k\_m \cdot t}{\ell}\right) \cdot \frac{k\_m}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-0.3333333333333333}{k\_m} \cdot \frac{\frac{\ell \cdot \ell}{t}}{k\_m}\\
\end{array}
\end{array}
if k < 5400Initial program 36.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites91.9%
Applied rewrites95.5%
Applied rewrites92.7%
Taylor expanded in k around 0
Applied rewrites73.7%
if 5400 < k Initial program 32.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites89.8%
Taylor expanded in k around 0
+-commutativeN/A
div-addN/A
associate-*r/N/A
associate-/r*N/A
*-commutativeN/A
associate-*r/N/A
associate-/l/N/A
*-commutativeN/A
div-add-revN/A
lower-/.f64N/A
Applied rewrites19.9%
Taylor expanded in k around inf
Applied rewrites47.3%
Final simplification66.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-277)
(/ 2.0 (* (* t_1 t_1) t))
(/ (/ (* (/ (* l l) t) 2.0) (* k_m k_m)) (* 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 ((l * l) <= 1e-277) {
tmp = 2.0 / ((t_1 * t_1) * t);
} else {
tmp = ((((l * l) / t) * 2.0) / (k_m * k_m)) / (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 ((l * l) <= 1d-277) then
tmp = 2.0d0 / ((t_1 * t_1) * t)
else
tmp = ((((l * l) / t) * 2.0d0) / (k_m * k_m)) / (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 ((l * l) <= 1e-277) {
tmp = 2.0 / ((t_1 * t_1) * t);
} else {
tmp = ((((l * l) / t) * 2.0) / (k_m * k_m)) / (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 (l * l) <= 1e-277: tmp = 2.0 / ((t_1 * t_1) * t) else: tmp = ((((l * l) / t) * 2.0) / (k_m * k_m)) / (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 (Float64(l * l) <= 1e-277) tmp = Float64(2.0 / Float64(Float64(t_1 * t_1) * t)); else tmp = Float64(Float64(Float64(Float64(Float64(l * l) / t) * 2.0) / Float64(k_m * k_m)) / Float64(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 ((l * l) <= 1e-277) tmp = 2.0 / ((t_1 * t_1) * t); else tmp = ((((l * l) / t) * 2.0) / (k_m * k_m)) / (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[N[(l * l), $MachinePrecision], 1e-277], N[(2.0 / N[(N[(t$95$1 * t$95$1), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(l * l), $MachinePrecision] / t), $MachinePrecision] * 2.0), $MachinePrecision] / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision] / N[(k$95$m * k$95$m), $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^{-277}:\\
\;\;\;\;\frac{2}{\left(t\_1 \cdot t\_1\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\ell \cdot \ell}{t} \cdot 2}{k\_m \cdot k\_m}}{k\_m \cdot k\_m}\\
\end{array}
\end{array}
if (*.f64 l l) < 9.99999999999999969e-278Initial program 27.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.9
Applied rewrites76.9%
Applied rewrites66.2%
Applied rewrites87.2%
if 9.99999999999999969e-278 < (*.f64 l l) Initial program 37.7%
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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites93.1%
Taylor expanded in k around 0
lower-/.f64N/A
Applied rewrites24.7%
Taylor expanded in k around 0
Applied rewrites58.8%
Applied rewrites61.4%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= l 1.1e-132) (/ 2.0 (* (* (/ (* k_m k_m) (* l l)) (* k_m k_m)) t)) (/ (/ (* (/ (* l l) t) 2.0) (* k_m k_m)) (* k_m k_m))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (l <= 1.1e-132) {
tmp = 2.0 / ((((k_m * k_m) / (l * l)) * (k_m * k_m)) * t);
} else {
tmp = ((((l * l) / t) * 2.0) / (k_m * k_m)) / (k_m * k_m);
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (l <= 1.1d-132) then
tmp = 2.0d0 / ((((k_m * k_m) / (l * l)) * (k_m * k_m)) * t)
else
tmp = ((((l * l) / t) * 2.0d0) / (k_m * k_m)) / (k_m * k_m)
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (l <= 1.1e-132) {
tmp = 2.0 / ((((k_m * k_m) / (l * l)) * (k_m * k_m)) * t);
} else {
tmp = ((((l * l) / t) * 2.0) / (k_m * k_m)) / (k_m * k_m);
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if l <= 1.1e-132: tmp = 2.0 / ((((k_m * k_m) / (l * l)) * (k_m * k_m)) * t) else: tmp = ((((l * l) / t) * 2.0) / (k_m * k_m)) / (k_m * k_m) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (l <= 1.1e-132) tmp = Float64(2.0 / Float64(Float64(Float64(Float64(k_m * k_m) / Float64(l * l)) * Float64(k_m * k_m)) * t)); else tmp = Float64(Float64(Float64(Float64(Float64(l * l) / t) * 2.0) / Float64(k_m * k_m)) / Float64(k_m * k_m)); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (l <= 1.1e-132) tmp = 2.0 / ((((k_m * k_m) / (l * l)) * (k_m * k_m)) * t); else tmp = ((((l * l) / t) * 2.0) / (k_m * k_m)) / (k_m * k_m); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[l, 1.1e-132], 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], N[(N[(N[(N[(N[(l * l), $MachinePrecision] / t), $MachinePrecision] * 2.0), $MachinePrecision] / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision] / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.1 \cdot 10^{-132}:\\
\;\;\;\;\frac{2}{\left(\frac{k\_m \cdot k\_m}{\ell \cdot \ell} \cdot \left(k\_m \cdot k\_m\right)\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\ell \cdot \ell}{t} \cdot 2}{k\_m \cdot k\_m}}{k\_m \cdot k\_m}\\
\end{array}
\end{array}
if l < 1.09999999999999995e-132Initial program 31.8%
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.2
Applied rewrites66.2%
Applied rewrites63.3%
if 1.09999999999999995e-132 < l Initial program 39.8%
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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites94.3%
Taylor expanded in k around 0
lower-/.f64N/A
Applied rewrites29.3%
Taylor expanded in k around 0
Applied rewrites59.9%
Applied rewrites60.0%
Final simplification62.0%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ 2.0 (* (* (* (/ k_m (* l l)) k_m) (* k_m k_m)) t)))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 2.0 / ((((k_m / (l * l)) * k_m) * (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 / (l * l)) * k_m) * (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 / (l * l)) * k_m) * (k_m * k_m)) * t);
}
k_m = math.fabs(k) def code(t, l, k_m): return 2.0 / ((((k_m / (l * l)) * k_m) * (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 / Float64(l * l)) * k_m) * Float64(k_m * k_m)) * t)) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 2.0 / ((((k_m / (l * l)) * k_m) * (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 / N[(l * l), $MachinePrecision]), $MachinePrecision] * k$95$m), $MachinePrecision] * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{2}{\left(\left(\frac{k\_m}{\ell \cdot \ell} \cdot k\_m\right) \cdot \left(k\_m \cdot k\_m\right)\right) \cdot t}
\end{array}
Initial program 35.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.f6462.7
Applied rewrites62.7%
Applied rewrites60.9%
Applied rewrites60.9%
Final simplification60.9%
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.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.f6462.7
Applied rewrites62.7%
Applied rewrites60.9%
Final simplification60.9%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* (/ -0.3333333333333333 k_m) (/ (/ (* l l) t) k_m)))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return (-0.3333333333333333 / k_m) * (((l * l) / t) / k_m);
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = ((-0.3333333333333333d0) / k_m) * (((l * l) / t) / k_m)
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return (-0.3333333333333333 / k_m) * (((l * l) / t) / k_m);
}
k_m = math.fabs(k) def code(t, l, k_m): return (-0.3333333333333333 / k_m) * (((l * l) / t) / k_m)
k_m = abs(k) function code(t, l, k_m) return Float64(Float64(-0.3333333333333333 / k_m) * Float64(Float64(Float64(l * l) / t) / k_m)) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = (-0.3333333333333333 / k_m) * (((l * l) / t) / k_m); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(N[(-0.3333333333333333 / k$95$m), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] / t), $MachinePrecision] / k$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{-0.3333333333333333}{k\_m} \cdot \frac{\frac{\ell \cdot \ell}{t}}{k\_m}
\end{array}
Initial program 35.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites91.3%
Taylor expanded in k around 0
+-commutativeN/A
div-addN/A
associate-*r/N/A
associate-/r*N/A
*-commutativeN/A
associate-*r/N/A
associate-/l/N/A
*-commutativeN/A
div-add-revN/A
lower-/.f64N/A
Applied rewrites35.8%
Taylor expanded in k around inf
Applied rewrites29.6%
Final simplification29.6%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ 1.0 (/ t (* -0.11666666666666667 (* l l)))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 1.0 / (t / (-0.11666666666666667 * (l * 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 = 1.0d0 / (t / ((-0.11666666666666667d0) * (l * l)))
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return 1.0 / (t / (-0.11666666666666667 * (l * l)));
}
k_m = math.fabs(k) def code(t, l, k_m): return 1.0 / (t / (-0.11666666666666667 * (l * l)))
k_m = abs(k) function code(t, l, k_m) return Float64(1.0 / Float64(t / Float64(-0.11666666666666667 * Float64(l * l)))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 1.0 / (t / (-0.11666666666666667 * (l * l))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(1.0 / N[(t / N[(-0.11666666666666667 * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{1}{\frac{t}{-0.11666666666666667 \cdot \left(\ell \cdot \ell\right)}}
\end{array}
Initial program 35.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites91.3%
Taylor expanded in k around 0
lower-/.f64N/A
Applied rewrites27.1%
Taylor expanded in k around inf
Applied rewrites20.3%
Applied rewrites20.3%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ (* -0.11666666666666667 (* l l)) t))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return (-0.11666666666666667 * (l * l)) / 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 = ((-0.11666666666666667d0) * (l * l)) / t
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return (-0.11666666666666667 * (l * l)) / t;
}
k_m = math.fabs(k) def code(t, l, k_m): return (-0.11666666666666667 * (l * l)) / t
k_m = abs(k) function code(t, l, k_m) return Float64(Float64(-0.11666666666666667 * Float64(l * l)) / t) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = (-0.11666666666666667 * (l * l)) / t; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(N[(-0.11666666666666667 * N[(l * l), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{-0.11666666666666667 \cdot \left(\ell \cdot \ell\right)}{t}
\end{array}
Initial program 35.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites91.3%
Taylor expanded in k around 0
lower-/.f64N/A
Applied rewrites27.1%
Taylor expanded in k around inf
Applied rewrites20.3%
Applied rewrites20.3%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* (/ -0.11666666666666667 t) (* l l)))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return (-0.11666666666666667 / t) * (l * 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 = ((-0.11666666666666667d0) / t) * (l * l)
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return (-0.11666666666666667 / t) * (l * l);
}
k_m = math.fabs(k) def code(t, l, k_m): return (-0.11666666666666667 / t) * (l * l)
k_m = abs(k) function code(t, l, k_m) return Float64(Float64(-0.11666666666666667 / t) * Float64(l * l)) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = (-0.11666666666666667 / t) * (l * l); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(N[(-0.11666666666666667 / t), $MachinePrecision] * N[(l * l), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{-0.11666666666666667}{t} \cdot \left(\ell \cdot \ell\right)
\end{array}
Initial program 35.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites91.3%
Taylor expanded in k around 0
lower-/.f64N/A
Applied rewrites27.1%
Taylor expanded in k around inf
Applied rewrites20.3%
Applied rewrites20.3%
Final simplification20.3%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* (* (/ l t) -0.11666666666666667) l))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return ((l / t) * -0.11666666666666667) * 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 = ((l / t) * (-0.11666666666666667d0)) * l
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return ((l / t) * -0.11666666666666667) * l;
}
k_m = math.fabs(k) def code(t, l, k_m): return ((l / t) * -0.11666666666666667) * l
k_m = abs(k) function code(t, l, k_m) return Float64(Float64(Float64(l / t) * -0.11666666666666667) * l) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = ((l / t) * -0.11666666666666667) * l; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(N[(N[(l / t), $MachinePrecision] * -0.11666666666666667), $MachinePrecision] * l), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\left(\frac{\ell}{t} \cdot -0.11666666666666667\right) \cdot \ell
\end{array}
Initial program 35.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
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-/.f64N/A
Applied rewrites91.3%
Taylor expanded in k around 0
lower-/.f64N/A
Applied rewrites27.1%
Taylor expanded in k around inf
Applied rewrites20.3%
Applied rewrites17.8%
Final simplification17.8%
herbie shell --seed 2024298
(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))))