
(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 7 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}
ky_m = (fabs.f64 ky)
kx_m = (fabs.f64 kx)
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 (* (/ l Om) 4.0)))
(if (<= (pow (sin ky_m) 2.0) 2e-17)
(sqrt
(*
(/ 1.0 2.0)
(+ 1.0 (/ 1.0 (sqrt (fma t_0 (* (/ l Om) (* ky_m ky_m)) 1.0))))))
(sqrt
(*
(/ 1.0 2.0)
(+
1.0
(/
1.0
(sqrt
(fma
t_0
(*
(/ l Om)
(+
(+ 0.5 (* -0.5 (cos (+ kx_m kx_m))))
(+ 0.5 (* -0.5 (cos (+ ky_m ky_m))))))
1.0)))))))))ky_m = fabs(ky);
kx_m = fabs(kx);
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 = (l / Om) * 4.0;
double tmp;
if (pow(sin(ky_m), 2.0) <= 2e-17) {
tmp = sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt(fma(t_0, ((l / Om) * (ky_m * ky_m)), 1.0))))));
} else {
tmp = sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt(fma(t_0, ((l / Om) * ((0.5 + (-0.5 * cos((kx_m + kx_m)))) + (0.5 + (-0.5 * cos((ky_m + ky_m)))))), 1.0))))));
}
return tmp;
}
ky_m = abs(ky) kx_m = abs(kx) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) t_0 = Float64(Float64(l / Om) * 4.0) tmp = 0.0 if ((sin(ky_m) ^ 2.0) <= 2e-17) tmp = sqrt(Float64(Float64(1.0 / 2.0) * Float64(1.0 + Float64(1.0 / sqrt(fma(t_0, Float64(Float64(l / Om) * Float64(ky_m * ky_m)), 1.0)))))); else tmp = sqrt(Float64(Float64(1.0 / 2.0) * Float64(1.0 + Float64(1.0 / sqrt(fma(t_0, Float64(Float64(l / Om) * Float64(Float64(0.5 + Float64(-0.5 * cos(Float64(kx_m + kx_m)))) + Float64(0.5 + Float64(-0.5 * cos(Float64(ky_m + ky_m)))))), 1.0)))))); end return tmp end
ky_m = N[Abs[ky], $MachinePrecision]
kx_m = N[Abs[kx], $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[(N[(l / Om), $MachinePrecision] * 4.0), $MachinePrecision]}, If[LessEqual[N[Power[N[Sin[ky$95$m], $MachinePrecision], 2.0], $MachinePrecision], 2e-17], N[Sqrt[N[(N[(1.0 / 2.0), $MachinePrecision] * N[(1.0 + N[(1.0 / N[Sqrt[N[(t$95$0 * N[(N[(l / Om), $MachinePrecision] * N[(ky$95$m * ky$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(1.0 / 2.0), $MachinePrecision] * N[(1.0 + N[(1.0 / N[Sqrt[N[(t$95$0 * N[(N[(l / Om), $MachinePrecision] * N[(N[(0.5 + N[(-0.5 * N[Cos[N[(kx$95$m + kx$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(0.5 + N[(-0.5 * N[Cos[N[(ky$95$m + ky$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
ky_m = \left|ky\right|
\\
kx_m = \left|kx\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\begin{array}{l}
t_0 := \frac{\ell}{Om} \cdot 4\\
\mathbf{if}\;{\sin ky\_m}^{2} \leq 2 \cdot 10^{-17}:\\
\;\;\;\;\sqrt{\frac{1}{2} \cdot \left(1 + \frac{1}{\sqrt{\mathsf{fma}\left(t\_0, \frac{\ell}{Om} \cdot \left(ky\_m \cdot ky\_m\right), 1\right)}}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{2} \cdot \left(1 + \frac{1}{\sqrt{\mathsf{fma}\left(t\_0, \frac{\ell}{Om} \cdot \left(\left(0.5 + -0.5 \cdot \cos \left(kx\_m + kx\_m\right)\right) + \left(0.5 + -0.5 \cdot \cos \left(ky\_m + ky\_m\right)\right)\right), 1\right)}}\right)}\\
\end{array}
\end{array}
if (pow.f64 (sin.f64 ky) #s(literal 2 binary64)) < 2.00000000000000014e-17Initial program 99.2%
Applied rewrites85.0%
Taylor expanded in kx around 0
+-commutativeN/A
lower-fma.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
cos-negN/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f6452.8
Applied rewrites52.8%
Taylor expanded in ky around 0
Applied rewrites79.5%
if 2.00000000000000014e-17 < (pow.f64 (sin.f64 ky) #s(literal 2 binary64)) Initial program 100.0%
Applied rewrites100.0%
ky_m = (fabs.f64 ky)
kx_m = (fabs.f64 kx)
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 (<=
(/
1.0
(sqrt
(+
1.0
(*
(pow (/ (* 2.0 l) Om) 2.0)
(+ (pow (sin kx_m) 2.0) (pow (sin ky_m) 2.0))))))
0.9999933419065639)
(sqrt
(+
0.5
(/ 0.5 (sqrt (fma (/ (* l (* l (/ 4.0 Om))) Om) (* ky_m ky_m) 1.0)))))
1.0))ky_m = fabs(ky);
kx_m = fabs(kx);
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 ((1.0 / sqrt((1.0 + (pow(((2.0 * l) / Om), 2.0) * (pow(sin(kx_m), 2.0) + pow(sin(ky_m), 2.0)))))) <= 0.9999933419065639) {
tmp = sqrt((0.5 + (0.5 / sqrt(fma(((l * (l * (4.0 / Om))) / Om), (ky_m * ky_m), 1.0)))));
} else {
tmp = 1.0;
}
return tmp;
}
ky_m = abs(ky) kx_m = abs(kx) 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 (Float64(1.0 / sqrt(Float64(1.0 + Float64((Float64(Float64(2.0 * l) / Om) ^ 2.0) * Float64((sin(kx_m) ^ 2.0) + (sin(ky_m) ^ 2.0)))))) <= 0.9999933419065639) tmp = sqrt(Float64(0.5 + Float64(0.5 / sqrt(fma(Float64(Float64(l * Float64(l * Float64(4.0 / Om))) / Om), Float64(ky_m * ky_m), 1.0))))); else tmp = 1.0; end return tmp end
ky_m = N[Abs[ky], $MachinePrecision] kx_m = N[Abs[kx], $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[(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$95$m], $MachinePrecision], 2.0], $MachinePrecision] + N[Power[N[Sin[ky$95$m], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.9999933419065639], N[Sqrt[N[(0.5 + N[(0.5 / N[Sqrt[N[(N[(N[(l * N[(l * N[(4.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[(ky$95$m * ky$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 1.0]
\begin{array}{l}
ky_m = \left|ky\right|
\\
kx_m = \left|kx\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{1}{\sqrt{1 + {\left(\frac{2 \cdot \ell}{Om}\right)}^{2} \cdot \left({\sin kx\_m}^{2} + {\sin ky\_m}^{2}\right)}} \leq 0.9999933419065639:\\
\;\;\;\;\sqrt{0.5 + \frac{0.5}{\sqrt{\mathsf{fma}\left(\frac{\ell \cdot \left(\ell \cdot \frac{4}{Om}\right)}{Om}, ky\_m \cdot ky\_m, 1\right)}}}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\end{array}
if (/.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))))) < 0.99999334190656386Initial program 100.0%
Applied rewrites79.0%
Taylor expanded in kx around 0
+-commutativeN/A
lower-fma.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
cos-negN/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f6448.5
Applied rewrites48.5%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
times-fracN/A
associate-*r/N/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f6453.4
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6453.4
Applied rewrites53.4%
Taylor expanded in ky around 0
Applied rewrites79.7%
if 0.99999334190656386 < (/.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))))) Initial program 99.2%
Applied rewrites79.3%
Taylor expanded in l around 0
Applied rewrites100.0%
Final simplification89.3%
ky_m = (fabs.f64 ky)
kx_m = (fabs.f64 kx)
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
(*
(/ 1.0 2.0)
(+
1.0
(/
1.0
(sqrt
(+
1.0
(*
(pow (/ (* 2.0 l) Om) 2.0)
(+ (pow (sin kx_m) 2.0) (pow (sin ky_m) 2.0))))))))))ky_m = fabs(ky);
kx_m = fabs(kx);
assert(l < Om && Om < kx_m && kx_m < ky_m);
double code(double l, double Om, double kx_m, double ky_m) {
return sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt((1.0 + (pow(((2.0 * l) / Om), 2.0) * (pow(sin(kx_m), 2.0) + pow(sin(ky_m), 2.0)))))))));
}
ky_m = abs(ky)
kx_m = abs(kx)
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(((1.0d0 / 2.0d0) * (1.0d0 + (1.0d0 / sqrt((1.0d0 + ((((2.0d0 * l) / om) ** 2.0d0) * ((sin(kx_m) ** 2.0d0) + (sin(ky_m) ** 2.0d0)))))))))
end function
ky_m = Math.abs(ky);
kx_m = Math.abs(kx);
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(((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_m), 2.0) + Math.pow(Math.sin(ky_m), 2.0)))))))));
}
ky_m = math.fabs(ky) kx_m = math.fabs(kx) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): 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_m), 2.0) + math.pow(math.sin(ky_m), 2.0)))))))))
ky_m = abs(ky) kx_m = abs(kx) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) 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_m) ^ 2.0) + (sin(ky_m) ^ 2.0))))))))) end
ky_m = abs(ky);
kx_m = abs(kx);
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(((1.0 / 2.0) * (1.0 + (1.0 / sqrt((1.0 + ((((2.0 * l) / Om) ^ 2.0) * ((sin(kx_m) ^ 2.0) + (sin(ky_m) ^ 2.0)))))))));
end
ky_m = N[Abs[ky], $MachinePrecision] kx_m = N[Abs[kx], $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[(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$95$m], $MachinePrecision], 2.0], $MachinePrecision] + N[Power[N[Sin[ky$95$m], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
ky_m = \left|ky\right|
\\
kx_m = \left|kx\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\sqrt{\frac{1}{2} \cdot \left(1 + \frac{1}{\sqrt{1 + {\left(\frac{2 \cdot \ell}{Om}\right)}^{2} \cdot \left({\sin kx\_m}^{2} + {\sin ky\_m}^{2}\right)}}\right)}
\end{array}
Initial program 99.6%
ky_m = (fabs.f64 ky)
kx_m = (fabs.f64 kx)
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 (<=
(/
1.0
(sqrt
(+
1.0
(*
(pow (/ (* 2.0 l) Om) 2.0)
(+ (pow (sin kx_m) 2.0) (pow (sin ky_m) 2.0))))))
0.46)
(sqrt 0.5)
1.0))ky_m = fabs(ky);
kx_m = fabs(kx);
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 ((1.0 / sqrt((1.0 + (pow(((2.0 * l) / Om), 2.0) * (pow(sin(kx_m), 2.0) + pow(sin(ky_m), 2.0)))))) <= 0.46) {
tmp = sqrt(0.5);
} else {
tmp = 1.0;
}
return tmp;
}
ky_m = abs(ky)
kx_m = abs(kx)
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 ((1.0d0 / sqrt((1.0d0 + ((((2.0d0 * l) / om) ** 2.0d0) * ((sin(kx_m) ** 2.0d0) + (sin(ky_m) ** 2.0d0)))))) <= 0.46d0) then
tmp = sqrt(0.5d0)
else
tmp = 1.0d0
end if
code = tmp
end function
ky_m = Math.abs(ky);
kx_m = Math.abs(kx);
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 ((1.0 / Math.sqrt((1.0 + (Math.pow(((2.0 * l) / Om), 2.0) * (Math.pow(Math.sin(kx_m), 2.0) + Math.pow(Math.sin(ky_m), 2.0)))))) <= 0.46) {
tmp = Math.sqrt(0.5);
} else {
tmp = 1.0;
}
return tmp;
}
ky_m = math.fabs(ky) kx_m = math.fabs(kx) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): tmp = 0 if (1.0 / math.sqrt((1.0 + (math.pow(((2.0 * l) / Om), 2.0) * (math.pow(math.sin(kx_m), 2.0) + math.pow(math.sin(ky_m), 2.0)))))) <= 0.46: tmp = math.sqrt(0.5) else: tmp = 1.0 return tmp
ky_m = abs(ky) kx_m = abs(kx) 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 (Float64(1.0 / sqrt(Float64(1.0 + Float64((Float64(Float64(2.0 * l) / Om) ^ 2.0) * Float64((sin(kx_m) ^ 2.0) + (sin(ky_m) ^ 2.0)))))) <= 0.46) tmp = sqrt(0.5); else tmp = 1.0; end return tmp end
ky_m = abs(ky);
kx_m = abs(kx);
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 ((1.0 / sqrt((1.0 + ((((2.0 * l) / Om) ^ 2.0) * ((sin(kx_m) ^ 2.0) + (sin(ky_m) ^ 2.0)))))) <= 0.46)
tmp = sqrt(0.5);
else
tmp = 1.0;
end
tmp_2 = tmp;
end
ky_m = N[Abs[ky], $MachinePrecision] kx_m = N[Abs[kx], $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[(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$95$m], $MachinePrecision], 2.0], $MachinePrecision] + N[Power[N[Sin[ky$95$m], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.46], N[Sqrt[0.5], $MachinePrecision], 1.0]
\begin{array}{l}
ky_m = \left|ky\right|
\\
kx_m = \left|kx\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{1}{\sqrt{1 + {\left(\frac{2 \cdot \ell}{Om}\right)}^{2} \cdot \left({\sin kx\_m}^{2} + {\sin ky\_m}^{2}\right)}} \leq 0.46:\\
\;\;\;\;\sqrt{0.5}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\end{array}
if (/.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))))) < 0.46000000000000002Initial program 100.0%
Taylor expanded in l around inf
Applied rewrites96.9%
if 0.46000000000000002 < (/.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))))) Initial program 99.2%
Applied rewrites78.8%
Taylor expanded in l around 0
Applied rewrites99.1%
ky_m = (fabs.f64 ky)
kx_m = (fabs.f64 kx)
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-17)
(sqrt
(*
(/ 1.0 2.0)
(+
1.0
(/ 1.0 (sqrt (fma (* (/ l Om) 4.0) (* (/ l Om) (* ky_m ky_m)) 1.0))))))
(sqrt
(+
0.5
(/
0.5
(sqrt
(fma
(/ (* l (* l (/ 4.0 Om))) Om)
(fma -0.5 (cos (* ky_m -2.0)) 0.5)
1.0)))))))ky_m = fabs(ky);
kx_m = fabs(kx);
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-17) {
tmp = sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt(fma(((l / Om) * 4.0), ((l / Om) * (ky_m * ky_m)), 1.0))))));
} else {
tmp = sqrt((0.5 + (0.5 / sqrt(fma(((l * (l * (4.0 / Om))) / Om), fma(-0.5, cos((ky_m * -2.0)), 0.5), 1.0)))));
}
return tmp;
}
ky_m = abs(ky) kx_m = abs(kx) 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-17) tmp = sqrt(Float64(Float64(1.0 / 2.0) * Float64(1.0 + Float64(1.0 / sqrt(fma(Float64(Float64(l / Om) * 4.0), Float64(Float64(l / Om) * Float64(ky_m * ky_m)), 1.0)))))); else tmp = sqrt(Float64(0.5 + Float64(0.5 / sqrt(fma(Float64(Float64(l * Float64(l * Float64(4.0 / Om))) / Om), fma(-0.5, cos(Float64(ky_m * -2.0)), 0.5), 1.0))))); end return tmp end
ky_m = N[Abs[ky], $MachinePrecision] kx_m = N[Abs[kx], $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-17], N[Sqrt[N[(N[(1.0 / 2.0), $MachinePrecision] * N[(1.0 + N[(1.0 / N[Sqrt[N[(N[(N[(l / Om), $MachinePrecision] * 4.0), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(ky$95$m * ky$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(0.5 + N[(0.5 / N[Sqrt[N[(N[(N[(l * N[(l * N[(4.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[(-0.5 * N[Cos[N[(ky$95$m * -2.0), $MachinePrecision]], $MachinePrecision] + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
ky_m = \left|ky\right|
\\
kx_m = \left|kx\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^{-17}:\\
\;\;\;\;\sqrt{\frac{1}{2} \cdot \left(1 + \frac{1}{\sqrt{\mathsf{fma}\left(\frac{\ell}{Om} \cdot 4, \frac{\ell}{Om} \cdot \left(ky\_m \cdot ky\_m\right), 1\right)}}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 + \frac{0.5}{\sqrt{\mathsf{fma}\left(\frac{\ell \cdot \left(\ell \cdot \frac{4}{Om}\right)}{Om}, \mathsf{fma}\left(-0.5, \cos \left(ky\_m \cdot -2\right), 0.5\right), 1\right)}}}\\
\end{array}
\end{array}
if (pow.f64 (sin.f64 ky) #s(literal 2 binary64)) < 2.00000000000000014e-17Initial program 99.2%
Applied rewrites85.0%
Taylor expanded in kx around 0
+-commutativeN/A
lower-fma.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
cos-negN/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f6452.8
Applied rewrites52.8%
Taylor expanded in ky around 0
Applied rewrites79.5%
if 2.00000000000000014e-17 < (pow.f64 (sin.f64 ky) #s(literal 2 binary64)) Initial program 100.0%
Applied rewrites87.3%
Taylor expanded in kx around 0
+-commutativeN/A
lower-fma.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
cos-negN/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f6487.1
Applied rewrites87.1%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
times-fracN/A
associate-*r/N/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f6499.8
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6499.8
Applied rewrites99.8%
Final simplification90.1%
ky_m = (fabs.f64 ky)
kx_m = (fabs.f64 kx)
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 (<= (/ (* 2.0 l) Om) 0.03)
1.0
(sqrt
(*
(/ 1.0 2.0)
(+
1.0
(/ 1.0 (sqrt (fma (* (/ l Om) 4.0) (* (/ l Om) (* ky_m ky_m)) 1.0))))))))ky_m = fabs(ky);
kx_m = fabs(kx);
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 (((2.0 * l) / Om) <= 0.03) {
tmp = 1.0;
} else {
tmp = sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt(fma(((l / Om) * 4.0), ((l / Om) * (ky_m * ky_m)), 1.0))))));
}
return tmp;
}
ky_m = abs(ky) kx_m = abs(kx) 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 (Float64(Float64(2.0 * l) / Om) <= 0.03) tmp = 1.0; else tmp = sqrt(Float64(Float64(1.0 / 2.0) * Float64(1.0 + Float64(1.0 / sqrt(fma(Float64(Float64(l / Om) * 4.0), Float64(Float64(l / Om) * Float64(ky_m * ky_m)), 1.0)))))); end return tmp end
ky_m = N[Abs[ky], $MachinePrecision] kx_m = N[Abs[kx], $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[(N[(2.0 * l), $MachinePrecision] / Om), $MachinePrecision], 0.03], 1.0, N[Sqrt[N[(N[(1.0 / 2.0), $MachinePrecision] * N[(1.0 + N[(1.0 / N[Sqrt[N[(N[(N[(l / Om), $MachinePrecision] * 4.0), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(ky$95$m * ky$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
ky_m = \left|ky\right|
\\
kx_m = \left|kx\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{2 \cdot \ell}{Om} \leq 0.03:\\
\;\;\;\;1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{2} \cdot \left(1 + \frac{1}{\sqrt{\mathsf{fma}\left(\frac{\ell}{Om} \cdot 4, \frac{\ell}{Om} \cdot \left(ky\_m \cdot ky\_m\right), 1\right)}}\right)}\\
\end{array}
\end{array}
if (/.f64 (*.f64 #s(literal 2 binary64) l) Om) < 0.029999999999999999Initial program 100.0%
Applied rewrites79.7%
Taylor expanded in l around 0
Applied rewrites69.8%
if 0.029999999999999999 < (/.f64 (*.f64 #s(literal 2 binary64) l) Om) Initial program 98.6%
Applied rewrites88.7%
Taylor expanded in kx around 0
+-commutativeN/A
lower-fma.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
cos-negN/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f6458.6
Applied rewrites58.6%
Taylor expanded in ky around 0
Applied rewrites78.2%
ky_m = (fabs.f64 ky) kx_m = (fabs.f64 kx) 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)
ky_m = fabs(ky);
kx_m = fabs(kx);
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;
}
ky_m = abs(ky)
kx_m = abs(kx)
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
ky_m = Math.abs(ky);
kx_m = Math.abs(kx);
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;
}
ky_m = math.fabs(ky) kx_m = math.fabs(kx) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): return 1.0
ky_m = abs(ky) kx_m = abs(kx) 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
ky_m = abs(ky);
kx_m = abs(kx);
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
ky_m = N[Abs[ky], $MachinePrecision] kx_m = N[Abs[kx], $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}
ky_m = \left|ky\right|
\\
kx_m = \left|kx\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
1
\end{array}
Initial program 99.6%
Applied rewrites79.1%
Taylor expanded in l around 0
Applied rewrites58.0%
herbie shell --seed 2024232
(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))))))))))