
(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 17 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) t) (/ k l)) (sin k)) (tan k)))
double code(double t, double l, double k) {
return (((((2.0 * l) / k) / t) / (k / l)) / sin(k)) / 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) / t) / (k / l)) / sin(k)) / tan(k)
end function
public static double code(double t, double l, double k) {
return (((((2.0 * l) / k) / t) / (k / l)) / Math.sin(k)) / Math.tan(k);
}
def code(t, l, k): return (((((2.0 * l) / k) / t) / (k / l)) / math.sin(k)) / math.tan(k)
function code(t, l, k) return Float64(Float64(Float64(Float64(Float64(Float64(2.0 * l) / k) / t) / Float64(k / l)) / sin(k)) / tan(k)) end
function tmp = code(t, l, k) tmp = (((((2.0 * l) / k) / t) / (k / l)) / sin(k)) / tan(k); end
code[t_, l_, k_] := N[(N[(N[(N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] / t), $MachinePrecision] / N[(k / l), $MachinePrecision]), $MachinePrecision] / N[Sin[k], $MachinePrecision]), $MachinePrecision] / N[Tan[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{\frac{\frac{\frac{2 \cdot \ell}{k}}{t}}{\frac{k}{\ell}}}{\sin k}}{\tan k}
\end{array}
Initial program 34.4%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified37.5%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.2%
Applied egg-rr89.2%
*-rgt-identityN/A
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6490.8%
Applied egg-rr90.8%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.7%
Applied egg-rr95.7%
associate-*l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6498.6%
Applied egg-rr98.6%
(FPCore (t l k)
:precision binary64
(if (<= k 5.8e-63)
(/ (/ (/ (* l (/ (/ (* 2.0 l) k) k)) t) k) (tan k))
(if (<= k 3.8e+150)
(/ (* l (/ 2.0 (* k k))) (* (* (sin k) (tan k)) (/ t l)))
(* (/ l (tan k)) (/ (/ 2.0 (/ (* k (* k t)) l)) (sin k))))))
double code(double t, double l, double k) {
double tmp;
if (k <= 5.8e-63) {
tmp = (((l * (((2.0 * l) / k) / k)) / t) / k) / tan(k);
} else if (k <= 3.8e+150) {
tmp = (l * (2.0 / (k * k))) / ((sin(k) * tan(k)) * (t / l));
} else {
tmp = (l / tan(k)) * ((2.0 / ((k * (k * t)) / 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 <= 5.8d-63) then
tmp = (((l * (((2.0d0 * l) / k) / k)) / t) / k) / tan(k)
else if (k <= 3.8d+150) then
tmp = (l * (2.0d0 / (k * k))) / ((sin(k) * tan(k)) * (t / l))
else
tmp = (l / tan(k)) * ((2.0d0 / ((k * (k * t)) / l)) / sin(k))
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 5.8e-63) {
tmp = (((l * (((2.0 * l) / k) / k)) / t) / k) / Math.tan(k);
} else if (k <= 3.8e+150) {
tmp = (l * (2.0 / (k * k))) / ((Math.sin(k) * Math.tan(k)) * (t / l));
} else {
tmp = (l / Math.tan(k)) * ((2.0 / ((k * (k * t)) / l)) / Math.sin(k));
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 5.8e-63: tmp = (((l * (((2.0 * l) / k) / k)) / t) / k) / math.tan(k) elif k <= 3.8e+150: tmp = (l * (2.0 / (k * k))) / ((math.sin(k) * math.tan(k)) * (t / l)) else: tmp = (l / math.tan(k)) * ((2.0 / ((k * (k * t)) / l)) / math.sin(k)) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 5.8e-63) tmp = Float64(Float64(Float64(Float64(l * Float64(Float64(Float64(2.0 * l) / k) / k)) / t) / k) / tan(k)); elseif (k <= 3.8e+150) tmp = Float64(Float64(l * Float64(2.0 / Float64(k * k))) / Float64(Float64(sin(k) * tan(k)) * Float64(t / l))); else tmp = Float64(Float64(l / tan(k)) * Float64(Float64(2.0 / Float64(Float64(k * Float64(k * t)) / l)) / sin(k))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 5.8e-63) tmp = (((l * (((2.0 * l) / k) / k)) / t) / k) / tan(k); elseif (k <= 3.8e+150) tmp = (l * (2.0 / (k * k))) / ((sin(k) * tan(k)) * (t / l)); else tmp = (l / tan(k)) * ((2.0 / ((k * (k * t)) / l)) / sin(k)); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 5.8e-63], N[(N[(N[(N[(l * N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] / k), $MachinePrecision] / N[Tan[k], $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 3.8e+150], N[(N[(l * N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[Sin[k], $MachinePrecision] * N[Tan[k], $MachinePrecision]), $MachinePrecision] * N[(t / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(l / N[Tan[k], $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 / N[(N[(k * N[(k * t), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] / N[Sin[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5.8 \cdot 10^{-63}:\\
\;\;\;\;\frac{\frac{\frac{\ell \cdot \frac{\frac{2 \cdot \ell}{k}}{k}}{t}}{k}}{\tan k}\\
\mathbf{elif}\;k \leq 3.8 \cdot 10^{+150}:\\
\;\;\;\;\frac{\ell \cdot \frac{2}{k \cdot k}}{\left(\sin k \cdot \tan k\right) \cdot \frac{t}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell}{\tan k} \cdot \frac{\frac{2}{\frac{k \cdot \left(k \cdot t\right)}{\ell}}}{\sin k}\\
\end{array}
\end{array}
if k < 5.7999999999999995e-63Initial program 38.1%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified36.8%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.4%
Applied egg-rr89.4%
*-rgt-identityN/A
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6490.6%
Applied egg-rr90.6%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.5%
Applied egg-rr95.5%
Taylor expanded in k around 0
associate-*r/N/A
*-commutativeN/A
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified81.1%
if 5.7999999999999995e-63 < k < 3.79999999999999989e150Initial program 19.6%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified35.6%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6496.0%
Applied egg-rr96.0%
*-rgt-identityN/A
*-rgt-identityN/A
associate-/r/N/A
associate-/r*N/A
*-rgt-identityN/A
associate-/l/N/A
*-rgt-identityN/A
associate-/r*N/A
associate-/r/N/A
associate-*l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr98.0%
if 3.79999999999999989e150 < k Initial program 41.7%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified46.3%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6471.6%
Applied egg-rr71.6%
*-rgt-identityN/A
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6480.5%
Applied egg-rr80.5%
associate-/l/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-*l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f6484.1%
Applied egg-rr84.1%
Final simplification85.1%
(FPCore (t l k) :precision binary64 (if (<= k 1e-77) (/ (* (/ (/ (* 2.0 l) k) (sin k)) (/ l (* k t))) (tan k)) (/ (/ (* l (/ 2.0 k)) (* (sin k) (/ k (/ l t)))) (tan k))))
double code(double t, double l, double k) {
double tmp;
if (k <= 1e-77) {
tmp = ((((2.0 * l) / k) / sin(k)) * (l / (k * t))) / tan(k);
} else {
tmp = ((l * (2.0 / k)) / (sin(k) * (k / (l / 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 <= 1d-77) then
tmp = ((((2.0d0 * l) / k) / sin(k)) * (l / (k * t))) / tan(k)
else
tmp = ((l * (2.0d0 / k)) / (sin(k) * (k / (l / t)))) / tan(k)
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 1e-77) {
tmp = ((((2.0 * l) / k) / Math.sin(k)) * (l / (k * t))) / Math.tan(k);
} else {
tmp = ((l * (2.0 / k)) / (Math.sin(k) * (k / (l / t)))) / Math.tan(k);
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 1e-77: tmp = ((((2.0 * l) / k) / math.sin(k)) * (l / (k * t))) / math.tan(k) else: tmp = ((l * (2.0 / k)) / (math.sin(k) * (k / (l / t)))) / math.tan(k) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 1e-77) tmp = Float64(Float64(Float64(Float64(Float64(2.0 * l) / k) / sin(k)) * Float64(l / Float64(k * t))) / tan(k)); else tmp = Float64(Float64(Float64(l * Float64(2.0 / k)) / Float64(sin(k) * Float64(k / Float64(l / t)))) / tan(k)); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 1e-77) tmp = ((((2.0 * l) / k) / sin(k)) * (l / (k * t))) / tan(k); else tmp = ((l * (2.0 / k)) / (sin(k) * (k / (l / t)))) / tan(k); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 1e-77], N[(N[(N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] / N[Sin[k], $MachinePrecision]), $MachinePrecision] * N[(l / N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Tan[k], $MachinePrecision]), $MachinePrecision], N[(N[(N[(l * N[(2.0 / k), $MachinePrecision]), $MachinePrecision] / N[(N[Sin[k], $MachinePrecision] * N[(k / N[(l / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Tan[k], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 10^{-77}:\\
\;\;\;\;\frac{\frac{\frac{2 \cdot \ell}{k}}{\sin k} \cdot \frac{\ell}{k \cdot t}}{\tan k}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\ell \cdot \frac{2}{k}}{\sin k \cdot \frac{k}{\frac{\ell}{t}}}}{\tan k}\\
\end{array}
\end{array}
if k < 9.9999999999999993e-78Initial program 39.2%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified37.9%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.1%
Applied egg-rr89.1%
*-rgt-identityN/A
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6490.3%
Applied egg-rr90.3%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.4%
Applied egg-rr95.4%
div-invN/A
associate-*l/N/A
associate-*l/N/A
div-invN/A
*-lowering-*.f64N/A
un-div-invN/A
/-lowering-/.f64N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
associate-*r/N/A
clear-numN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6495.4%
Applied egg-rr95.4%
if 9.9999999999999993e-78 < k Initial program 24.7%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified36.6%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.4%
Applied egg-rr89.4%
*-rgt-identityN/A
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6491.9%
Applied egg-rr91.9%
associate-/l*N/A
frac-timesN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sin-lowering-sin.f6495.3%
Applied egg-rr95.3%
Final simplification95.4%
(FPCore (t l k) :precision binary64 (if (<= k 1.25e-49) (/ (/ (/ (* l (/ (/ (* 2.0 l) k) k)) t) k) (tan k)) (* (/ 2.0 (* k k)) (/ (/ (* l l) t) (* (sin k) (tan k))))))
double code(double t, double l, double k) {
double tmp;
if (k <= 1.25e-49) {
tmp = (((l * (((2.0 * l) / k) / k)) / t) / k) / tan(k);
} else {
tmp = (2.0 / (k * k)) * (((l * l) / t) / (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 <= 1.25d-49) then
tmp = (((l * (((2.0d0 * l) / k) / k)) / t) / k) / tan(k)
else
tmp = (2.0d0 / (k * k)) * (((l * l) / t) / (sin(k) * tan(k)))
end if
code = tmp
end function
public static double code(double t, double l, double k) {
double tmp;
if (k <= 1.25e-49) {
tmp = (((l * (((2.0 * l) / k) / k)) / t) / k) / Math.tan(k);
} else {
tmp = (2.0 / (k * k)) * (((l * l) / t) / (Math.sin(k) * Math.tan(k)));
}
return tmp;
}
def code(t, l, k): tmp = 0 if k <= 1.25e-49: tmp = (((l * (((2.0 * l) / k) / k)) / t) / k) / math.tan(k) else: tmp = (2.0 / (k * k)) * (((l * l) / t) / (math.sin(k) * math.tan(k))) return tmp
function code(t, l, k) tmp = 0.0 if (k <= 1.25e-49) tmp = Float64(Float64(Float64(Float64(l * Float64(Float64(Float64(2.0 * l) / k) / k)) / t) / k) / tan(k)); else tmp = Float64(Float64(2.0 / Float64(k * k)) * Float64(Float64(Float64(l * l) / t) / Float64(sin(k) * tan(k)))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (k <= 1.25e-49) tmp = (((l * (((2.0 * l) / k) / k)) / t) / k) / tan(k); else tmp = (2.0 / (k * k)) * (((l * l) / t) / (sin(k) * tan(k))); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[k, 1.25e-49], N[(N[(N[(N[(l * N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] / k), $MachinePrecision] / N[Tan[k], $MachinePrecision]), $MachinePrecision], N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] / t), $MachinePrecision] / N[(N[Sin[k], $MachinePrecision] * N[Tan[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.25 \cdot 10^{-49}:\\
\;\;\;\;\frac{\frac{\frac{\ell \cdot \frac{\frac{2 \cdot \ell}{k}}{k}}{t}}{k}}{\tan k}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{k \cdot k} \cdot \frac{\frac{\ell \cdot \ell}{t}}{\sin k \cdot \tan k}\\
\end{array}
\end{array}
if k < 1.25e-49Initial program 37.2%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified37.1%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.8%
Applied egg-rr89.8%
*-rgt-identityN/A
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6490.9%
Applied egg-rr90.9%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.7%
Applied egg-rr95.7%
Taylor expanded in k around 0
associate-*r/N/A
*-commutativeN/A
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified81.3%
if 1.25e-49 < k Initial program 27.3%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified38.4%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6487.7%
Applied egg-rr87.7%
*-rgt-identityN/A
*-rgt-identityN/A
associate-/r/N/A
associate-/r*N/A
*-rgt-identityN/A
associate-/l/N/A
*-rgt-identityN/A
div-invN/A
clear-numN/A
associate-/l*N/A
*-lowering-*.f64N/A
Applied egg-rr86.3%
(FPCore (t l k) :precision binary64 (/ (* (/ (/ (* 2.0 l) k) (sin k)) (/ l (* k t))) (tan k)))
double code(double t, double l, double k) {
return ((((2.0 * l) / k) / sin(k)) * (l / (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) / sin(k)) * (l / (k * t))) / tan(k)
end function
public static double code(double t, double l, double k) {
return ((((2.0 * l) / k) / Math.sin(k)) * (l / (k * t))) / Math.tan(k);
}
def code(t, l, k): return ((((2.0 * l) / k) / math.sin(k)) * (l / (k * t))) / math.tan(k)
function code(t, l, k) return Float64(Float64(Float64(Float64(Float64(2.0 * l) / k) / sin(k)) * Float64(l / Float64(k * t))) / tan(k)) end
function tmp = code(t, l, k) tmp = ((((2.0 * l) / k) / sin(k)) * (l / (k * t))) / tan(k); end
code[t_, l_, k_] := N[(N[(N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] / N[Sin[k], $MachinePrecision]), $MachinePrecision] * N[(l / N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Tan[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{\frac{2 \cdot \ell}{k}}{\sin k} \cdot \frac{\ell}{k \cdot t}}{\tan k}
\end{array}
Initial program 34.4%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified37.5%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.2%
Applied egg-rr89.2%
*-rgt-identityN/A
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6490.8%
Applied egg-rr90.8%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.7%
Applied egg-rr95.7%
div-invN/A
associate-*l/N/A
associate-*l/N/A
div-invN/A
*-lowering-*.f64N/A
un-div-invN/A
/-lowering-/.f64N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
associate-*r/N/A
clear-numN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6495.8%
Applied egg-rr95.8%
(FPCore (t l k) :precision binary64 (* (/ l (tan k)) (/ (/ 2.0 (/ (* k (* k t)) l)) (sin k))))
double code(double t, double l, double k) {
return (l / tan(k)) * ((2.0 / ((k * (k * t)) / l)) / sin(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 / tan(k)) * ((2.0d0 / ((k * (k * t)) / l)) / sin(k))
end function
public static double code(double t, double l, double k) {
return (l / Math.tan(k)) * ((2.0 / ((k * (k * t)) / l)) / Math.sin(k));
}
def code(t, l, k): return (l / math.tan(k)) * ((2.0 / ((k * (k * t)) / l)) / math.sin(k))
function code(t, l, k) return Float64(Float64(l / tan(k)) * Float64(Float64(2.0 / Float64(Float64(k * Float64(k * t)) / l)) / sin(k))) end
function tmp = code(t, l, k) tmp = (l / tan(k)) * ((2.0 / ((k * (k * t)) / l)) / sin(k)); end
code[t_, l_, k_] := N[(N[(l / N[Tan[k], $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 / N[(N[(k * N[(k * t), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] / N[Sin[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\ell}{\tan k} \cdot \frac{\frac{2}{\frac{k \cdot \left(k \cdot t\right)}{\ell}}}{\sin k}
\end{array}
Initial program 34.4%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified37.5%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.2%
Applied egg-rr89.2%
*-rgt-identityN/A
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6490.8%
Applied egg-rr90.8%
associate-/l/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-*l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f6490.1%
Applied egg-rr90.1%
(FPCore (t l k) :precision binary64 (/ (/ (/ (* l (/ (/ (* 2.0 l) k) k)) t) k) (tan k)))
double code(double t, double l, double k) {
return (((l * (((2.0 * l) / k) / k)) / t) / k) / 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 = (((l * (((2.0d0 * l) / k) / k)) / t) / k) / tan(k)
end function
public static double code(double t, double l, double k) {
return (((l * (((2.0 * l) / k) / k)) / t) / k) / Math.tan(k);
}
def code(t, l, k): return (((l * (((2.0 * l) / k) / k)) / t) / k) / math.tan(k)
function code(t, l, k) return Float64(Float64(Float64(Float64(l * Float64(Float64(Float64(2.0 * l) / k) / k)) / t) / k) / tan(k)) end
function tmp = code(t, l, k) tmp = (((l * (((2.0 * l) / k) / k)) / t) / k) / tan(k); end
code[t_, l_, k_] := N[(N[(N[(N[(l * N[(N[(N[(2.0 * l), $MachinePrecision] / k), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] / k), $MachinePrecision] / N[Tan[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{\frac{\ell \cdot \frac{\frac{2 \cdot \ell}{k}}{k}}{t}}{k}}{\tan k}
\end{array}
Initial program 34.4%
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified37.5%
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
associate-/r/N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-lowering-*.f64N/A
associate-/l/N/A
pow2N/A
/-lowering-/.f64N/A
pow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.2%
Applied egg-rr89.2%
*-rgt-identityN/A
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6490.8%
Applied egg-rr90.8%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.7%
Applied egg-rr95.7%
Taylor expanded in k around 0
associate-*r/N/A
*-commutativeN/A
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified79.6%
(FPCore (t l k) :precision binary64 (if (<= t 2e-101) (/ 2.0 (* (/ t l) (* k (/ (* k k) (/ l k))))) (* (/ (* 2.0 l) (* k k)) (/ l (* k (* k t))))))
double code(double t, double l, double k) {
double tmp;
if (t <= 2e-101) {
tmp = 2.0 / ((t / l) * (k * ((k * k) / (l / k))));
} else {
tmp = ((2.0 * l) / (k * 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 <= 2d-101) then
tmp = 2.0d0 / ((t / l) * (k * ((k * k) / (l / k))))
else
tmp = ((2.0d0 * l) / (k * 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 <= 2e-101) {
tmp = 2.0 / ((t / l) * (k * ((k * k) / (l / k))));
} else {
tmp = ((2.0 * l) / (k * k)) * (l / (k * (k * t)));
}
return tmp;
}
def code(t, l, k): tmp = 0 if t <= 2e-101: tmp = 2.0 / ((t / l) * (k * ((k * k) / (l / k)))) else: tmp = ((2.0 * l) / (k * k)) * (l / (k * (k * t))) return tmp
function code(t, l, k) tmp = 0.0 if (t <= 2e-101) tmp = Float64(2.0 / Float64(Float64(t / l) * Float64(k * Float64(Float64(k * k) / Float64(l / k))))); else tmp = Float64(Float64(Float64(2.0 * l) / Float64(k * k)) * Float64(l / Float64(k * Float64(k * t)))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (t <= 2e-101) tmp = 2.0 / ((t / l) * (k * ((k * k) / (l / k)))); else tmp = ((2.0 * l) / (k * k)) * (l / (k * (k * t))); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[t, 2e-101], N[(2.0 / N[(N[(t / l), $MachinePrecision] * N[(k * N[(N[(k * k), $MachinePrecision] / N[(l / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 * l), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k * N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 2 \cdot 10^{-101}:\\
\;\;\;\;\frac{2}{\frac{t}{\ell} \cdot \left(k \cdot \frac{k \cdot k}{\frac{\ell}{k}}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2 \cdot \ell}{k \cdot k} \cdot \frac{\ell}{k \cdot \left(k \cdot t\right)}\\
\end{array}
\end{array}
if t < 2.0000000000000001e-101Initial program 31.0%
Taylor expanded in k around 0
associate-/l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6462.5%
Simplified62.5%
associate-*r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
cube-unmultN/A
*-lowering-*.f64N/A
cube-unmultN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6471.1%
Applied egg-rr71.1%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6474.4%
Applied egg-rr74.4%
if 2.0000000000000001e-101 < t Initial program 40.6%
Taylor expanded in k around 0
associate-/l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6477.8%
Simplified77.8%
associate-/r*N/A
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6479.2%
Applied egg-rr79.2%
associate-*l/N/A
div-invN/A
associate-/l/N/A
associate-*l/N/A
clear-numN/A
times-fracN/A
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6481.5%
Applied egg-rr81.5%
Final simplification76.9%
(FPCore (t l k) :precision binary64 (if (<= t 5e-142) (/ 2.0 (* k (* k (/ (* k k) (/ l (/ t l)))))) (* (/ (* 2.0 l) (* k k)) (/ l (* k (* k t))))))
double code(double t, double l, double k) {
double tmp;
if (t <= 5e-142) {
tmp = 2.0 / (k * (k * ((k * k) / (l / (t / l)))));
} else {
tmp = ((2.0 * l) / (k * 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 <= 5d-142) then
tmp = 2.0d0 / (k * (k * ((k * k) / (l / (t / l)))))
else
tmp = ((2.0d0 * l) / (k * 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 <= 5e-142) {
tmp = 2.0 / (k * (k * ((k * k) / (l / (t / l)))));
} else {
tmp = ((2.0 * l) / (k * k)) * (l / (k * (k * t)));
}
return tmp;
}
def code(t, l, k): tmp = 0 if t <= 5e-142: tmp = 2.0 / (k * (k * ((k * k) / (l / (t / l))))) else: tmp = ((2.0 * l) / (k * k)) * (l / (k * (k * t))) return tmp
function code(t, l, k) tmp = 0.0 if (t <= 5e-142) tmp = Float64(2.0 / Float64(k * Float64(k * Float64(Float64(k * k) / Float64(l / Float64(t / l)))))); else tmp = Float64(Float64(Float64(2.0 * l) / Float64(k * k)) * Float64(l / Float64(k * Float64(k * t)))); end return tmp end
function tmp_2 = code(t, l, k) tmp = 0.0; if (t <= 5e-142) tmp = 2.0 / (k * (k * ((k * k) / (l / (t / l))))); else tmp = ((2.0 * l) / (k * k)) * (l / (k * (k * t))); end tmp_2 = tmp; end
code[t_, l_, k_] := If[LessEqual[t, 5e-142], N[(2.0 / N[(k * N[(k * N[(N[(k * k), $MachinePrecision] / N[(l / N[(t / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 * l), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k * N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 5 \cdot 10^{-142}:\\
\;\;\;\;\frac{2}{k \cdot \left(k \cdot \frac{k \cdot k}{\frac{\ell}{\frac{t}{\ell}}}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2 \cdot \ell}{k \cdot k} \cdot \frac{\ell}{k \cdot \left(k \cdot t\right)}\\
\end{array}
\end{array}
if t < 5.0000000000000002e-142Initial program 29.7%
Taylor expanded in k around 0
associate-/l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6462.6%
Simplified62.6%
associate-*r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
cube-unmultN/A
*-lowering-*.f64N/A
cube-unmultN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6471.0%
Applied egg-rr71.0%
frac-timesN/A
remove-double-divN/A
unpow-1N/A
un-div-invN/A
associate-*r*N/A
associate-*r*N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
un-div-invN/A
unpow-1N/A
associate-/l/N/A
associate-*r*N/A
div-invN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr72.3%
if 5.0000000000000002e-142 < t Initial program 41.5%
Taylor expanded in k around 0
associate-/l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6476.2%
Simplified76.2%
associate-/r*N/A
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6478.4%
Applied egg-rr78.4%
associate-*l/N/A
div-invN/A
associate-/l/N/A
associate-*l/N/A
clear-numN/A
times-fracN/A
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6480.6%
Applied egg-rr80.6%
(FPCore (t l k) :precision binary64 (* (/ (* 2.0 l) (* k k)) (/ l (* k (* k t)))))
double code(double t, double l, double k) {
return ((2.0 * l) / (k * k)) * (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 = ((2.0d0 * l) / (k * k)) * (l / (k * (k * t)))
end function
public static double code(double t, double l, double k) {
return ((2.0 * l) / (k * k)) * (l / (k * (k * t)));
}
def code(t, l, k): return ((2.0 * l) / (k * k)) * (l / (k * (k * t)))
function code(t, l, k) return Float64(Float64(Float64(2.0 * l) / Float64(k * k)) * Float64(l / Float64(k * Float64(k * t)))) end
function tmp = code(t, l, k) tmp = ((2.0 * l) / (k * k)) * (l / (k * (k * t))); end
code[t_, l_, k_] := N[(N[(N[(2.0 * l), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k * N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2 \cdot \ell}{k \cdot k} \cdot \frac{\ell}{k \cdot \left(k \cdot t\right)}
\end{array}
Initial program 34.4%
Taylor expanded in k around 0
associate-/l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6467.9%
Simplified67.9%
associate-/r*N/A
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6472.2%
Applied egg-rr72.2%
associate-*l/N/A
div-invN/A
associate-/l/N/A
associate-*l/N/A
clear-numN/A
times-fracN/A
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6476.0%
Applied egg-rr76.0%
(FPCore (t l k) :precision binary64 (* (/ 2.0 (* k k)) (/ (* l l) (* k (* k t)))))
double code(double t, double l, double k) {
return (2.0 / (k * k)) * ((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 = (2.0d0 / (k * k)) * ((l * l) / (k * (k * t)))
end function
public static double code(double t, double l, double k) {
return (2.0 / (k * k)) * ((l * l) / (k * (k * t)));
}
def code(t, l, k): return (2.0 / (k * k)) * ((l * l) / (k * (k * t)))
function code(t, l, k) return Float64(Float64(2.0 / Float64(k * k)) * Float64(Float64(l * l) / Float64(k * Float64(k * t)))) end
function tmp = code(t, l, k) tmp = (2.0 / (k * k)) * ((l * l) / (k * (k * t))); end
code[t_, l_, k_] := N[(N[(2.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] / N[(k * N[(k * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{k \cdot k} \cdot \frac{\ell \cdot \ell}{k \cdot \left(k \cdot t\right)}
\end{array}
Initial program 34.4%
Taylor expanded in k around 0
associate-/l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6467.9%
Simplified67.9%
associate-/r*N/A
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6472.2%
Applied egg-rr72.2%
associate-*l/N/A
div-invN/A
clear-numN/A
associate-*r*N/A
associate-/l/N/A
associate-/l*N/A
times-fracN/A
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6470.3%
Applied egg-rr70.3%
(FPCore (t l k) :precision binary64 (/ 1.0 (/ t (* l (* l -0.11666666666666667)))))
double code(double t, double l, double k) {
return 1.0 / (t / (l * (l * -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 = 1.0d0 / (t / (l * (l * (-0.11666666666666667d0))))
end function
public static double code(double t, double l, double k) {
return 1.0 / (t / (l * (l * -0.11666666666666667)));
}
def code(t, l, k): return 1.0 / (t / (l * (l * -0.11666666666666667)))
function code(t, l, k) return Float64(1.0 / Float64(t / Float64(l * Float64(l * -0.11666666666666667)))) end
function tmp = code(t, l, k) tmp = 1.0 / (t / (l * (l * -0.11666666666666667))); end
code[t_, l_, k_] := N[(1.0 / N[(t / N[(l * N[(l * -0.11666666666666667), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{t}{\ell \cdot \left(\ell \cdot -0.11666666666666667\right)}}
\end{array}
Initial program 34.4%
Taylor expanded in k around 0
Simplified37.0%
Taylor expanded in k around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.9%
Simplified24.9%
div-invN/A
associate-*r/N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6425.1%
Applied egg-rr25.1%
Final simplification25.1%
(FPCore (t l k) :precision binary64 (/ (/ -0.11666666666666667 t) (/ 1.0 (* l l))))
double code(double t, double l, double k) {
return (-0.11666666666666667 / t) / (1.0 / (l * l));
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
code = ((-0.11666666666666667d0) / t) / (1.0d0 / (l * l))
end function
public static double code(double t, double l, double k) {
return (-0.11666666666666667 / t) / (1.0 / (l * l));
}
def code(t, l, k): return (-0.11666666666666667 / t) / (1.0 / (l * l))
function code(t, l, k) return Float64(Float64(-0.11666666666666667 / t) / Float64(1.0 / Float64(l * l))) end
function tmp = code(t, l, k) tmp = (-0.11666666666666667 / t) / (1.0 / (l * l)); end
code[t_, l_, k_] := N[(N[(-0.11666666666666667 / t), $MachinePrecision] / N[(1.0 / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{-0.11666666666666667}{t}}{\frac{1}{\ell \cdot \ell}}
\end{array}
Initial program 34.4%
Taylor expanded in k around 0
Simplified37.0%
Taylor expanded in k around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.9%
Simplified24.9%
associate-/l*N/A
*-commutativeN/A
/-rgt-identityN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6424.9%
Applied egg-rr24.9%
(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 * Float64(l * -0.11666666666666667)) / t) end
function tmp = code(t, l, k) tmp = (l * (l * -0.11666666666666667)) / t; end
code[t_, l_, k_] := N[(N[(l * N[(l * -0.11666666666666667), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]
\begin{array}{l}
\\
\frac{\ell \cdot \left(\ell \cdot -0.11666666666666667\right)}{t}
\end{array}
Initial program 34.4%
Taylor expanded in k around 0
Simplified37.0%
Taylor expanded in k around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.9%
Simplified24.9%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6424.9%
Applied egg-rr24.9%
Final simplification24.9%
(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 34.4%
Taylor expanded in k around 0
Simplified37.0%
Taylor expanded in k around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.9%
Simplified24.9%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6424.5%
Applied egg-rr24.5%
Final simplification24.5%
(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(l / Float64(t / -0.11666666666666667))) end
function tmp = code(t, l, k) tmp = l * (l / (t / -0.11666666666666667)); end
code[t_, l_, k_] := N[(l * N[(l / N[(t / -0.11666666666666667), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\ell \cdot \frac{\ell}{\frac{t}{-0.11666666666666667}}
\end{array}
Initial program 34.4%
Taylor expanded in k around 0
Simplified37.0%
Taylor expanded in k around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.9%
Simplified24.9%
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6422.6%
Applied egg-rr22.6%
(FPCore (t l k) :precision binary64 (* (/ l (/ t l)) -0.11666666666666667))
double code(double t, double l, double k) {
return (l / (t / l)) * -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 / (t / l)) * (-0.11666666666666667d0)
end function
public static double code(double t, double l, double k) {
return (l / (t / l)) * -0.11666666666666667;
}
def code(t, l, k): return (l / (t / l)) * -0.11666666666666667
function code(t, l, k) return Float64(Float64(l / Float64(t / l)) * -0.11666666666666667) end
function tmp = code(t, l, k) tmp = (l / (t / l)) * -0.11666666666666667; end
code[t_, l_, k_] := N[(N[(l / N[(t / l), $MachinePrecision]), $MachinePrecision] * -0.11666666666666667), $MachinePrecision]
\begin{array}{l}
\\
\frac{\ell}{\frac{t}{\ell}} \cdot -0.11666666666666667
\end{array}
Initial program 34.4%
Taylor expanded in k around 0
Simplified37.0%
Taylor expanded in k around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.9%
Simplified24.9%
*-commutativeN/A
associate-/l*N/A
associate-*r/N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6422.2%
Applied egg-rr22.2%
Final simplification22.2%
herbie shell --seed 2024288
(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))))