
(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 (cbrt (pow (+ 0.5 (/ 0.5 (hypot 1.0 (* (* 2.0 (sin ky_m)) (/ l Om))))) 1.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 cbrt(pow((0.5 + (0.5 / hypot(1.0, ((2.0 * sin(ky_m)) * (l / Om))))), 1.5));
}
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.cbrt(Math.pow((0.5 + (0.5 / Math.hypot(1.0, ((2.0 * Math.sin(ky_m)) * (l / Om))))), 1.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 cbrt((Float64(0.5 + Float64(0.5 / hypot(1.0, Float64(Float64(2.0 * sin(ky_m)) * Float64(l / Om))))) ^ 1.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[Power[N[Power[N[(0.5 + N[(0.5 / N[Sqrt[1.0 ^ 2 + N[(N[(2.0 * N[Sin[ky$95$m], $MachinePrecision]), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.5], $MachinePrecision], 1/3], $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[3]{{\left(0.5 + \frac{0.5}{\mathsf{hypot}\left(1, \left(2 \cdot \sin ky_m\right) \cdot \frac{\ell}{Om}\right)}\right)}^{1.5}}
\end{array}
Initial program 97.6%
Simplified97.6%
expm1-log1p-u97.6%
expm1-udef97.6%
Applied egg-rr100.0%
expm1-def100.0%
expm1-log1p100.0%
*-commutative100.0%
associate-*r/100.0%
associate-/l*100.0%
Simplified100.0%
Taylor expanded in kx around 0 90.6%
add-cbrt-cube90.6%
pow1/390.6%
Applied egg-rr90.6%
unpow1/390.6%
associate-*r*90.6%
*-commutative90.6%
Simplified90.6%
Final simplification90.6%
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 (* (* 2.0 (sin ky_m)) (/ l 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, ((2.0 * sin(ky_m)) * (l / 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, ((2.0 * Math.sin(ky_m)) * (l / 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, ((2.0 * math.sin(ky_m)) * (l / 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(2.0 * sin(ky_m)) * Float64(l / 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, ((2.0 * sin(ky_m)) * (l / 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[(2.0 * N[Sin[ky$95$m], $MachinePrecision]), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $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, \left(2 \cdot \sin ky_m\right) \cdot \frac{\ell}{Om}\right)}}
\end{array}
Initial program 97.6%
Simplified97.6%
expm1-log1p-u97.6%
expm1-udef97.6%
Applied egg-rr100.0%
expm1-def100.0%
expm1-log1p100.0%
*-commutative100.0%
associate-*r/100.0%
associate-/l*100.0%
Simplified100.0%
Taylor expanded in kx around 0 90.6%
expm1-log1p-u90.1%
expm1-udef90.1%
associate-*l/90.1%
metadata-eval90.1%
associate-*r/90.1%
div-inv90.1%
clear-num90.1%
associate-*r*90.1%
Applied egg-rr90.1%
expm1-def90.1%
expm1-log1p90.6%
associate-*r*90.6%
*-commutative90.6%
Simplified90.6%
Final simplification90.6%
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 (<= l 2.35e-91) 1.0 (sqrt (+ 0.5 (/ 0.5 (hypot 1.0 (* 2.0 (/ (* ky_m l) 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) {
double tmp;
if (l <= 2.35e-91) {
tmp = 1.0;
} else {
tmp = sqrt((0.5 + (0.5 / hypot(1.0, (2.0 * ((ky_m * l) / Om))))));
}
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 (l <= 2.35e-91) {
tmp = 1.0;
} else {
tmp = Math.sqrt((0.5 + (0.5 / Math.hypot(1.0, (2.0 * ((ky_m * l) / Om))))));
}
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 l <= 2.35e-91: tmp = 1.0 else: tmp = math.sqrt((0.5 + (0.5 / math.hypot(1.0, (2.0 * ((ky_m * l) / Om)))))) 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 (l <= 2.35e-91) tmp = 1.0; else tmp = sqrt(Float64(0.5 + Float64(0.5 / hypot(1.0, Float64(2.0 * Float64(Float64(ky_m * l) / Om)))))); 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 (l <= 2.35e-91)
tmp = 1.0;
else
tmp = sqrt((0.5 + (0.5 / hypot(1.0, (2.0 * ((ky_m * l) / Om))))));
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[l, 2.35e-91], 1.0, N[Sqrt[N[(0.5 + N[(0.5 / N[Sqrt[1.0 ^ 2 + N[(2.0 * N[(N[(ky$95$m * l), $MachinePrecision] / Om), $MachinePrecision]), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.35 \cdot 10^{-91}:\\
\;\;\;\;1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 + \frac{0.5}{\mathsf{hypot}\left(1, 2 \cdot \frac{ky_m \cdot \ell}{Om}\right)}}\\
\end{array}
\end{array}
if l < 2.35000000000000003e-91Initial program 98.8%
Simplified98.8%
expm1-log1p-u98.8%
expm1-udef98.8%
Applied egg-rr100.0%
expm1-def100.0%
expm1-log1p100.0%
*-commutative100.0%
associate-*r/100.0%
associate-/l*100.0%
Simplified100.0%
Taylor expanded in kx around 0 91.7%
add-cbrt-cube91.7%
pow1/391.7%
Applied egg-rr91.7%
unpow1/391.7%
associate-*r*91.7%
*-commutative91.7%
Simplified91.7%
Taylor expanded in ky around 0 69.9%
if 2.35000000000000003e-91 < l Initial program 95.6%
Simplified95.6%
expm1-log1p-u95.6%
expm1-udef95.6%
Applied egg-rr100.0%
expm1-def100.0%
expm1-log1p100.0%
*-commutative100.0%
associate-*r/100.0%
associate-/l*100.0%
Simplified100.0%
Taylor expanded in kx around 0 88.6%
expm1-log1p-u88.0%
expm1-udef88.0%
associate-*l/88.0%
metadata-eval88.0%
associate-*r/88.0%
div-inv88.0%
clear-num88.0%
associate-*r*88.0%
Applied egg-rr88.0%
expm1-def88.0%
expm1-log1p88.6%
associate-*r*88.6%
*-commutative88.6%
Simplified88.6%
Taylor expanded in ky around 0 79.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 (if (<= l 4.7e-85) 1.0 (if (<= l 9e-54) (sqrt 0.5) (if (<= l 1.6e+50) 1.0 (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) {
double tmp;
if (l <= 4.7e-85) {
tmp = 1.0;
} else if (l <= 9e-54) {
tmp = sqrt(0.5);
} else if (l <= 1.6e+50) {
tmp = 1.0;
} else {
tmp = sqrt(0.5);
}
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 (l <= 4.7d-85) then
tmp = 1.0d0
else if (l <= 9d-54) then
tmp = sqrt(0.5d0)
else if (l <= 1.6d+50) then
tmp = 1.0d0
else
tmp = sqrt(0.5d0)
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 (l <= 4.7e-85) {
tmp = 1.0;
} else if (l <= 9e-54) {
tmp = Math.sqrt(0.5);
} else if (l <= 1.6e+50) {
tmp = 1.0;
} else {
tmp = Math.sqrt(0.5);
}
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 l <= 4.7e-85: tmp = 1.0 elif l <= 9e-54: tmp = math.sqrt(0.5) elif l <= 1.6e+50: tmp = 1.0 else: tmp = math.sqrt(0.5) 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 (l <= 4.7e-85) tmp = 1.0; elseif (l <= 9e-54) tmp = sqrt(0.5); elseif (l <= 1.6e+50) tmp = 1.0; else tmp = sqrt(0.5); 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 (l <= 4.7e-85)
tmp = 1.0;
elseif (l <= 9e-54)
tmp = sqrt(0.5);
elseif (l <= 1.6e+50)
tmp = 1.0;
else
tmp = sqrt(0.5);
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[l, 4.7e-85], 1.0, If[LessEqual[l, 9e-54], N[Sqrt[0.5], $MachinePrecision], If[LessEqual[l, 1.6e+50], 1.0, 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])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 4.7 \cdot 10^{-85}:\\
\;\;\;\;1\\
\mathbf{elif}\;\ell \leq 9 \cdot 10^{-54}:\\
\;\;\;\;\sqrt{0.5}\\
\mathbf{elif}\;\ell \leq 1.6 \cdot 10^{+50}:\\
\;\;\;\;1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5}\\
\end{array}
\end{array}
if l < 4.70000000000000009e-85 or 8.9999999999999997e-54 < l < 1.59999999999999991e50Initial program 98.4%
Simplified98.4%
expm1-log1p-u98.4%
expm1-udef98.4%
Applied egg-rr100.0%
expm1-def100.0%
expm1-log1p100.0%
*-commutative100.0%
associate-*r/100.0%
associate-/l*100.0%
Simplified100.0%
Taylor expanded in kx around 0 92.9%
add-cbrt-cube92.9%
pow1/392.9%
Applied egg-rr92.9%
unpow1/392.9%
associate-*r*92.9%
*-commutative92.9%
Simplified92.9%
Taylor expanded in ky around 0 71.7%
if 4.70000000000000009e-85 < l < 8.9999999999999997e-54 or 1.59999999999999991e50 < l Initial program 95.3%
Simplified95.3%
Taylor expanded in Om around 0 71.4%
associate-*r*71.4%
*-commutative71.4%
unpow271.4%
unpow271.4%
hypot-def76.2%
associate-*r/76.2%
associate-/l*76.2%
Simplified76.2%
Taylor expanded in Om around 0 80.0%
Final simplification73.7%
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 97.6%
Simplified97.6%
expm1-log1p-u97.6%
expm1-udef97.6%
Applied egg-rr100.0%
expm1-def100.0%
expm1-log1p100.0%
*-commutative100.0%
associate-*r/100.0%
associate-/l*100.0%
Simplified100.0%
Taylor expanded in kx around 0 90.6%
add-cbrt-cube90.6%
pow1/390.6%
Applied egg-rr90.6%
unpow1/390.6%
associate-*r*90.6%
*-commutative90.6%
Simplified90.6%
Taylor expanded in ky around 0 63.5%
Final simplification63.5%
herbie shell --seed 2023333
(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))))))))))