Migdal et al, Equation (64)

Percentage Accurate: 99.6% → 99.6%
Time: 10.5s
Alternatives: 10
Speedup: 2.0×

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 10 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.6% 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, 2.0× speedup?

\[\begin{array}{l} \\ \left(\sqrt{0.5} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \end{array} \]
(FPCore (a1 a2 th)
 :precision binary64
 (* (* (sqrt 0.5) (cos th)) (+ (* a1 a1) (* a2 a2))))
double code(double a1, double a2, double th) {
	return (sqrt(0.5) * cos(th)) * ((a1 * a1) + (a2 * a2));
}

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = (sqrt(0.5d0) * cos(th)) * ((a1 * a1) + (a2 * a2))
end function

public static double code(double a1, double a2, double th) {
	return (Math.sqrt(0.5) * Math.cos(th)) * ((a1 * a1) + (a2 * a2));
}

def code(a1, a2, th):
	return (math.sqrt(0.5) * math.cos(th)) * ((a1 * a1) + (a2 * a2))

function code(a1, a2, th)
	return Float64(Float64(sqrt(0.5) * cos(th)) * Float64(Float64(a1 * a1) + Float64(a2 * a2)))
end

function tmp = code(a1, a2, th)
	tmp = (sqrt(0.5) * cos(th)) * ((a1 * a1) + (a2 * a2));
end

code[a1_, a2_, th_] := N[(N[(N[Sqrt[0.5], $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}

\\
\left(\sqrt{0.5} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 2: 57.4% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \frac{a2 \cdot \left(\cos th \cdot \frac{-a2}{\sqrt{2}}\right)}{-1} \end{array} \]
(FPCore (a1 a2 th)
 :precision binary64
 (/ (* a2 (* (cos th) (/ (- a2) (sqrt 2.0)))) -1.0))
double code(double a1, double a2, double th) {
	return (a2 * (cos(th) * (-a2 / sqrt(2.0)))) / -1.0;
}

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = (a2 * (cos(th) * (-a2 / sqrt(2.0d0)))) / (-1.0d0)
end function

public static double code(double a1, double a2, double th) {
	return (a2 * (Math.cos(th) * (-a2 / Math.sqrt(2.0)))) / -1.0;
}

def code(a1, a2, th):
	return (a2 * (math.cos(th) * (-a2 / math.sqrt(2.0)))) / -1.0

function code(a1, a2, th)
	return Float64(Float64(a2 * Float64(cos(th) * Float64(Float64(-a2) / sqrt(2.0)))) / -1.0)
end

function tmp = code(a1, a2, th)
	tmp = (a2 * (cos(th) * (-a2 / sqrt(2.0)))) / -1.0;
end

code[a1_, a2_, th_] := N[(N[(a2 * N[(N[Cos[th], $MachinePrecision] * N[((-a2) / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / -1.0), $MachinePrecision]

\begin{array}{l}

\\
\frac{a2 \cdot \left(\cos th \cdot \frac{-a2}{\sqrt{2}}\right)}{-1}
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 3: 57.4% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \cos th \cdot \left(a2 \cdot \left(\sqrt{0.5} \cdot a2\right)\right) \end{array} \]
(FPCore (a1 a2 th) :precision binary64 (* (cos th) (* a2 (* (sqrt 0.5) a2))))
double code(double a1, double a2, double th) {
	return cos(th) * (a2 * (sqrt(0.5) * a2));
}

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = cos(th) * (a2 * (sqrt(0.5d0) * a2))
end function

public static double code(double a1, double a2, double th) {
	return Math.cos(th) * (a2 * (Math.sqrt(0.5) * a2));
}

def code(a1, a2, th):
	return math.cos(th) * (a2 * (math.sqrt(0.5) * a2))

function code(a1, a2, th)
	return Float64(cos(th) * Float64(a2 * Float64(sqrt(0.5) * a2)))
end

function tmp = code(a1, a2, th)
	tmp = cos(th) * (a2 * (sqrt(0.5) * a2));
end

code[a1_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(a2 * N[(N[Sqrt[0.5], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}

\\
\cos th \cdot \left(a2 \cdot \left(\sqrt{0.5} \cdot a2\right)\right)
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 4: 57.4% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \cos th \cdot \left(a2 \cdot \frac{a2}{\sqrt{2}}\right) \end{array} \]
(FPCore (a1 a2 th) :precision binary64 (* (cos th) (* a2 (/ a2 (sqrt 2.0)))))
double code(double a1, double a2, double th) {
	return cos(th) * (a2 * (a2 / sqrt(2.0)));
}

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = cos(th) * (a2 * (a2 / sqrt(2.0d0)))
end function

public static double code(double a1, double a2, double th) {
	return Math.cos(th) * (a2 * (a2 / Math.sqrt(2.0)));
}

def code(a1, a2, th):
	return math.cos(th) * (a2 * (a2 / math.sqrt(2.0)))

function code(a1, a2, th)
	return Float64(cos(th) * Float64(a2 * Float64(a2 / sqrt(2.0))))
end

function tmp = code(a1, a2, th)
	tmp = cos(th) * (a2 * (a2 / sqrt(2.0)));
end

code[a1_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(a2 * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}

\\
\cos th \cdot \left(a2 \cdot \frac{a2}{\sqrt{2}}\right)
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 5: 39.9% accurate, 3.7× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\sqrt{2}}{a2}\\ \mathbf{if}\;th \leq 3.1 \cdot 10^{+125}:\\ \;\;\;\;\frac{a2}{t_1}\\ \mathbf{elif}\;th \leq 7.5 \cdot 10^{+219} \lor \neg \left(th \leq 1.1 \cdot 10^{+241}\right):\\ \;\;\;\;\frac{-a2}{t_1}\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \left(a2 \cdot \frac{1}{\sqrt{2}}\right)\\ \end{array} \end{array} \]
(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (/ (sqrt 2.0) a2)))
   (if (<= th 3.1e+125)
     (/ a2 t_1)
     (if (or (<= th 7.5e+219) (not (<= th 1.1e+241)))
       (/ (- a2) t_1)
       (* a2 (* a2 (/ 1.0 (sqrt 2.0))))))))
double code(double a1, double a2, double th) {
	double t_1 = sqrt(2.0) / a2;
	double tmp;
	if (th <= 3.1e+125) {
		tmp = a2 / t_1;
	} else if ((th <= 7.5e+219) || !(th <= 1.1e+241)) {
		tmp = -a2 / t_1;
	} else {
		tmp = a2 * (a2 * (1.0 / sqrt(2.0)));
	}
	return tmp;
}

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
    real(8) :: tmp
    t_1 = sqrt(2.0d0) / a2
    if (th <= 3.1d+125) then
        tmp = a2 / t_1
    else if ((th <= 7.5d+219) .or. (.not. (th <= 1.1d+241))) then
        tmp = -a2 / t_1
    else
        tmp = a2 * (a2 * (1.0d0 / sqrt(2.0d0)))
    end if
    code = tmp
end function

public static double code(double a1, double a2, double th) {
	double t_1 = Math.sqrt(2.0) / a2;
	double tmp;
	if (th <= 3.1e+125) {
		tmp = a2 / t_1;
	} else if ((th <= 7.5e+219) || !(th <= 1.1e+241)) {
		tmp = -a2 / t_1;
	} else {
		tmp = a2 * (a2 * (1.0 / Math.sqrt(2.0)));
	}
	return tmp;
}

def code(a1, a2, th):
	t_1 = math.sqrt(2.0) / a2
	tmp = 0
	if th <= 3.1e+125:
		tmp = a2 / t_1
	elif (th <= 7.5e+219) or not (th <= 1.1e+241):
		tmp = -a2 / t_1
	else:
		tmp = a2 * (a2 * (1.0 / math.sqrt(2.0)))
	return tmp

function code(a1, a2, th)
	t_1 = Float64(sqrt(2.0) / a2)
	tmp = 0.0
	if (th <= 3.1e+125)
		tmp = Float64(a2 / t_1);
	elseif ((th <= 7.5e+219) || !(th <= 1.1e+241))
		tmp = Float64(Float64(-a2) / t_1);
	else
		tmp = Float64(a2 * Float64(a2 * Float64(1.0 / sqrt(2.0))));
	end
	return tmp
end

function tmp_2 = code(a1, a2, th)
	t_1 = sqrt(2.0) / a2;
	tmp = 0.0;
	if (th <= 3.1e+125)
		tmp = a2 / t_1;
	elseif ((th <= 7.5e+219) || ~((th <= 1.1e+241)))
		tmp = -a2 / t_1;
	else
		tmp = a2 * (a2 * (1.0 / sqrt(2.0)));
	end
	tmp_2 = tmp;
end

code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Sqrt[2.0], $MachinePrecision] / a2), $MachinePrecision]}, If[LessEqual[th, 3.1e+125], N[(a2 / t$95$1), $MachinePrecision], If[Or[LessEqual[th, 7.5e+219], N[Not[LessEqual[th, 1.1e+241]], $MachinePrecision]], N[((-a2) / t$95$1), $MachinePrecision], N[(a2 * N[(a2 * N[(1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

\begin{array}{l}

\\
\begin{array}{l}
t_1 := \frac{\sqrt{2}}{a2}\\
\mathbf{if}\;th \leq 3.1 \cdot 10^{+125}:\\
\;\;\;\;\frac{a2}{t_1}\\

\mathbf{elif}\;th \leq 7.5 \cdot 10^{+219} \lor \neg \left(th \leq 1.1 \cdot 10^{+241}\right):\\
\;\;\;\;\frac{-a2}{t_1}\\

\mathbf{else}:\\
\;\;\;\;a2 \cdot \left(a2 \cdot \frac{1}{\sqrt{2}}\right)\\


\end{array}
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 6: 64.3% accurate, 3.7× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;th \leq 3.1 \cdot 10^{+125}:\\ \;\;\;\;\sqrt{0.5} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)\\ \mathbf{elif}\;th \leq 7.5 \cdot 10^{+219} \lor \neg \left(th \leq 1.1 \cdot 10^{+241}\right):\\ \;\;\;\;\frac{-a2}{\frac{\sqrt{2}}{a2}}\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \left(a2 \cdot \frac{1}{\sqrt{2}}\right)\\ \end{array} \end{array} \]
(FPCore (a1 a2 th)
 :precision binary64
 (if (<= th 3.1e+125)
   (* (sqrt 0.5) (+ (* a1 a1) (* a2 a2)))
   (if (or (<= th 7.5e+219) (not (<= th 1.1e+241)))
     (/ (- a2) (/ (sqrt 2.0) a2))
     (* a2 (* a2 (/ 1.0 (sqrt 2.0)))))))
double code(double a1, double a2, double th) {
	double tmp;
	if (th <= 3.1e+125) {
		tmp = sqrt(0.5) * ((a1 * a1) + (a2 * a2));
	} else if ((th <= 7.5e+219) || !(th <= 1.1e+241)) {
		tmp = -a2 / (sqrt(2.0) / a2);
	} else {
		tmp = a2 * (a2 * (1.0 / sqrt(2.0)));
	}
	return tmp;
}

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: tmp
    if (th <= 3.1d+125) then
        tmp = sqrt(0.5d0) * ((a1 * a1) + (a2 * a2))
    else if ((th <= 7.5d+219) .or. (.not. (th <= 1.1d+241))) then
        tmp = -a2 / (sqrt(2.0d0) / a2)
    else
        tmp = a2 * (a2 * (1.0d0 / sqrt(2.0d0)))
    end if
    code = tmp
end function

public static double code(double a1, double a2, double th) {
	double tmp;
	if (th <= 3.1e+125) {
		tmp = Math.sqrt(0.5) * ((a1 * a1) + (a2 * a2));
	} else if ((th <= 7.5e+219) || !(th <= 1.1e+241)) {
		tmp = -a2 / (Math.sqrt(2.0) / a2);
	} else {
		tmp = a2 * (a2 * (1.0 / Math.sqrt(2.0)));
	}
	return tmp;
}

def code(a1, a2, th):
	tmp = 0
	if th <= 3.1e+125:
		tmp = math.sqrt(0.5) * ((a1 * a1) + (a2 * a2))
	elif (th <= 7.5e+219) or not (th <= 1.1e+241):
		tmp = -a2 / (math.sqrt(2.0) / a2)
	else:
		tmp = a2 * (a2 * (1.0 / math.sqrt(2.0)))
	return tmp

function code(a1, a2, th)
	tmp = 0.0
	if (th <= 3.1e+125)
		tmp = Float64(sqrt(0.5) * Float64(Float64(a1 * a1) + Float64(a2 * a2)));
	elseif ((th <= 7.5e+219) || !(th <= 1.1e+241))
		tmp = Float64(Float64(-a2) / Float64(sqrt(2.0) / a2));
	else
		tmp = Float64(a2 * Float64(a2 * Float64(1.0 / sqrt(2.0))));
	end
	return tmp
end

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (th <= 3.1e+125)
		tmp = sqrt(0.5) * ((a1 * a1) + (a2 * a2));
	elseif ((th <= 7.5e+219) || ~((th <= 1.1e+241)))
		tmp = -a2 / (sqrt(2.0) / a2);
	else
		tmp = a2 * (a2 * (1.0 / sqrt(2.0)));
	end
	tmp_2 = tmp;
end

code[a1_, a2_, th_] := If[LessEqual[th, 3.1e+125], N[(N[Sqrt[0.5], $MachinePrecision] * N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[th, 7.5e+219], N[Not[LessEqual[th, 1.1e+241]], $MachinePrecision]], N[((-a2) / N[(N[Sqrt[2.0], $MachinePrecision] / a2), $MachinePrecision]), $MachinePrecision], N[(a2 * N[(a2 * N[(1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;th \leq 3.1 \cdot 10^{+125}:\\
\;\;\;\;\sqrt{0.5} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)\\

\mathbf{elif}\;th \leq 7.5 \cdot 10^{+219} \lor \neg \left(th \leq 1.1 \cdot 10^{+241}\right):\\
\;\;\;\;\frac{-a2}{\frac{\sqrt{2}}{a2}}\\

\mathbf{else}:\\
\;\;\;\;a2 \cdot \left(a2 \cdot \frac{1}{\sqrt{2}}\right)\\


\end{array}
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 7: 39.9% accurate, 3.7× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\sqrt{2}}{a2}\\ \mathbf{if}\;th \leq 3.1 \cdot 10^{+125}:\\ \;\;\;\;\frac{a2}{t_1}\\ \mathbf{elif}\;th \leq 7.5 \cdot 10^{+219} \lor \neg \left(th \leq 1.1 \cdot 10^{+241}\right):\\ \;\;\;\;\frac{-a2}{t_1}\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \left(\sqrt{0.5} \cdot a2\right)\\ \end{array} \end{array} \]
(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (/ (sqrt 2.0) a2)))
   (if (<= th 3.1e+125)
     (/ a2 t_1)
     (if (or (<= th 7.5e+219) (not (<= th 1.1e+241)))
       (/ (- a2) t_1)
       (* a2 (* (sqrt 0.5) a2))))))
double code(double a1, double a2, double th) {
	double t_1 = sqrt(2.0) / a2;
	double tmp;
	if (th <= 3.1e+125) {
		tmp = a2 / t_1;
	} else if ((th <= 7.5e+219) || !(th <= 1.1e+241)) {
		tmp = -a2 / t_1;
	} else {
		tmp = a2 * (sqrt(0.5) * a2);
	}
	return tmp;
}

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
    real(8) :: tmp
    t_1 = sqrt(2.0d0) / a2
    if (th <= 3.1d+125) then
        tmp = a2 / t_1
    else if ((th <= 7.5d+219) .or. (.not. (th <= 1.1d+241))) then
        tmp = -a2 / t_1
    else
        tmp = a2 * (sqrt(0.5d0) * a2)
    end if
    code = tmp
end function

public static double code(double a1, double a2, double th) {
	double t_1 = Math.sqrt(2.0) / a2;
	double tmp;
	if (th <= 3.1e+125) {
		tmp = a2 / t_1;
	} else if ((th <= 7.5e+219) || !(th <= 1.1e+241)) {
		tmp = -a2 / t_1;
	} else {
		tmp = a2 * (Math.sqrt(0.5) * a2);
	}
	return tmp;
}

def code(a1, a2, th):
	t_1 = math.sqrt(2.0) / a2
	tmp = 0
	if th <= 3.1e+125:
		tmp = a2 / t_1
	elif (th <= 7.5e+219) or not (th <= 1.1e+241):
		tmp = -a2 / t_1
	else:
		tmp = a2 * (math.sqrt(0.5) * a2)
	return tmp

function code(a1, a2, th)
	t_1 = Float64(sqrt(2.0) / a2)
	tmp = 0.0
	if (th <= 3.1e+125)
		tmp = Float64(a2 / t_1);
	elseif ((th <= 7.5e+219) || !(th <= 1.1e+241))
		tmp = Float64(Float64(-a2) / t_1);
	else
		tmp = Float64(a2 * Float64(sqrt(0.5) * a2));
	end
	return tmp
end

function tmp_2 = code(a1, a2, th)
	t_1 = sqrt(2.0) / a2;
	tmp = 0.0;
	if (th <= 3.1e+125)
		tmp = a2 / t_1;
	elseif ((th <= 7.5e+219) || ~((th <= 1.1e+241)))
		tmp = -a2 / t_1;
	else
		tmp = a2 * (sqrt(0.5) * a2);
	end
	tmp_2 = tmp;
end

code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Sqrt[2.0], $MachinePrecision] / a2), $MachinePrecision]}, If[LessEqual[th, 3.1e+125], N[(a2 / t$95$1), $MachinePrecision], If[Or[LessEqual[th, 7.5e+219], N[Not[LessEqual[th, 1.1e+241]], $MachinePrecision]], N[((-a2) / t$95$1), $MachinePrecision], N[(a2 * N[(N[Sqrt[0.5], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision]]]]

\begin{array}{l}

\\
\begin{array}{l}
t_1 := \frac{\sqrt{2}}{a2}\\
\mathbf{if}\;th \leq 3.1 \cdot 10^{+125}:\\
\;\;\;\;\frac{a2}{t_1}\\

\mathbf{elif}\;th \leq 7.5 \cdot 10^{+219} \lor \neg \left(th \leq 1.1 \cdot 10^{+241}\right):\\
\;\;\;\;\frac{-a2}{t_1}\\

\mathbf{else}:\\
\;\;\;\;a2 \cdot \left(\sqrt{0.5} \cdot a2\right)\\


\end{array}
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 8: 39.6% accurate, 4.0× speedup?

\[\begin{array}{l} \\ a2 \cdot \left(\sqrt{0.5} \cdot a2\right) \end{array} \]
(FPCore (a1 a2 th) :precision binary64 (* a2 (* (sqrt 0.5) a2)))
double code(double a1, double a2, double th) {
	return a2 * (sqrt(0.5) * a2);
}

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = a2 * (sqrt(0.5d0) * a2)
end function

public static double code(double a1, double a2, double th) {
	return a2 * (Math.sqrt(0.5) * a2);
}

def code(a1, a2, th):
	return a2 * (math.sqrt(0.5) * a2)

function code(a1, a2, th)
	return Float64(a2 * Float64(sqrt(0.5) * a2))
end

function tmp = code(a1, a2, th)
	tmp = a2 * (sqrt(0.5) * a2);
end

code[a1_, a2_, th_] := N[(a2 * N[(N[Sqrt[0.5], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}

\\
a2 \cdot \left(\sqrt{0.5} \cdot a2\right)
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 9: 39.6% accurate, 4.0× speedup?

\[\begin{array}{l} \\ a2 \cdot \frac{a2}{\sqrt{2}} \end{array} \]
(FPCore (a1 a2 th) :precision binary64 (* a2 (/ a2 (sqrt 2.0))))
double code(double a1, double a2, double th) {
	return a2 * (a2 / sqrt(2.0));
}

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = a2 * (a2 / sqrt(2.0d0))
end function

public static double code(double a1, double a2, double th) {
	return a2 * (a2 / Math.sqrt(2.0));
}

def code(a1, a2, th):
	return a2 * (a2 / math.sqrt(2.0))

function code(a1, a2, th)
	return Float64(a2 * Float64(a2 / sqrt(2.0)))
end

function tmp = code(a1, a2, th)
	tmp = a2 * (a2 / sqrt(2.0));
end

code[a1_, a2_, th_] := N[(a2 * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}

\\
a2 \cdot \frac{a2}{\sqrt{2}}
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 10: 39.6% accurate, 4.0× speedup?

\[\begin{array}{l} \\ \frac{a2}{\frac{\sqrt{2}}{a2}} \end{array} \]
(FPCore (a1 a2 th) :precision binary64 (/ a2 (/ (sqrt 2.0) a2)))
double code(double a1, double a2, double th) {
	return a2 / (sqrt(2.0) / a2);
}

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = a2 / (sqrt(2.0d0) / a2)
end function

public static double code(double a1, double a2, double th) {
	return a2 / (Math.sqrt(2.0) / a2);
}

def code(a1, a2, th):
	return a2 / (math.sqrt(2.0) / a2)

function code(a1, a2, th)
	return Float64(a2 / Float64(sqrt(2.0) / a2))
end

function tmp = code(a1, a2, th)
	tmp = a2 / (sqrt(2.0) / a2);
end

code[a1_, a2_, th_] := N[(a2 / N[(N[Sqrt[2.0], $MachinePrecision] / a2), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}

\\
\frac{a2}{\frac{\sqrt{2}}{a2}}
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Reproduce

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