
(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 17 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)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(let* ((t_0 (/ -4.0 (/ (* D_m M_m) d_m))))
(if (<= d_m 2e-41)
(* w0 (sqrt (+ 1.0 (/ (/ (* h (* D_m M_m)) d_m) (* l t_0)))))
(* w0 (sqrt (+ 1.0 (/ (* (/ (* M_m h) t_0) (/ D_m d_m)) l)))))))M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = -4.0 / ((D_m * M_m) / d_m);
double tmp;
if (d_m <= 2e-41) {
tmp = w0 * sqrt((1.0 + (((h * (D_m * M_m)) / d_m) / (l * t_0))));
} else {
tmp = w0 * sqrt((1.0 + ((((M_m * h) / t_0) * (D_m / d_m)) / l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: t_0
real(8) :: tmp
t_0 = (-4.0d0) / ((d_m * m_m) / d_m_1)
if (d_m_1 <= 2d-41) then
tmp = w0 * sqrt((1.0d0 + (((h * (d_m * m_m)) / d_m_1) / (l * t_0))))
else
tmp = w0 * sqrt((1.0d0 + ((((m_m * h) / t_0) * (d_m / d_m_1)) / l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = -4.0 / ((D_m * M_m) / d_m);
double tmp;
if (d_m <= 2e-41) {
tmp = w0 * Math.sqrt((1.0 + (((h * (D_m * M_m)) / d_m) / (l * t_0))));
} else {
tmp = w0 * Math.sqrt((1.0 + ((((M_m * h) / t_0) * (D_m / d_m)) / l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): t_0 = -4.0 / ((D_m * M_m) / d_m) tmp = 0 if d_m <= 2e-41: tmp = w0 * math.sqrt((1.0 + (((h * (D_m * M_m)) / d_m) / (l * t_0)))) else: tmp = w0 * math.sqrt((1.0 + ((((M_m * h) / t_0) * (D_m / d_m)) / l))) return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(-4.0 / Float64(Float64(D_m * M_m) / d_m)) tmp = 0.0 if (d_m <= 2e-41) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(Float64(h * Float64(D_m * M_m)) / d_m) / Float64(l * t_0))))); else tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(Float64(Float64(M_m * h) / t_0) * Float64(D_m / d_m)) / l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
t_0 = -4.0 / ((D_m * M_m) / d_m);
tmp = 0.0;
if (d_m <= 2e-41)
tmp = w0 * sqrt((1.0 + (((h * (D_m * M_m)) / d_m) / (l * t_0))));
else
tmp = w0 * sqrt((1.0 + ((((M_m * h) / t_0) * (D_m / d_m)) / l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
d_m = N[Abs[d], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(-4.0 / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d$95$m, 2e-41], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(N[(h * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] / N[(l * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(N[(N[(M$95$m * h), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(D$95$m / d$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := \frac{-4}{\frac{D\_m \cdot M\_m}{d\_m}}\\
\mathbf{if}\;d\_m \leq 2 \cdot 10^{-41}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{\frac{h \cdot \left(D\_m \cdot M\_m\right)}{d\_m}}{\ell \cdot t\_0}}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{\frac{M\_m \cdot h}{t\_0} \cdot \frac{D\_m}{d\_m}}{\ell}}\\
\end{array}
\end{array}
if d < 2.00000000000000001e-41Initial program 76.9%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified74.9%
associate-*r*N/A
associate-/l/N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6479.3%
Applied egg-rr79.3%
associate-/l/N/A
frac-timesN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6478.9%
Applied egg-rr78.9%
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6484.2%
Applied egg-rr84.2%
if 2.00000000000000001e-41 < d Initial program 83.1%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified82.2%
associate-*r*N/A
associate-/l/N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6483.6%
Applied egg-rr83.6%
associate-/l/N/A
frac-timesN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6484.2%
Applied egg-rr84.2%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6486.7%
Applied egg-rr86.7%
Final simplification85.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(let* ((t_0 (* d_m (* d_m l))))
(if (<= D_m 1.4e+70)
(*
w0
(+
1.0
(* (/ -0.125 l) (* (/ (* D_m D_m) d_m) (/ (* h (* M_m M_m)) d_m)))))
(if (<= D_m 1.8e+197)
(* w0 (sqrt (+ 1.0 (/ (* M_m (/ h t_0)) (/ -4.0 (* D_m (* D_m M_m)))))))
(+ w0 (* D_m (/ D_m (/ t_0 (* -0.125 (* h (* M_m (* w0 M_m))))))))))))M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = d_m * (d_m * l);
double tmp;
if (D_m <= 1.4e+70) {
tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m))));
} else if (D_m <= 1.8e+197) {
tmp = w0 * sqrt((1.0 + ((M_m * (h / t_0)) / (-4.0 / (D_m * (D_m * M_m))))));
} else {
tmp = w0 + (D_m * (D_m / (t_0 / (-0.125 * (h * (M_m * (w0 * M_m)))))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: t_0
real(8) :: tmp
t_0 = d_m_1 * (d_m_1 * l)
if (d_m <= 1.4d+70) then
tmp = w0 * (1.0d0 + (((-0.125d0) / l) * (((d_m * d_m) / d_m_1) * ((h * (m_m * m_m)) / d_m_1))))
else if (d_m <= 1.8d+197) then
tmp = w0 * sqrt((1.0d0 + ((m_m * (h / t_0)) / ((-4.0d0) / (d_m * (d_m * m_m))))))
else
tmp = w0 + (d_m * (d_m / (t_0 / ((-0.125d0) * (h * (m_m * (w0 * m_m)))))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = d_m * (d_m * l);
double tmp;
if (D_m <= 1.4e+70) {
tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m))));
} else if (D_m <= 1.8e+197) {
tmp = w0 * Math.sqrt((1.0 + ((M_m * (h / t_0)) / (-4.0 / (D_m * (D_m * M_m))))));
} else {
tmp = w0 + (D_m * (D_m / (t_0 / (-0.125 * (h * (M_m * (w0 * M_m)))))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): t_0 = d_m * (d_m * l) tmp = 0 if D_m <= 1.4e+70: tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m)))) elif D_m <= 1.8e+197: tmp = w0 * math.sqrt((1.0 + ((M_m * (h / t_0)) / (-4.0 / (D_m * (D_m * M_m)))))) else: tmp = w0 + (D_m * (D_m / (t_0 / (-0.125 * (h * (M_m * (w0 * M_m))))))) return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(d_m * Float64(d_m * l)) tmp = 0.0 if (D_m <= 1.4e+70) tmp = Float64(w0 * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(Float64(Float64(D_m * D_m) / d_m) * Float64(Float64(h * Float64(M_m * M_m)) / d_m))))); elseif (D_m <= 1.8e+197) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(M_m * Float64(h / t_0)) / Float64(-4.0 / Float64(D_m * Float64(D_m * M_m))))))); else tmp = Float64(w0 + Float64(D_m * Float64(D_m / Float64(t_0 / Float64(-0.125 * Float64(h * Float64(M_m * Float64(w0 * M_m)))))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
t_0 = d_m * (d_m * l);
tmp = 0.0;
if (D_m <= 1.4e+70)
tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m))));
elseif (D_m <= 1.8e+197)
tmp = w0 * sqrt((1.0 + ((M_m * (h / t_0)) / (-4.0 / (D_m * (D_m * M_m))))));
else
tmp = w0 + (D_m * (D_m / (t_0 / (-0.125 * (h * (M_m * (w0 * M_m)))))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
d_m = N[Abs[d], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(d$95$m * N[(d$95$m * l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[D$95$m, 1.4e+70], N[(w0 * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] * N[(N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[D$95$m, 1.8e+197], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(M$95$m * N[(h / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(-4.0 / N[(D$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 + N[(D$95$m * N[(D$95$m / N[(t$95$0 / N[(-0.125 * N[(h * N[(M$95$m * N[(w0 * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := d\_m \cdot \left(d\_m \cdot \ell\right)\\
\mathbf{if}\;D\_m \leq 1.4 \cdot 10^{+70}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{-0.125}{\ell} \cdot \left(\frac{D\_m \cdot D\_m}{d\_m} \cdot \frac{h \cdot \left(M\_m \cdot M\_m\right)}{d\_m}\right)\right)\\
\mathbf{elif}\;D\_m \leq 1.8 \cdot 10^{+197}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{M\_m \cdot \frac{h}{t\_0}}{\frac{-4}{D\_m \cdot \left(D\_m \cdot M\_m\right)}}}\\
\mathbf{else}:\\
\;\;\;\;w0 + D\_m \cdot \frac{D\_m}{\frac{t\_0}{-0.125 \cdot \left(h \cdot \left(M\_m \cdot \left(w0 \cdot M\_m\right)\right)\right)}}\\
\end{array}
\end{array}
if D < 1.39999999999999995e70Initial program 79.5%
clear-numN/A
un-div-invN/A
unpow2N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr89.1%
Taylor expanded in D 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
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6461.4%
Simplified61.4%
if 1.39999999999999995e70 < D < 1.79999999999999991e197Initial program 85.9%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified82.8%
associate-*r*N/A
clear-numN/A
un-div-invN/A
*-commutativeN/A
associate-/l/N/A
associate-/r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6470.7%
Applied egg-rr70.7%
associate-/l*N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6482.4%
Applied egg-rr82.4%
if 1.79999999999999991e197 < D Initial program 62.5%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified51.6%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified28.1%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr62.9%
Final simplification63.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (/ h l) -2e-323)
(*
w0
(sqrt
(+ 1.0 (/ (* (/ (* M_m h) (/ -4.0 (/ (* D_m M_m) d_m))) (/ D_m d_m)) l))))
w0))M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((h / l) <= -2e-323) {
tmp = w0 * sqrt((1.0 + ((((M_m * h) / (-4.0 / ((D_m * M_m) / d_m))) * (D_m / d_m)) / l)));
} else {
tmp = w0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if ((h / l) <= (-2d-323)) then
tmp = w0 * sqrt((1.0d0 + ((((m_m * h) / ((-4.0d0) / ((d_m * m_m) / d_m_1))) * (d_m / d_m_1)) / l)))
else
tmp = w0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((h / l) <= -2e-323) {
tmp = w0 * Math.sqrt((1.0 + ((((M_m * h) / (-4.0 / ((D_m * M_m) / d_m))) * (D_m / d_m)) / l)));
} else {
tmp = w0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if (h / l) <= -2e-323: tmp = w0 * math.sqrt((1.0 + ((((M_m * h) / (-4.0 / ((D_m * M_m) / d_m))) * (D_m / d_m)) / l))) else: tmp = w0 return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(h / l) <= -2e-323) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(Float64(Float64(M_m * h) / Float64(-4.0 / Float64(Float64(D_m * M_m) / d_m))) * Float64(D_m / d_m)) / l)))); else tmp = w0; end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if ((h / l) <= -2e-323)
tmp = w0 * sqrt((1.0 + ((((M_m * h) / (-4.0 / ((D_m * M_m) / d_m))) * (D_m / d_m)) / l)));
else
tmp = w0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(h / l), $MachinePrecision], -2e-323], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(N[(N[(M$95$m * h), $MachinePrecision] / N[(-4.0 / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \leq -2 \cdot 10^{-323}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{\frac{M\_m \cdot h}{\frac{-4}{\frac{D\_m \cdot M\_m}{d\_m}}} \cdot \frac{D\_m}{d\_m}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -1.97626e-323Initial program 79.7%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified75.4%
associate-*r*N/A
associate-/l/N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6478.5%
Applied egg-rr78.5%
associate-/l/N/A
frac-timesN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6479.0%
Applied egg-rr79.0%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6479.8%
Applied egg-rr79.8%
if -1.97626e-323 < (/.f64 h l) Initial program 78.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified80.3%
Taylor expanded in h around 0
Simplified91.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (/ h l) -2e-323)
(*
w0
(sqrt
(+ 1.0 (/ (* (/ h (* -4.0 (/ (/ d_m (* D_m M_m)) D_m))) (/ M_m d_m)) l))))
w0))M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((h / l) <= -2e-323) {
tmp = w0 * sqrt((1.0 + (((h / (-4.0 * ((d_m / (D_m * M_m)) / D_m))) * (M_m / d_m)) / l)));
} else {
tmp = w0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if ((h / l) <= (-2d-323)) then
tmp = w0 * sqrt((1.0d0 + (((h / ((-4.0d0) * ((d_m_1 / (d_m * m_m)) / d_m))) * (m_m / d_m_1)) / l)))
else
tmp = w0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((h / l) <= -2e-323) {
tmp = w0 * Math.sqrt((1.0 + (((h / (-4.0 * ((d_m / (D_m * M_m)) / D_m))) * (M_m / d_m)) / l)));
} else {
tmp = w0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if (h / l) <= -2e-323: tmp = w0 * math.sqrt((1.0 + (((h / (-4.0 * ((d_m / (D_m * M_m)) / D_m))) * (M_m / d_m)) / l))) else: tmp = w0 return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(h / l) <= -2e-323) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(Float64(h / Float64(-4.0 * Float64(Float64(d_m / Float64(D_m * M_m)) / D_m))) * Float64(M_m / d_m)) / l)))); else tmp = w0; end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if ((h / l) <= -2e-323)
tmp = w0 * sqrt((1.0 + (((h / (-4.0 * ((d_m / (D_m * M_m)) / D_m))) * (M_m / d_m)) / l)));
else
tmp = w0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(h / l), $MachinePrecision], -2e-323], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(N[(h / N[(-4.0 * N[(N[(d$95$m / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \leq -2 \cdot 10^{-323}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{\frac{h}{-4 \cdot \frac{\frac{d\_m}{D\_m \cdot M\_m}}{D\_m}} \cdot \frac{M\_m}{d\_m}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -1.97626e-323Initial program 79.7%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified75.4%
/-lowering-/.f64N/A
Applied egg-rr78.5%
if -1.97626e-323 < (/.f64 h l) Initial program 78.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified80.3%
Taylor expanded in h around 0
Simplified91.7%
Final simplification83.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (/ h l) -5e-189)
(*
w0
(sqrt
(+ 1.0 (/ (* h (* M_m (/ (/ (/ (* D_m (* D_m M_m)) d_m) d_m) -4.0))) l))))
w0))M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((h / l) <= -5e-189) {
tmp = w0 * sqrt((1.0 + ((h * (M_m * ((((D_m * (D_m * M_m)) / d_m) / d_m) / -4.0))) / l)));
} else {
tmp = w0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if ((h / l) <= (-5d-189)) then
tmp = w0 * sqrt((1.0d0 + ((h * (m_m * ((((d_m * (d_m * m_m)) / d_m_1) / d_m_1) / (-4.0d0)))) / l)))
else
tmp = w0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((h / l) <= -5e-189) {
tmp = w0 * Math.sqrt((1.0 + ((h * (M_m * ((((D_m * (D_m * M_m)) / d_m) / d_m) / -4.0))) / l)));
} else {
tmp = w0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if (h / l) <= -5e-189: tmp = w0 * math.sqrt((1.0 + ((h * (M_m * ((((D_m * (D_m * M_m)) / d_m) / d_m) / -4.0))) / l))) else: tmp = w0 return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(h / l) <= -5e-189) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(h * Float64(M_m * Float64(Float64(Float64(Float64(D_m * Float64(D_m * M_m)) / d_m) / d_m) / -4.0))) / l)))); else tmp = w0; end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if ((h / l) <= -5e-189)
tmp = w0 * sqrt((1.0 + ((h * (M_m * ((((D_m * (D_m * M_m)) / d_m) / d_m) / -4.0))) / l)));
else
tmp = w0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(h / l), $MachinePrecision], -5e-189], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(h * N[(M$95$m * N[(N[(N[(N[(D$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] / -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \leq -5 \cdot 10^{-189}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{h \cdot \left(M\_m \cdot \frac{\frac{\frac{D\_m \cdot \left(D\_m \cdot M\_m\right)}{d\_m}}{d\_m}}{-4}\right)}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -4.9999999999999997e-189Initial program 80.9%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified77.5%
if -4.9999999999999997e-189 < (/.f64 h l) Initial program 77.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified77.3%
Taylor expanded in h around 0
Simplified87.6%
Final simplification82.4%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) d_m = (fabs.f64 d) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (let* ((t_0 (/ (/ D_m (/ 2.0 M_m)) d_m))) (* w0 (sqrt (+ 1.0 (* (/ t_0 l) (/ t_0 (/ -1.0 h))))))))
M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = (D_m / (2.0 / M_m)) / d_m;
return w0 * sqrt((1.0 + ((t_0 / l) * (t_0 / (-1.0 / h)))));
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: t_0
t_0 = (d_m / (2.0d0 / m_m)) / d_m_1
code = w0 * sqrt((1.0d0 + ((t_0 / l) * (t_0 / ((-1.0d0) / h)))))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = (D_m / (2.0 / M_m)) / d_m;
return w0 * Math.sqrt((1.0 + ((t_0 / l) * (t_0 / (-1.0 / h)))));
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): t_0 = (D_m / (2.0 / M_m)) / d_m return w0 * math.sqrt((1.0 + ((t_0 / l) * (t_0 / (-1.0 / h)))))
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(Float64(D_m / Float64(2.0 / M_m)) / d_m) return Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(t_0 / l) * Float64(t_0 / Float64(-1.0 / h)))))) end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp = code(w0, M_m, D_m, h, l, d_m)
t_0 = (D_m / (2.0 / M_m)) / d_m;
tmp = w0 * sqrt((1.0 + ((t_0 / l) * (t_0 / (-1.0 / h)))));
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
d_m = N[Abs[d], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(N[(D$95$m / N[(2.0 / M$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision]}, N[(w0 * N[Sqrt[N[(1.0 + N[(N[(t$95$0 / l), $MachinePrecision] * N[(t$95$0 / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{D\_m}{\frac{2}{M\_m}}}{d\_m}\\
w0 \cdot \sqrt{1 + \frac{t\_0}{\ell} \cdot \frac{t\_0}{\frac{-1}{h}}}
\end{array}
\end{array}
Initial program 79.0%
clear-numN/A
un-div-invN/A
unpow2N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr87.3%
Final simplification87.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= d_m 2e-163)
(+
w0
(* (* D_m D_m) (/ (/ (* -0.125 (* h (* M_m (* w0 M_m)))) d_m) (* d_m l))))
(if (<= d_m 1.26e-42)
(*
w0
(+
1.0
(* (/ -0.125 l) (/ (* h (* M_m (* M_m (* D_m D_m)))) (* d_m d_m)))))
w0)))M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (d_m <= 2e-163) {
tmp = w0 + ((D_m * D_m) * (((-0.125 * (h * (M_m * (w0 * M_m)))) / d_m) / (d_m * l)));
} else if (d_m <= 1.26e-42) {
tmp = w0 * (1.0 + ((-0.125 / l) * ((h * (M_m * (M_m * (D_m * D_m)))) / (d_m * d_m))));
} else {
tmp = w0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (d_m_1 <= 2d-163) then
tmp = w0 + ((d_m * d_m) * ((((-0.125d0) * (h * (m_m * (w0 * m_m)))) / d_m_1) / (d_m_1 * l)))
else if (d_m_1 <= 1.26d-42) then
tmp = w0 * (1.0d0 + (((-0.125d0) / l) * ((h * (m_m * (m_m * (d_m * d_m)))) / (d_m_1 * d_m_1))))
else
tmp = w0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (d_m <= 2e-163) {
tmp = w0 + ((D_m * D_m) * (((-0.125 * (h * (M_m * (w0 * M_m)))) / d_m) / (d_m * l)));
} else if (d_m <= 1.26e-42) {
tmp = w0 * (1.0 + ((-0.125 / l) * ((h * (M_m * (M_m * (D_m * D_m)))) / (d_m * d_m))));
} else {
tmp = w0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if d_m <= 2e-163: tmp = w0 + ((D_m * D_m) * (((-0.125 * (h * (M_m * (w0 * M_m)))) / d_m) / (d_m * l))) elif d_m <= 1.26e-42: tmp = w0 * (1.0 + ((-0.125 / l) * ((h * (M_m * (M_m * (D_m * D_m)))) / (d_m * d_m)))) else: tmp = w0 return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (d_m <= 2e-163) tmp = Float64(w0 + Float64(Float64(D_m * D_m) * Float64(Float64(Float64(-0.125 * Float64(h * Float64(M_m * Float64(w0 * M_m)))) / d_m) / Float64(d_m * l)))); elseif (d_m <= 1.26e-42) tmp = Float64(w0 * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(Float64(h * Float64(M_m * Float64(M_m * Float64(D_m * D_m)))) / Float64(d_m * d_m))))); else tmp = w0; end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (d_m <= 2e-163)
tmp = w0 + ((D_m * D_m) * (((-0.125 * (h * (M_m * (w0 * M_m)))) / d_m) / (d_m * l)));
elseif (d_m <= 1.26e-42)
tmp = w0 * (1.0 + ((-0.125 / l) * ((h * (M_m * (M_m * (D_m * D_m)))) / (d_m * d_m))));
else
tmp = w0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[d$95$m, 2e-163], N[(w0 + N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[(-0.125 * N[(h * N[(M$95$m * N[(w0 * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] / N[(d$95$m * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d$95$m, 1.26e-42], N[(w0 * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(h * N[(M$95$m * N[(M$95$m * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], w0]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d\_m \leq 2 \cdot 10^{-163}:\\
\;\;\;\;w0 + \left(D\_m \cdot D\_m\right) \cdot \frac{\frac{-0.125 \cdot \left(h \cdot \left(M\_m \cdot \left(w0 \cdot M\_m\right)\right)\right)}{d\_m}}{d\_m \cdot \ell}\\
\mathbf{elif}\;d\_m \leq 1.26 \cdot 10^{-42}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{-0.125}{\ell} \cdot \frac{h \cdot \left(M\_m \cdot \left(M\_m \cdot \left(D\_m \cdot D\_m\right)\right)\right)}{d\_m \cdot d\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if d < 1.99999999999999985e-163Initial program 77.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified76.2%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified47.2%
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6461.5%
Applied egg-rr61.5%
if 1.99999999999999985e-163 < d < 1.26e-42Initial program 72.7%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified67.3%
associate-*r*N/A
associate-/l/N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6473.1%
Applied egg-rr73.1%
associate-/l/N/A
frac-timesN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6484.0%
Applied egg-rr84.0%
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6489.1%
Applied egg-rr89.1%
Taylor expanded in D around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6468.3%
Simplified68.3%
if 1.26e-42 < d Initial program 82.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified81.5%
Taylor expanded in h around 0
Simplified78.0%
Final simplification67.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= d_m 2.35e-163)
(+
w0
(* (* D_m D_m) (* (/ (* h -0.125) d_m) (/ (* M_m (* w0 M_m)) (* d_m l)))))
(if (<= d_m 1.25e-42)
(*
w0
(+
1.0
(* (/ -0.125 l) (/ (* h (* M_m (* M_m (* D_m D_m)))) (* d_m d_m)))))
w0)))M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (d_m <= 2.35e-163) {
tmp = w0 + ((D_m * D_m) * (((h * -0.125) / d_m) * ((M_m * (w0 * M_m)) / (d_m * l))));
} else if (d_m <= 1.25e-42) {
tmp = w0 * (1.0 + ((-0.125 / l) * ((h * (M_m * (M_m * (D_m * D_m)))) / (d_m * d_m))));
} else {
tmp = w0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (d_m_1 <= 2.35d-163) then
tmp = w0 + ((d_m * d_m) * (((h * (-0.125d0)) / d_m_1) * ((m_m * (w0 * m_m)) / (d_m_1 * l))))
else if (d_m_1 <= 1.25d-42) then
tmp = w0 * (1.0d0 + (((-0.125d0) / l) * ((h * (m_m * (m_m * (d_m * d_m)))) / (d_m_1 * d_m_1))))
else
tmp = w0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (d_m <= 2.35e-163) {
tmp = w0 + ((D_m * D_m) * (((h * -0.125) / d_m) * ((M_m * (w0 * M_m)) / (d_m * l))));
} else if (d_m <= 1.25e-42) {
tmp = w0 * (1.0 + ((-0.125 / l) * ((h * (M_m * (M_m * (D_m * D_m)))) / (d_m * d_m))));
} else {
tmp = w0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if d_m <= 2.35e-163: tmp = w0 + ((D_m * D_m) * (((h * -0.125) / d_m) * ((M_m * (w0 * M_m)) / (d_m * l)))) elif d_m <= 1.25e-42: tmp = w0 * (1.0 + ((-0.125 / l) * ((h * (M_m * (M_m * (D_m * D_m)))) / (d_m * d_m)))) else: tmp = w0 return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (d_m <= 2.35e-163) tmp = Float64(w0 + Float64(Float64(D_m * D_m) * Float64(Float64(Float64(h * -0.125) / d_m) * Float64(Float64(M_m * Float64(w0 * M_m)) / Float64(d_m * l))))); elseif (d_m <= 1.25e-42) tmp = Float64(w0 * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(Float64(h * Float64(M_m * Float64(M_m * Float64(D_m * D_m)))) / Float64(d_m * d_m))))); else tmp = w0; end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (d_m <= 2.35e-163)
tmp = w0 + ((D_m * D_m) * (((h * -0.125) / d_m) * ((M_m * (w0 * M_m)) / (d_m * l))));
elseif (d_m <= 1.25e-42)
tmp = w0 * (1.0 + ((-0.125 / l) * ((h * (M_m * (M_m * (D_m * D_m)))) / (d_m * d_m))));
else
tmp = w0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[d$95$m, 2.35e-163], N[(w0 + N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[(h * -0.125), $MachinePrecision] / d$95$m), $MachinePrecision] * N[(N[(M$95$m * N[(w0 * M$95$m), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d$95$m, 1.25e-42], N[(w0 * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(h * N[(M$95$m * N[(M$95$m * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], w0]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d\_m \leq 2.35 \cdot 10^{-163}:\\
\;\;\;\;w0 + \left(D\_m \cdot D\_m\right) \cdot \left(\frac{h \cdot -0.125}{d\_m} \cdot \frac{M\_m \cdot \left(w0 \cdot M\_m\right)}{d\_m \cdot \ell}\right)\\
\mathbf{elif}\;d\_m \leq 1.25 \cdot 10^{-42}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{-0.125}{\ell} \cdot \frac{h \cdot \left(M\_m \cdot \left(M\_m \cdot \left(D\_m \cdot D\_m\right)\right)\right)}{d\_m \cdot d\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if d < 2.35e-163Initial program 77.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified76.2%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified47.2%
associate-*r*N/A
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6458.9%
Applied egg-rr58.9%
if 2.35e-163 < d < 1.25000000000000001e-42Initial program 72.7%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified67.3%
associate-*r*N/A
associate-/l/N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6473.1%
Applied egg-rr73.1%
associate-/l/N/A
frac-timesN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6484.0%
Applied egg-rr84.0%
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6489.1%
Applied egg-rr89.1%
Taylor expanded in D around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6468.3%
Simplified68.3%
if 1.25000000000000001e-42 < d Initial program 82.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified81.5%
Taylor expanded in h around 0
Simplified78.0%
Final simplification66.2%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= D_m 1.35e+70)
(*
w0
(+ 1.0 (* (/ -0.125 l) (* (/ (* D_m D_m) d_m) (/ (* h (* M_m M_m)) d_m)))))
(+
w0
(*
D_m
(/ D_m (/ (* d_m (* d_m l)) (* -0.125 (* h (* M_m (* w0 M_m))))))))))M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (D_m <= 1.35e+70) {
tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m))));
} else {
tmp = w0 + (D_m * (D_m / ((d_m * (d_m * l)) / (-0.125 * (h * (M_m * (w0 * M_m)))))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (d_m <= 1.35d+70) then
tmp = w0 * (1.0d0 + (((-0.125d0) / l) * (((d_m * d_m) / d_m_1) * ((h * (m_m * m_m)) / d_m_1))))
else
tmp = w0 + (d_m * (d_m / ((d_m_1 * (d_m_1 * l)) / ((-0.125d0) * (h * (m_m * (w0 * m_m)))))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (D_m <= 1.35e+70) {
tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m))));
} else {
tmp = w0 + (D_m * (D_m / ((d_m * (d_m * l)) / (-0.125 * (h * (M_m * (w0 * M_m)))))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if D_m <= 1.35e+70: tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m)))) else: tmp = w0 + (D_m * (D_m / ((d_m * (d_m * l)) / (-0.125 * (h * (M_m * (w0 * M_m))))))) return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (D_m <= 1.35e+70) tmp = Float64(w0 * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(Float64(Float64(D_m * D_m) / d_m) * Float64(Float64(h * Float64(M_m * M_m)) / d_m))))); else tmp = Float64(w0 + Float64(D_m * Float64(D_m / Float64(Float64(d_m * Float64(d_m * l)) / Float64(-0.125 * Float64(h * Float64(M_m * Float64(w0 * M_m)))))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (D_m <= 1.35e+70)
tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m))));
else
tmp = w0 + (D_m * (D_m / ((d_m * (d_m * l)) / (-0.125 * (h * (M_m * (w0 * M_m)))))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[D$95$m, 1.35e+70], N[(w0 * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] * N[(N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(w0 + N[(D$95$m * N[(D$95$m / N[(N[(d$95$m * N[(d$95$m * l), $MachinePrecision]), $MachinePrecision] / N[(-0.125 * N[(h * N[(M$95$m * N[(w0 * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;D\_m \leq 1.35 \cdot 10^{+70}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{-0.125}{\ell} \cdot \left(\frac{D\_m \cdot D\_m}{d\_m} \cdot \frac{h \cdot \left(M\_m \cdot M\_m\right)}{d\_m}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;w0 + D\_m \cdot \frac{D\_m}{\frac{d\_m \cdot \left(d\_m \cdot \ell\right)}{-0.125 \cdot \left(h \cdot \left(M\_m \cdot \left(w0 \cdot M\_m\right)\right)\right)}}\\
\end{array}
\end{array}
if D < 1.35e70Initial program 79.5%
clear-numN/A
un-div-invN/A
unpow2N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr89.1%
Taylor expanded in D 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
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6461.4%
Simplified61.4%
if 1.35e70 < D Initial program 76.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified70.6%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified49.6%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr69.7%
Final simplification62.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= M_m 3.7e-48)
w0
(*
w0
(+
1.0
(* (/ -0.125 l) (* (/ (* D_m D_m) d_m) (/ (* h (* M_m M_m)) d_m)))))))M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 3.7e-48) {
tmp = w0;
} else {
tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (m_m <= 3.7d-48) then
tmp = w0
else
tmp = w0 * (1.0d0 + (((-0.125d0) / l) * (((d_m * d_m) / d_m_1) * ((h * (m_m * m_m)) / d_m_1))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 3.7e-48) {
tmp = w0;
} else {
tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if M_m <= 3.7e-48: tmp = w0 else: tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m)))) return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (M_m <= 3.7e-48) tmp = w0; else tmp = Float64(w0 * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(Float64(Float64(D_m * D_m) / d_m) * Float64(Float64(h * Float64(M_m * M_m)) / d_m))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (M_m <= 3.7e-48)
tmp = w0;
else
tmp = w0 * (1.0 + ((-0.125 / l) * (((D_m * D_m) / d_m) * ((h * (M_m * M_m)) / d_m))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[M$95$m, 3.7e-48], w0, N[(w0 * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] * N[(N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 3.7 \cdot 10^{-48}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{-0.125}{\ell} \cdot \left(\frac{D\_m \cdot D\_m}{d\_m} \cdot \frac{h \cdot \left(M\_m \cdot M\_m\right)}{d\_m}\right)\right)\\
\end{array}
\end{array}
if M < 3.6999999999999998e-48Initial program 80.5%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified78.6%
Taylor expanded in h around 0
Simplified72.7%
if 3.6999999999999998e-48 < M Initial program 75.2%
clear-numN/A
un-div-invN/A
unpow2N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr81.1%
Taylor expanded in D 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
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.6%
Simplified57.6%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) d_m = (fabs.f64 d) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (if (<= M_m 3.7e+20) w0 (/ (* (/ (* D_m D_m) d_m) (* (* h (* w0 (* M_m M_m))) (/ -0.125 d_m))) l)))
M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 3.7e+20) {
tmp = w0;
} else {
tmp = (((D_m * D_m) / d_m) * ((h * (w0 * (M_m * M_m))) * (-0.125 / d_m))) / l;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (m_m <= 3.7d+20) then
tmp = w0
else
tmp = (((d_m * d_m) / d_m_1) * ((h * (w0 * (m_m * m_m))) * ((-0.125d0) / d_m_1))) / l
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 3.7e+20) {
tmp = w0;
} else {
tmp = (((D_m * D_m) / d_m) * ((h * (w0 * (M_m * M_m))) * (-0.125 / d_m))) / l;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if M_m <= 3.7e+20: tmp = w0 else: tmp = (((D_m * D_m) / d_m) * ((h * (w0 * (M_m * M_m))) * (-0.125 / d_m))) / l return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (M_m <= 3.7e+20) tmp = w0; else tmp = Float64(Float64(Float64(Float64(D_m * D_m) / d_m) * Float64(Float64(h * Float64(w0 * Float64(M_m * M_m))) * Float64(-0.125 / d_m))) / l); end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (M_m <= 3.7e+20)
tmp = w0;
else
tmp = (((D_m * D_m) / d_m) * ((h * (w0 * (M_m * M_m))) * (-0.125 / d_m))) / l;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[M$95$m, 3.7e+20], w0, N[(N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] * N[(N[(h * N[(w0 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 3.7 \cdot 10^{+20}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{D\_m \cdot D\_m}{d\_m} \cdot \left(\left(h \cdot \left(w0 \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \frac{-0.125}{d\_m}\right)}{\ell}\\
\end{array}
\end{array}
if M < 3.7e20Initial program 80.6%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified78.8%
Taylor expanded in h around 0
Simplified72.5%
if 3.7e20 < M Initial program 73.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified72.2%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified37.2%
Taylor expanded in D around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6423.2%
Simplified23.2%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr29.8%
Final simplification63.3%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) d_m = (fabs.f64 d) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (if (<= M_m 1.05e+95) w0 (* (/ (* -0.125 (* D_m (* h (* w0 (* M_m M_m))))) d_m) (/ D_m (* d_m l)))))
M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 1.05e+95) {
tmp = w0;
} else {
tmp = ((-0.125 * (D_m * (h * (w0 * (M_m * M_m))))) / d_m) * (D_m / (d_m * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (m_m <= 1.05d+95) then
tmp = w0
else
tmp = (((-0.125d0) * (d_m * (h * (w0 * (m_m * m_m))))) / d_m_1) * (d_m / (d_m_1 * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 1.05e+95) {
tmp = w0;
} else {
tmp = ((-0.125 * (D_m * (h * (w0 * (M_m * M_m))))) / d_m) * (D_m / (d_m * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if M_m <= 1.05e+95: tmp = w0 else: tmp = ((-0.125 * (D_m * (h * (w0 * (M_m * M_m))))) / d_m) * (D_m / (d_m * l)) return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (M_m <= 1.05e+95) tmp = w0; else tmp = Float64(Float64(Float64(-0.125 * Float64(D_m * Float64(h * Float64(w0 * Float64(M_m * M_m))))) / d_m) * Float64(D_m / Float64(d_m * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (M_m <= 1.05e+95)
tmp = w0;
else
tmp = ((-0.125 * (D_m * (h * (w0 * (M_m * M_m))))) / d_m) * (D_m / (d_m * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[M$95$m, 1.05e+95], w0, N[(N[(N[(-0.125 * N[(D$95$m * N[(h * N[(w0 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] * N[(D$95$m / N[(d$95$m * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 1.05 \cdot 10^{+95}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\frac{-0.125 \cdot \left(D\_m \cdot \left(h \cdot \left(w0 \cdot \left(M\_m \cdot M\_m\right)\right)\right)\right)}{d\_m} \cdot \frac{D\_m}{d\_m \cdot \ell}\\
\end{array}
\end{array}
if M < 1.05e95Initial program 79.7%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified78.5%
Taylor expanded in h around 0
Simplified72.5%
if 1.05e95 < M Initial program 75.6%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified71.9%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified32.7%
Taylor expanded in D around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.1%
Simplified26.1%
associate-*r*N/A
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr32.3%
Final simplification65.6%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) d_m = (fabs.f64 d) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (if (<= M_m 3.5e+95) w0 (* (* -0.125 (* D_m (* h (* w0 (* M_m M_m))))) (/ D_m (* d_m (* d_m l))))))
M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 3.5e+95) {
tmp = w0;
} else {
tmp = (-0.125 * (D_m * (h * (w0 * (M_m * M_m))))) * (D_m / (d_m * (d_m * l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (m_m <= 3.5d+95) then
tmp = w0
else
tmp = ((-0.125d0) * (d_m * (h * (w0 * (m_m * m_m))))) * (d_m / (d_m_1 * (d_m_1 * l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 3.5e+95) {
tmp = w0;
} else {
tmp = (-0.125 * (D_m * (h * (w0 * (M_m * M_m))))) * (D_m / (d_m * (d_m * l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if M_m <= 3.5e+95: tmp = w0 else: tmp = (-0.125 * (D_m * (h * (w0 * (M_m * M_m))))) * (D_m / (d_m * (d_m * l))) return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (M_m <= 3.5e+95) tmp = w0; else tmp = Float64(Float64(-0.125 * Float64(D_m * Float64(h * Float64(w0 * Float64(M_m * M_m))))) * Float64(D_m / Float64(d_m * Float64(d_m * l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (M_m <= 3.5e+95)
tmp = w0;
else
tmp = (-0.125 * (D_m * (h * (w0 * (M_m * M_m))))) * (D_m / (d_m * (d_m * l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[M$95$m, 3.5e+95], w0, N[(N[(-0.125 * N[(D$95$m * N[(h * N[(w0 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / N[(d$95$m * N[(d$95$m * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 3.5 \cdot 10^{+95}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\left(-0.125 \cdot \left(D\_m \cdot \left(h \cdot \left(w0 \cdot \left(M\_m \cdot M\_m\right)\right)\right)\right)\right) \cdot \frac{D\_m}{d\_m \cdot \left(d\_m \cdot \ell\right)}\\
\end{array}
\end{array}
if M < 3.5e95Initial program 79.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified78.6%
Taylor expanded in h around 0
Simplified72.6%
if 3.5e95 < M Initial program 75.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified71.3%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified31.2%
Taylor expanded in D around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.7%
Simplified26.7%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*r*N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6432.4%
Applied egg-rr32.4%
Final simplification65.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= M_m 1.42e+80)
w0
(if (<= M_m 1.32e+154)
(/ (* w0 (* M_m M_m)) (* M_m M_m))
(* (/ w0 M_m) (/ (* M_m M_m) M_m)))))M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 1.42e+80) {
tmp = w0;
} else if (M_m <= 1.32e+154) {
tmp = (w0 * (M_m * M_m)) / (M_m * M_m);
} else {
tmp = (w0 / M_m) * ((M_m * M_m) / M_m);
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (m_m <= 1.42d+80) then
tmp = w0
else if (m_m <= 1.32d+154) then
tmp = (w0 * (m_m * m_m)) / (m_m * m_m)
else
tmp = (w0 / m_m) * ((m_m * m_m) / m_m)
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 1.42e+80) {
tmp = w0;
} else if (M_m <= 1.32e+154) {
tmp = (w0 * (M_m * M_m)) / (M_m * M_m);
} else {
tmp = (w0 / M_m) * ((M_m * M_m) / M_m);
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if M_m <= 1.42e+80: tmp = w0 elif M_m <= 1.32e+154: tmp = (w0 * (M_m * M_m)) / (M_m * M_m) else: tmp = (w0 / M_m) * ((M_m * M_m) / M_m) return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (M_m <= 1.42e+80) tmp = w0; elseif (M_m <= 1.32e+154) tmp = Float64(Float64(w0 * Float64(M_m * M_m)) / Float64(M_m * M_m)); else tmp = Float64(Float64(w0 / M_m) * Float64(Float64(M_m * M_m) / M_m)); end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (M_m <= 1.42e+80)
tmp = w0;
elseif (M_m <= 1.32e+154)
tmp = (w0 * (M_m * M_m)) / (M_m * M_m);
else
tmp = (w0 / M_m) * ((M_m * M_m) / M_m);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[M$95$m, 1.42e+80], w0, If[LessEqual[M$95$m, 1.32e+154], N[(N[(w0 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(w0 / M$95$m), $MachinePrecision] * N[(N[(M$95$m * M$95$m), $MachinePrecision] / M$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 1.42 \cdot 10^{+80}:\\
\;\;\;\;w0\\
\mathbf{elif}\;M\_m \leq 1.32 \cdot 10^{+154}:\\
\;\;\;\;\frac{w0 \cdot \left(M\_m \cdot M\_m\right)}{M\_m \cdot M\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{w0}{M\_m} \cdot \frac{M\_m \cdot M\_m}{M\_m}\\
\end{array}
\end{array}
if M < 1.4200000000000001e80Initial program 80.4%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified78.7%
Taylor expanded in h around 0
Simplified72.5%
if 1.4200000000000001e80 < M < 1.31999999999999998e154Initial program 67.7%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified72.8%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified34.4%
Taylor expanded in M around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6440.0%
Simplified40.0%
Taylor expanded in h around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6426.7%
Simplified26.7%
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6455.0%
Applied egg-rr55.0%
if 1.31999999999999998e154 < M Initial program 77.1%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified70.7%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified31.5%
Taylor expanded in M around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6431.4%
Simplified31.4%
Taylor expanded in h around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f640.0%
Simplified0.0%
associate-*r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6436.7%
Applied egg-rr36.7%
Final simplification67.4%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) d_m = (fabs.f64 d) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (if (<= M_m 3e+78) w0 (/ (/ (* w0 (* M_m M_m)) M_m) M_m)))
M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 3e+78) {
tmp = w0;
} else {
tmp = ((w0 * (M_m * M_m)) / M_m) / M_m;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (m_m <= 3d+78) then
tmp = w0
else
tmp = ((w0 * (m_m * m_m)) / m_m) / m_m
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 3e+78) {
tmp = w0;
} else {
tmp = ((w0 * (M_m * M_m)) / M_m) / M_m;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if M_m <= 3e+78: tmp = w0 else: tmp = ((w0 * (M_m * M_m)) / M_m) / M_m return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (M_m <= 3e+78) tmp = w0; else tmp = Float64(Float64(Float64(w0 * Float64(M_m * M_m)) / M_m) / M_m); end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (M_m <= 3e+78)
tmp = w0;
else
tmp = ((w0 * (M_m * M_m)) / M_m) / M_m;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[M$95$m, 3e+78], w0, N[(N[(N[(w0 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / M$95$m), $MachinePrecision] / M$95$m), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 3 \cdot 10^{+78}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{w0 \cdot \left(M\_m \cdot M\_m\right)}{M\_m}}{M\_m}\\
\end{array}
\end{array}
if M < 2.99999999999999982e78Initial program 80.4%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified78.7%
Taylor expanded in h around 0
Simplified72.5%
if 2.99999999999999982e78 < M Initial program 72.9%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified71.6%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified32.8%
Taylor expanded in M around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6435.2%
Simplified35.2%
Taylor expanded in h around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6411.9%
Simplified11.9%
associate-*r/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6447.5%
Applied egg-rr47.5%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) d_m = (fabs.f64 d) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (if (<= M_m 7.5e-69) w0 (/ (* (* M_m M_m) (/ w0 M_m)) M_m)))
M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 7.5e-69) {
tmp = w0;
} else {
tmp = ((M_m * M_m) * (w0 / M_m)) / M_m;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: tmp
if (m_m <= 7.5d-69) then
tmp = w0
else
tmp = ((m_m * m_m) * (w0 / m_m)) / m_m
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 7.5e-69) {
tmp = w0;
} else {
tmp = ((M_m * M_m) * (w0 / M_m)) / M_m;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if M_m <= 7.5e-69: tmp = w0 else: tmp = ((M_m * M_m) * (w0 / M_m)) / M_m return tmp
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (M_m <= 7.5e-69) tmp = w0; else tmp = Float64(Float64(Float64(M_m * M_m) * Float64(w0 / M_m)) / M_m); end return tmp end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (M_m <= 7.5e-69)
tmp = w0;
else
tmp = ((M_m * M_m) * (w0 / M_m)) / M_m;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[M$95$m, 7.5e-69], w0, N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(w0 / M$95$m), $MachinePrecision]), $MachinePrecision] / M$95$m), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 7.5 \cdot 10^{-69}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(M\_m \cdot M\_m\right) \cdot \frac{w0}{M\_m}}{M\_m}\\
\end{array}
\end{array}
if M < 7.5e-69Initial program 80.6%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified78.6%
Taylor expanded in h around 0
Simplified72.1%
if 7.5e-69 < M Initial program 75.2%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified74.4%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified44.7%
Taylor expanded in M around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6441.0%
Simplified41.0%
Taylor expanded in h around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6434.4%
Simplified34.4%
*-commutativeN/A
associate-/r*N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6453.2%
Applied egg-rr53.2%
Final simplification66.5%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) d_m = (fabs.f64 d) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 w0)
M_m = fabs(M);
D_m = fabs(D);
d_m = fabs(d);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return w0;
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
code = w0
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return w0;
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): return w0
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) return w0 end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp = code(w0, M_m, D_m, h, l, d_m)
tmp = w0;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := w0
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
w0
\end{array}
Initial program 79.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
Simplified77.4%
Taylor expanded in h 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))))))