
(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 12 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
(if (<= (/ (* M_m D_m) (* 2.0 d_m)) 5e+65)
(*
w0
(sqrt
(+ 1.0 (* (/ (/ (/ h (/ -4.0 M_m)) (/ d_m (* M_m D_m))) l) (/ D_m d_m)))))
(*
w0
(sqrt
(+
1.0
(/
(* (/ (/ (* M_m (* M_m D_m)) (* d_m -4.0)) l) (/ D_m (/ 1.0 h)))
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 * D_m) / (2.0 * d_m)) <= 5e+65) {
tmp = w0 * sqrt((1.0 + ((((h / (-4.0 / M_m)) / (d_m / (M_m * D_m))) / l) * (D_m / d_m))));
} else {
tmp = w0 * sqrt((1.0 + (((((M_m * (M_m * D_m)) / (d_m * -4.0)) / l) * (D_m / (1.0 / h))) / 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 * d_m) / (2.0d0 * d_m_1)) <= 5d+65) then
tmp = w0 * sqrt((1.0d0 + ((((h / ((-4.0d0) / m_m)) / (d_m_1 / (m_m * d_m))) / l) * (d_m / d_m_1))))
else
tmp = w0 * sqrt((1.0d0 + (((((m_m * (m_m * d_m)) / (d_m_1 * (-4.0d0))) / l) * (d_m / (1.0d0 / h))) / 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 * D_m) / (2.0 * d_m)) <= 5e+65) {
tmp = w0 * Math.sqrt((1.0 + ((((h / (-4.0 / M_m)) / (d_m / (M_m * D_m))) / l) * (D_m / d_m))));
} else {
tmp = w0 * Math.sqrt((1.0 + (((((M_m * (M_m * D_m)) / (d_m * -4.0)) / l) * (D_m / (1.0 / h))) / 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 * D_m) / (2.0 * d_m)) <= 5e+65: tmp = w0 * math.sqrt((1.0 + ((((h / (-4.0 / M_m)) / (d_m / (M_m * D_m))) / l) * (D_m / d_m)))) else: tmp = w0 * math.sqrt((1.0 + (((((M_m * (M_m * D_m)) / (d_m * -4.0)) / l) * (D_m / (1.0 / h))) / 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 (Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) <= 5e+65) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(Float64(Float64(h / Float64(-4.0 / M_m)) / Float64(d_m / Float64(M_m * D_m))) / l) * Float64(D_m / d_m))))); else tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(Float64(Float64(Float64(M_m * Float64(M_m * D_m)) / Float64(d_m * -4.0)) / l) * Float64(D_m / Float64(1.0 / h))) / 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 * D_m) / (2.0 * d_m)) <= 5e+65)
tmp = w0 * sqrt((1.0 + ((((h / (-4.0 / M_m)) / (d_m / (M_m * D_m))) / l) * (D_m / d_m))));
else
tmp = w0 * sqrt((1.0 + (((((M_m * (M_m * D_m)) / (d_m * -4.0)) / l) * (D_m / (1.0 / h))) / 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[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 5e+65], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(N[(N[(h / N[(-4.0 / M$95$m), $MachinePrecision]), $MachinePrecision] / N[(d$95$m / N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(D$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(N[(N[(N[(M$95$m * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * -4.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(D$95$m / N[(1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d$95$m), $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}\;\frac{M\_m \cdot D\_m}{2 \cdot d\_m} \leq 5 \cdot 10^{+65}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{\frac{\frac{h}{\frac{-4}{M\_m}}}{\frac{d\_m}{M\_m \cdot D\_m}}}{\ell} \cdot \frac{D\_m}{d\_m}}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{\frac{\frac{M\_m \cdot \left(M\_m \cdot D\_m\right)}{d\_m \cdot -4}}{\ell} \cdot \frac{D\_m}{\frac{1}{h}}}{d\_m}}\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 4.99999999999999973e65Initial program 85.7%
Simplified79.3%
associate-/l*N/A
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr89.6%
associate-/r/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6488.1%
Applied egg-rr88.1%
if 4.99999999999999973e65 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 66.2%
Simplified57.0%
*-commutativeN/A
clear-numN/A
un-div-invN/A
*-commutativeN/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6464.0%
Applied egg-rr64.0%
Final simplification84.1%
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) -4e-278)
(*
w0
(sqrt
(+ 1.0 (* (/ (/ (/ h (/ -4.0 M_m)) (/ d_m (* M_m D_m))) l) (/ 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 ((h / l) <= -4e-278) {
tmp = w0 * sqrt((1.0 + ((((h / (-4.0 / M_m)) / (d_m / (M_m * D_m))) / l) * (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 ((h / l) <= (-4d-278)) then
tmp = w0 * sqrt((1.0d0 + ((((h / ((-4.0d0) / m_m)) / (d_m_1 / (m_m * d_m))) / l) * (d_m / 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 ((h / l) <= -4e-278) {
tmp = w0 * Math.sqrt((1.0 + ((((h / (-4.0 / M_m)) / (d_m / (M_m * D_m))) / l) * (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 (h / l) <= -4e-278: tmp = w0 * math.sqrt((1.0 + ((((h / (-4.0 / M_m)) / (d_m / (M_m * D_m))) / l) * (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 (Float64(h / l) <= -4e-278) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(Float64(Float64(h / Float64(-4.0 / M_m)) / Float64(d_m / Float64(M_m * D_m))) / l) * 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 ((h / l) <= -4e-278)
tmp = w0 * sqrt((1.0 + ((((h / (-4.0 / M_m)) / (d_m / (M_m * D_m))) / l) * (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[N[(h / l), $MachinePrecision], -4e-278], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(N[(N[(h / N[(-4.0 / M$95$m), $MachinePrecision]), $MachinePrecision] / N[(d$95$m / N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $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}\;\frac{h}{\ell} \leq -4 \cdot 10^{-278}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{\frac{\frac{h}{\frac{-4}{M\_m}}}{\frac{d\_m}{M\_m \cdot D\_m}}}{\ell} \cdot \frac{D\_m}{d\_m}}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -3.99999999999999975e-278Initial program 79.5%
Simplified73.7%
associate-/l*N/A
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr79.6%
associate-/r/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6477.3%
Applied egg-rr77.3%
if -3.99999999999999975e-278 < (/.f64 h l) Initial program 85.6%
Simplified77.6%
Taylor expanded in h around 0
Simplified95.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 (<= d_m 520000000.0)
(*
w0
(sqrt
(+ 1.0 (* (/ (* (* M_m D_m) (* (/ h -4.0) (/ M_m d_m))) d_m) (/ D_m l)))))
(*
w0
(sqrt
(+
1.0
(* (/ D_m d_m) (/ (* (* D_m -0.25) (/ (* h (* M_m M_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 (d_m <= 520000000.0) {
tmp = w0 * sqrt((1.0 + ((((M_m * D_m) * ((h / -4.0) * (M_m / d_m))) / d_m) * (D_m / l))));
} else {
tmp = w0 * sqrt((1.0 + ((D_m / d_m) * (((D_m * -0.25) * ((h * (M_m * M_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 (d_m_1 <= 520000000.0d0) then
tmp = w0 * sqrt((1.0d0 + ((((m_m * d_m) * ((h / (-4.0d0)) * (m_m / d_m_1))) / d_m_1) * (d_m / l))))
else
tmp = w0 * sqrt((1.0d0 + ((d_m / d_m_1) * (((d_m * (-0.25d0)) * ((h * (m_m * m_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 (d_m <= 520000000.0) {
tmp = w0 * Math.sqrt((1.0 + ((((M_m * D_m) * ((h / -4.0) * (M_m / d_m))) / d_m) * (D_m / l))));
} else {
tmp = w0 * Math.sqrt((1.0 + ((D_m / d_m) * (((D_m * -0.25) * ((h * (M_m * M_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 d_m <= 520000000.0: tmp = w0 * math.sqrt((1.0 + ((((M_m * D_m) * ((h / -4.0) * (M_m / d_m))) / d_m) * (D_m / l)))) else: tmp = w0 * math.sqrt((1.0 + ((D_m / d_m) * (((D_m * -0.25) * ((h * (M_m * M_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 (d_m <= 520000000.0) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(Float64(Float64(M_m * D_m) * Float64(Float64(h / -4.0) * Float64(M_m / d_m))) / d_m) * Float64(D_m / l))))); else tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(D_m / d_m) * Float64(Float64(Float64(D_m * -0.25) * Float64(Float64(h * Float64(M_m * M_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)
tmp = 0.0;
if (d_m <= 520000000.0)
tmp = w0 * sqrt((1.0 + ((((M_m * D_m) * ((h / -4.0) * (M_m / d_m))) / d_m) * (D_m / l))));
else
tmp = w0 * sqrt((1.0 + ((D_m / d_m) * (((D_m * -0.25) * ((h * (M_m * M_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[d$95$m, 520000000.0], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(N[(h / -4.0), $MachinePrecision] * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] * N[(D$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(D$95$m / d$95$m), $MachinePrecision] * N[(N[(N[(D$95$m * -0.25), $MachinePrecision] * N[(N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision] / l), $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 520000000:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{\left(M\_m \cdot D\_m\right) \cdot \left(\frac{h}{-4} \cdot \frac{M\_m}{d\_m}\right)}{d\_m} \cdot \frac{D\_m}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{D\_m}{d\_m} \cdot \frac{\left(D\_m \cdot -0.25\right) \cdot \frac{h \cdot \left(M\_m \cdot M\_m\right)}{d\_m}}{\ell}}\\
\end{array}
\end{array}
if d < 5.2e8Initial program 81.8%
Simplified76.9%
associate-*l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr78.4%
associate-/r/N/A
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6479.0%
Applied egg-rr79.0%
if 5.2e8 < d Initial program 84.1%
Simplified72.4%
associate-/l*N/A
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr89.6%
Taylor expanded in h around 0
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6481.8%
Simplified81.8%
Final simplification79.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 4.5e-163)
w0
(*
w0
(sqrt
(+
1.0
(* (/ D_m d_m) (/ (* (* D_m -0.25) (/ (* h (* M_m M_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 <= 4.5e-163) {
tmp = w0;
} else {
tmp = w0 * sqrt((1.0 + ((D_m / d_m) * (((D_m * -0.25) * ((h * (M_m * M_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 <= 4.5d-163) then
tmp = w0
else
tmp = w0 * sqrt((1.0d0 + ((d_m / d_m_1) * (((d_m * (-0.25d0)) * ((h * (m_m * m_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 <= 4.5e-163) {
tmp = w0;
} else {
tmp = w0 * Math.sqrt((1.0 + ((D_m / d_m) * (((D_m * -0.25) * ((h * (M_m * M_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 <= 4.5e-163: tmp = w0 else: tmp = w0 * math.sqrt((1.0 + ((D_m / d_m) * (((D_m * -0.25) * ((h * (M_m * M_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 <= 4.5e-163) tmp = w0; else tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(D_m / d_m) * Float64(Float64(Float64(D_m * -0.25) * Float64(Float64(h * Float64(M_m * M_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)
tmp = 0.0;
if (M_m <= 4.5e-163)
tmp = w0;
else
tmp = w0 * sqrt((1.0 + ((D_m / d_m) * (((D_m * -0.25) * ((h * (M_m * M_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, 4.5e-163], w0, N[(w0 * N[Sqrt[N[(1.0 + N[(N[(D$95$m / d$95$m), $MachinePrecision] * N[(N[(N[(D$95$m * -0.25), $MachinePrecision] * N[(N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision] / l), $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 4.5 \cdot 10^{-163}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{D\_m}{d\_m} \cdot \frac{\left(D\_m \cdot -0.25\right) \cdot \frac{h \cdot \left(M\_m \cdot M\_m\right)}{d\_m}}{\ell}}\\
\end{array}
\end{array}
if M < 4.4999999999999997e-163Initial program 83.6%
Simplified77.9%
Taylor expanded in h around 0
Simplified77.3%
if 4.4999999999999997e-163 < M Initial program 80.7%
Simplified71.9%
associate-/l*N/A
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr81.8%
Taylor expanded in h around 0
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6469.2%
Simplified69.2%
Final simplification74.1%
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) -1.8e-256)
(+
w0
(* (/ D_m d_m) (/ (* D_m (* (* M_m (* M_m h)) (* w0 -0.125))) (* 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) <= -1.8e-256) {
tmp = w0 + ((D_m / d_m) * ((D_m * ((M_m * (M_m * h)) * (w0 * -0.125))) / (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) <= (-1.8d-256)) then
tmp = w0 + ((d_m / d_m_1) * ((d_m * ((m_m * (m_m * h)) * (w0 * (-0.125d0)))) / (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) <= -1.8e-256) {
tmp = w0 + ((D_m / d_m) * ((D_m * ((M_m * (M_m * h)) * (w0 * -0.125))) / (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) <= -1.8e-256: tmp = w0 + ((D_m / d_m) * ((D_m * ((M_m * (M_m * h)) * (w0 * -0.125))) / (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) <= -1.8e-256) tmp = Float64(w0 + Float64(Float64(D_m / d_m) * Float64(Float64(D_m * Float64(Float64(M_m * Float64(M_m * h)) * Float64(w0 * -0.125))) / Float64(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) <= -1.8e-256)
tmp = w0 + ((D_m / d_m) * ((D_m * ((M_m * (M_m * h)) * (w0 * -0.125))) / (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], -1.8e-256], N[(w0 + N[(N[(D$95$m / d$95$m), $MachinePrecision] * N[(N[(D$95$m * N[(N[(M$95$m * N[(M$95$m * h), $MachinePrecision]), $MachinePrecision] * N[(w0 * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * 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 -1.8 \cdot 10^{-256}:\\
\;\;\;\;w0 + \frac{D\_m}{d\_m} \cdot \frac{D\_m \cdot \left(\left(M\_m \cdot \left(M\_m \cdot h\right)\right) \cdot \left(w0 \cdot -0.125\right)\right)}{d\_m \cdot \ell}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -1.8000000000000001e-256Initial program 79.4%
Simplified73.4%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified46.0%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6457.9%
Applied egg-rr57.9%
if -1.8000000000000001e-256 < (/.f64 h l) Initial program 85.4%
Simplified77.7%
Taylor expanded in h around 0
Simplified94.9%
Final simplification76.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 (<= (/ h l) -1.8e-256)
(+
w0
(* (/ (* D_m (* (* M_m (* M_m h)) (* w0 -0.125))) 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) <= -1.8e-256) {
tmp = w0 + (((D_m * ((M_m * (M_m * h)) * (w0 * -0.125))) / 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) <= (-1.8d-256)) then
tmp = w0 + (((d_m * ((m_m * (m_m * h)) * (w0 * (-0.125d0)))) / 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) <= -1.8e-256) {
tmp = w0 + (((D_m * ((M_m * (M_m * h)) * (w0 * -0.125))) / 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) <= -1.8e-256: tmp = w0 + (((D_m * ((M_m * (M_m * h)) * (w0 * -0.125))) / 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) <= -1.8e-256) tmp = Float64(w0 + Float64(Float64(Float64(D_m * Float64(Float64(M_m * Float64(M_m * h)) * Float64(w0 * -0.125))) / d_m) * Float64(D_m / Float64(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) <= -1.8e-256)
tmp = w0 + (((D_m * ((M_m * (M_m * h)) * (w0 * -0.125))) / 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], -1.8e-256], N[(w0 + N[(N[(N[(D$95$m * N[(N[(M$95$m * N[(M$95$m * h), $MachinePrecision]), $MachinePrecision] * N[(w0 * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] * N[(D$95$m / N[(d$95$m * 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 -1.8 \cdot 10^{-256}:\\
\;\;\;\;w0 + \frac{D\_m \cdot \left(\left(M\_m \cdot \left(M\_m \cdot h\right)\right) \cdot \left(w0 \cdot -0.125\right)\right)}{d\_m} \cdot \frac{D\_m}{d\_m \cdot \ell}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -1.8000000000000001e-256Initial program 79.4%
Simplified73.4%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified46.0%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6457.9%
Applied egg-rr57.9%
if -1.8000000000000001e-256 < (/.f64 h l) Initial program 85.4%
Simplified77.7%
Taylor expanded in h around 0
Simplified94.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-18)
(+
w0
(* (/ D_m (* d_m l)) (* (* (* M_m D_m) (* M_m h)) (/ (* w0 -0.125) 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 ((h / l) <= -5e-18) {
tmp = w0 + ((D_m / (d_m * l)) * (((M_m * D_m) * (M_m * h)) * ((w0 * -0.125) / 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 ((h / l) <= (-5d-18)) then
tmp = w0 + ((d_m / (d_m_1 * l)) * (((m_m * d_m) * (m_m * h)) * ((w0 * (-0.125d0)) / 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 ((h / l) <= -5e-18) {
tmp = w0 + ((D_m / (d_m * l)) * (((M_m * D_m) * (M_m * h)) * ((w0 * -0.125) / 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 (h / l) <= -5e-18: tmp = w0 + ((D_m / (d_m * l)) * (((M_m * D_m) * (M_m * h)) * ((w0 * -0.125) / 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 (Float64(h / l) <= -5e-18) tmp = Float64(w0 + Float64(Float64(D_m / Float64(d_m * l)) * Float64(Float64(Float64(M_m * D_m) * Float64(M_m * h)) * Float64(Float64(w0 * -0.125) / 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 ((h / l) <= -5e-18)
tmp = w0 + ((D_m / (d_m * l)) * (((M_m * D_m) * (M_m * h)) * ((w0 * -0.125) / 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[N[(h / l), $MachinePrecision], -5e-18], N[(w0 + N[(N[(D$95$m / N[(d$95$m * l), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(M$95$m * h), $MachinePrecision]), $MachinePrecision] * N[(N[(w0 * -0.125), $MachinePrecision] / d$95$m), $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^{-18}:\\
\;\;\;\;w0 + \frac{D\_m}{d\_m \cdot \ell} \cdot \left(\left(\left(M\_m \cdot D\_m\right) \cdot \left(M\_m \cdot h\right)\right) \cdot \frac{w0 \cdot -0.125}{d\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -5.00000000000000036e-18Initial program 77.1%
Simplified69.6%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified41.9%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6452.9%
Applied egg-rr52.9%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6460.8%
Applied egg-rr60.8%
if -5.00000000000000036e-18 < (/.f64 h l) Initial program 85.3%
Simplified78.8%
Taylor expanded in h around 0
Simplified88.5%
Final simplification78.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 5e+89) w0 (* (* D_m -0.125) (* (/ D_m (* d_m l)) (/ (* w0 (* 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 <= 5e+89) {
tmp = w0;
} else {
tmp = (D_m * -0.125) * ((D_m / (d_m * l)) * ((w0 * (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 <= 5d+89) then
tmp = w0
else
tmp = (d_m * (-0.125d0)) * ((d_m / (d_m_1 * l)) * ((w0 * (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 <= 5e+89) {
tmp = w0;
} else {
tmp = (D_m * -0.125) * ((D_m / (d_m * l)) * ((w0 * (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 <= 5e+89: tmp = w0 else: tmp = (D_m * -0.125) * ((D_m / (d_m * l)) * ((w0 * (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 <= 5e+89) tmp = w0; else tmp = Float64(Float64(D_m * -0.125) * Float64(Float64(D_m / Float64(d_m * l)) * Float64(Float64(w0 * 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 <= 5e+89)
tmp = w0;
else
tmp = (D_m * -0.125) * ((D_m / (d_m * l)) * ((w0 * (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, 5e+89], w0, N[(N[(D$95$m * -0.125), $MachinePrecision] * N[(N[(D$95$m / N[(d$95$m * l), $MachinePrecision]), $MachinePrecision] * N[(N[(w0 * N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d$95$m), $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 5 \cdot 10^{+89}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\left(D\_m \cdot -0.125\right) \cdot \left(\frac{D\_m}{d\_m \cdot \ell} \cdot \frac{w0 \cdot \left(h \cdot \left(M\_m \cdot M\_m\right)\right)}{d\_m}\right)\\
\end{array}
\end{array}
if M < 4.99999999999999983e89Initial program 83.7%
Simplified78.7%
Taylor expanded in h around 0
Simplified76.1%
if 4.99999999999999983e89 < M Initial program 75.7%
Simplified58.7%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified35.5%
Taylor expanded in M around inf
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6421.8%
Simplified21.8%
associate-/l*N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6420.3%
Applied egg-rr20.3%
associate-*r/N/A
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6425.1%
Applied egg-rr25.1%
Final simplification68.1%
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 2.1e+93) w0 (* (* D_m -0.125) (* h (* D_m (* (/ (* M_m M_m) (* d_m d_m)) (/ w0 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 <= 2.1e+93) {
tmp = w0;
} else {
tmp = (D_m * -0.125) * (h * (D_m * (((M_m * M_m) / (d_m * d_m)) * (w0 / 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 <= 2.1d+93) then
tmp = w0
else
tmp = (d_m * (-0.125d0)) * (h * (d_m * (((m_m * m_m) / (d_m_1 * d_m_1)) * (w0 / 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 <= 2.1e+93) {
tmp = w0;
} else {
tmp = (D_m * -0.125) * (h * (D_m * (((M_m * M_m) / (d_m * d_m)) * (w0 / 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 <= 2.1e+93: tmp = w0 else: tmp = (D_m * -0.125) * (h * (D_m * (((M_m * M_m) / (d_m * d_m)) * (w0 / 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 <= 2.1e+93) tmp = w0; else tmp = Float64(Float64(D_m * -0.125) * Float64(h * Float64(D_m * Float64(Float64(Float64(M_m * M_m) / Float64(d_m * d_m)) * Float64(w0 / 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 <= 2.1e+93)
tmp = w0;
else
tmp = (D_m * -0.125) * (h * (D_m * (((M_m * M_m) / (d_m * d_m)) * (w0 / 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, 2.1e+93], w0, N[(N[(D$95$m * -0.125), $MachinePrecision] * N[(h * N[(D$95$m * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] / N[(d$95$m * d$95$m), $MachinePrecision]), $MachinePrecision] * N[(w0 / l), $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 2.1 \cdot 10^{+93}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\left(D\_m \cdot -0.125\right) \cdot \left(h \cdot \left(D\_m \cdot \left(\frac{M\_m \cdot M\_m}{d\_m \cdot d\_m} \cdot \frac{w0}{\ell}\right)\right)\right)\\
\end{array}
\end{array}
if M < 2.0999999999999998e93Initial program 83.0%
Simplified78.1%
Taylor expanded in h around 0
Simplified75.5%
if 2.0999999999999998e93 < M Initial program 79.1%
Simplified60.6%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified38.2%
Taylor expanded in M around inf
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6423.0%
Simplified23.0%
associate-/l*N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6421.3%
Applied egg-rr21.3%
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6423.8%
Applied egg-rr23.8%
Final simplification68.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 (if (<= M_m 3.4e+95) w0 (* (* D_m -0.125) (* D_m (/ (* (/ h l) (* w0 (* M_m M_m))) (* d_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.4e+95) {
tmp = w0;
} else {
tmp = (D_m * -0.125) * (D_m * (((h / l) * (w0 * (M_m * M_m))) / (d_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.4d+95) then
tmp = w0
else
tmp = (d_m * (-0.125d0)) * (d_m * (((h / l) * (w0 * (m_m * m_m))) / (d_m_1 * 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.4e+95) {
tmp = w0;
} else {
tmp = (D_m * -0.125) * (D_m * (((h / l) * (w0 * (M_m * M_m))) / (d_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.4e+95: tmp = w0 else: tmp = (D_m * -0.125) * (D_m * (((h / l) * (w0 * (M_m * M_m))) / (d_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.4e+95) tmp = w0; else tmp = Float64(Float64(D_m * -0.125) * Float64(D_m * Float64(Float64(Float64(h / l) * Float64(w0 * Float64(M_m * M_m))) / Float64(d_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.4e+95)
tmp = w0;
else
tmp = (D_m * -0.125) * (D_m * (((h / l) * (w0 * (M_m * M_m))) / (d_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.4e+95], w0, N[(N[(D$95$m * -0.125), $MachinePrecision] * N[(D$95$m * N[(N[(N[(h / l), $MachinePrecision] * N[(w0 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * d$95$m), $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.4 \cdot 10^{+95}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\left(D\_m \cdot -0.125\right) \cdot \left(D\_m \cdot \frac{\frac{h}{\ell} \cdot \left(w0 \cdot \left(M\_m \cdot M\_m\right)\right)}{d\_m \cdot d\_m}\right)\\
\end{array}
\end{array}
if M < 3.40000000000000022e95Initial program 83.1%
Simplified78.2%
Taylor expanded in h around 0
Simplified75.6%
if 3.40000000000000022e95 < M Initial program 78.5%
Simplified59.5%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified36.5%
Taylor expanded in M around inf
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6423.6%
Simplified23.6%
associate-/l*N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6421.8%
Applied egg-rr21.8%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6424.5%
Applied egg-rr24.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 2.55e+95) w0 (* (* D_m -0.125) (* D_m (/ (* h (* w0 (* M_m M_m))) (* l (* d_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 <= 2.55e+95) {
tmp = w0;
} else {
tmp = (D_m * -0.125) * (D_m * ((h * (w0 * (M_m * M_m))) / (l * (d_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 <= 2.55d+95) then
tmp = w0
else
tmp = (d_m * (-0.125d0)) * (d_m * ((h * (w0 * (m_m * m_m))) / (l * (d_m_1 * 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 <= 2.55e+95) {
tmp = w0;
} else {
tmp = (D_m * -0.125) * (D_m * ((h * (w0 * (M_m * M_m))) / (l * (d_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 <= 2.55e+95: tmp = w0 else: tmp = (D_m * -0.125) * (D_m * ((h * (w0 * (M_m * M_m))) / (l * (d_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 <= 2.55e+95) tmp = w0; else tmp = Float64(Float64(D_m * -0.125) * Float64(D_m * Float64(Float64(h * Float64(w0 * Float64(M_m * M_m))) / Float64(l * Float64(d_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 <= 2.55e+95)
tmp = w0;
else
tmp = (D_m * -0.125) * (D_m * ((h * (w0 * (M_m * M_m))) / (l * (d_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, 2.55e+95], w0, N[(N[(D$95$m * -0.125), $MachinePrecision] * N[(D$95$m * N[(N[(h * N[(w0 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(l * N[(d$95$m * 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 2.55 \cdot 10^{+95}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\left(D\_m \cdot -0.125\right) \cdot \left(D\_m \cdot \frac{h \cdot \left(w0 \cdot \left(M\_m \cdot M\_m\right)\right)}{\ell \cdot \left(d\_m \cdot d\_m\right)}\right)\\
\end{array}
\end{array}
if M < 2.55000000000000001e95Initial program 83.0%
Simplified78.1%
Taylor expanded in h around 0
Simplified75.5%
if 2.55000000000000001e95 < M Initial program 79.1%
Simplified60.6%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified38.2%
Taylor expanded in M around inf
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6423.0%
Simplified23.0%
associate-/l*N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6421.3%
Applied egg-rr21.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 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 82.5%
Simplified75.6%
Taylor expanded in h around 0
Simplified71.9%
herbie shell --seed 2024161
(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))))))