
(FPCore (l Om kx ky)
:precision binary64
(sqrt
(*
(/ 1.0 2.0)
(+
1.0
(/
1.0
(sqrt
(+
1.0
(*
(pow (/ (* 2.0 l) Om) 2.0)
(+ (pow (sin kx) 2.0) (pow (sin ky) 2.0))))))))))
double code(double l, double Om, double kx, double ky) {
return sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt((1.0 + (pow(((2.0 * l) / Om), 2.0) * (pow(sin(kx), 2.0) + pow(sin(ky), 2.0)))))))));
}
real(8) function code(l, om, kx, ky)
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: kx
real(8), intent (in) :: ky
code = sqrt(((1.0d0 / 2.0d0) * (1.0d0 + (1.0d0 / sqrt((1.0d0 + ((((2.0d0 * l) / om) ** 2.0d0) * ((sin(kx) ** 2.0d0) + (sin(ky) ** 2.0d0)))))))))
end function
public static double code(double l, double Om, double kx, double ky) {
return Math.sqrt(((1.0 / 2.0) * (1.0 + (1.0 / Math.sqrt((1.0 + (Math.pow(((2.0 * l) / Om), 2.0) * (Math.pow(Math.sin(kx), 2.0) + Math.pow(Math.sin(ky), 2.0)))))))));
}
def code(l, Om, kx, ky): return math.sqrt(((1.0 / 2.0) * (1.0 + (1.0 / math.sqrt((1.0 + (math.pow(((2.0 * l) / Om), 2.0) * (math.pow(math.sin(kx), 2.0) + math.pow(math.sin(ky), 2.0)))))))))
function code(l, Om, kx, ky) return sqrt(Float64(Float64(1.0 / 2.0) * Float64(1.0 + Float64(1.0 / sqrt(Float64(1.0 + Float64((Float64(Float64(2.0 * l) / Om) ^ 2.0) * Float64((sin(kx) ^ 2.0) + (sin(ky) ^ 2.0))))))))) end
function tmp = code(l, Om, kx, ky) tmp = sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt((1.0 + ((((2.0 * l) / Om) ^ 2.0) * ((sin(kx) ^ 2.0) + (sin(ky) ^ 2.0))))))))); end
code[l_, Om_, kx_, ky_] := N[Sqrt[N[(N[(1.0 / 2.0), $MachinePrecision] * N[(1.0 + N[(1.0 / N[Sqrt[N[(1.0 + N[(N[Power[N[(N[(2.0 * l), $MachinePrecision] / Om), $MachinePrecision], 2.0], $MachinePrecision] * N[(N[Power[N[Sin[kx], $MachinePrecision], 2.0], $MachinePrecision] + N[Power[N[Sin[ky], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{1}{2} \cdot \left(1 + \frac{1}{\sqrt{1 + {\left(\frac{2 \cdot \ell}{Om}\right)}^{2} \cdot \left({\sin kx}^{2} + {\sin ky}^{2}\right)}}\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 5 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (l Om kx ky)
:precision binary64
(sqrt
(*
(/ 1.0 2.0)
(+
1.0
(/
1.0
(sqrt
(+
1.0
(*
(pow (/ (* 2.0 l) Om) 2.0)
(+ (pow (sin kx) 2.0) (pow (sin ky) 2.0))))))))))
double code(double l, double Om, double kx, double ky) {
return sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt((1.0 + (pow(((2.0 * l) / Om), 2.0) * (pow(sin(kx), 2.0) + pow(sin(ky), 2.0)))))))));
}
real(8) function code(l, om, kx, ky)
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: kx
real(8), intent (in) :: ky
code = sqrt(((1.0d0 / 2.0d0) * (1.0d0 + (1.0d0 / sqrt((1.0d0 + ((((2.0d0 * l) / om) ** 2.0d0) * ((sin(kx) ** 2.0d0) + (sin(ky) ** 2.0d0)))))))))
end function
public static double code(double l, double Om, double kx, double ky) {
return Math.sqrt(((1.0 / 2.0) * (1.0 + (1.0 / Math.sqrt((1.0 + (Math.pow(((2.0 * l) / Om), 2.0) * (Math.pow(Math.sin(kx), 2.0) + Math.pow(Math.sin(ky), 2.0)))))))));
}
def code(l, Om, kx, ky): return math.sqrt(((1.0 / 2.0) * (1.0 + (1.0 / math.sqrt((1.0 + (math.pow(((2.0 * l) / Om), 2.0) * (math.pow(math.sin(kx), 2.0) + math.pow(math.sin(ky), 2.0)))))))))
function code(l, Om, kx, ky) return sqrt(Float64(Float64(1.0 / 2.0) * Float64(1.0 + Float64(1.0 / sqrt(Float64(1.0 + Float64((Float64(Float64(2.0 * l) / Om) ^ 2.0) * Float64((sin(kx) ^ 2.0) + (sin(ky) ^ 2.0))))))))) end
function tmp = code(l, Om, kx, ky) tmp = sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt((1.0 + ((((2.0 * l) / Om) ^ 2.0) * ((sin(kx) ^ 2.0) + (sin(ky) ^ 2.0))))))))); end
code[l_, Om_, kx_, ky_] := N[Sqrt[N[(N[(1.0 / 2.0), $MachinePrecision] * N[(1.0 + N[(1.0 / N[Sqrt[N[(1.0 + N[(N[Power[N[(N[(2.0 * l), $MachinePrecision] / Om), $MachinePrecision], 2.0], $MachinePrecision] * N[(N[Power[N[Sin[kx], $MachinePrecision], 2.0], $MachinePrecision] + N[Power[N[Sin[ky], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{1}{2} \cdot \left(1 + \frac{1}{\sqrt{1 + {\left(\frac{2 \cdot \ell}{Om}\right)}^{2} \cdot \left({\sin kx}^{2} + {\sin ky}^{2}\right)}}\right)}
\end{array}
kx_m = (fabs.f64 kx) ky_m = (fabs.f64 ky) NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. (FPCore (l Om kx_m ky_m) :precision binary64 (sqrt (+ 0.5 (/ 0.5 (hypot 1.0 (* (sin ky_m) (* (/ 2.0 Om) l)))))))
kx_m = fabs(kx);
ky_m = fabs(ky);
assert(l < Om && Om < kx_m && kx_m < ky_m);
double code(double l, double Om, double kx_m, double ky_m) {
return sqrt((0.5 + (0.5 / hypot(1.0, (sin(ky_m) * ((2.0 / Om) * l))))));
}
kx_m = Math.abs(kx);
ky_m = Math.abs(ky);
assert l < Om && Om < kx_m && kx_m < ky_m;
public static double code(double l, double Om, double kx_m, double ky_m) {
return Math.sqrt((0.5 + (0.5 / Math.hypot(1.0, (Math.sin(ky_m) * ((2.0 / Om) * l))))));
}
kx_m = math.fabs(kx) ky_m = math.fabs(ky) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): return math.sqrt((0.5 + (0.5 / math.hypot(1.0, (math.sin(ky_m) * ((2.0 / Om) * l))))))
kx_m = abs(kx) ky_m = abs(ky) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) return sqrt(Float64(0.5 + Float64(0.5 / hypot(1.0, Float64(sin(ky_m) * Float64(Float64(2.0 / Om) * l)))))) end
kx_m = abs(kx);
ky_m = abs(ky);
l, Om, kx_m, ky_m = num2cell(sort([l, Om, kx_m, ky_m])){:}
function tmp = code(l, Om, kx_m, ky_m)
tmp = sqrt((0.5 + (0.5 / hypot(1.0, (sin(ky_m) * ((2.0 / Om) * l))))));
end
kx_m = N[Abs[kx], $MachinePrecision] ky_m = N[Abs[ky], $MachinePrecision] NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. code[l_, Om_, kx$95$m_, ky$95$m_] := N[Sqrt[N[(0.5 + N[(0.5 / N[Sqrt[1.0 ^ 2 + N[(N[Sin[ky$95$m], $MachinePrecision] * N[(N[(2.0 / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
kx_m = \left|kx\right|
\\
ky_m = \left|ky\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\sqrt{0.5 + \frac{0.5}{\mathsf{hypot}\left(1, \sin ky\_m \cdot \left(\frac{2}{Om} \cdot \ell\right)\right)}}
\end{array}
Initial program 97.8%
Simplified97.8%
*-un-lft-identity97.8%
add-sqr-sqrt97.8%
hypot-1-def97.8%
sqrt-prod97.8%
sqrt-pow198.3%
metadata-eval98.3%
pow198.3%
clear-num98.3%
un-div-inv98.3%
unpow298.3%
unpow298.3%
hypot-define100.0%
Applied egg-rr100.0%
*-lft-identity100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in kx around 0 92.8%
un-div-inv92.8%
associate-*l/92.8%
associate-/l*92.8%
Applied egg-rr92.8%
associate-*r*92.8%
clear-num92.8%
un-div-inv92.8%
Applied egg-rr92.8%
associate-/l*92.8%
associate-/r/92.8%
Simplified92.8%
kx_m = (fabs.f64 kx) ky_m = (fabs.f64 ky) NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. (FPCore (l Om kx_m ky_m) :precision binary64 (sqrt (+ 0.5 (/ 0.5 (hypot 1.0 (* (sin ky_m) (* 2.0 (/ l Om))))))))
kx_m = fabs(kx);
ky_m = fabs(ky);
assert(l < Om && Om < kx_m && kx_m < ky_m);
double code(double l, double Om, double kx_m, double ky_m) {
return sqrt((0.5 + (0.5 / hypot(1.0, (sin(ky_m) * (2.0 * (l / Om)))))));
}
kx_m = Math.abs(kx);
ky_m = Math.abs(ky);
assert l < Om && Om < kx_m && kx_m < ky_m;
public static double code(double l, double Om, double kx_m, double ky_m) {
return Math.sqrt((0.5 + (0.5 / Math.hypot(1.0, (Math.sin(ky_m) * (2.0 * (l / Om)))))));
}
kx_m = math.fabs(kx) ky_m = math.fabs(ky) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): return math.sqrt((0.5 + (0.5 / math.hypot(1.0, (math.sin(ky_m) * (2.0 * (l / Om)))))))
kx_m = abs(kx) ky_m = abs(ky) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) return sqrt(Float64(0.5 + Float64(0.5 / hypot(1.0, Float64(sin(ky_m) * Float64(2.0 * Float64(l / Om))))))) end
kx_m = abs(kx);
ky_m = abs(ky);
l, Om, kx_m, ky_m = num2cell(sort([l, Om, kx_m, ky_m])){:}
function tmp = code(l, Om, kx_m, ky_m)
tmp = sqrt((0.5 + (0.5 / hypot(1.0, (sin(ky_m) * (2.0 * (l / Om)))))));
end
kx_m = N[Abs[kx], $MachinePrecision] ky_m = N[Abs[ky], $MachinePrecision] NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. code[l_, Om_, kx$95$m_, ky$95$m_] := N[Sqrt[N[(0.5 + N[(0.5 / N[Sqrt[1.0 ^ 2 + N[(N[Sin[ky$95$m], $MachinePrecision] * N[(2.0 * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
kx_m = \left|kx\right|
\\
ky_m = \left|ky\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\sqrt{0.5 + \frac{0.5}{\mathsf{hypot}\left(1, \sin ky\_m \cdot \left(2 \cdot \frac{\ell}{Om}\right)\right)}}
\end{array}
Initial program 97.8%
Simplified97.8%
*-un-lft-identity97.8%
add-sqr-sqrt97.8%
hypot-1-def97.8%
sqrt-prod97.8%
sqrt-pow198.3%
metadata-eval98.3%
pow198.3%
clear-num98.3%
un-div-inv98.3%
unpow298.3%
unpow298.3%
hypot-define100.0%
Applied egg-rr100.0%
*-lft-identity100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in kx around 0 92.8%
un-div-inv92.8%
associate-*l/92.8%
associate-/l*92.8%
Applied egg-rr92.8%
kx_m = (fabs.f64 kx) ky_m = (fabs.f64 ky) NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. (FPCore (l Om kx_m ky_m) :precision binary64 (if (or (<= Om 3.8e+55) (and (not (<= Om 5.6e+81)) (<= Om 2.5e+135))) (sqrt (+ 0.5 (/ 0.5 (hypot 1.0 (* (/ l Om) (* ky_m 2.0)))))) 1.0))
kx_m = fabs(kx);
ky_m = fabs(ky);
assert(l < Om && Om < kx_m && kx_m < ky_m);
double code(double l, double Om, double kx_m, double ky_m) {
double tmp;
if ((Om <= 3.8e+55) || (!(Om <= 5.6e+81) && (Om <= 2.5e+135))) {
tmp = sqrt((0.5 + (0.5 / hypot(1.0, ((l / Om) * (ky_m * 2.0))))));
} else {
tmp = 1.0;
}
return tmp;
}
kx_m = Math.abs(kx);
ky_m = Math.abs(ky);
assert l < Om && Om < kx_m && kx_m < ky_m;
public static double code(double l, double Om, double kx_m, double ky_m) {
double tmp;
if ((Om <= 3.8e+55) || (!(Om <= 5.6e+81) && (Om <= 2.5e+135))) {
tmp = Math.sqrt((0.5 + (0.5 / Math.hypot(1.0, ((l / Om) * (ky_m * 2.0))))));
} else {
tmp = 1.0;
}
return tmp;
}
kx_m = math.fabs(kx) ky_m = math.fabs(ky) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): tmp = 0 if (Om <= 3.8e+55) or (not (Om <= 5.6e+81) and (Om <= 2.5e+135)): tmp = math.sqrt((0.5 + (0.5 / math.hypot(1.0, ((l / Om) * (ky_m * 2.0)))))) else: tmp = 1.0 return tmp
kx_m = abs(kx) ky_m = abs(ky) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) tmp = 0.0 if ((Om <= 3.8e+55) || (!(Om <= 5.6e+81) && (Om <= 2.5e+135))) tmp = sqrt(Float64(0.5 + Float64(0.5 / hypot(1.0, Float64(Float64(l / Om) * Float64(ky_m * 2.0)))))); else tmp = 1.0; end return tmp end
kx_m = abs(kx);
ky_m = abs(ky);
l, Om, kx_m, ky_m = num2cell(sort([l, Om, kx_m, ky_m])){:}
function tmp_2 = code(l, Om, kx_m, ky_m)
tmp = 0.0;
if ((Om <= 3.8e+55) || (~((Om <= 5.6e+81)) && (Om <= 2.5e+135)))
tmp = sqrt((0.5 + (0.5 / hypot(1.0, ((l / Om) * (ky_m * 2.0))))));
else
tmp = 1.0;
end
tmp_2 = tmp;
end
kx_m = N[Abs[kx], $MachinePrecision] ky_m = N[Abs[ky], $MachinePrecision] NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. code[l_, Om_, kx$95$m_, ky$95$m_] := If[Or[LessEqual[Om, 3.8e+55], And[N[Not[LessEqual[Om, 5.6e+81]], $MachinePrecision], LessEqual[Om, 2.5e+135]]], N[Sqrt[N[(0.5 + N[(0.5 / N[Sqrt[1.0 ^ 2 + N[(N[(l / Om), $MachinePrecision] * N[(ky$95$m * 2.0), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 1.0]
\begin{array}{l}
kx_m = \left|kx\right|
\\
ky_m = \left|ky\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\begin{array}{l}
\mathbf{if}\;Om \leq 3.8 \cdot 10^{+55} \lor \neg \left(Om \leq 5.6 \cdot 10^{+81}\right) \land Om \leq 2.5 \cdot 10^{+135}:\\
\;\;\;\;\sqrt{0.5 + \frac{0.5}{\mathsf{hypot}\left(1, \frac{\ell}{Om} \cdot \left(ky\_m \cdot 2\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\end{array}
if Om < 3.8e55 or 5.5999999999999999e81 < Om < 2.50000000000000015e135Initial program 97.3%
Simplified97.3%
*-un-lft-identity97.3%
add-sqr-sqrt97.3%
hypot-1-def97.3%
sqrt-prod97.3%
sqrt-pow197.9%
metadata-eval97.9%
pow197.9%
clear-num97.9%
un-div-inv97.9%
unpow297.9%
unpow297.9%
hypot-define100.0%
Applied egg-rr100.0%
*-lft-identity100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in kx around 0 91.5%
Taylor expanded in ky around 0 84.6%
*-commutative84.6%
associate-/l*84.6%
associate-*r*84.6%
*-commutative84.6%
associate-*r*84.6%
Simplified84.6%
un-div-inv84.6%
associate-*l*84.6%
associate-*r/84.6%
Applied egg-rr84.6%
associate-*r/84.6%
associate-*l*84.6%
associate-/l*84.6%
*-commutative84.6%
Simplified84.6%
if 3.8e55 < Om < 5.5999999999999999e81 or 2.50000000000000015e135 < Om Initial program 100.0%
Simplified100.0%
*-un-lft-identity100.0%
add-sqr-sqrt100.0%
hypot-1-def100.0%
sqrt-prod100.0%
sqrt-pow1100.0%
metadata-eval100.0%
pow1100.0%
clear-num100.0%
un-div-inv100.0%
unpow2100.0%
unpow2100.0%
hypot-define100.0%
Applied egg-rr100.0%
*-lft-identity100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in kx around 0 98.6%
un-div-inv98.6%
associate-*l/98.6%
associate-/l*98.6%
Applied egg-rr98.6%
Taylor expanded in ky around 0 95.1%
Final simplification86.5%
kx_m = (fabs.f64 kx) ky_m = (fabs.f64 ky) NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. (FPCore (l Om kx_m ky_m) :precision binary64 (if (<= Om 3e-98) (sqrt 0.5) (if (<= Om 3.5e-69) 1.0 (if (<= Om 2.9e-12) (sqrt 0.5) 1.0))))
kx_m = fabs(kx);
ky_m = fabs(ky);
assert(l < Om && Om < kx_m && kx_m < ky_m);
double code(double l, double Om, double kx_m, double ky_m) {
double tmp;
if (Om <= 3e-98) {
tmp = sqrt(0.5);
} else if (Om <= 3.5e-69) {
tmp = 1.0;
} else if (Om <= 2.9e-12) {
tmp = sqrt(0.5);
} else {
tmp = 1.0;
}
return tmp;
}
kx_m = abs(kx)
ky_m = abs(ky)
NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function.
real(8) function code(l, om, kx_m, ky_m)
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: kx_m
real(8), intent (in) :: ky_m
real(8) :: tmp
if (om <= 3d-98) then
tmp = sqrt(0.5d0)
else if (om <= 3.5d-69) then
tmp = 1.0d0
else if (om <= 2.9d-12) then
tmp = sqrt(0.5d0)
else
tmp = 1.0d0
end if
code = tmp
end function
kx_m = Math.abs(kx);
ky_m = Math.abs(ky);
assert l < Om && Om < kx_m && kx_m < ky_m;
public static double code(double l, double Om, double kx_m, double ky_m) {
double tmp;
if (Om <= 3e-98) {
tmp = Math.sqrt(0.5);
} else if (Om <= 3.5e-69) {
tmp = 1.0;
} else if (Om <= 2.9e-12) {
tmp = Math.sqrt(0.5);
} else {
tmp = 1.0;
}
return tmp;
}
kx_m = math.fabs(kx) ky_m = math.fabs(ky) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): tmp = 0 if Om <= 3e-98: tmp = math.sqrt(0.5) elif Om <= 3.5e-69: tmp = 1.0 elif Om <= 2.9e-12: tmp = math.sqrt(0.5) else: tmp = 1.0 return tmp
kx_m = abs(kx) ky_m = abs(ky) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) tmp = 0.0 if (Om <= 3e-98) tmp = sqrt(0.5); elseif (Om <= 3.5e-69) tmp = 1.0; elseif (Om <= 2.9e-12) tmp = sqrt(0.5); else tmp = 1.0; end return tmp end
kx_m = abs(kx);
ky_m = abs(ky);
l, Om, kx_m, ky_m = num2cell(sort([l, Om, kx_m, ky_m])){:}
function tmp_2 = code(l, Om, kx_m, ky_m)
tmp = 0.0;
if (Om <= 3e-98)
tmp = sqrt(0.5);
elseif (Om <= 3.5e-69)
tmp = 1.0;
elseif (Om <= 2.9e-12)
tmp = sqrt(0.5);
else
tmp = 1.0;
end
tmp_2 = tmp;
end
kx_m = N[Abs[kx], $MachinePrecision] ky_m = N[Abs[ky], $MachinePrecision] NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. code[l_, Om_, kx$95$m_, ky$95$m_] := If[LessEqual[Om, 3e-98], N[Sqrt[0.5], $MachinePrecision], If[LessEqual[Om, 3.5e-69], 1.0, If[LessEqual[Om, 2.9e-12], N[Sqrt[0.5], $MachinePrecision], 1.0]]]
\begin{array}{l}
kx_m = \left|kx\right|
\\
ky_m = \left|ky\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\begin{array}{l}
\mathbf{if}\;Om \leq 3 \cdot 10^{-98}:\\
\;\;\;\;\sqrt{0.5}\\
\mathbf{elif}\;Om \leq 3.5 \cdot 10^{-69}:\\
\;\;\;\;1\\
\mathbf{elif}\;Om \leq 2.9 \cdot 10^{-12}:\\
\;\;\;\;\sqrt{0.5}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\end{array}
if Om < 3e-98 or 3.5000000000000001e-69 < Om < 2.9000000000000002e-12Initial program 97.5%
Simplified97.5%
Taylor expanded in l around inf 51.4%
unpow251.4%
unpow251.4%
hypot-undefine53.6%
Simplified53.6%
Taylor expanded in l around inf 61.5%
if 3e-98 < Om < 3.5000000000000001e-69 or 2.9000000000000002e-12 < Om Initial program 98.6%
Simplified98.6%
*-un-lft-identity98.6%
add-sqr-sqrt98.6%
hypot-1-def98.6%
sqrt-prod98.6%
sqrt-pow199.1%
metadata-eval99.1%
pow199.1%
clear-num99.1%
un-div-inv99.1%
unpow299.1%
unpow299.1%
hypot-define100.0%
Applied egg-rr100.0%
*-lft-identity100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in kx around 0 94.9%
un-div-inv94.9%
associate-*l/94.9%
associate-/l*94.9%
Applied egg-rr94.9%
Taylor expanded in ky around 0 86.1%
Final simplification68.5%
kx_m = (fabs.f64 kx) ky_m = (fabs.f64 ky) NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. (FPCore (l Om kx_m ky_m) :precision binary64 (sqrt 0.5))
kx_m = fabs(kx);
ky_m = fabs(ky);
assert(l < Om && Om < kx_m && kx_m < ky_m);
double code(double l, double Om, double kx_m, double ky_m) {
return sqrt(0.5);
}
kx_m = abs(kx)
ky_m = abs(ky)
NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function.
real(8) function code(l, om, kx_m, ky_m)
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: kx_m
real(8), intent (in) :: ky_m
code = sqrt(0.5d0)
end function
kx_m = Math.abs(kx);
ky_m = Math.abs(ky);
assert l < Om && Om < kx_m && kx_m < ky_m;
public static double code(double l, double Om, double kx_m, double ky_m) {
return Math.sqrt(0.5);
}
kx_m = math.fabs(kx) ky_m = math.fabs(ky) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): return math.sqrt(0.5)
kx_m = abs(kx) ky_m = abs(ky) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) return sqrt(0.5) end
kx_m = abs(kx);
ky_m = abs(ky);
l, Om, kx_m, ky_m = num2cell(sort([l, Om, kx_m, ky_m])){:}
function tmp = code(l, Om, kx_m, ky_m)
tmp = sqrt(0.5);
end
kx_m = N[Abs[kx], $MachinePrecision] ky_m = N[Abs[ky], $MachinePrecision] NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. code[l_, Om_, kx$95$m_, ky$95$m_] := N[Sqrt[0.5], $MachinePrecision]
\begin{array}{l}
kx_m = \left|kx\right|
\\
ky_m = \left|ky\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\sqrt{0.5}
\end{array}
Initial program 97.8%
Simplified97.8%
Taylor expanded in l around inf 41.7%
unpow241.7%
unpow241.7%
hypot-undefine43.3%
Simplified43.3%
Taylor expanded in l around inf 53.0%
herbie shell --seed 2024108
(FPCore (l Om kx ky)
:name "Toniolo and Linder, Equation (3a)"
:precision binary64
(sqrt (* (/ 1.0 2.0) (+ 1.0 (/ 1.0 (sqrt (+ 1.0 (* (pow (/ (* 2.0 l) Om) 2.0) (+ (pow (sin kx) 2.0) (pow (sin ky) 2.0))))))))))