
(FPCore (t l k) :precision binary64 (/ 2.0 (* (* (* (/ (pow t 3.0) (* l l)) (sin k)) (tan k)) (- (+ 1.0 (pow (/ k t) 2.0)) 1.0))))
double code(double t, double l, double k) {
return 2.0 / ((((pow(t, 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + pow((k / t), 2.0)) - 1.0));
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
code = 2.0d0 / (((((t ** 3.0d0) / (l * l)) * sin(k)) * tan(k)) * ((1.0d0 + ((k / t) ** 2.0d0)) - 1.0d0))
end function
public static double code(double t, double l, double k) {
return 2.0 / ((((Math.pow(t, 3.0) / (l * l)) * Math.sin(k)) * Math.tan(k)) * ((1.0 + Math.pow((k / t), 2.0)) - 1.0));
}
def code(t, l, k): return 2.0 / ((((math.pow(t, 3.0) / (l * l)) * math.sin(k)) * math.tan(k)) * ((1.0 + math.pow((k / t), 2.0)) - 1.0))
function code(t, l, k) return Float64(2.0 / Float64(Float64(Float64(Float64((t ^ 3.0) / Float64(l * l)) * sin(k)) * tan(k)) * Float64(Float64(1.0 + (Float64(k / t) ^ 2.0)) - 1.0))) end
function tmp = code(t, l, k) tmp = 2.0 / (((((t ^ 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + ((k / t) ^ 2.0)) - 1.0)); end
code[t_, l_, k_] := N[(2.0 / N[(N[(N[(N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision] * N[Sin[k], $MachinePrecision]), $MachinePrecision] * N[Tan[k], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\left(\left(\frac{{t}^{3}}{\ell \cdot \ell} \cdot \sin k\right) \cdot \tan k\right) \cdot \left(\left(1 + {\left(\frac{k}{t}\right)}^{2}\right) - 1\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (t l k) :precision binary64 (/ 2.0 (* (* (* (/ (pow t 3.0) (* l l)) (sin k)) (tan k)) (- (+ 1.0 (pow (/ k t) 2.0)) 1.0))))
double code(double t, double l, double k) {
return 2.0 / ((((pow(t, 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + pow((k / t), 2.0)) - 1.0));
}
real(8) function code(t, l, k)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k
code = 2.0d0 / (((((t ** 3.0d0) / (l * l)) * sin(k)) * tan(k)) * ((1.0d0 + ((k / t) ** 2.0d0)) - 1.0d0))
end function
public static double code(double t, double l, double k) {
return 2.0 / ((((Math.pow(t, 3.0) / (l * l)) * Math.sin(k)) * Math.tan(k)) * ((1.0 + Math.pow((k / t), 2.0)) - 1.0));
}
def code(t, l, k): return 2.0 / ((((math.pow(t, 3.0) / (l * l)) * math.sin(k)) * math.tan(k)) * ((1.0 + math.pow((k / t), 2.0)) - 1.0))
function code(t, l, k) return Float64(2.0 / Float64(Float64(Float64(Float64((t ^ 3.0) / Float64(l * l)) * sin(k)) * tan(k)) * Float64(Float64(1.0 + (Float64(k / t) ^ 2.0)) - 1.0))) end
function tmp = code(t, l, k) tmp = 2.0 / (((((t ^ 3.0) / (l * l)) * sin(k)) * tan(k)) * ((1.0 + ((k / t) ^ 2.0)) - 1.0)); end
code[t_, l_, k_] := N[(2.0 / N[(N[(N[(N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision] * N[Sin[k], $MachinePrecision]), $MachinePrecision] * N[Tan[k], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\left(\left(\frac{{t}^{3}}{\ell \cdot \ell} \cdot \sin k\right) \cdot \tan k\right) \cdot \left(\left(1 + {\left(\frac{k}{t}\right)}^{2}\right) - 1\right)}
\end{array}
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 1.05e-100) (* (/ (+ l l) (* t (* k_m k_m))) (/ l (* k_m k_m))) (* (/ (+ l l) k_m) (/ (* l (/ 1.0 (* k_m (* (sin k_m) (tan k_m))))) t))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 1.05e-100) {
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m));
} else {
tmp = ((l + l) / k_m) * ((l * (1.0 / (k_m * (sin(k_m) * tan(k_m))))) / t);
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 1.05d-100) then
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m))
else
tmp = ((l + l) / k_m) * ((l * (1.0d0 / (k_m * (sin(k_m) * tan(k_m))))) / t)
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 1.05e-100) {
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m));
} else {
tmp = ((l + l) / k_m) * ((l * (1.0 / (k_m * (Math.sin(k_m) * Math.tan(k_m))))) / t);
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 1.05e-100: tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m)) else: tmp = ((l + l) / k_m) * ((l * (1.0 / (k_m * (math.sin(k_m) * math.tan(k_m))))) / t) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 1.05e-100) tmp = Float64(Float64(Float64(l + l) / Float64(t * Float64(k_m * k_m))) * Float64(l / Float64(k_m * k_m))); else tmp = Float64(Float64(Float64(l + l) / k_m) * Float64(Float64(l * Float64(1.0 / Float64(k_m * Float64(sin(k_m) * tan(k_m))))) / t)); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 1.05e-100) tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m)); else tmp = ((l + l) / k_m) * ((l * (1.0 / (k_m * (sin(k_m) * tan(k_m))))) / t); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 1.05e-100], N[(N[(N[(l + l), $MachinePrecision] / N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(l + l), $MachinePrecision] / k$95$m), $MachinePrecision] * N[(N[(l * N[(1.0 / N[(k$95$m * N[(N[Sin[k$95$m], $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 1.05 \cdot 10^{-100}:\\
\;\;\;\;\frac{\ell + \ell}{t \cdot \left(k\_m \cdot k\_m\right)} \cdot \frac{\ell}{k\_m \cdot k\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell + \ell}{k\_m} \cdot \frac{\ell \cdot \frac{1}{k\_m \cdot \left(\sin k\_m \cdot \tan k\_m\right)}}{t}\\
\end{array}
\end{array}
if k < 1.05000000000000005e-100Initial program 43.2%
Taylor expanded in k around 0
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-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-*.f6464.8
Simplified64.8%
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6481.6
Applied egg-rr81.6%
if 1.05000000000000005e-100 < k Initial program 24.5%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6476.6
Simplified76.6%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr79.6%
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr98.3%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6498.5
Applied egg-rr98.5%
Final simplification86.7%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<=
(/
2.0
(*
(* (tan k_m) (* (sin k_m) (/ (pow t 3.0) (* l l))))
(+ (+ 1.0 (pow (/ k_m t) 2.0)) -1.0)))
-4e-181)
(*
(/ (+ l l) k_m)
(/
(/ (/ (fma l (* (* k_m k_m) -0.16666666666666666) l) (* k_m k_m)) k_m)
t))
(* (/ (+ l l) (* t (* k_m k_m))) (/ l (* k_m k_m)))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((tan(k_m) * (sin(k_m) * (pow(t, 3.0) / (l * l)))) * ((1.0 + pow((k_m / t), 2.0)) + -1.0))) <= -4e-181) {
tmp = ((l + l) / k_m) * (((fma(l, ((k_m * k_m) * -0.16666666666666666), l) / (k_m * k_m)) / k_m) / t);
} else {
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (Float64(2.0 / Float64(Float64(tan(k_m) * Float64(sin(k_m) * Float64((t ^ 3.0) / Float64(l * l)))) * Float64(Float64(1.0 + (Float64(k_m / t) ^ 2.0)) + -1.0))) <= -4e-181) tmp = Float64(Float64(Float64(l + l) / k_m) * Float64(Float64(Float64(fma(l, Float64(Float64(k_m * k_m) * -0.16666666666666666), l) / Float64(k_m * k_m)) / k_m) / t)); else tmp = Float64(Float64(Float64(l + l) / Float64(t * Float64(k_m * k_m))) * Float64(l / Float64(k_m * k_m))); end return tmp end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[N[(2.0 / N[(N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k$95$m / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -4e-181], N[(N[(N[(l + l), $MachinePrecision] / k$95$m), $MachinePrecision] * N[(N[(N[(N[(l * N[(N[(k$95$m * k$95$m), $MachinePrecision] * -0.16666666666666666), $MachinePrecision] + l), $MachinePrecision] / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision] / k$95$m), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(N[(l + l), $MachinePrecision] / N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;\frac{2}{\left(\tan k\_m \cdot \left(\sin k\_m \cdot \frac{{t}^{3}}{\ell \cdot \ell}\right)\right) \cdot \left(\left(1 + {\left(\frac{k\_m}{t}\right)}^{2}\right) + -1\right)} \leq -4 \cdot 10^{-181}:\\
\;\;\;\;\frac{\ell + \ell}{k\_m} \cdot \frac{\frac{\frac{\mathsf{fma}\left(\ell, \left(k\_m \cdot k\_m\right) \cdot -0.16666666666666666, \ell\right)}{k\_m \cdot k\_m}}{k\_m}}{t}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell + \ell}{t \cdot \left(k\_m \cdot k\_m\right)} \cdot \frac{\ell}{k\_m \cdot k\_m}\\
\end{array}
\end{array}
if (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) < -4.00000000000000019e-181Initial program 90.4%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6497.5
Simplified97.5%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr90.9%
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in k around 0
/-lowering-/.f64N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6488.8
Simplified88.8%
if -4.00000000000000019e-181 < (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) Initial program 27.8%
Taylor expanded in k around 0
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-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-*.f6460.3
Simplified60.3%
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6475.2
Applied egg-rr75.2%
Final simplification77.4%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<=
(/
2.0
(*
(* (tan k_m) (* (sin k_m) (/ (pow t 3.0) (* l l))))
(+ (+ 1.0 (pow (/ k_m t) 2.0)) -1.0)))
-2e-76)
(/ -1.0 0.0)
(* (/ (+ l l) (* t (* k_m k_m))) (/ l (* k_m k_m)))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((tan(k_m) * (sin(k_m) * (pow(t, 3.0) / (l * l)))) * ((1.0 + pow((k_m / t), 2.0)) + -1.0))) <= -2e-76) {
tmp = -1.0 / 0.0;
} else {
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if ((2.0d0 / ((tan(k_m) * (sin(k_m) * ((t ** 3.0d0) / (l * l)))) * ((1.0d0 + ((k_m / t) ** 2.0d0)) + (-1.0d0)))) <= (-2d-76)) then
tmp = (-1.0d0) / 0.0d0
else
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((Math.tan(k_m) * (Math.sin(k_m) * (Math.pow(t, 3.0) / (l * l)))) * ((1.0 + Math.pow((k_m / t), 2.0)) + -1.0))) <= -2e-76) {
tmp = -1.0 / 0.0;
} else {
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if (2.0 / ((math.tan(k_m) * (math.sin(k_m) * (math.pow(t, 3.0) / (l * l)))) * ((1.0 + math.pow((k_m / t), 2.0)) + -1.0))) <= -2e-76: tmp = -1.0 / 0.0 else: tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m)) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (Float64(2.0 / Float64(Float64(tan(k_m) * Float64(sin(k_m) * Float64((t ^ 3.0) / Float64(l * l)))) * Float64(Float64(1.0 + (Float64(k_m / t) ^ 2.0)) + -1.0))) <= -2e-76) tmp = Float64(-1.0 / 0.0); else tmp = Float64(Float64(Float64(l + l) / Float64(t * Float64(k_m * k_m))) * Float64(l / Float64(k_m * k_m))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if ((2.0 / ((tan(k_m) * (sin(k_m) * ((t ^ 3.0) / (l * l)))) * ((1.0 + ((k_m / t) ^ 2.0)) + -1.0))) <= -2e-76) tmp = -1.0 / 0.0; else tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m)); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[N[(2.0 / N[(N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k$95$m / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-76], N[(-1.0 / 0.0), $MachinePrecision], N[(N[(N[(l + l), $MachinePrecision] / N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;\frac{2}{\left(\tan k\_m \cdot \left(\sin k\_m \cdot \frac{{t}^{3}}{\ell \cdot \ell}\right)\right) \cdot \left(\left(1 + {\left(\frac{k\_m}{t}\right)}^{2}\right) + -1\right)} \leq -2 \cdot 10^{-76}:\\
\;\;\;\;\frac{-1}{0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell + \ell}{t \cdot \left(k\_m \cdot k\_m\right)} \cdot \frac{\ell}{k\_m \cdot k\_m}\\
\end{array}
\end{array}
if (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) < -1.99999999999999985e-76Initial program 90.2%
associate-*l*N/A
*-commutativeN/A
cube-multN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
div-invN/A
associate-*l*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6490.1
Applied egg-rr90.1%
Taylor expanded in k around 0
Simplified80.3%
clear-numN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
Applied egg-rr80.3%
if -1.99999999999999985e-76 < (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) Initial program 28.1%
Taylor expanded in k around 0
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-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-*.f6460.0
Simplified60.0%
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6474.9
Applied egg-rr74.9%
Final simplification75.7%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<=
(/
2.0
(*
(* (tan k_m) (* (sin k_m) (/ (pow t 3.0) (* l l))))
(+ (+ 1.0 (pow (/ k_m t) 2.0)) -1.0)))
-2e-76)
(/ -1.0 0.0)
(* (/ (+ l l) k_m) (/ l (* k_m (* t (* k_m k_m)))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((tan(k_m) * (sin(k_m) * (pow(t, 3.0) / (l * l)))) * ((1.0 + pow((k_m / t), 2.0)) + -1.0))) <= -2e-76) {
tmp = -1.0 / 0.0;
} else {
tmp = ((l + l) / k_m) * (l / (k_m * (t * (k_m * k_m))));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if ((2.0d0 / ((tan(k_m) * (sin(k_m) * ((t ** 3.0d0) / (l * l)))) * ((1.0d0 + ((k_m / t) ** 2.0d0)) + (-1.0d0)))) <= (-2d-76)) then
tmp = (-1.0d0) / 0.0d0
else
tmp = ((l + l) / k_m) * (l / (k_m * (t * (k_m * k_m))))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((Math.tan(k_m) * (Math.sin(k_m) * (Math.pow(t, 3.0) / (l * l)))) * ((1.0 + Math.pow((k_m / t), 2.0)) + -1.0))) <= -2e-76) {
tmp = -1.0 / 0.0;
} else {
tmp = ((l + l) / k_m) * (l / (k_m * (t * (k_m * k_m))));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if (2.0 / ((math.tan(k_m) * (math.sin(k_m) * (math.pow(t, 3.0) / (l * l)))) * ((1.0 + math.pow((k_m / t), 2.0)) + -1.0))) <= -2e-76: tmp = -1.0 / 0.0 else: tmp = ((l + l) / k_m) * (l / (k_m * (t * (k_m * k_m)))) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (Float64(2.0 / Float64(Float64(tan(k_m) * Float64(sin(k_m) * Float64((t ^ 3.0) / Float64(l * l)))) * Float64(Float64(1.0 + (Float64(k_m / t) ^ 2.0)) + -1.0))) <= -2e-76) tmp = Float64(-1.0 / 0.0); else tmp = Float64(Float64(Float64(l + l) / k_m) * Float64(l / Float64(k_m * Float64(t * Float64(k_m * k_m))))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if ((2.0 / ((tan(k_m) * (sin(k_m) * ((t ^ 3.0) / (l * l)))) * ((1.0 + ((k_m / t) ^ 2.0)) + -1.0))) <= -2e-76) tmp = -1.0 / 0.0; else tmp = ((l + l) / k_m) * (l / (k_m * (t * (k_m * k_m)))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[N[(2.0 / N[(N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k$95$m / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-76], N[(-1.0 / 0.0), $MachinePrecision], N[(N[(N[(l + l), $MachinePrecision] / k$95$m), $MachinePrecision] * N[(l / N[(k$95$m * N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;\frac{2}{\left(\tan k\_m \cdot \left(\sin k\_m \cdot \frac{{t}^{3}}{\ell \cdot \ell}\right)\right) \cdot \left(\left(1 + {\left(\frac{k\_m}{t}\right)}^{2}\right) + -1\right)} \leq -2 \cdot 10^{-76}:\\
\;\;\;\;\frac{-1}{0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell + \ell}{k\_m} \cdot \frac{\ell}{k\_m \cdot \left(t \cdot \left(k\_m \cdot k\_m\right)\right)}\\
\end{array}
\end{array}
if (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) < -1.99999999999999985e-76Initial program 90.2%
associate-*l*N/A
*-commutativeN/A
cube-multN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
div-invN/A
associate-*l*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6490.1
Applied egg-rr90.1%
Taylor expanded in k around 0
Simplified80.3%
clear-numN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
Applied egg-rr80.3%
if -1.99999999999999985e-76 < (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) Initial program 28.1%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6473.6
Simplified73.6%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr82.6%
Taylor expanded in k around 0
/-lowering-/.f64N/A
cube-multN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6474.0
Simplified74.0%
Final simplification75.0%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<=
(/
2.0
(*
(* (tan k_m) (* (sin k_m) (/ (pow t 3.0) (* l l))))
(+ (+ 1.0 (pow (/ k_m t) 2.0)) -1.0)))
-2e-76)
(/ -1.0 0.0)
(* l (/ (+ l l) (* k_m (* t (* k_m (* k_m k_m))))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((tan(k_m) * (sin(k_m) * (pow(t, 3.0) / (l * l)))) * ((1.0 + pow((k_m / t), 2.0)) + -1.0))) <= -2e-76) {
tmp = -1.0 / 0.0;
} else {
tmp = l * ((l + l) / (k_m * (t * (k_m * (k_m * k_m)))));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if ((2.0d0 / ((tan(k_m) * (sin(k_m) * ((t ** 3.0d0) / (l * l)))) * ((1.0d0 + ((k_m / t) ** 2.0d0)) + (-1.0d0)))) <= (-2d-76)) then
tmp = (-1.0d0) / 0.0d0
else
tmp = l * ((l + l) / (k_m * (t * (k_m * (k_m * k_m)))))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((Math.tan(k_m) * (Math.sin(k_m) * (Math.pow(t, 3.0) / (l * l)))) * ((1.0 + Math.pow((k_m / t), 2.0)) + -1.0))) <= -2e-76) {
tmp = -1.0 / 0.0;
} else {
tmp = l * ((l + l) / (k_m * (t * (k_m * (k_m * k_m)))));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if (2.0 / ((math.tan(k_m) * (math.sin(k_m) * (math.pow(t, 3.0) / (l * l)))) * ((1.0 + math.pow((k_m / t), 2.0)) + -1.0))) <= -2e-76: tmp = -1.0 / 0.0 else: tmp = l * ((l + l) / (k_m * (t * (k_m * (k_m * k_m))))) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (Float64(2.0 / Float64(Float64(tan(k_m) * Float64(sin(k_m) * Float64((t ^ 3.0) / Float64(l * l)))) * Float64(Float64(1.0 + (Float64(k_m / t) ^ 2.0)) + -1.0))) <= -2e-76) tmp = Float64(-1.0 / 0.0); else tmp = Float64(l * Float64(Float64(l + l) / Float64(k_m * Float64(t * Float64(k_m * Float64(k_m * k_m)))))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if ((2.0 / ((tan(k_m) * (sin(k_m) * ((t ^ 3.0) / (l * l)))) * ((1.0 + ((k_m / t) ^ 2.0)) + -1.0))) <= -2e-76) tmp = -1.0 / 0.0; else tmp = l * ((l + l) / (k_m * (t * (k_m * (k_m * k_m))))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[N[(2.0 / N[(N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k$95$m / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-76], N[(-1.0 / 0.0), $MachinePrecision], N[(l * N[(N[(l + l), $MachinePrecision] / N[(k$95$m * N[(t * N[(k$95$m * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;\frac{2}{\left(\tan k\_m \cdot \left(\sin k\_m \cdot \frac{{t}^{3}}{\ell \cdot \ell}\right)\right) \cdot \left(\left(1 + {\left(\frac{k\_m}{t}\right)}^{2}\right) + -1\right)} \leq -2 \cdot 10^{-76}:\\
\;\;\;\;\frac{-1}{0}\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \frac{\ell + \ell}{k\_m \cdot \left(t \cdot \left(k\_m \cdot \left(k\_m \cdot k\_m\right)\right)\right)}\\
\end{array}
\end{array}
if (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) < -1.99999999999999985e-76Initial program 90.2%
associate-*l*N/A
*-commutativeN/A
cube-multN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
div-invN/A
associate-*l*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6490.1
Applied egg-rr90.1%
Taylor expanded in k around 0
Simplified80.3%
clear-numN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
Applied egg-rr80.3%
if -1.99999999999999985e-76 < (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) Initial program 28.1%
Taylor expanded in k around 0
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-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-*.f6460.0
Simplified60.0%
associate-/l*N/A
*-commutativeN/A
flip-+N/A
distribute-lft-out--N/A
+-inversesN/A
+-inversesN/A
associate-*r/N/A
+-inversesN/A
+-inversesN/A
flip-+N/A
*-lowering-*.f64N/A
Applied egg-rr70.8%
Final simplification72.3%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<=
(/
2.0
(*
(* (tan k_m) (* (sin k_m) (/ (pow t 3.0) (* l l))))
(+ (+ 1.0 (pow (/ k_m t) 2.0)) -1.0)))
-2e-76)
(/ -1.0 0.0)
(/ (+ l l) (* t (* (* k_m k_m) (* k_m k_m))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((tan(k_m) * (sin(k_m) * (pow(t, 3.0) / (l * l)))) * ((1.0 + pow((k_m / t), 2.0)) + -1.0))) <= -2e-76) {
tmp = -1.0 / 0.0;
} else {
tmp = (l + l) / (t * ((k_m * k_m) * (k_m * k_m)));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if ((2.0d0 / ((tan(k_m) * (sin(k_m) * ((t ** 3.0d0) / (l * l)))) * ((1.0d0 + ((k_m / t) ** 2.0d0)) + (-1.0d0)))) <= (-2d-76)) then
tmp = (-1.0d0) / 0.0d0
else
tmp = (l + l) / (t * ((k_m * k_m) * (k_m * k_m)))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((Math.tan(k_m) * (Math.sin(k_m) * (Math.pow(t, 3.0) / (l * l)))) * ((1.0 + Math.pow((k_m / t), 2.0)) + -1.0))) <= -2e-76) {
tmp = -1.0 / 0.0;
} else {
tmp = (l + l) / (t * ((k_m * k_m) * (k_m * k_m)));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if (2.0 / ((math.tan(k_m) * (math.sin(k_m) * (math.pow(t, 3.0) / (l * l)))) * ((1.0 + math.pow((k_m / t), 2.0)) + -1.0))) <= -2e-76: tmp = -1.0 / 0.0 else: tmp = (l + l) / (t * ((k_m * k_m) * (k_m * k_m))) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (Float64(2.0 / Float64(Float64(tan(k_m) * Float64(sin(k_m) * Float64((t ^ 3.0) / Float64(l * l)))) * Float64(Float64(1.0 + (Float64(k_m / t) ^ 2.0)) + -1.0))) <= -2e-76) tmp = Float64(-1.0 / 0.0); else tmp = Float64(Float64(l + l) / Float64(t * Float64(Float64(k_m * k_m) * Float64(k_m * k_m)))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if ((2.0 / ((tan(k_m) * (sin(k_m) * ((t ^ 3.0) / (l * l)))) * ((1.0 + ((k_m / t) ^ 2.0)) + -1.0))) <= -2e-76) tmp = -1.0 / 0.0; else tmp = (l + l) / (t * ((k_m * k_m) * (k_m * k_m))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[N[(2.0 / N[(N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k$95$m / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-76], N[(-1.0 / 0.0), $MachinePrecision], N[(N[(l + l), $MachinePrecision] / N[(t * N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;\frac{2}{\left(\tan k\_m \cdot \left(\sin k\_m \cdot \frac{{t}^{3}}{\ell \cdot \ell}\right)\right) \cdot \left(\left(1 + {\left(\frac{k\_m}{t}\right)}^{2}\right) + -1\right)} \leq -2 \cdot 10^{-76}:\\
\;\;\;\;\frac{-1}{0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell + \ell}{t \cdot \left(\left(k\_m \cdot k\_m\right) \cdot \left(k\_m \cdot k\_m\right)\right)}\\
\end{array}
\end{array}
if (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) < -1.99999999999999985e-76Initial program 90.2%
associate-*l*N/A
*-commutativeN/A
cube-multN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
div-invN/A
associate-*l*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6490.1
Applied egg-rr90.1%
Taylor expanded in k around 0
Simplified80.3%
clear-numN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
Applied egg-rr80.3%
if -1.99999999999999985e-76 < (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) Initial program 28.1%
Taylor expanded in k around 0
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-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-*.f6460.0
Simplified60.0%
flip-+N/A
+-inversesN/A
+-inversesN/A
associate-*r/N/A
+-inversesN/A
distribute-lft-out--N/A
+-inversesN/A
flip-+N/A
+-lowering-+.f6444.1
Applied egg-rr44.1%
Final simplification49.6%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(if (<=
(/
2.0
(*
(* (tan k_m) (* (sin k_m) (/ (pow t 3.0) (* l l))))
(+ (+ 1.0 (pow (/ k_m t) 2.0)) -1.0)))
-1.5)
(/ -1.0 0.0)
0.0))k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((tan(k_m) * (sin(k_m) * (pow(t, 3.0) / (l * l)))) * ((1.0 + pow((k_m / t), 2.0)) + -1.0))) <= -1.5) {
tmp = -1.0 / 0.0;
} else {
tmp = 0.0;
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if ((2.0d0 / ((tan(k_m) * (sin(k_m) * ((t ** 3.0d0) / (l * l)))) * ((1.0d0 + ((k_m / t) ** 2.0d0)) + (-1.0d0)))) <= (-1.5d0)) then
tmp = (-1.0d0) / 0.0d0
else
tmp = 0.0d0
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if ((2.0 / ((Math.tan(k_m) * (Math.sin(k_m) * (Math.pow(t, 3.0) / (l * l)))) * ((1.0 + Math.pow((k_m / t), 2.0)) + -1.0))) <= -1.5) {
tmp = -1.0 / 0.0;
} else {
tmp = 0.0;
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if (2.0 / ((math.tan(k_m) * (math.sin(k_m) * (math.pow(t, 3.0) / (l * l)))) * ((1.0 + math.pow((k_m / t), 2.0)) + -1.0))) <= -1.5: tmp = -1.0 / 0.0 else: tmp = 0.0 return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (Float64(2.0 / Float64(Float64(tan(k_m) * Float64(sin(k_m) * Float64((t ^ 3.0) / Float64(l * l)))) * Float64(Float64(1.0 + (Float64(k_m / t) ^ 2.0)) + -1.0))) <= -1.5) tmp = Float64(-1.0 / 0.0); else tmp = 0.0; end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if ((2.0 / ((tan(k_m) * (sin(k_m) * ((t ^ 3.0) / (l * l)))) * ((1.0 + ((k_m / t) ^ 2.0)) + -1.0))) <= -1.5) tmp = -1.0 / 0.0; else tmp = 0.0; end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[N[(2.0 / N[(N[(N[Tan[k$95$m], $MachinePrecision] * N[(N[Sin[k$95$m], $MachinePrecision] * N[(N[Power[t, 3.0], $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[Power[N[(k$95$m / t), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.5], N[(-1.0 / 0.0), $MachinePrecision], 0.0]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;\frac{2}{\left(\tan k\_m \cdot \left(\sin k\_m \cdot \frac{{t}^{3}}{\ell \cdot \ell}\right)\right) \cdot \left(\left(1 + {\left(\frac{k\_m}{t}\right)}^{2}\right) + -1\right)} \leq -1.5:\\
\;\;\;\;\frac{-1}{0}\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) < -1.5Initial program 89.7%
associate-*l*N/A
*-commutativeN/A
cube-multN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
div-invN/A
associate-*l*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6489.7
Applied egg-rr89.7%
Taylor expanded in k around 0
Simplified84.5%
clear-numN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
Applied egg-rr84.5%
if -1.5 < (/.f64 #s(literal 2 binary64) (*.f64 (*.f64 (*.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k)) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))) Initial program 28.8%
associate-*l*N/A
*-commutativeN/A
cube-multN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
div-invN/A
associate-*l*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.6
Applied egg-rr42.6%
Taylor expanded in k around 0
Simplified29.3%
clear-numN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
Applied egg-rr11.3%
clear-numN/A
metadata-evalN/A
metadata-evalN/A
flip--N/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
+-inversesN/A
+-inversesN/A
clear-numN/A
+-inversesN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
+-inversesN/A
metadata-evalN/A
flip--N/A
metadata-eval30.6
Applied egg-rr30.6%
Final simplification38.4%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* (/ (/ (* l (/ 1.0 (* (sin k_m) (tan k_m)))) k_m) t) (/ (+ l l) k_m)))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return (((l * (1.0 / (sin(k_m) * tan(k_m)))) / k_m) / t) * ((l + l) / k_m);
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = (((l * (1.0d0 / (sin(k_m) * tan(k_m)))) / k_m) / t) * ((l + l) / k_m)
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return (((l * (1.0 / (Math.sin(k_m) * Math.tan(k_m)))) / k_m) / t) * ((l + l) / k_m);
}
k_m = math.fabs(k) def code(t, l, k_m): return (((l * (1.0 / (math.sin(k_m) * math.tan(k_m)))) / k_m) / t) * ((l + l) / k_m)
k_m = abs(k) function code(t, l, k_m) return Float64(Float64(Float64(Float64(l * Float64(1.0 / Float64(sin(k_m) * tan(k_m)))) / k_m) / t) * Float64(Float64(l + l) / k_m)) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = (((l * (1.0 / (sin(k_m) * tan(k_m)))) / k_m) / t) * ((l + l) / k_m); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(N[(N[(N[(l * N[(1.0 / N[(N[Sin[k$95$m], $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / k$95$m), $MachinePrecision] / t), $MachinePrecision] * N[(N[(l + l), $MachinePrecision] / k$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{\frac{\ell \cdot \frac{1}{\sin k\_m \cdot \tan k\_m}}{k\_m}}{t} \cdot \frac{\ell + \ell}{k\_m}
\end{array}
Initial program 37.6%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6477.2
Simplified77.2%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr83.9%
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr96.5%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* (/ (+ l l) k_m) (/ (/ (* l (/ 1.0 k_m)) (* (sin k_m) (tan k_m))) t)))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return ((l + l) / k_m) * (((l * (1.0 / k_m)) / (sin(k_m) * tan(k_m))) / t);
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = ((l + l) / k_m) * (((l * (1.0d0 / k_m)) / (sin(k_m) * tan(k_m))) / t)
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return ((l + l) / k_m) * (((l * (1.0 / k_m)) / (Math.sin(k_m) * Math.tan(k_m))) / t);
}
k_m = math.fabs(k) def code(t, l, k_m): return ((l + l) / k_m) * (((l * (1.0 / k_m)) / (math.sin(k_m) * math.tan(k_m))) / t)
k_m = abs(k) function code(t, l, k_m) return Float64(Float64(Float64(l + l) / k_m) * Float64(Float64(Float64(l * Float64(1.0 / k_m)) / Float64(sin(k_m) * tan(k_m))) / t)) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = ((l + l) / k_m) * (((l * (1.0 / k_m)) / (sin(k_m) * tan(k_m))) / t); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(N[(N[(l + l), $MachinePrecision] / k$95$m), $MachinePrecision] * N[(N[(N[(l * N[(1.0 / k$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[Sin[k$95$m], $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{\ell + \ell}{k\_m} \cdot \frac{\frac{\ell \cdot \frac{1}{k\_m}}{\sin k\_m \cdot \tan k\_m}}{t}
\end{array}
Initial program 37.6%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6477.2
Simplified77.2%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr83.9%
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr96.5%
div-invN/A
un-div-invN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6496.5
Applied egg-rr96.5%
Final simplification96.5%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 3.6e-88) (* (/ (+ l l) (* t (* k_m k_m))) (/ l (* k_m k_m))) (* (/ (+ l l) k_m) (/ (/ l (* k_m (* (sin k_m) (tan k_m)))) t))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 3.6e-88) {
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m));
} else {
tmp = ((l + l) / k_m) * ((l / (k_m * (sin(k_m) * tan(k_m)))) / t);
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 3.6d-88) then
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m))
else
tmp = ((l + l) / k_m) * ((l / (k_m * (sin(k_m) * tan(k_m)))) / t)
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 3.6e-88) {
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m));
} else {
tmp = ((l + l) / k_m) * ((l / (k_m * (Math.sin(k_m) * Math.tan(k_m)))) / t);
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 3.6e-88: tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m)) else: tmp = ((l + l) / k_m) * ((l / (k_m * (math.sin(k_m) * math.tan(k_m)))) / t) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 3.6e-88) tmp = Float64(Float64(Float64(l + l) / Float64(t * Float64(k_m * k_m))) * Float64(l / Float64(k_m * k_m))); else tmp = Float64(Float64(Float64(l + l) / k_m) * Float64(Float64(l / Float64(k_m * Float64(sin(k_m) * tan(k_m)))) / t)); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 3.6e-88) tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m)); else tmp = ((l + l) / k_m) * ((l / (k_m * (sin(k_m) * tan(k_m)))) / t); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 3.6e-88], N[(N[(N[(l + l), $MachinePrecision] / N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(l + l), $MachinePrecision] / k$95$m), $MachinePrecision] * N[(N[(l / N[(k$95$m * N[(N[Sin[k$95$m], $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 3.6 \cdot 10^{-88}:\\
\;\;\;\;\frac{\ell + \ell}{t \cdot \left(k\_m \cdot k\_m\right)} \cdot \frac{\ell}{k\_m \cdot k\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\ell + \ell}{k\_m} \cdot \frac{\frac{\ell}{k\_m \cdot \left(\sin k\_m \cdot \tan k\_m\right)}}{t}\\
\end{array}
\end{array}
if k < 3.5999999999999999e-88Initial program 43.3%
Taylor expanded in k around 0
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-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-*.f6464.6
Simplified64.6%
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6481.8
Applied egg-rr81.8%
if 3.5999999999999999e-88 < k Initial program 23.8%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6476.0
Simplified76.0%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr80.4%
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr98.3%
/-lowering-/.f64N/A
div-invN/A
un-div-invN/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f6498.4
Applied egg-rr98.4%
Final simplification86.7%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= (* l l) 1e+180) (* (/ (+ l l) (* t (* k_m k_m))) (/ l (* k_m k_m))) (* l (* (/ l (* (* (sin k_m) (tan k_m)) (* k_m t))) 2.0))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if ((l * l) <= 1e+180) {
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m));
} else {
tmp = l * ((l / ((sin(k_m) * tan(k_m)) * (k_m * t))) * 2.0);
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if ((l * l) <= 1d+180) then
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m))
else
tmp = l * ((l / ((sin(k_m) * tan(k_m)) * (k_m * t))) * 2.0d0)
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if ((l * l) <= 1e+180) {
tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m));
} else {
tmp = l * ((l / ((Math.sin(k_m) * Math.tan(k_m)) * (k_m * t))) * 2.0);
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if (l * l) <= 1e+180: tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m)) else: tmp = l * ((l / ((math.sin(k_m) * math.tan(k_m)) * (k_m * t))) * 2.0) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (Float64(l * l) <= 1e+180) tmp = Float64(Float64(Float64(l + l) / Float64(t * Float64(k_m * k_m))) * Float64(l / Float64(k_m * k_m))); else tmp = Float64(l * Float64(Float64(l / Float64(Float64(sin(k_m) * tan(k_m)) * Float64(k_m * t))) * 2.0)); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if ((l * l) <= 1e+180) tmp = ((l + l) / (t * (k_m * k_m))) * (l / (k_m * k_m)); else tmp = l * ((l / ((sin(k_m) * tan(k_m)) * (k_m * t))) * 2.0); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[N[(l * l), $MachinePrecision], 1e+180], N[(N[(N[(l + l), $MachinePrecision] / N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(l * N[(N[(l / N[(N[(N[Sin[k$95$m], $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision] * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot \ell \leq 10^{+180}:\\
\;\;\;\;\frac{\ell + \ell}{t \cdot \left(k\_m \cdot k\_m\right)} \cdot \frac{\ell}{k\_m \cdot k\_m}\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \left(\frac{\ell}{\left(\sin k\_m \cdot \tan k\_m\right) \cdot \left(k\_m \cdot t\right)} \cdot 2\right)\\
\end{array}
\end{array}
if (*.f64 l l) < 1e180Initial program 34.2%
Taylor expanded in k around 0
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-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-*.f6467.5
Simplified67.5%
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6485.9
Applied egg-rr85.9%
if 1e180 < (*.f64 l l) Initial program 43.3%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6470.3
Simplified70.3%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr92.8%
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
flip-+N/A
+-inversesN/A
+-inversesN/A
associate-/l/N/A
+-inversesN/A
distribute-lft-out--N/A
+-inversesN/A
+-inversesN/A
+-inversesN/A
flip-+N/A
count-2N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr29.9%
Final simplification65.1%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* (/ (+ l l) k_m) (/ l (* (* (sin k_m) (tan k_m)) (* k_m t)))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return ((l + l) / k_m) * (l / ((sin(k_m) * tan(k_m)) * (k_m * t)));
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = ((l + l) / k_m) * (l / ((sin(k_m) * tan(k_m)) * (k_m * t)))
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return ((l + l) / k_m) * (l / ((Math.sin(k_m) * Math.tan(k_m)) * (k_m * t)));
}
k_m = math.fabs(k) def code(t, l, k_m): return ((l + l) / k_m) * (l / ((math.sin(k_m) * math.tan(k_m)) * (k_m * t)))
k_m = abs(k) function code(t, l, k_m) return Float64(Float64(Float64(l + l) / k_m) * Float64(l / Float64(Float64(sin(k_m) * tan(k_m)) * Float64(k_m * t)))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = ((l + l) / k_m) * (l / ((sin(k_m) * tan(k_m)) * (k_m * t))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(N[(N[(l + l), $MachinePrecision] / k$95$m), $MachinePrecision] * N[(l / N[(N[(N[Sin[k$95$m], $MachinePrecision] * N[Tan[k$95$m], $MachinePrecision]), $MachinePrecision] * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{\ell + \ell}{k\_m} \cdot \frac{\ell}{\left(\sin k\_m \cdot \tan k\_m\right) \cdot \left(k\_m \cdot t\right)}
\end{array}
Initial program 37.6%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6477.2
Simplified77.2%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr83.9%
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr96.5%
associate-/r*N/A
un-div-invN/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f6494.3
Applied egg-rr94.3%
Final simplification94.3%
k_m = (fabs.f64 k)
(FPCore (t l k_m)
:precision binary64
(let* ((t_1 (/ (+ l l) k_m)))
(if (<= k_m 1.85e+58)
(*
t_1
(/
(/ (/ (fma l (* (* k_m k_m) -0.16666666666666666) l) (* k_m k_m)) k_m)
t))
(* t_1 (/ l (* (* k_m t) (- 0.5 (* 0.5 (cos (+ k_m k_m))))))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = (l + l) / k_m;
double tmp;
if (k_m <= 1.85e+58) {
tmp = t_1 * (((fma(l, ((k_m * k_m) * -0.16666666666666666), l) / (k_m * k_m)) / k_m) / t);
} else {
tmp = t_1 * (l / ((k_m * t) * (0.5 - (0.5 * cos((k_m + k_m))))));
}
return tmp;
}
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(Float64(l + l) / k_m) tmp = 0.0 if (k_m <= 1.85e+58) tmp = Float64(t_1 * Float64(Float64(Float64(fma(l, Float64(Float64(k_m * k_m) * -0.16666666666666666), l) / Float64(k_m * k_m)) / k_m) / t)); else tmp = Float64(t_1 * Float64(l / Float64(Float64(k_m * t) * Float64(0.5 - Float64(0.5 * cos(Float64(k_m + k_m))))))); end return tmp end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(N[(l + l), $MachinePrecision] / k$95$m), $MachinePrecision]}, If[LessEqual[k$95$m, 1.85e+58], N[(t$95$1 * N[(N[(N[(N[(l * N[(N[(k$95$m * k$95$m), $MachinePrecision] * -0.16666666666666666), $MachinePrecision] + l), $MachinePrecision] / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision] / k$95$m), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(l / N[(N[(k$95$m * t), $MachinePrecision] * N[(0.5 - N[(0.5 * N[Cos[N[(k$95$m + k$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{\ell + \ell}{k\_m}\\
\mathbf{if}\;k\_m \leq 1.85 \cdot 10^{+58}:\\
\;\;\;\;t\_1 \cdot \frac{\frac{\frac{\mathsf{fma}\left(\ell, \left(k\_m \cdot k\_m\right) \cdot -0.16666666666666666, \ell\right)}{k\_m \cdot k\_m}}{k\_m}}{t}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{\ell}{\left(k\_m \cdot t\right) \cdot \left(0.5 - 0.5 \cdot \cos \left(k\_m + k\_m\right)\right)}\\
\end{array}
\end{array}
if k < 1.8500000000000001e58Initial program 41.4%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6479.3
Simplified79.3%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr82.2%
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr95.8%
Taylor expanded in k around 0
/-lowering-/.f64N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6473.4
Simplified73.4%
if 1.8500000000000001e58 < k Initial program 20.3%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6467.9
Simplified67.9%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr91.5%
Taylor expanded in k around 0
Simplified55.5%
Final simplification70.2%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 7.2e-106) (/ (+ k_m k_m) (* k_m (* t (* k_m (* k_m k_m))))) (/ (* (* l l) 2.0) (* k_m (* k_m (* k_m t))))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 7.2e-106) {
tmp = (k_m + k_m) / (k_m * (t * (k_m * (k_m * k_m))));
} else {
tmp = ((l * l) * 2.0) / (k_m * (k_m * (k_m * t)));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 7.2d-106) then
tmp = (k_m + k_m) / (k_m * (t * (k_m * (k_m * k_m))))
else
tmp = ((l * l) * 2.0d0) / (k_m * (k_m * (k_m * t)))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 7.2e-106) {
tmp = (k_m + k_m) / (k_m * (t * (k_m * (k_m * k_m))));
} else {
tmp = ((l * l) * 2.0) / (k_m * (k_m * (k_m * t)));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 7.2e-106: tmp = (k_m + k_m) / (k_m * (t * (k_m * (k_m * k_m)))) else: tmp = ((l * l) * 2.0) / (k_m * (k_m * (k_m * t))) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 7.2e-106) tmp = Float64(Float64(k_m + k_m) / Float64(k_m * Float64(t * Float64(k_m * Float64(k_m * k_m))))); else tmp = Float64(Float64(Float64(l * l) * 2.0) / Float64(k_m * Float64(k_m * Float64(k_m * t)))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 7.2e-106) tmp = (k_m + k_m) / (k_m * (t * (k_m * (k_m * k_m)))); else tmp = ((l * l) * 2.0) / (k_m * (k_m * (k_m * t))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 7.2e-106], N[(N[(k$95$m + k$95$m), $MachinePrecision] / N[(k$95$m * N[(t * N[(k$95$m * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(l * l), $MachinePrecision] * 2.0), $MachinePrecision] / N[(k$95$m * N[(k$95$m * N[(k$95$m * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 7.2 \cdot 10^{-106}:\\
\;\;\;\;\frac{k\_m + k\_m}{k\_m \cdot \left(t \cdot \left(k\_m \cdot \left(k\_m \cdot k\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\ell \cdot \ell\right) \cdot 2}{k\_m \cdot \left(k\_m \cdot \left(k\_m \cdot t\right)\right)}\\
\end{array}
\end{array}
if k < 7.20000000000000025e-106Initial program 42.9%
Taylor expanded in k around 0
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-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-*.f6464.6
Simplified64.6%
flip-+N/A
+-inversesN/A
+-inversesN/A
associate-*r/N/A
+-inversesN/A
distribute-lft-out--N/A
+-inversesN/A
flip-+N/A
+-lowering-+.f6444.5
Applied egg-rr44.5%
/-lowering-/.f64N/A
flip-+N/A
+-inversesN/A
+-inversesN/A
+-inversesN/A
+-inversesN/A
flip-+N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
cube-unmultN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cube-unmultN/A
*-lowering-*.f64N/A
*-lowering-*.f6439.2
Applied egg-rr39.2%
if 7.20000000000000025e-106 < k Initial program 25.4%
Taylor expanded in k around 0
associate-*r/N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
count-2N/A
+-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-*.f6459.3
Simplified59.3%
flip-+N/A
distribute-lft-out--N/A
+-inversesN/A
+-inversesN/A
associate-*r/N/A
+-inversesN/A
+-inversesN/A
flip-+N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f6449.1
Applied egg-rr49.1%
flip-+N/A
+-inversesN/A
+-inversesN/A
+-inversesN/A
+-inversesN/A
flip-+N/A
flip3-+N/A
div-invN/A
*-lowering-*.f64N/A
Applied egg-rr33.6%
Taylor expanded in l around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6453.9
Simplified53.9%
Final simplification43.6%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 0.16) (/ 4.0 0.0) 0.0))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 0.16) {
tmp = 4.0 / 0.0;
} else {
tmp = 0.0;
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (k_m <= 0.16d0) then
tmp = 4.0d0 / 0.0d0
else
tmp = 0.0d0
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 0.16) {
tmp = 4.0 / 0.0;
} else {
tmp = 0.0;
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 0.16: tmp = 4.0 / 0.0 else: tmp = 0.0 return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 0.16) tmp = Float64(4.0 / 0.0); else tmp = 0.0; end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 0.16) tmp = 4.0 / 0.0; else tmp = 0.0; end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 0.16], N[(4.0 / 0.0), $MachinePrecision], 0.0]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 0.16:\\
\;\;\;\;\frac{4}{0}\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if k < 0.160000000000000003Initial program 42.0%
associate-*l*N/A
*-commutativeN/A
cube-multN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
div-invN/A
associate-*l*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6453.1
Applied egg-rr53.1%
Taylor expanded in k around 0
Simplified44.9%
div-invN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
clear-numN/A
associate-*r/N/A
/-lowering-/.f64N/A
metadata-evalN/A
metadata-evalN/A
mul0-rgt30.1
Applied egg-rr30.1%
if 0.160000000000000003 < k Initial program 22.0%
associate-*l*N/A
*-commutativeN/A
cube-multN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
div-invN/A
associate-*l*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6436.5
Applied egg-rr36.5%
Taylor expanded in k around 0
Simplified10.7%
clear-numN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
Applied egg-rr7.2%
clear-numN/A
metadata-evalN/A
metadata-evalN/A
flip--N/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
+-inversesN/A
+-inversesN/A
clear-numN/A
+-inversesN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
+-inversesN/A
metadata-evalN/A
flip--N/A
metadata-eval49.9
Applied egg-rr49.9%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 0.0)
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 0.0;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = 0.0d0
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return 0.0;
}
k_m = math.fabs(k) def code(t, l, k_m): return 0.0
k_m = abs(k) function code(t, l, k_m) return 0.0 end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 0.0; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := 0.0
\begin{array}{l}
k_m = \left|k\right|
\\
0
\end{array}
Initial program 37.6%
associate-*l*N/A
*-commutativeN/A
cube-multN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
tan-lowering-tan.f64N/A
div-invN/A
associate-*l*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6449.4
Applied egg-rr49.4%
Taylor expanded in k around 0
Simplified37.3%
clear-numN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
mul0-rgtN/A
metadata-evalN/A
Applied egg-rr21.9%
clear-numN/A
metadata-evalN/A
metadata-evalN/A
flip--N/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
+-inversesN/A
+-inversesN/A
clear-numN/A
+-inversesN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
+-inversesN/A
metadata-evalN/A
flip--N/A
metadata-eval26.4
Applied egg-rr26.4%
herbie shell --seed 2024198
(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))))