
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
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(x, c, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
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(x, c, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* s_m x_m) c_m)))
(if (<= x_m 5.6e-11)
(/ (fma -2.0 (* x_m x_m) 1.0) (* t_0 t_0))
(if (<= x_m 1e+114)
(/ (cos (+ x_m x_m)) (* (* (* (* (* x_m x_m) c_m) s_m) c_m) s_m))
(/ (cos (* 2.0 x_m)) (* (* x_m c_m) (* (* s_m s_m) (* c_m x_m))))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 5.6e-11) {
tmp = fma(-2.0, (x_m * x_m), 1.0) / (t_0 * t_0);
} else if (x_m <= 1e+114) {
tmp = cos((x_m + x_m)) / (((((x_m * x_m) * c_m) * s_m) * c_m) * s_m);
} else {
tmp = cos((2.0 * x_m)) / ((x_m * c_m) * ((s_m * s_m) * (c_m * x_m)));
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 5.6e-11) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(t_0 * t_0)); elseif (x_m <= 1e+114) tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(Float64(Float64(Float64(x_m * x_m) * c_m) * s_m) * c_m) * s_m)); else tmp = Float64(cos(Float64(2.0 * x_m)) / Float64(Float64(x_m * c_m) * Float64(Float64(s_m * s_m) * Float64(c_m * x_m)))); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 5.6e-11], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x$95$m, 1e+114], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(N[(s$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 5.6 \cdot 10^{-11}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{elif}\;x\_m \leq 10^{+114}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(\left(\left(\left(x\_m \cdot x\_m\right) \cdot c\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot s\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\_m\right)}{\left(x\_m \cdot c\_m\right) \cdot \left(\left(s\_m \cdot s\_m\right) \cdot \left(c\_m \cdot x\_m\right)\right)}\\
\end{array}
\end{array}
if x < 5.6e-11Initial program 67.0%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites59.8%
Applied rewrites76.2%
if 5.6e-11 < x < 1e114Initial program 65.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f6488.8
Applied rewrites88.8%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
sqr-neg-revN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6495.9
Applied rewrites95.9%
lift-*.f64N/A
count-2-revN/A
lower-+.f6495.9
Applied rewrites95.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
sqr-neg-revN/A
associate-*r*N/A
associate-*l*N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites88.9%
if 1e114 < x Initial program 66.4%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6481.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6481.4
lift-pow.f64N/A
unpow2N/A
lower-*.f6481.4
Applied rewrites81.4%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lower-*.f6483.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6483.7
Applied rewrites83.7%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))
-1e-99)
(/ (- (/ (/ 1.0 x_m) x_m) 2.0) (* (* (* s_m c_m) c_m) s_m))
(/ 1.0 (pow (* (* s_m x_m) c_m) 2.0))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m))) <= -1e-99) {
tmp = (((1.0 / x_m) / x_m) - 2.0) / (((s_m * c_m) * c_m) * s_m);
} else {
tmp = 1.0 / pow(((s_m * x_m) * c_m), 2.0);
}
return tmp;
}
s_m = private
c_m = private
x_m = private
NOTE: x_m, c_m, and s_m 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(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((2.0d0 * x_m)) / ((c_m ** 2.0d0) * ((x_m * (s_m ** 2.0d0)) * x_m))) <= (-1d-99)) then
tmp = (((1.0d0 / x_m) / x_m) - 2.0d0) / (((s_m * c_m) * c_m) * s_m)
else
tmp = 1.0d0 / (((s_m * x_m) * c_m) ** 2.0d0)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if ((Math.cos((2.0 * x_m)) / (Math.pow(c_m, 2.0) * ((x_m * Math.pow(s_m, 2.0)) * x_m))) <= -1e-99) {
tmp = (((1.0 / x_m) / x_m) - 2.0) / (((s_m * c_m) * c_m) * s_m);
} else {
tmp = 1.0 / Math.pow(((s_m * x_m) * c_m), 2.0);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if (math.cos((2.0 * x_m)) / (math.pow(c_m, 2.0) * ((x_m * math.pow(s_m, 2.0)) * x_m))) <= -1e-99: tmp = (((1.0 / x_m) / x_m) - 2.0) / (((s_m * c_m) * c_m) * s_m) else: tmp = 1.0 / math.pow(((s_m * x_m) * c_m), 2.0) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(Float64(x_m * (s_m ^ 2.0)) * x_m))) <= -1e-99) tmp = Float64(Float64(Float64(Float64(1.0 / x_m) / x_m) - 2.0) / Float64(Float64(Float64(s_m * c_m) * c_m) * s_m)); else tmp = Float64(1.0 / (Float64(Float64(s_m * x_m) * c_m) ^ 2.0)); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if ((cos((2.0 * x_m)) / ((c_m ^ 2.0) * ((x_m * (s_m ^ 2.0)) * x_m))) <= -1e-99)
tmp = (((1.0 / x_m) / x_m) - 2.0) / (((s_m * c_m) * c_m) * s_m);
else
tmp = 1.0 / (((s_m * x_m) * c_m) ^ 2.0);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-99], N[(N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] - 2.0), $MachinePrecision] / N[(N[(N[(s$95$m * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Power[N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(\left(x\_m \cdot {s\_m}^{2}\right) \cdot x\_m\right)} \leq -1 \cdot 10^{-99}:\\
\;\;\;\;\frac{\frac{\frac{1}{x\_m}}{x\_m} - 2}{\left(\left(s\_m \cdot c\_m\right) \cdot c\_m\right) \cdot s\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{{\left(\left(s\_m \cdot x\_m\right) \cdot c\_m\right)}^{2}}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -1e-99Initial program 74.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites74.3%
Taylor expanded in x around 0
Applied rewrites55.7%
if -1e-99 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 66.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.8%
Taylor expanded in x around 0
Applied rewrites80.1%
Applied rewrites85.8%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))
-1e-99)
(/ (- 2.0) (* (* s_m c_m) (* s_m c_m)))
(/ (/ 1.0 x_m) (* (* (* s_m c_m) x_m) (* s_m c_m)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m))) <= -1e-99) {
tmp = -2.0 / ((s_m * c_m) * (s_m * c_m));
} else {
tmp = (1.0 / x_m) / (((s_m * c_m) * x_m) * (s_m * c_m));
}
return tmp;
}
s_m = private
c_m = private
x_m = private
NOTE: x_m, c_m, and s_m 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(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((2.0d0 * x_m)) / ((c_m ** 2.0d0) * ((x_m * (s_m ** 2.0d0)) * x_m))) <= (-1d-99)) then
tmp = -2.0d0 / ((s_m * c_m) * (s_m * c_m))
else
tmp = (1.0d0 / x_m) / (((s_m * c_m) * x_m) * (s_m * c_m))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if ((Math.cos((2.0 * x_m)) / (Math.pow(c_m, 2.0) * ((x_m * Math.pow(s_m, 2.0)) * x_m))) <= -1e-99) {
tmp = -2.0 / ((s_m * c_m) * (s_m * c_m));
} else {
tmp = (1.0 / x_m) / (((s_m * c_m) * x_m) * (s_m * c_m));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if (math.cos((2.0 * x_m)) / (math.pow(c_m, 2.0) * ((x_m * math.pow(s_m, 2.0)) * x_m))) <= -1e-99: tmp = -2.0 / ((s_m * c_m) * (s_m * c_m)) else: tmp = (1.0 / x_m) / (((s_m * c_m) * x_m) * (s_m * c_m)) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(Float64(x_m * (s_m ^ 2.0)) * x_m))) <= -1e-99) tmp = Float64(Float64(-2.0) / Float64(Float64(s_m * c_m) * Float64(s_m * c_m))); else tmp = Float64(Float64(1.0 / x_m) / Float64(Float64(Float64(s_m * c_m) * x_m) * Float64(s_m * c_m))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if ((cos((2.0 * x_m)) / ((c_m ^ 2.0) * ((x_m * (s_m ^ 2.0)) * x_m))) <= -1e-99)
tmp = -2.0 / ((s_m * c_m) * (s_m * c_m));
else
tmp = (1.0 / x_m) / (((s_m * c_m) * x_m) * (s_m * c_m));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-99], N[((-2.0) / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(\left(x\_m \cdot {s\_m}^{2}\right) \cdot x\_m\right)} \leq -1 \cdot 10^{-99}:\\
\;\;\;\;\frac{-2}{\left(s\_m \cdot c\_m\right) \cdot \left(s\_m \cdot c\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\left(\left(s\_m \cdot c\_m\right) \cdot x\_m\right) \cdot \left(s\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -1e-99Initial program 74.4%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites41.7%
Taylor expanded in x around inf
Applied rewrites55.7%
Applied rewrites55.6%
Applied rewrites55.7%
if -1e-99 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 66.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.8%
Taylor expanded in x around 0
Applied rewrites80.1%
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lift-/.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
sqr-neg-revN/A
lift-*.f64N/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
Applied rewrites85.2%
Final simplification83.5%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))
-1e-99)
(/ (- 2.0) (* (* s_m c_m) (* s_m c_m)))
(/ (/ (/ 2.0 (* s_m s_m)) c_m) c_m)))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m))) <= -1e-99) {
tmp = -2.0 / ((s_m * c_m) * (s_m * c_m));
} else {
tmp = ((2.0 / (s_m * s_m)) / c_m) / c_m;
}
return tmp;
}
s_m = private
c_m = private
x_m = private
NOTE: x_m, c_m, and s_m 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(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((2.0d0 * x_m)) / ((c_m ** 2.0d0) * ((x_m * (s_m ** 2.0d0)) * x_m))) <= (-1d-99)) then
tmp = -2.0d0 / ((s_m * c_m) * (s_m * c_m))
else
tmp = ((2.0d0 / (s_m * s_m)) / c_m) / c_m
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if ((Math.cos((2.0 * x_m)) / (Math.pow(c_m, 2.0) * ((x_m * Math.pow(s_m, 2.0)) * x_m))) <= -1e-99) {
tmp = -2.0 / ((s_m * c_m) * (s_m * c_m));
} else {
tmp = ((2.0 / (s_m * s_m)) / c_m) / c_m;
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if (math.cos((2.0 * x_m)) / (math.pow(c_m, 2.0) * ((x_m * math.pow(s_m, 2.0)) * x_m))) <= -1e-99: tmp = -2.0 / ((s_m * c_m) * (s_m * c_m)) else: tmp = ((2.0 / (s_m * s_m)) / c_m) / c_m return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(Float64(x_m * (s_m ^ 2.0)) * x_m))) <= -1e-99) tmp = Float64(Float64(-2.0) / Float64(Float64(s_m * c_m) * Float64(s_m * c_m))); else tmp = Float64(Float64(Float64(2.0 / Float64(s_m * s_m)) / c_m) / c_m); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if ((cos((2.0 * x_m)) / ((c_m ^ 2.0) * ((x_m * (s_m ^ 2.0)) * x_m))) <= -1e-99)
tmp = -2.0 / ((s_m * c_m) * (s_m * c_m));
else
tmp = ((2.0 / (s_m * s_m)) / c_m) / c_m;
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-99], N[((-2.0) / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 / N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / c$95$m), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(\left(x\_m \cdot {s\_m}^{2}\right) \cdot x\_m\right)} \leq -1 \cdot 10^{-99}:\\
\;\;\;\;\frac{-2}{\left(s\_m \cdot c\_m\right) \cdot \left(s\_m \cdot c\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{2}{s\_m \cdot s\_m}}{c\_m}}{c\_m}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -1e-99Initial program 74.4%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites41.7%
Taylor expanded in x around inf
Applied rewrites55.7%
Applied rewrites55.6%
Applied rewrites55.7%
if -1e-99 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 66.3%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites53.1%
Applied rewrites55.2%
Taylor expanded in x around inf
Applied rewrites50.6%
Final simplification50.9%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))
-1e-99)
(/ (- 2.0) (* (* s_m c_m) (* s_m c_m)))
(/ 1.0 (* (* (* x_m (* c_m s_m)) (* c_m s_m)) x_m))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m))) <= -1e-99) {
tmp = -2.0 / ((s_m * c_m) * (s_m * c_m));
} else {
tmp = 1.0 / (((x_m * (c_m * s_m)) * (c_m * s_m)) * x_m);
}
return tmp;
}
s_m = private
c_m = private
x_m = private
NOTE: x_m, c_m, and s_m 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(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((2.0d0 * x_m)) / ((c_m ** 2.0d0) * ((x_m * (s_m ** 2.0d0)) * x_m))) <= (-1d-99)) then
tmp = -2.0d0 / ((s_m * c_m) * (s_m * c_m))
else
tmp = 1.0d0 / (((x_m * (c_m * s_m)) * (c_m * s_m)) * x_m)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if ((Math.cos((2.0 * x_m)) / (Math.pow(c_m, 2.0) * ((x_m * Math.pow(s_m, 2.0)) * x_m))) <= -1e-99) {
tmp = -2.0 / ((s_m * c_m) * (s_m * c_m));
} else {
tmp = 1.0 / (((x_m * (c_m * s_m)) * (c_m * s_m)) * x_m);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if (math.cos((2.0 * x_m)) / (math.pow(c_m, 2.0) * ((x_m * math.pow(s_m, 2.0)) * x_m))) <= -1e-99: tmp = -2.0 / ((s_m * c_m) * (s_m * c_m)) else: tmp = 1.0 / (((x_m * (c_m * s_m)) * (c_m * s_m)) * x_m) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(Float64(x_m * (s_m ^ 2.0)) * x_m))) <= -1e-99) tmp = Float64(Float64(-2.0) / Float64(Float64(s_m * c_m) * Float64(s_m * c_m))); else tmp = Float64(1.0 / Float64(Float64(Float64(x_m * Float64(c_m * s_m)) * Float64(c_m * s_m)) * x_m)); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if ((cos((2.0 * x_m)) / ((c_m ^ 2.0) * ((x_m * (s_m ^ 2.0)) * x_m))) <= -1e-99)
tmp = -2.0 / ((s_m * c_m) * (s_m * c_m));
else
tmp = 1.0 / (((x_m * (c_m * s_m)) * (c_m * s_m)) * x_m);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-99], N[((-2.0) / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(\left(x\_m \cdot {s\_m}^{2}\right) \cdot x\_m\right)} \leq -1 \cdot 10^{-99}:\\
\;\;\;\;\frac{-2}{\left(s\_m \cdot c\_m\right) \cdot \left(s\_m \cdot c\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right) \cdot \left(c\_m \cdot s\_m\right)\right) \cdot x\_m}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -1e-99Initial program 74.4%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites41.7%
Taylor expanded in x around inf
Applied rewrites55.7%
Applied rewrites55.6%
Applied rewrites55.7%
if -1e-99 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 66.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f6486.6
Applied rewrites86.6%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
sqr-neg-revN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6494.6
Applied rewrites94.6%
Taylor expanded in x around 0
Applied rewrites85.2%
Final simplification83.4%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* s_m x_m) c_m)))
(if (<= x_m 1.45e-8)
(/ (fma -2.0 (* x_m x_m) 1.0) (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* (* (* x_m (* s_m c_m)) (* s_m c_m)) x_m)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 1.45e-8) {
tmp = fma(-2.0, (x_m * x_m), 1.0) / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / (((x_m * (s_m * c_m)) * (s_m * c_m)) * x_m);
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 1.45e-8) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(Float64(x_m * Float64(s_m * c_m)) * Float64(s_m * c_m)) * x_m)); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 1.45e-8], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 1.45 \cdot 10^{-8}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(\left(x\_m \cdot \left(s\_m \cdot c\_m\right)\right) \cdot \left(s\_m \cdot c\_m\right)\right) \cdot x\_m}\\
\end{array}
\end{array}
if x < 1.4500000000000001e-8Initial program 67.0%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites59.8%
Applied rewrites76.2%
if 1.4500000000000001e-8 < x Initial program 66.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f6483.9
Applied rewrites83.9%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
sqr-neg-revN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6493.1
Applied rewrites93.1%
lift-*.f64N/A
count-2-revN/A
lower-+.f6493.1
Applied rewrites93.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
sqr-neg-revN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f6493.1
Applied rewrites93.1%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* s_m x_m) c_m)))
(if (<= x_m 5e-33)
(/ (fma -2.0 (* x_m x_m) 1.0) (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* (* (* s_m c_m) (* c_m (* s_m x_m))) x_m)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 5e-33) {
tmp = fma(-2.0, (x_m * x_m), 1.0) / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / (((s_m * c_m) * (c_m * (s_m * x_m))) * x_m);
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 5e-33) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(Float64(s_m * c_m) * Float64(c_m * Float64(s_m * x_m))) * x_m)); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 5e-33], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 5 \cdot 10^{-33}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(\left(s\_m \cdot c\_m\right) \cdot \left(c\_m \cdot \left(s\_m \cdot x\_m\right)\right)\right) \cdot x\_m}\\
\end{array}
\end{array}
if x < 5.00000000000000028e-33Initial program 66.6%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites59.3%
Applied rewrites76.1%
if 5.00000000000000028e-33 < x Initial program 67.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f6485.1
Applied rewrites85.1%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
sqr-neg-revN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6493.6
Applied rewrites93.6%
lift-*.f64N/A
count-2-revN/A
lower-+.f6493.6
Applied rewrites93.6%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
sqr-neg-revN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f64N/A
Applied rewrites91.0%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* s_m x_m) c_m)))
(if (<= x_m 2e-8)
(/ (fma -2.0 (* x_m x_m) 1.0) (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* (* c_m (* (* s_m c_m) (* s_m x_m))) x_m)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 2e-8) {
tmp = fma(-2.0, (x_m * x_m), 1.0) / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / ((c_m * ((s_m * c_m) * (s_m * x_m))) * x_m);
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 2e-8) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(c_m * Float64(Float64(s_m * c_m) * Float64(s_m * x_m))) * x_m)); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 2e-8], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(c$95$m * N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 2 \cdot 10^{-8}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(c\_m \cdot \left(\left(s\_m \cdot c\_m\right) \cdot \left(s\_m \cdot x\_m\right)\right)\right) \cdot x\_m}\\
\end{array}
\end{array}
if x < 2e-8Initial program 67.0%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites59.8%
Applied rewrites76.2%
if 2e-8 < x Initial program 66.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f6483.9
Applied rewrites83.9%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
sqr-neg-revN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6493.1
Applied rewrites93.1%
lift-*.f64N/A
count-2-revN/A
lower-+.f6493.1
Applied rewrites93.1%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
sqr-neg-revN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites90.8%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= s_m 4.5e+164) (/ (cos (+ x_m x_m)) (* (* (* (* (* c_m x_m) c_m) s_m) s_m) x_m)) (/ 1.0 (pow (* (* s_m x_m) c_m) 2.0))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (s_m <= 4.5e+164) {
tmp = cos((x_m + x_m)) / (((((c_m * x_m) * c_m) * s_m) * s_m) * x_m);
} else {
tmp = 1.0 / pow(((s_m * x_m) * c_m), 2.0);
}
return tmp;
}
s_m = private
c_m = private
x_m = private
NOTE: x_m, c_m, and s_m 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(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (s_m <= 4.5d+164) then
tmp = cos((x_m + x_m)) / (((((c_m * x_m) * c_m) * s_m) * s_m) * x_m)
else
tmp = 1.0d0 / (((s_m * x_m) * c_m) ** 2.0d0)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (s_m <= 4.5e+164) {
tmp = Math.cos((x_m + x_m)) / (((((c_m * x_m) * c_m) * s_m) * s_m) * x_m);
} else {
tmp = 1.0 / Math.pow(((s_m * x_m) * c_m), 2.0);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if s_m <= 4.5e+164: tmp = math.cos((x_m + x_m)) / (((((c_m * x_m) * c_m) * s_m) * s_m) * x_m) else: tmp = 1.0 / math.pow(((s_m * x_m) * c_m), 2.0) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (s_m <= 4.5e+164) tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(Float64(Float64(Float64(c_m * x_m) * c_m) * s_m) * s_m) * x_m)); else tmp = Float64(1.0 / (Float64(Float64(s_m * x_m) * c_m) ^ 2.0)); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (s_m <= 4.5e+164)
tmp = cos((x_m + x_m)) / (((((c_m * x_m) * c_m) * s_m) * s_m) * x_m);
else
tmp = 1.0 / (((s_m * x_m) * c_m) ^ 2.0);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[s$95$m, 4.5e+164], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[(N[(c$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Power[N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;s\_m \leq 4.5 \cdot 10^{+164}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(\left(\left(\left(c\_m \cdot x\_m\right) \cdot c\_m\right) \cdot s\_m\right) \cdot s\_m\right) \cdot x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{{\left(\left(s\_m \cdot x\_m\right) \cdot c\_m\right)}^{2}}\\
\end{array}
\end{array}
if s < 4.49999999999999975e164Initial program 67.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f6485.6
Applied rewrites85.6%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
sqr-neg-revN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6493.9
Applied rewrites93.9%
lift-*.f64N/A
count-2-revN/A
lower-+.f6493.9
Applied rewrites93.9%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6485.6
Applied rewrites85.6%
if 4.49999999999999975e164 < s Initial program 61.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites87.7%
Taylor expanded in x around 0
Applied rewrites81.9%
Applied rewrites93.0%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* s_m x_m) c_m)))
(if (<= x_m 3.3e+42)
(/ (fma -2.0 (* x_m x_m) 1.0) (* t_0 t_0))
(/ (/ 1.0 x_m) (* (* (* s_m c_m) x_m) (* s_m c_m))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 3.3e+42) {
tmp = fma(-2.0, (x_m * x_m), 1.0) / (t_0 * t_0);
} else {
tmp = (1.0 / x_m) / (((s_m * c_m) * x_m) * (s_m * c_m));
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 3.3e+42) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(Float64(1.0 / x_m) / Float64(Float64(Float64(s_m * c_m) * x_m) * Float64(s_m * c_m))); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 3.3e+42], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 3.3 \cdot 10^{+42}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\left(\left(s\_m \cdot c\_m\right) \cdot x\_m\right) \cdot \left(s\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if x < 3.2999999999999999e42Initial program 66.9%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites60.3%
Applied rewrites75.7%
if 3.2999999999999999e42 < x Initial program 66.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.3%
Taylor expanded in x around 0
Applied rewrites58.4%
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lift-/.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
sqr-neg-revN/A
lift-*.f64N/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
Applied rewrites59.4%
Final simplification72.3%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 2.0 (* (* (* (- s_m) s_m) c_m) c_m)))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 2.0 / (((-s_m * s_m) * c_m) * c_m);
}
s_m = private
c_m = private
x_m = private
NOTE: x_m, c_m, and s_m 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(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 2.0d0 / (((-s_m * s_m) * c_m) * c_m)
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 2.0 / (((-s_m * s_m) * c_m) * c_m);
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 2.0 / (((-s_m * s_m) * c_m) * c_m)
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(2.0 / Float64(Float64(Float64(Float64(-s_m) * s_m) * c_m) * c_m)) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 2.0 / (((-s_m * s_m) * c_m) * c_m);
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(2.0 / N[(N[(N[((-s$95$m) * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{2}{\left(\left(\left(-s\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot c\_m}
\end{array}
Initial program 66.8%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites52.4%
Taylor expanded in x around inf
Applied rewrites27.9%
Applied rewrites27.5%
Applied rewrites28.1%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (- 2.0) (* (* s_m s_m) (* c_m c_m))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return -2.0 / ((s_m * s_m) * (c_m * c_m));
}
s_m = private
c_m = private
x_m = private
NOTE: x_m, c_m, and s_m 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(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = -2.0d0 / ((s_m * s_m) * (c_m * c_m))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return -2.0 / ((s_m * s_m) * (c_m * c_m));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return -2.0 / ((s_m * s_m) * (c_m * c_m))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(-2.0) / Float64(Float64(s_m * s_m) * Float64(c_m * c_m))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = -2.0 / ((s_m * s_m) * (c_m * c_m));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[((-2.0) / N[(N[(s$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{-2}{\left(s\_m \cdot s\_m\right) \cdot \left(c\_m \cdot c\_m\right)}
\end{array}
Initial program 66.8%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites52.4%
Taylor expanded in x around inf
Applied rewrites27.9%
Applied rewrites27.5%
Final simplification27.5%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (- 2.0) (* (* s_m c_m) (* s_m c_m))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return -2.0 / ((s_m * c_m) * (s_m * c_m));
}
s_m = private
c_m = private
x_m = private
NOTE: x_m, c_m, and s_m 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(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = -2.0d0 / ((s_m * c_m) * (s_m * c_m))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return -2.0 / ((s_m * c_m) * (s_m * c_m));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return -2.0 / ((s_m * c_m) * (s_m * c_m))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(-2.0) / Float64(Float64(s_m * c_m) * Float64(s_m * c_m))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = -2.0 / ((s_m * c_m) * (s_m * c_m));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[((-2.0) / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{-2}{\left(s\_m \cdot c\_m\right) \cdot \left(s\_m \cdot c\_m\right)}
\end{array}
Initial program 66.8%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites52.4%
Taylor expanded in x around inf
Applied rewrites27.9%
Applied rewrites27.5%
Applied rewrites25.6%
Final simplification25.6%
herbie shell --seed 2025003
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))