
(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 15 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}
(FPCore (t l k) :precision binary64 (* (/ (/ 2.0 (/ k l)) t) (/ (/ (/ l (sin k)) (tan k)) k)))
double code(double t, double l, double k) {
return ((2.0 / (k / l)) / t) * (((l / sin(k)) / tan(k)) / k);
}
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 / (k / l)) / t) * (((l / sin(k)) / tan(k)) / k)
end function
public static double code(double t, double l, double k) {
return ((2.0 / (k / l)) / t) * (((l / Math.sin(k)) / Math.tan(k)) / k);
}
def code(t, l, k): return ((2.0 / (k / l)) / t) * (((l / math.sin(k)) / math.tan(k)) / k)
function code(t, l, k) return Float64(Float64(Float64(2.0 / Float64(k / l)) / t) * Float64(Float64(Float64(l / sin(k)) / tan(k)) / k)) end
function tmp = code(t, l, k) tmp = ((2.0 / (k / l)) / t) * (((l / sin(k)) / tan(k)) / k); end
code[t_, l_, k_] := N[(N[(N[(2.0 / N[(k / l), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] * N[(N[(N[(l / N[Sin[k], $MachinePrecision]), $MachinePrecision] / N[Tan[k], $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{2}{\frac{k}{\ell}}}{t} \cdot \frac{\frac{\frac{\ell}{\sin k}}{\tan k}}{k}
\end{array}
Initial program 36.8%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified66.0%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
Applied egg-rr87.2%
Taylor expanded in k around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6492.6%
Simplified92.6%
clear-numN/A
associate-*r/N/A
associate-/r*N/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6494.4%
Applied egg-rr94.4%
associate-*l/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6498.4%
Applied egg-rr98.4%
(FPCore (t l k)
:precision binary64
(if (<= k 6.2e-110)
(/
2.0
(/
(/ (* k t) (/ l k))
(/ (/ (+ 1.0 (* (* k k) 0.16666666666666666)) k) (/ k l))))
(* (/ (/ 2.0 k) (/ k (/ l t))) (/ l (* (sin k) (tan k))))))
double code(double t, double l, double k) {
double tmp;
if (k <= 6.2e-110) {
tmp = 2.0 / (((k * t) / (l / k)) / (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)));
} else {
tmp = ((2.0 / k) / (k / (l / t))) * (l / (sin(k) * tan(k)));
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (k <= 6.2d-110) then
tmp = 2.0d0 / (((k * t) / (l / k)) / (((1.0d0 + ((k * k) * 0.16666666666666666d0)) / k) / (k / l)))
else
tmp = ((2.0d0 / k) / (k / (l / t))) * (l / (sin(k) * tan(k)))
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 6.2e-110) {
tmp = 2.0 / (((k * t) / (l / k)) / (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)));
} else {
tmp = ((2.0 / k) / (k / (l / t))) * (l / (Math.sin(k) * Math.tan(k)));
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 6.2e-110: tmp = 2.0 / (((k * t) / (l / k)) / (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l))) else: tmp = ((2.0 / k) / (k / (l / t))) * (l / (math.sin(k) * math.tan(k))) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 6.2e-110) tmp = Float64(2.0 / Float64(Float64(Float64(k * t) / Float64(l / k)) / Float64(Float64(Float64(1.0 + Float64(Float64(k * k) * 0.16666666666666666)) / k) / Float64(k / l)))); else tmp = Float64(Float64(Float64(2.0 / k) / Float64(k / Float64(l / t))) * Float64(l / Float64(sin(k) * tan(k)))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 6.2e-110) tmp = 2.0 / (((k * t) / (l / k)) / (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l))); else tmp = ((2.0 / k) / (k / (l / t))) * (l / (sin(k) * tan(k))); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 6.2e-110], N[(2.0 / N[(N[(N[(k * t), $MachinePrecision] / N[(l / k), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(1.0 + N[(N[(k * k), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] / N[(k / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 / k), $MachinePrecision] / N[(k / N[(l / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(N[Sin[k], $MachinePrecision] * N[Tan[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 6.2 \cdot 10^{-110}:\\
\;\;\;\;\frac{2}{\frac{\frac{k \cdot t}{\frac{\ell}{k}}}{\frac{\frac{1 + \left(k \cdot k\right) \cdot 0.16666666666666666}{k}}{\frac{k}{\ell}}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{2}{k}}{\frac{k}{\frac{\ell}{t}}} \cdot \frac{\ell}{\sin k \cdot \tan k}\\
\end{array}
\end{array}
if k < 6.20000000000000014e-110Initial program 40.5%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified66.5%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr87.0%
Taylor expanded in k around 0
Simplified74.9%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6467.2%
Simplified67.2%
associate-/l/N/A
clear-numN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr72.5%
if 6.20000000000000014e-110 < k Initial program 30.6%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified65.1%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr87.9%
div-invN/A
associate-/r*N/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6493.8%
Applied egg-rr93.8%
(FPCore (t l k)
:precision binary64
(if (<= k 1.9e-109)
(/
2.0
(/
(/ (* k t) (/ l k))
(/ (/ (+ 1.0 (* (* k k) 0.16666666666666666)) k) (/ k l))))
(* (/ 2.0 (* k k)) (/ (/ l t) (/ (tan k) (/ l (sin k)))))))
double code(double t, double l, double k) {
double tmp;
if (k <= 1.9e-109) {
tmp = 2.0 / (((k * t) / (l / k)) / (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)));
} else {
tmp = (2.0 / (k * k)) * ((l / t) / (tan(k) / (l / sin(k))));
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (k <= 1.9d-109) then
tmp = 2.0d0 / (((k * t) / (l / k)) / (((1.0d0 + ((k * k) * 0.16666666666666666d0)) / k) / (k / l)))
else
tmp = (2.0d0 / (k * k)) * ((l / t) / (tan(k) / (l / sin(k))))
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 1.9e-109) {
tmp = 2.0 / (((k * t) / (l / k)) / (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)));
} else {
tmp = (2.0 / (k * k)) * ((l / t) / (Math.tan(k) / (l / Math.sin(k))));
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 1.9e-109: tmp = 2.0 / (((k * t) / (l / k)) / (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l))) else: tmp = (2.0 / (k * k)) * ((l / t) / (math.tan(k) / (l / math.sin(k)))) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 1.9e-109) tmp = Float64(2.0 / Float64(Float64(Float64(k * t) / Float64(l / k)) / Float64(Float64(Float64(1.0 + Float64(Float64(k * k) * 0.16666666666666666)) / k) / Float64(k / l)))); else tmp = Float64(Float64(2.0 / Float64(k * k)) * Float64(Float64(l / t) / Float64(tan(k) / Float64(l / sin(k))))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 1.9e-109) tmp = 2.0 / (((k * t) / (l / k)) / (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l))); else tmp = (2.0 / (k * k)) * ((l / t) / (tan(k) / (l / sin(k)))); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 1.9e-109], N[(2.0 / N[(N[(N[(k * t), $MachinePrecision] / N[(l / k), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(1.0 + N[(N[(k * k), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] / N[(k / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] * N[(N[(l / t), $MachinePrecision] / N[(N[Tan[k], $MachinePrecision] / N[(l / N[Sin[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.9 \cdot 10^{-109}:\\
\;\;\;\;\frac{2}{\frac{\frac{k \cdot t}{\frac{\ell}{k}}}{\frac{\frac{1 + \left(k \cdot k\right) \cdot 0.16666666666666666}{k}}{\frac{k}{\ell}}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{k \cdot k} \cdot \frac{\frac{\ell}{t}}{\frac{\tan k}{\frac{\ell}{\sin k}}}\\
\end{array}
\end{array}
if k < 1.90000000000000001e-109Initial program 40.5%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified66.5%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr87.0%
Taylor expanded in k around 0
Simplified74.9%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6467.2%
Simplified67.2%
associate-/l/N/A
clear-numN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr72.5%
if 1.90000000000000001e-109 < k Initial program 30.6%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified65.1%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr87.9%
div-invN/A
clear-numN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
/-lowering-/.f64N/A
sin-lowering-sin.f6485.8%
Applied egg-rr85.8%
(FPCore (t l k)
:precision binary64
(if (<= k 3.1e+145)
(/
(/ (/ (+ 1.0 (* (* k k) 0.16666666666666666)) k) (/ k l))
(/ t (/ (/ 2.0 (/ k l)) k)))
(* (* (/ 2.0 k) (/ (/ l k) t)) (/ l (* k (sin k))))))
double code(double t, double l, double k) {
double tmp;
if (k <= 3.1e+145) {
tmp = (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)) / (t / ((2.0 / (k / l)) / k));
} else {
tmp = ((2.0 / k) * ((l / k) / t)) * (l / (k * sin(k)));
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (k <= 3.1d+145) then
tmp = (((1.0d0 + ((k * k) * 0.16666666666666666d0)) / k) / (k / l)) / (t / ((2.0d0 / (k / l)) / k))
else
tmp = ((2.0d0 / k) * ((l / k) / t)) * (l / (k * sin(k)))
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 3.1e+145) {
tmp = (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)) / (t / ((2.0 / (k / l)) / k));
} else {
tmp = ((2.0 / k) * ((l / k) / t)) * (l / (k * Math.sin(k)));
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 3.1e+145: tmp = (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)) / (t / ((2.0 / (k / l)) / k)) else: tmp = ((2.0 / k) * ((l / k) / t)) * (l / (k * math.sin(k))) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 3.1e+145) tmp = Float64(Float64(Float64(Float64(1.0 + Float64(Float64(k * k) * 0.16666666666666666)) / k) / Float64(k / l)) / Float64(t / Float64(Float64(2.0 / Float64(k / l)) / k))); else tmp = Float64(Float64(Float64(2.0 / k) * Float64(Float64(l / k) / t)) * Float64(l / Float64(k * sin(k)))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 3.1e+145) tmp = (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)) / (t / ((2.0 / (k / l)) / k)); else tmp = ((2.0 / k) * ((l / k) / t)) * (l / (k * sin(k))); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 3.1e+145], N[(N[(N[(N[(1.0 + N[(N[(k * k), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] / N[(k / l), $MachinePrecision]), $MachinePrecision] / N[(t / N[(N[(2.0 / N[(k / l), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 / k), $MachinePrecision] * N[(N[(l / k), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k * N[Sin[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.1 \cdot 10^{+145}:\\
\;\;\;\;\frac{\frac{\frac{1 + \left(k \cdot k\right) \cdot 0.16666666666666666}{k}}{\frac{k}{\ell}}}{\frac{t}{\frac{\frac{2}{\frac{k}{\ell}}}{k}}}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{2}{k} \cdot \frac{\frac{\ell}{k}}{t}\right) \cdot \frac{\ell}{k \cdot \sin k}\\
\end{array}
\end{array}
if k < 3.09999999999999988e145Initial program 37.5%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified66.1%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr90.1%
Taylor expanded in k around 0
Simplified71.4%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6465.3%
Simplified65.3%
*-commutativeN/A
div-invN/A
clear-numN/A
frac-timesN/A
associate-*r*N/A
associate-/r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr70.4%
if 3.09999999999999988e145 < k Initial program 32.4%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified65.3%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr69.2%
Taylor expanded in k around 0
Simplified69.2%
associate-/r/N/A
associate-*l/N/A
associate-*l/N/A
associate-/l/N/A
associate-*r/N/A
associate-/l/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6469.4%
Applied egg-rr69.4%
Final simplification70.2%
(FPCore (t l k)
:precision binary64
(let* ((t_1 (/ (/ 2.0 (* k k)) (/ t l))))
(if (<= k 2.3e-99)
(/ (/ (/ 2.0 (/ k l)) k) (/ (* k t) (/ l k)))
(if (<= k 2.7e+88)
(* t_1 (/ (* l (+ 1.0 (* (* k k) -0.16666666666666666))) (* k k)))
(* t_1 (* l 0.16666666666666666))))))
double code(double t, double l, double k) {
double t_1 = (2.0 / (k * k)) / (t / l);
double tmp;
if (k <= 2.3e-99) {
tmp = ((2.0 / (k / l)) / k) / ((k * t) / (l / k));
} else if (k <= 2.7e+88) {
tmp = t_1 * ((l * (1.0 + ((k * k) * -0.16666666666666666))) / (k * k));
} else {
tmp = t_1 * (l * 0.16666666666666666);
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = (2.0d0 / (k * k)) / (t / l)
if (k <= 2.3d-99) then
tmp = ((2.0d0 / (k / l)) / k) / ((k * t) / (l / k))
else if (k <= 2.7d+88) then
tmp = t_1 * ((l * (1.0d0 + ((k * k) * (-0.16666666666666666d0)))) / (k * k))
else
tmp = t_1 * (l * 0.16666666666666666d0)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double t_1 = (2.0 / (k * k)) / (t / l);
double tmp;
if (k <= 2.3e-99) {
tmp = ((2.0 / (k / l)) / k) / ((k * t) / (l / k));
} else if (k <= 2.7e+88) {
tmp = t_1 * ((l * (1.0 + ((k * k) * -0.16666666666666666))) / (k * k));
} else {
tmp = t_1 * (l * 0.16666666666666666);
}
return tmp;
}
def code(t, l, k): t_1 = (2.0 / (k * k)) / (t / l) tmp = 0 if k <= 2.3e-99: tmp = ((2.0 / (k / l)) / k) / ((k * t) / (l / k)) elif k <= 2.7e+88: tmp = t_1 * ((l * (1.0 + ((k * k) * -0.16666666666666666))) / (k * k)) else: tmp = t_1 * (l * 0.16666666666666666) return tmp
function code(t, l, k) t_1 = Float64(Float64(2.0 / Float64(k * k)) / Float64(t / l)) tmp = 0.0 if (k <= 2.3e-99) tmp = Float64(Float64(Float64(2.0 / Float64(k / l)) / k) / Float64(Float64(k * t) / Float64(l / k))); elseif (k <= 2.7e+88) tmp = Float64(t_1 * Float64(Float64(l * Float64(1.0 + Float64(Float64(k * k) * -0.16666666666666666))) / Float64(k * k))); else tmp = Float64(t_1 * Float64(l * 0.16666666666666666)); end return tmp end
function tmp_2 = code(t, l, k) t_1 = (2.0 / (k * k)) / (t / l); tmp = 0.0; if (k <= 2.3e-99) tmp = ((2.0 / (k / l)) / k) / ((k * t) / (l / k)); elseif (k <= 2.7e+88) tmp = t_1 * ((l * (1.0 + ((k * k) * -0.16666666666666666))) / (k * k)); else tmp = t_1 * (l * 0.16666666666666666); end tmp_2 = tmp; end
code[t_, l_, k_] := Block[{t$95$1 = N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] / N[(t / l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 2.3e-99], N[(N[(N[(2.0 / N[(k / l), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] / N[(N[(k * t), $MachinePrecision] / N[(l / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 2.7e+88], N[(t$95$1 * N[(N[(l * N[(1.0 + N[(N[(k * k), $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(l * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\frac{2}{k \cdot k}}{\frac{t}{\ell}}\\
\mathbf{if}\;k \leq 2.3 \cdot 10^{-99}:\\
\;\;\;\;\frac{\frac{\frac{2}{\frac{k}{\ell}}}{k}}{\frac{k \cdot t}{\frac{\ell}{k}}}\\
\mathbf{elif}\;k \leq 2.7 \cdot 10^{+88}:\\
\;\;\;\;t\_1 \cdot \frac{\ell \cdot \left(1 + \left(k \cdot k\right) \cdot -0.16666666666666666\right)}{k \cdot k}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left(\ell \cdot 0.16666666666666666\right)\\
\end{array}
\end{array}
if k < 2.2999999999999998e-99Initial program 41.0%
Taylor expanded in k around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.9%
Simplified63.9%
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.3%
Applied egg-rr73.3%
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/r/N/A
times-fracN/A
associate-/r*N/A
div-invN/A
clear-numN/A
*-lowering-*.f64N/A
Applied egg-rr74.1%
associate-*l/N/A
associate-/l*N/A
associate-/l*N/A
associate-/r*N/A
*-lft-identityN/A
associate-*l/N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6481.2%
Applied egg-rr81.2%
if 2.2999999999999998e-99 < k < 2.70000000000000016e88Initial program 27.9%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified67.0%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr97.5%
Taylor expanded in k around 0
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6469.4%
Simplified69.4%
if 2.70000000000000016e88 < k Initial program 30.9%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified63.3%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr78.5%
Taylor expanded in k around 0
Simplified64.3%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6423.1%
Simplified23.1%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f6465.7%
Simplified65.7%
Final simplification76.2%
(FPCore (t l k)
:precision binary64
(if (<= k 1.75e+130)
(/
(/ (/ (+ 1.0 (* (* k k) 0.16666666666666666)) k) (/ k l))
(/ t (/ (/ 2.0 (/ k l)) k)))
(* (/ (/ 2.0 (* k k)) (/ t l)) (* l 0.16666666666666666))))
double code(double t, double l, double k) {
double tmp;
if (k <= 1.75e+130) {
tmp = (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)) / (t / ((2.0 / (k / l)) / k));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (k <= 1.75d+130) then
tmp = (((1.0d0 + ((k * k) * 0.16666666666666666d0)) / k) / (k / l)) / (t / ((2.0d0 / (k / l)) / k))
else
tmp = ((2.0d0 / (k * k)) / (t / l)) * (l * 0.16666666666666666d0)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 1.75e+130) {
tmp = (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)) / (t / ((2.0 / (k / l)) / k));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 1.75e+130: tmp = (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)) / (t / ((2.0 / (k / l)) / k)) else: tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 1.75e+130) tmp = Float64(Float64(Float64(Float64(1.0 + Float64(Float64(k * k) * 0.16666666666666666)) / k) / Float64(k / l)) / Float64(t / Float64(Float64(2.0 / Float64(k / l)) / k))); else tmp = Float64(Float64(Float64(2.0 / Float64(k * k)) / Float64(t / l)) * Float64(l * 0.16666666666666666)); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 1.75e+130) tmp = (((1.0 + ((k * k) * 0.16666666666666666)) / k) / (k / l)) / (t / ((2.0 / (k / l)) / k)); else tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 1.75e+130], N[(N[(N[(N[(1.0 + N[(N[(k * k), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] / N[(k / l), $MachinePrecision]), $MachinePrecision] / N[(t / N[(N[(2.0 / N[(k / l), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] / N[(t / l), $MachinePrecision]), $MachinePrecision] * N[(l * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.75 \cdot 10^{+130}:\\
\;\;\;\;\frac{\frac{\frac{1 + \left(k \cdot k\right) \cdot 0.16666666666666666}{k}}{\frac{k}{\ell}}}{\frac{t}{\frac{\frac{2}{\frac{k}{\ell}}}{k}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{2}{k \cdot k}}{\frac{t}{\ell}} \cdot \left(\ell \cdot 0.16666666666666666\right)\\
\end{array}
\end{array}
if k < 1.75e130Initial program 37.4%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified66.2%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr90.0%
Taylor expanded in k around 0
Simplified71.6%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6465.4%
Simplified65.4%
*-commutativeN/A
div-invN/A
clear-numN/A
frac-timesN/A
associate-*r*N/A
associate-/r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr70.5%
if 1.75e130 < k Initial program 33.5%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified64.6%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr71.0%
Taylor expanded in k around 0
Simplified68.2%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6411.3%
Simplified11.3%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f6468.6%
Simplified68.6%
(FPCore (t l k)
:precision binary64
(if (<= k 2.7e+88)
(*
(/ (/ (* 2.0 (/ l k)) k) t)
(/ (* l (+ 1.0 (* (* k k) -0.16666666666666666))) (* k k)))
(* (/ (/ 2.0 (* k k)) (/ t l)) (* l 0.16666666666666666))))
double code(double t, double l, double k) {
double tmp;
if (k <= 2.7e+88) {
tmp = (((2.0 * (l / k)) / k) / t) * ((l * (1.0 + ((k * k) * -0.16666666666666666))) / (k * k));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (k <= 2.7d+88) then
tmp = (((2.0d0 * (l / k)) / k) / t) * ((l * (1.0d0 + ((k * k) * (-0.16666666666666666d0)))) / (k * k))
else
tmp = ((2.0d0 / (k * k)) / (t / l)) * (l * 0.16666666666666666d0)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 2.7e+88) {
tmp = (((2.0 * (l / k)) / k) / t) * ((l * (1.0 + ((k * k) * -0.16666666666666666))) / (k * k));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 2.7e+88: tmp = (((2.0 * (l / k)) / k) / t) * ((l * (1.0 + ((k * k) * -0.16666666666666666))) / (k * k)) else: tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 2.7e+88) tmp = Float64(Float64(Float64(Float64(2.0 * Float64(l / k)) / k) / t) * Float64(Float64(l * Float64(1.0 + Float64(Float64(k * k) * -0.16666666666666666))) / Float64(k * k))); else tmp = Float64(Float64(Float64(2.0 / Float64(k * k)) / Float64(t / l)) * Float64(l * 0.16666666666666666)); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 2.7e+88) tmp = (((2.0 * (l / k)) / k) / t) * ((l * (1.0 + ((k * k) * -0.16666666666666666))) / (k * k)); else tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 2.7e+88], N[(N[(N[(N[(2.0 * N[(l / k), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] / t), $MachinePrecision] * N[(N[(l * N[(1.0 + N[(N[(k * k), $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] / N[(t / l), $MachinePrecision]), $MachinePrecision] * N[(l * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 2.7 \cdot 10^{+88}:\\
\;\;\;\;\frac{\frac{2 \cdot \frac{\ell}{k}}{k}}{t} \cdot \frac{\ell \cdot \left(1 + \left(k \cdot k\right) \cdot -0.16666666666666666\right)}{k \cdot k}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{2}{k \cdot k}}{\frac{t}{\ell}} \cdot \left(\ell \cdot 0.16666666666666666\right)\\
\end{array}
\end{array}
if k < 2.70000000000000016e88Initial program 38.2%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified66.7%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr89.4%
Taylor expanded in k around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6494.3%
Simplified94.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6469.7%
Simplified69.7%
if 2.70000000000000016e88 < k Initial program 30.9%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified63.3%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr78.5%
Taylor expanded in k around 0
Simplified64.3%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6423.1%
Simplified23.1%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f6465.7%
Simplified65.7%
Final simplification69.0%
(FPCore (t l k) :precision binary64 (if (<= k 1.3e-100) (/ (/ (/ 2.0 (/ k l)) k) (/ (* k t) (/ l k))) (* (/ (/ 2.0 (* k k)) (/ t l)) (/ l (* k k)))))
double code(double t, double l, double k) {
double tmp;
if (k <= 1.3e-100) {
tmp = ((2.0 / (k / l)) / k) / ((k * t) / (l / k));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l / (k * k));
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (k <= 1.3d-100) then
tmp = ((2.0d0 / (k / l)) / k) / ((k * t) / (l / k))
else
tmp = ((2.0d0 / (k * k)) / (t / l)) * (l / (k * k))
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 1.3e-100) {
tmp = ((2.0 / (k / l)) / k) / ((k * t) / (l / k));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l / (k * k));
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 1.3e-100: tmp = ((2.0 / (k / l)) / k) / ((k * t) / (l / k)) else: tmp = ((2.0 / (k * k)) / (t / l)) * (l / (k * k)) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 1.3e-100) tmp = Float64(Float64(Float64(2.0 / Float64(k / l)) / k) / Float64(Float64(k * t) / Float64(l / k))); else tmp = Float64(Float64(Float64(2.0 / Float64(k * k)) / Float64(t / l)) * Float64(l / Float64(k * k))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 1.3e-100) tmp = ((2.0 / (k / l)) / k) / ((k * t) / (l / k)); else tmp = ((2.0 / (k * k)) / (t / l)) * (l / (k * k)); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 1.3e-100], N[(N[(N[(2.0 / N[(k / l), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] / N[(N[(k * t), $MachinePrecision] / N[(l / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] / N[(t / l), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.3 \cdot 10^{-100}:\\
\;\;\;\;\frac{\frac{\frac{2}{\frac{k}{\ell}}}{k}}{\frac{k \cdot t}{\frac{\ell}{k}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{2}{k \cdot k}}{\frac{t}{\ell}} \cdot \frac{\ell}{k \cdot k}\\
\end{array}
\end{array}
if k < 1.2999999999999999e-100Initial program 41.0%
Taylor expanded in k around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.9%
Simplified63.9%
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.3%
Applied egg-rr73.3%
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/r/N/A
times-fracN/A
associate-/r*N/A
div-invN/A
clear-numN/A
*-lowering-*.f64N/A
Applied egg-rr74.1%
associate-*l/N/A
associate-/l*N/A
associate-/l*N/A
associate-/r*N/A
*-lft-identityN/A
associate-*l/N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6481.2%
Applied egg-rr81.2%
if 1.2999999999999999e-100 < k Initial program 29.5%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified65.1%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr87.5%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6461.4%
Simplified61.4%
(FPCore (t l k) :precision binary64 (if (<= k 1.45e+19) (* (/ (/ (* 2.0 (/ l k)) k) t) (/ l (* k k))) (* (/ (/ 2.0 (* k k)) (/ t l)) (* l 0.16666666666666666))))
double code(double t, double l, double k) {
double tmp;
if (k <= 1.45e+19) {
tmp = (((2.0 * (l / k)) / k) / t) * (l / (k * k));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (k <= 1.45d+19) then
tmp = (((2.0d0 * (l / k)) / k) / t) * (l / (k * k))
else
tmp = ((2.0d0 / (k * k)) / (t / l)) * (l * 0.16666666666666666d0)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 1.45e+19) {
tmp = (((2.0 * (l / k)) / k) / t) * (l / (k * k));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 1.45e+19: tmp = (((2.0 * (l / k)) / k) / t) * (l / (k * k)) else: tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 1.45e+19) tmp = Float64(Float64(Float64(Float64(2.0 * Float64(l / k)) / k) / t) * Float64(l / Float64(k * k))); else tmp = Float64(Float64(Float64(2.0 / Float64(k * k)) / Float64(t / l)) * Float64(l * 0.16666666666666666)); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 1.45e+19) tmp = (((2.0 * (l / k)) / k) / t) * (l / (k * k)); else tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 1.45e+19], N[(N[(N[(N[(2.0 * N[(l / k), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] / t), $MachinePrecision] * N[(l / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] / N[(t / l), $MachinePrecision]), $MachinePrecision] * N[(l * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.45 \cdot 10^{+19}:\\
\;\;\;\;\frac{\frac{2 \cdot \frac{\ell}{k}}{k}}{t} \cdot \frac{\ell}{k \cdot k}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{2}{k \cdot k}}{\frac{t}{\ell}} \cdot \left(\ell \cdot 0.16666666666666666\right)\\
\end{array}
\end{array}
if k < 1.45e19Initial program 39.4%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified67.9%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr88.9%
Taylor expanded in k around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6494.5%
Simplified94.5%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6481.0%
Simplified81.0%
if 1.45e19 < k Initial program 29.6%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified60.7%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr83.0%
Taylor expanded in k around 0
Simplified54.8%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.6%
Simplified24.6%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f6455.5%
Simplified55.5%
(FPCore (t l k) :precision binary64 (if (<= t 3.5e-147) (* (/ (/ 2.0 (* k k)) (/ t l)) (/ l (* k k))) (* (/ l k) (/ 2.0 (/ k (/ l (* k (* k t))))))))
double code(double t, double l, double k) {
double tmp;
if (t <= 3.5e-147) {
tmp = ((2.0 / (k * k)) / (t / l)) * (l / (k * k));
} else {
tmp = (l / k) * (2.0 / (k / (l / (k * (k * t)))));
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (t <= 3.5d-147) then
tmp = ((2.0d0 / (k * k)) / (t / l)) * (l / (k * k))
else
tmp = (l / k) * (2.0d0 / (k / (l / (k * (k * t)))))
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (t <= 3.5e-147) {
tmp = ((2.0 / (k * k)) / (t / l)) * (l / (k * k));
} else {
tmp = (l / k) * (2.0 / (k / (l / (k * (k * t)))));
}
return tmp;
}
def code(t, l, k): tmp = 0 if t <= 3.5e-147: tmp = ((2.0 / (k * k)) / (t / l)) * (l / (k * k)) else: tmp = (l / k) * (2.0 / (k / (l / (k * (k * t))))) return tmp
function code(t, l, k) tmp = 0.0 if (t <= 3.5e-147) tmp = Float64(Float64(Float64(2.0 / Float64(k * k)) / Float64(t / l)) * Float64(l / Float64(k * k))); else tmp = Float64(Float64(l / k) * Float64(2.0 / Float64(k / Float64(l / Float64(k * Float64(k * t)))))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (t <= 3.5e-147) tmp = ((2.0 / (k * k)) / (t / l)) * (l / (k * k)); else tmp = (l / k) * (2.0 / (k / (l / (k * (k * t))))); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[t, 3.5e-147], N[(N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] / N[(t / l), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(l / k), $MachinePrecision] * N[(2.0 / N[(k / N[(l / N[(k * N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 3.5 \cdot 10^{-147}:\\
\;\;\;\;\frac{\frac{2}{k \cdot k}}{\frac{t}{\ell}} \cdot \frac{\ell}{k \cdot k}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell}{k} \cdot \frac{2}{\frac{k}{\frac{\ell}{k \cdot \left(k \cdot t\right)}}}\\
\end{array}
\end{array}
if t < 3.50000000000000004e-147Initial program 35.9%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified67.1%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr89.4%
Taylor expanded in k around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6473.2%
Simplified73.2%
if 3.50000000000000004e-147 < t Initial program 38.6%
Taylor expanded in k around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6458.9%
Simplified58.9%
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6468.4%
Applied egg-rr68.4%
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/r/N/A
times-fracN/A
associate-/r*N/A
div-invN/A
clear-numN/A
*-lowering-*.f64N/A
Applied egg-rr68.1%
clear-numN/A
associate-/l/N/A
associate-*r*N/A
associate-*r*N/A
associate-/l/N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.7%
Applied egg-rr73.7%
Final simplification73.4%
(FPCore (t l k) :precision binary64 (if (<= k 1.45e+19) (* (/ l k) (/ (/ 2.0 k) (/ (* k t) (/ l k)))) (* (/ (/ 2.0 (* k k)) (/ t l)) (* l 0.16666666666666666))))
double code(double t, double l, double k) {
double tmp;
if (k <= 1.45e+19) {
tmp = (l / k) * ((2.0 / k) / ((k * t) / (l / k)));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (k <= 1.45d+19) then
tmp = (l / k) * ((2.0d0 / k) / ((k * t) / (l / k)))
else
tmp = ((2.0d0 / (k * k)) / (t / l)) * (l * 0.16666666666666666d0)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 1.45e+19) {
tmp = (l / k) * ((2.0 / k) / ((k * t) / (l / k)));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 1.45e+19: tmp = (l / k) * ((2.0 / k) / ((k * t) / (l / k))) else: tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 1.45e+19) tmp = Float64(Float64(l / k) * Float64(Float64(2.0 / k) / Float64(Float64(k * t) / Float64(l / k)))); else tmp = Float64(Float64(Float64(2.0 / Float64(k * k)) / Float64(t / l)) * Float64(l * 0.16666666666666666)); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 1.45e+19) tmp = (l / k) * ((2.0 / k) / ((k * t) / (l / k))); else tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 1.45e+19], N[(N[(l / k), $MachinePrecision] * N[(N[(2.0 / k), $MachinePrecision] / N[(N[(k * t), $MachinePrecision] / N[(l / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] / N[(t / l), $MachinePrecision]), $MachinePrecision] * N[(l * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.45 \cdot 10^{+19}:\\
\;\;\;\;\frac{\ell}{k} \cdot \frac{\frac{2}{k}}{\frac{k \cdot t}{\frac{\ell}{k}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{2}{k \cdot k}}{\frac{t}{\ell}} \cdot \left(\ell \cdot 0.16666666666666666\right)\\
\end{array}
\end{array}
if k < 1.45e19Initial program 39.4%
Taylor expanded in k around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.4%
Simplified63.4%
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.1%
Applied egg-rr72.1%
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/r/N/A
times-fracN/A
associate-/r*N/A
div-invN/A
clear-numN/A
*-lowering-*.f64N/A
Applied egg-rr75.3%
associate-/l*N/A
associate-/r*N/A
*-lft-identityN/A
associate-*l/N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6480.1%
Applied egg-rr80.1%
if 1.45e19 < k Initial program 29.6%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified60.7%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr83.0%
Taylor expanded in k around 0
Simplified54.8%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.6%
Simplified24.6%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f6455.5%
Simplified55.5%
Final simplification73.6%
(FPCore (t l k) :precision binary64 (if (<= k 1.45e+19) (* (/ l k) (/ 2.0 (/ k (/ l (* k (* k t)))))) (* (/ (/ 2.0 (* k k)) (/ t l)) (* l 0.16666666666666666))))
double code(double t, double l, double k) {
double tmp;
if (k <= 1.45e+19) {
tmp = (l / k) * (2.0 / (k / (l / (k * (k * t)))));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (k <= 1.45d+19) then
tmp = (l / k) * (2.0d0 / (k / (l / (k * (k * t)))))
else
tmp = ((2.0d0 / (k * k)) / (t / l)) * (l * 0.16666666666666666d0)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 1.45e+19) {
tmp = (l / k) * (2.0 / (k / (l / (k * (k * t)))));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 1.45e+19: tmp = (l / k) * (2.0 / (k / (l / (k * (k * t))))) else: tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 1.45e+19) tmp = Float64(Float64(l / k) * Float64(2.0 / Float64(k / Float64(l / Float64(k * Float64(k * t)))))); else tmp = Float64(Float64(Float64(2.0 / Float64(k * k)) / Float64(t / l)) * Float64(l * 0.16666666666666666)); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 1.45e+19) tmp = (l / k) * (2.0 / (k / (l / (k * (k * t))))); else tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 1.45e+19], N[(N[(l / k), $MachinePrecision] * N[(2.0 / N[(k / N[(l / N[(k * N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] / N[(t / l), $MachinePrecision]), $MachinePrecision] * N[(l * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.45 \cdot 10^{+19}:\\
\;\;\;\;\frac{\ell}{k} \cdot \frac{2}{\frac{k}{\frac{\ell}{k \cdot \left(k \cdot t\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{2}{k \cdot k}}{\frac{t}{\ell}} \cdot \left(\ell \cdot 0.16666666666666666\right)\\
\end{array}
\end{array}
if k < 1.45e19Initial program 39.4%
Taylor expanded in k around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.4%
Simplified63.4%
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.1%
Applied egg-rr72.1%
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/r/N/A
times-fracN/A
associate-/r*N/A
div-invN/A
clear-numN/A
*-lowering-*.f64N/A
Applied egg-rr75.3%
clear-numN/A
associate-/l/N/A
associate-*r*N/A
associate-*r*N/A
associate-/l/N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6480.1%
Applied egg-rr80.1%
if 1.45e19 < k Initial program 29.6%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified60.7%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr83.0%
Taylor expanded in k around 0
Simplified54.8%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.6%
Simplified24.6%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f6455.5%
Simplified55.5%
Final simplification73.6%
(FPCore (t l k) :precision binary64 (if (<= k 1.45e+19) (* l (* l (/ 2.0 (* k (* t (* k (* k k))))))) (* (/ (/ 2.0 (* k k)) (/ t l)) (* l 0.16666666666666666))))
double code(double t, double l, double k) {
double tmp;
if (k <= 1.45e+19) {
tmp = l * (l * (2.0 / (k * (t * (k * (k * k))))));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
real(8) :: tmp
if (k <= 1.45d+19) then
tmp = l * (l * (2.0d0 / (k * (t * (k * (k * k))))))
else
tmp = ((2.0d0 / (k * k)) / (t / l)) * (l * 0.16666666666666666d0)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 1.45e+19) {
tmp = l * (l * (2.0 / (k * (t * (k * (k * k))))));
} else {
tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 1.45e+19: tmp = l * (l * (2.0 / (k * (t * (k * (k * k)))))) else: tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 1.45e+19) tmp = Float64(l * Float64(l * Float64(2.0 / Float64(k * Float64(t * Float64(k * Float64(k * k))))))); else tmp = Float64(Float64(Float64(2.0 / Float64(k * k)) / Float64(t / l)) * Float64(l * 0.16666666666666666)); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 1.45e+19) tmp = l * (l * (2.0 / (k * (t * (k * (k * k)))))); else tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 1.45e+19], N[(l * N[(l * N[(2.0 / N[(k * N[(t * N[(k * N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] / N[(t / l), $MachinePrecision]), $MachinePrecision] * N[(l * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.45 \cdot 10^{+19}:\\
\;\;\;\;\ell \cdot \left(\ell \cdot \frac{2}{k \cdot \left(t \cdot \left(k \cdot \left(k \cdot k\right)\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{2}{k \cdot k}}{\frac{t}{\ell}} \cdot \left(\ell \cdot 0.16666666666666666\right)\\
\end{array}
\end{array}
if k < 1.45e19Initial program 39.4%
Taylor expanded in k around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.4%
Simplified63.4%
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.1%
Applied egg-rr72.1%
if 1.45e19 < k Initial program 29.6%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified60.7%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr83.0%
Taylor expanded in k around 0
Simplified54.8%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.6%
Simplified24.6%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f6455.5%
Simplified55.5%
Final simplification67.7%
(FPCore (t l k) :precision binary64 (* (/ (/ 2.0 (* k k)) (/ t l)) (* l 0.16666666666666666)))
double code(double t, double l, double k) {
return ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
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 / (k * k)) / (t / l)) * (l * 0.16666666666666666d0)
end function
public static double code(double t, double l, double k) {
return ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666);
}
def code(t, l, k): return ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666)
function code(t, l, k) return Float64(Float64(Float64(2.0 / Float64(k * k)) / Float64(t / l)) * Float64(l * 0.16666666666666666)) end
function tmp = code(t, l, k) tmp = ((2.0 / (k * k)) / (t / l)) * (l * 0.16666666666666666); end
code[t_, l_, k_] := N[(N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] / N[(t / l), $MachinePrecision]), $MachinePrecision] * N[(l * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{2}{k \cdot k}}{\frac{t}{\ell}} \cdot \left(\ell \cdot 0.16666666666666666\right)
\end{array}
Initial program 36.8%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified66.0%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr87.3%
Taylor expanded in k around 0
Simplified71.2%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.8%
Simplified57.8%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f6461.7%
Simplified61.7%
(FPCore (t l k) :precision binary64 (* 0.3333333333333333 (/ (/ (/ (* l l) k) k) t)))
double code(double t, double l, double k) {
return 0.3333333333333333 * ((((l * l) / k) / k) / t);
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
code = 0.3333333333333333d0 * ((((l * l) / k) / k) / t)
end function
public static double code(double t, double l, double k) {
return 0.3333333333333333 * ((((l * l) / k) / k) / t);
}
def code(t, l, k): return 0.3333333333333333 * ((((l * l) / k) / k) / t)
function code(t, l, k) return Float64(0.3333333333333333 * Float64(Float64(Float64(Float64(l * l) / k) / k) / t)) end
function tmp = code(t, l, k) tmp = 0.3333333333333333 * ((((l * l) / k) / k) / t); end
code[t_, l_, k_] := N[(0.3333333333333333 * N[(N[(N[(N[(l * l), $MachinePrecision] / k), $MachinePrecision] / k), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.3333333333333333 \cdot \frac{\frac{\frac{\ell \cdot \ell}{k}}{k}}{t}
\end{array}
Initial program 36.8%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified66.0%
associate-/l/N/A
associate-/r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-inversesN/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr87.3%
Taylor expanded in k around 0
Simplified71.2%
Taylor expanded in k around 0
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.8%
Simplified57.8%
Taylor expanded in k around inf
*-lowering-*.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6457.3%
Simplified57.3%
herbie shell --seed 2024191
(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))))