
(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}
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* (* s x) c_m)) (t_1 (cos (* 2.0 x))) (t_2 (* (* c_m s) x)))
(if (<= (/ t_1 (* (pow c_m 2.0) (* (* x (pow s 2.0)) x))) INFINITY)
(/ t_1 (* t_0 t_0))
(/ t_1 (* t_2 t_2)))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = (s * x) * c_m;
double t_1 = cos((2.0 * x));
double t_2 = (c_m * s) * x;
double tmp;
if ((t_1 / (pow(c_m, 2.0) * ((x * pow(s, 2.0)) * x))) <= ((double) INFINITY)) {
tmp = t_1 / (t_0 * t_0);
} else {
tmp = t_1 / (t_2 * t_2);
}
return tmp;
}
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = (s * x) * c_m;
double t_1 = Math.cos((2.0 * x));
double t_2 = (c_m * s) * x;
double tmp;
if ((t_1 / (Math.pow(c_m, 2.0) * ((x * Math.pow(s, 2.0)) * x))) <= Double.POSITIVE_INFINITY) {
tmp = t_1 / (t_0 * t_0);
} else {
tmp = t_1 / (t_2 * t_2);
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = (s * x) * c_m t_1 = math.cos((2.0 * x)) t_2 = (c_m * s) * x tmp = 0 if (t_1 / (math.pow(c_m, 2.0) * ((x * math.pow(s, 2.0)) * x))) <= math.inf: tmp = t_1 / (t_0 * t_0) else: tmp = t_1 / (t_2 * t_2) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(Float64(s * x) * c_m) t_1 = cos(Float64(2.0 * x)) t_2 = Float64(Float64(c_m * s) * x) tmp = 0.0 if (Float64(t_1 / Float64((c_m ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) <= Inf) tmp = Float64(t_1 / Float64(t_0 * t_0)); else tmp = Float64(t_1 / Float64(t_2 * t_2)); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = (s * x) * c_m;
t_1 = cos((2.0 * x));
t_2 = (c_m * s) * x;
tmp = 0.0;
if ((t_1 / ((c_m ^ 2.0) * ((x * (s ^ 2.0)) * x))) <= Inf)
tmp = t_1 / (t_0 * t_0);
else
tmp = t_1 / (t_2 * t_2);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[(s * x), $MachinePrecision] * c$95$m), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[N[(t$95$1 / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(t$95$1 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(t$95$1 / N[(t$95$2 * t$95$2), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \left(s \cdot x\right) \cdot c\_m\\
t_1 := \cos \left(2 \cdot x\right)\\
t_2 := \left(c\_m \cdot s\right) \cdot x\\
\mathbf{if}\;\frac{t\_1}{{c\_m}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)} \leq \infty:\\
\;\;\;\;\frac{t\_1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_1}{t\_2 \cdot t\_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))) < +inf.0Initial program 81.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites89.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-cos.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
cos-neg-revN/A
lift-cos.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6478.5
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
Applied rewrites97.2%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow-prod-downN/A
pow2N/A
unpow2N/A
sqr-neg-revN/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f6499.4
Applied rewrites99.4%
if +inf.0 < (/.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 0.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.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-cos.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
cos-neg-revN/A
lift-cos.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6466.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
Applied rewrites93.5%
lift-pow.f64N/A
unpow2N/A
lower-*.f6493.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.5
Applied rewrites93.5%
Final simplification98.3%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* (* x (pow s 2.0)) x)))))
(if (<= t_0 -2e-292)
(/ (/ -2.0 c_m) (* (* s s) c_m))
(if (<= t_0 INFINITY)
(/ (/ 1.0 (* (* (* (* s s) x) x) c_m)) c_m)
(/ 1.0 (* (* (* (* s c_m) s) c_m) (* x x)))))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = cos((2.0 * x)) / (pow(c_m, 2.0) * ((x * pow(s, 2.0)) * x));
double tmp;
if (t_0 <= -2e-292) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else if (t_0 <= ((double) INFINITY)) {
tmp = (1.0 / ((((s * s) * x) * x) * c_m)) / c_m;
} else {
tmp = 1.0 / ((((s * c_m) * s) * c_m) * (x * x));
}
return tmp;
}
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * ((x * Math.pow(s, 2.0)) * x));
double tmp;
if (t_0 <= -2e-292) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = (1.0 / ((((s * s) * x) * x) * c_m)) / c_m;
} else {
tmp = 1.0 / ((((s * c_m) * s) * c_m) * (x * x));
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * ((x * math.pow(s, 2.0)) * x)) tmp = 0 if t_0 <= -2e-292: tmp = (-2.0 / c_m) / ((s * s) * c_m) elif t_0 <= math.inf: tmp = (1.0 / ((((s * s) * x) * x) * c_m)) / c_m else: tmp = 1.0 / ((((s * c_m) * s) * c_m) * (x * x)) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) tmp = 0.0 if (t_0 <= -2e-292) tmp = Float64(Float64(-2.0 / c_m) / Float64(Float64(s * s) * c_m)); elseif (t_0 <= Inf) tmp = Float64(Float64(1.0 / Float64(Float64(Float64(Float64(s * s) * x) * x) * c_m)) / c_m); else tmp = Float64(1.0 / Float64(Float64(Float64(Float64(s * c_m) * s) * c_m) * Float64(x * x))); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = cos((2.0 * x)) / ((c_m ^ 2.0) * ((x * (s ^ 2.0)) * x));
tmp = 0.0;
if (t_0 <= -2e-292)
tmp = (-2.0 / c_m) / ((s * s) * c_m);
elseif (t_0 <= Inf)
tmp = (1.0 / ((((s * s) * x) * x) * c_m)) / c_m;
else
tmp = 1.0 / ((((s * c_m) * s) * c_m) * (x * x));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-292], N[(N[(-2.0 / c$95$m), $MachinePrecision] / N[(N[(s * s), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(N[(1.0 / N[(N[(N[(N[(s * s), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(1.0 / N[(N[(N[(N[(s * c$95$m), $MachinePrecision] * s), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}\\
\mathbf{if}\;t\_0 \leq -2 \cdot 10^{-292}:\\
\;\;\;\;\frac{\frac{-2}{c\_m}}{\left(s \cdot s\right) \cdot c\_m}\\
\mathbf{elif}\;t\_0 \leq \infty:\\
\;\;\;\;\frac{\frac{1}{\left(\left(\left(s \cdot s\right) \cdot x\right) \cdot x\right) \cdot c\_m}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\left(\left(s \cdot c\_m\right) \cdot s\right) \cdot c\_m\right) \cdot \left(x \cdot x\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))) < -2.0000000000000001e-292Initial program 77.5%
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 rewrites40.6%
Taylor expanded in x around inf
Applied rewrites45.0%
Applied rewrites45.0%
if -2.0000000000000001e-292 < (/.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))) < +inf.0Initial program 82.2%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites84.8%
Taylor expanded in x around 0
Applied rewrites82.6%
if +inf.0 < (/.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 0.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/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-*.f64N/A
lower-*.f6466.2
Applied rewrites66.2%
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6462.2
Applied rewrites62.2%
Taylor expanded in x around 0
Applied rewrites43.7%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (if (<= (/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* (* x (pow s 2.0)) x))) -2e-292) (/ (/ -2.0 c_m) (* (* s s) c_m)) (/ (/ (pow (* s c_m) -1.0) x) (* (* c_m s) x))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * ((x * pow(s, 2.0)) * x))) <= -2e-292) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else {
tmp = (pow((s * c_m), -1.0) / x) / ((c_m * s) * x);
}
return tmp;
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * ((x * (s ** 2.0d0)) * x))) <= (-2d-292)) then
tmp = ((-2.0d0) / c_m) / ((s * s) * c_m)
else
tmp = (((s * c_m) ** (-1.0d0)) / x) / ((c_m * s) * x)
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * ((x * Math.pow(s, 2.0)) * x))) <= -2e-292) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else {
tmp = (Math.pow((s * c_m), -1.0) / x) / ((c_m * s) * x);
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * ((x * math.pow(s, 2.0)) * x))) <= -2e-292: tmp = (-2.0 / c_m) / ((s * s) * c_m) else: tmp = (math.pow((s * c_m), -1.0) / x) / ((c_m * s) * x) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) <= -2e-292) tmp = Float64(Float64(-2.0 / c_m) / Float64(Float64(s * s) * c_m)); else tmp = Float64(Float64((Float64(s * c_m) ^ -1.0) / x) / Float64(Float64(c_m * s) * x)); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * ((x * (s ^ 2.0)) * x))) <= -2e-292)
tmp = (-2.0 / c_m) / ((s * s) * c_m);
else
tmp = (((s * c_m) ^ -1.0) / x) / ((c_m * s) * x);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-292], N[(N[(-2.0 / c$95$m), $MachinePrecision] / N[(N[(s * s), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[N[(s * c$95$m), $MachinePrecision], -1.0], $MachinePrecision] / x), $MachinePrecision] / N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)} \leq -2 \cdot 10^{-292}:\\
\;\;\;\;\frac{\frac{-2}{c\_m}}{\left(s \cdot s\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{{\left(s \cdot c\_m\right)}^{-1}}{x}}{\left(c\_m \cdot s\right) \cdot x}\\
\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))) < -2.0000000000000001e-292Initial program 77.5%
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 rewrites40.6%
Taylor expanded in x around inf
Applied rewrites45.0%
Applied rewrites45.0%
if -2.0000000000000001e-292 < (/.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 64.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites89.0%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-cos.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
cos-neg-revN/A
lift-cos.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6476.9
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
Applied rewrites96.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
Applied rewrites96.8%
Taylor expanded in x around 0
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6485.2
Applied rewrites85.2%
Final simplification81.1%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (if (<= (/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* (* x (pow s 2.0)) x))) -2e-292) (/ (/ -2.0 c_m) (* (* s s) c_m)) (/ 1.0 (pow (* x (* s c_m)) 2.0))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * ((x * pow(s, 2.0)) * x))) <= -2e-292) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else {
tmp = 1.0 / pow((x * (s * c_m)), 2.0);
}
return tmp;
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * ((x * (s ** 2.0d0)) * x))) <= (-2d-292)) then
tmp = ((-2.0d0) / c_m) / ((s * s) * c_m)
else
tmp = 1.0d0 / ((x * (s * c_m)) ** 2.0d0)
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * ((x * Math.pow(s, 2.0)) * x))) <= -2e-292) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else {
tmp = 1.0 / Math.pow((x * (s * c_m)), 2.0);
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * ((x * math.pow(s, 2.0)) * x))) <= -2e-292: tmp = (-2.0 / c_m) / ((s * s) * c_m) else: tmp = 1.0 / math.pow((x * (s * c_m)), 2.0) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) <= -2e-292) tmp = Float64(Float64(-2.0 / c_m) / Float64(Float64(s * s) * c_m)); else tmp = Float64(1.0 / (Float64(x * Float64(s * c_m)) ^ 2.0)); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * ((x * (s ^ 2.0)) * x))) <= -2e-292)
tmp = (-2.0 / c_m) / ((s * s) * c_m);
else
tmp = 1.0 / ((x * (s * c_m)) ^ 2.0);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-292], N[(N[(-2.0 / c$95$m), $MachinePrecision] / N[(N[(s * s), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Power[N[(x * N[(s * c$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)} \leq -2 \cdot 10^{-292}:\\
\;\;\;\;\frac{\frac{-2}{c\_m}}{\left(s \cdot s\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{{\left(x \cdot \left(s \cdot c\_m\right)\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))) < -2.0000000000000001e-292Initial program 77.5%
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 rewrites40.6%
Taylor expanded in x around inf
Applied rewrites45.0%
Applied rewrites45.0%
if -2.0000000000000001e-292 < (/.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 64.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites89.0%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-cos.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
cos-neg-revN/A
lift-cos.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6476.9
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
Applied rewrites96.5%
Taylor expanded in x around 0
Applied rewrites85.3%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* (* c_m s) x)))
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* (* x (pow s 2.0)) x)))
-2e-292)
(/ (/ -2.0 c_m) (* (* s s) c_m))
(/ (/ 1.0 t_0) t_0))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * ((x * pow(s, 2.0)) * x))) <= -2e-292) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = (c_m * s) * x
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * ((x * (s ** 2.0d0)) * x))) <= (-2d-292)) then
tmp = ((-2.0d0) / c_m) / ((s * s) * c_m)
else
tmp = (1.0d0 / t_0) / t_0
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * ((x * Math.pow(s, 2.0)) * x))) <= -2e-292) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = (c_m * s) * x tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * ((x * math.pow(s, 2.0)) * x))) <= -2e-292: tmp = (-2.0 / c_m) / ((s * s) * c_m) else: tmp = (1.0 / t_0) / t_0 return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(Float64(c_m * s) * x) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) <= -2e-292) tmp = Float64(Float64(-2.0 / c_m) / Float64(Float64(s * s) * c_m)); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = (c_m * s) * x;
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * ((x * (s ^ 2.0)) * x))) <= -2e-292)
tmp = (-2.0 / c_m) / ((s * s) * c_m);
else
tmp = (1.0 / t_0) / t_0;
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-292], N[(N[(-2.0 / c$95$m), $MachinePrecision] / N[(N[(s * s), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\right) \cdot x\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)} \leq -2 \cdot 10^{-292}:\\
\;\;\;\;\frac{\frac{-2}{c\_m}}{\left(s \cdot s\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\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))) < -2.0000000000000001e-292Initial program 77.5%
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 rewrites40.6%
Taylor expanded in x around inf
Applied rewrites45.0%
Applied rewrites45.0%
if -2.0000000000000001e-292 < (/.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 64.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites89.0%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-cos.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
cos-neg-revN/A
lift-cos.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6476.9
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
Applied rewrites96.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
Applied rewrites96.8%
Taylor expanded in x around 0
Applied rewrites85.2%
Final simplification81.1%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (if (<= (/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* (* x (pow s 2.0)) x))) -2e-292) (/ (/ -2.0 c_m) (* (* s s) c_m)) (/ 1.0 (* (* (* (* s c_m) s) c_m) (* x x)))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * ((x * pow(s, 2.0)) * x))) <= -2e-292) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else {
tmp = 1.0 / ((((s * c_m) * s) * c_m) * (x * x));
}
return tmp;
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * ((x * (s ** 2.0d0)) * x))) <= (-2d-292)) then
tmp = ((-2.0d0) / c_m) / ((s * s) * c_m)
else
tmp = 1.0d0 / ((((s * c_m) * s) * c_m) * (x * x))
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * ((x * Math.pow(s, 2.0)) * x))) <= -2e-292) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else {
tmp = 1.0 / ((((s * c_m) * s) * c_m) * (x * x));
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * ((x * math.pow(s, 2.0)) * x))) <= -2e-292: tmp = (-2.0 / c_m) / ((s * s) * c_m) else: tmp = 1.0 / ((((s * c_m) * s) * c_m) * (x * x)) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) <= -2e-292) tmp = Float64(Float64(-2.0 / c_m) / Float64(Float64(s * s) * c_m)); else tmp = Float64(1.0 / Float64(Float64(Float64(Float64(s * c_m) * s) * c_m) * Float64(x * x))); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * ((x * (s ^ 2.0)) * x))) <= -2e-292)
tmp = (-2.0 / c_m) / ((s * s) * c_m);
else
tmp = 1.0 / ((((s * c_m) * s) * c_m) * (x * x));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-292], N[(N[(-2.0 / c$95$m), $MachinePrecision] / N[(N[(s * s), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(N[(N[(s * c$95$m), $MachinePrecision] * s), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)} \leq -2 \cdot 10^{-292}:\\
\;\;\;\;\frac{\frac{-2}{c\_m}}{\left(s \cdot s\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\left(\left(s \cdot c\_m\right) \cdot s\right) \cdot c\_m\right) \cdot \left(x \cdot x\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))) < -2.0000000000000001e-292Initial program 77.5%
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 rewrites40.6%
Taylor expanded in x around inf
Applied rewrites45.0%
Applied rewrites45.0%
if -2.0000000000000001e-292 < (/.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 64.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/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-*.f64N/A
lower-*.f6476.9
Applied rewrites76.9%
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6475.5
Applied rewrites75.5%
Taylor expanded in x around 0
Applied rewrites69.8%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (if (<= (/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* (* x (pow s 2.0)) x))) 0.0) (/ (/ -2.0 c_m) (* (* s s) c_m)) (/ (/ 2.0 c_m) (* (* s c_m) s))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * ((x * pow(s, 2.0)) * x))) <= 0.0) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else {
tmp = (2.0 / c_m) / ((s * c_m) * s);
}
return tmp;
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * ((x * (s ** 2.0d0)) * x))) <= 0.0d0) then
tmp = ((-2.0d0) / c_m) / ((s * s) * c_m)
else
tmp = (2.0d0 / c_m) / ((s * c_m) * s)
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * ((x * Math.pow(s, 2.0)) * x))) <= 0.0) {
tmp = (-2.0 / c_m) / ((s * s) * c_m);
} else {
tmp = (2.0 / c_m) / ((s * c_m) * s);
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * ((x * math.pow(s, 2.0)) * x))) <= 0.0: tmp = (-2.0 / c_m) / ((s * s) * c_m) else: tmp = (2.0 / c_m) / ((s * c_m) * s) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) <= 0.0) tmp = Float64(Float64(-2.0 / c_m) / Float64(Float64(s * s) * c_m)); else tmp = Float64(Float64(2.0 / c_m) / Float64(Float64(s * c_m) * s)); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * ((x * (s ^ 2.0)) * x))) <= 0.0)
tmp = (-2.0 / c_m) / ((s * s) * c_m);
else
tmp = (2.0 / c_m) / ((s * c_m) * s);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0], N[(N[(-2.0 / c$95$m), $MachinePrecision] / N[(N[(s * s), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 / c$95$m), $MachinePrecision] / N[(N[(s * c$95$m), $MachinePrecision] * s), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)} \leq 0:\\
\;\;\;\;\frac{\frac{-2}{c\_m}}{\left(s \cdot s\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{2}{c\_m}}{\left(s \cdot c\_m\right) \cdot s}\\
\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))) < 0.0Initial program 75.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 rewrites37.8%
Taylor expanded in x around inf
Applied rewrites49.7%
Applied rewrites53.4%
if 0.0 < (/.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 58.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 rewrites55.0%
Taylor expanded in x around inf
Applied rewrites1.1%
Applied rewrites3.8%
Applied rewrites44.0%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (cos (* 2.0 x))) (t_1 (* (* s c_m) x)))
(if (<= x 1.7e-54)
(/ (fma -2.0 (* x x) 1.0) (* t_1 t_1))
(if (<= x 4.2e+156)
(/ t_0 (* (* (* x x) c_m) (* (* s c_m) s)))
(/ t_0 (* (* (* (* (* c_m x) c_m) x) s) s))))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = cos((2.0 * x));
double t_1 = (s * c_m) * x;
double tmp;
if (x <= 1.7e-54) {
tmp = fma(-2.0, (x * x), 1.0) / (t_1 * t_1);
} else if (x <= 4.2e+156) {
tmp = t_0 / (((x * x) * c_m) * ((s * c_m) * s));
} else {
tmp = t_0 / (((((c_m * x) * c_m) * x) * s) * s);
}
return tmp;
}
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = cos(Float64(2.0 * x)) t_1 = Float64(Float64(s * c_m) * x) tmp = 0.0 if (x <= 1.7e-54) tmp = Float64(fma(-2.0, Float64(x * x), 1.0) / Float64(t_1 * t_1)); elseif (x <= 4.2e+156) tmp = Float64(t_0 / Float64(Float64(Float64(x * x) * c_m) * Float64(Float64(s * c_m) * s))); else tmp = Float64(t_0 / Float64(Float64(Float64(Float64(Float64(c_m * x) * c_m) * x) * s) * s)); end return tmp end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(s * c$95$m), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, 1.7e-54], N[(N[(-2.0 * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 4.2e+156], N[(t$95$0 / N[(N[(N[(x * x), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(N[(s * c$95$m), $MachinePrecision] * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(N[(N[(N[(c$95$m * x), $MachinePrecision] * c$95$m), $MachinePrecision] * x), $MachinePrecision] * s), $MachinePrecision] * s), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \cos \left(2 \cdot x\right)\\
t_1 := \left(s \cdot c\_m\right) \cdot x\\
\mathbf{if}\;x \leq 1.7 \cdot 10^{-54}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x \cdot x, 1\right)}{t\_1 \cdot t\_1}\\
\mathbf{elif}\;x \leq 4.2 \cdot 10^{+156}:\\
\;\;\;\;\frac{t\_0}{\left(\left(x \cdot x\right) \cdot c\_m\right) \cdot \left(\left(s \cdot c\_m\right) \cdot s\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\left(\left(\left(\left(c\_m \cdot x\right) \cdot c\_m\right) \cdot x\right) \cdot s\right) \cdot s}\\
\end{array}
\end{array}
if x < 1.69999999999999994e-54Initial program 64.7%
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 rewrites54.5%
Applied rewrites71.2%
if 1.69999999999999994e-54 < x < 4.19999999999999963e156Initial program 75.7%
Taylor expanded in x around 0
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6493.6
Applied rewrites93.6%
if 4.19999999999999963e156 < x Initial program 60.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-cos.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
cos-neg-revN/A
lift-cos.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6452.8
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
Applied rewrites92.0%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6479.4
Applied rewrites79.4%
Final simplification76.3%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* (* s c_m) x)) (t_1 (* (* c_m s) x)))
(if (<= x 1.7e-54)
(/ (fma -2.0 (* x x) 1.0) (* t_0 t_0))
(if (<= x 4.2e+157)
(/ (cos (* 2.0 x)) (* (* (* x x) c_m) (* (* s c_m) s)))
(/ (/ 1.0 t_1) t_1)))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = (s * c_m) * x;
double t_1 = (c_m * s) * x;
double tmp;
if (x <= 1.7e-54) {
tmp = fma(-2.0, (x * x), 1.0) / (t_0 * t_0);
} else if (x <= 4.2e+157) {
tmp = cos((2.0 * x)) / (((x * x) * c_m) * ((s * c_m) * s));
} else {
tmp = (1.0 / t_1) / t_1;
}
return tmp;
}
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(Float64(s * c_m) * x) t_1 = Float64(Float64(c_m * s) * x) tmp = 0.0 if (x <= 1.7e-54) tmp = Float64(fma(-2.0, Float64(x * x), 1.0) / Float64(t_0 * t_0)); elseif (x <= 4.2e+157) tmp = Float64(cos(Float64(2.0 * x)) / Float64(Float64(Float64(x * x) * c_m) * Float64(Float64(s * c_m) * s))); else tmp = Float64(Float64(1.0 / t_1) / t_1); end return tmp end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[(s * c$95$m), $MachinePrecision] * x), $MachinePrecision]}, Block[{t$95$1 = N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, 1.7e-54], N[(N[(-2.0 * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 4.2e+157], N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(x * x), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(N[(s * c$95$m), $MachinePrecision] * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \left(s \cdot c\_m\right) \cdot x\\
t_1 := \left(c\_m \cdot s\right) \cdot x\\
\mathbf{if}\;x \leq 1.7 \cdot 10^{-54}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x \cdot x, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{elif}\;x \leq 4.2 \cdot 10^{+157}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\right)}{\left(\left(x \cdot x\right) \cdot c\_m\right) \cdot \left(\left(s \cdot c\_m\right) \cdot s\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\end{array}
\end{array}
if x < 1.69999999999999994e-54Initial program 64.7%
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 rewrites54.5%
Applied rewrites71.2%
if 1.69999999999999994e-54 < x < 4.2e157Initial program 75.7%
Taylor expanded in x around 0
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6493.6
Applied rewrites93.6%
if 4.2e157 < x Initial program 60.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-cos.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
cos-neg-revN/A
lift-cos.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6452.8
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
Applied rewrites92.0%
lift-/.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6491.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
Applied rewrites91.9%
Taylor expanded in x around 0
Applied rewrites64.0%
Final simplification74.0%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* (* c_m s) x)) (t_1 (* (* s c_m) x)))
(if (<= x 4.8e-55)
(/ (fma -2.0 (* x x) 1.0) (* t_1 t_1))
(if (<= x 4.2e+157)
(/ (cos (+ x x)) (* (* (* (* s c_m) s) c_m) (* x x)))
(/ (/ 1.0 t_0) t_0)))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
double t_1 = (s * c_m) * x;
double tmp;
if (x <= 4.8e-55) {
tmp = fma(-2.0, (x * x), 1.0) / (t_1 * t_1);
} else if (x <= 4.2e+157) {
tmp = cos((x + x)) / ((((s * c_m) * s) * c_m) * (x * x));
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(Float64(c_m * s) * x) t_1 = Float64(Float64(s * c_m) * x) tmp = 0.0 if (x <= 4.8e-55) tmp = Float64(fma(-2.0, Float64(x * x), 1.0) / Float64(t_1 * t_1)); elseif (x <= 4.2e+157) tmp = Float64(cos(Float64(x + x)) / Float64(Float64(Float64(Float64(s * c_m) * s) * c_m) * Float64(x * x))); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]}, Block[{t$95$1 = N[(N[(s * c$95$m), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, 4.8e-55], N[(N[(-2.0 * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 4.2e+157], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[(s * c$95$m), $MachinePrecision] * s), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\right) \cdot x\\
t_1 := \left(s \cdot c\_m\right) \cdot x\\
\mathbf{if}\;x \leq 4.8 \cdot 10^{-55}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x \cdot x, 1\right)}{t\_1 \cdot t\_1}\\
\mathbf{elif}\;x \leq 4.2 \cdot 10^{+157}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{\left(\left(\left(s \cdot c\_m\right) \cdot s\right) \cdot c\_m\right) \cdot \left(x \cdot x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if x < 4.79999999999999983e-55Initial program 64.7%
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 rewrites54.5%
Applied rewrites71.2%
if 4.79999999999999983e-55 < x < 4.2e157Initial program 75.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/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-*.f64N/A
lower-*.f6493.7
Applied rewrites93.7%
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6493.7
Applied rewrites93.7%
lift-*.f64N/A
count-2-revN/A
lower-+.f6493.7
Applied rewrites93.7%
if 4.2e157 < x Initial program 60.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-cos.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
cos-neg-revN/A
lift-cos.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6452.8
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
Applied rewrites92.0%
lift-/.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6491.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
Applied rewrites91.9%
Taylor expanded in x around 0
Applied rewrites64.0%
Final simplification74.0%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (if (<= s 1.15e+82) (/ (cos (+ x x)) (* (* (* s s) x) (* (* c_m c_m) x))) (/ 1.0 (pow (* x (* s c_m)) 2.0))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double tmp;
if (s <= 1.15e+82) {
tmp = cos((x + x)) / (((s * s) * x) * ((c_m * c_m) * x));
} else {
tmp = 1.0 / pow((x * (s * c_m)), 2.0);
}
return tmp;
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: tmp
if (s <= 1.15d+82) then
tmp = cos((x + x)) / (((s * s) * x) * ((c_m * c_m) * x))
else
tmp = 1.0d0 / ((x * (s * c_m)) ** 2.0d0)
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double tmp;
if (s <= 1.15e+82) {
tmp = Math.cos((x + x)) / (((s * s) * x) * ((c_m * c_m) * x));
} else {
tmp = 1.0 / Math.pow((x * (s * c_m)), 2.0);
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): tmp = 0 if s <= 1.15e+82: tmp = math.cos((x + x)) / (((s * s) * x) * ((c_m * c_m) * x)) else: tmp = 1.0 / math.pow((x * (s * c_m)), 2.0) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) tmp = 0.0 if (s <= 1.15e+82) tmp = Float64(cos(Float64(x + x)) / Float64(Float64(Float64(s * s) * x) * Float64(Float64(c_m * c_m) * x))); else tmp = Float64(1.0 / (Float64(x * Float64(s * c_m)) ^ 2.0)); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
tmp = 0.0;
if (s <= 1.15e+82)
tmp = cos((x + x)) / (((s * s) * x) * ((c_m * c_m) * x));
else
tmp = 1.0 / ((x * (s * c_m)) ^ 2.0);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := If[LessEqual[s, 1.15e+82], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(s * s), $MachinePrecision] * x), $MachinePrecision] * N[(N[(c$95$m * c$95$m), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Power[N[(x * N[(s * c$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
\mathbf{if}\;s \leq 1.15 \cdot 10^{+82}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{\left(\left(s \cdot s\right) \cdot x\right) \cdot \left(\left(c\_m \cdot c\_m\right) \cdot x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{{\left(x \cdot \left(s \cdot c\_m\right)\right)}^{2}}\\
\end{array}
\end{array}
if s < 1.14999999999999994e82Initial program 67.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6468.6
lift-pow.f64N/A
unpow2N/A
lower-*.f6468.6
Applied rewrites68.6%
lift-*.f64N/A
count-2-revN/A
lower-+.f6468.6
Applied rewrites68.6%
if 1.14999999999999994e82 < s Initial program 56.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites87.1%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-cos.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
cos-neg-revN/A
lift-cos.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6482.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
Applied rewrites95.4%
Taylor expanded in x around 0
Applied rewrites83.5%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (let* ((t_0 (* (* c_m s) x))) (/ (cos (* 2.0 x)) (* t_0 t_0))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
return cos((2.0 * x)) / (t_0 * t_0);
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
t_0 = (c_m * s) * x
code = cos((2.0d0 * x)) / (t_0 * t_0)
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
return Math.cos((2.0 * x)) / (t_0 * t_0);
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = (c_m * s) * x return math.cos((2.0 * x)) / (t_0 * t_0)
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(Float64(c_m * s) * x) return Float64(cos(Float64(2.0 * x)) / Float64(t_0 * t_0)) end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp = code(x, c_m, s)
t_0 = (c_m * s) * x;
tmp = cos((2.0 * x)) / (t_0 * t_0);
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]}, N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\right) \cdot x\\
\frac{\cos \left(2 \cdot x\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
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 rewrites88.2%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-cos.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
cos-neg-revN/A
lift-cos.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6476.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
Applied rewrites96.5%
lift-pow.f64N/A
unpow2N/A
lower-*.f6496.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.5
Applied rewrites96.5%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (/ (/ -2.0 c_m) (* (* s s) c_m)))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
return (-2.0 / c_m) / ((s * s) * c_m);
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
code = ((-2.0d0) / c_m) / ((s * s) * c_m)
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
return (-2.0 / c_m) / ((s * s) * c_m);
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): return (-2.0 / c_m) / ((s * s) * c_m)
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) return Float64(Float64(-2.0 / c_m) / Float64(Float64(s * s) * c_m)) end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp = code(x, c_m, s)
tmp = (-2.0 / c_m) / ((s * s) * c_m);
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := N[(N[(-2.0 / c$95$m), $MachinePrecision] / N[(N[(s * s), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\frac{\frac{-2}{c\_m}}{\left(s \cdot s\right) \cdot c\_m}
\end{array}
Initial program 66.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 rewrites47.3%
Taylor expanded in x around inf
Applied rewrites22.8%
Applied rewrites25.9%
herbie shell --seed 2024360
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))