
(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 6 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}
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 (* (cos th) (* (sqrt 0.5) (* a2_m a2_m))))
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 cos(th) * (sqrt(0.5) * (a2_m * a2_m));
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = cos(th) * (sqrt(0.5d0) * (a2_m * a2_m))
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return Math.cos(th) * (Math.sqrt(0.5) * (a2_m * a2_m));
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return math.cos(th) * (math.sqrt(0.5) * (a2_m * a2_m))
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(cos(th) * Float64(sqrt(0.5) * Float64(a2_m * a2_m))) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = cos(th) * (sqrt(0.5) * (a2_m * a2_m));
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[(N[Cos[th], $MachinePrecision] * N[(N[Sqrt[0.5], $MachinePrecision] * N[(a2$95$m * a2$95$m), $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])\\
\\
\cos th \cdot \left(\sqrt{0.5} \cdot \left(a2\_m \cdot a2\_m\right)\right)
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.7
Applied rewrites99.7%
Taylor expanded in a1 around 0
distribute-rgt-outN/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6499.7
Applied rewrites99.7%
Taylor expanded in a1 around 0
Applied rewrites58.1%
Final simplification58.1%
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 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a2_m a2_m)) (* (* a1_m a1_m) t_1)) -1e-161)
(* (/ a2_m (sqrt 2.0)) (* (fma (* th th) -0.5 1.0) a2_m))
(* (sqrt 0.5) (* a2_m a2_m)))))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 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a2_m * a2_m)) + ((a1_m * a1_m) * t_1)) <= -1e-161) {
tmp = (a2_m / sqrt(2.0)) * (fma((th * th), -0.5, 1.0) * a2_m);
} else {
tmp = sqrt(0.5) * (a2_m * a2_m);
}
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(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a2_m * a2_m)) + Float64(Float64(a1_m * a1_m) * t_1)) <= -1e-161) tmp = Float64(Float64(a2_m / sqrt(2.0)) * Float64(fma(Float64(th * th), -0.5, 1.0) * a2_m)); else tmp = Float64(sqrt(0.5) * Float64(a2_m * a2_m)); 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[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(a1$95$m * a1$95$m), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -1e-161], N[(N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] * a2$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[0.5], $MachinePrecision] * N[(a2$95$m * a2$95$m), $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])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a2\_m \cdot a2\_m\right) + \left(a1\_m \cdot a1\_m\right) \cdot t\_1 \leq -1 \cdot 10^{-161}:\\
\;\;\;\;\frac{a2\_m}{\sqrt{2}} \cdot \left(\mathsf{fma}\left(th \cdot th, -0.5, 1\right) \cdot a2\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5} \cdot \left(a2\_m \cdot a2\_m\right)\\
\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))) < -1.00000000000000003e-161Initial program 99.6%
Taylor expanded in a1 around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-/.f64N/A
lower-sqrt.f6454.7
Applied rewrites54.7%
Taylor expanded in th around 0
Applied rewrites49.1%
if -1.00000000000000003e-161 < (+.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%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.7
Applied rewrites99.7%
Taylor expanded in th around 0
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6484.3
Applied rewrites84.3%
Taylor expanded in a1 around 0
Applied rewrites51.4%
Final simplification50.9%
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 (* (* (* (sqrt 0.5) a2_m) a2_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 ((sqrt(0.5) * a2_m) * a2_m) * cos(th);
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = ((sqrt(0.5d0) * a2_m) * a2_m) * cos(th)
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return ((Math.sqrt(0.5) * a2_m) * a2_m) * Math.cos(th);
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return ((math.sqrt(0.5) * a2_m) * a2_m) * math.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(Float64(Float64(sqrt(0.5) * a2_m) * a2_m) * cos(th)) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = ((sqrt(0.5) * a2_m) * a2_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[(N[(N[(N[Sqrt[0.5], $MachinePrecision] * a2$95$m), $MachinePrecision] * a2$95$m), $MachinePrecision] * N[Cos[th], $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])\\
\\
\left(\left(\sqrt{0.5} \cdot a2\_m\right) \cdot a2\_m\right) \cdot \cos th
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.7
Applied rewrites99.7%
Taylor expanded in a1 around 0
distribute-rgt-outN/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6499.7
Applied rewrites99.7%
Taylor expanded in a1 around 0
Applied rewrites58.1%
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 (* (sqrt 0.5) (* a2_m a2_m)))
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 sqrt(0.5) * (a2_m * a2_m);
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = sqrt(0.5d0) * (a2_m * a2_m)
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return Math.sqrt(0.5) * (a2_m * a2_m);
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return math.sqrt(0.5) * (a2_m * a2_m)
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(sqrt(0.5) * Float64(a2_m * a2_m)) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = sqrt(0.5) * (a2_m * a2_m);
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[(N[Sqrt[0.5], $MachinePrecision] * N[(a2$95$m * a2$95$m), $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])\\
\\
\sqrt{0.5} \cdot \left(a2\_m \cdot a2\_m\right)
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.7
Applied rewrites99.7%
Taylor expanded in th around 0
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6466.0
Applied rewrites66.0%
Taylor expanded in a1 around 0
Applied rewrites40.4%
Final simplification40.4%
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 (* (* (sqrt 0.5) a2_m) a2_m))
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 (sqrt(0.5) * a2_m) * a2_m;
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (sqrt(0.5d0) * a2_m) * a2_m
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return (Math.sqrt(0.5) * a2_m) * a2_m;
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return (math.sqrt(0.5) * a2_m) * a2_m
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(Float64(sqrt(0.5) * a2_m) * a2_m) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = (sqrt(0.5) * a2_m) * a2_m;
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[(N[(N[Sqrt[0.5], $MachinePrecision] * a2$95$m), $MachinePrecision] * a2$95$m), $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])\\
\\
\left(\sqrt{0.5} \cdot a2\_m\right) \cdot a2\_m
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.7
Applied rewrites99.7%
Taylor expanded in th around 0
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6466.0
Applied rewrites66.0%
Taylor expanded in a1 around 0
Applied rewrites40.4%
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 (* (* (sqrt 0.5) a1_m) a1_m))
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 (sqrt(0.5) * a1_m) * a1_m;
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (sqrt(0.5d0) * a1_m) * a1_m
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return (Math.sqrt(0.5) * a1_m) * a1_m;
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return (math.sqrt(0.5) * a1_m) * a1_m
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(Float64(sqrt(0.5) * a1_m) * a1_m) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = (sqrt(0.5) * a1_m) * a1_m;
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[(N[(N[Sqrt[0.5], $MachinePrecision] * a1$95$m), $MachinePrecision] * a1$95$m), $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])\\
\\
\left(\sqrt{0.5} \cdot a1\_m\right) \cdot a1\_m
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.7
Applied rewrites99.7%
Taylor expanded in th around 0
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6466.0
Applied rewrites66.0%
Taylor expanded in a1 around inf
Applied rewrites39.5%
herbie shell --seed 2024243
(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))))