
(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)))))))));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(l, om, kx, ky)
use fmin_fmax_functions
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 6 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)))))))));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(l, om, kx, ky)
use fmin_fmax_functions
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 (sqrt (fma (sqrt (pow (fma (pow (* (sin ky_m) (/ l Om)) 2.0) 4.0 1.0) -1.0)) 0.5 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(fma(sqrt(pow(fma(pow((sin(ky_m) * (l / Om)), 2.0), 4.0, 1.0), -1.0)), 0.5, 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(fma(sqrt((fma((Float64(sin(ky_m) * Float64(l / Om)) ^ 2.0), 4.0, 1.0) ^ -1.0)), 0.5, 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[N[(N[Sqrt[N[Power[N[(N[Power[N[(N[Sin[ky$95$m], $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * 4.0 + 1.0), $MachinePrecision], -1.0], $MachinePrecision]], $MachinePrecision] * 0.5 + 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])\\
\\
\sqrt{\mathsf{fma}\left(\sqrt{{\left(\mathsf{fma}\left({\left(\sin ky\_m \cdot \frac{\ell}{Om}\right)}^{2}, 4, 1\right)\right)}^{-1}}, 0.5, 0.5\right)}
\end{array}
Initial program 99.6%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-rgt-inN/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites83.4%
Applied rewrites87.3%
Applied rewrites93.4%
Final simplification93.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 (<=
(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))))
0.8)
(sqrt (fma (/ Om (* (sin ky_m) l)) -0.25 0.5))
(sqrt (fma -1.0 (pow (* (/ l Om) (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) {
double tmp;
if (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)))) <= 0.8) {
tmp = sqrt(fma((Om / (sin(ky_m) * l)), -0.25, 0.5));
} else {
tmp = sqrt(fma(-1.0, pow(((l / Om) * sin(ky_m)), 2.0), 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 (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)))) <= 0.8) tmp = sqrt(fma(Float64(Om / Float64(sin(ky_m) * l)), -0.25, 0.5)); else tmp = sqrt(fma(-1.0, (Float64(Float64(l / Om) * sin(ky_m)) ^ 2.0), 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[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], 0.8], N[Sqrt[N[(N[(Om / N[(N[Sin[ky$95$m], $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * -0.25 + 0.5), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(-1.0 * N[Power[N[(N[(l / Om), $MachinePrecision] * N[Sin[ky$95$m], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + 1.0), $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}\;\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)} \leq 0.8:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{Om}{\sin ky\_m \cdot \ell}, -0.25, 0.5\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-1, {\left(\frac{\ell}{Om} \cdot \sin ky\_m\right)}^{2}, 1\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.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.80000000000000004Initial program 100.0%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-rgt-inN/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites74.7%
Taylor expanded in l around -inf
Applied rewrites83.3%
if 0.80000000000000004 < (sqrt.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.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.3%
lift-pow.f64N/A
unpow2N/A
lift-sin.f64N/A
lift-sin.f64N/A
sqr-sin-aN/A
metadata-evalN/A
lift-/.f64N/A
lower--.f64N/A
lift-/.f64N/A
metadata-evalN/A
metadata-evalN/A
lift-/.f64N/A
lower-*.f64N/A
lift-/.f64N/A
metadata-evalN/A
cos-2N/A
cos-sumN/A
lower-cos.f64N/A
lower-+.f6498.7
Applied rewrites98.7%
Taylor expanded in kx around 0
*-commutativeN/A
lower-*.f64N/A
Applied rewrites90.7%
Taylor expanded in l around 0
Applied rewrites89.8%
Applied rewrites99.4%
Final simplification91.8%
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 (<=
(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))))
0.75)
(sqrt (fma (/ Om (* (sin ky_m) l)) -0.25 0.5))
(sqrt 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 (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)))) <= 0.75) {
tmp = sqrt(fma((Om / (sin(ky_m) * l)), -0.25, 0.5));
} else {
tmp = sqrt(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 (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)))) <= 0.75) tmp = sqrt(fma(Float64(Om / Float64(sin(ky_m) * l)), -0.25, 0.5)); else tmp = sqrt(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[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], 0.75], N[Sqrt[N[(N[(Om / N[(N[Sin[ky$95$m], $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * -0.25 + 0.5), $MachinePrecision]], $MachinePrecision], N[Sqrt[1.0], $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}\;\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)} \leq 0.75:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{Om}{\sin ky\_m \cdot \ell}, -0.25, 0.5\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.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.75Initial program 100.0%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-rgt-inN/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites75.1%
Taylor expanded in l around -inf
Applied rewrites83.8%
if 0.75 < (sqrt.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.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.3%
Taylor expanded in l around 0
Applied rewrites98.3%
Final simplification91.5%
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 (<=
(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))))
0.9)
(sqrt (fma Om (/ 0.25 (* ky_m l)) 0.5))
(sqrt 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 (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)))) <= 0.9) {
tmp = sqrt(fma(Om, (0.25 / (ky_m * l)), 0.5));
} else {
tmp = sqrt(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 (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)))) <= 0.9) tmp = sqrt(fma(Om, Float64(0.25 / Float64(ky_m * l)), 0.5)); else tmp = sqrt(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[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], 0.9], N[Sqrt[N[(Om * N[(0.25 / N[(ky$95$m * l), $MachinePrecision]), $MachinePrecision] + 0.5), $MachinePrecision]], $MachinePrecision], N[Sqrt[1.0], $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}\;\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)} \leq 0.9:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(Om, \frac{0.25}{ky\_m \cdot \ell}, 0.5\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.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.900000000000000022Initial program 100.0%
Taylor expanded in kx around 0
+-commutativeN/A
distribute-rgt-inN/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites74.9%
Taylor expanded in l around inf
Applied rewrites83.0%
Taylor expanded in ky around 0
Applied rewrites82.8%
Applied rewrites82.8%
if 0.900000000000000022 < (sqrt.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.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.3%
Taylor expanded in l around 0
Applied rewrites99.5%
Final simplification91.5%
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 (<=
(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))))
0.85)
(sqrt 0.5)
(sqrt 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 (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)))) <= 0.85) {
tmp = sqrt(0.5);
} else {
tmp = sqrt(1.0);
}
return tmp;
}
ky_m = private
kx_m = private
NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(l, om, kx_m, ky_m)
use fmin_fmax_functions
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 (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))))) <= 0.85d0) then
tmp = sqrt(0.5d0)
else
tmp = sqrt(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 (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)))) <= 0.85) {
tmp = Math.sqrt(0.5);
} else {
tmp = Math.sqrt(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 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)))) <= 0.85: tmp = math.sqrt(0.5) else: tmp = math.sqrt(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 (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)))) <= 0.85) tmp = sqrt(0.5); else tmp = sqrt(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 (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)))) <= 0.85)
tmp = sqrt(0.5);
else
tmp = sqrt(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[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], 0.85], N[Sqrt[0.5], $MachinePrecision], N[Sqrt[1.0], $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}\;\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)} \leq 0.85:\\
\;\;\;\;\sqrt{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.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.849999999999999978Initial program 100.0%
Taylor expanded in l around inf
Applied rewrites98.8%
if 0.849999999999999978 < (sqrt.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.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.3%
Taylor expanded in l around 0
Applied rewrites98.9%
Final simplification98.8%
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 = private
kx_m = private
NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(l, om, kx_m, ky_m)
use fmin_fmax_functions
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 99.6%
Taylor expanded in l around inf
Applied rewrites57.2%
herbie shell --seed 2024354
(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))))))))))