
(FPCore (w0 M D h l d) :precision binary64 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))
double code(double w0, double M, double D, double h, double l, double d) {
return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
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(w0, m, d, h, l, d_1)
use fmin_fmax_functions
real(8), intent (in) :: w0
real(8), intent (in) :: m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_1
code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function
public static double code(double w0, double M, double D, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
def code(w0, M, D, h, l, d): return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))
function code(w0, M, D, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))))) end
function tmp = code(w0, M, D, h, l, d) tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l)))); end
code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (w0 M D h l d) :precision binary64 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))
double code(double w0, double M, double D, double h, double l, double d) {
return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
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(w0, m, d, h, l, d_1)
use fmin_fmax_functions
real(8), intent (in) :: w0
real(8), intent (in) :: m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_1
code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function
public static double code(double w0, double M, double D, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
def code(w0, M, D, h, l, d): return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))
function code(w0, M, D, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))))) end
function tmp = code(w0, M, D, h, l, d) tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l)))); end
code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}
\end{array}
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (/ (* M_m D_m) (* 2.0 d_m)) 1e+54)
(*
w0
(sqrt
(- 1.0 (/ (* h (/ (* (* D_m M_m) (* D_m (/ M_m d_m))) (* d_m 4.0))) l))))
(*
w0
(sqrt
(/ (- l (* (* (/ h d_m) D_m) (* (* 0.25 D_m) (* (/ M_m d_m) M_m)))) l)))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((M_m * D_m) / (2.0 * d_m)) <= 1e+54) {
tmp = w0 * sqrt((1.0 - ((h * (((D_m * M_m) * (D_m * (M_m / d_m))) / (d_m * 4.0))) / l)));
} else {
tmp = w0 * sqrt(((l - (((h / d_m) * D_m) * ((0.25 * D_m) * ((M_m / d_m) * M_m)))) / l));
}
return tmp;
}
d_m = private
D_m = private
M_m = private
NOTE: w0, M_m, D_m, h, l, and d_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(w0, m_m, d_m, h, l, d_m_1)
use fmin_fmax_functions
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (((m_m * d_m) / (2.0d0 * d_m_1)) <= 1d+54) then
tmp = w0 * sqrt((1.0d0 - ((h * (((d_m * m_m) * (d_m * (m_m / d_m_1))) / (d_m_1 * 4.0d0))) / l)))
else
tmp = w0 * sqrt(((l - (((h / d_m_1) * d_m) * ((0.25d0 * d_m) * ((m_m / d_m_1) * m_m)))) / l))
end if
code = tmp
end function
d_m = Math.abs(d);
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((M_m * D_m) / (2.0 * d_m)) <= 1e+54) {
tmp = w0 * Math.sqrt((1.0 - ((h * (((D_m * M_m) * (D_m * (M_m / d_m))) / (d_m * 4.0))) / l)));
} else {
tmp = w0 * Math.sqrt(((l - (((h / d_m) * D_m) * ((0.25 * D_m) * ((M_m / d_m) * M_m)))) / l));
}
return tmp;
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if ((M_m * D_m) / (2.0 * d_m)) <= 1e+54: tmp = w0 * math.sqrt((1.0 - ((h * (((D_m * M_m) * (D_m * (M_m / d_m))) / (d_m * 4.0))) / l))) else: tmp = w0 * math.sqrt(((l - (((h / d_m) * D_m) * ((0.25 * D_m) * ((M_m / d_m) * M_m)))) / l)) return tmp
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) <= 1e+54) tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(h * Float64(Float64(Float64(D_m * M_m) * Float64(D_m * Float64(M_m / d_m))) / Float64(d_m * 4.0))) / l)))); else tmp = Float64(w0 * sqrt(Float64(Float64(l - Float64(Float64(Float64(h / d_m) * D_m) * Float64(Float64(0.25 * D_m) * Float64(Float64(M_m / d_m) * M_m)))) / l))); end return tmp end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (((M_m * D_m) / (2.0 * d_m)) <= 1e+54)
tmp = w0 * sqrt((1.0 - ((h * (((D_m * M_m) * (D_m * (M_m / d_m))) / (d_m * 4.0))) / l)));
else
tmp = w0 * sqrt(((l - (((h / d_m) * D_m) * ((0.25 * D_m) * ((M_m / d_m) * M_m)))) / l));
end
tmp_2 = tmp;
end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 1e+54], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(h * N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * N[(D$95$m * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(l - N[(N[(N[(h / d$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(0.25 * D$95$m), $MachinePrecision] * N[(N[(M$95$m / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{M\_m \cdot D\_m}{2 \cdot d\_m} \leq 10^{+54}:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{h \cdot \frac{\left(D\_m \cdot M\_m\right) \cdot \left(D\_m \cdot \frac{M\_m}{d\_m}\right)}{d\_m \cdot 4}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\frac{\ell - \left(\frac{h}{d\_m} \cdot D\_m\right) \cdot \left(\left(0.25 \cdot D\_m\right) \cdot \left(\frac{M\_m}{d\_m} \cdot M\_m\right)\right)}{\ell}}\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 1.0000000000000001e54Initial program 86.0%
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6491.2
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6490.8
Applied rewrites90.8%
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-timesN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-eval90.8
Applied rewrites90.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6489.4
Applied rewrites89.4%
if 1.0000000000000001e54 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 61.5%
Taylor expanded in l around 0
lower-/.f64N/A
lower--.f64N/A
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6451.7
Applied rewrites51.7%
Applied rewrites62.6%
Applied rewrites68.3%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<=
(sqrt (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l))))
5e+20)
(*
w0
(fma D_m (* D_m (* (* -0.125 (* (/ M_m d_m) h)) (/ (/ M_m d_m) l))) 1.0))
(*
w0
(sqrt
(/ (- l (* (* (* (* 0.25 D_m) (/ (* D_m h) d_m)) M_m) (/ M_m d_m))) l)))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (sqrt((1.0 - (pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)))) <= 5e+20) {
tmp = w0 * fma(D_m, (D_m * ((-0.125 * ((M_m / d_m) * h)) * ((M_m / d_m) / l))), 1.0);
} else {
tmp = w0 * sqrt(((l - ((((0.25 * D_m) * ((D_m * h) / d_m)) * M_m) * (M_m / d_m))) / l));
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (sqrt(Float64(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)))) <= 5e+20) tmp = Float64(w0 * fma(D_m, Float64(D_m * Float64(Float64(-0.125 * Float64(Float64(M_m / d_m) * h)) * Float64(Float64(M_m / d_m) / l))), 1.0)); else tmp = Float64(w0 * sqrt(Float64(Float64(l - Float64(Float64(Float64(Float64(0.25 * D_m) * Float64(Float64(D_m * h) / d_m)) * M_m) * Float64(M_m / d_m))) / l))); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 5e+20], N[(w0 * N[(D$95$m * N[(D$95$m * N[(N[(-0.125 * N[(N[(M$95$m / d$95$m), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] * N[(N[(M$95$m / d$95$m), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(l - N[(N[(N[(N[(0.25 * D$95$m), $MachinePrecision] * N[(N[(D$95$m * h), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\sqrt{1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell}} \leq 5 \cdot 10^{+20}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(D\_m, D\_m \cdot \left(\left(-0.125 \cdot \left(\frac{M\_m}{d\_m} \cdot h\right)\right) \cdot \frac{\frac{M\_m}{d\_m}}{\ell}\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\frac{\ell - \left(\left(\left(0.25 \cdot D\_m\right) \cdot \frac{D\_m \cdot h}{d\_m}\right) \cdot M\_m\right) \cdot \frac{M\_m}{d\_m}}{\ell}}\\
\end{array}
\end{array}
if (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))) < 5e20Initial program 100.0%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites61.5%
Applied rewrites62.2%
Applied rewrites66.8%
Applied rewrites94.9%
if 5e20 < (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))) Initial program 55.2%
Taylor expanded in l around 0
lower-/.f64N/A
lower--.f64N/A
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6444.3
Applied rewrites44.3%
Applied rewrites58.8%
Applied rewrites63.2%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(let* ((t_0 (/ (/ M_m d_m) l)))
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -2e+20)
(* w0 (sqrt (* (* (* (* -0.25 D_m) h) (* (/ t_0 d_m) M_m)) D_m)))
(* w0 (fma D_m (* D_m (* (* -0.125 (* (/ M_m d_m) h)) t_0)) 1.0)))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = (M_m / d_m) / l;
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -2e+20) {
tmp = w0 * sqrt(((((-0.25 * D_m) * h) * ((t_0 / d_m) * M_m)) * D_m));
} else {
tmp = w0 * fma(D_m, (D_m * ((-0.125 * ((M_m / d_m) * h)) * t_0)), 1.0);
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(Float64(M_m / d_m) / l) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= -2e+20) tmp = Float64(w0 * sqrt(Float64(Float64(Float64(Float64(-0.25 * D_m) * h) * Float64(Float64(t_0 / d_m) * M_m)) * D_m))); else tmp = Float64(w0 * fma(D_m, Float64(D_m * Float64(Float64(-0.125 * Float64(Float64(M_m / d_m) * h)) * t_0)), 1.0)); end return tmp end
d_m = N[Abs[d], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(N[(M$95$m / d$95$m), $MachinePrecision] / l), $MachinePrecision]}, If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+20], N[(w0 * N[Sqrt[N[(N[(N[(N[(-0.25 * D$95$m), $MachinePrecision] * h), $MachinePrecision] * N[(N[(t$95$0 / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[(D$95$m * N[(D$95$m * N[(N[(-0.125 * N[(N[(M$95$m / d$95$m), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{M\_m}{d\_m}}{\ell}\\
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+20}:\\
\;\;\;\;w0 \cdot \sqrt{\left(\left(\left(-0.25 \cdot D\_m\right) \cdot h\right) \cdot \left(\frac{t\_0}{d\_m} \cdot M\_m\right)\right) \cdot D\_m}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(D\_m, D\_m \cdot \left(\left(-0.125 \cdot \left(\frac{M\_m}{d\_m} \cdot h\right)\right) \cdot t\_0\right), 1\right)\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2e20Initial program 65.7%
Taylor expanded in M around inf
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6440.6
Applied rewrites40.6%
Applied rewrites47.7%
Applied rewrites51.0%
Applied rewrites56.3%
if -2e20 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.2%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites60.6%
Applied rewrites61.3%
Applied rewrites65.5%
Applied rewrites92.9%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -2e+20)
(*
w0
(sqrt (* (* -0.25 (* D_m D_m)) (/ (* (* (/ M_m d_m) M_m) h) (* l d_m)))))
(*
w0
(fma D_m (* D_m (* (* -0.125 (* (/ M_m d_m) h)) (/ (/ M_m d_m) l))) 1.0))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -2e+20) {
tmp = w0 * sqrt(((-0.25 * (D_m * D_m)) * ((((M_m / d_m) * M_m) * h) / (l * d_m))));
} else {
tmp = w0 * fma(D_m, (D_m * ((-0.125 * ((M_m / d_m) * h)) * ((M_m / d_m) / l))), 1.0);
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= -2e+20) tmp = Float64(w0 * sqrt(Float64(Float64(-0.25 * Float64(D_m * D_m)) * Float64(Float64(Float64(Float64(M_m / d_m) * M_m) * h) / Float64(l * d_m))))); else tmp = Float64(w0 * fma(D_m, Float64(D_m * Float64(Float64(-0.125 * Float64(Float64(M_m / d_m) * h)) * Float64(Float64(M_m / d_m) / l))), 1.0)); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+20], N[(w0 * N[Sqrt[N[(N[(-0.25 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(M$95$m / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * h), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[(D$95$m * N[(D$95$m * N[(N[(-0.125 * N[(N[(M$95$m / d$95$m), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] * N[(N[(M$95$m / d$95$m), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+20}:\\
\;\;\;\;w0 \cdot \sqrt{\left(-0.25 \cdot \left(D\_m \cdot D\_m\right)\right) \cdot \frac{\left(\frac{M\_m}{d\_m} \cdot M\_m\right) \cdot h}{\ell \cdot d\_m}}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(D\_m, D\_m \cdot \left(\left(-0.125 \cdot \left(\frac{M\_m}{d\_m} \cdot h\right)\right) \cdot \frac{\frac{M\_m}{d\_m}}{\ell}\right), 1\right)\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2e20Initial program 65.7%
Taylor expanded in M around inf
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6440.6
Applied rewrites40.6%
Applied rewrites49.7%
if -2e20 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.2%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites60.6%
Applied rewrites61.3%
Applied rewrites65.5%
Applied rewrites92.9%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -5e+83)
(*
w0
(fma (* (* D_m D_m) -0.125) (* h (* (/ M_m d_m) (/ M_m (* l d_m)))) 1.0))
(*
w0
(fma (* D_m (* D_m (/ (* (/ (* M_m M_m) l) h) d_m))) (/ -0.125 d_m) 1.0))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -5e+83) {
tmp = w0 * fma(((D_m * D_m) * -0.125), (h * ((M_m / d_m) * (M_m / (l * d_m)))), 1.0);
} else {
tmp = w0 * fma((D_m * (D_m * ((((M_m * M_m) / l) * h) / d_m))), (-0.125 / d_m), 1.0);
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= -5e+83) tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(h * Float64(Float64(M_m / d_m) * Float64(M_m / Float64(l * d_m)))), 1.0)); else tmp = Float64(w0 * fma(Float64(D_m * Float64(D_m * Float64(Float64(Float64(Float64(M_m * M_m) / l) * h) / d_m))), Float64(-0.125 / d_m), 1.0)); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+83], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(h * N[(N[(M$95$m / d$95$m), $MachinePrecision] * N[(M$95$m / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * N[(N[(D$95$m * N[(D$95$m * N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] / l), $MachinePrecision] * h), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+83}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, h \cdot \left(\frac{M\_m}{d\_m} \cdot \frac{M\_m}{\ell \cdot d\_m}\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(D\_m \cdot \left(D\_m \cdot \frac{\frac{M\_m \cdot M\_m}{\ell} \cdot h}{d\_m}\right), \frac{-0.125}{d\_m}, 1\right)\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -5.00000000000000029e83Initial program 64.2%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites38.1%
Applied rewrites39.4%
Applied rewrites42.4%
if -5.00000000000000029e83 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.5%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites59.2%
Taylor expanded in d around 0
Applied rewrites68.2%
Applied rewrites78.7%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -5e+83)
(*
w0
(fma (* (* D_m D_m) -0.125) (* h (* (/ M_m d_m) (/ M_m (* l d_m)))) 1.0))
(* w0 1.0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -5e+83) {
tmp = w0 * fma(((D_m * D_m) * -0.125), (h * ((M_m / d_m) * (M_m / (l * d_m)))), 1.0);
} else {
tmp = w0 * 1.0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= -5e+83) tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(h * Float64(Float64(M_m / d_m) * Float64(M_m / Float64(l * d_m)))), 1.0)); else tmp = Float64(w0 * 1.0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+83], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(h * N[(N[(M$95$m / d$95$m), $MachinePrecision] * N[(M$95$m / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+83}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, h \cdot \left(\frac{M\_m}{d\_m} \cdot \frac{M\_m}{\ell \cdot d\_m}\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot 1\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -5.00000000000000029e83Initial program 64.2%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites38.1%
Applied rewrites39.4%
Applied rewrites42.4%
if -5.00000000000000029e83 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.5%
Taylor expanded in M around 0
Applied rewrites94.4%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -1e+107)
(*
w0
(fma (/ (* (* (* D_m D_m) M_m) (* M_m h)) (* d_m l)) (/ -0.125 d_m) 1.0))
(* w0 1.0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -1e+107) {
tmp = w0 * fma(((((D_m * D_m) * M_m) * (M_m * h)) / (d_m * l)), (-0.125 / d_m), 1.0);
} else {
tmp = w0 * 1.0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= -1e+107) tmp = Float64(w0 * fma(Float64(Float64(Float64(Float64(D_m * D_m) * M_m) * Float64(M_m * h)) / Float64(d_m * l)), Float64(-0.125 / d_m), 1.0)); else tmp = Float64(w0 * 1.0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -1e+107], N[(w0 * N[(N[(N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m * h), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * l), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -1 \cdot 10^{+107}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(\frac{\left(\left(D\_m \cdot D\_m\right) \cdot M\_m\right) \cdot \left(M\_m \cdot h\right)}{d\_m \cdot \ell}, \frac{-0.125}{d\_m}, 1\right)\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot 1\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -9.9999999999999997e106Initial program 62.9%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites39.5%
Taylor expanded in d around 0
Applied rewrites42.7%
Applied rewrites43.8%
if -9.9999999999999997e106 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.6%
Taylor expanded in M around 0
Applied rewrites92.9%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -5e+83)
(*
w0
(fma (* (* D_m D_m) -0.125) (* h (* M_m (/ M_m (* (* d_m d_m) l)))) 1.0))
(* w0 1.0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -5e+83) {
tmp = w0 * fma(((D_m * D_m) * -0.125), (h * (M_m * (M_m / ((d_m * d_m) * l)))), 1.0);
} else {
tmp = w0 * 1.0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= -5e+83) tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(h * Float64(M_m * Float64(M_m / Float64(Float64(d_m * d_m) * l)))), 1.0)); else tmp = Float64(w0 * 1.0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+83], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(h * N[(M$95$m * N[(M$95$m / N[(N[(d$95$m * d$95$m), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+83}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, h \cdot \left(M\_m \cdot \frac{M\_m}{\left(d\_m \cdot d\_m\right) \cdot \ell}\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot 1\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -5.00000000000000029e83Initial program 64.2%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites38.1%
Applied rewrites39.4%
Applied rewrites39.9%
if -5.00000000000000029e83 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.5%
Taylor expanded in M around 0
Applied rewrites94.4%
Final simplification75.7%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -2e+279)
(*
w0
(fma (* (* D_m D_m) -0.125) (* M_m (/ (* M_m h) (* (* d_m l) d_m))) 1.0))
(* w0 1.0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -2e+279) {
tmp = w0 * fma(((D_m * D_m) * -0.125), (M_m * ((M_m * h) / ((d_m * l) * d_m))), 1.0);
} else {
tmp = w0 * 1.0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= -2e+279) tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(M_m * Float64(Float64(M_m * h) / Float64(Float64(d_m * l) * d_m))), 1.0)); else tmp = Float64(w0 * 1.0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+279], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(M$95$m * N[(N[(M$95$m * h), $MachinePrecision] / N[(N[(d$95$m * l), $MachinePrecision] * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+279}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, M\_m \cdot \frac{M\_m \cdot h}{\left(d\_m \cdot \ell\right) \cdot d\_m}, 1\right)\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot 1\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000012e279Initial program 55.8%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites45.4%
Applied rewrites46.9%
Applied rewrites48.4%
Applied rewrites48.7%
if -2.00000000000000012e279 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 91.3%
Taylor expanded in M around 0
Applied rewrites86.4%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(let* ((t_0 (* (/ M_m d_m) M_m)))
(if (<= D_m 1e+84)
(* w0 (sqrt (/ (- l (/ (* (* t_0 h) (* 0.25 (* D_m D_m))) d_m)) l)))
(* w0 (sqrt (/ (- l (* (* (/ h d_m) D_m) (* (* 0.25 D_m) t_0))) l))))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = (M_m / d_m) * M_m;
double tmp;
if (D_m <= 1e+84) {
tmp = w0 * sqrt(((l - (((t_0 * h) * (0.25 * (D_m * D_m))) / d_m)) / l));
} else {
tmp = w0 * sqrt(((l - (((h / d_m) * D_m) * ((0.25 * D_m) * t_0))) / l));
}
return tmp;
}
d_m = private
D_m = private
M_m = private
NOTE: w0, M_m, D_m, h, l, and d_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(w0, m_m, d_m, h, l, d_m_1)
use fmin_fmax_functions
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: t_0
real(8) :: tmp
t_0 = (m_m / d_m_1) * m_m
if (d_m <= 1d+84) then
tmp = w0 * sqrt(((l - (((t_0 * h) * (0.25d0 * (d_m * d_m))) / d_m_1)) / l))
else
tmp = w0 * sqrt(((l - (((h / d_m_1) * d_m) * ((0.25d0 * d_m) * t_0))) / l))
end if
code = tmp
end function
d_m = Math.abs(d);
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = (M_m / d_m) * M_m;
double tmp;
if (D_m <= 1e+84) {
tmp = w0 * Math.sqrt(((l - (((t_0 * h) * (0.25 * (D_m * D_m))) / d_m)) / l));
} else {
tmp = w0 * Math.sqrt(((l - (((h / d_m) * D_m) * ((0.25 * D_m) * t_0))) / l));
}
return tmp;
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): t_0 = (M_m / d_m) * M_m tmp = 0 if D_m <= 1e+84: tmp = w0 * math.sqrt(((l - (((t_0 * h) * (0.25 * (D_m * D_m))) / d_m)) / l)) else: tmp = w0 * math.sqrt(((l - (((h / d_m) * D_m) * ((0.25 * D_m) * t_0))) / l)) return tmp
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(Float64(M_m / d_m) * M_m) tmp = 0.0 if (D_m <= 1e+84) tmp = Float64(w0 * sqrt(Float64(Float64(l - Float64(Float64(Float64(t_0 * h) * Float64(0.25 * Float64(D_m * D_m))) / d_m)) / l))); else tmp = Float64(w0 * sqrt(Float64(Float64(l - Float64(Float64(Float64(h / d_m) * D_m) * Float64(Float64(0.25 * D_m) * t_0))) / l))); end return tmp end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
t_0 = (M_m / d_m) * M_m;
tmp = 0.0;
if (D_m <= 1e+84)
tmp = w0 * sqrt(((l - (((t_0 * h) * (0.25 * (D_m * D_m))) / d_m)) / l));
else
tmp = w0 * sqrt(((l - (((h / d_m) * D_m) * ((0.25 * D_m) * t_0))) / l));
end
tmp_2 = tmp;
end
d_m = N[Abs[d], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(N[(M$95$m / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]}, If[LessEqual[D$95$m, 1e+84], N[(w0 * N[Sqrt[N[(N[(l - N[(N[(N[(t$95$0 * h), $MachinePrecision] * N[(0.25 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(l - N[(N[(N[(h / d$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(0.25 * D$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := \frac{M\_m}{d\_m} \cdot M\_m\\
\mathbf{if}\;D\_m \leq 10^{+84}:\\
\;\;\;\;w0 \cdot \sqrt{\frac{\ell - \frac{\left(t\_0 \cdot h\right) \cdot \left(0.25 \cdot \left(D\_m \cdot D\_m\right)\right)}{d\_m}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\frac{\ell - \left(\frac{h}{d\_m} \cdot D\_m\right) \cdot \left(\left(0.25 \cdot D\_m\right) \cdot t\_0\right)}{\ell}}\\
\end{array}
\end{array}
if D < 1.00000000000000006e84Initial program 83.9%
Taylor expanded in l around 0
lower-/.f64N/A
lower--.f64N/A
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6464.7
Applied rewrites64.7%
Applied rewrites73.6%
if 1.00000000000000006e84 < D Initial program 69.9%
Taylor expanded in l around 0
lower-/.f64N/A
lower--.f64N/A
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6441.2
Applied rewrites41.2%
Applied rewrites57.5%
Applied rewrites72.8%
d_m = (fabs.f64 d) D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (let* ((t_0 (* (/ M_m d_m) D_m))) (* w0 (sqrt (- 1.0 (/ (* h (/ (* t_0 t_0) 4.0)) l))))))
d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = (M_m / d_m) * D_m;
return w0 * sqrt((1.0 - ((h * ((t_0 * t_0) / 4.0)) / l)));
}
d_m = private
D_m = private
M_m = private
NOTE: w0, M_m, D_m, h, l, and d_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(w0, m_m, d_m, h, l, d_m_1)
use fmin_fmax_functions
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: t_0
t_0 = (m_m / d_m_1) * d_m
code = w0 * sqrt((1.0d0 - ((h * ((t_0 * t_0) / 4.0d0)) / l)))
end function
d_m = Math.abs(d);
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = (M_m / d_m) * D_m;
return w0 * Math.sqrt((1.0 - ((h * ((t_0 * t_0) / 4.0)) / l)));
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): t_0 = (M_m / d_m) * D_m return w0 * math.sqrt((1.0 - ((h * ((t_0 * t_0) / 4.0)) / l)))
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(Float64(M_m / d_m) * D_m) return Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(h * Float64(Float64(t_0 * t_0) / 4.0)) / l)))) end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp = code(w0, M_m, D_m, h, l, d_m)
t_0 = (M_m / d_m) * D_m;
tmp = w0 * sqrt((1.0 - ((h * ((t_0 * t_0) / 4.0)) / l)));
end
d_m = N[Abs[d], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(N[(M$95$m / d$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]}, N[(w0 * N[Sqrt[N[(1.0 - N[(N[(h * N[(N[(t$95$0 * t$95$0), $MachinePrecision] / 4.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := \frac{M\_m}{d\_m} \cdot D\_m\\
w0 \cdot \sqrt{1 - \frac{h \cdot \frac{t\_0 \cdot t\_0}{4}}{\ell}}
\end{array}
\end{array}
Initial program 81.4%
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6485.8
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6486.6
Applied rewrites86.6%
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-timesN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-eval86.6
Applied rewrites86.6%
d_m = (fabs.f64 d) D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (* w0 (fma D_m (* D_m (* (* -0.125 (* (/ M_m d_m) h)) (/ (/ M_m d_m) l))) 1.0)))
d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return w0 * fma(D_m, (D_m * ((-0.125 * ((M_m / d_m) * h)) * ((M_m / d_m) / l))), 1.0);
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) return Float64(w0 * fma(D_m, Float64(D_m * Float64(Float64(-0.125 * Float64(Float64(M_m / d_m) * h)) * Float64(Float64(M_m / d_m) / l))), 1.0)) end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := N[(w0 * N[(D$95$m * N[(D$95$m * N[(N[(-0.125 * N[(N[(M$95$m / d$95$m), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] * N[(N[(M$95$m / d$95$m), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
w0 \cdot \mathsf{fma}\left(D\_m, D\_m \cdot \left(\left(-0.125 \cdot \left(\frac{M\_m}{d\_m} \cdot h\right)\right) \cdot \frac{\frac{M\_m}{d\_m}}{\ell}\right), 1\right)
\end{array}
Initial program 81.4%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites52.0%
Applied rewrites52.8%
Applied rewrites56.0%
Applied rewrites76.0%
d_m = (fabs.f64 d) D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (* w0 1.0))
d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return w0 * 1.0;
}
d_m = private
D_m = private
M_m = private
NOTE: w0, M_m, D_m, h, l, and d_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(w0, m_m, d_m, h, l, d_m_1)
use fmin_fmax_functions
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
code = w0 * 1.0d0
end function
d_m = Math.abs(d);
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return w0 * 1.0;
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): return w0 * 1.0
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) return Float64(w0 * 1.0) end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp = code(w0, M_m, D_m, h, l, d_m)
tmp = w0 * 1.0;
end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := N[(w0 * 1.0), $MachinePrecision]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
w0 \cdot 1
\end{array}
Initial program 81.4%
Taylor expanded in M around 0
Applied rewrites63.6%
herbie shell --seed 2025017
(FPCore (w0 M D h l d)
:name "Henrywood and Agarwal, Equation (9a)"
:precision binary64
(* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))