
(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
(if (<=
(*
(pow (/ (* 2.0 l) Om) 2.0)
(+ (pow (sin kx_m) 2.0) (pow (sin ky_m) 2.0)))
1e+28)
(sqrt
(*
(pow 2.0 -1.0)
(+
1.0
(pow
(sqrt
(fma
(/ (* l 2.0) Om)
(* (/ (* (- 1.0 (cos (* ky_m 2.0))) l) (* 2.0 Om)) 2.0)
1.0))
-1.0))))
(sqrt 0.5)))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(((2.0 * l) / Om), 2.0) * (pow(sin(kx_m), 2.0) + pow(sin(ky_m), 2.0))) <= 1e+28) {
tmp = sqrt((pow(2.0, -1.0) * (1.0 + pow(sqrt(fma(((l * 2.0) / Om), ((((1.0 - cos((ky_m * 2.0))) * l) / (2.0 * Om)) * 2.0), 1.0)), -1.0))));
} else {
tmp = sqrt(0.5);
}
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(Float64(2.0 * l) / Om) ^ 2.0) * Float64((sin(kx_m) ^ 2.0) + (sin(ky_m) ^ 2.0))) <= 1e+28) tmp = sqrt(Float64((2.0 ^ -1.0) * Float64(1.0 + (sqrt(fma(Float64(Float64(l * 2.0) / Om), Float64(Float64(Float64(Float64(1.0 - cos(Float64(ky_m * 2.0))) * l) / Float64(2.0 * Om)) * 2.0), 1.0)) ^ -1.0)))); else tmp = sqrt(0.5); 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[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], 1e+28], N[Sqrt[N[(N[Power[2.0, -1.0], $MachinePrecision] * N[(1.0 + N[Power[N[Sqrt[N[(N[(N[(l * 2.0), $MachinePrecision] / Om), $MachinePrecision] * N[(N[(N[(N[(1.0 - N[Cos[N[(ky$95$m * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision] / N[(2.0 * Om), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[0.5], $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}\;{\left(\frac{2 \cdot \ell}{Om}\right)}^{2} \cdot \left({\sin kx\_m}^{2} + {\sin ky\_m}^{2}\right) \leq 10^{+28}:\\
\;\;\;\;\sqrt{{2}^{-1} \cdot \left(1 + {\left(\sqrt{\mathsf{fma}\left(\frac{\ell \cdot 2}{Om}, \frac{\left(1 - \cos \left(ky\_m \cdot 2\right)\right) \cdot \ell}{2 \cdot Om} \cdot 2, 1\right)}\right)}^{-1}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5}\\
\end{array}
\end{array}
if (*.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)))) < 9.99999999999999958e27Initial program 100.0%
Taylor expanded in ky around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6462.1
Applied rewrites62.1%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites64.6%
Taylor expanded in kx around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-pow.f64N/A
lower-sin.f6497.5
Applied rewrites97.5%
Applied rewrites97.3%
if 9.99999999999999958e27 < (*.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 96.0%
Taylor expanded in l around inf
Applied rewrites100.0%
Final simplification98.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
(*
(pow 2.0 -1.0)
(+
1.0
(pow
(pow
(pow
(fma
(fma (sin ky_m) (sin ky_m) (pow (sin kx_m) 2.0))
(pow (/ (* -2.0 l) Om) 2.0)
1.0)
0.25)
2.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) {
return sqrt((pow(2.0, -1.0) * (1.0 + pow(pow(pow(fma(fma(sin(ky_m), sin(ky_m), pow(sin(kx_m), 2.0)), pow(((-2.0 * l) / Om), 2.0), 1.0), 0.25), 2.0), -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 sqrt(Float64((2.0 ^ -1.0) * Float64(1.0 + (((fma(fma(sin(ky_m), sin(ky_m), (sin(kx_m) ^ 2.0)), (Float64(Float64(-2.0 * l) / Om) ^ 2.0), 1.0) ^ 0.25) ^ 2.0) ^ -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_] := N[Sqrt[N[(N[Power[2.0, -1.0], $MachinePrecision] * N[(1.0 + N[Power[N[Power[N[Power[N[(N[(N[Sin[ky$95$m], $MachinePrecision] * N[Sin[ky$95$m], $MachinePrecision] + N[Power[N[Sin[kx$95$m], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[Power[N[(N[(-2.0 * l), $MachinePrecision] / Om), $MachinePrecision], 2.0], $MachinePrecision] + 1.0), $MachinePrecision], 0.25], $MachinePrecision], 2.0], $MachinePrecision], -1.0], $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{{2}^{-1} \cdot \left(1 + {\left({\left({\left(\mathsf{fma}\left(\mathsf{fma}\left(\sin ky\_m, \sin ky\_m, {\sin kx\_m}^{2}\right), {\left(\frac{-2 \cdot \ell}{Om}\right)}^{2}, 1\right)\right)}^{0.25}\right)}^{2}\right)}^{-1}\right)}
\end{array}
Initial program 98.4%
lift-sqrt.f64N/A
pow1/2N/A
metadata-evalN/A
lift-/.f64N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites98.4%
Final simplification98.4%
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
(*
(pow 2.0 -1.0)
(+
1.0
(pow
(sqrt
(+
1.0
(*
(pow (/ (* 2.0 l) Om) 2.0)
(+ (pow (sin kx_m) 2.0) (pow (sin ky_m) 2.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) {
return sqrt((pow(2.0, -1.0) * (1.0 + pow(sqrt((1.0 + (pow(((2.0 * l) / Om), 2.0) * (pow(sin(kx_m), 2.0) + pow(sin(ky_m), 2.0))))), -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 = sqrt(((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))))) ** (-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 Math.sqrt((Math.pow(2.0, -1.0) * (1.0 + Math.pow(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))))), -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 math.sqrt((math.pow(2.0, -1.0) * (1.0 + math.pow(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))))), -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 sqrt(Float64((2.0 ^ -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))))) ^ -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 = sqrt(((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))))) ^ -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_] := N[Sqrt[N[(N[Power[2.0, -1.0], $MachinePrecision] * N[(1.0 + N[Power[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], -1.0], $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{{2}^{-1} \cdot \left(1 + {\left(\sqrt{1 + {\left(\frac{2 \cdot \ell}{Om}\right)}^{2} \cdot \left({\sin kx\_m}^{2} + {\sin ky\_m}^{2}\right)}\right)}^{-1}\right)}
\end{array}
Initial program 98.4%
Final simplification98.4%
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 (/ (* 2.0 l) Om) 2.0)
(+ (pow (sin kx_m) 2.0) (pow (sin ky_m) 2.0)))
5e-9)
(sqrt 1.0)
(sqrt (+ (/ 0.5 (* (sin ky_m) (/ (* l 2.0) Om))) 0.5))))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(((2.0 * l) / Om), 2.0) * (pow(sin(kx_m), 2.0) + pow(sin(ky_m), 2.0))) <= 5e-9) {
tmp = sqrt(1.0);
} else {
tmp = sqrt(((0.5 / (sin(ky_m) * ((l * 2.0) / Om))) + 0.5));
}
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 (((((2.0d0 * l) / om) ** 2.0d0) * ((sin(kx_m) ** 2.0d0) + (sin(ky_m) ** 2.0d0))) <= 5d-9) then
tmp = sqrt(1.0d0)
else
tmp = sqrt(((0.5d0 / (sin(ky_m) * ((l * 2.0d0) / om))) + 0.5d0))
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 ((Math.pow(((2.0 * l) / Om), 2.0) * (Math.pow(Math.sin(kx_m), 2.0) + Math.pow(Math.sin(ky_m), 2.0))) <= 5e-9) {
tmp = Math.sqrt(1.0);
} else {
tmp = Math.sqrt(((0.5 / (Math.sin(ky_m) * ((l * 2.0) / Om))) + 0.5));
}
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 (math.pow(((2.0 * l) / Om), 2.0) * (math.pow(math.sin(kx_m), 2.0) + math.pow(math.sin(ky_m), 2.0))) <= 5e-9: tmp = math.sqrt(1.0) else: tmp = math.sqrt(((0.5 / (math.sin(ky_m) * ((l * 2.0) / Om))) + 0.5)) 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(Float64(2.0 * l) / Om) ^ 2.0) * Float64((sin(kx_m) ^ 2.0) + (sin(ky_m) ^ 2.0))) <= 5e-9) tmp = sqrt(1.0); else tmp = sqrt(Float64(Float64(0.5 / Float64(sin(ky_m) * Float64(Float64(l * 2.0) / Om))) + 0.5)); 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 (((((2.0 * l) / Om) ^ 2.0) * ((sin(kx_m) ^ 2.0) + (sin(ky_m) ^ 2.0))) <= 5e-9)
tmp = sqrt(1.0);
else
tmp = sqrt(((0.5 / (sin(ky_m) * ((l * 2.0) / Om))) + 0.5));
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[(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], 5e-9], N[Sqrt[1.0], $MachinePrecision], N[Sqrt[N[(N[(0.5 / N[(N[Sin[ky$95$m], $MachinePrecision] * N[(N[(l * 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 0.5), $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}\;{\left(\frac{2 \cdot \ell}{Om}\right)}^{2} \cdot \left({\sin kx\_m}^{2} + {\sin ky\_m}^{2}\right) \leq 5 \cdot 10^{-9}:\\
\;\;\;\;\sqrt{1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{0.5}{\sin ky\_m \cdot \frac{\ell \cdot 2}{Om}} + 0.5}\\
\end{array}
\end{array}
if (*.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)))) < 5.0000000000000001e-9Initial program 100.0%
Taylor expanded in l around 0
Applied rewrites99.8%
if 5.0000000000000001e-9 < (*.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 96.2%
lift-sqrt.f64N/A
pow1/2N/A
metadata-evalN/A
lift-/.f64N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites96.2%
Taylor expanded in l around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-sin.f64N/A
lower-sin.f6497.8
Applied rewrites97.8%
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
distribute-rgt1-inN/A
+-commutativeN/A
Applied rewrites97.8%
Taylor expanded in kx around 0
Applied rewrites82.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 (<=
(*
(pow (/ (* 2.0 l) Om) 2.0)
(+ (pow (sin kx_m) 2.0) (pow (sin ky_m) 2.0)))
5e-9)
(sqrt 1.0)
(sqrt 0.5)))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(((2.0 * l) / Om), 2.0) * (pow(sin(kx_m), 2.0) + pow(sin(ky_m), 2.0))) <= 5e-9) {
tmp = sqrt(1.0);
} else {
tmp = sqrt(0.5);
}
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 (((((2.0d0 * l) / om) ** 2.0d0) * ((sin(kx_m) ** 2.0d0) + (sin(ky_m) ** 2.0d0))) <= 5d-9) then
tmp = sqrt(1.0d0)
else
tmp = sqrt(0.5d0)
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 ((Math.pow(((2.0 * l) / Om), 2.0) * (Math.pow(Math.sin(kx_m), 2.0) + Math.pow(Math.sin(ky_m), 2.0))) <= 5e-9) {
tmp = Math.sqrt(1.0);
} else {
tmp = Math.sqrt(0.5);
}
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 (math.pow(((2.0 * l) / Om), 2.0) * (math.pow(math.sin(kx_m), 2.0) + math.pow(math.sin(ky_m), 2.0))) <= 5e-9: tmp = math.sqrt(1.0) else: tmp = math.sqrt(0.5) 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(Float64(2.0 * l) / Om) ^ 2.0) * Float64((sin(kx_m) ^ 2.0) + (sin(ky_m) ^ 2.0))) <= 5e-9) tmp = sqrt(1.0); else tmp = sqrt(0.5); 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 (((((2.0 * l) / Om) ^ 2.0) * ((sin(kx_m) ^ 2.0) + (sin(ky_m) ^ 2.0))) <= 5e-9)
tmp = sqrt(1.0);
else
tmp = sqrt(0.5);
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[(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], 5e-9], N[Sqrt[1.0], $MachinePrecision], N[Sqrt[0.5], $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}\;{\left(\frac{2 \cdot \ell}{Om}\right)}^{2} \cdot \left({\sin kx\_m}^{2} + {\sin ky\_m}^{2}\right) \leq 5 \cdot 10^{-9}:\\
\;\;\;\;\sqrt{1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5}\\
\end{array}
\end{array}
if (*.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)))) < 5.0000000000000001e-9Initial program 100.0%
Taylor expanded in l around 0
Applied rewrites99.8%
if 5.0000000000000001e-9 < (*.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 96.2%
Taylor expanded in l around inf
Applied rewrites97.4%
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
(*
(pow 2.0 -1.0)
(+
1.0
(pow
(sqrt
(fma (/ (* l 2.0) Om) (* (/ (* (pow (sin ky_m) 2.0) l) Om) 2.0) 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) {
return sqrt((pow(2.0, -1.0) * (1.0 + pow(sqrt(fma(((l * 2.0) / Om), (((pow(sin(ky_m), 2.0) * l) / Om) * 2.0), 1.0)), -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 sqrt(Float64((2.0 ^ -1.0) * Float64(1.0 + (sqrt(fma(Float64(Float64(l * 2.0) / Om), Float64(Float64(Float64((sin(ky_m) ^ 2.0) * l) / Om) * 2.0), 1.0)) ^ -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_] := N[Sqrt[N[(N[Power[2.0, -1.0], $MachinePrecision] * N[(1.0 + N[Power[N[Sqrt[N[(N[(N[(l * 2.0), $MachinePrecision] / Om), $MachinePrecision] * N[(N[(N[(N[Power[N[Sin[ky$95$m], $MachinePrecision], 2.0], $MachinePrecision] * l), $MachinePrecision] / Om), $MachinePrecision] * 2.0), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision], -1.0], $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{{2}^{-1} \cdot \left(1 + {\left(\sqrt{\mathsf{fma}\left(\frac{\ell \cdot 2}{Om}, \frac{{\sin ky\_m}^{2} \cdot \ell}{Om} \cdot 2, 1\right)}\right)}^{-1}\right)}
\end{array}
Initial program 98.4%
Taylor expanded in ky around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6475.2
Applied rewrites75.2%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites76.9%
Taylor expanded in kx around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-pow.f64N/A
lower-sin.f6490.0
Applied rewrites90.0%
Final simplification90.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 (sqrt 0.5))
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(0.5);
}
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(0.5d0)
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(0.5);
}
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(0.5)
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(0.5) 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(0.5);
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[0.5], $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{0.5}
\end{array}
Initial program 98.4%
Taylor expanded in l around inf
Applied rewrites51.7%
herbie shell --seed 2024305
(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))))))))))