
(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 13 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}
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (fma (cos th) (* a2_m (/ a2_m (sqrt 2.0))) (* (/ (* (cos th) a1) (sqrt 2.0)) a1)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return fma(cos(th), (a2_m * (a2_m / sqrt(2.0))), (((cos(th) * a1) / sqrt(2.0)) * a1));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return fma(cos(th), Float64(a2_m * Float64(a2_m / sqrt(2.0))), Float64(Float64(Float64(cos(th) * a1) / sqrt(2.0)) * a1)) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(a2$95$m * N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(N[Cos[th], $MachinePrecision] * a1), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\mathsf{fma}\left(\cos th, a2\_m \cdot \frac{a2\_m}{\sqrt{2}}, \frac{\cos th \cdot a1}{\sqrt{2}} \cdot a1\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
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
+-commutativeN/A
pow2N/A
associate-*l/N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.6%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (fma (/ (* (cos th) a2_m) (sqrt 2.0)) a2_m (* (/ (* (cos th) a1) (sqrt 2.0)) a1)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return fma(((cos(th) * a2_m) / sqrt(2.0)), a2_m, (((cos(th) * a1) / sqrt(2.0)) * a1));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return fma(Float64(Float64(cos(th) * a2_m) / sqrt(2.0)), a2_m, Float64(Float64(Float64(cos(th) * a1) / sqrt(2.0)) * a1)) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m + N[(N[(N[(N[Cos[th], $MachinePrecision] * a1), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\mathsf{fma}\left(\frac{\cos th \cdot a2\_m}{\sqrt{2}}, a2\_m, \frac{\cos th \cdot a1}{\sqrt{2}} \cdot a1\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
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites99.6%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (fma (* (cos th) (/ a1 (sqrt 2.0))) a1 (* (* (cos th) a2_m) (/ a2_m (sqrt 2.0)))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return fma((cos(th) * (a1 / sqrt(2.0))), a1, ((cos(th) * a2_m) * (a2_m / sqrt(2.0))));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return fma(Float64(cos(th) * Float64(a1 / sqrt(2.0))), a1, Float64(Float64(cos(th) * a2_m) * Float64(a2_m / sqrt(2.0)))) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * a1 + N[(N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision] * N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\mathsf{fma}\left(\cos th \cdot \frac{a1}{\sqrt{2}}, a1, \left(\cos th \cdot a2\_m\right) \cdot \frac{a2\_m}{\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
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
+-commutativeN/A
pow2N/A
associate-*l/N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.6%
lift-cos.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
+-commutativeN/A
lower-fma.f64N/A
associate-/l*N/A
lower-*.f64N/A
lift-cos.f64N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
Applied rewrites99.6%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (/ (* (cos th) (fma a1 a1 (* a2_m a2_m))) (sqrt 2.0)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (cos(th) * fma(a1, a1, (a2_m * a2_m))) / sqrt(2.0);
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(cos(th) * fma(a1, a1, Float64(a2_m * a2_m))) / sqrt(2.0)) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\frac{\cos th \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_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
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
pow2N/A
distribute-lft-outN/A
associate-*l/N/A
distribute-rgt-outN/A
Applied rewrites99.6%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (cos th) (/ (fma a1 a1 (* a2_m a2_m)) (sqrt 2.0))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return cos(th) * (fma(a1, a1, (a2_m * a2_m)) / sqrt(2.0));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(cos(th) * Float64(fma(a1, a1, Float64(a2_m * a2_m)) / sqrt(2.0))) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\cos th \cdot \frac{\mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_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
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
pow2N/A
distribute-lft-outN/A
associate-*l/N/A
distribute-rgt-outN/A
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lift-*.f64N/A
lift-fma.f64N/A
pow2N/A
pow2N/A
div-add-revN/A
lower-*.f64N/A
lift-cos.f64N/A
div-add-revN/A
lower-/.f64N/A
pow2N/A
pow2N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-sqrt.f6499.6
Applied rewrites99.6%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (* (cos th) (/ a2_m (sqrt 2.0))) a2_m))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (cos(th) * (a2_m / sqrt(2.0))) * a2_m;
}
a2_m = private
NOTE: a1, a2_m, 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, a2_m, th)
use fmin_fmax_functions
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (cos(th) * (a2_m / sqrt(2.0d0))) * a2_m
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return (Math.cos(th) * (a2_m / Math.sqrt(2.0))) * a2_m;
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return (math.cos(th) * (a2_m / math.sqrt(2.0))) * a2_m
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(cos(th) * Float64(a2_m / sqrt(2.0))) * a2_m) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = (cos(th) * (a2_m / sqrt(2.0))) * a2_m;
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(\cos th \cdot \frac{a2\_m}{\sqrt{2}}\right) \cdot a2\_m
\end{array}
Initial program 99.5%
Taylor expanded in a1 around 0
associate-/l*N/A
*-commutativeN/A
pow2N/A
associate-*r*N/A
lower-*.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f6478.1
Applied rewrites78.1%
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
lift-sqrt.f64N/A
lift-/.f6478.1
Applied rewrites78.1%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (* (/ (cos th) (sqrt 2.0)) a2_m) a2_m))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return ((cos(th) / sqrt(2.0)) * a2_m) * a2_m;
}
a2_m = private
NOTE: a1, a2_m, 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, a2_m, th)
use fmin_fmax_functions
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = ((cos(th) / sqrt(2.0d0)) * a2_m) * a2_m
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return ((Math.cos(th) / Math.sqrt(2.0)) * a2_m) * a2_m;
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return ((math.cos(th) / math.sqrt(2.0)) * a2_m) * a2_m
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(Float64(cos(th) / sqrt(2.0)) * a2_m) * a2_m) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = ((cos(th) / sqrt(2.0)) * a2_m) * a2_m;
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision] * a2$95$m), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(\frac{\cos th}{\sqrt{2}} \cdot a2\_m\right) \cdot a2\_m
\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
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
+-commutativeN/A
pow2N/A
associate-*l/N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
associate-/l*N/A
*-commutativeN/A
pow2N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-/.f6478.1
Applied rewrites78.1%
a2_m = (fabs.f64 a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2_m th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2_m a2_m))) -1e-94)
(* (/ (fma (* (* th th) a2_m) -0.5 a2_m) (sqrt 2.0)) a2_m)
(fma 1.0 (* a1 (/ a1 (sqrt 2.0))) (* (/ (* 1.0 a2_m) (sqrt 2.0)) a2_m)))))a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2_m * a2_m))) <= -1e-94) {
tmp = (fma(((th * th) * a2_m), -0.5, a2_m) / sqrt(2.0)) * a2_m;
} else {
tmp = fma(1.0, (a1 * (a1 / sqrt(2.0))), (((1.0 * a2_m) / sqrt(2.0)) * a2_m));
}
return tmp;
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, 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_m * a2_m))) <= -1e-94) tmp = Float64(Float64(fma(Float64(Float64(th * th) * a2_m), -0.5, a2_m) / sqrt(2.0)) * a2_m); else tmp = fma(1.0, Float64(a1 * Float64(a1 / sqrt(2.0))), Float64(Float64(Float64(1.0 * a2_m) / sqrt(2.0)) * a2_m)); end return tmp end
a2_m = N[Abs[a2], $MachinePrecision]
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
code[a1_, 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[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-94], N[(N[(N[(N[(N[(th * th), $MachinePrecision] * a2$95$m), $MachinePrecision] * -0.5 + a2$95$m), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision], N[(1.0 * N[(a1 * N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(1.0 * a2$95$m), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, 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\_m \cdot a2\_m\right) \leq -1 \cdot 10^{-94}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(th \cdot th\right) \cdot a2\_m, -0.5, a2\_m\right)}{\sqrt{2}} \cdot a2\_m\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(1, a1 \cdot \frac{a1}{\sqrt{2}}, \frac{1 \cdot a2\_m}{\sqrt{2}} \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))) < -9.9999999999999996e-95Initial program 99.5%
Taylor expanded in a1 around 0
associate-/l*N/A
*-commutativeN/A
pow2N/A
associate-*r*N/A
lower-*.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f6478.1
Applied rewrites78.1%
Taylor expanded in th around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow2N/A
lift-*.f6450.8
Applied rewrites50.8%
if -9.9999999999999996e-95 < (+.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%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
pow2N/A
associate-*l/N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.6%
Taylor expanded in th around 0
Applied rewrites90.0%
Taylor expanded in th around 0
Applied rewrites66.5%
a2_m = (fabs.f64 a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2_m th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2_m a2_m))) -1e-94)
(* (/ (fma (* (* th th) a2_m) -0.5 a2_m) (sqrt 2.0)) a2_m)
(/ (fma a2_m a2_m (* a1 a1)) (sqrt 2.0)))))a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2_m * a2_m))) <= -1e-94) {
tmp = (fma(((th * th) * a2_m), -0.5, a2_m) / sqrt(2.0)) * a2_m;
} else {
tmp = fma(a2_m, a2_m, (a1 * a1)) / sqrt(2.0);
}
return tmp;
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, 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_m * a2_m))) <= -1e-94) tmp = Float64(Float64(fma(Float64(Float64(th * th) * a2_m), -0.5, a2_m) / sqrt(2.0)) * a2_m); else tmp = Float64(fma(a2_m, a2_m, Float64(a1 * a1)) / sqrt(2.0)); end return tmp end
a2_m = N[Abs[a2], $MachinePrecision]
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
code[a1_, 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[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-94], N[(N[(N[(N[(N[(th * th), $MachinePrecision] * a2$95$m), $MachinePrecision] * -0.5 + a2$95$m), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision], N[(N[(a2$95$m * a2$95$m + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, 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\_m \cdot a2\_m\right) \leq -1 \cdot 10^{-94}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(th \cdot th\right) \cdot a2\_m, -0.5, a2\_m\right)}{\sqrt{2}} \cdot a2\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2\_m, a2\_m, 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))) < -9.9999999999999996e-95Initial program 99.5%
Taylor expanded in a1 around 0
associate-/l*N/A
*-commutativeN/A
pow2N/A
associate-*r*N/A
lower-*.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-cos.f64N/A
lift-sqrt.f6478.1
Applied rewrites78.1%
Taylor expanded in th around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow2N/A
lift-*.f6450.8
Applied rewrites50.8%
if -9.9999999999999996e-95 < (+.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.f6466.5
Applied rewrites66.5%
a2_m = (fabs.f64 a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2_m th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2_m a2_m))) -1e-94)
(* (/ (* (* th th) -0.5) (sqrt 2.0)) (* a2_m a2_m))
(/ (fma a2_m a2_m (* a1 a1)) (sqrt 2.0)))))a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2_m * a2_m))) <= -1e-94) {
tmp = (((th * th) * -0.5) / sqrt(2.0)) * (a2_m * a2_m);
} else {
tmp = fma(a2_m, a2_m, (a1 * a1)) / sqrt(2.0);
}
return tmp;
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, 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_m * a2_m))) <= -1e-94) tmp = Float64(Float64(Float64(Float64(th * th) * -0.5) / sqrt(2.0)) * Float64(a2_m * a2_m)); else tmp = Float64(fma(a2_m, a2_m, Float64(a1 * a1)) / sqrt(2.0)); end return tmp end
a2_m = N[Abs[a2], $MachinePrecision]
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
code[a1_, 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[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-94], N[(N[(N[(N[(th * th), $MachinePrecision] * -0.5), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(a2$95$m * a2$95$m + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, 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\_m \cdot a2\_m\right) \leq -1 \cdot 10^{-94}:\\
\;\;\;\;\frac{\left(th \cdot th\right) \cdot -0.5}{\sqrt{2}} \cdot \left(a2\_m \cdot a2\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2\_m, a2\_m, 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))) < -9.9999999999999996e-95Initial program 99.5%
Taylor expanded in th around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6471.6
Applied rewrites71.6%
Taylor expanded in th around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6461.3
Applied rewrites61.3%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
distribute-lft-outN/A
lower-*.f64N/A
Applied rewrites63.0%
Taylor expanded in th around inf
*-commutativeN/A
lower-*.f64N/A
pow2N/A
lift-*.f6416.6
Applied rewrites16.6%
Taylor expanded in a1 around 0
pow2N/A
lift-*.f6415.4
Applied rewrites15.4%
if -9.9999999999999996e-95 < (+.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.f6466.5
Applied rewrites66.5%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (/ (fma a2_m a2_m (* a1 a1)) (sqrt 2.0)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return fma(a2_m, a2_m, (a1 * a1)) / sqrt(2.0);
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(fma(a2_m, a2_m, Float64(a1 * a1)) / sqrt(2.0)) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(a2$95$m * a2$95$m + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\frac{\mathsf{fma}\left(a2\_m, a2\_m, a1 \cdot a1\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.5
Applied rewrites66.5%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (/ a2_m (sqrt 2.0)) a2_m))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (a2_m / sqrt(2.0)) * a2_m;
}
a2_m = private
NOTE: a1, a2_m, 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, a2_m, th)
use fmin_fmax_functions
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (a2_m / sqrt(2.0d0)) * a2_m
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return (a2_m / Math.sqrt(2.0)) * a2_m;
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return (a2_m / math.sqrt(2.0)) * a2_m
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(a2_m / sqrt(2.0)) * a2_m) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = (a2_m / sqrt(2.0)) * a2_m;
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\frac{a2\_m}{\sqrt{2}} \cdot a2\_m
\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.5
Applied rewrites66.5%
Taylor expanded in a1 around 0
pow2N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
lift-/.f6453.1
Applied rewrites53.1%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* a1 (/ a1 (sqrt 2.0))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return a1 * (a1 / sqrt(2.0));
}
a2_m = private
NOTE: a1, a2_m, 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, a2_m, th)
use fmin_fmax_functions
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a1 * (a1 / sqrt(2.0d0))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return a1 * (a1 / Math.sqrt(2.0));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return a1 * (a1 / math.sqrt(2.0))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(a1 * Float64(a1 / sqrt(2.0))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = a1 * (a1 / sqrt(2.0));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(a1 * N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
a1 \cdot \frac{a1}{\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.5
Applied rewrites66.5%
Taylor expanded in a1 around inf
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lift-sqrt.f6427.1
Applied rewrites27.1%
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lift-/.f6427.1
Applied rewrites27.1%
herbie shell --seed 2025142
(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))))