
(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 9 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 (let* ((t_0 (/ Om (sin ky_m)))) (sqrt (fma 0.5 (sqrt (/ 1.0 (fma (/ (* l 4.0) t_0) (/ l t_0) 1.0))) 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) {
double t_0 = Om / sin(ky_m);
return sqrt(fma(0.5, sqrt((1.0 / fma(((l * 4.0) / t_0), (l / t_0), 1.0))), 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) t_0 = Float64(Om / sin(ky_m)) return sqrt(fma(0.5, sqrt(Float64(1.0 / fma(Float64(Float64(l * 4.0) / t_0), Float64(l / t_0), 1.0))), 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_] := Block[{t$95$0 = N[(Om / N[Sin[ky$95$m], $MachinePrecision]), $MachinePrecision]}, N[Sqrt[N[(0.5 * N[Sqrt[N[(1.0 / N[(N[(N[(l * 4.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(l / t$95$0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + 0.5), $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])\\
\\
\begin{array}{l}
t_0 := \frac{Om}{\sin ky\_m}\\
\sqrt{\mathsf{fma}\left(0.5, \sqrt{\frac{1}{\mathsf{fma}\left(\frac{\ell \cdot 4}{t\_0}, \frac{\ell}{t\_0}, 1\right)}}, 0.5\right)}
\end{array}
\end{array}
Initial program 96.9%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified80.4%
pow2N/A
clear-numN/A
un-div-invN/A
associate-*r*N/A
*-commutativeN/A
times-fracN/A
times-fracN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sin-lowering-sin.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sin-lowering-sin.f6496.2
Applied egg-rr96.2%
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 (<= (pow (sin ky_m) 2.0) 2e-34)
(sqrt
(fma
0.5
(sqrt (/ 1.0 (fma (/ (* l 4.0) (/ Om (sin ky_m))) (/ (* l ky_m) Om) 1.0)))
0.5))
(sqrt
(*
0.5
(+
1.0
(/
1.0
(sqrt
(fma
(* 4.0 (/ l Om))
(/ (* l (fma -0.5 (cos (* ky_m -2.0)) 0.5)) Om)
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 (pow(sin(ky_m), 2.0) <= 2e-34) {
tmp = sqrt(fma(0.5, sqrt((1.0 / fma(((l * 4.0) / (Om / sin(ky_m))), ((l * ky_m) / Om), 1.0))), 0.5));
} else {
tmp = sqrt((0.5 * (1.0 + (1.0 / sqrt(fma((4.0 * (l / Om)), ((l * fma(-0.5, cos((ky_m * -2.0)), 0.5)) / Om), 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 ((sin(ky_m) ^ 2.0) <= 2e-34) tmp = sqrt(fma(0.5, sqrt(Float64(1.0 / fma(Float64(Float64(l * 4.0) / Float64(Om / sin(ky_m))), Float64(Float64(l * ky_m) / Om), 1.0))), 0.5)); else tmp = sqrt(Float64(0.5 * Float64(1.0 + Float64(1.0 / sqrt(fma(Float64(4.0 * Float64(l / Om)), Float64(Float64(l * fma(-0.5, cos(Float64(ky_m * -2.0)), 0.5)) / Om), 1.0)))))); end return 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[N[Power[N[Sin[ky$95$m], $MachinePrecision], 2.0], $MachinePrecision], 2e-34], N[Sqrt[N[(0.5 * N[Sqrt[N[(1.0 / N[(N[(N[(l * 4.0), $MachinePrecision] / N[(Om / N[Sin[ky$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(l * ky$95$m), $MachinePrecision] / Om), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + 0.5), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(0.5 * N[(1.0 + N[(1.0 / N[Sqrt[N[(N[(4.0 * N[(l / Om), $MachinePrecision]), $MachinePrecision] * N[(N[(l * N[(-0.5 * N[Cos[N[(ky$95$m * -2.0), $MachinePrecision]], $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;{\sin ky\_m}^{2} \leq 2 \cdot 10^{-34}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(0.5, \sqrt{\frac{1}{\mathsf{fma}\left(\frac{\ell \cdot 4}{\frac{Om}{\sin ky\_m}}, \frac{\ell \cdot ky\_m}{Om}, 1\right)}}, 0.5\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 \cdot \left(1 + \frac{1}{\sqrt{\mathsf{fma}\left(4 \cdot \frac{\ell}{Om}, \frac{\ell \cdot \mathsf{fma}\left(-0.5, \cos \left(ky\_m \cdot -2\right), 0.5\right)}{Om}, 1\right)}}\right)}\\
\end{array}
\end{array}
if (pow.f64 (sin.f64 ky) #s(literal 2 binary64)) < 1.99999999999999986e-34Initial program 93.3%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified67.9%
pow2N/A
clear-numN/A
un-div-invN/A
associate-*r*N/A
*-commutativeN/A
times-fracN/A
times-fracN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sin-lowering-sin.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sin-lowering-sin.f6491.9
Applied egg-rr91.9%
Taylor expanded in ky around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6491.9
Simplified91.9%
if 1.99999999999999986e-34 < (pow.f64 (sin.f64 ky) #s(literal 2 binary64)) Initial program 100.0%
Applied egg-rr100.0%
metadata-eval100.0
Applied egg-rr100.0%
Taylor expanded in kx around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
cos-negN/A
cos-lowering-cos.f64N/A
*-lowering-*.f64100.0
Simplified100.0%
Final simplification96.2%
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 (<= l 2e-177)
(sqrt
(fma
0.5
(sqrt
(/
1.0
(fma
(/ (* l 4.0) Om)
(* (/ l Om) (fma -0.5 (cos (+ kx_m kx_m)) 0.5))
1.0)))
0.5))
(if (<= l 1.6e+128)
(sqrt
(+
0.5
(*
0.5
(sqrt
(/
1.0
(fma
4.0
(/ (* (fma -0.5 (cos (* ky_m -2.0)) 0.5) (* l l)) (* Om Om))
1.0))))))
(sqrt
(fma
0.5
(sqrt
(/ 1.0 (fma (/ (* l 4.0) (/ Om (sin ky_m))) (/ (* l ky_m) Om) 1.0)))
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) {
double tmp;
if (l <= 2e-177) {
tmp = sqrt(fma(0.5, sqrt((1.0 / fma(((l * 4.0) / Om), ((l / Om) * fma(-0.5, cos((kx_m + kx_m)), 0.5)), 1.0))), 0.5));
} else if (l <= 1.6e+128) {
tmp = sqrt((0.5 + (0.5 * sqrt((1.0 / fma(4.0, ((fma(-0.5, cos((ky_m * -2.0)), 0.5) * (l * l)) / (Om * Om)), 1.0))))));
} else {
tmp = sqrt(fma(0.5, sqrt((1.0 / fma(((l * 4.0) / (Om / sin(ky_m))), ((l * ky_m) / Om), 1.0))), 0.5));
}
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 (l <= 2e-177) tmp = sqrt(fma(0.5, sqrt(Float64(1.0 / fma(Float64(Float64(l * 4.0) / Om), Float64(Float64(l / Om) * fma(-0.5, cos(Float64(kx_m + kx_m)), 0.5)), 1.0))), 0.5)); elseif (l <= 1.6e+128) tmp = sqrt(Float64(0.5 + Float64(0.5 * sqrt(Float64(1.0 / fma(4.0, Float64(Float64(fma(-0.5, cos(Float64(ky_m * -2.0)), 0.5) * Float64(l * l)) / Float64(Om * Om)), 1.0)))))); else tmp = sqrt(fma(0.5, sqrt(Float64(1.0 / fma(Float64(Float64(l * 4.0) / Float64(Om / sin(ky_m))), Float64(Float64(l * ky_m) / Om), 1.0))), 0.5)); end return 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[l, 2e-177], N[Sqrt[N[(0.5 * N[Sqrt[N[(1.0 / N[(N[(N[(l * 4.0), $MachinePrecision] / Om), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(-0.5 * N[Cos[N[(kx$95$m + kx$95$m), $MachinePrecision]], $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + 0.5), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.6e+128], N[Sqrt[N[(0.5 + N[(0.5 * N[Sqrt[N[(1.0 / N[(4.0 * N[(N[(N[(-0.5 * N[Cos[N[(ky$95$m * -2.0), $MachinePrecision]], $MachinePrecision] + 0.5), $MachinePrecision] * N[(l * l), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(0.5 * N[Sqrt[N[(1.0 / N[(N[(N[(l * 4.0), $MachinePrecision] / N[(Om / N[Sin[ky$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(l * ky$95$m), $MachinePrecision] / Om), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + 0.5), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2 \cdot 10^{-177}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(0.5, \sqrt{\frac{1}{\mathsf{fma}\left(\frac{\ell \cdot 4}{Om}, \frac{\ell}{Om} \cdot \mathsf{fma}\left(-0.5, \cos \left(kx\_m + kx\_m\right), 0.5\right), 1\right)}}, 0.5\right)}\\
\mathbf{elif}\;\ell \leq 1.6 \cdot 10^{+128}:\\
\;\;\;\;\sqrt{0.5 + 0.5 \cdot \sqrt{\frac{1}{\mathsf{fma}\left(4, \frac{\mathsf{fma}\left(-0.5, \cos \left(ky\_m \cdot -2\right), 0.5\right) \cdot \left(\ell \cdot \ell\right)}{Om \cdot Om}, 1\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(0.5, \sqrt{\frac{1}{\mathsf{fma}\left(\frac{\ell \cdot 4}{\frac{Om}{\sin ky\_m}}, \frac{\ell \cdot ky\_m}{Om}, 1\right)}}, 0.5\right)}\\
\end{array}
\end{array}
if l < 1.9999999999999999e-177Initial program 98.1%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified79.9%
Applied egg-rr83.6%
if 1.9999999999999999e-177 < l < 1.59999999999999993e128Initial program 100.0%
Applied egg-rr96.0%
Taylor expanded in kx around 0
distribute-lft-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified89.2%
if 1.59999999999999993e128 < l Initial program 88.1%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified66.7%
pow2N/A
clear-numN/A
un-div-invN/A
associate-*r*N/A
*-commutativeN/A
times-fracN/A
times-fracN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sin-lowering-sin.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sin-lowering-sin.f6494.3
Applied egg-rr94.3%
Taylor expanded in ky around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6494.3
Simplified94.3%
Final simplification86.6%
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 (<= l 2e-177)
(sqrt
(fma
0.5
(sqrt
(/
1.0
(fma
(/ (* l 4.0) Om)
(* (/ l Om) (fma -0.5 (cos (+ kx_m kx_m)) 0.5))
1.0)))
0.5))
(if (<= l 3.4e+130)
(sqrt
(+
0.5
(*
0.5
(sqrt
(/
1.0
(fma
4.0
(/ (* (fma -0.5 (cos (* ky_m -2.0)) 0.5) (* l l)) (* Om Om))
1.0))))))
(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) {
double tmp;
if (l <= 2e-177) {
tmp = sqrt(fma(0.5, sqrt((1.0 / fma(((l * 4.0) / Om), ((l / Om) * fma(-0.5, cos((kx_m + kx_m)), 0.5)), 1.0))), 0.5));
} else if (l <= 3.4e+130) {
tmp = sqrt((0.5 + (0.5 * sqrt((1.0 / fma(4.0, ((fma(-0.5, cos((ky_m * -2.0)), 0.5) * (l * l)) / (Om * Om)), 1.0))))));
} else {
tmp = sqrt(0.5);
}
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 (l <= 2e-177) tmp = sqrt(fma(0.5, sqrt(Float64(1.0 / fma(Float64(Float64(l * 4.0) / Om), Float64(Float64(l / Om) * fma(-0.5, cos(Float64(kx_m + kx_m)), 0.5)), 1.0))), 0.5)); elseif (l <= 3.4e+130) tmp = sqrt(Float64(0.5 + Float64(0.5 * sqrt(Float64(1.0 / fma(4.0, Float64(Float64(fma(-0.5, cos(Float64(ky_m * -2.0)), 0.5) * Float64(l * l)) / Float64(Om * Om)), 1.0)))))); else tmp = sqrt(0.5); end return 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[l, 2e-177], N[Sqrt[N[(0.5 * N[Sqrt[N[(1.0 / N[(N[(N[(l * 4.0), $MachinePrecision] / Om), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(-0.5 * N[Cos[N[(kx$95$m + kx$95$m), $MachinePrecision]], $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + 0.5), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 3.4e+130], N[Sqrt[N[(0.5 + N[(0.5 * N[Sqrt[N[(1.0 / N[(4.0 * N[(N[(N[(-0.5 * N[Cos[N[(ky$95$m * -2.0), $MachinePrecision]], $MachinePrecision] + 0.5), $MachinePrecision] * N[(l * l), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 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])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2 \cdot 10^{-177}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(0.5, \sqrt{\frac{1}{\mathsf{fma}\left(\frac{\ell \cdot 4}{Om}, \frac{\ell}{Om} \cdot \mathsf{fma}\left(-0.5, \cos \left(kx\_m + kx\_m\right), 0.5\right), 1\right)}}, 0.5\right)}\\
\mathbf{elif}\;\ell \leq 3.4 \cdot 10^{+130}:\\
\;\;\;\;\sqrt{0.5 + 0.5 \cdot \sqrt{\frac{1}{\mathsf{fma}\left(4, \frac{\mathsf{fma}\left(-0.5, \cos \left(ky\_m \cdot -2\right), 0.5\right) \cdot \left(\ell \cdot \ell\right)}{Om \cdot Om}, 1\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5}\\
\end{array}
\end{array}
if l < 1.9999999999999999e-177Initial program 98.1%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified79.9%
Applied egg-rr83.6%
if 1.9999999999999999e-177 < l < 3.4000000000000001e130Initial program 100.0%
Applied egg-rr96.0%
Taylor expanded in kx around 0
distribute-lft-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified89.2%
if 3.4000000000000001e130 < l Initial program 88.1%
Taylor expanded in l around inf
Simplified87.1%
Final simplification85.4%
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 (<= l 2e-177)
1.0
(if (<= l 1.28e+129)
(sqrt
(+
0.5
(*
0.5
(sqrt
(/
1.0
(fma
4.0
(/ (* (fma -0.5 (cos (* ky_m -2.0)) 0.5) (* l l)) (* Om Om))
1.0))))))
(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) {
double tmp;
if (l <= 2e-177) {
tmp = 1.0;
} else if (l <= 1.28e+129) {
tmp = sqrt((0.5 + (0.5 * sqrt((1.0 / fma(4.0, ((fma(-0.5, cos((ky_m * -2.0)), 0.5) * (l * l)) / (Om * Om)), 1.0))))));
} else {
tmp = sqrt(0.5);
}
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 (l <= 2e-177) tmp = 1.0; elseif (l <= 1.28e+129) tmp = sqrt(Float64(0.5 + Float64(0.5 * sqrt(Float64(1.0 / fma(4.0, Float64(Float64(fma(-0.5, cos(Float64(ky_m * -2.0)), 0.5) * Float64(l * l)) / Float64(Om * Om)), 1.0)))))); else tmp = sqrt(0.5); end return 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[l, 2e-177], 1.0, If[LessEqual[l, 1.28e+129], N[Sqrt[N[(0.5 + N[(0.5 * N[Sqrt[N[(1.0 / N[(4.0 * N[(N[(N[(-0.5 * N[Cos[N[(ky$95$m * -2.0), $MachinePrecision]], $MachinePrecision] + 0.5), $MachinePrecision] * N[(l * l), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 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])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2 \cdot 10^{-177}:\\
\;\;\;\;1\\
\mathbf{elif}\;\ell \leq 1.28 \cdot 10^{+129}:\\
\;\;\;\;\sqrt{0.5 + 0.5 \cdot \sqrt{\frac{1}{\mathsf{fma}\left(4, \frac{\mathsf{fma}\left(-0.5, \cos \left(ky\_m \cdot -2\right), 0.5\right) \cdot \left(\ell \cdot \ell\right)}{Om \cdot Om}, 1\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5}\\
\end{array}
\end{array}
if l < 1.9999999999999999e-177Initial program 98.1%
Taylor expanded in l around 0
Simplified70.6%
metadata-eval70.6
Applied egg-rr70.6%
if 1.9999999999999999e-177 < l < 1.27999999999999994e129Initial program 100.0%
Applied egg-rr96.0%
Taylor expanded in kx around 0
distribute-lft-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified89.2%
if 1.27999999999999994e129 < l Initial program 88.1%
Taylor expanded in l around inf
Simplified87.1%
Final simplification77.4%
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 (<= l 2e-30)
1.0
(if (<= l 6.5e+134)
(sqrt
(+
0.5
(/ 0.5 (sqrt (fma (* l (* l 4.0)) (/ (* ky_m ky_m) (* Om Om)) 1.0)))))
(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) {
double tmp;
if (l <= 2e-30) {
tmp = 1.0;
} else if (l <= 6.5e+134) {
tmp = sqrt((0.5 + (0.5 / sqrt(fma((l * (l * 4.0)), ((ky_m * ky_m) / (Om * Om)), 1.0)))));
} else {
tmp = sqrt(0.5);
}
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 (l <= 2e-30) tmp = 1.0; elseif (l <= 6.5e+134) tmp = sqrt(Float64(0.5 + Float64(0.5 / sqrt(fma(Float64(l * Float64(l * 4.0)), Float64(Float64(ky_m * ky_m) / Float64(Om * Om)), 1.0))))); else tmp = sqrt(0.5); end return 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[l, 2e-30], 1.0, If[LessEqual[l, 6.5e+134], N[Sqrt[N[(0.5 + N[(0.5 / N[Sqrt[N[(N[(l * N[(l * 4.0), $MachinePrecision]), $MachinePrecision] * N[(N[(ky$95$m * ky$95$m), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 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])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2 \cdot 10^{-30}:\\
\;\;\;\;1\\
\mathbf{elif}\;\ell \leq 6.5 \cdot 10^{+134}:\\
\;\;\;\;\sqrt{0.5 + \frac{0.5}{\sqrt{\mathsf{fma}\left(\ell \cdot \left(\ell \cdot 4\right), \frac{ky\_m \cdot ky\_m}{Om \cdot Om}, 1\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5}\\
\end{array}
\end{array}
if l < 2e-30Initial program 98.4%
Taylor expanded in l around 0
Simplified73.4%
metadata-eval73.4
Applied egg-rr73.4%
if 2e-30 < l < 6.5e134Initial program 97.1%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified84.1%
Taylor expanded in ky around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6479.0
Simplified79.0%
+-lowering-+.f64N/A
Applied egg-rr79.0%
if 6.5e134 < l Initial program 89.7%
Taylor expanded in l around inf
Simplified88.2%
Final simplification76.4%
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 (<= l 2e-30)
1.0
(if (<= l 1.25e+135)
(sqrt
(+ 0.5 (/ 0.5 (fma 2.0 (* (* ky_m ky_m) (/ (* l l) (* Om Om))) 1.0))))
(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) {
double tmp;
if (l <= 2e-30) {
tmp = 1.0;
} else if (l <= 1.25e+135) {
tmp = sqrt((0.5 + (0.5 / fma(2.0, ((ky_m * ky_m) * ((l * l) / (Om * Om))), 1.0))));
} else {
tmp = sqrt(0.5);
}
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 (l <= 2e-30) tmp = 1.0; elseif (l <= 1.25e+135) tmp = sqrt(Float64(0.5 + Float64(0.5 / fma(2.0, Float64(Float64(ky_m * ky_m) * Float64(Float64(l * l) / Float64(Om * Om))), 1.0)))); else tmp = sqrt(0.5); end return 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[l, 2e-30], 1.0, If[LessEqual[l, 1.25e+135], N[Sqrt[N[(0.5 + N[(0.5 / N[(2.0 * N[(N[(ky$95$m * ky$95$m), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 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])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2 \cdot 10^{-30}:\\
\;\;\;\;1\\
\mathbf{elif}\;\ell \leq 1.25 \cdot 10^{+135}:\\
\;\;\;\;\sqrt{0.5 + \frac{0.5}{\mathsf{fma}\left(2, \left(ky\_m \cdot ky\_m\right) \cdot \frac{\ell \cdot \ell}{Om \cdot Om}, 1\right)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5}\\
\end{array}
\end{array}
if l < 2e-30Initial program 98.4%
Taylor expanded in l around 0
Simplified73.4%
metadata-eval73.4
Applied egg-rr73.4%
if 2e-30 < l < 1.25000000000000007e135Initial program 97.1%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified84.1%
Taylor expanded in ky around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6479.0
Simplified79.0%
+-lowering-+.f64N/A
Applied egg-rr79.0%
Taylor expanded in l around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6479.0
Simplified79.0%
if 1.25000000000000007e135 < l Initial program 89.7%
Taylor expanded in l around inf
Simplified88.2%
Final simplification76.4%
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 2.2e-85) (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 <= 2.2e-85) {
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 <= 2.2d-85) 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 <= 2.2e-85) {
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 <= 2.2e-85: 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 <= 2.2e-85) 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 <= 2.2e-85)
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, 2.2e-85], 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 2.2 \cdot 10^{-85}:\\
\;\;\;\;\sqrt{0.5}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\end{array}
if Om < 2.2e-85Initial program 96.2%
Taylor expanded in l around inf
Simplified63.4%
if 2.2e-85 < Om Initial program 98.6%
Taylor expanded in l around 0
Simplified81.4%
metadata-eval81.4
Applied egg-rr81.4%
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 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) {
return 1.0;
}
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 = 1.0d0
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 1.0;
}
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 1.0
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 1.0 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 = 1.0;
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_] := 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])\\
\\
1
\end{array}
Initial program 96.9%
Taylor expanded in l around 0
Simplified62.8%
metadata-eval62.8
Applied egg-rr62.8%
herbie shell --seed 2024197
(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))))))))))