
(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 5 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 (pow (+ 1.0 (pow (* (sin ky_m) (* (/ 2.0 Om) l)) 2.0)) -0.5)))))
kx_m = fabs(kx);
ky_m = fabs(ky);
assert(l < Om && Om < kx_m && kx_m < ky_m);
double code(double l, double Om, double kx_m, double ky_m) {
return sqrt((0.5 + (0.5 * pow((1.0 + pow((sin(ky_m) * ((2.0 / Om) * l)), 2.0)), -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 + (0.5d0 * ((1.0d0 + ((sin(ky_m) * ((2.0d0 / om) * l)) ** 2.0d0)) ** (-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 + (0.5 * Math.pow((1.0 + Math.pow((Math.sin(ky_m) * ((2.0 / Om) * l)), 2.0)), -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 + (0.5 * math.pow((1.0 + math.pow((math.sin(ky_m) * ((2.0 / Om) * l)), 2.0)), -0.5))))
kx_m = abs(kx) ky_m = abs(ky) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) return sqrt(Float64(0.5 + Float64(0.5 * (Float64(1.0 + (Float64(sin(ky_m) * Float64(Float64(2.0 / Om) * l)) ^ 2.0)) ^ -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 + (0.5 * ((1.0 + ((sin(ky_m) * ((2.0 / Om) * l)) ^ 2.0)) ^ -0.5))));
end
kx_m = N[Abs[kx], $MachinePrecision] ky_m = N[Abs[ky], $MachinePrecision] NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. code[l_, Om_, kx$95$m_, ky$95$m_] := N[Sqrt[N[(0.5 + N[(0.5 * N[Power[N[(1.0 + N[Power[N[(N[Sin[ky$95$m], $MachinePrecision] * N[(N[(2.0 / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -0.5], $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 {\left(1 + {\left(\sin ky\_m \cdot \left(\frac{2}{Om} \cdot \ell\right)\right)}^{2}\right)}^{-0.5}}
\end{array}
Initial program 98.4%
Simplified98.4%
inv-pow98.4%
sqrt-pow298.4%
Applied egg-rr100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in kx around 0 93.4%
Final simplification93.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 (sqrt (+ 0.5 (/ 0.5 (hypot 1.0 (/ (* l (* (sin ky_m) 2.0)) Om))))))
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 / hypot(1.0, ((l * (sin(ky_m) * 2.0)) / Om)))));
}
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 / Math.hypot(1.0, ((l * (Math.sin(ky_m) * 2.0)) / Om)))));
}
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 / math.hypot(1.0, ((l * (math.sin(ky_m) * 2.0)) / Om)))))
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 / hypot(1.0, Float64(Float64(l * Float64(sin(ky_m) * 2.0)) / Om))))) 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 / hypot(1.0, ((l * (sin(ky_m) * 2.0)) / Om)))));
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[Sqrt[1.0 ^ 2 + N[(N[(l * N[(N[Sin[ky$95$m], $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] ^ 2], $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 + \frac{0.5}{\mathsf{hypot}\left(1, \frac{\ell \cdot \left(\sin ky\_m \cdot 2\right)}{Om}\right)}}
\end{array}
Initial program 98.4%
Simplified98.4%
*-un-lft-identity98.4%
add-sqr-sqrt98.4%
hypot-1-def98.4%
sqrt-prod98.4%
sqrt-pow198.9%
metadata-eval98.9%
pow198.9%
clear-num98.9%
un-div-inv98.9%
unpow298.9%
unpow298.9%
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.4%
*-un-lft-identity93.4%
un-div-inv93.4%
pow193.4%
metadata-eval93.4%
sqrt-pow193.4%
sqrt-pow193.4%
metadata-eval93.4%
pow193.4%
associate-*l/93.4%
associate-/l*93.4%
Applied egg-rr93.4%
*-lft-identity93.4%
associate-*r/93.4%
associate-/l*93.4%
*-commutative93.4%
*-commutative93.4%
associate-*l*93.4%
Simplified93.4%
Final simplification93.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
(let* ((t_0 (/ (* 2.0 l) Om)))
(if (<= t_0 0.001)
1.0
(sqrt (+ 0.5 (* 0.5 (/ 1.0 (hypot 1.0 (* ky_m t_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 t_0 = (2.0 * l) / Om;
double tmp;
if (t_0 <= 0.001) {
tmp = 1.0;
} else {
tmp = sqrt((0.5 + (0.5 * (1.0 / hypot(1.0, (ky_m * t_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 t_0 = (2.0 * l) / Om;
double tmp;
if (t_0 <= 0.001) {
tmp = 1.0;
} else {
tmp = Math.sqrt((0.5 + (0.5 * (1.0 / Math.hypot(1.0, (ky_m * t_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): t_0 = (2.0 * l) / Om tmp = 0 if t_0 <= 0.001: tmp = 1.0 else: tmp = math.sqrt((0.5 + (0.5 * (1.0 / math.hypot(1.0, (ky_m * t_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) t_0 = Float64(Float64(2.0 * l) / Om) tmp = 0.0 if (t_0 <= 0.001) tmp = 1.0; else tmp = sqrt(Float64(0.5 + Float64(0.5 * Float64(1.0 / hypot(1.0, Float64(ky_m * t_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)
t_0 = (2.0 * l) / Om;
tmp = 0.0;
if (t_0 <= 0.001)
tmp = 1.0;
else
tmp = sqrt((0.5 + (0.5 * (1.0 / hypot(1.0, (ky_m * t_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_] := Block[{t$95$0 = N[(N[(2.0 * l), $MachinePrecision] / Om), $MachinePrecision]}, If[LessEqual[t$95$0, 0.001], 1.0, N[Sqrt[N[(0.5 + N[(0.5 * N[(1.0 / N[Sqrt[1.0 ^ 2 + N[(ky$95$m * t$95$0), $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])\\
\\
\begin{array}{l}
t_0 := \frac{2 \cdot \ell}{Om}\\
\mathbf{if}\;t\_0 \leq 0.001:\\
\;\;\;\;1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 + 0.5 \cdot \frac{1}{\mathsf{hypot}\left(1, ky\_m \cdot t\_0\right)}}\\
\end{array}
\end{array}
if (/.f64 (*.f64 2 l) Om) < 1e-3Initial program 97.9%
Simplified97.9%
*-un-lft-identity97.9%
add-sqr-sqrt97.9%
hypot-1-def97.9%
sqrt-prod97.9%
sqrt-pow198.5%
metadata-eval98.5%
pow198.5%
clear-num98.5%
un-div-inv98.5%
unpow298.5%
unpow298.5%
hypot-define100.0%
Applied egg-rr100.0%
*-lft-identity100.0%
*-commutative100.0%
associate-/r/100.0%
Simplified100.0%
Taylor expanded in kx around 0 96.2%
*-un-lft-identity96.2%
un-div-inv96.2%
pow196.2%
metadata-eval96.2%
sqrt-pow196.2%
sqrt-pow196.2%
metadata-eval96.2%
pow196.2%
associate-*l/96.2%
associate-/l*96.2%
Applied egg-rr96.2%
*-lft-identity96.2%
associate-*r/96.2%
associate-/l*96.2%
*-commutative96.2%
*-commutative96.2%
associate-*l*96.2%
Simplified96.2%
Taylor expanded in l around 0 74.8%
if 1e-3 < (/.f64 (*.f64 2 l) Om) Initial program 100.0%
Simplified100.0%
*-un-lft-identity100.0%
add-sqr-sqrt100.0%
hypot-1-def100.0%
sqrt-prod100.0%
sqrt-pow1100.0%
metadata-eval100.0%
pow1100.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 kx around 0 85.0%
Taylor expanded in ky around 0 85.0%
*-commutative85.0%
associate-/l*85.0%
associate-*l*85.0%
*-commutative85.0%
associate-*r/85.0%
Simplified85.0%
Final simplification77.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 (if (<= Om 1e-70) (sqrt 0.5) (if (<= Om 2e+16) 1.0 (if (<= Om 1.8e+46) (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 <= 1e-70) {
tmp = sqrt(0.5);
} else if (Om <= 2e+16) {
tmp = 1.0;
} else if (Om <= 1.8e+46) {
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 <= 1d-70) then
tmp = sqrt(0.5d0)
else if (om <= 2d+16) then
tmp = 1.0d0
else if (om <= 1.8d+46) 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 <= 1e-70) {
tmp = Math.sqrt(0.5);
} else if (Om <= 2e+16) {
tmp = 1.0;
} else if (Om <= 1.8e+46) {
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 <= 1e-70: tmp = math.sqrt(0.5) elif Om <= 2e+16: tmp = 1.0 elif Om <= 1.8e+46: 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 <= 1e-70) tmp = sqrt(0.5); elseif (Om <= 2e+16) tmp = 1.0; elseif (Om <= 1.8e+46) 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 <= 1e-70)
tmp = sqrt(0.5);
elseif (Om <= 2e+16)
tmp = 1.0;
elseif (Om <= 1.8e+46)
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, 1e-70], N[Sqrt[0.5], $MachinePrecision], If[LessEqual[Om, 2e+16], 1.0, If[LessEqual[Om, 1.8e+46], 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 10^{-70}:\\
\;\;\;\;\sqrt{0.5}\\
\mathbf{elif}\;Om \leq 2 \cdot 10^{+16}:\\
\;\;\;\;1\\
\mathbf{elif}\;Om \leq 1.8 \cdot 10^{+46}:\\
\;\;\;\;\sqrt{0.5}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\end{array}
if Om < 9.99999999999999996e-71 or 2e16 < Om < 1.7999999999999999e46Initial program 97.8%
Simplified97.8%
Taylor expanded in l around inf 56.4%
unpow256.4%
unpow256.4%
hypot-undefine58.1%
Simplified58.1%
Taylor expanded in l around inf 65.1%
if 9.99999999999999996e-71 < Om < 2e16 or 1.7999999999999999e46 < Om Initial program 100.0%
Simplified100.0%
*-un-lft-identity100.0%
add-sqr-sqrt100.0%
hypot-1-def100.0%
sqrt-prod100.0%
sqrt-pow1100.0%
metadata-eval100.0%
pow1100.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 kx around 0 95.7%
*-un-lft-identity95.7%
un-div-inv95.7%
pow195.7%
metadata-eval95.7%
sqrt-pow195.7%
sqrt-pow195.7%
metadata-eval95.7%
pow195.7%
associate-*l/95.7%
associate-/l*95.7%
Applied egg-rr95.7%
*-lft-identity95.7%
associate-*r/95.7%
associate-/l*95.7%
*-commutative95.7%
*-commutative95.7%
associate-*l*95.7%
Simplified95.7%
Taylor expanded in l around 0 85.9%
Final simplification71.2%
kx_m = (fabs.f64 kx) ky_m = (fabs.f64 ky) NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. (FPCore (l Om kx_m ky_m) :precision binary64 1.0)
kx_m = fabs(kx);
ky_m = fabs(ky);
assert(l < Om && Om < kx_m && kx_m < ky_m);
double code(double l, double Om, double kx_m, double ky_m) {
return 1.0;
}
kx_m = abs(kx)
ky_m = abs(ky)
NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function.
real(8) function code(l, om, kx_m, ky_m)
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: kx_m
real(8), intent (in) :: ky_m
code = 1.0d0
end function
kx_m = Math.abs(kx);
ky_m = Math.abs(ky);
assert l < Om && Om < kx_m && kx_m < ky_m;
public static double code(double l, double Om, double kx_m, double ky_m) {
return 1.0;
}
kx_m = math.fabs(kx) ky_m = math.fabs(ky) [l, Om, kx_m, ky_m] = sort([l, Om, kx_m, ky_m]) def code(l, Om, kx_m, ky_m): return 1.0
kx_m = abs(kx) ky_m = abs(ky) l, Om, kx_m, ky_m = sort([l, Om, kx_m, ky_m]) function code(l, Om, kx_m, ky_m) return 1.0 end
kx_m = abs(kx);
ky_m = abs(ky);
l, Om, kx_m, ky_m = num2cell(sort([l, Om, kx_m, ky_m])){:}
function tmp = code(l, Om, kx_m, ky_m)
tmp = 1.0;
end
kx_m = N[Abs[kx], $MachinePrecision] ky_m = N[Abs[ky], $MachinePrecision] NOTE: l, Om, kx_m, and ky_m should be sorted in increasing order before calling this function. code[l_, Om_, kx$95$m_, ky$95$m_] := 1.0
\begin{array}{l}
kx_m = \left|kx\right|
\\
ky_m = \left|ky\right|
\\
[l, Om, kx_m, ky_m] = \mathsf{sort}([l, Om, kx_m, ky_m])\\
\\
1
\end{array}
Initial program 98.4%
Simplified98.4%
*-un-lft-identity98.4%
add-sqr-sqrt98.4%
hypot-1-def98.4%
sqrt-prod98.4%
sqrt-pow198.9%
metadata-eval98.9%
pow198.9%
clear-num98.9%
un-div-inv98.9%
unpow298.9%
unpow298.9%
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.4%
*-un-lft-identity93.4%
un-div-inv93.4%
pow193.4%
metadata-eval93.4%
sqrt-pow193.4%
sqrt-pow193.4%
metadata-eval93.4%
pow193.4%
associate-*l/93.4%
associate-/l*93.4%
Applied egg-rr93.4%
*-lft-identity93.4%
associate-*r/93.4%
associate-/l*93.4%
*-commutative93.4%
*-commutative93.4%
associate-*l*93.4%
Simplified93.4%
Taylor expanded in l around 0 63.4%
Final simplification63.4%
herbie shell --seed 2024051
(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))))))))))