
(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 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))));
}
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)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* D_m M_m) 5e+143)
(*
w0
(sqrt (- 1.0 (* h (/ (/ (/ (* D_m (* M_m (* D_m M_m))) d) (* d 4.0)) l)))))
(*
w0
(sqrt
(fma
(* M_m (/ (* (* M_m 0.5) (* D_m h)) (* d l)))
(/ D_m (* d -2.0))
1.0)))))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((D_m * M_m) <= 5e+143) {
tmp = w0 * sqrt((1.0 - (h * ((((D_m * (M_m * (D_m * M_m))) / d) / (d * 4.0)) / l))));
} else {
tmp = w0 * sqrt(fma((M_m * (((M_m * 0.5) * (D_m * h)) / (d * l))), (D_m / (d * -2.0)), 1.0));
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(D_m * M_m) <= 5e+143) tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(h * Float64(Float64(Float64(Float64(D_m * Float64(M_m * Float64(D_m * M_m))) / d) / Float64(d * 4.0)) / l))))); else tmp = Float64(w0 * sqrt(fma(Float64(M_m * Float64(Float64(Float64(M_m * 0.5) * Float64(D_m * h)) / Float64(d * l))), Float64(D_m / Float64(d * -2.0)), 1.0))); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(D$95$m * M$95$m), $MachinePrecision], 5e+143], N[(w0 * N[Sqrt[N[(1.0 - N[(h * N[(N[(N[(N[(D$95$m * N[(M$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] / N[(d * 4.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(M$95$m * N[(N[(N[(M$95$m * 0.5), $MachinePrecision] * N[(D$95$m * h), $MachinePrecision]), $MachinePrecision] / N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / N[(d * -2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;D\_m \cdot M\_m \leq 5 \cdot 10^{+143}:\\
\;\;\;\;w0 \cdot \sqrt{1 - h \cdot \frac{\frac{\frac{D\_m \cdot \left(M\_m \cdot \left(D\_m \cdot M\_m\right)\right)}{d}}{d \cdot 4}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(M\_m \cdot \frac{\left(M\_m \cdot 0.5\right) \cdot \left(D\_m \cdot h\right)}{d \cdot \ell}, \frac{D\_m}{d \cdot -2}, 1\right)}\\
\end{array}
\end{array}
if (*.f64 M D) < 5.00000000000000012e143Initial program 83.7%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
Applied egg-rr77.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6486.0
Applied egg-rr86.0%
if 5.00000000000000012e143 < (*.f64 M D) Initial program 87.0%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
unpow2N/A
lift-/.f64N/A
associate-*l*N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
Applied egg-rr80.7%
Applied egg-rr80.3%
Final simplification85.3%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* (pow (/ (* D_m M_m) (* 2.0 d)) 2.0) (/ h l)) -0.01)
(*
w0
(sqrt
(-
1.0
(* (/ (* (* M_m 0.5) (* D_m h)) (* d l)) (/ (* M_m (* D_m 0.5)) d)))))
w0))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -0.01) {
tmp = w0 * sqrt((1.0 - ((((M_m * 0.5) * (D_m * h)) / (d * l)) * ((M_m * (D_m * 0.5)) / d))));
} else {
tmp = w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
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
real(8) :: tmp
if (((((d_m * m_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-0.01d0)) then
tmp = w0 * sqrt((1.0d0 - ((((m_m * 0.5d0) * (d_m * h)) / (d * l)) * ((m_m * (d_m * 0.5d0)) / d))))
else
tmp = w0
end if
code = tmp
end function
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;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((Math.pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -0.01) {
tmp = w0 * Math.sqrt((1.0 - ((((M_m * 0.5) * (D_m * h)) / (d * l)) * ((M_m * (D_m * 0.5)) / d))));
} else {
tmp = w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if (math.pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -0.01: tmp = w0 * math.sqrt((1.0 - ((((M_m * 0.5) * (D_m * h)) / (d * l)) * ((M_m * (D_m * 0.5)) / d)))) else: tmp = w0 return tmp
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64((Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -0.01) tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(M_m * 0.5) * Float64(D_m * h)) / Float64(d * l)) * Float64(Float64(M_m * Float64(D_m * 0.5)) / d))))); else tmp = w0; end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (((((D_m * M_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -0.01)
tmp = w0 * sqrt((1.0 - ((((M_m * 0.5) * (D_m * h)) / (d * l)) * ((M_m * (D_m * 0.5)) / d))));
else
tmp = w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -0.01], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(N[(N[(M$95$m * 0.5), $MachinePrecision] * N[(D$95$m * h), $MachinePrecision]), $MachinePrecision] / N[(d * l), $MachinePrecision]), $MachinePrecision] * N[(N[(M$95$m * N[(D$95$m * 0.5), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -0.01:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{\left(M\_m \cdot 0.5\right) \cdot \left(D\_m \cdot h\right)}{d \cdot \ell} \cdot \frac{M\_m \cdot \left(D\_m \cdot 0.5\right)}{d}}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\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)) < -0.0100000000000000002Initial program 70.9%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
unpow2N/A
lift-/.f64N/A
associate-*l*N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
Applied egg-rr66.1%
Applied egg-rr68.3%
if -0.0100000000000000002 < (*.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
Simplified98.4%
*-rgt-identity98.4
Applied egg-rr98.4%
Final simplification88.8%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* (pow (/ (* D_m M_m) (* 2.0 d)) 2.0) (/ h l)) -0.01)
(*
w0
(sqrt
(fma
(* M_m (/ (* (* M_m 0.5) (* D_m h)) (* d l)))
(/ D_m (* d -2.0))
1.0)))
w0))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -0.01) {
tmp = w0 * sqrt(fma((M_m * (((M_m * 0.5) * (D_m * h)) / (d * l))), (D_m / (d * -2.0)), 1.0));
} else {
tmp = w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64((Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -0.01) tmp = Float64(w0 * sqrt(fma(Float64(M_m * Float64(Float64(Float64(M_m * 0.5) * Float64(D_m * h)) / Float64(d * l))), Float64(D_m / Float64(d * -2.0)), 1.0))); else tmp = w0; end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -0.01], N[(w0 * N[Sqrt[N[(N[(M$95$m * N[(N[(N[(M$95$m * 0.5), $MachinePrecision] * N[(D$95$m * h), $MachinePrecision]), $MachinePrecision] / N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / N[(d * -2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -0.01:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(M\_m \cdot \frac{\left(M\_m \cdot 0.5\right) \cdot \left(D\_m \cdot h\right)}{d \cdot \ell}, \frac{D\_m}{d \cdot -2}, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\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)) < -0.0100000000000000002Initial program 70.9%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
unpow2N/A
lift-/.f64N/A
associate-*l*N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
Applied egg-rr66.1%
Applied egg-rr62.7%
if -0.0100000000000000002 < (*.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
Simplified98.4%
*-rgt-identity98.4
Applied egg-rr98.4%
Final simplification87.0%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* (pow (/ (* D_m M_m) (* 2.0 d)) 2.0) (/ h l)) -0.01)
(*
w0
(sqrt
(- 1.0 (* (* (* D_m M_m) (/ h (* d (* d l)))) (* (* D_m M_m) 0.25)))))
w0))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -0.01) {
tmp = w0 * sqrt((1.0 - (((D_m * M_m) * (h / (d * (d * l)))) * ((D_m * M_m) * 0.25))));
} else {
tmp = w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
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
real(8) :: tmp
if (((((d_m * m_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-0.01d0)) then
tmp = w0 * sqrt((1.0d0 - (((d_m * m_m) * (h / (d * (d * l)))) * ((d_m * m_m) * 0.25d0))))
else
tmp = w0
end if
code = tmp
end function
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;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((Math.pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -0.01) {
tmp = w0 * Math.sqrt((1.0 - (((D_m * M_m) * (h / (d * (d * l)))) * ((D_m * M_m) * 0.25))));
} else {
tmp = w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if (math.pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -0.01: tmp = w0 * math.sqrt((1.0 - (((D_m * M_m) * (h / (d * (d * l)))) * ((D_m * M_m) * 0.25)))) else: tmp = w0 return tmp
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64((Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -0.01) tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(Float64(D_m * M_m) * Float64(h / Float64(d * Float64(d * l)))) * Float64(Float64(D_m * M_m) * 0.25))))); else tmp = w0; end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (((((D_m * M_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -0.01)
tmp = w0 * sqrt((1.0 - (((D_m * M_m) * (h / (d * (d * l)))) * ((D_m * M_m) * 0.25))));
else
tmp = w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -0.01], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * N[(h / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m * M$95$m), $MachinePrecision] * 0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -0.01:\\
\;\;\;\;w0 \cdot \sqrt{1 - \left(\left(D\_m \cdot M\_m\right) \cdot \frac{h}{d \cdot \left(d \cdot \ell\right)}\right) \cdot \left(\left(D\_m \cdot M\_m\right) \cdot 0.25\right)}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\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)) < -0.0100000000000000002Initial program 70.9%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6470.9
Applied egg-rr60.9%
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
Applied egg-rr67.7%
if -0.0100000000000000002 < (*.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
Simplified98.4%
*-rgt-identity98.4
Applied egg-rr98.4%
Final simplification88.6%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* (pow (/ (* D_m M_m) (* 2.0 d)) 2.0) (/ h l)) -0.01)
(*
w0
(sqrt (- 1.0 (* h (* (* D_m M_m) (/ (* D_m M_m) (* 4.0 (* d (* d l)))))))))
w0))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -0.01) {
tmp = w0 * sqrt((1.0 - (h * ((D_m * M_m) * ((D_m * M_m) / (4.0 * (d * (d * l))))))));
} else {
tmp = w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
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
real(8) :: tmp
if (((((d_m * m_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-0.01d0)) then
tmp = w0 * sqrt((1.0d0 - (h * ((d_m * m_m) * ((d_m * m_m) / (4.0d0 * (d * (d * l))))))))
else
tmp = w0
end if
code = tmp
end function
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;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((Math.pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -0.01) {
tmp = w0 * Math.sqrt((1.0 - (h * ((D_m * M_m) * ((D_m * M_m) / (4.0 * (d * (d * l))))))));
} else {
tmp = w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if (math.pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -0.01: tmp = w0 * math.sqrt((1.0 - (h * ((D_m * M_m) * ((D_m * M_m) / (4.0 * (d * (d * l)))))))) else: tmp = w0 return tmp
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64((Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -0.01) tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(h * Float64(Float64(D_m * M_m) * Float64(Float64(D_m * M_m) / Float64(4.0 * Float64(d * Float64(d * l))))))))); else tmp = w0; end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (((((D_m * M_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -0.01)
tmp = w0 * sqrt((1.0 - (h * ((D_m * M_m) * ((D_m * M_m) / (4.0 * (d * (d * l))))))));
else
tmp = w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -0.01], N[(w0 * N[Sqrt[N[(1.0 - N[(h * N[(N[(D$95$m * M$95$m), $MachinePrecision] * N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(4.0 * N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -0.01:\\
\;\;\;\;w0 \cdot \sqrt{1 - h \cdot \left(\left(D\_m \cdot M\_m\right) \cdot \frac{D\_m \cdot M\_m}{4 \cdot \left(d \cdot \left(d \cdot \ell\right)\right)}\right)}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\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)) < -0.0100000000000000002Initial program 70.9%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
Applied egg-rr63.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-/l/N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
Applied egg-rr66.3%
if -0.0100000000000000002 < (*.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
Simplified98.4%
*-rgt-identity98.4
Applied egg-rr98.4%
Final simplification88.1%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (pow (/ (* D_m M_m) (* 2.0 d)) 2.0) (/ h l)) -5e+264) (fma (/ (* D_m (* M_m (* h (* D_m M_m)))) (* d (* d l))) (* w0 -0.125) w0) w0))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+264) {
tmp = fma(((D_m * (M_m * (h * (D_m * M_m)))) / (d * (d * l))), (w0 * -0.125), w0);
} else {
tmp = w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64((Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -5e+264) tmp = fma(Float64(Float64(D_m * Float64(M_m * Float64(h * Float64(D_m * M_m)))) / Float64(d * Float64(d * l))), Float64(w0 * -0.125), w0); else tmp = w0; end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+264], N[(N[(N[(D$95$m * N[(M$95$m * N[(h * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(w0 * -0.125), $MachinePrecision] + w0), $MachinePrecision], w0]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+264}:\\
\;\;\;\;\mathsf{fma}\left(\frac{D\_m \cdot \left(M\_m \cdot \left(h \cdot \left(D\_m \cdot M\_m\right)\right)\right)}{d \cdot \left(d \cdot \ell\right)}, w0 \cdot -0.125, w0\right)\\
\mathbf{else}:\\
\;\;\;\;w0\\
\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.00000000000000033e264Initial program 65.0%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
Simplified56.7%
Taylor expanded in w0 around 0
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified61.7%
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6463.5
Applied egg-rr63.5%
if -5.00000000000000033e264 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.9%
Taylor expanded in M around 0
Simplified91.8%
*-rgt-identity91.8
Applied egg-rr91.8%
Final simplification84.3%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (pow (/ (* D_m M_m) (* 2.0 d)) 2.0) (/ h l)) -5e+264) (fma (/ (* D_m (* h (* M_m (* D_m M_m)))) (* d (* d l))) (* w0 -0.125) w0) w0))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+264) {
tmp = fma(((D_m * (h * (M_m * (D_m * M_m)))) / (d * (d * l))), (w0 * -0.125), w0);
} else {
tmp = w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64((Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -5e+264) tmp = fma(Float64(Float64(D_m * Float64(h * Float64(M_m * Float64(D_m * M_m)))) / Float64(d * Float64(d * l))), Float64(w0 * -0.125), w0); else tmp = w0; end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+264], N[(N[(N[(D$95$m * N[(h * N[(M$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(w0 * -0.125), $MachinePrecision] + w0), $MachinePrecision], w0]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+264}:\\
\;\;\;\;\mathsf{fma}\left(\frac{D\_m \cdot \left(h \cdot \left(M\_m \cdot \left(D\_m \cdot M\_m\right)\right)\right)}{d \cdot \left(d \cdot \ell\right)}, w0 \cdot -0.125, w0\right)\\
\mathbf{else}:\\
\;\;\;\;w0\\
\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.00000000000000033e264Initial program 65.0%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
Simplified56.7%
Taylor expanded in w0 around 0
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified61.7%
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6463.5
Applied egg-rr63.5%
if -5.00000000000000033e264 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.9%
Taylor expanded in M around 0
Simplified91.8%
*-rgt-identity91.8
Applied egg-rr91.8%
Final simplification84.3%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (pow (/ (* D_m M_m) (* 2.0 d)) 2.0) (/ h l)) -5e+264) (fma (* D_m (* (* h (* M_m (* w0 M_m))) (/ -0.125 (* d (* d l))))) D_m w0) w0))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+264) {
tmp = fma((D_m * ((h * (M_m * (w0 * M_m))) * (-0.125 / (d * (d * l))))), D_m, w0);
} else {
tmp = w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64((Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -5e+264) tmp = fma(Float64(D_m * Float64(Float64(h * Float64(M_m * Float64(w0 * M_m))) * Float64(-0.125 / Float64(d * Float64(d * l))))), D_m, w0); else tmp = w0; end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+264], N[(N[(D$95$m * N[(N[(h * N[(M$95$m * N[(w0 * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * D$95$m + w0), $MachinePrecision], w0]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+264}:\\
\;\;\;\;\mathsf{fma}\left(D\_m \cdot \left(\left(h \cdot \left(M\_m \cdot \left(w0 \cdot M\_m\right)\right)\right) \cdot \frac{-0.125}{d \cdot \left(d \cdot \ell\right)}\right), D\_m, w0\right)\\
\mathbf{else}:\\
\;\;\;\;w0\\
\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.00000000000000033e264Initial program 65.0%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
Simplified56.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
Applied egg-rr63.4%
if -5.00000000000000033e264 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.9%
Taylor expanded in M around 0
Simplified91.8%
*-rgt-identity91.8
Applied egg-rr91.8%
Final simplification84.3%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (pow (/ (* D_m M_m) (* 2.0 d)) 2.0) (/ h l)) -5e+264) (* w0 (fma h (* (* -0.125 (* D_m D_m)) (/ (* M_m M_m) (* d (* d l)))) 1.0)) w0))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+264) {
tmp = w0 * fma(h, ((-0.125 * (D_m * D_m)) * ((M_m * M_m) / (d * (d * l)))), 1.0);
} else {
tmp = w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64((Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -5e+264) tmp = Float64(w0 * fma(h, Float64(Float64(-0.125 * Float64(D_m * D_m)) * Float64(Float64(M_m * M_m) / Float64(d * Float64(d * l)))), 1.0)); else tmp = w0; end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+264], N[(w0 * N[(h * N[(N[(-0.125 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(M$95$m * M$95$m), $MachinePrecision] / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+264}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(h, \left(-0.125 \cdot \left(D\_m \cdot D\_m\right)\right) \cdot \frac{M\_m \cdot M\_m}{d \cdot \left(d \cdot \ell\right)}, 1\right)\\
\mathbf{else}:\\
\;\;\;\;w0\\
\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.00000000000000033e264Initial program 65.0%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6465.0
Applied egg-rr61.3%
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
*-commutativeN/A
lower-fma.f64N/A
Simplified59.8%
if -5.00000000000000033e264 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.9%
Taylor expanded in M around 0
Simplified91.8%
*-rgt-identity91.8
Applied egg-rr91.8%
Final simplification83.3%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (pow (/ (* D_m M_m) (* 2.0 d)) 2.0) (/ h l)) -5e+264) (* (* D_m D_m) (* (* M_m (* M_m -0.125)) (* h (/ w0 (* d (* d l)))))) w0))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+264) {
tmp = (D_m * D_m) * ((M_m * (M_m * -0.125)) * (h * (w0 / (d * (d * l)))));
} else {
tmp = w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
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
real(8) :: tmp
if (((((d_m * m_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-5d+264)) then
tmp = (d_m * d_m) * ((m_m * (m_m * (-0.125d0))) * (h * (w0 / (d * (d * l)))))
else
tmp = w0
end if
code = tmp
end function
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;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((Math.pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+264) {
tmp = (D_m * D_m) * ((M_m * (M_m * -0.125)) * (h * (w0 / (d * (d * l)))));
} else {
tmp = w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if (math.pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+264: tmp = (D_m * D_m) * ((M_m * (M_m * -0.125)) * (h * (w0 / (d * (d * l))))) else: tmp = w0 return tmp
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64((Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -5e+264) tmp = Float64(Float64(D_m * D_m) * Float64(Float64(M_m * Float64(M_m * -0.125)) * Float64(h * Float64(w0 / Float64(d * Float64(d * l)))))); else tmp = w0; end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (((((D_m * M_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -5e+264)
tmp = (D_m * D_m) * ((M_m * (M_m * -0.125)) * (h * (w0 / (d * (d * l)))));
else
tmp = w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+264], N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(M$95$m * N[(M$95$m * -0.125), $MachinePrecision]), $MachinePrecision] * N[(h * N[(w0 / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+264}:\\
\;\;\;\;\left(D\_m \cdot D\_m\right) \cdot \left(\left(M\_m \cdot \left(M\_m \cdot -0.125\right)\right) \cdot \left(h \cdot \frac{w0}{d \cdot \left(d \cdot \ell\right)}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;w0\\
\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.00000000000000033e264Initial program 65.0%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
Simplified56.7%
Taylor expanded in w0 around 0
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified61.7%
Taylor expanded in D around inf
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6453.8
Simplified53.8%
Applied egg-rr59.8%
if -5.00000000000000033e264 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.9%
Taylor expanded in M around 0
Simplified91.8%
*-rgt-identity91.8
Applied egg-rr91.8%
Final simplification83.3%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (pow (/ (* D_m M_m) (* 2.0 d)) 2.0) (/ h l)) -5e+264) (* (* D_m D_m) (/ (* (* M_m -0.125) (* M_m (* w0 h))) (* l (* d d)))) w0))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+264) {
tmp = (D_m * D_m) * (((M_m * -0.125) * (M_m * (w0 * h))) / (l * (d * d)));
} else {
tmp = w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
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
real(8) :: tmp
if (((((d_m * m_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-5d+264)) then
tmp = (d_m * d_m) * (((m_m * (-0.125d0)) * (m_m * (w0 * h))) / (l * (d * d)))
else
tmp = w0
end if
code = tmp
end function
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;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((Math.pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+264) {
tmp = (D_m * D_m) * (((M_m * -0.125) * (M_m * (w0 * h))) / (l * (d * d)));
} else {
tmp = w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if (math.pow(((D_m * M_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+264: tmp = (D_m * D_m) * (((M_m * -0.125) * (M_m * (w0 * h))) / (l * (d * d))) else: tmp = w0 return tmp
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64((Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -5e+264) tmp = Float64(Float64(D_m * D_m) * Float64(Float64(Float64(M_m * -0.125) * Float64(M_m * Float64(w0 * h))) / Float64(l * Float64(d * d)))); else tmp = w0; end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (((((D_m * M_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -5e+264)
tmp = (D_m * D_m) * (((M_m * -0.125) * (M_m * (w0 * h))) / (l * (d * d)));
else
tmp = w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+264], N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[(M$95$m * -0.125), $MachinePrecision] * N[(M$95$m * N[(w0 * h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(l * N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+264}:\\
\;\;\;\;\left(D\_m \cdot D\_m\right) \cdot \frac{\left(M\_m \cdot -0.125\right) \cdot \left(M\_m \cdot \left(w0 \cdot h\right)\right)}{\ell \cdot \left(d \cdot d\right)}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\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.00000000000000033e264Initial program 65.0%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
Simplified56.7%
Taylor expanded in w0 around 0
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified61.7%
Taylor expanded in D around inf
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6453.8
Simplified53.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6456.7
Applied egg-rr56.7%
if -5.00000000000000033e264 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.9%
Taylor expanded in M around 0
Simplified91.8%
*-rgt-identity91.8
Applied egg-rr91.8%
Final simplification82.5%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(*
w0
(sqrt
(-
1.0
(* (/ D_m (* 2.0 d)) (* M_m (/ (* (/ (* D_m (* M_m 0.5)) d) h) l)))))))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
return w0 * sqrt((1.0 - ((D_m / (2.0 * d)) * (M_m * ((((D_m * (M_m * 0.5)) / d) * h) / l)))));
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
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
code = w0 * sqrt((1.0d0 - ((d_m / (2.0d0 * d)) * (m_m * ((((d_m * (m_m * 0.5d0)) / d) * h) / l)))))
end function
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;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - ((D_m / (2.0 * d)) * (M_m * ((((D_m * (M_m * 0.5)) / d) * h) / l)))));
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): return w0 * math.sqrt((1.0 - ((D_m / (2.0 * d)) * (M_m * ((((D_m * (M_m * 0.5)) / d) * h) / l)))))
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(D_m / Float64(2.0 * d)) * Float64(M_m * Float64(Float64(Float64(Float64(D_m * Float64(M_m * 0.5)) / d) * h) / l)))))) end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp = code(w0, M_m, D_m, h, l, d)
tmp = w0 * sqrt((1.0 - ((D_m / (2.0 * d)) * (M_m * ((((D_m * (M_m * 0.5)) / d) * h) / l)))));
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[(D$95$m / N[(2.0 * d), $MachinePrecision]), $MachinePrecision] * N[(M$95$m * N[(N[(N[(N[(D$95$m * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
w0 \cdot \sqrt{1 - \frac{D\_m}{2 \cdot d} \cdot \left(M\_m \cdot \frac{\frac{D\_m \cdot \left(M\_m \cdot 0.5\right)}{d} \cdot h}{\ell}\right)}
\end{array}
Initial program 84.0%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
unpow2N/A
lift-/.f64N/A
associate-*l*N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
Applied egg-rr87.2%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 w0)
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
return w0;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
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
code = w0
end function
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;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
return w0;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): return w0
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) return w0 end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp = code(w0, M_m, D_m, h, l, d)
tmp = w0;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := w0
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
w0
\end{array}
Initial program 84.0%
Taylor expanded in M around 0
Simplified68.9%
*-rgt-identity68.9
Applied egg-rr68.9%
herbie shell --seed 2024219
(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))))))