
(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 a2 a2 (* a1_m a1_m)) (/ (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(a2, a2, (a1_m * a1_m)) / (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(a2, a2, Float64(a1_m * a1_m)) / 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[(a2 * a2 + N[(a1$95$m * a1$95$m), $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(a2, a2, a1\_m \cdot a1\_m\right)}{\frac{\sqrt{2}}{\cos th}}
\end{array}
Initial program 99.6%
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.6
Applied egg-rr99.6%
lift-*.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.6
Applied egg-rr99.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 (<= (+ (* (* a1_m a1_m) t_1) (* (* a2 a2) t_1)) -1e-306)
(*
(* a2 a2)
(fma a1_m (/ a1_m (* a2 (* a2 (sqrt 2.0)))) (/ -1.0 (sqrt 2.0))))
(/ (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) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1_m * a1_m) * t_1) + ((a2 * a2) * t_1)) <= -1e-306) {
tmp = (a2 * a2) * fma(a1_m, (a1_m / (a2 * (a2 * sqrt(2.0)))), (-1.0 / sqrt(2.0)));
} else {
tmp = fma(a1_m, a1_m, (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(Float64(a1_m * a1_m) * t_1) + Float64(Float64(a2 * a2) * t_1)) <= -1e-306) tmp = Float64(Float64(a2 * a2) * fma(a1_m, Float64(a1_m / Float64(a2 * Float64(a2 * sqrt(2.0)))), Float64(-1.0 / sqrt(2.0)))); else tmp = Float64(fma(a1_m, a1_m, Float64(a2 * 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[(N[(a1$95$m * a1$95$m), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -1e-306], N[(N[(a2 * a2), $MachinePrecision] * N[(a1$95$m * N[(a1$95$m / N[(a2 * N[(a2 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a1$95$m * a1$95$m + N[(a2 * a2), $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}\;\left(a1\_m \cdot a1\_m\right) \cdot t\_1 + \left(a2 \cdot a2\right) \cdot t\_1 \leq -1 \cdot 10^{-306}:\\
\;\;\;\;\left(a2 \cdot a2\right) \cdot \mathsf{fma}\left(a1\_m, \frac{a1\_m}{a2 \cdot \left(a2 \cdot \sqrt{2}\right)}, \frac{-1}{\sqrt{2}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\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))) < -1.00000000000000003e-306Initial program 99.5%
Taylor expanded in th around 0
cube-multN/A
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6428.7
Simplified28.7%
Taylor expanded in a2 around -inf
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
unpow2N/A
associate-/l*N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6427.2
Simplified27.2%
if -1.00000000000000003e-306 < (+.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.6%
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-sqrt.f6484.5
Simplified84.5%
Final simplification67.5%
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 (<= (+ (* (* a1_m a1_m) t_1) (* (* a2 a2) t_1)) -1e-306)
(- (/ (* a2 a2) (sqrt 2.0)))
(/ (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) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1_m * a1_m) * t_1) + ((a2 * a2) * t_1)) <= -1e-306) {
tmp = -((a2 * a2) / sqrt(2.0));
} else {
tmp = fma(a1_m, a1_m, (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(Float64(a1_m * a1_m) * t_1) + Float64(Float64(a2 * a2) * t_1)) <= -1e-306) tmp = Float64(-Float64(Float64(a2 * a2) / sqrt(2.0))); else tmp = Float64(fma(a1_m, a1_m, Float64(a2 * 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[(N[(a1$95$m * a1$95$m), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -1e-306], (-N[(N[(a2 * a2), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), N[(N[(a1$95$m * a1$95$m + N[(a2 * a2), $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}\;\left(a1\_m \cdot a1\_m\right) \cdot t\_1 + \left(a2 \cdot a2\right) \cdot t\_1 \leq -1 \cdot 10^{-306}:\\
\;\;\;\;-\frac{a2 \cdot a2}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\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))) < -1.00000000000000003e-306Initial program 99.5%
Taylor expanded in th around 0
cube-multN/A
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6428.7
Simplified28.7%
Taylor expanded in a2 around -inf
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-sqrt.f6428.7
Simplified28.7%
if -1.00000000000000003e-306 < (+.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.6%
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-sqrt.f6484.5
Simplified84.5%
Final simplification67.9%
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 (/ (* a2 a2) (sqrt 2.0))) (t_2 (/ (cos th) (sqrt 2.0)))) (if (<= (+ (* (* a1_m a1_m) t_2) (* (* a2 a2) t_2)) -1e-306) (- t_1) t_1)))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = (a2 * a2) / sqrt(2.0);
double t_2 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1_m * a1_m) * t_2) + ((a2 * a2) * t_2)) <= -1e-306) {
tmp = -t_1;
} else {
tmp = t_1;
}
return tmp;
}
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
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (a2 * a2) / sqrt(2.0d0)
t_2 = cos(th) / sqrt(2.0d0)
if ((((a1_m * a1_m) * t_2) + ((a2 * a2) * t_2)) <= (-1d-306)) then
tmp = -t_1
else
tmp = t_1
end if
code = tmp
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
double t_1 = (a2 * a2) / Math.sqrt(2.0);
double t_2 = Math.cos(th) / Math.sqrt(2.0);
double tmp;
if ((((a1_m * a1_m) * t_2) + ((a2 * a2) * t_2)) <= -1e-306) {
tmp = -t_1;
} else {
tmp = t_1;
}
return tmp;
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): t_1 = (a2 * a2) / math.sqrt(2.0) t_2 = math.cos(th) / math.sqrt(2.0) tmp = 0 if (((a1_m * a1_m) * t_2) + ((a2 * a2) * t_2)) <= -1e-306: tmp = -t_1 else: tmp = t_1 return tmp
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(Float64(a2 * a2) / sqrt(2.0)) t_2 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(Float64(a1_m * a1_m) * t_2) + Float64(Float64(a2 * a2) * t_2)) <= -1e-306) tmp = Float64(-t_1); else tmp = t_1; end return tmp end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp_2 = code(a1_m, a2, th)
t_1 = (a2 * a2) / sqrt(2.0);
t_2 = cos(th) / sqrt(2.0);
tmp = 0.0;
if ((((a1_m * a1_m) * t_2) + ((a2 * a2) * t_2)) <= -1e-306)
tmp = -t_1;
else
tmp = t_1;
end
tmp_2 = 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[(a2 * a2), $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[(N[(a1$95$m * a1$95$m), $MachinePrecision] * t$95$2), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision], -1e-306], (-t$95$1), t$95$1]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{a2 \cdot a2}{\sqrt{2}}\\
t_2 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;\left(a1\_m \cdot a1\_m\right) \cdot t\_2 + \left(a2 \cdot a2\right) \cdot t\_2 \leq -1 \cdot 10^{-306}:\\
\;\;\;\;-t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\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))) < -1.00000000000000003e-306Initial program 99.5%
Taylor expanded in th around 0
cube-multN/A
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6428.7
Simplified28.7%
Taylor expanded in a2 around -inf
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-sqrt.f6428.7
Simplified28.7%
if -1.00000000000000003e-306 < (+.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.6%
Taylor expanded in th around 0
cube-multN/A
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6432.6
Simplified32.6%
Taylor expanded in a1 around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6452.0
Simplified52.0%
Final simplification45.1%
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.6%
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.6
Applied egg-rr99.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 (* (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.6%
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.6%
Final simplification99.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 (* (cos th) (/ (* 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) * ((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 = cos(th) * ((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 Math.cos(th) * ((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 math.cos(th) * ((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(cos(th) * Float64(Float64(a2 * 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 = cos(th) * ((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[(a2 * a2), $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{a2 \cdot a2}{\sqrt{2}}
\end{array}
Initial program 99.6%
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.6%
Taylor expanded in a1 around 0
unpow2N/A
lower-*.f6456.9
Simplified56.9%
Final simplification56.9%
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) (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) / 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) / 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.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.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 * 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 = (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[(a2 * a2), $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 a2}{\sqrt{2}}
\end{array}
Initial program 99.6%
Taylor expanded in th around 0
cube-multN/A
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6431.4
Simplified31.4%
Taylor expanded in a1 around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6436.9
Simplified36.9%
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 (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 / 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 / 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.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.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(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 = 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[(a2 * N[(a2 / 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}{\sqrt{2}}
\end{array}
Initial program 99.6%
Taylor expanded in th around 0
cube-multN/A
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6431.4
Simplified31.4%
Taylor expanded in a1 around -inf
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
unpow2N/A
associate-/l*N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f6423.5
Simplified23.5%
Taylor expanded in a1 around 0
unpow2N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f6437.0
Simplified37.0%
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 (/ a1_m (sqrt 2.0)))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return a1_m / 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 = a1_m / 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 a1_m / 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 a1_m / 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(a1_m / 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 = a1_m / 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[(a1$95$m / 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{a1\_m}{\sqrt{2}}
\end{array}
Initial program 99.6%
Taylor expanded in th around 0
cube-multN/A
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6431.4
Simplified31.4%
Taylor expanded in a2 around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6436.6
Simplified36.6%
Taylor expanded in a1 around 0
lower-/.f64N/A
lower-sqrt.f643.6
Simplified3.6%
herbie shell --seed 2024214
(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))))