
(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));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a1, a2, th)
use fmin_fmax_functions
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}
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));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a1, a2, th)
use fmin_fmax_functions
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}
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (cos th) (/ (fma a2 a2 (* a1_m a1_m)) (sqrt 2.0))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return cos(th) * (fma(a2, a2, (a1_m * a1_m)) / sqrt(2.0));
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(cos(th) * Float64(fma(a2, a2, Float64(a1_m * a1_m)) / sqrt(2.0))) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a2 * a2 + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\cos th \cdot \frac{\mathsf{fma}\left(a2, a2, a1\_m \cdot a1\_m\right)}{\sqrt{2}}
\end{array}
Initial program 99.5%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
pow2N/A
pow2N/A
div-add-revN/A
lower-*.f64N/A
lift-cos.f64N/A
div-add-revN/A
+-commutativeN/A
pow2N/A
pow2N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift-/.f6499.6
Applied rewrites99.6%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1_m a1_m)) (* t_1 (* a2 a2))) -5e-75)
(/ (* (fma (* th th) -0.5 1.0) (* a2 a2)) (sqrt 2.0))
(/ (fma a2 a2 (* a1_m a1_m)) (sqrt 2.0)))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2 * a2))) <= -5e-75) {
tmp = (fma((th * th), -0.5, 1.0) * (a2 * a2)) / sqrt(2.0);
} else {
tmp = fma(a2, a2, (a1_m * a1_m)) / sqrt(2.0);
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1_m * a1_m)) + Float64(t_1 * Float64(a2 * a2))) <= -5e-75) tmp = Float64(Float64(fma(Float64(th * th), -0.5, 1.0) * Float64(a2 * a2)) / sqrt(2.0)); else tmp = Float64(fma(a2, a2, Float64(a1_m * a1_m)) / sqrt(2.0)); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, 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$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-75], N[(N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], N[(N[(a2 * a2 + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + t\_1 \cdot \left(a2 \cdot a2\right) \leq -5 \cdot 10^{-75}:\\
\;\;\;\;\frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right) \cdot \left(a2 \cdot a2\right)}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2, a2, a1\_m \cdot a1\_m\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))) < -4.99999999999999979e-75Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
pow2N/A
pow2N/A
+-commutativeN/A
pow2N/A
pow2N/A
pow2N/A
lift-*.f6476.7
Applied rewrites76.7%
Taylor expanded in th around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6449.5
Applied rewrites49.5%
if -4.99999999999999979e-75 < (+.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.5%
Taylor expanded in th around 0
+-commutativeN/A
div-add-revN/A
lower-/.f64N/A
pow2N/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6482.6
Applied rewrites82.6%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1_m a1_m)) (* t_1 (* a2 a2))) -2e-171)
(* a1_m (* a1_m (/ (fma (* th th) -0.5 1.0) (sqrt 2.0))))
(/ (fma a2 a2 (* a1_m a1_m)) (sqrt 2.0)))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2 * a2))) <= -2e-171) {
tmp = a1_m * (a1_m * (fma((th * th), -0.5, 1.0) / sqrt(2.0)));
} else {
tmp = fma(a2, a2, (a1_m * a1_m)) / sqrt(2.0);
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1_m * a1_m)) + Float64(t_1 * Float64(a2 * a2))) <= -2e-171) tmp = Float64(a1_m * Float64(a1_m * Float64(fma(Float64(th * th), -0.5, 1.0) / sqrt(2.0)))); else tmp = Float64(fma(a2, a2, Float64(a1_m * a1_m)) / sqrt(2.0)); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, 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$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-171], N[(a1$95$m * N[(a1$95$m * N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a2 * a2 + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + t\_1 \cdot \left(a2 \cdot a2\right) \leq -2 \cdot 10^{-171}:\\
\;\;\;\;a1\_m \cdot \left(a1\_m \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2, a2, a1\_m \cdot a1\_m\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))) < -2e-171Initial program 99.5%
Taylor expanded in a1 around inf
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f6432.8
Applied rewrites32.8%
Taylor expanded in th around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6433.6
Applied rewrites33.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6439.6
Applied rewrites39.6%
if -2e-171 < (+.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.5%
Taylor expanded in th around 0
+-commutativeN/A
div-add-revN/A
lower-/.f64N/A
pow2N/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6484.2
Applied rewrites84.2%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1_m a1_m)) (* t_1 (* a2 a2))) -5e-75)
(* (* a1_m a1_m) (/ (* (* th th) -0.5) (sqrt 2.0)))
(/ (fma a2 a2 (* a1_m a1_m)) (sqrt 2.0)))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2 * a2))) <= -5e-75) {
tmp = (a1_m * a1_m) * (((th * th) * -0.5) / sqrt(2.0));
} else {
tmp = fma(a2, a2, (a1_m * a1_m)) / sqrt(2.0);
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1_m * a1_m)) + Float64(t_1 * Float64(a2 * a2))) <= -5e-75) tmp = Float64(Float64(a1_m * a1_m) * Float64(Float64(Float64(th * th) * -0.5) / sqrt(2.0))); else tmp = Float64(fma(a2, a2, Float64(a1_m * a1_m)) / sqrt(2.0)); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, 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$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-75], N[(N[(a1$95$m * a1$95$m), $MachinePrecision] * N[(N[(N[(th * th), $MachinePrecision] * -0.5), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a2 * a2 + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + t\_1 \cdot \left(a2 \cdot a2\right) \leq -5 \cdot 10^{-75}:\\
\;\;\;\;\left(a1\_m \cdot a1\_m\right) \cdot \frac{\left(th \cdot th\right) \cdot -0.5}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2, a2, a1\_m \cdot a1\_m\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))) < -4.99999999999999979e-75Initial program 99.6%
Taylor expanded in a1 around inf
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f6433.1
Applied rewrites33.1%
Taylor expanded in th around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6435.8
Applied rewrites35.8%
Taylor expanded in th around inf
*-commutativeN/A
lower-*.f64N/A
pow2N/A
lift-*.f6435.8
Applied rewrites35.8%
if -4.99999999999999979e-75 < (+.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.5%
Taylor expanded in th around 0
+-commutativeN/A
div-add-revN/A
lower-/.f64N/A
pow2N/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6482.6
Applied rewrites82.6%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (cos th) (* (* 0.5 (sqrt 2.0)) (fma a2 a2 (* a1_m a1_m)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return cos(th) * ((0.5 * sqrt(2.0)) * fma(a2, a2, (a1_m * a1_m)));
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(cos(th) * Float64(Float64(0.5 * sqrt(2.0)) * fma(a2, a2, Float64(a1_m * a1_m)))) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a2 * a2 + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\cos th \cdot \left(\left(0.5 \cdot \sqrt{2}\right) \cdot \mathsf{fma}\left(a2, a2, a1\_m \cdot a1\_m\right)\right)
\end{array}
Initial program 99.5%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
pow2N/A
pow2N/A
div-add-revN/A
lower-*.f64N/A
lift-cos.f64N/A
div-add-revN/A
+-commutativeN/A
pow2N/A
pow2N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift-/.f6499.6
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
pow2N/A
pow2N/A
div-addN/A
frac-addN/A
pow2N/A
*-commutativeN/A
pow2N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
rem-square-sqrtN/A
lift-fma.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f6499.6
Applied rewrites99.5%
Taylor expanded in a1 around 0
Applied rewrites99.6%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (/ (* (cos th) (* a2 a2)) (sqrt 2.0)))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return (cos(th) * (a2 * a2)) / sqrt(2.0);
}
a1_m = private
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a1_m, a2, th)
use fmin_fmax_functions
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (cos(th) * (a2 * a2)) / sqrt(2.0d0)
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return (Math.cos(th) * (a2 * a2)) / Math.sqrt(2.0);
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return (math.cos(th) * (a2 * a2)) / math.sqrt(2.0)
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(Float64(cos(th) * Float64(a2 * a2)) / sqrt(2.0)) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = (cos(th) * (a2 * a2)) / sqrt(2.0);
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\frac{\cos th \cdot \left(a2 \cdot a2\right)}{\sqrt{2}}
\end{array}
Initial program 99.5%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
pow2N/A
pow2N/A
+-commutativeN/A
pow2N/A
pow2N/A
pow2N/A
lift-*.f6478.3
Applied rewrites78.3%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (cos th) (/ (* a2 a2) (sqrt 2.0))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return cos(th) * ((a2 * a2) / sqrt(2.0));
}
a1_m = private
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a1_m, a2, th)
use fmin_fmax_functions
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = cos(th) * ((a2 * a2) / sqrt(2.0d0))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return Math.cos(th) * ((a2 * a2) / Math.sqrt(2.0));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return math.cos(th) * ((a2 * a2) / math.sqrt(2.0))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(cos(th) * Float64(Float64(a2 * a2) / sqrt(2.0))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = cos(th) * ((a2 * a2) / sqrt(2.0));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a2 * a2), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\cos th \cdot \frac{a2 \cdot a2}{\sqrt{2}}
\end{array}
Initial program 99.5%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
pow2N/A
pow2N/A
+-commutativeN/A
pow2N/A
pow2N/A
pow2N/A
lift-*.f6478.3
Applied rewrites78.3%
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
lift-cos.f64N/A
lower-/.f64N/A
lift-sqrt.f6478.3
Applied rewrites78.3%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (cos th) (* (* 0.5 (* a2 a2)) (sqrt 2.0))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return cos(th) * ((0.5 * (a2 * a2)) * sqrt(2.0));
}
a1_m = private
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a1_m, a2, th)
use fmin_fmax_functions
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = cos(th) * ((0.5d0 * (a2 * a2)) * sqrt(2.0d0))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return Math.cos(th) * ((0.5 * (a2 * a2)) * Math.sqrt(2.0));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return math.cos(th) * ((0.5 * (a2 * a2)) * math.sqrt(2.0))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(cos(th) * Float64(Float64(0.5 * Float64(a2 * a2)) * sqrt(2.0))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = cos(th) * ((0.5 * (a2 * a2)) * sqrt(2.0));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(0.5 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\cos th \cdot \left(\left(0.5 \cdot \left(a2 \cdot a2\right)\right) \cdot \sqrt{2}\right)
\end{array}
Initial program 99.5%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
pow2N/A
pow2N/A
div-add-revN/A
lower-*.f64N/A
lift-cos.f64N/A
div-add-revN/A
+-commutativeN/A
pow2N/A
pow2N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift-/.f6499.6
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
pow2N/A
pow2N/A
div-addN/A
frac-addN/A
pow2N/A
*-commutativeN/A
pow2N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
rem-square-sqrtN/A
lift-fma.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f6499.6
Applied rewrites99.5%
Taylor expanded in a1 around 0
pow2N/A
pow2N/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
rem-square-sqrtN/A
frac-addN/A
frac-2negN/A
frac-addN/A
pow2N/A
pow2N/A
associate-*r*N/A
Applied rewrites78.3%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (* 0.5 (* a2 a2)) (* (sqrt 2.0) (cos th))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return (0.5 * (a2 * a2)) * (sqrt(2.0) * cos(th));
}
a1_m = private
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a1_m, a2, th)
use fmin_fmax_functions
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (0.5d0 * (a2 * a2)) * (sqrt(2.0d0) * cos(th))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return (0.5 * (a2 * a2)) * (Math.sqrt(2.0) * Math.cos(th));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return (0.5 * (a2 * a2)) * (math.sqrt(2.0) * math.cos(th))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(Float64(0.5 * Float64(a2 * a2)) * Float64(sqrt(2.0) * cos(th))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = (0.5 * (a2 * a2)) * (sqrt(2.0) * cos(th));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, 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_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, 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.5%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
pow2N/A
pow2N/A
div-add-revN/A
lower-*.f64N/A
lift-cos.f64N/A
div-add-revN/A
+-commutativeN/A
pow2N/A
pow2N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift-/.f6499.6
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
pow2N/A
pow2N/A
div-addN/A
frac-addN/A
pow2N/A
*-commutativeN/A
pow2N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
rem-square-sqrtN/A
lift-fma.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f6499.6
Applied rewrites99.5%
Taylor expanded in a1 around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
lift-cos.f6478.3
Applied rewrites78.3%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (/ (fma a2 a2 (* a1_m a1_m)) (sqrt 2.0)))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return fma(a2, a2, (a1_m * a1_m)) / sqrt(2.0);
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(fma(a2, a2, Float64(a1_m * a1_m)) / sqrt(2.0)) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(a2 * a2 + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\frac{\mathsf{fma}\left(a2, a2, a1\_m \cdot a1\_m\right)}{\sqrt{2}}
\end{array}
Initial program 99.5%
Taylor expanded in th around 0
+-commutativeN/A
div-add-revN/A
lower-/.f64N/A
pow2N/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6466.0
Applied rewrites66.0%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (sqrt 2.0) (fma a1_m a1_m (* a2 a2)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * (sqrt(2.0) * fma(a1_m, a1_m, (a2 * a2)));
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(sqrt(2.0) * fma(a1_m, a1_m, Float64(a2 * a2)))) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right)\right)
\end{array}
Initial program 99.5%
Taylor expanded in th around 0
+-commutativeN/A
div-add-revN/A
lower-/.f64N/A
pow2N/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6466.0
Applied rewrites66.0%
lift-/.f64N/A
lift-fma.f64N/A
pow2N/A
lift-*.f64N/A
pow2N/A
lift-sqrt.f64N/A
div-addN/A
frac-addN/A
rem-square-sqrtN/A
lower-/.f64N/A
*-commutativeN/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6466.0
Applied rewrites66.0%
Taylor expanded in a1 around 0
Applied rewrites66.0%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (* 0.5 (sqrt 2.0)) (fma a2 a2 (* a1_m a1_m))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return (0.5 * sqrt(2.0)) * fma(a2, a2, (a1_m * a1_m));
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(Float64(0.5 * sqrt(2.0)) * fma(a2, a2, Float64(a1_m * a1_m))) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a2 * a2 + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\left(0.5 \cdot \sqrt{2}\right) \cdot \mathsf{fma}\left(a2, a2, a1\_m \cdot a1\_m\right)
\end{array}
Initial program 99.5%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
pow2N/A
pow2N/A
div-add-revN/A
lower-*.f64N/A
lift-cos.f64N/A
div-add-revN/A
+-commutativeN/A
pow2N/A
pow2N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift-/.f6499.6
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
pow2N/A
pow2N/A
div-addN/A
frac-addN/A
pow2N/A
*-commutativeN/A
pow2N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
rem-square-sqrtN/A
lift-fma.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f6499.6
Applied rewrites99.5%
Taylor expanded in th around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
+-commutativeN/A
pow2N/A
lower-fma.f64N/A
pow2N/A
lift-*.f6466.0
Applied rewrites66.0%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (/ (* a2 a2) (sqrt 2.0)))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return (a2 * a2) / sqrt(2.0);
}
a1_m = private
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a1_m, a2, th)
use fmin_fmax_functions
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (a2 * a2) / sqrt(2.0d0)
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return (a2 * a2) / Math.sqrt(2.0);
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return (a2 * a2) / math.sqrt(2.0)
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(Float64(a2 * a2) / sqrt(2.0)) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = (a2 * a2) / sqrt(2.0);
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(a2 * a2), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\frac{a2 \cdot a2}{\sqrt{2}}
\end{array}
Initial program 99.5%
Taylor expanded in th around 0
+-commutativeN/A
div-add-revN/A
lower-/.f64N/A
pow2N/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6466.0
Applied rewrites66.0%
Taylor expanded in a1 around 0
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6452.8
Applied rewrites52.8%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (* 0.5 (* a2 a2)) (sqrt 2.0)))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return (0.5 * (a2 * a2)) * sqrt(2.0);
}
a1_m = private
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a1_m, a2, th)
use fmin_fmax_functions
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (0.5d0 * (a2 * a2)) * sqrt(2.0d0)
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return (0.5 * (a2 * a2)) * Math.sqrt(2.0);
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return (0.5 * (a2 * a2)) * math.sqrt(2.0)
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(Float64(0.5 * Float64(a2 * a2)) * sqrt(2.0)) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = (0.5 * (a2 * a2)) * sqrt(2.0);
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(0.5 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\left(0.5 \cdot \left(a2 \cdot a2\right)\right) \cdot \sqrt{2}
\end{array}
Initial program 99.5%
Taylor expanded in th around 0
+-commutativeN/A
div-add-revN/A
lower-/.f64N/A
pow2N/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6466.0
Applied rewrites66.0%
lift-/.f64N/A
lift-fma.f64N/A
pow2N/A
lift-*.f64N/A
pow2N/A
lift-sqrt.f64N/A
div-addN/A
frac-addN/A
rem-square-sqrtN/A
lower-/.f64N/A
*-commutativeN/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6466.0
Applied rewrites66.0%
Taylor expanded in a1 around 0
Applied rewrites52.8%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (sqrt 0.5) (* a1_m a1_m)))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return sqrt(0.5) * (a1_m * a1_m);
}
a1_m = private
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a1_m, a2, th)
use fmin_fmax_functions
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = sqrt(0.5d0) * (a1_m * a1_m)
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return Math.sqrt(0.5) * (a1_m * a1_m);
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return math.sqrt(0.5) * (a1_m * a1_m)
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(sqrt(0.5) * Float64(a1_m * a1_m)) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = sqrt(0.5) * (a1_m * a1_m);
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[Sqrt[0.5], $MachinePrecision] * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\sqrt{0.5} \cdot \left(a1\_m \cdot a1\_m\right)
\end{array}
Initial program 99.5%
Taylor expanded in th around 0
+-commutativeN/A
div-add-revN/A
lower-/.f64N/A
pow2N/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6466.0
Applied rewrites66.0%
Taylor expanded in a1 around inf
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6426.8
Applied rewrites26.8%
lift-sqrt.f64N/A
pow1/2N/A
metadata-evalN/A
pow-negN/A
metadata-evalN/A
pow-flipN/A
pow1/2N/A
lower-/.f64N/A
inv-powN/A
sqrt-pow2N/A
metadata-evalN/A
lower-pow.f6426.7
Applied rewrites26.7%
Taylor expanded in a1 around 0
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
pow2N/A
lift-*.f6426.8
Applied rewrites26.8%
herbie shell --seed 2025107
(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))))