
(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 7 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
(let* ((t_1 (/ l (/ k_m 2.0))))
(if (<= k_m 8.5e-63)
(/ (/ (* (/ t_1 (/ k_m l)) (/ 1.0 t)) k_m) k_m)
(* t_1 (/ l (* (tan k_m) (* t (* k_m (sin k_m)))))))))k_m = fabs(k);
double code(double t, double l, double k_m) {
double t_1 = l / (k_m / 2.0);
double tmp;
if (k_m <= 8.5e-63) {
tmp = (((t_1 / (k_m / l)) * (1.0 / t)) / k_m) / k_m;
} else {
tmp = t_1 * (l / (tan(k_m) * (t * (k_m * sin(k_m)))));
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: t_1
real(8) :: tmp
t_1 = l / (k_m / 2.0d0)
if (k_m <= 8.5d-63) then
tmp = (((t_1 / (k_m / l)) * (1.0d0 / t)) / k_m) / k_m
else
tmp = t_1 * (l / (tan(k_m) * (t * (k_m * sin(k_m)))))
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double t_1 = l / (k_m / 2.0);
double tmp;
if (k_m <= 8.5e-63) {
tmp = (((t_1 / (k_m / l)) * (1.0 / t)) / k_m) / k_m;
} else {
tmp = t_1 * (l / (Math.tan(k_m) * (t * (k_m * Math.sin(k_m)))));
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): t_1 = l / (k_m / 2.0) tmp = 0 if k_m <= 8.5e-63: tmp = (((t_1 / (k_m / l)) * (1.0 / t)) / k_m) / k_m else: tmp = t_1 * (l / (math.tan(k_m) * (t * (k_m * math.sin(k_m))))) return tmp
k_m = abs(k) function code(t, l, k_m) t_1 = Float64(l / Float64(k_m / 2.0)) tmp = 0.0 if (k_m <= 8.5e-63) tmp = Float64(Float64(Float64(Float64(t_1 / Float64(k_m / l)) * Float64(1.0 / t)) / k_m) / k_m); else tmp = Float64(t_1 * Float64(l / Float64(tan(k_m) * Float64(t * Float64(k_m * sin(k_m)))))); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) t_1 = l / (k_m / 2.0); tmp = 0.0; if (k_m <= 8.5e-63) tmp = (((t_1 / (k_m / l)) * (1.0 / t)) / k_m) / k_m; else tmp = t_1 * (l / (tan(k_m) * (t * (k_m * sin(k_m))))); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision]
code[t_, l_, k$95$m_] := Block[{t$95$1 = N[(l / N[(k$95$m / 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k$95$m, 8.5e-63], N[(N[(N[(N[(t$95$1 / N[(k$95$m / l), $MachinePrecision]), $MachinePrecision] * N[(1.0 / t), $MachinePrecision]), $MachinePrecision] / k$95$m), $MachinePrecision] / k$95$m), $MachinePrecision], N[(t$95$1 * N[(l / N[(N[Tan[k$95$m], $MachinePrecision] * N[(t * N[(k$95$m * N[Sin[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
t_1 := \frac{\ell}{\frac{k\_m}{2}}\\
\mathbf{if}\;k\_m \leq 8.5 \cdot 10^{-63}:\\
\;\;\;\;\frac{\frac{\frac{t\_1}{\frac{k\_m}{\ell}} \cdot \frac{1}{t}}{k\_m}}{k\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{\ell}{\tan k\_m \cdot \left(t \cdot \left(k\_m \cdot \sin k\_m\right)\right)}\\
\end{array}
\end{array}
if k < 8.49999999999999969e-63Initial program 37.8%
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-*.f6461.3%
Simplified61.3%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
cube-unmultN/A
*-lowering-*.f64N/A
cube-unmultN/A
*-lowering-*.f64N/A
*-lowering-*.f6464.7%
Applied egg-rr64.7%
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
div-invN/A
unpow-1N/A
associate-/r*N/A
unpow-1N/A
div-invN/A
unpow-1N/A
/-lowering-/.f64N/A
Applied egg-rr72.3%
associate-*r/N/A
associate-/r/N/A
associate-/r*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
clear-numN/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6478.1%
Applied egg-rr78.1%
if 8.49999999999999969e-63 < k Initial program 34.9%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6479.5%
Simplified79.5%
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6479.6%
Applied egg-rr79.6%
times-fracN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
/-lowering-/.f64N/A
quot-tanN/A
tan-lowering-tan.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr85.6%
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
div-invN/A
clear-numN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr95.5%
Final simplification83.4%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= k_m 3e-61) (/ (/ (* (/ (/ l (/ k_m 2.0)) (/ k_m l)) (/ 1.0 t)) k_m) k_m) (* (* l 2.0) (/ (/ l (* (tan k_m) (* t (* k_m (sin k_m))))) k_m))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (k_m <= 3e-61) {
tmp = ((((l / (k_m / 2.0)) / (k_m / l)) * (1.0 / t)) / k_m) / k_m;
} else {
tmp = (l * 2.0) * ((l / (tan(k_m) * (t * (k_m * sin(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 (k_m <= 3d-61) then
tmp = ((((l / (k_m / 2.0d0)) / (k_m / l)) * (1.0d0 / t)) / k_m) / k_m
else
tmp = (l * 2.0d0) * ((l / (tan(k_m) * (t * (k_m * sin(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 (k_m <= 3e-61) {
tmp = ((((l / (k_m / 2.0)) / (k_m / l)) * (1.0 / t)) / k_m) / k_m;
} else {
tmp = (l * 2.0) * ((l / (Math.tan(k_m) * (t * (k_m * Math.sin(k_m))))) / k_m);
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if k_m <= 3e-61: tmp = ((((l / (k_m / 2.0)) / (k_m / l)) * (1.0 / t)) / k_m) / k_m else: tmp = (l * 2.0) * ((l / (math.tan(k_m) * (t * (k_m * math.sin(k_m))))) / k_m) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (k_m <= 3e-61) tmp = Float64(Float64(Float64(Float64(Float64(l / Float64(k_m / 2.0)) / Float64(k_m / l)) * Float64(1.0 / t)) / k_m) / k_m); else tmp = Float64(Float64(l * 2.0) * Float64(Float64(l / Float64(tan(k_m) * Float64(t * Float64(k_m * sin(k_m))))) / k_m)); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (k_m <= 3e-61) tmp = ((((l / (k_m / 2.0)) / (k_m / l)) * (1.0 / t)) / k_m) / k_m; else tmp = (l * 2.0) * ((l / (tan(k_m) * (t * (k_m * sin(k_m))))) / k_m); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[k$95$m, 3e-61], N[(N[(N[(N[(N[(l / N[(k$95$m / 2.0), $MachinePrecision]), $MachinePrecision] / N[(k$95$m / l), $MachinePrecision]), $MachinePrecision] * N[(1.0 / t), $MachinePrecision]), $MachinePrecision] / k$95$m), $MachinePrecision] / k$95$m), $MachinePrecision], N[(N[(l * 2.0), $MachinePrecision] * N[(N[(l / N[(N[Tan[k$95$m], $MachinePrecision] * N[(t * N[(k$95$m * N[Sin[k$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / k$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;k\_m \leq 3 \cdot 10^{-61}:\\
\;\;\;\;\frac{\frac{\frac{\frac{\ell}{\frac{k\_m}{2}}}{\frac{k\_m}{\ell}} \cdot \frac{1}{t}}{k\_m}}{k\_m}\\
\mathbf{else}:\\
\;\;\;\;\left(\ell \cdot 2\right) \cdot \frac{\frac{\ell}{\tan k\_m \cdot \left(t \cdot \left(k\_m \cdot \sin k\_m\right)\right)}}{k\_m}\\
\end{array}
\end{array}
if k < 3.00000000000000012e-61Initial program 37.8%
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-*.f6461.3%
Simplified61.3%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
cube-unmultN/A
*-lowering-*.f64N/A
cube-unmultN/A
*-lowering-*.f64N/A
*-lowering-*.f6464.7%
Applied egg-rr64.7%
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
div-invN/A
unpow-1N/A
associate-/r*N/A
unpow-1N/A
div-invN/A
unpow-1N/A
/-lowering-/.f64N/A
Applied egg-rr72.3%
associate-*r/N/A
associate-/r/N/A
associate-/r*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
clear-numN/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6478.1%
Applied egg-rr78.1%
if 3.00000000000000012e-61 < k Initial program 34.9%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
sin-lowering-sin.f6479.5%
Simplified79.5%
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6479.6%
Applied egg-rr79.6%
associate-/l*N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr88.3%
associate-*r/N/A
/-lowering-/.f64N/A
associate-/l/N/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
tan-lowering-tan.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f6493.4%
Applied egg-rr93.4%
Final simplification82.8%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= t 2.9e-9) (/ (/ (* (/ 2.0 k_m) (/ l (* (/ k_m l) t))) k_m) k_m) (/ 2.0 (/ (* (* k_m k_m) (/ (* t (* k_m k_m)) l)) l))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (t <= 2.9e-9) {
tmp = (((2.0 / k_m) * (l / ((k_m / l) * t))) / k_m) / k_m;
} else {
tmp = 2.0 / (((k_m * k_m) * ((t * (k_m * k_m)) / l)) / l);
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (t <= 2.9d-9) then
tmp = (((2.0d0 / k_m) * (l / ((k_m / l) * t))) / k_m) / k_m
else
tmp = 2.0d0 / (((k_m * k_m) * ((t * (k_m * k_m)) / l)) / l)
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (t <= 2.9e-9) {
tmp = (((2.0 / k_m) * (l / ((k_m / l) * t))) / k_m) / k_m;
} else {
tmp = 2.0 / (((k_m * k_m) * ((t * (k_m * k_m)) / l)) / l);
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if t <= 2.9e-9: tmp = (((2.0 / k_m) * (l / ((k_m / l) * t))) / k_m) / k_m else: tmp = 2.0 / (((k_m * k_m) * ((t * (k_m * k_m)) / l)) / l) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (t <= 2.9e-9) tmp = Float64(Float64(Float64(Float64(2.0 / k_m) * Float64(l / Float64(Float64(k_m / l) * t))) / k_m) / k_m); else tmp = Float64(2.0 / Float64(Float64(Float64(k_m * k_m) * Float64(Float64(t * Float64(k_m * k_m)) / l)) / l)); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (t <= 2.9e-9) tmp = (((2.0 / k_m) * (l / ((k_m / l) * t))) / k_m) / k_m; else tmp = 2.0 / (((k_m * k_m) * ((t * (k_m * k_m)) / l)) / l); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[t, 2.9e-9], N[(N[(N[(N[(2.0 / k$95$m), $MachinePrecision] * N[(l / N[(N[(k$95$m / l), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / k$95$m), $MachinePrecision] / k$95$m), $MachinePrecision], N[(2.0 / N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 2.9 \cdot 10^{-9}:\\
\;\;\;\;\frac{\frac{\frac{2}{k\_m} \cdot \frac{\ell}{\frac{k\_m}{\ell} \cdot t}}{k\_m}}{k\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{\left(k\_m \cdot k\_m\right) \cdot \frac{t \cdot \left(k\_m \cdot k\_m\right)}{\ell}}{\ell}}\\
\end{array}
\end{array}
if t < 2.89999999999999991e-9Initial program 38.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-*.f6460.9%
Simplified60.9%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
cube-unmultN/A
*-lowering-*.f64N/A
cube-unmultN/A
*-lowering-*.f64N/A
*-lowering-*.f6465.4%
Applied egg-rr65.4%
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
div-invN/A
unpow-1N/A
associate-/r*N/A
unpow-1N/A
div-invN/A
unpow-1N/A
/-lowering-/.f64N/A
Applied egg-rr70.6%
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f6471.7%
Applied egg-rr71.7%
if 2.89999999999999991e-9 < t Initial program 32.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-*.f6462.4%
Simplified62.4%
associate-*l*N/A
associate-/l*N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6480.9%
Applied egg-rr80.9%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (if (<= t 4.5e-9) (/ 2.0 (* (* k_m k_m) (/ k_m (/ l (/ k_m (/ l t)))))) (/ 2.0 (/ (* (* k_m k_m) (/ (* t (* k_m k_m)) l)) l))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
double tmp;
if (t <= 4.5e-9) {
tmp = 2.0 / ((k_m * k_m) * (k_m / (l / (k_m / (l / t)))));
} else {
tmp = 2.0 / (((k_m * k_m) * ((t * (k_m * k_m)) / l)) / l);
}
return tmp;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
real(8) :: tmp
if (t <= 4.5d-9) then
tmp = 2.0d0 / ((k_m * k_m) * (k_m / (l / (k_m / (l / t)))))
else
tmp = 2.0d0 / (((k_m * k_m) * ((t * (k_m * k_m)) / l)) / l)
end if
code = tmp
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
double tmp;
if (t <= 4.5e-9) {
tmp = 2.0 / ((k_m * k_m) * (k_m / (l / (k_m / (l / t)))));
} else {
tmp = 2.0 / (((k_m * k_m) * ((t * (k_m * k_m)) / l)) / l);
}
return tmp;
}
k_m = math.fabs(k) def code(t, l, k_m): tmp = 0 if t <= 4.5e-9: tmp = 2.0 / ((k_m * k_m) * (k_m / (l / (k_m / (l / t))))) else: tmp = 2.0 / (((k_m * k_m) * ((t * (k_m * k_m)) / l)) / l) return tmp
k_m = abs(k) function code(t, l, k_m) tmp = 0.0 if (t <= 4.5e-9) tmp = Float64(2.0 / Float64(Float64(k_m * k_m) * Float64(k_m / Float64(l / Float64(k_m / Float64(l / t)))))); else tmp = Float64(2.0 / Float64(Float64(Float64(k_m * k_m) * Float64(Float64(t * Float64(k_m * k_m)) / l)) / l)); end return tmp end
k_m = abs(k); function tmp_2 = code(t, l, k_m) tmp = 0.0; if (t <= 4.5e-9) tmp = 2.0 / ((k_m * k_m) * (k_m / (l / (k_m / (l / t))))); else tmp = 2.0 / (((k_m * k_m) * ((t * (k_m * k_m)) / l)) / l); end tmp_2 = tmp; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := If[LessEqual[t, 4.5e-9], N[(2.0 / N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(k$95$m / N[(l / N[(k$95$m / N[(l / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(N[(N[(k$95$m * k$95$m), $MachinePrecision] * N[(N[(t * N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
k_m = \left|k\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 4.5 \cdot 10^{-9}:\\
\;\;\;\;\frac{2}{\left(k\_m \cdot k\_m\right) \cdot \frac{k\_m}{\frac{\ell}{\frac{k\_m}{\frac{\ell}{t}}}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{\frac{\left(k\_m \cdot k\_m\right) \cdot \frac{t \cdot \left(k\_m \cdot k\_m\right)}{\ell}}{\ell}}\\
\end{array}
\end{array}
if t < 4.49999999999999976e-9Initial program 38.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-*.f6460.9%
Simplified60.9%
*-commutativeN/A
div-invN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
cube-unmultN/A
*-lowering-*.f64N/A
cube-unmultN/A
*-lowering-*.f64N/A
*-lowering-*.f6460.5%
Applied egg-rr60.5%
associate-*r*N/A
associate-*r*N/A
associate-*r*N/A
un-div-invN/A
associate-/l/N/A
clear-numN/A
associate-/r/N/A
clear-numN/A
*-lowering-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
associate-/l/N/A
clear-numN/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6470.4%
Applied egg-rr70.4%
if 4.49999999999999976e-9 < t Initial program 32.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-*.f6462.4%
Simplified62.4%
associate-*l*N/A
associate-/l*N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6480.9%
Applied egg-rr80.9%
Final simplification73.3%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ (/ (* (/ l 0.5) (/ (/ l (* k_m t)) k_m)) k_m) k_m))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return (((l / 0.5) * ((l / (k_m * t)) / k_m)) / k_m) / k_m;
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = (((l / 0.5d0) * ((l / (k_m * t)) / k_m)) / k_m) / k_m
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return (((l / 0.5) * ((l / (k_m * t)) / k_m)) / k_m) / k_m;
}
k_m = math.fabs(k) def code(t, l, k_m): return (((l / 0.5) * ((l / (k_m * t)) / k_m)) / k_m) / k_m
k_m = abs(k) function code(t, l, k_m) return Float64(Float64(Float64(Float64(l / 0.5) * Float64(Float64(l / Float64(k_m * t)) / k_m)) / k_m) / k_m) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = (((l / 0.5) * ((l / (k_m * t)) / k_m)) / k_m) / k_m; end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(N[(N[(N[(l / 0.5), $MachinePrecision] * N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / k$95$m), $MachinePrecision]), $MachinePrecision] / k$95$m), $MachinePrecision] / k$95$m), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{\frac{\frac{\ell}{0.5} \cdot \frac{\frac{\ell}{k\_m \cdot t}}{k\_m}}{k\_m}}{k\_m}
\end{array}
Initial program 36.9%
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-*.f6461.3%
Simplified61.3%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
cube-unmultN/A
*-lowering-*.f64N/A
cube-unmultN/A
*-lowering-*.f64N/A
*-lowering-*.f6465.0%
Applied egg-rr65.0%
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
div-invN/A
unpow-1N/A
associate-/r*N/A
unpow-1N/A
div-invN/A
unpow-1N/A
/-lowering-/.f64N/A
Applied egg-rr70.4%
frac-timesN/A
div-invN/A
*-lowering-*.f64N/A
*-commutativeN/A
metadata-evalN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
metadata-evalN/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6474.2%
Applied egg-rr74.2%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (* 2.0 (* (/ (/ l (* k_m t)) k_m) (/ l (* k_m k_m)))))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return 2.0 * (((l / (k_m * t)) / k_m) * (l / (k_m * k_m)));
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = 2.0d0 * (((l / (k_m * t)) / k_m) * (l / (k_m * k_m)))
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return 2.0 * (((l / (k_m * t)) / k_m) * (l / (k_m * k_m)));
}
k_m = math.fabs(k) def code(t, l, k_m): return 2.0 * (((l / (k_m * t)) / k_m) * (l / (k_m * k_m)))
k_m = abs(k) function code(t, l, k_m) return Float64(2.0 * Float64(Float64(Float64(l / Float64(k_m * t)) / k_m) * Float64(l / Float64(k_m * k_m)))) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = 2.0 * (((l / (k_m * t)) / k_m) * (l / (k_m * k_m))); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(2.0 * N[(N[(N[(l / N[(k$95$m * t), $MachinePrecision]), $MachinePrecision] / k$95$m), $MachinePrecision] * N[(l / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
2 \cdot \left(\frac{\frac{\ell}{k\_m \cdot t}}{k\_m} \cdot \frac{\ell}{k\_m \cdot k\_m}\right)
\end{array}
Initial program 36.9%
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-*.f6461.3%
Simplified61.3%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
cube-unmultN/A
*-lowering-*.f64N/A
cube-unmultN/A
*-lowering-*.f64N/A
*-lowering-*.f6465.0%
Applied egg-rr65.0%
associate-/l/N/A
associate-/r*N/A
div-invN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6466.1%
Applied egg-rr66.1%
associate-*l/N/A
associate-*r*N/A
times-fracN/A
clear-numN/A
associate-*r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6472.9%
Applied egg-rr72.9%
Final simplification72.9%
k_m = (fabs.f64 k) (FPCore (t l k_m) :precision binary64 (/ (* -0.3333333333333333 (* l (/ l t))) (* k_m k_m)))
k_m = fabs(k);
double code(double t, double l, double k_m) {
return (-0.3333333333333333 * (l * (l / t))) / (k_m * k_m);
}
k_m = abs(k)
real(8) function code(t, l, k_m)
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: k_m
code = ((-0.3333333333333333d0) * (l * (l / t))) / (k_m * k_m)
end function
k_m = Math.abs(k);
public static double code(double t, double l, double k_m) {
return (-0.3333333333333333 * (l * (l / t))) / (k_m * k_m);
}
k_m = math.fabs(k) def code(t, l, k_m): return (-0.3333333333333333 * (l * (l / t))) / (k_m * k_m)
k_m = abs(k) function code(t, l, k_m) return Float64(Float64(-0.3333333333333333 * Float64(l * Float64(l / t))) / Float64(k_m * k_m)) end
k_m = abs(k); function tmp = code(t, l, k_m) tmp = (-0.3333333333333333 * (l * (l / t))) / (k_m * k_m); end
k_m = N[Abs[k], $MachinePrecision] code[t_, l_, k$95$m_] := N[(N[(-0.3333333333333333 * N[(l * N[(l / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k$95$m * k$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
k_m = \left|k\right|
\\
\frac{-0.3333333333333333 \cdot \left(\ell \cdot \frac{\ell}{t}\right)}{k\_m \cdot k\_m}
\end{array}
Initial program 36.9%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified49.8%
Taylor expanded in k around 0
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
/-lowering-/.f64N/A
Simplified28.3%
Taylor expanded in k around inf
associate-*r/N/A
times-fracN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6429.8%
Simplified29.8%
herbie shell --seed 2024155
(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))))