
(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))));
}
real(8) function code(w0, m, d, h, l, d_1)
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 11 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))));
}
real(8) function code(w0, m, d, h, l, d_1)
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)) 5e+16)
(*
w0
(sqrt
(fma
(/ (* D_m (* M_m (/ 0.5 d_m))) l)
(* (* h (* M_m (/ D_m d_m))) -0.5)
1.0)))
(*
w0
(sqrt
(fma
(* D_m (/ (* -0.5 M_m) d_m))
(* (* (/ h l) D_m) (* (/ 0.5 d_m) M_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 (((M_m * D_m) / (2.0 * d_m)) <= 5e+16) {
tmp = w0 * sqrt(fma(((D_m * (M_m * (0.5 / d_m))) / l), ((h * (M_m * (D_m / d_m))) * -0.5), 1.0));
} else {
tmp = w0 * sqrt(fma((D_m * ((-0.5 * M_m) / d_m)), (((h / l) * D_m) * ((0.5 / d_m) * M_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(M_m * D_m) / Float64(2.0 * d_m)) <= 5e+16) tmp = Float64(w0 * sqrt(fma(Float64(Float64(D_m * Float64(M_m * Float64(0.5 / d_m))) / l), Float64(Float64(h * Float64(M_m * Float64(D_m / d_m))) * -0.5), 1.0))); else tmp = Float64(w0 * sqrt(fma(Float64(D_m * Float64(Float64(-0.5 * M_m) / d_m)), Float64(Float64(Float64(h / l) * D_m) * Float64(Float64(0.5 / d_m) * M_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[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 5e+16], N[(w0 * N[Sqrt[N[(N[(N[(D$95$m * N[(M$95$m * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(N[(h * N[(M$95$m * N[(D$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(D$95$m * N[(N[(-0.5 * M$95$m), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h / l), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(0.5 / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $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 5 \cdot 10^{+16}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{D\_m \cdot \left(M\_m \cdot \frac{0.5}{d\_m}\right)}{\ell}, \left(h \cdot \left(M\_m \cdot \frac{D\_m}{d\_m}\right)\right) \cdot -0.5, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(D\_m \cdot \frac{-0.5 \cdot M\_m}{d\_m}, \left(\frac{h}{\ell} \cdot D\_m\right) \cdot \left(\frac{0.5}{d\_m} \cdot M\_m\right), 1\right)}\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 5e16Initial program 87.6%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
div-invN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites93.6%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
Applied rewrites93.6%
Taylor expanded in M around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6489.5
Applied rewrites89.5%
Applied rewrites93.0%
if 5e16 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 68.0%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
lower-fma.f64N/A
Applied rewrites70.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.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
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -20000000.0)
(*
w0
(sqrt
(fma
(* D_m (* M_m (/ -0.5 d_m)))
(/ (* (* h D_m) (* M_m 0.5)) (* 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)) <= -20000000.0) {
tmp = w0 * sqrt(fma((D_m * (M_m * (-0.5 / d_m))), (((h * D_m) * (M_m * 0.5)) / (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)) <= -20000000.0) tmp = Float64(w0 * sqrt(fma(Float64(D_m * Float64(M_m * Float64(-0.5 / d_m))), Float64(Float64(Float64(h * D_m) * Float64(M_m * 0.5)) / 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], -20000000.0], N[(w0 * N[Sqrt[N[(N[(D$95$m * N[(M$95$m * N[(-0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h * D$95$m), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $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 -20000000:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(D\_m \cdot \left(M\_m \cdot \frac{-0.5}{d\_m}\right), \frac{\left(h \cdot D\_m\right) \cdot \left(M\_m \cdot 0.5\right)}{\ell \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)) < -2e7Initial program 66.5%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
lower-fma.f64N/A
Applied rewrites67.8%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-timesN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
metadata-evalN/A
div-invN/A
lower-*.f64N/A
lower-*.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6462.9
Applied rewrites62.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6465.4
Applied rewrites65.4%
if -2e7 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 92.1%
Taylor expanded in M around 0
Applied rewrites97.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 (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -20000000.0)
(*
w0
(sqrt
(fma (* h -0.25) (* (* M_m (* M_m (/ D_m d_m))) (/ 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)) <= -20000000.0) {
tmp = w0 * sqrt(fma((h * -0.25), ((M_m * (M_m * (D_m / d_m))) * (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)) <= -20000000.0) tmp = Float64(w0 * sqrt(fma(Float64(h * -0.25), Float64(Float64(M_m * Float64(M_m * Float64(D_m / d_m))) * Float64(D_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], -20000000.0], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(M$95$m * N[(M$95$m * N[(D$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $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 -20000000:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \left(M\_m \cdot \left(M\_m \cdot \frac{D\_m}{d\_m}\right)\right) \cdot \frac{D\_m}{\ell \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)) < -2e7Initial program 66.5%
Taylor expanded in M around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites44.6%
Applied rewrites51.2%
Applied rewrites65.4%
if -2e7 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 92.1%
Taylor expanded in M around 0
Applied rewrites97.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 (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -5e+92)
(*
w0
(sqrt
(fma (* h -0.25) (* M_m (* (* D_m M_m) (/ D_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+92) {
tmp = w0 * sqrt(fma((h * -0.25), (M_m * ((D_m * M_m) * (D_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+92) tmp = Float64(w0 * sqrt(fma(Float64(h * -0.25), Float64(M_m * Float64(Float64(D_m * M_m) * Float64(D_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+92], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(M$95$m * N[(N[(D$95$m * M$95$m), $MachinePrecision] * N[(D$95$m / N[(N[(d$95$m * d$95$m), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $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^{+92}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, M\_m \cdot \left(\left(D\_m \cdot M\_m\right) \cdot \frac{D\_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.00000000000000022e92Initial program 65.7%
Taylor expanded in M around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites45.8%
Applied rewrites54.6%
if -5.00000000000000022e92 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 92.2%
Taylor expanded in M around 0
Applied rewrites96.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 (<= (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) 1e+304)
(*
w0
(sqrt
(fma (* h -0.25) (/ (* (* (/ M_m d_m) (/ (* D_m M_m) d_m)) D_m) l) 1.0)))
(*
w0
(sqrt
(fma
(* D_m (* M_m (/ -0.5 d_m)))
(/ (* (* h D_m) (* M_m 0.5)) (* l 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) <= 1e+304) {
tmp = w0 * sqrt(fma((h * -0.25), ((((M_m / d_m) * ((D_m * M_m) / d_m)) * D_m) / l), 1.0));
} else {
tmp = w0 * sqrt(fma((D_m * (M_m * (-0.5 / d_m))), (((h * D_m) * (M_m * 0.5)) / (l * 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(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) <= 1e+304) tmp = Float64(w0 * sqrt(fma(Float64(h * -0.25), Float64(Float64(Float64(Float64(M_m / d_m) * Float64(Float64(D_m * M_m) / d_m)) * D_m) / l), 1.0))); else tmp = Float64(w0 * sqrt(fma(Float64(D_m * Float64(M_m * Float64(-0.5 / d_m))), Float64(Float64(Float64(h * D_m) * Float64(M_m * 0.5)) / Float64(l * 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[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision], 1e+304], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(N[(N[(M$95$m / d$95$m), $MachinePrecision] * N[(N[(D$95$m * M$95$m), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] / l), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(D$95$m * N[(M$95$m * N[(-0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h * D$95$m), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $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}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \leq 10^{+304}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\frac{M\_m}{d\_m} \cdot \frac{D\_m \cdot M\_m}{d\_m}\right) \cdot D\_m}{\ell}, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(D\_m \cdot \left(M\_m \cdot \frac{-0.5}{d\_m}\right), \frac{\left(h \cdot D\_m\right) \cdot \left(M\_m \cdot 0.5\right)}{\ell \cdot d\_m}, 1\right)}\\
\end{array}
\end{array}
if (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) < 9.9999999999999994e303Initial program 89.7%
Taylor expanded in M around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites64.5%
Applied rewrites91.8%
if 9.9999999999999994e303 < (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) Initial program 60.2%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
lower-fma.f64N/A
Applied rewrites66.2%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-timesN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
metadata-evalN/A
div-invN/A
lower-*.f64N/A
lower-*.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6466.3
Applied rewrites66.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6468.3
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 (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -5e+92)
(fma
(* (* M_m (* M_m (* (/ w0 (* (* d_m d_m) l)) h))) D_m)
(* -0.125 D_m)
w0)
(* 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+92) {
tmp = fma(((M_m * (M_m * ((w0 / ((d_m * d_m) * l)) * h))) * D_m), (-0.125 * D_m), w0);
} 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+92) tmp = fma(Float64(Float64(M_m * Float64(M_m * Float64(Float64(w0 / Float64(Float64(d_m * d_m) * l)) * h))) * D_m), Float64(-0.125 * D_m), w0); 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+92], N[(N[(N[(M$95$m * N[(M$95$m * N[(N[(w0 / N[(N[(d$95$m * d$95$m), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + w0), $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^{+92}:\\
\;\;\;\;\mathsf{fma}\left(\left(M\_m \cdot \left(M\_m \cdot \left(\frac{w0}{\left(d\_m \cdot d\_m\right) \cdot \ell} \cdot h\right)\right)\right) \cdot D\_m, -0.125 \cdot D\_m, w0\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.00000000000000022e92Initial program 65.7%
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.6%
Applied rewrites44.9%
Applied rewrites51.4%
if -5.00000000000000022e92 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 92.2%
Taylor expanded in M around 0
Applied rewrites96.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 (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) (- INFINITY))
(fma
(* (* D_m D_m) -0.125)
(* (* (* M_m M_m) h) (/ w0 (* (* l d_m) d_m)))
w0)
(* 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)) <= -((double) INFINITY)) {
tmp = fma(((D_m * D_m) * -0.125), (((M_m * M_m) * h) * (w0 / ((l * d_m) * d_m))), w0);
} 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)) <= Float64(-Inf)) tmp = fma(Float64(Float64(D_m * D_m) * -0.125), Float64(Float64(Float64(M_m * M_m) * h) * Float64(w0 / Float64(Float64(l * d_m) * d_m))), w0); 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], (-Infinity)], N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * N[(w0 / N[(N[(l * d$95$m), $MachinePrecision] * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + w0), $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 -\infty:\\
\;\;\;\;\mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, \left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot \frac{w0}{\left(\ell \cdot d\_m\right) \cdot d\_m}, w0\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)) < -inf.0Initial program 58.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 rewrites46.2%
Applied rewrites46.2%
Applied rewrites48.1%
if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 92.7%
Taylor expanded in M around 0
Applied rewrites89.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
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) (- INFINITY))
(fma
(* (* D_m D_m) -0.125)
(* (* (* M_m M_m) h) (/ w0 (* (* d_m d_m) l)))
w0)
(* 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)) <= -((double) INFINITY)) {
tmp = fma(((D_m * D_m) * -0.125), (((M_m * M_m) * h) * (w0 / ((d_m * d_m) * l))), w0);
} 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)) <= Float64(-Inf)) tmp = fma(Float64(Float64(D_m * D_m) * -0.125), Float64(Float64(Float64(M_m * M_m) * h) * Float64(w0 / Float64(Float64(d_m * d_m) * l))), w0); 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], (-Infinity)], N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * N[(w0 / N[(N[(d$95$m * d$95$m), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + w0), $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 -\infty:\\
\;\;\;\;\mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, \left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot \frac{w0}{\left(d\_m \cdot d\_m\right) \cdot \ell}, w0\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)) < -inf.0Initial program 58.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 rewrites46.2%
Applied rewrites46.2%
if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 92.7%
Taylor expanded in M around 0
Applied rewrites89.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
(if (<= (/ (* M_m D_m) (* 2.0 d_m)) 5e+16)
(*
w0
(sqrt
(fma (* h -0.25) (/ (* (* (/ M_m d_m) (/ (* D_m M_m) d_m)) D_m) l) 1.0)))
(*
w0
(sqrt
(fma
(* D_m (/ (* -0.5 M_m) d_m))
(* (* (/ h l) D_m) (* (/ 0.5 d_m) M_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 (((M_m * D_m) / (2.0 * d_m)) <= 5e+16) {
tmp = w0 * sqrt(fma((h * -0.25), ((((M_m / d_m) * ((D_m * M_m) / d_m)) * D_m) / l), 1.0));
} else {
tmp = w0 * sqrt(fma((D_m * ((-0.5 * M_m) / d_m)), (((h / l) * D_m) * ((0.5 / d_m) * M_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(M_m * D_m) / Float64(2.0 * d_m)) <= 5e+16) tmp = Float64(w0 * sqrt(fma(Float64(h * -0.25), Float64(Float64(Float64(Float64(M_m / d_m) * Float64(Float64(D_m * M_m) / d_m)) * D_m) / l), 1.0))); else tmp = Float64(w0 * sqrt(fma(Float64(D_m * Float64(Float64(-0.5 * M_m) / d_m)), Float64(Float64(Float64(h / l) * D_m) * Float64(Float64(0.5 / d_m) * M_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[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 5e+16], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(N[(N[(M$95$m / d$95$m), $MachinePrecision] * N[(N[(D$95$m * M$95$m), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] / l), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(D$95$m * N[(N[(-0.5 * M$95$m), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h / l), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(0.5 / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $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 5 \cdot 10^{+16}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\frac{M\_m}{d\_m} \cdot \frac{D\_m \cdot M\_m}{d\_m}\right) \cdot D\_m}{\ell}, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(D\_m \cdot \frac{-0.5 \cdot M\_m}{d\_m}, \left(\frac{h}{\ell} \cdot D\_m\right) \cdot \left(\frac{0.5}{d\_m} \cdot M\_m\right), 1\right)}\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 5e16Initial program 87.6%
Taylor expanded in M around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites65.5%
Applied rewrites90.6%
if 5e16 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 68.0%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
lower-fma.f64N/A
Applied rewrites70.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.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 (let* ((t_0 (* D_m (* M_m (/ 0.5 d_m))))) (* w0 (sqrt (fma (/ t_0 l) (* (- 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 = D_m * (M_m * (0.5 / d_m));
return w0 * sqrt(fma((t_0 / l), (-h * t_0), 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) t_0 = Float64(D_m * Float64(M_m * Float64(0.5 / d_m))) return Float64(w0 * sqrt(fma(Float64(t_0 / l), Float64(Float64(-h) * t_0), 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_] := Block[{t$95$0 = N[(D$95$m * N[(M$95$m * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(w0 * N[Sqrt[N[(N[(t$95$0 / l), $MachinePrecision] * N[((-h) * t$95$0), $MachinePrecision] + 1.0), $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 := D\_m \cdot \left(M\_m \cdot \frac{0.5}{d\_m}\right)\\
w0 \cdot \sqrt{\mathsf{fma}\left(\frac{t\_0}{\ell}, \left(-h\right) \cdot t\_0, 1\right)}
\end{array}
\end{array}
Initial program 84.1%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
div-invN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites90.6%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
Applied rewrites90.6%
Final simplification90.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 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 = abs(d)
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
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 84.1%
Taylor expanded in M around 0
Applied rewrites68.6%
herbie shell --seed 2024307
(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))))))