
(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}
(FPCore (a1 a2 th) :precision binary64 (* (* (sqrt 0.5) (cos th)) (+ (* a2 a2) (* a1 a1))))
double code(double a1, double a2, double th) {
return (sqrt(0.5) * cos(th)) * ((a2 * a2) + (a1 * a1));
}
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)) * ((a2 * a2) + (a1 * a1))
end function
public static double code(double a1, double a2, double th) {
return (Math.sqrt(0.5) * Math.cos(th)) * ((a2 * a2) + (a1 * a1));
}
def code(a1, a2, th): return (math.sqrt(0.5) * math.cos(th)) * ((a2 * a2) + (a1 * a1))
function code(a1, a2, th) return Float64(Float64(sqrt(0.5) * cos(th)) * Float64(Float64(a2 * a2) + Float64(a1 * a1))) end
function tmp = code(a1, a2, th) tmp = (sqrt(0.5) * cos(th)) * ((a2 * a2) + (a1 * a1)); end
code[a1_, a2_, th_] := N[(N[(N[Sqrt[0.5], $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(N[(a2 * a2), $MachinePrecision] + N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\sqrt{0.5} \cdot \cos th\right) \cdot \left(a2 \cdot a2 + a1 \cdot a1\right)
\end{array}
Initial program 99.5%
+-commutative99.5%
distribute-lft-out99.5%
Simplified99.5%
clear-num99.5%
associate-/r/99.5%
pow1/299.5%
pow-flip99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in th around inf 99.7%
*-commutative99.7%
Simplified99.7%
Final simplification99.7%
(FPCore (a1 a2 th) :precision binary64 (* (cos th) (* (sqrt 0.5) (+ (* a2 a2) (* a1 a1)))))
double code(double a1, double a2, double th) {
return cos(th) * (sqrt(0.5) * ((a2 * a2) + (a1 * a1)));
}
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) * (sqrt(0.5d0) * ((a2 * a2) + (a1 * a1)))
end function
public static double code(double a1, double a2, double th) {
return Math.cos(th) * (Math.sqrt(0.5) * ((a2 * a2) + (a1 * a1)));
}
def code(a1, a2, th): return math.cos(th) * (math.sqrt(0.5) * ((a2 * a2) + (a1 * a1)))
function code(a1, a2, th) return Float64(cos(th) * Float64(sqrt(0.5) * Float64(Float64(a2 * a2) + Float64(a1 * a1)))) end
function tmp = code(a1, a2, th) tmp = cos(th) * (sqrt(0.5) * ((a2 * a2) + (a1 * a1))); end
code[a1_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[Sqrt[0.5], $MachinePrecision] * N[(N[(a2 * a2), $MachinePrecision] + N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos th \cdot \left(\sqrt{0.5} \cdot \left(a2 \cdot a2 + a1 \cdot a1\right)\right)
\end{array}
Initial program 99.5%
+-commutative99.5%
distribute-lft-out99.5%
Simplified99.5%
clear-num99.5%
associate-/r/99.5%
pow1/299.5%
pow-flip99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in th around inf 99.7%
*-commutative99.7%
Simplified99.7%
Taylor expanded in th around inf 99.6%
unpow299.6%
unpow299.6%
+-commutative99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (a1 a2 th) :precision binary64 (* a2 (* a2 (/ (cos th) (sqrt 2.0)))))
double code(double a1, double a2, double th) {
return a2 * (a2 * (cos(th) / 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 * (cos(th) / sqrt(2.0d0)))
end function
public static double code(double a1, double a2, double th) {
return a2 * (a2 * (Math.cos(th) / Math.sqrt(2.0)));
}
def code(a1, a2, th): return a2 * (a2 * (math.cos(th) / math.sqrt(2.0)))
function code(a1, a2, th) return Float64(a2 * Float64(a2 * Float64(cos(th) / sqrt(2.0)))) end
function tmp = code(a1, a2, th) tmp = a2 * (a2 * (cos(th) / sqrt(2.0))); end
code[a1_, a2_, th_] := N[(a2 * N[(a2 * N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
a2 \cdot \left(a2 \cdot \frac{\cos th}{\sqrt{2}}\right)
\end{array}
Initial program 99.5%
+-commutative99.5%
distribute-lft-out99.5%
Simplified99.5%
Taylor expanded in a2 around inf 60.8%
unpow260.8%
associate-*r/60.7%
associate-*r*60.7%
Simplified60.7%
Final simplification60.7%
(FPCore (a1 a2 th) :precision binary64 (* (* (sqrt 0.5) (cos th)) (* a2 a2)))
double code(double a1, double a2, double th) {
return (sqrt(0.5) * cos(th)) * (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)) * (a2 * a2)
end function
public static double code(double a1, double a2, double th) {
return (Math.sqrt(0.5) * Math.cos(th)) * (a2 * a2);
}
def code(a1, a2, th): return (math.sqrt(0.5) * math.cos(th)) * (a2 * a2)
function code(a1, a2, th) return Float64(Float64(sqrt(0.5) * cos(th)) * Float64(a2 * a2)) end
function tmp = code(a1, a2, th) tmp = (sqrt(0.5) * cos(th)) * (a2 * a2); end
code[a1_, a2_, th_] := N[(N[(N[Sqrt[0.5], $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\sqrt{0.5} \cdot \cos th\right) \cdot \left(a2 \cdot a2\right)
\end{array}
Initial program 99.5%
distribute-lft-out99.5%
cos-neg99.5%
associate-*l/99.6%
cos-neg99.6%
fma-def99.6%
Simplified99.6%
Taylor expanded in a1 around 0 60.8%
unpow260.8%
*-commutative60.8%
Simplified60.8%
div-inv60.7%
*-commutative60.7%
associate-*l*60.7%
*-commutative60.7%
add-sqr-sqrt60.7%
sqrt-unprod60.7%
frac-times60.7%
metadata-eval60.7%
add-sqr-sqrt60.8%
metadata-eval60.8%
Applied egg-rr60.8%
Final simplification60.8%
(FPCore (a1 a2 th) :precision binary64 (/ (* (cos th) a2) (/ (sqrt 2.0) a2)))
double code(double a1, double a2, double th) {
return (cos(th) * 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 = (cos(th) * a2) / (sqrt(2.0d0) / a2)
end function
public static double code(double a1, double a2, double th) {
return (Math.cos(th) * a2) / (Math.sqrt(2.0) / a2);
}
def code(a1, a2, th): return (math.cos(th) * a2) / (math.sqrt(2.0) / a2)
function code(a1, a2, th) return Float64(Float64(cos(th) * a2) / Float64(sqrt(2.0) / a2)) end
function tmp = code(a1, a2, th) tmp = (cos(th) * a2) / (sqrt(2.0) / a2); end
code[a1_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] / a2), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos th \cdot a2}{\frac{\sqrt{2}}{a2}}
\end{array}
Initial program 99.5%
+-commutative99.5%
distribute-lft-out99.5%
Simplified99.5%
Taylor expanded in a2 around inf 60.8%
unpow260.8%
associate-*l/60.7%
Simplified60.7%
*-commutative60.7%
associate-/l*60.8%
associate-*r/60.8%
Applied egg-rr60.8%
Final simplification60.8%
(FPCore (a1 a2 th)
:precision binary64
(let* ((t_1 (+ (* a2 a2) (* a1 a1))))
(if (<= (* a2 a2) 1e+213)
(* (sqrt 0.5) t_1)
(* t_1 (* (sqrt 0.5) (+ 1.0 (* -0.5 (* th th))))))))
double code(double a1, double a2, double th) {
double t_1 = (a2 * a2) + (a1 * a1);
double tmp;
if ((a2 * a2) <= 1e+213) {
tmp = sqrt(0.5) * t_1;
} else {
tmp = t_1 * (sqrt(0.5) * (1.0 + (-0.5 * (th * th))));
}
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 = (a2 * a2) + (a1 * a1)
if ((a2 * a2) <= 1d+213) then
tmp = sqrt(0.5d0) * t_1
else
tmp = t_1 * (sqrt(0.5d0) * (1.0d0 + ((-0.5d0) * (th * th))))
end if
code = tmp
end function
public static double code(double a1, double a2, double th) {
double t_1 = (a2 * a2) + (a1 * a1);
double tmp;
if ((a2 * a2) <= 1e+213) {
tmp = Math.sqrt(0.5) * t_1;
} else {
tmp = t_1 * (Math.sqrt(0.5) * (1.0 + (-0.5 * (th * th))));
}
return tmp;
}
def code(a1, a2, th): t_1 = (a2 * a2) + (a1 * a1) tmp = 0 if (a2 * a2) <= 1e+213: tmp = math.sqrt(0.5) * t_1 else: tmp = t_1 * (math.sqrt(0.5) * (1.0 + (-0.5 * (th * th)))) return tmp
function code(a1, a2, th) t_1 = Float64(Float64(a2 * a2) + Float64(a1 * a1)) tmp = 0.0 if (Float64(a2 * a2) <= 1e+213) tmp = Float64(sqrt(0.5) * t_1); else tmp = Float64(t_1 * Float64(sqrt(0.5) * Float64(1.0 + Float64(-0.5 * Float64(th * th))))); end return tmp end
function tmp_2 = code(a1, a2, th) t_1 = (a2 * a2) + (a1 * a1); tmp = 0.0; if ((a2 * a2) <= 1e+213) tmp = sqrt(0.5) * t_1; else tmp = t_1 * (sqrt(0.5) * (1.0 + (-0.5 * (th * th)))); end tmp_2 = tmp; end
code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[(a2 * a2), $MachinePrecision] + N[(a1 * a1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a2 * a2), $MachinePrecision], 1e+213], N[(N[Sqrt[0.5], $MachinePrecision] * t$95$1), $MachinePrecision], N[(t$95$1 * N[(N[Sqrt[0.5], $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(th * th), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a2 \cdot a2 + a1 \cdot a1\\
\mathbf{if}\;a2 \cdot a2 \leq 10^{+213}:\\
\;\;\;\;\sqrt{0.5} \cdot t_1\\
\mathbf{else}:\\
\;\;\;\;t_1 \cdot \left(\sqrt{0.5} \cdot \left(1 + -0.5 \cdot \left(th \cdot th\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 a2 a2) < 9.99999999999999984e212Initial program 99.4%
+-commutative99.4%
distribute-lft-out99.4%
Simplified99.4%
clear-num99.4%
associate-/r/99.3%
pow1/299.3%
pow-flip99.5%
metadata-eval99.5%
Applied egg-rr99.5%
Taylor expanded in th around 0 64.0%
if 9.99999999999999984e212 < (*.f64 a2 a2) Initial program 99.8%
+-commutative99.8%
distribute-lft-out99.8%
Simplified99.8%
clear-num99.8%
associate-/r/99.8%
pow1/299.8%
pow-flip99.9%
metadata-eval99.9%
Applied egg-rr99.9%
Taylor expanded in th around 0 73.3%
*-lft-identity73.3%
associate-*r*73.3%
distribute-rgt-out73.3%
unpow273.3%
Simplified73.3%
Final simplification67.0%
(FPCore (a1 a2 th) :precision binary64 (* (sqrt 0.5) (+ (* a2 a2) (* a1 a1))))
double code(double a1, double a2, double th) {
return sqrt(0.5) * ((a2 * a2) + (a1 * a1));
}
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) * ((a2 * a2) + (a1 * a1))
end function
public static double code(double a1, double a2, double th) {
return Math.sqrt(0.5) * ((a2 * a2) + (a1 * a1));
}
def code(a1, a2, th): return math.sqrt(0.5) * ((a2 * a2) + (a1 * a1))
function code(a1, a2, th) return Float64(sqrt(0.5) * Float64(Float64(a2 * a2) + Float64(a1 * a1))) end
function tmp = code(a1, a2, th) tmp = sqrt(0.5) * ((a2 * a2) + (a1 * a1)); end
code[a1_, a2_, th_] := N[(N[Sqrt[0.5], $MachinePrecision] * N[(N[(a2 * a2), $MachinePrecision] + N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{0.5} \cdot \left(a2 \cdot a2 + a1 \cdot a1\right)
\end{array}
Initial program 99.5%
+-commutative99.5%
distribute-lft-out99.5%
Simplified99.5%
clear-num99.5%
associate-/r/99.5%
pow1/299.5%
pow-flip99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in th around 0 64.0%
Final simplification64.0%
(FPCore (a1 a2 th) :precision binary64 (* a1 (/ a1 (sqrt 2.0))))
double code(double a1, double a2, double th) {
return a1 * (a1 / 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 = a1 * (a1 / sqrt(2.0d0))
end function
public static double code(double a1, double a2, double th) {
return a1 * (a1 / Math.sqrt(2.0));
}
def code(a1, a2, th): return a1 * (a1 / math.sqrt(2.0))
function code(a1, a2, th) return Float64(a1 * Float64(a1 / sqrt(2.0))) end
function tmp = code(a1, a2, th) tmp = a1 * (a1 / sqrt(2.0)); end
code[a1_, a2_, th_] := N[(a1 * N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
a1 \cdot \frac{a1}{\sqrt{2}}
\end{array}
Initial program 99.5%
+-commutative99.5%
distribute-lft-out99.5%
Simplified99.5%
Taylor expanded in th around 0 63.9%
Taylor expanded in a2 around 0 36.3%
unpow236.3%
Simplified36.3%
Taylor expanded in a1 around 0 36.3%
unpow236.3%
associate-*r/36.3%
Simplified36.3%
Final simplification36.3%
(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}
Initial program 99.5%
+-commutative99.5%
distribute-lft-out99.5%
Simplified99.5%
Taylor expanded in th around 0 63.9%
Taylor expanded in a2 around inf 41.7%
unpow241.7%
associate-*r/41.7%
Simplified41.7%
expm1-log1p-u29.0%
expm1-udef24.7%
div-inv24.7%
add-sqr-sqrt24.7%
sqrt-unprod24.7%
frac-times24.7%
metadata-eval24.7%
add-sqr-sqrt24.7%
metadata-eval24.7%
Applied egg-rr24.7%
expm1-def28.9%
expm1-log1p41.8%
*-commutative41.8%
Simplified41.8%
Final simplification41.8%
(FPCore (a1 a2 th) :precision binary64 (* (sqrt 0.5) (* a2 a2)))
double code(double a1, double a2, double th) {
return sqrt(0.5) * (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) * (a2 * a2)
end function
public static double code(double a1, double a2, double th) {
return Math.sqrt(0.5) * (a2 * a2);
}
def code(a1, a2, th): return math.sqrt(0.5) * (a2 * a2)
function code(a1, a2, th) return Float64(sqrt(0.5) * Float64(a2 * a2)) end
function tmp = code(a1, a2, th) tmp = sqrt(0.5) * (a2 * a2); end
code[a1_, a2_, th_] := N[(N[Sqrt[0.5], $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{0.5} \cdot \left(a2 \cdot a2\right)
\end{array}
Initial program 99.5%
distribute-lft-out99.5%
cos-neg99.5%
associate-*l/99.6%
cos-neg99.6%
fma-def99.6%
Simplified99.6%
Taylor expanded in a1 around 0 60.8%
unpow260.8%
*-commutative60.8%
Simplified60.8%
div-inv60.7%
*-commutative60.7%
associate-*l*60.7%
*-commutative60.7%
add-sqr-sqrt60.7%
sqrt-unprod60.7%
frac-times60.7%
metadata-eval60.7%
add-sqr-sqrt60.8%
metadata-eval60.8%
Applied egg-rr60.8%
Taylor expanded in th around 0 41.8%
unpow241.8%
*-commutative41.8%
Simplified41.8%
Final simplification41.8%
herbie shell --seed 2023278
(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))))