Migdal et al, Equation (64)

Percentage Accurate: 99.5% → 99.6%
Time: 11.1s
Alternatives: 13
Speedup: 1.9×

Specification

?
\[\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} \]
(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:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 13 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.5% accurate, 1.0× speedup?

\[\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} \]
(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}

Alternative 1: 99.6% accurate, 1.0× speedup?

\[\begin{array}{l} a2_m = \left|a2\right| \\ a1_m = \left|a1\right| \\ [a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\ \\ 0.5 \cdot \mathsf{fma}\left(\left(\cos th \cdot a2\_m\right) \cdot \sqrt{2}, a2\_m, \left(a1\_m \cdot \sqrt{2}\right) \cdot \left(a1\_m \cdot \cos th\right)\right) \end{array} \]
a2_m = (fabs.f64 a2)
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2_m th)
 :precision binary64
 (*
  0.5
  (fma
   (* (* (cos th) a2_m) (sqrt 2.0))
   a2_m
   (* (* a1_m (sqrt 2.0)) (* a1_m (cos th))))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
	return 0.5 * fma(((cos(th) * a2_m) * sqrt(2.0)), a2_m, ((a1_m * sqrt(2.0)) * (a1_m * cos(th))));
}
a2_m = abs(a2)
a1_m = abs(a1)
a1_m, a2_m, th = sort([a1_m, a2_m, th])
function code(a1_m, a2_m, th)
	return Float64(0.5 * fma(Float64(Float64(cos(th) * a2_m) * sqrt(2.0)), a2_m, Float64(Float64(a1_m * sqrt(2.0)) * Float64(a1_m * cos(th)))))
