
(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}
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
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 (<= (* M_m D_m) 1e+111)
(*
w0
(sqrt
(- 1.0 (/ (/ (/ h (/ d (* (* M_m D_m) (* (* M_m D_m) 0.25)))) l) d))))
(*
w0
(sqrt
(- 1.0 (/ (* (* (/ D_m d) (* 0.25 (* M_m M_m))) (* h (/ D_m d))) l))))))M_m = fabs(M);
D_m = fabs(D);
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 ((M_m * D_m) <= 1e+111) {
tmp = w0 * sqrt((1.0 - (((h / (d / ((M_m * D_m) * ((M_m * D_m) * 0.25)))) / l) / d)));
} else {
tmp = w0 * sqrt((1.0 - ((((D_m / d) * (0.25 * (M_m * M_m))) * (h * (D_m / d))) / l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
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 ((m_m * d_m) <= 1d+111) then
tmp = w0 * sqrt((1.0d0 - (((h / (d / ((m_m * d_m) * ((m_m * d_m) * 0.25d0)))) / l) / d)))
else
tmp = w0 * sqrt((1.0d0 - ((((d_m / d) * (0.25d0 * (m_m * m_m))) * (h * (d_m / d))) / l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
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 ((M_m * D_m) <= 1e+111) {
tmp = w0 * Math.sqrt((1.0 - (((h / (d / ((M_m * D_m) * ((M_m * D_m) * 0.25)))) / l) / d)));
} else {
tmp = w0 * Math.sqrt((1.0 - ((((D_m / d) * (0.25 * (M_m * M_m))) * (h * (D_m / d))) / l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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 (M_m * D_m) <= 1e+111: tmp = w0 * math.sqrt((1.0 - (((h / (d / ((M_m * D_m) * ((M_m * D_m) * 0.25)))) / l) / d))) else: tmp = w0 * math.sqrt((1.0 - ((((D_m / d) * (0.25 * (M_m * M_m))) * (h * (D_m / d))) / l))) return tmp
M_m = abs(M) D_m = abs(D) 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(M_m * D_m) <= 1e+111) tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(Float64(h / Float64(d / Float64(Float64(M_m * D_m) * Float64(Float64(M_m * D_m) * 0.25)))) / l) / d)))); else tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(D_m / d) * Float64(0.25 * Float64(M_m * M_m))) * Float64(h * Float64(D_m / d))) / l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
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 ((M_m * D_m) <= 1e+111)
tmp = w0 * sqrt((1.0 - (((h / (d / ((M_m * D_m) * ((M_m * D_m) * 0.25)))) / l) / d)));
else
tmp = w0 * sqrt((1.0 - ((((D_m / d) * (0.25 * (M_m * M_m))) * (h * (D_m / d))) / l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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[(M$95$m * D$95$m), $MachinePrecision], 1e+111], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(N[(h / N[(d / N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(N[(M$95$m * D$95$m), $MachinePrecision] * 0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(h * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \cdot D\_m \leq 10^{+111}:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{\frac{\frac{h}{\frac{d}{\left(M\_m \cdot D\_m\right) \cdot \left(\left(M\_m \cdot D\_m\right) \cdot 0.25\right)}}}{\ell}}{d}}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{\left(\frac{D\_m}{d} \cdot \left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \left(h \cdot \frac{D\_m}{d}\right)}{\ell}}\\
\end{array}
\end{array}
if (*.f64 M D) < 9.99999999999999957e110Initial program 82.1%
unpow2N/A
associate-/r*N/A
associate-*r/N/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr79.1%
associate-*r/N/A
/-lowering-/.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
associate-/r/N/A
remove-double-divN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.1%
Applied egg-rr86.1%
if 9.99999999999999957e110 < (*.f64 M D) Initial program 63.2%
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr56.8%
Final simplification81.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
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 (<= (/ h l) -1e+287)
(*
w0
(+ 1.0 (* (/ -0.125 l) (* M_m (/ (/ D_m (/ d D_m)) (/ d (* M_m h)))))))
(if (<= (/ h l) -2e-323)
(*
w0
(sqrt
(- 1.0 (* (/ h l) (/ (* D_m (* (/ D_m d) (* 0.25 (* M_m M_m)))) d)))))
w0)))M_m = fabs(M);
D_m = fabs(D);
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 ((h / l) <= -1e+287) {
tmp = w0 * (1.0 + ((-0.125 / l) * (M_m * ((D_m / (d / D_m)) / (d / (M_m * h))))));
} else if ((h / l) <= -2e-323) {
tmp = w0 * sqrt((1.0 - ((h / l) * ((D_m * ((D_m / d) * (0.25 * (M_m * M_m)))) / d))));
} else {
tmp = w0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
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 ((h / l) <= (-1d+287)) then
tmp = w0 * (1.0d0 + (((-0.125d0) / l) * (m_m * ((d_m / (d / d_m)) / (d / (m_m * h))))))
else if ((h / l) <= (-2d-323)) then
tmp = w0 * sqrt((1.0d0 - ((h / l) * ((d_m * ((d_m / d) * (0.25d0 * (m_m * m_m)))) / d))))
else
tmp = w0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
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 ((h / l) <= -1e+287) {
tmp = w0 * (1.0 + ((-0.125 / l) * (M_m * ((D_m / (d / D_m)) / (d / (M_m * h))))));
} else if ((h / l) <= -2e-323) {
tmp = w0 * Math.sqrt((1.0 - ((h / l) * ((D_m * ((D_m / d) * (0.25 * (M_m * M_m)))) / d))));
} else {
tmp = w0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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 (h / l) <= -1e+287: tmp = w0 * (1.0 + ((-0.125 / l) * (M_m * ((D_m / (d / D_m)) / (d / (M_m * h)))))) elif (h / l) <= -2e-323: tmp = w0 * math.sqrt((1.0 - ((h / l) * ((D_m * ((D_m / d) * (0.25 * (M_m * M_m)))) / d)))) else: tmp = w0 return tmp
M_m = abs(M) D_m = abs(D) 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(h / l) <= -1e+287) tmp = Float64(w0 * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(M_m * Float64(Float64(D_m / Float64(d / D_m)) / Float64(d / Float64(M_m * h))))))); elseif (Float64(h / l) <= -2e-323) tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(h / l) * Float64(Float64(D_m * Float64(Float64(D_m / d) * Float64(0.25 * Float64(M_m * M_m)))) / d))))); else tmp = w0; end return tmp end
M_m = abs(M);
D_m = abs(D);
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 ((h / l) <= -1e+287)
tmp = w0 * (1.0 + ((-0.125 / l) * (M_m * ((D_m / (d / D_m)) / (d / (M_m * h))))));
elseif ((h / l) <= -2e-323)
tmp = w0 * sqrt((1.0 - ((h / l) * ((D_m * ((D_m / d) * (0.25 * (M_m * M_m)))) / d))));
else
tmp = w0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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[(h / l), $MachinePrecision], -1e+287], N[(w0 * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(M$95$m * N[(N[(D$95$m / N[(d / D$95$m), $MachinePrecision]), $MachinePrecision] / N[(d / N[(M$95$m * h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(h / l), $MachinePrecision], -2e-323], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(N[(D$95$m * N[(N[(D$95$m / d), $MachinePrecision] * N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \leq -1 \cdot 10^{+287}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{-0.125}{\ell} \cdot \left(M\_m \cdot \frac{\frac{D\_m}{\frac{d}{D\_m}}}{\frac{d}{M\_m \cdot h}}\right)\right)\\
\mathbf{elif}\;\frac{h}{\ell} \leq -2 \cdot 10^{-323}:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{h}{\ell} \cdot \frac{D\_m \cdot \left(\frac{D\_m}{d} \cdot \left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right)\right)}{d}}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -1.0000000000000001e287Initial program 69.1%
Taylor expanded in M around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6464.6%
Simplified64.6%
associate-*l/N/A
associate-/r/N/A
clear-numN/A
associate-/l/N/A
div-invN/A
associate-/r*N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6474.3%
Applied egg-rr74.3%
if -1.0000000000000001e287 < (/.f64 h l) < -1.97626e-323Initial program 81.5%
unpow2N/A
times-fracN/A
associate-*r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr68.8%
if -1.97626e-323 < (/.f64 h l) Initial program 78.0%
Taylor expanded in M around 0
Simplified91.7%
Final simplification78.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
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 (<= (/ h l) -2e-323)
(*
w0
(sqrt
(- 1.0 (/ (* (* (* M_m D_m) (* (* M_m D_m) (/ 0.25 d))) (/ h l)) d))))
w0))M_m = fabs(M);
D_m = fabs(D);
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 ((h / l) <= -2e-323) {
tmp = w0 * sqrt((1.0 - ((((M_m * D_m) * ((M_m * D_m) * (0.25 / d))) * (h / l)) / d)));
} else {
tmp = w0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
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 ((h / l) <= (-2d-323)) then
tmp = w0 * sqrt((1.0d0 - ((((m_m * d_m) * ((m_m * d_m) * (0.25d0 / d))) * (h / l)) / d)))
else
tmp = w0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
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 ((h / l) <= -2e-323) {
tmp = w0 * Math.sqrt((1.0 - ((((M_m * D_m) * ((M_m * D_m) * (0.25 / d))) * (h / l)) / d)));
} else {
tmp = w0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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 (h / l) <= -2e-323: tmp = w0 * math.sqrt((1.0 - ((((M_m * D_m) * ((M_m * D_m) * (0.25 / d))) * (h / l)) / d))) else: tmp = w0 return tmp
M_m = abs(M) D_m = abs(D) 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(h / l) <= -2e-323) tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(M_m * D_m) * Float64(Float64(M_m * D_m) * Float64(0.25 / d))) * Float64(h / l)) / d)))); else tmp = w0; end return tmp end
M_m = abs(M);
D_m = abs(D);
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 ((h / l) <= -2e-323)
tmp = w0 * sqrt((1.0 - ((((M_m * D_m) * ((M_m * D_m) * (0.25 / d))) * (h / l)) / d)));
else
tmp = w0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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[(h / l), $MachinePrecision], -2e-323], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(0.25 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \leq -2 \cdot 10^{-323}:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{\left(\left(M\_m \cdot D\_m\right) \cdot \left(\left(M\_m \cdot D\_m\right) \cdot \frac{0.25}{d}\right)\right) \cdot \frac{h}{\ell}}{d}}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -1.97626e-323Initial program 79.7%
unpow2N/A
associate-/r*N/A
associate-*r/N/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr70.2%
associate-/l*N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6478.4%
Applied egg-rr78.4%
if -1.97626e-323 < (/.f64 h l) Initial program 78.0%
Taylor expanded in M around 0
Simplified91.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
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 1.15e-75)
(*
w0
(sqrt
(- 1.0 (/ (* (* (* M_m D_m) (* (* M_m D_m) (/ 0.25 d))) (/ h l)) d))))
(*
w0
(sqrt
(- 1.0 (/ (* (* (/ D_m d) (* 0.25 (* M_m M_m))) (* h (/ D_m d))) l))))))M_m = fabs(M);
D_m = fabs(D);
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 <= 1.15e-75) {
tmp = w0 * sqrt((1.0 - ((((M_m * D_m) * ((M_m * D_m) * (0.25 / d))) * (h / l)) / d)));
} else {
tmp = w0 * sqrt((1.0 - ((((D_m / d) * (0.25 * (M_m * M_m))) * (h * (D_m / d))) / l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
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 <= 1.15d-75) then
tmp = w0 * sqrt((1.0d0 - ((((m_m * d_m) * ((m_m * d_m) * (0.25d0 / d))) * (h / l)) / d)))
else
tmp = w0 * sqrt((1.0d0 - ((((d_m / d) * (0.25d0 * (m_m * m_m))) * (h * (d_m / d))) / l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
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 (d <= 1.15e-75) {
tmp = w0 * Math.sqrt((1.0 - ((((M_m * D_m) * ((M_m * D_m) * (0.25 / d))) * (h / l)) / d)));
} else {
tmp = w0 * Math.sqrt((1.0 - ((((D_m / d) * (0.25 * (M_m * M_m))) * (h * (D_m / d))) / l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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 d <= 1.15e-75: tmp = w0 * math.sqrt((1.0 - ((((M_m * D_m) * ((M_m * D_m) * (0.25 / d))) * (h / l)) / d))) else: tmp = w0 * math.sqrt((1.0 - ((((D_m / d) * (0.25 * (M_m * M_m))) * (h * (D_m / d))) / l))) return tmp
M_m = abs(M) D_m = abs(D) 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 (d <= 1.15e-75) tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(M_m * D_m) * Float64(Float64(M_m * D_m) * Float64(0.25 / d))) * Float64(h / l)) / d)))); else tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(D_m / d) * Float64(0.25 * Float64(M_m * M_m))) * Float64(h * Float64(D_m / d))) / l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
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 <= 1.15e-75)
tmp = w0 * sqrt((1.0 - ((((M_m * D_m) * ((M_m * D_m) * (0.25 / d))) * (h / l)) / d)));
else
tmp = w0 * sqrt((1.0 - ((((D_m / d) * (0.25 * (M_m * M_m))) * (h * (D_m / d))) / l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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[d, 1.15e-75], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(0.25 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(h * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\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 \leq 1.15 \cdot 10^{-75}:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{\left(\left(M\_m \cdot D\_m\right) \cdot \left(\left(M\_m \cdot D\_m\right) \cdot \frac{0.25}{d}\right)\right) \cdot \frac{h}{\ell}}{d}}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{\left(\frac{D\_m}{d} \cdot \left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \left(h \cdot \frac{D\_m}{d}\right)}{\ell}}\\
\end{array}
\end{array}
if d < 1.15e-75Initial program 77.3%
unpow2N/A
associate-/r*N/A
associate-*r/N/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr73.1%
associate-/l*N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6479.3%
Applied egg-rr79.3%
if 1.15e-75 < d Initial program 81.8%
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr75.8%
Final simplification78.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
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 (<= M_m 7.4e-125)
w0
(*
w0
(+ 1.0 (* (/ -0.125 l) (/ (* D_m (/ (* M_m M_m) (/ d h))) (/ d D_m)))))))M_m = fabs(M);
D_m = fabs(D);
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 (M_m <= 7.4e-125) {
tmp = w0;
} else {
tmp = w0 * (1.0 + ((-0.125 / l) * ((D_m * ((M_m * M_m) / (d / h))) / (d / D_m))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
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 (m_m <= 7.4d-125) then
tmp = w0
else
tmp = w0 * (1.0d0 + (((-0.125d0) / l) * ((d_m * ((m_m * m_m) / (d / h))) / (d / d_m))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
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 (M_m <= 7.4e-125) {
tmp = w0;
} else {
tmp = w0 * (1.0 + ((-0.125 / l) * ((D_m * ((M_m * M_m) / (d / h))) / (d / D_m))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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 M_m <= 7.4e-125: tmp = w0 else: tmp = w0 * (1.0 + ((-0.125 / l) * ((D_m * ((M_m * M_m) / (d / h))) / (d / D_m)))) return tmp
M_m = abs(M) D_m = abs(D) 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 (M_m <= 7.4e-125) tmp = w0; else tmp = Float64(w0 * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(Float64(D_m * Float64(Float64(M_m * M_m) / Float64(d / h))) / Float64(d / D_m))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
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 (M_m <= 7.4e-125)
tmp = w0;
else
tmp = w0 * (1.0 + ((-0.125 / l) * ((D_m * ((M_m * M_m) / (d / h))) / (d / D_m))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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[M$95$m, 7.4e-125], w0, N[(w0 * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(D$95$m * N[(N[(M$95$m * M$95$m), $MachinePrecision] / N[(d / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d / D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 7.4 \cdot 10^{-125}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{-0.125}{\ell} \cdot \frac{D\_m \cdot \frac{M\_m \cdot M\_m}{\frac{d}{h}}}{\frac{d}{D\_m}}\right)\\
\end{array}
\end{array}
if M < 7.3999999999999998e-125Initial program 79.1%
Taylor expanded in M around 0
Simplified70.2%
if 7.3999999999999998e-125 < M Initial program 78.9%
Taylor expanded in M around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6465.5%
Simplified65.5%
associate-*l/N/A
associate-/r/N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
associate-/l/N/A
clear-numN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6471.8%
Applied egg-rr71.8%
Final simplification70.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
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 (<= M_m 1.7e-116)
w0
(*
w0
(+ 1.0 (* (/ -0.125 l) (* D_m (* (/ D_m d) (/ (* M_m M_m) (/ d h)))))))))M_m = fabs(M);
D_m = fabs(D);
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 (M_m <= 1.7e-116) {
tmp = w0;
} else {
tmp = w0 * (1.0 + ((-0.125 / l) * (D_m * ((D_m / d) * ((M_m * M_m) / (d / h))))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
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 (m_m <= 1.7d-116) then
tmp = w0
else
tmp = w0 * (1.0d0 + (((-0.125d0) / l) * (d_m * ((d_m / d) * ((m_m * m_m) / (d / h))))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
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 (M_m <= 1.7e-116) {
tmp = w0;
} else {
tmp = w0 * (1.0 + ((-0.125 / l) * (D_m * ((D_m / d) * ((M_m * M_m) / (d / h))))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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 M_m <= 1.7e-116: tmp = w0 else: tmp = w0 * (1.0 + ((-0.125 / l) * (D_m * ((D_m / d) * ((M_m * M_m) / (d / h)))))) return tmp
M_m = abs(M) D_m = abs(D) 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 (M_m <= 1.7e-116) tmp = w0; else tmp = Float64(w0 * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(D_m * Float64(Float64(D_m / d) * Float64(Float64(M_m * M_m) / Float64(d / h))))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
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 (M_m <= 1.7e-116)
tmp = w0;
else
tmp = w0 * (1.0 + ((-0.125 / l) * (D_m * ((D_m / d) * ((M_m * M_m) / (d / h))))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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[M$95$m, 1.7e-116], w0, N[(w0 * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(D$95$m * N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(M$95$m * M$95$m), $MachinePrecision] / N[(d / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 1.7 \cdot 10^{-116}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{-0.125}{\ell} \cdot \left(D\_m \cdot \left(\frac{D\_m}{d} \cdot \frac{M\_m \cdot M\_m}{\frac{d}{h}}\right)\right)\right)\\
\end{array}
\end{array}
if M < 1.69999999999999996e-116Initial program 79.7%
Taylor expanded in M around 0
Simplified71.0%
if 1.69999999999999996e-116 < M Initial program 77.7%
Taylor expanded in M around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.6%
Simplified63.6%
associate-*l/N/A
associate-/r/N/A
*-commutativeN/A
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr70.2%
Final simplification70.8%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) 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 (<= M_m 4e+17) w0 (* w0 (/ (* (/ D_m d) (/ (* (* h (* M_m M_m)) (* D_m -0.125)) d)) l))))
M_m = fabs(M);
D_m = fabs(D);
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 (M_m <= 4e+17) {
tmp = w0;
} else {
tmp = w0 * (((D_m / d) * (((h * (M_m * M_m)) * (D_m * -0.125)) / d)) / l);
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
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 (m_m <= 4d+17) then
tmp = w0
else
tmp = w0 * (((d_m / d) * (((h * (m_m * m_m)) * (d_m * (-0.125d0))) / d)) / l)
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
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 (M_m <= 4e+17) {
tmp = w0;
} else {
tmp = w0 * (((D_m / d) * (((h * (M_m * M_m)) * (D_m * -0.125)) / d)) / l);
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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 M_m <= 4e+17: tmp = w0 else: tmp = w0 * (((D_m / d) * (((h * (M_m * M_m)) * (D_m * -0.125)) / d)) / l) return tmp
M_m = abs(M) D_m = abs(D) 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 (M_m <= 4e+17) tmp = w0; else tmp = Float64(w0 * Float64(Float64(Float64(D_m / d) * Float64(Float64(Float64(h * Float64(M_m * M_m)) * Float64(D_m * -0.125)) / d)) / l)); end return tmp end
M_m = abs(M);
D_m = abs(D);
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 (M_m <= 4e+17)
tmp = w0;
else
tmp = w0 * (((D_m / d) * (((h * (M_m * M_m)) * (D_m * -0.125)) / d)) / l);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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[M$95$m, 4e+17], w0, N[(w0 * N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * -0.125), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 4 \cdot 10^{+17}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \frac{\frac{D\_m}{d} \cdot \frac{\left(h \cdot \left(M\_m \cdot M\_m\right)\right) \cdot \left(D\_m \cdot -0.125\right)}{d}}{\ell}\\
\end{array}
\end{array}
if M < 4e17Initial program 80.6%
Taylor expanded in M around 0
Simplified72.5%
if 4e17 < M Initial program 73.3%
Taylor expanded in M around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6448.8%
Simplified48.8%
Taylor expanded in l around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6425.2%
Simplified25.2%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6431.7%
Applied egg-rr31.7%
Final simplification63.7%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) 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 (<= M_m 1.5e+20) w0 (* w0 (* (* (* h (* M_m M_m)) (/ -0.125 d)) (/ (/ (* D_m D_m) d) l)))))
M_m = fabs(M);
D_m = fabs(D);
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 (M_m <= 1.5e+20) {
tmp = w0;
} else {
tmp = w0 * (((h * (M_m * M_m)) * (-0.125 / d)) * (((D_m * D_m) / d) / l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
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 (m_m <= 1.5d+20) then
tmp = w0
else
tmp = w0 * (((h * (m_m * m_m)) * ((-0.125d0) / d)) * (((d_m * d_m) / d) / l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
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 (M_m <= 1.5e+20) {
tmp = w0;
} else {
tmp = w0 * (((h * (M_m * M_m)) * (-0.125 / d)) * (((D_m * D_m) / d) / l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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 M_m <= 1.5e+20: tmp = w0 else: tmp = w0 * (((h * (M_m * M_m)) * (-0.125 / d)) * (((D_m * D_m) / d) / l)) return tmp
M_m = abs(M) D_m = abs(D) 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 (M_m <= 1.5e+20) tmp = w0; else tmp = Float64(w0 * Float64(Float64(Float64(h * Float64(M_m * M_m)) * Float64(-0.125 / d)) * Float64(Float64(Float64(D_m * D_m) / d) / l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
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 (M_m <= 1.5e+20)
tmp = w0;
else
tmp = w0 * (((h * (M_m * M_m)) * (-0.125 / d)) * (((D_m * D_m) / d) / l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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[M$95$m, 1.5e+20], w0, N[(w0 * N[(N[(N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] / d), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 1.5 \cdot 10^{+20}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(\left(\left(h \cdot \left(M\_m \cdot M\_m\right)\right) \cdot \frac{-0.125}{d}\right) \cdot \frac{\frac{D\_m \cdot D\_m}{d}}{\ell}\right)\\
\end{array}
\end{array}
if M < 1.5e20Initial program 80.6%
Taylor expanded in M around 0
Simplified72.5%
if 1.5e20 < M Initial program 73.3%
Taylor expanded in M around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6448.8%
Simplified48.8%
Taylor expanded in l around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6425.2%
Simplified25.2%
times-fracN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6429.6%
Applied egg-rr29.6%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) 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 (<= M_m 3.4e+96) w0 (* w0 (* (* (* h (* M_m M_m)) (* D_m -0.125)) (/ D_m (* d (* d l)))))))
M_m = fabs(M);
D_m = fabs(D);
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 (M_m <= 3.4e+96) {
tmp = w0;
} else {
tmp = w0 * (((h * (M_m * M_m)) * (D_m * -0.125)) * (D_m / (d * (d * l))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
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 (m_m <= 3.4d+96) then
tmp = w0
else
tmp = w0 * (((h * (m_m * m_m)) * (d_m * (-0.125d0))) * (d_m / (d * (d * l))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
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 (M_m <= 3.4e+96) {
tmp = w0;
} else {
tmp = w0 * (((h * (M_m * M_m)) * (D_m * -0.125)) * (D_m / (d * (d * l))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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 M_m <= 3.4e+96: tmp = w0 else: tmp = w0 * (((h * (M_m * M_m)) * (D_m * -0.125)) * (D_m / (d * (d * l)))) return tmp
M_m = abs(M) D_m = abs(D) 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 (M_m <= 3.4e+96) tmp = w0; else tmp = Float64(w0 * Float64(Float64(Float64(h * Float64(M_m * M_m)) * Float64(D_m * -0.125)) * Float64(D_m / Float64(d * Float64(d * l))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
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 (M_m <= 3.4e+96)
tmp = w0;
else
tmp = w0 * (((h * (M_m * M_m)) * (D_m * -0.125)) * (D_m / (d * (d * l))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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[M$95$m, 3.4e+96], w0, N[(w0 * N[(N[(N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * -0.125), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 3.4 \cdot 10^{+96}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(\left(\left(h \cdot \left(M\_m \cdot M\_m\right)\right) \cdot \left(D\_m \cdot -0.125\right)\right) \cdot \frac{D\_m}{d \cdot \left(d \cdot \ell\right)}\right)\\
\end{array}
\end{array}
if M < 3.4000000000000001e96Initial program 79.8%
Taylor expanded in M around 0
Simplified72.6%
if 3.4000000000000001e96 < M Initial program 75.0%
Taylor expanded in M around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6441.4%
Simplified41.4%
Taylor expanded in l around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6427.0%
Simplified27.0%
associate-/r*N/A
associate-*r*N/A
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6432.4%
Applied egg-rr32.4%
Final simplification65.8%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) 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 (<= M_m 3e+96) w0 (* w0 (* D_m (* (* (* M_m D_m) (* M_m h)) (/ -0.125 (* d (* d l))))))))
M_m = fabs(M);
D_m = fabs(D);
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 (M_m <= 3e+96) {
tmp = w0;
} else {
tmp = w0 * (D_m * (((M_m * D_m) * (M_m * h)) * (-0.125 / (d * (d * l)))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
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 (m_m <= 3d+96) then
tmp = w0
else
tmp = w0 * (d_m * (((m_m * d_m) * (m_m * h)) * ((-0.125d0) / (d * (d * l)))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
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 (M_m <= 3e+96) {
tmp = w0;
} else {
tmp = w0 * (D_m * (((M_m * D_m) * (M_m * h)) * (-0.125 / (d * (d * l)))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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 M_m <= 3e+96: tmp = w0 else: tmp = w0 * (D_m * (((M_m * D_m) * (M_m * h)) * (-0.125 / (d * (d * l))))) return tmp
M_m = abs(M) D_m = abs(D) 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 (M_m <= 3e+96) tmp = w0; else tmp = Float64(w0 * Float64(D_m * Float64(Float64(Float64(M_m * D_m) * Float64(M_m * h)) * Float64(-0.125 / Float64(d * Float64(d * l)))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
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 (M_m <= 3e+96)
tmp = w0;
else
tmp = w0 * (D_m * (((M_m * D_m) * (M_m * h)) * (-0.125 / (d * (d * l)))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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[M$95$m, 3e+96], w0, N[(w0 * N[(D$95$m * N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(M$95$m * h), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 3 \cdot 10^{+96}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(D\_m \cdot \left(\left(\left(M\_m \cdot D\_m\right) \cdot \left(M\_m \cdot h\right)\right) \cdot \frac{-0.125}{d \cdot \left(d \cdot \ell\right)}\right)\right)\\
\end{array}
\end{array}
if M < 3e96Initial program 79.8%
Taylor expanded in M around 0
Simplified72.6%
if 3e96 < M Initial program 75.0%
Taylor expanded in M around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6441.4%
Simplified41.4%
Taylor expanded in l around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6427.0%
Simplified27.0%
associate-/r*N/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
Applied egg-rr32.8%
Final simplification65.9%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) 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)
M_m = fabs(M);
D_m = fabs(D);
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;
}
M_m = abs(m)
D_m = abs(d)
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
M_m = Math.abs(M);
D_m = Math.abs(D);
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;
}
M_m = math.fabs(M) D_m = math.fabs(D) [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
M_m = abs(M) D_m = abs(D) 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
M_m = abs(M);
D_m = abs(D);
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
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $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}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
w0
\end{array}
Initial program 79.0%
Taylor expanded in M around 0
Simplified66.5%
herbie shell --seed 2024191
(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))))))