
(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 4 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (l Om kx ky)
:precision binary64
(sqrt
(*
(/ 1.0 2.0)
(+
1.0
(/
1.0
(sqrt
(+
1.0
(*
(pow (/ (* 2.0 l) Om) 2.0)
(+ (pow (sin kx) 2.0) (pow (sin ky) 2.0))))))))))
double code(double l, double Om, double kx, double ky) {
return sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt((1.0 + (pow(((2.0 * l) / Om), 2.0) * (pow(sin(kx), 2.0) + pow(sin(ky), 2.0)))))))));
}
real(8) function code(l, om, kx, ky)
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: kx
real(8), intent (in) :: ky
code = sqrt(((1.0d0 / 2.0d0) * (1.0d0 + (1.0d0 / sqrt((1.0d0 + ((((2.0d0 * l) / om) ** 2.0d0) * ((sin(kx) ** 2.0d0) + (sin(ky) ** 2.0d0)))))))))
end function
public static double code(double l, double Om, double kx, double ky) {
return Math.sqrt(((1.0 / 2.0) * (1.0 + (1.0 / Math.sqrt((1.0 + (Math.pow(((2.0 * l) / Om), 2.0) * (Math.pow(Math.sin(kx), 2.0) + Math.pow(Math.sin(ky), 2.0)))))))));
}
def code(l, Om, kx, ky): return math.sqrt(((1.0 / 2.0) * (1.0 + (1.0 / math.sqrt((1.0 + (math.pow(((2.0 * l) / Om), 2.0) * (math.pow(math.sin(kx), 2.0) + math.pow(math.sin(ky), 2.0)))))))))
function code(l, Om, kx, ky) return sqrt(Float64(Float64(1.0 / 2.0) * Float64(1.0 + Float64(1.0 / sqrt(Float64(1.0 + Float64((Float64(Float64(2.0 * l) / Om) ^ 2.0) * Float64((sin(kx) ^ 2.0) + (sin(ky) ^ 2.0))))))))) end
function tmp = code(l, Om, kx, ky) tmp = sqrt(((1.0 / 2.0) * (1.0 + (1.0 / sqrt((1.0 + ((((2.0 * l) / Om) ^ 2.0) * ((sin(kx) ^ 2.0) + (sin(ky) ^ 2.0))))))))); end
code[l_, Om_, kx_, ky_] := N[Sqrt[N[(N[(1.0 / 2.0), $MachinePrecision] * N[(1.0 + N[(1.0 / N[Sqrt[N[(1.0 + N[(N[Power[N[(N[(2.0 * l), $MachinePrecision] / Om), $MachinePrecision], 2.0], $MachinePrecision] * N[(N[Power[N[Sin[kx], $MachinePrecision], 2.0], $MachinePrecision] + N[Power[N[Sin[ky], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{1}{2} \cdot \left(1 + \frac{1}{\sqrt{1 + {\left(\frac{2 \cdot \ell}{Om}\right)}^{2} \cdot \left({\sin kx}^{2} + {\sin ky}^{2}\right)}}\right)}
\end{array}
kx_m = (fabs.f64 kx) ky_m = (fabs.f64 ky) NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. (FPCore (l Om kx_m ky_m) :precision binary64 (sqrt (+ 0.5 (* 0.5 (/ 1.0 (hypot 1.0 (* (sin ky_m) (* (/ 2.0 Om) l))))))))
kx_m = fabs(kx);
ky_m = fabs(ky);
assert(l < Om && Om < kx_m && kx_m < ky_m);
double code(double l, double Om, double kx_m, double ky_m) {
return sqrt((0.5 + (0.5 * (1.0 / hypot(1.0, (sin(ky_m) * ((2.0 / Om) * l)))))));
}
kx_m = Math.abs(kx);
ky_m = Math.abs(ky);
assert l < Om && Om < kx_m && kx_m < ky_m;
public static double code(double l, double Om, double kx_m, double ky_m) {
return Math.sqrt((0.5 + (0.5 * (1.0 / Math.hypot(1.0, (Math.sin(ky_m) * ((2.0 / Om) * l)))))));
}
kx_m = math.fabs(kx) ky_m = math.fabs(ky) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): return math.sqrt((0.5 + (0.5 * (1.0 / math.hypot(1.0, (math.sin(ky_m) * ((2.0 / Om) * l)))))))
kx_m = abs(kx) ky_m = abs(ky) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) return sqrt(Float64(0.5 + Float64(0.5 * Float64(1.0 / hypot(1.0, Float64(sin(ky_m) * Float64(Float64(2.0 / Om) * l))))))) end
kx_m = abs(kx);
ky_m = abs(ky);
l, Om, kx_m, ky_m = num2cell(sort([l, Om, kx_m, ky_m])){:}
function tmp = code(l, Om, kx_m, ky_m)
tmp = sqrt((0.5 + (0.5 * (1.0 / hypot(1.0, (sin(ky_m) * ((2.0 / Om) * l)))))));
end
kx_m = N[Abs[kx], $MachinePrecision] ky_m = N[Abs[ky], $MachinePrecision] NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. code[l_, Om_, kx$95$m_, ky$95$m_] := N[Sqrt[N[(0.5 + N[(0.5 * N[(1.0 / N[Sqrt[1.0 ^ 2 + N[(N[Sin[ky$95$m], $MachinePrecision] * N[(N[(2.0 / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
kx_m = \left|kx\right|
\\
ky_m = \left|ky\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\sqrt{0.5 + 0.5 \cdot \frac{1}{\mathsf{hypot}\left(1, \sin ky\_m \cdot \left(\frac{2}{Om} \cdot \ell\right)\right)}}
\end{array}
Initial program 99.2%
Simplified99.2%
*-un-lft-identity99.2%
add-sqr-sqrt99.2%
hypot-1-def99.2%
sqrt-prod99.2%
unpow299.2%
sqrt-prod53.9%
add-sqr-sqrt99.3%
clear-num99.3%
un-div-inv99.3%
unpow299.3%
unpow299.3%
hypot-define100.0%
Applied egg-rr100.0%
*-lft-identity100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in kx around 0 94.4%
Final simplification94.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.4e+173) (sqrt (+ 0.5 (* 0.5 (/ 1.0 (hypot 1.0 (* ky_m (* (/ 2.0 Om) l))))))) 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.4e+173) {
tmp = sqrt((0.5 + (0.5 * (1.0 / hypot(1.0, (ky_m * ((2.0 / Om) * l)))))));
} else {
tmp = 1.0;
}
return tmp;
}
kx_m = Math.abs(kx);
ky_m = Math.abs(ky);
assert l < Om && Om < kx_m && kx_m < ky_m;
public static double code(double l, double Om, double kx_m, double ky_m) {
double tmp;
if (Om <= 2.4e+173) {
tmp = Math.sqrt((0.5 + (0.5 * (1.0 / Math.hypot(1.0, (ky_m * ((2.0 / Om) * l)))))));
} 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.4e+173: tmp = math.sqrt((0.5 + (0.5 * (1.0 / math.hypot(1.0, (ky_m * ((2.0 / Om) * l))))))) 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.4e+173) tmp = sqrt(Float64(0.5 + Float64(0.5 * Float64(1.0 / hypot(1.0, Float64(ky_m * Float64(Float64(2.0 / Om) * l))))))); 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.4e+173)
tmp = sqrt((0.5 + (0.5 * (1.0 / hypot(1.0, (ky_m * ((2.0 / Om) * l)))))));
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.4e+173], N[Sqrt[N[(0.5 + N[(0.5 * N[(1.0 / N[Sqrt[1.0 ^ 2 + N[(ky$95$m * N[(N[(2.0 / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 1.0]
\begin{array}{l}
kx_m = \left|kx\right|
\\
ky_m = \left|ky\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\begin{array}{l}
\mathbf{if}\;Om \leq 2.4 \cdot 10^{+173}:\\
\;\;\;\;\sqrt{0.5 + 0.5 \cdot \frac{1}{\mathsf{hypot}\left(1, ky\_m \cdot \left(\frac{2}{Om} \cdot \ell\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\end{array}
if Om < 2.3999999999999999e173Initial program 99.1%
Simplified99.1%
*-un-lft-identity99.1%
add-sqr-sqrt99.1%
hypot-1-def99.1%
sqrt-prod99.1%
unpow299.1%
sqrt-prod51.5%
add-sqr-sqrt99.2%
clear-num99.2%
un-div-inv99.2%
unpow299.2%
unpow299.2%
hypot-define100.0%
Applied egg-rr100.0%
*-lft-identity100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in kx around 0 93.8%
Taylor expanded in ky around 0 86.7%
if 2.3999999999999999e173 < Om Initial program 100.0%
Simplified100.0%
*-un-lft-identity100.0%
add-sqr-sqrt100.0%
hypot-1-def100.0%
sqrt-prod100.0%
unpow2100.0%
sqrt-prod78.3%
add-sqr-sqrt100.0%
clear-num100.0%
un-div-inv100.0%
unpow2100.0%
unpow2100.0%
hypot-define100.0%
Applied egg-rr100.0%
*-lft-identity100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in Om around inf 100.0%
Final simplification87.9%
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 3.2e-49) (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 <= 3.2e-49) {
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 <= 3.2d-49) 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 <= 3.2e-49) {
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 <= 3.2e-49: 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 <= 3.2e-49) 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 <= 3.2e-49)
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, 3.2e-49], N[Sqrt[0.5], $MachinePrecision], 1.0]
\begin{array}{l}
kx_m = \left|kx\right|
\\
ky_m = \left|ky\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\begin{array}{l}
\mathbf{if}\;Om \leq 3.2 \cdot 10^{-49}:\\
\;\;\;\;\sqrt{0.5}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\end{array}
if Om < 3.20000000000000002e-49Initial program 99.0%
Simplified99.0%
Taylor expanded in l around inf 62.4%
associate-*r*62.4%
associate-*r/62.4%
associate-*l/62.4%
associate-/r/62.4%
associate-*l/62.4%
associate-/l*62.4%
unpow262.4%
unpow262.4%
hypot-undefine63.5%
Simplified63.5%
Taylor expanded in Om around 0 69.9%
if 3.20000000000000002e-49 < Om Initial program 100.0%
Simplified100.0%
*-un-lft-identity100.0%
add-sqr-sqrt100.0%
hypot-1-def100.0%
sqrt-prod100.0%
unpow2100.0%
sqrt-prod56.9%
add-sqr-sqrt100.0%
clear-num100.0%
un-div-inv100.0%
unpow2100.0%
unpow2100.0%
hypot-define100.0%
Applied egg-rr100.0%
*-lft-identity100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in Om around inf 83.3%
Final simplification73.3%
kx_m = (fabs.f64 kx) ky_m = (fabs.f64 ky) NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. (FPCore (l Om kx_m ky_m) :precision binary64 (sqrt 0.5))
kx_m = fabs(kx);
ky_m = fabs(ky);
assert(l < Om && Om < kx_m && kx_m < ky_m);
double code(double l, double Om, double kx_m, double ky_m) {
return sqrt(0.5);
}
kx_m = abs(kx)
ky_m = abs(ky)
NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function.
real(8) function code(l, om, kx_m, ky_m)
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: kx_m
real(8), intent (in) :: ky_m
code = sqrt(0.5d0)
end function
kx_m = Math.abs(kx);
ky_m = Math.abs(ky);
assert l < Om && Om < kx_m && kx_m < ky_m;
public static double code(double l, double Om, double kx_m, double ky_m) {
return Math.sqrt(0.5);
}
kx_m = math.fabs(kx) ky_m = math.fabs(ky) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): return math.sqrt(0.5)
kx_m = abs(kx) ky_m = abs(ky) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) return sqrt(0.5) end
kx_m = abs(kx);
ky_m = abs(ky);
l, Om, kx_m, ky_m = num2cell(sort([l, Om, kx_m, ky_m])){:}
function tmp = code(l, Om, kx_m, ky_m)
tmp = sqrt(0.5);
end
kx_m = N[Abs[kx], $MachinePrecision] ky_m = N[Abs[ky], $MachinePrecision] NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. code[l_, Om_, kx$95$m_, ky$95$m_] := N[Sqrt[0.5], $MachinePrecision]
\begin{array}{l}
kx_m = \left|kx\right|
\\
ky_m = \left|ky\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
\sqrt{0.5}
\end{array}
Initial program 99.2%
Simplified99.2%
Taylor expanded in l around inf 52.1%
associate-*r*52.1%
associate-*r/52.1%
associate-*l/52.1%
associate-/r/52.1%
associate-*l/52.1%
associate-/l*52.1%
unpow252.1%
unpow252.1%
hypot-undefine52.9%
Simplified52.9%
Taylor expanded in Om around 0 61.3%
Final simplification61.3%
herbie shell --seed 2024039
(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))))))))))