
(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 7 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 (* (/ (cos th) (sqrt 2.0)) (+ (* a2 a2) (* a1 a1))))
double code(double a1, double a2, double th) {
return (cos(th) / sqrt(2.0)) * ((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(2.0d0)) * ((a2 * a2) + (a1 * a1))
end function
public static double code(double a1, double a2, double th) {
return (Math.cos(th) / Math.sqrt(2.0)) * ((a2 * a2) + (a1 * a1));
}
def code(a1, a2, th): return (math.cos(th) / math.sqrt(2.0)) * ((a2 * a2) + (a1 * a1))
function code(a1, a2, th) return Float64(Float64(cos(th) / sqrt(2.0)) * Float64(Float64(a2 * a2) + Float64(a1 * a1))) end
function tmp = code(a1, a2, th) tmp = (cos(th) / sqrt(2.0)) * ((a2 * a2) + (a1 * a1)); end
code[a1_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(N[(a2 * a2), $MachinePrecision] + N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2 + a1 \cdot a1\right)
\end{array}
Initial program 99.6%
+-commutative99.6%
distribute-lft-out99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (a1 a2 th) :precision binary64 (* a2 (* (/ (cos th) (sqrt 2.0)) a2)))
double code(double a1, double a2, double th) {
return a2 * ((cos(th) / 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 * ((cos(th) / sqrt(2.0d0)) * a2)
end function
public static double code(double a1, double a2, double th) {
return a2 * ((Math.cos(th) / Math.sqrt(2.0)) * a2);
}
def code(a1, a2, th): return a2 * ((math.cos(th) / math.sqrt(2.0)) * a2)
function code(a1, a2, th) return Float64(a2 * Float64(Float64(cos(th) / sqrt(2.0)) * a2)) end
function tmp = code(a1, a2, th) tmp = a2 * ((cos(th) / sqrt(2.0)) * a2); end
code[a1_, a2_, th_] := N[(a2 * N[(N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
a2 \cdot \left(\frac{\cos th}{\sqrt{2}} \cdot a2\right)
\end{array}
Initial program 99.6%
+-commutative99.6%
distribute-lft-out99.6%
Simplified99.6%
Taylor expanded in a2 around inf 60.2%
unpow260.2%
associate-*r/60.3%
associate-*r*60.3%
Simplified60.3%
Final simplification60.3%
(FPCore (a1 a2 th)
:precision binary64
(if (<= th 3800000000.0)
(* (+ (* a2 a2) (* a1 a1)) (sqrt 0.5))
(if (or (<= th 1.5e+58) (not (<= th 1.5e+253)))
(* -0.5 (/ (* a2 a2) (/ (sqrt 2.0) (* th th))))
(/ 1.0 (/ (sqrt 2.0) (* a2 a2))))))
double code(double a1, double a2, double th) {
double tmp;
if (th <= 3800000000.0) {
tmp = ((a2 * a2) + (a1 * a1)) * sqrt(0.5);
} else if ((th <= 1.5e+58) || !(th <= 1.5e+253)) {
tmp = -0.5 * ((a2 * a2) / (sqrt(2.0) / (th * th)));
} else {
tmp = 1.0 / (sqrt(2.0) / (a2 * 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) :: tmp
if (th <= 3800000000.0d0) then
tmp = ((a2 * a2) + (a1 * a1)) * sqrt(0.5d0)
else if ((th <= 1.5d+58) .or. (.not. (th <= 1.5d+253))) then
tmp = (-0.5d0) * ((a2 * a2) / (sqrt(2.0d0) / (th * th)))
else
tmp = 1.0d0 / (sqrt(2.0d0) / (a2 * a2))
end if
code = tmp
end function
public static double code(double a1, double a2, double th) {
double tmp;
if (th <= 3800000000.0) {
tmp = ((a2 * a2) + (a1 * a1)) * Math.sqrt(0.5);
} else if ((th <= 1.5e+58) || !(th <= 1.5e+253)) {
tmp = -0.5 * ((a2 * a2) / (Math.sqrt(2.0) / (th * th)));
} else {
tmp = 1.0 / (Math.sqrt(2.0) / (a2 * a2));
}
return tmp;
}
def code(a1, a2, th): tmp = 0 if th <= 3800000000.0: tmp = ((a2 * a2) + (a1 * a1)) * math.sqrt(0.5) elif (th <= 1.5e+58) or not (th <= 1.5e+253): tmp = -0.5 * ((a2 * a2) / (math.sqrt(2.0) / (th * th))) else: tmp = 1.0 / (math.sqrt(2.0) / (a2 * a2)) return tmp
function code(a1, a2, th) tmp = 0.0 if (th <= 3800000000.0) tmp = Float64(Float64(Float64(a2 * a2) + Float64(a1 * a1)) * sqrt(0.5)); elseif ((th <= 1.5e+58) || !(th <= 1.5e+253)) tmp = Float64(-0.5 * Float64(Float64(a2 * a2) / Float64(sqrt(2.0) / Float64(th * th)))); else tmp = Float64(1.0 / Float64(sqrt(2.0) / Float64(a2 * a2))); end return tmp end
function tmp_2 = code(a1, a2, th) tmp = 0.0; if (th <= 3800000000.0) tmp = ((a2 * a2) + (a1 * a1)) * sqrt(0.5); elseif ((th <= 1.5e+58) || ~((th <= 1.5e+253))) tmp = -0.5 * ((a2 * a2) / (sqrt(2.0) / (th * th))); else tmp = 1.0 / (sqrt(2.0) / (a2 * a2)); end tmp_2 = tmp; end
code[a1_, a2_, th_] := If[LessEqual[th, 3800000000.0], N[(N[(N[(a2 * a2), $MachinePrecision] + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[th, 1.5e+58], N[Not[LessEqual[th, 1.5e+253]], $MachinePrecision]], N[(-0.5 * N[(N[(a2 * a2), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] / N[(th * th), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[Sqrt[2.0], $MachinePrecision] / N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;th \leq 3800000000:\\
\;\;\;\;\left(a2 \cdot a2 + a1 \cdot a1\right) \cdot \sqrt{0.5}\\
\mathbf{elif}\;th \leq 1.5 \cdot 10^{+58} \lor \neg \left(th \leq 1.5 \cdot 10^{+253}\right):\\
\;\;\;\;-0.5 \cdot \frac{a2 \cdot a2}{\frac{\sqrt{2}}{th \cdot th}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{\sqrt{2}}{a2 \cdot a2}}\\
\end{array}
\end{array}
if th < 3.8e9Initial program 99.6%
+-commutative99.6%
distribute-lft-out99.6%
Simplified99.6%
clear-num99.6%
associate-/r/99.6%
pow1/299.6%
pow-flip99.6%
metadata-eval99.6%
Applied egg-rr99.6%
Taylor expanded in th around 0 72.3%
if 3.8e9 < th < 1.5000000000000001e58 or 1.4999999999999999e253 < th Initial program 99.8%
distribute-lft-out99.8%
cos-neg99.8%
associate-*l/99.6%
cos-neg99.6%
fma-def99.6%
Simplified99.6%
Taylor expanded in a1 around 0 51.8%
unpow251.8%
associate-*l*51.8%
Simplified51.8%
Taylor expanded in th around 0 32.3%
*-commutative32.3%
unpow232.3%
Simplified32.3%
Taylor expanded in th around inf 31.9%
unpow231.9%
associate-/l*31.9%
unpow231.9%
Simplified31.9%
if 1.5000000000000001e58 < th < 1.4999999999999999e253Initial program 99.6%
+-commutative99.6%
distribute-lft-out99.6%
Simplified99.6%
Taylor expanded in th around 0 27.0%
Taylor expanded in a2 around inf 18.8%
unpow218.8%
Simplified18.8%
associate-/r/18.8%
Applied egg-rr18.8%
Final simplification58.9%
(FPCore (a1 a2 th) :precision binary64 (if (<= (* a2 a2) 5e+288) (* (+ (* a2 a2) (* a1 a1)) (sqrt 0.5)) (/ (* a2 (+ a2 (* -0.5 (* a2 (* th th))))) (sqrt 2.0))))
double code(double a1, double a2, double th) {
double tmp;
if ((a2 * a2) <= 5e+288) {
tmp = ((a2 * a2) + (a1 * a1)) * sqrt(0.5);
} else {
tmp = (a2 * (a2 + (-0.5 * (a2 * (th * th))))) / 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 ((a2 * a2) <= 5d+288) then
tmp = ((a2 * a2) + (a1 * a1)) * sqrt(0.5d0)
else
tmp = (a2 * (a2 + ((-0.5d0) * (a2 * (th * th))))) / sqrt(2.0d0)
end if
code = tmp
end function
public static double code(double a1, double a2, double th) {
double tmp;
if ((a2 * a2) <= 5e+288) {
tmp = ((a2 * a2) + (a1 * a1)) * Math.sqrt(0.5);
} else {
tmp = (a2 * (a2 + (-0.5 * (a2 * (th * th))))) / Math.sqrt(2.0);
}
return tmp;
}
def code(a1, a2, th): tmp = 0 if (a2 * a2) <= 5e+288: tmp = ((a2 * a2) + (a1 * a1)) * math.sqrt(0.5) else: tmp = (a2 * (a2 + (-0.5 * (a2 * (th * th))))) / math.sqrt(2.0) return tmp
function code(a1, a2, th) tmp = 0.0 if (Float64(a2 * a2) <= 5e+288) tmp = Float64(Float64(Float64(a2 * a2) + Float64(a1 * a1)) * sqrt(0.5)); else tmp = Float64(Float64(a2 * Float64(a2 + Float64(-0.5 * Float64(a2 * Float64(th * th))))) / sqrt(2.0)); end return tmp end
function tmp_2 = code(a1, a2, th) tmp = 0.0; if ((a2 * a2) <= 5e+288) tmp = ((a2 * a2) + (a1 * a1)) * sqrt(0.5); else tmp = (a2 * (a2 + (-0.5 * (a2 * (th * th))))) / sqrt(2.0); end tmp_2 = tmp; end
code[a1_, a2_, th_] := If[LessEqual[N[(a2 * a2), $MachinePrecision], 5e+288], N[(N[(N[(a2 * a2), $MachinePrecision] + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision], N[(N[(a2 * N[(a2 + N[(-0.5 * N[(a2 * N[(th * th), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a2 \cdot a2 \leq 5 \cdot 10^{+288}:\\
\;\;\;\;\left(a2 \cdot a2 + a1 \cdot a1\right) \cdot \sqrt{0.5}\\
\mathbf{else}:\\
\;\;\;\;\frac{a2 \cdot \left(a2 + -0.5 \cdot \left(a2 \cdot \left(th \cdot th\right)\right)\right)}{\sqrt{2}}\\
\end{array}
\end{array}
if (*.f64 a2 a2) < 5.0000000000000003e288Initial program 99.5%
+-commutative99.5%
distribute-lft-out99.5%
Simplified99.5%
clear-num99.5%
associate-/r/99.4%
pow1/299.4%
pow-flip99.5%
metadata-eval99.5%
Applied egg-rr99.5%
Taylor expanded in th around 0 56.1%
if 5.0000000000000003e288 < (*.f64 a2 a2) Initial program 100.0%
distribute-lft-out100.0%
cos-neg100.0%
associate-*l/100.0%
cos-neg100.0%
fma-def100.0%
Simplified100.0%
Taylor expanded in a1 around 0 100.0%
unpow2100.0%
associate-*l*100.0%
Simplified100.0%
Taylor expanded in th around 0 71.6%
*-commutative71.6%
unpow271.6%
Simplified71.6%
Final simplification59.5%
(FPCore (a1 a2 th) :precision binary64 (* (+ (* a2 a2) (* a1 a1)) (sqrt 0.5)))
double code(double a1, double a2, double th) {
return ((a2 * a2) + (a1 * a1)) * sqrt(0.5);
}
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) + (a1 * a1)) * sqrt(0.5d0)
end function
public static double code(double a1, double a2, double th) {
return ((a2 * a2) + (a1 * a1)) * Math.sqrt(0.5);
}
def code(a1, a2, th): return ((a2 * a2) + (a1 * a1)) * math.sqrt(0.5)
function code(a1, a2, th) return Float64(Float64(Float64(a2 * a2) + Float64(a1 * a1)) * sqrt(0.5)) end
function tmp = code(a1, a2, th) tmp = ((a2 * a2) + (a1 * a1)) * sqrt(0.5); end
code[a1_, a2_, th_] := N[(N[(N[(a2 * a2), $MachinePrecision] + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(a2 \cdot a2 + a1 \cdot a1\right) \cdot \sqrt{0.5}
\end{array}
Initial program 99.6%
+-commutative99.6%
distribute-lft-out99.6%
Simplified99.6%
clear-num99.6%
associate-/r/99.5%
pow1/299.5%
pow-flip99.6%
metadata-eval99.6%
Applied egg-rr99.6%
Taylor expanded in th around 0 60.2%
Final simplification60.2%
(FPCore (a1 a2 th) :precision binary64 (* (* a2 a2) (sqrt 0.5)))
double code(double a1, double a2, double th) {
return (a2 * a2) * sqrt(0.5);
}
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(0.5d0)
end function
public static double code(double a1, double a2, double th) {
return (a2 * a2) * Math.sqrt(0.5);
}
def code(a1, a2, th): return (a2 * a2) * math.sqrt(0.5)
function code(a1, a2, th) return Float64(Float64(a2 * a2) * sqrt(0.5)) end
function tmp = code(a1, a2, th) tmp = (a2 * a2) * sqrt(0.5); end
code[a1_, a2_, th_] := N[(N[(a2 * a2), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(a2 \cdot a2\right) \cdot \sqrt{0.5}
\end{array}
Initial program 99.6%
+-commutative99.6%
distribute-lft-out99.6%
Simplified99.6%
Taylor expanded in th around 0 60.2%
Taylor expanded in a2 around inf 39.5%
unpow239.5%
Simplified39.5%
div-inv39.5%
add-sqr-sqrt39.5%
sqrt-unprod39.5%
frac-times39.5%
metadata-eval39.5%
add-sqr-sqrt39.6%
metadata-eval39.6%
Applied egg-rr39.6%
Final simplification39.6%
(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}
Initial program 99.6%
+-commutative99.6%
distribute-lft-out99.6%
Simplified99.6%
Taylor expanded in th around 0 60.2%
Taylor expanded in a2 around inf 39.5%
unpow239.5%
Simplified39.5%
Taylor expanded in a2 around 0 39.5%
unpow239.5%
associate-*l/39.6%
Simplified39.6%
Final simplification39.6%
herbie shell --seed 2023287
(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))))