
(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 10 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}
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (/ (fma a1_m a1_m (* a2 a2)) (/ (sqrt 2.0) (cos th))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return fma(a1_m, a1_m, (a2 * a2)) / (sqrt(2.0) / cos(th));
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(fma(a1_m, a1_m, Float64(a2 * a2)) / Float64(sqrt(2.0) / cos(th))) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] / N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\frac{\mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right)}{\frac{\sqrt{2}}{\cos th}}
\end{array}
Initial program 99.7%
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
lower-/.f6499.7
Applied egg-rr99.7%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1_m a1_m)) (* (* a2 a2) t_1)) -5e-298)
(* (* (fma a1_m a1_m (* a2 a2)) (sqrt 2.0)) -0.5)
(/ (fma a2 a2 (* a1_m a1_m)) (sqrt 2.0)))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + ((a2 * a2) * t_1)) <= -5e-298) {
tmp = (fma(a1_m, a1_m, (a2 * a2)) * sqrt(2.0)) * -0.5;
} else {
tmp = fma(a2, a2, (a1_m * a1_m)) / sqrt(2.0);
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1_m * a1_m)) + Float64(Float64(a2 * a2) * t_1)) <= -5e-298) tmp = Float64(Float64(fma(a1_m, a1_m, Float64(a2 * a2)) * sqrt(2.0)) * -0.5); else tmp = Float64(fma(a2, a2, Float64(a1_m * a1_m)) / sqrt(2.0)); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -5e-298], N[(N[(N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision], N[(N[(a2 * a2 + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + \left(a2 \cdot a2\right) \cdot t\_1 \leq -5 \cdot 10^{-298}:\\
\;\;\;\;\left(\mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right) \cdot \sqrt{2}\right) \cdot -0.5\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2, a2, a1\_m \cdot a1\_m\right)}{\sqrt{2}}\\
\end{array}
\end{array}
if (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) < -5.0000000000000002e-298Initial program 99.6%
Taylor expanded in th around 0
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f640.8
Simplified0.8%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f640.8
Applied egg-rr0.8%
Applied egg-rr64.5%
if -5.0000000000000002e-298 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) Initial program 99.7%
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
lower-/.f6499.7
Applied egg-rr99.7%
Taylor expanded in th around 0
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6487.8
Simplified87.8%
Final simplification82.6%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (* (fma a1_m a1_m (* a2 a2)) (sqrt 2.0)))
(t_2 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_2 (* a1_m a1_m)) (* (* a2 a2) t_2)) -5e-298)
(* t_1 -0.5)
(* t_1 0.5))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = fma(a1_m, a1_m, (a2 * a2)) * sqrt(2.0);
double t_2 = cos(th) / sqrt(2.0);
double tmp;
if (((t_2 * (a1_m * a1_m)) + ((a2 * a2) * t_2)) <= -5e-298) {
tmp = t_1 * -0.5;
} else {
tmp = t_1 * 0.5;
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(fma(a1_m, a1_m, Float64(a2 * a2)) * sqrt(2.0)) t_2 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_2 * Float64(a1_m * a1_m)) + Float64(Float64(a2 * a2) * t_2)) <= -5e-298) tmp = Float64(t_1 * -0.5); else tmp = Float64(t_1 * 0.5); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2_, th_] := Block[{t$95$1 = N[(N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$2 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision], -5e-298], N[(t$95$1 * -0.5), $MachinePrecision], N[(t$95$1 * 0.5), $MachinePrecision]]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right) \cdot \sqrt{2}\\
t_2 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_2 \cdot \left(a1\_m \cdot a1\_m\right) + \left(a2 \cdot a2\right) \cdot t\_2 \leq -5 \cdot 10^{-298}:\\
\;\;\;\;t\_1 \cdot -0.5\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot 0.5\\
\end{array}
\end{array}
if (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) < -5.0000000000000002e-298Initial program 99.6%
Taylor expanded in th around 0
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f640.8
Simplified0.8%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f640.8
Applied egg-rr0.8%
Applied egg-rr64.5%
if -5.0000000000000002e-298 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) Initial program 99.7%
Taylor expanded in th around 0
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6487.7
Simplified87.7%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f6487.8
Applied egg-rr87.8%
Applied egg-rr87.8%
Final simplification82.6%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1_m a1_m)) (* (* a2 a2) t_1)) -5e-298)
(* (* (fma a1_m a1_m (* a2 a2)) (sqrt 2.0)) -0.5)
(* 0.5 (* a2 (* a2 (sqrt 2.0)))))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + ((a2 * a2) * t_1)) <= -5e-298) {
tmp = (fma(a1_m, a1_m, (a2 * a2)) * sqrt(2.0)) * -0.5;
} else {
tmp = 0.5 * (a2 * (a2 * sqrt(2.0)));
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1_m * a1_m)) + Float64(Float64(a2 * a2) * t_1)) <= -5e-298) tmp = Float64(Float64(fma(a1_m, a1_m, Float64(a2 * a2)) * sqrt(2.0)) * -0.5); else tmp = Float64(0.5 * Float64(a2 * Float64(a2 * sqrt(2.0)))); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -5e-298], N[(N[(N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision], N[(0.5 * N[(a2 * N[(a2 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + \left(a2 \cdot a2\right) \cdot t\_1 \leq -5 \cdot 10^{-298}:\\
\;\;\;\;\left(\mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right) \cdot \sqrt{2}\right) \cdot -0.5\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(a2 \cdot \left(a2 \cdot \sqrt{2}\right)\right)\\
\end{array}
\end{array}
if (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) < -5.0000000000000002e-298Initial program 99.6%
Taylor expanded in th around 0
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f640.8
Simplified0.8%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f640.8
Applied egg-rr0.8%
Applied egg-rr64.5%
if -5.0000000000000002e-298 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) Initial program 99.7%
Taylor expanded in th around 0
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6487.7
Simplified87.7%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f6487.8
Applied egg-rr87.8%
Taylor expanded in a2 around inf
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f6450.7
Simplified50.7%
Final simplification53.7%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (if (<= (cos th) -0.004) (- (/ (* (fma a1_m a1_m (* a2 a2)) (sqrt 2.0)) (* (sqrt 2.0) (sqrt 2.0)))) (/ (fma a2 a2 (* a1_m a1_m)) (sqrt 2.0))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double tmp;
if (cos(th) <= -0.004) {
tmp = -((fma(a1_m, a1_m, (a2 * a2)) * sqrt(2.0)) / (sqrt(2.0) * sqrt(2.0)));
} else {
tmp = fma(a2, a2, (a1_m * a1_m)) / sqrt(2.0);
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) tmp = 0.0 if (cos(th) <= -0.004) tmp = Float64(-Float64(Float64(fma(a1_m, a1_m, Float64(a2 * a2)) * sqrt(2.0)) / Float64(sqrt(2.0) * sqrt(2.0)))); else tmp = Float64(fma(a2, a2, Float64(a1_m * a1_m)) / sqrt(2.0)); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := If[LessEqual[N[Cos[th], $MachinePrecision], -0.004], (-N[(N[(N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), N[(N[(a2 * a2 + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
\mathbf{if}\;\cos th \leq -0.004:\\
\;\;\;\;-\frac{\mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right) \cdot \sqrt{2}}{\sqrt{2} \cdot \sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2, a2, a1\_m \cdot a1\_m\right)}{\sqrt{2}}\\
\end{array}
\end{array}
if (cos.f64 th) < -0.0040000000000000001Initial program 99.6%
Taylor expanded in th around 0
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f647.3
Simplified7.3%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
frac-2negN/A
frac-addN/A
lower-/.f64N/A
Applied egg-rr7.3%
Applied egg-rr66.8%
if -0.0040000000000000001 < (cos.f64 th) Initial program 99.7%
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
lower-/.f6499.7
Applied egg-rr99.7%
Taylor expanded in th around 0
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6487.5
Simplified87.5%
Final simplification82.6%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (fma a1_m a1_m (* a2 a2)) (/ (cos th) (sqrt 2.0))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return fma(a1_m, a1_m, (a2 * a2)) * (cos(th) / sqrt(2.0));
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(fma(a1_m, a1_m, Float64(a2 * a2)) * Float64(cos(th) / sqrt(2.0))) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right) \cdot \frac{\cos th}{\sqrt{2}}
\end{array}
Initial program 99.7%
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lower-fma.f6499.7
Applied egg-rr99.7%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (cos th) (/ (fma a1_m a1_m (* a2 a2)) (sqrt 2.0))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return cos(th) * (fma(a1_m, a1_m, (a2 * a2)) / sqrt(2.0));
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(cos(th) * Float64(fma(a1_m, a1_m, Float64(a2 * a2)) / sqrt(2.0))) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\cos th \cdot \frac{\mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right)}{\sqrt{2}}
\end{array}
Initial program 99.7%
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
div-invN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
Applied egg-rr99.7%
Final simplification99.7%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (/ (* a2 (* a2 (cos th))) (sqrt 2.0)))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return (a2 * (a2 * cos(th))) / sqrt(2.0);
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (a2 * (a2 * cos(th))) / sqrt(2.0d0)
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return (a2 * (a2 * Math.cos(th))) / Math.sqrt(2.0);
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return (a2 * (a2 * math.cos(th))) / math.sqrt(2.0)
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(Float64(a2 * Float64(a2 * cos(th))) / sqrt(2.0)) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = (a2 * (a2 * cos(th))) / sqrt(2.0);
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(a2 * N[(a2 * N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\frac{a2 \cdot \left(a2 \cdot \cos th\right)}{\sqrt{2}}
\end{array}
Initial program 99.7%
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
lower-/.f6499.7
Applied egg-rr99.7%
Taylor expanded in a1 around 0
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-sqrt.f6454.6
Simplified54.6%
Final simplification54.6%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* a2 (/ (* a2 (cos th)) (sqrt 2.0))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return a2 * ((a2 * cos(th)) / sqrt(2.0));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = a2 * ((a2 * cos(th)) / sqrt(2.0d0))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return a2 * ((a2 * Math.cos(th)) / Math.sqrt(2.0));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return a2 * ((a2 * math.cos(th)) / math.sqrt(2.0))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(a2 * Float64(Float64(a2 * cos(th)) / sqrt(2.0))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = a2 * ((a2 * cos(th)) / sqrt(2.0));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(a2 * N[(N[(a2 * N[Cos[th], $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
a2 \cdot \frac{a2 \cdot \cos th}{\sqrt{2}}
\end{array}
Initial program 99.7%
Taylor expanded in a1 around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-sqrt.f6454.6
Simplified54.6%
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6454.6
Applied egg-rr54.6%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* a2 (* a2 (sqrt 2.0)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * (a2 * (a2 * sqrt(2.0)));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = 0.5d0 * (a2 * (a2 * sqrt(2.0d0)))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return 0.5 * (a2 * (a2 * Math.sqrt(2.0)));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return 0.5 * (a2 * (a2 * math.sqrt(2.0)))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(a2 * Float64(a2 * sqrt(2.0)))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = 0.5 * (a2 * (a2 * sqrt(2.0)));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(a2 * N[(a2 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(a2 \cdot \left(a2 \cdot \sqrt{2}\right)\right)
\end{array}
Initial program 99.7%
Taylor expanded in th around 0
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6468.4
Simplified68.4%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f6468.4
Applied egg-rr68.4%
Taylor expanded in a2 around inf
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f6439.7
Simplified39.7%
herbie shell --seed 2024208
(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))))