
(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 14 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 l) k) (/ (/ l k) (* (sin k) (* t (tan k))))))
double code(double t, double l, double k) {
return ((2.0 * l) / k) * ((l / k) / (sin(k) * (t * tan(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 * l) / k) * ((l / k) / (sin(k) * (t * tan(k))))
end function
public static double code(double t, double l, double k) {
return ((2.0 * l) / k) * ((l / k) / (Math.sin(k) * (t * Math.tan(k))));
}
def code(t, l, k): return ((2.0 * l) / k) * ((l / k) / (math.sin(k) * (t * math.tan(k))))
function code(t, l, k) return Float64(Float64(Float64(2.0 * l) / k) * Float64(Float64(l / k) / Float64(sin(k) * Float64(t * tan(k))))) end
function tmp = code(t, l, k) tmp = ((2.0 * l) / k) * ((l / k) / (sin(k) * (t * tan(k)))); end
code[t_, l_, k_] := N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] * N[(N[(l / k), $MachinePrecision] / N[(N[Sin[k], $MachinePrecision] * N[(t * N[Tan[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2 \cdot \ell}{k} \cdot \frac{\frac{\ell}{k}}{\sin k \cdot \left(t \cdot \tan k\right)}
\end{array}
Initial program 35.0%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified69.6%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6478.4%
Applied egg-rr78.4%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
unpow2N/A
associate-*r/N/A
tan-quotN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6491.9%
Applied egg-rr91.9%
div-invN/A
associate-/l/N/A
associate-*l/N/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
/-rgt-identityN/A
clear-numN/A
div-invN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
div-invN/A
clear-numN/A
/-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
tan-lowering-tan.f6497.8%
Applied egg-rr97.8%
(FPCore (t l k) :precision binary64 (if (<= k 3.5e-133) (* (/ (/ (/ 2.0 (/ k l)) (/ k l)) k) (/ 1.0 (* k t))) (* (/ (* 2.0 l) k) (/ l (* k (* (sin k) (* t (tan k))))))))
double code(double t, double l, double k) {
double tmp;
if (k <= 3.5e-133) {
tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t));
} else {
tmp = ((2.0 * l) / k) * (l / (k * (sin(k) * (t * 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 <= 3.5d-133) then
tmp = (((2.0d0 / (k / l)) / (k / l)) / k) * (1.0d0 / (k * t))
else
tmp = ((2.0d0 * l) / k) * (l / (k * (sin(k) * (t * tan(k)))))
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 3.5e-133) {
tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t));
} else {
tmp = ((2.0 * l) / k) * (l / (k * (Math.sin(k) * (t * Math.tan(k)))));
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 3.5e-133: tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t)) else: tmp = ((2.0 * l) / k) * (l / (k * (math.sin(k) * (t * math.tan(k))))) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 3.5e-133) tmp = Float64(Float64(Float64(Float64(2.0 / Float64(k / l)) / Float64(k / l)) / k) * Float64(1.0 / Float64(k * t))); else tmp = Float64(Float64(Float64(2.0 * l) / k) * Float64(l / Float64(k * Float64(sin(k) * Float64(t * tan(k)))))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 3.5e-133) tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t)); else tmp = ((2.0 * l) / k) * (l / (k * (sin(k) * (t * tan(k))))); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 3.5e-133], N[(N[(N[(N[(2.0 / N[(k / l), $MachinePrecision]), $MachinePrecision] / N[(k / l), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] * N[(1.0 / N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] * N[(l / N[(k * N[(N[Sin[k], $MachinePrecision] * N[(t * N[Tan[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.5 \cdot 10^{-133}:\\
\;\;\;\;\frac{\frac{\frac{2}{\frac{k}{\ell}}}{\frac{k}{\ell}}}{k} \cdot \frac{1}{k \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{2 \cdot \ell}{k} \cdot \frac{\ell}{k \cdot \left(\sin k \cdot \left(t \cdot \tan k\right)\right)}\\
\end{array}
\end{array}
if k < 3.50000000000000003e-133Initial program 35.9%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified67.6%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6478.1%
Applied egg-rr78.1%
Taylor expanded in k around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6465.2%
Simplified65.2%
div-invN/A
times-fracN/A
clear-numN/A
div-invN/A
clear-numN/A
/-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr76.1%
if 3.50000000000000003e-133 < k Initial program 33.5%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified72.7%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6478.7%
Applied egg-rr78.7%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
unpow2N/A
associate-*r/N/A
tan-quotN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6493.0%
Applied egg-rr93.0%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
/-rgt-identityN/A
clear-numN/A
div-invN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
div-invN/A
clear-numN/A
/-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
tan-lowering-tan.f6491.2%
Applied egg-rr91.2%
(FPCore (t l k) :precision binary64 (if (<= k 2.65e-132) (* (/ (/ (/ 2.0 (/ k l)) (/ k l)) k) (/ 1.0 (* k t))) (* (* 2.0 l) (/ (/ (/ l t) (* (sin k) (tan k))) (* k k)))))
double code(double t, double l, double k) {
double tmp;
if (k <= 2.65e-132) {
tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t));
} else {
tmp = (2.0 * l) * (((l / t) / (sin(k) * tan(k))) / (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 <= 2.65d-132) then
tmp = (((2.0d0 / (k / l)) / (k / l)) / k) * (1.0d0 / (k * t))
else
tmp = (2.0d0 * l) * (((l / t) / (sin(k) * tan(k))) / (k * k))
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 2.65e-132) {
tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t));
} else {
tmp = (2.0 * l) * (((l / t) / (Math.sin(k) * Math.tan(k))) / (k * k));
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 2.65e-132: tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t)) else: tmp = (2.0 * l) * (((l / t) / (math.sin(k) * math.tan(k))) / (k * k)) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 2.65e-132) tmp = Float64(Float64(Float64(Float64(2.0 / Float64(k / l)) / Float64(k / l)) / k) * Float64(1.0 / Float64(k * t))); else tmp = Float64(Float64(2.0 * l) * Float64(Float64(Float64(l / t) / Float64(sin(k) * tan(k))) / Float64(k * k))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 2.65e-132) tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t)); else tmp = (2.0 * l) * (((l / t) / (sin(k) * tan(k))) / (k * k)); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 2.65e-132], N[(N[(N[(N[(2.0 / N[(k / l), $MachinePrecision]), $MachinePrecision] / N[(k / l), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] * N[(1.0 / N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * l), $MachinePrecision] * N[(N[(N[(l / t), $MachinePrecision] / N[(N[Sin[k], $MachinePrecision] * N[Tan[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 2.65 \cdot 10^{-132}:\\
\;\;\;\;\frac{\frac{\frac{2}{\frac{k}{\ell}}}{\frac{k}{\ell}}}{k} \cdot \frac{1}{k \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\left(2 \cdot \ell\right) \cdot \frac{\frac{\frac{\ell}{t}}{\sin k \cdot \tan k}}{k \cdot k}\\
\end{array}
\end{array}
if k < 2.65000000000000015e-132Initial program 35.9%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified67.6%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6478.1%
Applied egg-rr78.1%
Taylor expanded in k around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6465.2%
Simplified65.2%
div-invN/A
times-fracN/A
clear-numN/A
div-invN/A
clear-numN/A
/-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr76.1%
if 2.65000000000000015e-132 < k Initial program 33.5%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified72.7%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6478.7%
Applied egg-rr78.7%
associate-*l*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
unpow2N/A
associate-*r/N/A
tan-quotN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f6481.0%
Applied egg-rr81.0%
(FPCore (t l k) :precision binary64 (if (<= (* l l) 5e-181) (* (/ (/ (/ 2.0 (/ k l)) (/ k l)) k) (/ 1.0 (* k t))) (/ (* (/ (* 2.0 (* l l)) t) (/ (cos k) (* k k))) (* k k))))
double code(double t, double l, double k) {
double tmp;
if ((l * l) <= 5e-181) {
tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t));
} else {
tmp = (((2.0 * (l * l)) / t) * (cos(k) / (k * k))) / (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 ((l * l) <= 5d-181) then
tmp = (((2.0d0 / (k / l)) / (k / l)) / k) * (1.0d0 / (k * t))
else
tmp = (((2.0d0 * (l * l)) / t) * (cos(k) / (k * k))) / (k * k)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if ((l * l) <= 5e-181) {
tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t));
} else {
tmp = (((2.0 * (l * l)) / t) * (Math.cos(k) / (k * k))) / (k * k);
}
return tmp;
}
def code(t, l, k): tmp = 0 if (l * l) <= 5e-181: tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t)) else: tmp = (((2.0 * (l * l)) / t) * (math.cos(k) / (k * k))) / (k * k) return tmp
function code(t, l, k) tmp = 0.0 if (Float64(l * l) <= 5e-181) tmp = Float64(Float64(Float64(Float64(2.0 / Float64(k / l)) / Float64(k / l)) / k) * Float64(1.0 / Float64(k * t))); else tmp = Float64(Float64(Float64(Float64(2.0 * Float64(l * l)) / t) * Float64(cos(k) / Float64(k * k))) / Float64(k * k)); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if ((l * l) <= 5e-181) tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t)); else tmp = (((2.0 * (l * l)) / t) * (cos(k) / (k * k))) / (k * k); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[N[(l * l), $MachinePrecision], 5e-181], N[(N[(N[(N[(2.0 / N[(k / l), $MachinePrecision]), $MachinePrecision] / N[(k / l), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] * N[(1.0 / N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(2.0 * N[(l * l), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] * N[(N[Cos[k], $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot \ell \leq 5 \cdot 10^{-181}:\\
\;\;\;\;\frac{\frac{\frac{2}{\frac{k}{\ell}}}{\frac{k}{\ell}}}{k} \cdot \frac{1}{k \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{2 \cdot \left(\ell \cdot \ell\right)}{t} \cdot \frac{\cos k}{k \cdot k}}{k \cdot k}\\
\end{array}
\end{array}
if (*.f64 l l) < 5.0000000000000001e-181Initial program 30.9%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified67.0%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6479.8%
Applied egg-rr79.8%
Taylor expanded in k around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6469.3%
Simplified69.3%
div-invN/A
times-fracN/A
clear-numN/A
div-invN/A
clear-numN/A
/-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr90.7%
if 5.0000000000000001e-181 < (*.f64 l l) Initial program 37.2%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified71.0%
Taylor expanded in k around 0
unpow2N/A
*-lowering-*.f6460.9%
Simplified60.9%
(FPCore (t l k) :precision binary64 (if (<= k 1.45e-146) (* (/ (/ (/ 2.0 (/ k l)) (/ k l)) k) (/ 1.0 (* k t))) (* (/ (* 2.0 l) k) (/ (/ (/ l t) (* k k)) k))))
double code(double t, double l, double k) {
double tmp;
if (k <= 1.45e-146) {
tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t));
} else {
tmp = ((2.0 * l) / k) * (((l / t) / (k * 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.45d-146) then
tmp = (((2.0d0 / (k / l)) / (k / l)) / k) * (1.0d0 / (k * t))
else
tmp = ((2.0d0 * l) / k) * (((l / t) / (k * k)) / k)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 1.45e-146) {
tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t));
} else {
tmp = ((2.0 * l) / k) * (((l / t) / (k * k)) / k);
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 1.45e-146: tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t)) else: tmp = ((2.0 * l) / k) * (((l / t) / (k * k)) / k) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 1.45e-146) tmp = Float64(Float64(Float64(Float64(2.0 / Float64(k / l)) / Float64(k / l)) / k) * Float64(1.0 / Float64(k * t))); else tmp = Float64(Float64(Float64(2.0 * l) / k) * Float64(Float64(Float64(l / t) / Float64(k * k)) / k)); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 1.45e-146) tmp = (((2.0 / (k / l)) / (k / l)) / k) * (1.0 / (k * t)); else tmp = ((2.0 * l) / k) * (((l / t) / (k * k)) / k); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 1.45e-146], N[(N[(N[(N[(2.0 / N[(k / l), $MachinePrecision]), $MachinePrecision] / N[(k / l), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] * N[(1.0 / N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] * N[(N[(N[(l / t), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.45 \cdot 10^{-146}:\\
\;\;\;\;\frac{\frac{\frac{2}{\frac{k}{\ell}}}{\frac{k}{\ell}}}{k} \cdot \frac{1}{k \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{2 \cdot \ell}{k} \cdot \frac{\frac{\frac{\ell}{t}}{k \cdot k}}{k}\\
\end{array}
\end{array}
if k < 1.45000000000000005e-146Initial program 36.6%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified68.2%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6479.0%
Applied egg-rr79.0%
Taylor expanded in k around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6465.8%
Simplified65.8%
div-invN/A
times-fracN/A
clear-numN/A
div-invN/A
clear-numN/A
/-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr75.7%
if 1.45000000000000005e-146 < k Initial program 32.5%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified71.6%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6477.4%
Applied egg-rr77.4%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
unpow2N/A
associate-*r/N/A
tan-quotN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6493.2%
Applied egg-rr93.2%
Taylor expanded in k around 0
unpow2N/A
*-lowering-*.f6460.9%
Simplified60.9%
(FPCore (t l k) :precision binary64 (if (<= k 3e-144) (/ (/ (/ 2.0 (/ k l)) (/ k l)) (* k (* k t))) (* (/ (* 2.0 l) k) (/ (/ (/ l t) (* k k)) k))))
double code(double t, double l, double k) {
double tmp;
if (k <= 3e-144) {
tmp = ((2.0 / (k / l)) / (k / l)) / (k * (k * t));
} else {
tmp = ((2.0 * l) / k) * (((l / t) / (k * 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 <= 3d-144) then
tmp = ((2.0d0 / (k / l)) / (k / l)) / (k * (k * t))
else
tmp = ((2.0d0 * l) / k) * (((l / t) / (k * k)) / k)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 3e-144) {
tmp = ((2.0 / (k / l)) / (k / l)) / (k * (k * t));
} else {
tmp = ((2.0 * l) / k) * (((l / t) / (k * k)) / k);
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 3e-144: tmp = ((2.0 / (k / l)) / (k / l)) / (k * (k * t)) else: tmp = ((2.0 * l) / k) * (((l / t) / (k * k)) / k) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 3e-144) tmp = Float64(Float64(Float64(2.0 / Float64(k / l)) / Float64(k / l)) / Float64(k * Float64(k * t))); else tmp = Float64(Float64(Float64(2.0 * l) / k) * Float64(Float64(Float64(l / t) / Float64(k * k)) / k)); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 3e-144) tmp = ((2.0 / (k / l)) / (k / l)) / (k * (k * t)); else tmp = ((2.0 * l) / k) * (((l / t) / (k * k)) / k); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 3e-144], N[(N[(N[(2.0 / N[(k / l), $MachinePrecision]), $MachinePrecision] / N[(k / l), $MachinePrecision]), $MachinePrecision] / N[(k * N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] * N[(N[(N[(l / t), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3 \cdot 10^{-144}:\\
\;\;\;\;\frac{\frac{\frac{2}{\frac{k}{\ell}}}{\frac{k}{\ell}}}{k \cdot \left(k \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2 \cdot \ell}{k} \cdot \frac{\frac{\frac{\ell}{t}}{k \cdot k}}{k}\\
\end{array}
\end{array}
if k < 2.9999999999999999e-144Initial program 36.6%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified68.2%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6479.0%
Applied egg-rr79.0%
Taylor expanded in k around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6465.8%
Simplified65.8%
associate-/l/N/A
/-lowering-/.f64N/A
associate-/l/N/A
associate-*r*N/A
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6474.4%
Applied egg-rr74.4%
if 2.9999999999999999e-144 < k Initial program 32.5%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified71.6%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6477.4%
Applied egg-rr77.4%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
unpow2N/A
associate-*r/N/A
tan-quotN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6493.2%
Applied egg-rr93.2%
Taylor expanded in k around 0
unpow2N/A
*-lowering-*.f6460.9%
Simplified60.9%
(FPCore (t l k) :precision binary64 (if (<= k 9.5e+50) (* (/ (* 2.0 l) k) (/ (/ l (* k (* k k))) t)) (/ (/ -0.3333333333333333 (/ k (/ l (/ t l)))) k)))
double code(double t, double l, double k) {
double tmp;
if (k <= 9.5e+50) {
tmp = ((2.0 * l) / k) * ((l / (k * (k * k))) / t);
} else {
tmp = (-0.3333333333333333 / (k / (l / (t / l)))) / 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 <= 9.5d+50) then
tmp = ((2.0d0 * l) / k) * ((l / (k * (k * k))) / t)
else
tmp = ((-0.3333333333333333d0) / (k / (l / (t / l)))) / k
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 9.5e+50) {
tmp = ((2.0 * l) / k) * ((l / (k * (k * k))) / t);
} else {
tmp = (-0.3333333333333333 / (k / (l / (t / l)))) / k;
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 9.5e+50: tmp = ((2.0 * l) / k) * ((l / (k * (k * k))) / t) else: tmp = (-0.3333333333333333 / (k / (l / (t / l)))) / k return tmp
function code(t, l, k) tmp = 0.0 if (k <= 9.5e+50) tmp = Float64(Float64(Float64(2.0 * l) / k) * Float64(Float64(l / Float64(k * Float64(k * k))) / t)); else tmp = Float64(Float64(-0.3333333333333333 / Float64(k / Float64(l / Float64(t / l)))) / k); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 9.5e+50) tmp = ((2.0 * l) / k) * ((l / (k * (k * k))) / t); else tmp = (-0.3333333333333333 / (k / (l / (t / l)))) / k; end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 9.5e+50], N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] * N[(N[(l / N[(k * N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(-0.3333333333333333 / N[(k / N[(l / N[(t / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 9.5 \cdot 10^{+50}:\\
\;\;\;\;\frac{2 \cdot \ell}{k} \cdot \frac{\frac{\ell}{k \cdot \left(k \cdot k\right)}}{t}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-0.3333333333333333}{\frac{k}{\frac{\ell}{\frac{t}{\ell}}}}}{k}\\
\end{array}
\end{array}
if k < 9.4999999999999993e50Initial program 35.3%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified69.8%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6480.5%
Applied egg-rr80.5%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
unpow2N/A
associate-*r/N/A
tan-quotN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6491.3%
Applied egg-rr91.3%
Taylor expanded in k around 0
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6472.8%
Simplified72.8%
if 9.4999999999999993e50 < k Initial program 33.9%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified37.1%
Taylor expanded in k around 0
Simplified21.7%
Taylor expanded in k around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6453.6%
Simplified53.6%
clear-numN/A
inv-powN/A
pow-to-expN/A
exp-lowering-exp.f64N/A
*-lowering-*.f64N/A
log-lowering-log.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6424.6%
Applied egg-rr24.6%
exp-to-powN/A
*-commutativeN/A
unpow-prod-downN/A
inv-powN/A
clear-numN/A
inv-powN/A
un-div-invN/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r*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-/.f6455.3%
Applied egg-rr55.3%
(FPCore (t l k)
:precision binary64
(let* ((t_1 (/ l (/ t l))))
(if (<= k 3.1e+37)
(* t_1 -0.11666666666666667)
(/ (/ -0.3333333333333333 (/ k t_1)) k))))
double code(double t, double l, double k) {
double t_1 = l / (t / l);
double tmp;
if (k <= 3.1e+37) {
tmp = t_1 * -0.11666666666666667;
} else {
tmp = (-0.3333333333333333 / (k / t_1)) / 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) :: t_1
real(8) :: tmp
t_1 = l / (t / l)
if (k <= 3.1d+37) then
tmp = t_1 * (-0.11666666666666667d0)
else
tmp = ((-0.3333333333333333d0) / (k / t_1)) / k
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double t_1 = l / (t / l);
double tmp;
if (k <= 3.1e+37) {
tmp = t_1 * -0.11666666666666667;
} else {
tmp = (-0.3333333333333333 / (k / t_1)) / k;
}
return tmp;
}
def code(t, l, k): t_1 = l / (t / l) tmp = 0 if k <= 3.1e+37: tmp = t_1 * -0.11666666666666667 else: tmp = (-0.3333333333333333 / (k / t_1)) / k return tmp
function code(t, l, k) t_1 = Float64(l / Float64(t / l)) tmp = 0.0 if (k <= 3.1e+37) tmp = Float64(t_1 * -0.11666666666666667); else tmp = Float64(Float64(-0.3333333333333333 / Float64(k / t_1)) / k); end return tmp end
function tmp_2 = code(t, l, k) t_1 = l / (t / l); tmp = 0.0; if (k <= 3.1e+37) tmp = t_1 * -0.11666666666666667; else tmp = (-0.3333333333333333 / (k / t_1)) / k; end tmp_2 = tmp; end
code[t_, l_, k_] := Block[{t$95$1 = N[(l / N[(t / l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 3.1e+37], N[(t$95$1 * -0.11666666666666667), $MachinePrecision], N[(N[(-0.3333333333333333 / N[(k / t$95$1), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\ell}{\frac{t}{\ell}}\\
\mathbf{if}\;k \leq 3.1 \cdot 10^{+37}:\\
\;\;\;\;t\_1 \cdot -0.11666666666666667\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-0.3333333333333333}{\frac{k}{t\_1}}}{k}\\
\end{array}
\end{array}
if k < 3.1000000000000002e37Initial program 34.8%
Taylor expanded in k around 0
/-lowering-/.f64N/A
Simplified29.0%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6414.6%
Simplified14.6%
associate-/l*N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
/-lowering-/.f64N/A
neg-sub0N/A
metadata-evalN/A
--lowering--.f64N/A
metadata-evalN/A
neg-sub0N/A
metadata-evalN/A
--lowering--.f64N/A
metadata-evalN/A
/-lowering-/.f6419.4%
Applied egg-rr19.4%
if 3.1000000000000002e37 < k Initial program 35.3%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified38.4%
Taylor expanded in k around 0
Simplified22.3%
Taylor expanded in k around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.8%
Simplified52.8%
clear-numN/A
inv-powN/A
pow-to-expN/A
exp-lowering-exp.f64N/A
*-lowering-*.f64N/A
log-lowering-log.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6425.2%
Applied egg-rr25.2%
exp-to-powN/A
*-commutativeN/A
unpow-prod-downN/A
inv-powN/A
clear-numN/A
inv-powN/A
un-div-invN/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r*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-/.f6454.4%
Applied egg-rr54.4%
Final simplification24.1%
(FPCore (t l k) :precision binary64 (if (<= k 3.1e+37) (* (/ l (/ t l)) -0.11666666666666667) (* l (* (/ l t) (/ -0.3333333333333333 (* k k))))))
double code(double t, double l, double k) {
double tmp;
if (k <= 3.1e+37) {
tmp = (l / (t / l)) * -0.11666666666666667;
} else {
tmp = l * ((l / t) * (-0.3333333333333333 / (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 <= 3.1d+37) then
tmp = (l / (t / l)) * (-0.11666666666666667d0)
else
tmp = l * ((l / t) * ((-0.3333333333333333d0) / (k * k)))
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 3.1e+37) {
tmp = (l / (t / l)) * -0.11666666666666667;
} else {
tmp = l * ((l / t) * (-0.3333333333333333 / (k * k)));
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 3.1e+37: tmp = (l / (t / l)) * -0.11666666666666667 else: tmp = l * ((l / t) * (-0.3333333333333333 / (k * k))) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 3.1e+37) tmp = Float64(Float64(l / Float64(t / l)) * -0.11666666666666667); else tmp = Float64(l * Float64(Float64(l / t) * Float64(-0.3333333333333333 / Float64(k * k)))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 3.1e+37) tmp = (l / (t / l)) * -0.11666666666666667; else tmp = l * ((l / t) * (-0.3333333333333333 / (k * k))); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 3.1e+37], N[(N[(l / N[(t / l), $MachinePrecision]), $MachinePrecision] * -0.11666666666666667), $MachinePrecision], N[(l * N[(N[(l / t), $MachinePrecision] * N[(-0.3333333333333333 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.1 \cdot 10^{+37}:\\
\;\;\;\;\frac{\ell}{\frac{t}{\ell}} \cdot -0.11666666666666667\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \left(\frac{\ell}{t} \cdot \frac{-0.3333333333333333}{k \cdot k}\right)\\
\end{array}
\end{array}
if k < 3.1000000000000002e37Initial program 34.8%
Taylor expanded in k around 0
/-lowering-/.f64N/A
Simplified29.0%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6414.6%
Simplified14.6%
associate-/l*N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
/-lowering-/.f64N/A
neg-sub0N/A
metadata-evalN/A
--lowering--.f64N/A
metadata-evalN/A
neg-sub0N/A
metadata-evalN/A
--lowering--.f64N/A
metadata-evalN/A
/-lowering-/.f6419.4%
Applied egg-rr19.4%
if 3.1000000000000002e37 < k Initial program 35.3%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified38.4%
Taylor expanded in k around 0
Simplified22.3%
Taylor expanded in k around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.8%
Simplified52.8%
associate-/l*N/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6454.6%
Applied egg-rr54.6%
Final simplification24.1%
(FPCore (t l k) :precision binary64 (* (/ (* 2.0 l) k) (/ (/ (/ l t) (* k k)) k)))
double code(double t, double l, double k) {
return ((2.0 * l) / k) * (((l / t) / (k * 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 * l) / k) * (((l / t) / (k * k)) / k)
end function
public static double code(double t, double l, double k) {
return ((2.0 * l) / k) * (((l / t) / (k * k)) / k);
}
def code(t, l, k): return ((2.0 * l) / k) * (((l / t) / (k * k)) / k)
function code(t, l, k) return Float64(Float64(Float64(2.0 * l) / k) * Float64(Float64(Float64(l / t) / Float64(k * k)) / k)) end
function tmp = code(t, l, k) tmp = ((2.0 * l) / k) * (((l / t) / (k * k)) / k); end
code[t_, l_, k_] := N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] * N[(N[(N[(l / t), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2 \cdot \ell}{k} \cdot \frac{\frac{\frac{\ell}{t}}{k \cdot k}}{k}
\end{array}
Initial program 35.0%
Taylor expanded in t around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified69.6%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6478.4%
Applied egg-rr78.4%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
unpow2N/A
associate-*r/N/A
tan-quotN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6491.9%
Applied egg-rr91.9%
Taylor expanded in k around 0
unpow2N/A
*-lowering-*.f6469.0%
Simplified69.0%
(FPCore (t l k) :precision binary64 (/ (/ (* (* l l) 0.3333333333333333) t) (* k k)))
double code(double t, double l, double k) {
return (((l * l) * 0.3333333333333333) / t) / (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 = (((l * l) * 0.3333333333333333d0) / t) / (k * k)
end function
public static double code(double t, double l, double k) {
return (((l * l) * 0.3333333333333333) / t) / (k * k);
}
def code(t, l, k): return (((l * l) * 0.3333333333333333) / t) / (k * k)
function code(t, l, k) return Float64(Float64(Float64(Float64(l * l) * 0.3333333333333333) / t) / Float64(k * k)) end
function tmp = code(t, l, k) tmp = (((l * l) * 0.3333333333333333) / t) / (k * k); end
code[t_, l_, k_] := N[(N[(N[(N[(l * l), $MachinePrecision] * 0.3333333333333333), $MachinePrecision] / t), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{\left(\ell \cdot \ell\right) \cdot 0.3333333333333333}{t}}{k \cdot k}
\end{array}
Initial program 35.0%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified41.3%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
/-lowering-/.f64N/A
Simplified17.2%
Taylor expanded in k around inf
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6420.6%
Simplified20.6%
Taylor expanded in k around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6455.8%
Simplified55.8%
(FPCore (t l k) :precision binary64 (* l (* (/ l t) (/ -0.3333333333333333 (* k k)))))
double code(double t, double l, double k) {
return l * ((l / t) * (-0.3333333333333333 / (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 = l * ((l / t) * ((-0.3333333333333333d0) / (k * k)))
end function
public static double code(double t, double l, double k) {
return l * ((l / t) * (-0.3333333333333333 / (k * k)));
}
def code(t, l, k): return l * ((l / t) * (-0.3333333333333333 / (k * k)))
function code(t, l, k) return Float64(l * Float64(Float64(l / t) * Float64(-0.3333333333333333 / Float64(k * k)))) end
function tmp = code(t, l, k) tmp = l * ((l / t) * (-0.3333333333333333 / (k * k))); end
code[t_, l_, k_] := N[(l * N[(N[(l / t), $MachinePrecision] * N[(-0.3333333333333333 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\ell \cdot \left(\frac{\ell}{t} \cdot \frac{-0.3333333333333333}{k \cdot k}\right)
\end{array}
Initial program 35.0%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified41.3%
Taylor expanded in k around 0
Simplified19.6%
Taylor expanded in k around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6429.4%
Simplified29.4%
associate-/l*N/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6430.7%
Applied egg-rr30.7%
(FPCore (t l k) :precision binary64 (* (* l l) (/ -0.11666666666666667 t)))
double code(double t, double l, double k) {
return (l * l) * (-0.11666666666666667 / t);
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
code = (l * l) * ((-0.11666666666666667d0) / t)
end function
public static double code(double t, double l, double k) {
return (l * l) * (-0.11666666666666667 / t);
}
def code(t, l, k): return (l * l) * (-0.11666666666666667 / t)
function code(t, l, k) return Float64(Float64(l * l) * Float64(-0.11666666666666667 / t)) end
function tmp = code(t, l, k) tmp = (l * l) * (-0.11666666666666667 / t); end
code[t_, l_, k_] := N[(N[(l * l), $MachinePrecision] * N[(-0.11666666666666667 / t), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\ell \cdot \ell\right) \cdot \frac{-0.11666666666666667}{t}
\end{array}
Initial program 35.0%
Taylor expanded in k around 0
/-lowering-/.f64N/A
Simplified26.1%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6419.9%
Simplified19.9%
div-invN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f6419.9%
Applied egg-rr19.9%
Final simplification19.9%
(FPCore (t l k) :precision binary64 (* l (* (/ l t) -0.11666666666666667)))
double code(double t, double l, double k) {
return l * ((l / t) * -0.11666666666666667);
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
code = l * ((l / t) * (-0.11666666666666667d0))
end function
public static double code(double t, double l, double k) {
return l * ((l / t) * -0.11666666666666667);
}
def code(t, l, k): return l * ((l / t) * -0.11666666666666667)
function code(t, l, k) return Float64(l * Float64(Float64(l / t) * -0.11666666666666667)) end
function tmp = code(t, l, k) tmp = l * ((l / t) * -0.11666666666666667); end
code[t_, l_, k_] := N[(l * N[(N[(l / t), $MachinePrecision] * -0.11666666666666667), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\ell \cdot \left(\frac{\ell}{t} \cdot -0.11666666666666667\right)
\end{array}
Initial program 35.0%
Taylor expanded in k around 0
/-lowering-/.f64N/A
Simplified26.1%
Taylor expanded in k around inf
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6419.9%
Simplified19.9%
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6417.4%
Applied egg-rr17.4%
Final simplification17.4%
herbie shell --seed 2024141
(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))))