
(FPCore (a1 a2 th) :precision binary64 (let* ((t_1 (/ (cos th) (sqrt 2.0)))) (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2)))))
double code(double a1, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
real(8) :: t_1
t_1 = cos(th) / sqrt(2.0d0)
code = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
end function
public static double code(double a1, double a2, double th) {
double t_1 = Math.cos(th) / Math.sqrt(2.0);
return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}
def code(a1, a2, th): t_1 = math.cos(th) / math.sqrt(2.0) return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
function code(a1, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) return Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) end
function tmp = code(a1, a2, th) t_1 = cos(th) / sqrt(2.0); tmp = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2)); end
code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right)
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a1 a2 th) :precision binary64 (let* ((t_1 (/ (cos th) (sqrt 2.0)))) (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2)))))
double code(double a1, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
real(8) :: t_1
t_1 = cos(th) / sqrt(2.0d0)
code = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
end function
public static double code(double a1, double a2, double th) {
double t_1 = Math.cos(th) / Math.sqrt(2.0);
return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}
def code(a1, a2, th): t_1 = math.cos(th) / math.sqrt(2.0) return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
function code(a1, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) return Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) end
function tmp = code(a1, a2, th) t_1 = cos(th) / sqrt(2.0); tmp = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2)); end
code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right)
\end{array}
\end{array}
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (cos th) (/ (fma a2_m a2_m (* a1 a1)) (sqrt 2.0))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return cos(th) * (fma(a2_m, a2_m, (a1 * a1)) / sqrt(2.0));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(cos(th) * Float64(fma(a2_m, a2_m, Float64(a1 * a1)) / sqrt(2.0))) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a2$95$m * a2$95$m + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\cos th \cdot \frac{\mathsf{fma}\left(a2\_m, a2\_m, a1 \cdot a1\right)}{\sqrt{2}}
\end{array}
Initial program 99.6%
distribute-lft-out99.6%
cos-neg99.6%
associate-*l/99.6%
associate-/l*99.7%
cos-neg99.7%
+-commutative99.7%
fma-define99.7%
Simplified99.7%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (/ (cos th) (sqrt 2.0)) (+ (* a1 a1) (* a2_m a2_m))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (cos(th) / sqrt(2.0)) * ((a1 * a1) + (a2_m * a2_m));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (cos(th) / sqrt(2.0d0)) * ((a1 * a1) + (a2_m * a2_m))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return (Math.cos(th) / Math.sqrt(2.0)) * ((a1 * a1) + (a2_m * a2_m));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return (math.cos(th) / math.sqrt(2.0)) * ((a1 * a1) + (a2_m * a2_m))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(cos(th) / sqrt(2.0)) * Float64(Float64(a1 * a1) + Float64(a2_m * a2_m))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = (cos(th) / sqrt(2.0)) * ((a1 * a1) + (a2_m * a2_m));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(N[(a1 * a1), $MachinePrecision] + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2\_m \cdot a2\_m\right)
\end{array}
Initial program 99.6%
distribute-lft-out99.6%
Simplified99.6%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (+ (* a1 a1) (* a2_m a2_m)) (* (cos th) (sqrt 0.5))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return ((a1 * a1) + (a2_m * a2_m)) * (cos(th) * sqrt(0.5));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = ((a1 * a1) + (a2_m * a2_m)) * (cos(th) * sqrt(0.5d0))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return ((a1 * a1) + (a2_m * a2_m)) * (Math.cos(th) * Math.sqrt(0.5));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return ((a1 * a1) + (a2_m * a2_m)) * (math.cos(th) * math.sqrt(0.5))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(Float64(a1 * a1) + Float64(a2_m * a2_m)) * Float64(cos(th) * sqrt(0.5))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = ((a1 * a1) + (a2_m * a2_m)) * (cos(th) * sqrt(0.5));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[(a1 * a1), $MachinePrecision] + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(a1 \cdot a1 + a2\_m \cdot a2\_m\right) \cdot \left(\cos th \cdot \sqrt{0.5}\right)
\end{array}
Initial program 99.6%
distribute-lft-out99.6%
Simplified99.6%
*-un-lft-identity99.6%
add-sqr-sqrt99.6%
times-frac99.2%
pow1/299.2%
sqrt-pow199.2%
metadata-eval99.2%
pow1/299.2%
sqrt-pow199.2%
metadata-eval99.2%
Applied egg-rr99.2%
associate-*l/99.5%
*-lft-identity99.5%
Simplified99.5%
associate-/l/99.6%
pow-prod-up99.6%
metadata-eval99.6%
pow1/299.6%
clear-num99.6%
associate-/r/99.5%
add-sqr-sqrt99.5%
sqrt-unprod99.5%
frac-times99.5%
metadata-eval99.5%
rem-square-sqrt99.6%
metadata-eval99.6%
Applied egg-rr99.6%
Final simplification99.6%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* a2_m (/ a2_m (/ (sqrt 2.0) (cos th)))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return a2_m * (a2_m / (sqrt(2.0) / cos(th)));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a2_m * (a2_m / (sqrt(2.0d0) / cos(th)))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return a2_m * (a2_m / (Math.sqrt(2.0) / Math.cos(th)));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return a2_m * (a2_m / (math.sqrt(2.0) / math.cos(th)))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(a2_m * Float64(a2_m / Float64(sqrt(2.0) / cos(th)))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = a2_m * (a2_m / (sqrt(2.0) / cos(th)));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(a2$95$m * N[(a2$95$m / N[(N[Sqrt[2.0], $MachinePrecision] / N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
a2\_m \cdot \frac{a2\_m}{\frac{\sqrt{2}}{\cos th}}
\end{array}
Initial program 99.6%
distribute-lft-out99.6%
cos-neg99.6%
associate-*l/99.6%
associate-/l*99.7%
cos-neg99.7%
+-commutative99.7%
fma-define99.7%
Simplified99.7%
associate-*r/99.6%
associate-*l/99.6%
clear-num99.6%
associate-*l/99.6%
*-un-lft-identity99.6%
add-sqr-sqrt99.6%
pow299.6%
fma-undefine99.6%
hypot-define99.6%
Applied egg-rr99.6%
Taylor expanded in a2 around inf 54.0%
pow254.0%
associate-/l*54.0%
Applied egg-rr54.0%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* a2_m (* (sqrt 0.5) (* (cos th) a2_m))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return a2_m * (sqrt(0.5) * (cos(th) * a2_m));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a2_m * (sqrt(0.5d0) * (cos(th) * a2_m))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return a2_m * (Math.sqrt(0.5) * (Math.cos(th) * a2_m));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return a2_m * (math.sqrt(0.5) * (math.cos(th) * a2_m))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(a2_m * Float64(sqrt(0.5) * Float64(cos(th) * a2_m))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = a2_m * (sqrt(0.5) * (cos(th) * a2_m));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(a2$95$m * N[(N[Sqrt[0.5], $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
a2\_m \cdot \left(\sqrt{0.5} \cdot \left(\cos th \cdot a2\_m\right)\right)
\end{array}
Initial program 99.6%
distribute-lft-out99.6%
cos-neg99.6%
associate-*l/99.6%
associate-/l*99.7%
cos-neg99.7%
+-commutative99.7%
fma-define99.7%
Simplified99.7%
associate-*r/99.6%
associate-*l/99.6%
clear-num99.6%
associate-*l/99.6%
*-un-lft-identity99.6%
add-sqr-sqrt99.6%
pow299.6%
fma-undefine99.6%
hypot-define99.6%
Applied egg-rr99.6%
Taylor expanded in a2 around inf 54.0%
pow254.0%
associate-/l*54.0%
Applied egg-rr54.0%
div-inv54.0%
clear-num54.0%
div-inv54.0%
add-sqr-sqrt54.0%
sqrt-unprod54.0%
frac-times54.0%
metadata-eval54.0%
rem-square-sqrt54.0%
metadata-eval54.0%
Applied egg-rr54.0%
associate-*r*54.0%
*-commutative54.0%
Simplified54.0%
Final simplification54.0%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* a2_m (* a2_m (/ (cos th) (sqrt 2.0)))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return a2_m * (a2_m * (cos(th) / sqrt(2.0)));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a2_m * (a2_m * (cos(th) / sqrt(2.0d0)))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return a2_m * (a2_m * (Math.cos(th) / Math.sqrt(2.0)));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return a2_m * (a2_m * (math.cos(th) / math.sqrt(2.0)))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(a2_m * Float64(a2_m * Float64(cos(th) / sqrt(2.0)))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = a2_m * (a2_m * (cos(th) / sqrt(2.0)));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(a2$95$m * N[(a2$95$m * N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
a2\_m \cdot \left(a2\_m \cdot \frac{\cos th}{\sqrt{2}}\right)
\end{array}
Initial program 99.6%
distribute-lft-out99.6%
cos-neg99.6%
associate-*l/99.6%
associate-/l*99.7%
cos-neg99.7%
+-commutative99.7%
fma-define99.7%
Simplified99.7%
associate-*r/99.6%
associate-*l/99.6%
clear-num99.6%
associate-*l/99.6%
*-un-lft-identity99.6%
add-sqr-sqrt99.6%
pow299.6%
fma-undefine99.6%
hypot-define99.6%
Applied egg-rr99.6%
Taylor expanded in a2 around inf 54.0%
pow254.0%
div-inv54.0%
clear-num54.0%
associate-*l*54.0%
Applied egg-rr54.0%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (+ (* a1 a1) (* a2_m a2_m)) (sqrt 0.5)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return ((a1 * a1) + (a2_m * a2_m)) * sqrt(0.5);
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = ((a1 * a1) + (a2_m * a2_m)) * sqrt(0.5d0)
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return ((a1 * a1) + (a2_m * a2_m)) * Math.sqrt(0.5);
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return ((a1 * a1) + (a2_m * a2_m)) * math.sqrt(0.5)
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(Float64(a1 * a1) + Float64(a2_m * a2_m)) * sqrt(0.5)) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = ((a1 * a1) + (a2_m * a2_m)) * sqrt(0.5);
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[(a1 * a1), $MachinePrecision] + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(a1 \cdot a1 + a2\_m \cdot a2\_m\right) \cdot \sqrt{0.5}
\end{array}
Initial program 99.6%
distribute-lft-out99.6%
Simplified99.6%
Taylor expanded in th around 0 64.8%
*-un-lft-identity64.8%
add-sqr-sqrt64.8%
sqrt-unprod64.8%
frac-times64.8%
metadata-eval64.8%
rem-square-sqrt64.8%
metadata-eval64.8%
Applied egg-rr64.8%
*-lft-identity64.8%
Simplified64.8%
Final simplification64.8%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (/ a2_m (/ (sqrt 2.0) a2_m)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return a2_m / (sqrt(2.0) / a2_m);
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a2_m / (sqrt(2.0d0) / a2_m)
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return a2_m / (Math.sqrt(2.0) / a2_m);
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return a2_m / (math.sqrt(2.0) / a2_m)
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(a2_m / Float64(sqrt(2.0) / a2_m)) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = a2_m / (sqrt(2.0) / a2_m);
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(a2$95$m / N[(N[Sqrt[2.0], $MachinePrecision] / a2$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\frac{a2\_m}{\frac{\sqrt{2}}{a2\_m}}
\end{array}
Initial program 99.6%
distribute-lft-out99.6%
Simplified99.6%
Taylor expanded in th around 0 64.8%
Taylor expanded in a1 around 0 38.3%
pow238.3%
associate-/l*38.3%
Applied egg-rr38.3%
clear-num38.3%
un-div-inv38.3%
Applied egg-rr38.3%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* a2_m (/ a2_m (sqrt 2.0))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return a2_m * (a2_m / sqrt(2.0));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a2_m * (a2_m / sqrt(2.0d0))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return a2_m * (a2_m / Math.sqrt(2.0));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return a2_m * (a2_m / math.sqrt(2.0))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(a2_m * Float64(a2_m / sqrt(2.0))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = a2_m * (a2_m / sqrt(2.0));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(a2$95$m * N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
a2\_m \cdot \frac{a2\_m}{\sqrt{2}}
\end{array}
Initial program 99.6%
distribute-lft-out99.6%
Simplified99.6%
Taylor expanded in th around 0 64.8%
Taylor expanded in a1 around 0 38.3%
pow238.3%
associate-/l*38.3%
Applied egg-rr38.3%
herbie shell --seed 2024103
(FPCore (a1 a2 th)
:name "Migdal et al, Equation (64)"
:precision binary64
(+ (* (/ (cos th) (sqrt 2.0)) (* a1 a1)) (* (/ (cos th) (sqrt 2.0)) (* a2 a2))))