end
a2_m = N[Abs[a2], $MachinePrecision]
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2$95$m_, th_] := N[(0.5 * N[(N[(N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m + N[(N[(a1$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a1$95$m * N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
0.5 \cdot \mathsf{fma}\left(\left(\cos th \cdot a2\_m\right) \cdot \sqrt{2}, a2\_m, \left(a1\_m \cdot \sqrt{2}\right) \cdot \left(a1\_m \cdot \cos th\right)\right)
\end{array}
Derivation
  1. Initial program 99.6%

    \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. lift-+.f64N/A

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right)} \]
    2. lift-*.f64N/A

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right)} + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
    3. lift-/.f64N/A

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
    4. associate-*l/N/A

      \[\leadsto \color{blue}{\frac{\cos th \cdot \left(a1 \cdot a1\right)}{\sqrt{2}}} + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
    5. lift-*.f64N/A

      \[\leadsto \frac{\cos th \cdot \left(a1 \cdot a1\right)}{\sqrt{2}} + \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right)} \]
    6. lift-/.f64N/A

      \[\leadsto \frac{\cos th \cdot \left(a1 \cdot a1\right)}{\sqrt{2}} + \color{blue}{\frac{\cos th}{\sqrt{2}}} \cdot \left(a2 \cdot a2\right) \]
    7. associate-*l/N/A

      \[\leadsto \frac{\cos th \cdot \left(a1 \cdot a1\right)}{\sqrt{2}} + \color{blue}{\frac{\cos th \cdot \left(a2 \cdot a2\right)}{\sqrt{2}}} \]
    8. frac-addN/A

      \[\leadsto \color{blue}{\frac{\left(\cos th \cdot \left(a1 \cdot a1\right)\right) \cdot \sqrt{2} + \sqrt{2} \cdot \left(\cos th \cdot \left(a2 \cdot a2\right)\right)}{\sqrt{2} \cdot \sqrt{2}}} \]
    9. lift-sqrt.f64N/A

      \[\leadsto \frac{\left(\cos th \cdot \left(a1 \cdot a1\right)\right) \cdot \sqrt{2} + \sqrt{2} \cdot \left(\cos th \cdot \left(a2 \cdot a2\right)\right)}{\color{blue}{\sqrt{2}} \cdot \sqrt{2}} \]
    10. lift-sqrt.f64N/A

      \[\leadsto \frac{\left(\cos th \cdot \left(a1 \cdot a1\right)\right) \cdot \sqrt{2} + \sqrt{2} \cdot \left(\cos th \cdot \left(a2 \cdot a2\right)\right)}{\sqrt{2} \cdot \color{blue}{\sqrt{2}}} \]
    11. rem-square-sqrtN/A

      \[\leadsto \frac{\left(\cos th \cdot \left(a1 \cdot a1\right)\right) \cdot \sqrt{2} + \sqrt{2} \cdot \left(\cos th \cdot \left(a2 \cdot a2\right)\right)}{\color{blue}{2}} \]
    12. div-invN/A

      \[\leadsto \color{blue}{\left(\left(\cos th \cdot \left(a1 \cdot a1\right)\right) \cdot \sqrt{2} + \sqrt{2} \cdot \left(\cos th \cdot \left(a2 \cdot a2\right)\right)\right) \cdot \frac{1}{2}} \]
    13. metadata-evalN/A

      \[\leadsto \left(\left(\cos th \cdot \left(a1 \cdot a1\right)\right) \cdot \sqrt{2} + \sqrt{2} \cdot \left(\cos th \cdot \left(a2 \cdot a2\right)\right)\right) \cdot \color{blue}{\frac{1}{2}} \]
    14. lower-*.f64N/A

      \[\leadsto \color{blue}{\left(\left(\cos th \cdot \left(a1 \cdot a1\right)\right) \cdot \sqrt{2} + \sqrt{2} \cdot \left(\cos th \cdot \left(a2 \cdot a2\right)\right)\right) \cdot \frac{1}{2}} \]
  4. Applied rewrites99.6%

    \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt{2} \cdot \left(a2 \cdot \cos th\right), a2, \left(a1 \cdot \cos th\right) \cdot \left(a1 \cdot \sqrt{2}\right)\right) \cdot 0.5} \]
  5. Final simplification99.6%

    \[\leadsto 0.5 \cdot \mathsf{fma}\left(\left(\cos th \cdot a2\right) \cdot \sqrt{2}, a2, \left(a1 \cdot \sqrt{2}\right) \cdot \left(a1 \cdot \cos th\right)\right) \]
  6. Add Preprocessing

Alternative 2: 78.1% accurate, 0.8× speedup?

\[\begin{array}{l} a2_m = \left|a2\right| \\ a1_m = \left|a1\right| \\ [a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\ \\ \begin{array}{l} t_1 := \frac{a2\_m}{\sqrt{2}} \cdot a2\_m\\ t_2 := \frac{\cos th}{\sqrt{2}}\\ \mathbf{if}\;t\_2 \cdot \left(a2\_m \cdot a2\_m\right) + t\_2 \cdot \left(a1\_m \cdot a1\_m\right) \leq -2 \cdot 10^{-186}:\\ \;\;\;\;t\_1 \cdot \left(\left(th \cdot th\right) \cdot -0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{a1\_m}{\sqrt{2}}, a1\_m, t\_1\right)\\ \end{array} \end{array} \]
a2_m = (fabs.f64 a2)
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2_m th)
 :precision binary64
 (let* ((t_1 (* (/ a2_m (sqrt 2.0)) a2_m)) (t_2 (/ (cos th) (sqrt 2.0))))
   (if (<= (+ (* t_2 (* a2_m a2_m)) (* t_2 (* a1_m a1_m))) -2e-186)
     (* t_1 (* (* th th) -0.5))
     (fma (/ a1_m (sqrt 2.0)) a1_m t_1))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
	double t_1 = (a2_m / sqrt(2.0)) * a2_m;
	double t_2 = cos(th) / sqrt(2.0);
	double tmp;
	if (((t_2 * (a2_m * a2_m)) + (t_2 * (a1_m * a1_m))) <= -2e-186) {
		tmp = t_1 * ((th * th) * -0.5);
	} else {
		tmp = fma((a1_m / sqrt(2.0)), a1_m, t_1);
	}
	return tmp;
}
a2_m = abs(a2)
a1_m = abs(a1)
a1_m, a2_m, th = sort([a1_m, a2_m, th])
function code(a1_m, a2_m, th)
	t_1 = Float64(Float64(a2_m / sqrt(2.0)) * a2_m)
	t_2 = Float64(cos(th) / sqrt(2.0))
	tmp = 0.0
	if (Float64(Float64(t_2 * Float64(a2_m * a2_m)) + Float64(t_2 * Float64(a1_m * a1_m))) <= -2e-186)
		tmp = Float64(t_1 * Float64(Float64(th * th) * -0.5));
	else
		tmp = fma(Float64(a1_m / sqrt(2.0)), a1_m, t_1);
	end
	return tmp
end
a2_m = N[Abs[a2], $MachinePrecision]
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2$95$m_, th_] := Block[{t$95$1 = N[(N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision]}, Block[{t$95$2 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$2 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-186], N[(t$95$1 * N[(N[(th * th), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision], N[(N[(a1$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a1$95$m + t$95$1), $MachinePrecision]]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\begin{array}{l}
t_1 := \frac{a2\_m}{\sqrt{2}} \cdot a2\_m\\
t_2 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_2 \cdot \left(a2\_m \cdot a2\_m\right) + t\_2 \cdot \left(a1\_m \cdot a1\_m\right) \leq -2 \cdot 10^{-186}:\\
\;\;\;\;t\_1 \cdot \left(\left(th \cdot th\right) \cdot -0.5\right)\\

\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a1\_m}{\sqrt{2}}, a1\_m, t\_1\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. 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.9999999999999998e-186

    1. Initial program 99.5%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
    2. Add Preprocessing
    3. Taylor expanded in a1 around 0

      \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]
    4. Step-by-step derivation
      1. *-commutativeN/A

        \[\leadsto \frac{\color{blue}{\cos th \cdot {a2}^{2}}}{\sqrt{2}} \]
      2. unpow2N/A

        \[\leadsto \frac{\cos th \cdot \color{blue}{\left(a2 \cdot a2\right)}}{\sqrt{2}} \]
      3. associate-*r*N/A

        \[\leadsto \frac{\color{blue}{\left(\cos th \cdot a2\right) \cdot a2}}{\sqrt{2}} \]
      4. associate-/l*N/A

        \[\leadsto \color{blue}{\left(\cos th \cdot a2\right) \cdot \frac{a2}{\sqrt{2}}} \]
      5. lower-*.f64N/A

        \[\leadsto \color{blue}{\left(\cos th \cdot a2\right) \cdot \frac{a2}{\sqrt{2}}} \]
      6. lower-*.f64N/A

        \[\leadsto \color{blue}{\left(\cos th \cdot a2\right)} \cdot \frac{a2}{\sqrt{2}} \]
      7. lower-cos.f64N/A

        \[\leadsto \left(\color{blue}{\cos th} \cdot a2\right) \cdot \frac{a2}{\sqrt{2}} \]
      8. lower-/.f64N/A

        \[\leadsto \left(\cos th \cdot a2\right) \cdot \color{blue}{\frac{a2}{\sqrt{2}}} \]
      9. lower-sqrt.f6499.0

        \[\leadsto \left(\cos th \cdot a2\right) \cdot \frac{a2}{\color{blue}{\sqrt{2}}} \]
    5. Applied rewrites99.0%

      \[\leadsto \color{blue}{\left(\cos th \cdot a2\right) \cdot \frac{a2}{\sqrt{2}}} \]
    6. Taylor expanded in th around 0

      \[\leadsto \frac{-1}{2} \cdot \frac{{a2}^{2} \cdot {th}^{2}}{\sqrt{2}} + \color{blue}{\frac{{a2}^{2}}{\sqrt{2}}} \]
    7. Step-by-step derivation
      1. Applied rewrites52.0%

        \[\leadsto \mathsf{fma}\left(-0.5, th \cdot th, 1\right) \cdot \color{blue}{\left(a2 \cdot \frac{a2}{\sqrt{2}}\right)} \]
      2. Taylor expanded in th around inf

        \[\leadsto \frac{-1}{2} \cdot \frac{{a2}^{2} \cdot {th}^{2}}{\color{blue}{\sqrt{2}}} \]
      3. Step-by-step derivation
        1. Applied rewrites52.0%

          \[\leadsto \left(-0.5 \cdot \left(th \cdot th\right)\right) \cdot \left(a2 \cdot \color{blue}{\frac{a2}{\sqrt{2}}}\right) \]

        if -1.9999999999999998e-186 < (+.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. Initial program 99.6%

          \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
        2. Add Preprocessing
        3. Taylor expanded in th around 0

          \[\leadsto \color{blue}{\frac{{a1}^{2}}{\sqrt{2}} + \frac{{a2}^{2}}{\sqrt{2}}} \]
        4. Step-by-step derivation
          1. unpow2N/A

            \[\leadsto \frac{\color{blue}{a1 \cdot a1}}{\sqrt{2}} + \frac{{a2}^{2}}{\sqrt{2}} \]
          2. associate-*l/N/A

            \[\leadsto \color{blue}{\frac{a1}{\sqrt{2}} \cdot a1} + \frac{{a2}^{2}}{\sqrt{2}} \]
          3. lower-fma.f64N/A

            \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{a1}{\sqrt{2}}, a1, \frac{{a2}^{2}}{\sqrt{2}}\right)} \]
          4. lower-/.f64N/A

            \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{a1}{\sqrt{2}}}, a1, \frac{{a2}^{2}}{\sqrt{2}}\right) \]
          5. lower-sqrt.f64N/A

            \[\leadsto \mathsf{fma}\left(\frac{a1}{\color{blue}{\sqrt{2}}}, a1, \frac{{a2}^{2}}{\sqrt{2}}\right) \]
          6. unpow2N/A

            \[\leadsto \mathsf{fma}\left(\frac{a1}{\sqrt{2}}, a1, \frac{\color{blue}{a2 \cdot a2}}{\sqrt{2}}\right) \]
          7. associate-*l/N/A

            \[\leadsto \mathsf{fma}\left(\frac{a1}{\sqrt{2}}, a1, \color{blue}{\frac{a2}{\sqrt{2}} \cdot a2}\right) \]
          8. lower-*.f64N/A

            \[\leadsto \mathsf{fma}\left(\frac{a1}{\sqrt{2}}, a1, \color{blue}{\frac{a2}{\sqrt{2}} \cdot a2}\right) \]
          9. lower-/.f64N/A

            \[\leadsto \mathsf{fma}\left(\frac{a1}{\sqrt{2}}, a1, \color{blue}{\frac{a2}{\sqrt{2}}} \cdot a2\right) \]
          10. lower-sqrt.f6485.3

            \[\leadsto \mathsf{fma}\left(\frac{a1}{\sqrt{2}}, a1, \frac{a2}{\color{blue}{\sqrt{2}}} \cdot a2\right) \]
        5. Applied rewrites85.3%

          \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{a1}{\sqrt{2}}, a1, \frac{a2}{\sqrt{2}} \cdot a2\right)} \]
      4. Recombined 2 regimes into one program.
      5. Final simplification78.1%

        \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) \leq -2 \cdot 10^{-186}:\\ \;\;\;\;\left(\frac{a2}{\sqrt{2}} \cdot a2\right) \cdot \left(\left(th \cdot th\right) \cdot -0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{a1}{\sqrt{2}}, a1, \frac{a2}{\sqrt{2}} \cdot a2\right)\\ \end{array} \]
      6. Add Preprocessing

      Reproduce

      ?
      herbie shell --seed 2024234 
      (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))))