
(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 15 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}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (/ (fma (* a2 (cos th)) (* a2 (sqrt 2.0)) (* (* a1 (cos th)) (* a1 (sqrt 2.0)))) 2.0))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return fma((a2 * cos(th)), (a2 * sqrt(2.0)), ((a1 * cos(th)) * (a1 * sqrt(2.0)))) / 2.0;
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(fma(Float64(a2 * cos(th)), Float64(a2 * sqrt(2.0)), Float64(Float64(a1 * cos(th)) * Float64(a1 * sqrt(2.0)))) / 2.0) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(a2 * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a2 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + N[(N[(a1 * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a1 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{\mathsf{fma}\left(a2 \cdot \cos th, a2 \cdot \sqrt{2}, \left(a1 \cdot \cos th\right) \cdot \left(a1 \cdot \sqrt{2}\right)\right)}{2}
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
Applied rewrites99.7%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2))) -5e-117)
(* (* (* (sqrt 2.0) a2) a2) (fma -0.25 (* th th) 0.5))
(/ (fma a2 a2 (* a1 a1)) (sqrt 2.0)))))assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2 * a2))) <= -5e-117) {
tmp = ((sqrt(2.0) * a2) * a2) * fma(-0.25, (th * th), 0.5);
} else {
tmp = fma(a2, a2, (a1 * a1)) / sqrt(2.0);
}
return tmp;
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) <= -5e-117) tmp = Float64(Float64(Float64(sqrt(2.0) * a2) * a2) * fma(-0.25, Float64(th * th), 0.5)); else tmp = Float64(fma(a2, a2, Float64(a1 * a1)) / sqrt(2.0)); end return tmp end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-117], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * a2), $MachinePrecision] * a2), $MachinePrecision] * N[(-0.25 * N[(th * th), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision], N[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right) \leq -5 \cdot 10^{-117}:\\
\;\;\;\;\left(\left(\sqrt{2} \cdot a2\right) \cdot a2\right) \cdot \mathsf{fma}\left(-0.25, th \cdot th, 0.5\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\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))) < -5e-117Initial program 99.5%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in a1 around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6449.7
Applied rewrites49.7%
Taylor expanded in th around 0
Applied rewrites52.5%
if -5e-117 < (+.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
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6486.2
Applied rewrites86.2%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (fma (/ a1 a2) (/ a1 a2) 1.0) (* (* (cos th) a2) (/ a2 (sqrt 2.0)))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return fma((a1 / a2), (a1 / a2), 1.0) * ((cos(th) * a2) * (a2 / sqrt(2.0)));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(fma(Float64(a1 / a2), Float64(a1 / a2), 1.0) * Float64(Float64(cos(th) * a2) * Float64(a2 / sqrt(2.0)))) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(a1 / a2), $MachinePrecision] * N[(a1 / a2), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision] * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\mathsf{fma}\left(\frac{a1}{a2}, \frac{a1}{a2}, 1\right) \cdot \left(\left(\cos th \cdot a2\right) \cdot \frac{a2}{\sqrt{2}}\right)
\end{array}
Initial program 99.6%
Taylor expanded in a2 around inf
distribute-lft-inN/A
*-commutativeN/A
associate-/l*N/A
times-fracN/A
associate-*l*N/A
associate-*l/N/A
*-commutativeN/A
distribute-rgt1-inN/A
lower-*.f64N/A
Applied rewrites78.7%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (cos th) (/ (fma a2 a2 (* a1 a1)) (sqrt 2.0))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return cos(th) * (fma(a2, a2, (a1 * a1)) / sqrt(2.0));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(cos(th) * Float64(fma(a2, a2, Float64(a1 * a1)) / sqrt(2.0))) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\cos th \cdot \frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}}
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.7
Applied rewrites99.7%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (fma a1 a1 (* a2 a2)) (cos th)) (* (sqrt 2.0) 0.5)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (fma(a1, a1, (a2 * a2)) * cos(th)) * (sqrt(2.0) * 0.5);
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(fma(a1, a1, Float64(a2 * a2)) * cos(th)) * Float64(sqrt(2.0) * 0.5)) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\mathsf{fma}\left(a1, a1, a2 \cdot a2\right) \cdot \cos th\right) \cdot \left(\sqrt{2} \cdot 0.5\right)
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
distribute-lft-inN/A
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.6
Applied rewrites99.6%
Applied rewrites99.6%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (* 0.5 (sqrt 2.0)) (cos th)) (fma a1 a1 (* a2 a2))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return ((0.5 * sqrt(2.0)) * cos(th)) * fma(a1, a1, (a2 * a2));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(Float64(0.5 * sqrt(2.0)) * cos(th)) * fma(a1, a1, Float64(a2 * a2))) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\left(0.5 \cdot \sqrt{2}\right) \cdot \cos th\right) \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
distribute-lft-inN/A
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.6
Applied rewrites99.6%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (* (* (cos th) 0.5) (sqrt 2.0)) a2) a2))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (((cos(th) * 0.5) * sqrt(2.0)) * a2) * a2;
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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) * 0.5d0) * sqrt(2.0d0)) * a2) * a2
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (((Math.cos(th) * 0.5) * Math.sqrt(2.0)) * a2) * a2;
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (((math.cos(th) * 0.5) * math.sqrt(2.0)) * a2) * a2
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(Float64(Float64(cos(th) * 0.5) * sqrt(2.0)) * a2) * a2) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (((cos(th) * 0.5) * sqrt(2.0)) * a2) * a2;
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(N[(N[Cos[th], $MachinePrecision] * 0.5), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2), $MachinePrecision] * a2), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\left(\left(\cos th \cdot 0.5\right) \cdot \sqrt{2}\right) \cdot a2\right) \cdot a2
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6454.3
Applied rewrites54.3%
Applied rewrites54.4%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (* 0.5 a2) (* (sqrt 2.0) a2)) (cos th)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return ((0.5 * a2) * (sqrt(2.0) * a2)) * cos(th);
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = ((0.5d0 * a2) * (sqrt(2.0d0) * a2)) * cos(th)
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return ((0.5 * a2) * (Math.sqrt(2.0) * a2)) * Math.cos(th);
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return ((0.5 * a2) * (math.sqrt(2.0) * a2)) * math.cos(th)
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(Float64(0.5 * a2) * Float64(sqrt(2.0) * a2)) * cos(th)) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = ((0.5 * a2) * (sqrt(2.0) * a2)) * cos(th);
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(0.5 * a2), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\left(0.5 \cdot a2\right) \cdot \left(\sqrt{2} \cdot a2\right)\right) \cdot \cos th
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6454.3
Applied rewrites54.3%
Applied rewrites54.4%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* 0.5 (* a2 a2)) (* (sqrt 2.0) (cos th))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (0.5 * (a2 * a2)) * (sqrt(2.0) * cos(th));
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (0.5d0 * (a2 * a2)) * (sqrt(2.0d0) * cos(th))
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (0.5 * (a2 * a2)) * (Math.sqrt(2.0) * Math.cos(th));
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (0.5 * (a2 * a2)) * (math.sqrt(2.0) * math.cos(th))
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(0.5 * Float64(a2 * a2)) * Float64(sqrt(2.0) * cos(th))) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (0.5 * (a2 * a2)) * (sqrt(2.0) * cos(th));
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(0.5 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(0.5 \cdot \left(a2 \cdot a2\right)\right) \cdot \left(\sqrt{2} \cdot \cos th\right)
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6454.3
Applied rewrites54.3%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (/ (fma a2 a2 (* a1 a1)) (sqrt 2.0)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return fma(a2, a2, (a1 * a1)) / sqrt(2.0);
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(fma(a2, a2, Float64(a1 * a1)) / sqrt(2.0)) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}}
\end{array}
Initial program 99.6%
Taylor expanded in th around 0
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6468.1
Applied rewrites68.1%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* 0.5 (sqrt 2.0)) (fma a1 a1 (* a2 a2))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (0.5 * sqrt(2.0)) * fma(a1, a1, (a2 * a2));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(0.5 * sqrt(2.0)) * fma(a1, a1, Float64(a2 * a2))) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(0.5 \cdot \sqrt{2}\right) \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in th around 0
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6468.1
Applied rewrites68.1%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* a2 (sqrt (/ (* a2 a2) 2.0))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return a2 * sqrt(((a2 * a2) / 2.0));
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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(((a2 * a2) / 2.0d0))
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return a2 * Math.sqrt(((a2 * a2) / 2.0));
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return a2 * math.sqrt(((a2 * a2) / 2.0))
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(a2 * sqrt(Float64(Float64(a2 * a2) / 2.0))) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = a2 * sqrt(((a2 * a2) / 2.0));
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(a2 * N[Sqrt[N[(N[(a2 * a2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
a2 \cdot \sqrt{\frac{a2 \cdot a2}{2}}
\end{array}
Initial program 99.6%
Taylor expanded in th around 0
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6468.1
Applied rewrites68.1%
Taylor expanded in a1 around 0
Applied rewrites39.5%
Applied rewrites28.7%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (/ (* a2 a2) (sqrt 2.0)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (a2 * a2) / sqrt(2.0);
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (a2 * a2) / Math.sqrt(2.0);
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (a2 * a2) / math.sqrt(2.0)
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(a2 * a2) / sqrt(2.0)) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (a2 * a2) / sqrt(2.0);
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(a2 * a2), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{a2 \cdot a2}{\sqrt{2}}
\end{array}
Initial program 99.6%
Taylor expanded in th around 0
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6468.1
Applied rewrites68.1%
Taylor expanded in a1 around 0
Applied rewrites39.5%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* a2 (/ a2 (sqrt 2.0))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return a2 * (a2 / sqrt(2.0));
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return a2 * (a2 / Math.sqrt(2.0));
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return a2 * (a2 / math.sqrt(2.0))
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(a2 * Float64(a2 / sqrt(2.0))) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = a2 * (a2 / sqrt(2.0));
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(a2 * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
a2 \cdot \frac{a2}{\sqrt{2}}
\end{array}
Initial program 99.6%
Taylor expanded in th around 0
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6468.1
Applied rewrites68.1%
Taylor expanded in a1 around 0
Applied rewrites39.5%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* 0.5 (* a2 a2)) (sqrt 2.0)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (0.5 * (a2 * a2)) * sqrt(2.0);
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (0.5d0 * (a2 * a2)) * sqrt(2.0d0)
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (0.5 * (a2 * a2)) * Math.sqrt(2.0);
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (0.5 * (a2 * a2)) * math.sqrt(2.0)
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(0.5 * Float64(a2 * a2)) * sqrt(2.0)) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (0.5 * (a2 * a2)) * sqrt(2.0);
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(0.5 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(0.5 \cdot \left(a2 \cdot a2\right)\right) \cdot \sqrt{2}
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6454.3
Applied rewrites54.3%
Taylor expanded in th around 0
Applied rewrites39.5%
herbie shell --seed 2024326
(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))))