
(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 7 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 (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) (- INFINITY))
(* (/ (sqrt (* -0.25 (/ (* D_m (* (* M_m h) (* M_m D_m))) l))) d_m) w0)
(*
w0
(sqrt
(+
1.0
(* h (/ (/ (* D_m (/ M_m (/ d_m (* M_m D_m)))) (* d_m -4.0)) 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 ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -((double) INFINITY)) {
tmp = (sqrt((-0.25 * ((D_m * ((M_m * h) * (M_m * D_m))) / l))) / d_m) * w0;
} else {
tmp = w0 * sqrt((1.0 + (h * (((D_m * (M_m / (d_m / (M_m * D_m)))) / (d_m * -4.0)) / l))));
}
return tmp;
}
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 ((Math.pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt((-0.25 * ((D_m * ((M_m * h) * (M_m * D_m))) / l))) / d_m) * w0;
} else {
tmp = w0 * Math.sqrt((1.0 + (h * (((D_m * (M_m / (d_m / (M_m * D_m)))) / (d_m * -4.0)) / 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 (math.pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -math.inf: tmp = (math.sqrt((-0.25 * ((D_m * ((M_m * h) * (M_m * D_m))) / l))) / d_m) * w0 else: tmp = w0 * math.sqrt((1.0 + (h * (((D_m * (M_m / (d_m / (M_m * D_m)))) / (d_m * -4.0)) / 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 (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(-0.25 * Float64(Float64(D_m * Float64(Float64(M_m * h) * Float64(M_m * D_m))) / l))) / d_m) * w0); else tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(h * Float64(Float64(Float64(D_m * Float64(M_m / Float64(d_m / Float64(M_m * D_m)))) / Float64(d_m * -4.0)) / 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 * D_m) / (2.0 * d_m)) ^ 2.0) * (h / l)) <= -Inf)
tmp = (sqrt((-0.25 * ((D_m * ((M_m * h) * (M_m * D_m))) / l))) / d_m) * w0;
else
tmp = w0 * sqrt((1.0 + (h * (((D_m * (M_m / (d_m / (M_m * D_m)))) / (d_m * -4.0)) / 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[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(N[Sqrt[N[(-0.25 * N[(N[(D$95$m * N[(N[(M$95$m * h), $MachinePrecision] * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / d$95$m), $MachinePrecision] * w0), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 + N[(h * N[(N[(N[(D$95$m * N[(M$95$m / N[(d$95$m / N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * -4.0), $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}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -\infty:\\
\;\;\;\;\frac{\sqrt{-0.25 \cdot \frac{D\_m \cdot \left(\left(M\_m \cdot h\right) \cdot \left(M\_m \cdot D\_m\right)\right)}{\ell}}}{d\_m} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 + h \cdot \frac{\frac{D\_m \cdot \frac{M\_m}{\frac{d\_m}{M\_m \cdot D\_m}}}{d\_m \cdot -4}}{\ell}}\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0Initial program 44.2%
Simplified45.9%
Taylor expanded in h around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6439.8%
Simplified39.8%
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr19.3%
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6427.8%
Applied egg-rr27.8%
if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 93.3%
Simplified96.1%
associate-/l*N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r/N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6497.5%
Applied egg-rr97.5%
Final simplification81.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
(let* ((t_0 (* h (* M_m D_m))))
(if (<= D_m 5e-13)
(* w0 (+ 1.0 (/ (/ (/ -0.125 (/ (/ l D_m) (* M_m t_0))) d_m) d_m)))
(* w0 (+ 1.0 (* -0.125 (/ (/ t_0 (/ d_m (* M_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 t_0 = h * (M_m * D_m);
double tmp;
if (D_m <= 5e-13) {
tmp = w0 * (1.0 + (((-0.125 / ((l / D_m) / (M_m * t_0))) / d_m) / d_m));
} else {
tmp = w0 * (1.0 + (-0.125 * ((t_0 / (d_m / (M_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) :: t_0
real(8) :: tmp
t_0 = h * (m_m * d_m)
if (d_m <= 5d-13) then
tmp = w0 * (1.0d0 + ((((-0.125d0) / ((l / d_m) / (m_m * t_0))) / d_m_1) / d_m_1))
else
tmp = w0 * (1.0d0 + ((-0.125d0) * ((t_0 / (d_m_1 / (m_m * 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 = h * (M_m * D_m);
double tmp;
if (D_m <= 5e-13) {
tmp = w0 * (1.0 + (((-0.125 / ((l / D_m) / (M_m * t_0))) / d_m) / d_m));
} else {
tmp = w0 * (1.0 + (-0.125 * ((t_0 / (d_m / (M_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): t_0 = h * (M_m * D_m) tmp = 0 if D_m <= 5e-13: tmp = w0 * (1.0 + (((-0.125 / ((l / D_m) / (M_m * t_0))) / d_m) / d_m)) else: tmp = w0 * (1.0 + (-0.125 * ((t_0 / (d_m / (M_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) t_0 = Float64(h * Float64(M_m * D_m)) tmp = 0.0 if (D_m <= 5e-13) tmp = Float64(w0 * Float64(1.0 + Float64(Float64(Float64(-0.125 / Float64(Float64(l / D_m) / Float64(M_m * t_0))) / d_m) / d_m))); else tmp = Float64(w0 * Float64(1.0 + Float64(-0.125 * Float64(Float64(t_0 / Float64(d_m / Float64(M_m * 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)
t_0 = h * (M_m * D_m);
tmp = 0.0;
if (D_m <= 5e-13)
tmp = w0 * (1.0 + (((-0.125 / ((l / D_m) / (M_m * t_0))) / d_m) / d_m));
else
tmp = w0 * (1.0 + (-0.125 * ((t_0 / (d_m / (M_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_] := Block[{t$95$0 = N[(h * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[D$95$m, 5e-13], N[(w0 * N[(1.0 + N[(N[(N[(-0.125 / N[(N[(l / D$95$m), $MachinePrecision] / N[(M$95$m * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(w0 * N[(1.0 + N[(-0.125 * N[(N[(t$95$0 / N[(d$95$m / N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * 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}
t_0 := h \cdot \left(M\_m \cdot D\_m\right)\\
\mathbf{if}\;D\_m \leq 5 \cdot 10^{-13}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{\frac{\frac{-0.125}{\frac{\frac{\ell}{D\_m}}{M\_m \cdot t\_0}}}{d\_m}}{d\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(1 + -0.125 \cdot \frac{\frac{t\_0}{\frac{d\_m}{M\_m \cdot D\_m}}}{d\_m \cdot \ell}\right)\\
\end{array}
\end{array}
if D < 4.9999999999999999e-13Initial program 84.6%
Simplified87.3%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6461.1%
Simplified61.1%
associate-*l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr79.1%
if 4.9999999999999999e-13 < D Initial program 72.8%
Simplified74.8%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6458.4%
Simplified58.4%
frac-timesN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-/r*N/A
Applied egg-rr67.6%
Final simplification76.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 (<= D_m 1.05e-38)
w0
(*
w0
(+
1.0
(* -0.125 (/ (/ (* h (* M_m D_m)) (/ d_m (* M_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 (D_m <= 1.05e-38) {
tmp = w0;
} else {
tmp = w0 * (1.0 + (-0.125 * (((h * (M_m * D_m)) / (d_m / (M_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 (d_m <= 1.05d-38) then
tmp = w0
else
tmp = w0 * (1.0d0 + ((-0.125d0) * (((h * (m_m * d_m)) / (d_m_1 / (m_m * 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 (D_m <= 1.05e-38) {
tmp = w0;
} else {
tmp = w0 * (1.0 + (-0.125 * (((h * (M_m * D_m)) / (d_m / (M_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 D_m <= 1.05e-38: tmp = w0 else: tmp = w0 * (1.0 + (-0.125 * (((h * (M_m * D_m)) / (d_m / (M_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 (D_m <= 1.05e-38) tmp = w0; else tmp = Float64(w0 * Float64(1.0 + Float64(-0.125 * Float64(Float64(Float64(h * Float64(M_m * D_m)) / Float64(d_m / Float64(M_m * 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 (D_m <= 1.05e-38)
tmp = w0;
else
tmp = w0 * (1.0 + (-0.125 * (((h * (M_m * D_m)) / (d_m / (M_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[D$95$m, 1.05e-38], w0, N[(w0 * N[(1.0 + N[(-0.125 * N[(N[(N[(h * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / N[(d$95$m / N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d$95$m * 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 1.05 \cdot 10^{-38}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(1 + -0.125 \cdot \frac{\frac{h \cdot \left(M\_m \cdot D\_m\right)}{\frac{d\_m}{M\_m \cdot D\_m}}}{d\_m \cdot \ell}\right)\\
\end{array}
\end{array}
if D < 1.05000000000000006e-38Initial program 84.9%
Simplified87.7%
Taylor expanded in h around 0
Simplified77.4%
if 1.05000000000000006e-38 < D Initial program 73.5%
Simplified75.3%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6458.2%
Simplified58.2%
frac-timesN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-/r*N/A
Applied egg-rr69.0%
Final simplification75.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 4e-5) w0 (* w0 (/ (* (/ -0.125 d_m) (* M_m (* D_m (* M_m (* D_m h))))) (* 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 <= 4e-5) {
tmp = w0;
} else {
tmp = w0 * (((-0.125 / d_m) * (M_m * (D_m * (M_m * (D_m * h))))) / (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 <= 4d-5) then
tmp = w0
else
tmp = w0 * ((((-0.125d0) / d_m_1) * (m_m * (d_m * (m_m * (d_m * h))))) / (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 <= 4e-5) {
tmp = w0;
} else {
tmp = w0 * (((-0.125 / d_m) * (M_m * (D_m * (M_m * (D_m * h))))) / (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 <= 4e-5: tmp = w0 else: tmp = w0 * (((-0.125 / d_m) * (M_m * (D_m * (M_m * (D_m * h))))) / (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 <= 4e-5) tmp = w0; else tmp = Float64(w0 * Float64(Float64(Float64(-0.125 / d_m) * Float64(M_m * Float64(D_m * Float64(M_m * Float64(D_m * h))))) / 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 <= 4e-5)
tmp = w0;
else
tmp = w0 * (((-0.125 / d_m) * (M_m * (D_m * (M_m * (D_m * h))))) / (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, 4e-5], w0, N[(w0 * N[(N[(N[(-0.125 / d$95$m), $MachinePrecision] * N[(M$95$m * N[(D$95$m * N[(M$95$m * N[(D$95$m * h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 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 4 \cdot 10^{-5}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \frac{\frac{-0.125}{d\_m} \cdot \left(M\_m \cdot \left(D\_m \cdot \left(M\_m \cdot \left(D\_m \cdot h\right)\right)\right)\right)}{d\_m \cdot \ell}\\
\end{array}
\end{array}
if M < 4.00000000000000033e-5Initial program 82.8%
Simplified86.5%
Taylor expanded in h around 0
Simplified78.1%
if 4.00000000000000033e-5 < M Initial program 78.6%
Simplified77.2%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6447.8%
Simplified47.8%
Taylor expanded in d around 0
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
unpow2N/A
*-lowering-*.f6423.8%
Simplified23.8%
associate-*r/N/A
associate-*r*N/A
associate-*l*N/A
associate-*l/N/A
associate-*r/N/A
associate-/r*N/A
frac-timesN/A
/-lowering-/.f64N/A
Applied egg-rr27.2%
Final simplification66.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 3.8e-5) w0 (* w0 (/ -0.125 (* (/ l (* M_m (* D_m (* M_m (* D_m h))))) (* 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.8e-5) {
tmp = w0;
} else {
tmp = w0 * (-0.125 / ((l / (M_m * (D_m * (M_m * (D_m * h))))) * (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.8d-5) then
tmp = w0
else
tmp = w0 * ((-0.125d0) / ((l / (m_m * (d_m * (m_m * (d_m * h))))) * (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.8e-5) {
tmp = w0;
} else {
tmp = w0 * (-0.125 / ((l / (M_m * (D_m * (M_m * (D_m * h))))) * (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.8e-5: tmp = w0 else: tmp = w0 * (-0.125 / ((l / (M_m * (D_m * (M_m * (D_m * h))))) * (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.8e-5) tmp = w0; else tmp = Float64(w0 * Float64(-0.125 / Float64(Float64(l / Float64(M_m * Float64(D_m * Float64(M_m * Float64(D_m * h))))) * 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.8e-5)
tmp = w0;
else
tmp = w0 * (-0.125 / ((l / (M_m * (D_m * (M_m * (D_m * h))))) * (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.8e-5], w0, N[(w0 * N[(-0.125 / N[(N[(l / N[(M$95$m * N[(D$95$m * N[(M$95$m * N[(D$95$m * h), $MachinePrecision]), $MachinePrecision]), $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.8 \cdot 10^{-5}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \frac{-0.125}{\frac{\ell}{M\_m \cdot \left(D\_m \cdot \left(M\_m \cdot \left(D\_m \cdot h\right)\right)\right)} \cdot \left(d\_m \cdot d\_m\right)}\\
\end{array}
\end{array}
if M < 3.8000000000000002e-5Initial program 82.8%
Simplified86.5%
Taylor expanded in h around 0
Simplified78.1%
if 3.8000000000000002e-5 < M Initial program 78.6%
Simplified77.2%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6447.8%
Simplified47.8%
Taylor expanded in d around 0
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
unpow2N/A
*-lowering-*.f6423.8%
Simplified23.8%
associate-*r/N/A
associate-*r*N/A
associate-*l*N/A
associate-*l/N/A
*-commutativeN/A
associate-*l/N/A
clear-numN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
Applied egg-rr24.8%
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 4e-5) w0 (* M_m (* (/ (* M_m (* D_m h)) (/ l D_m)) (* w0 (/ -0.125 (* 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 <= 4e-5) {
tmp = w0;
} else {
tmp = M_m * (((M_m * (D_m * h)) / (l / D_m)) * (w0 * (-0.125 / (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 <= 4d-5) then
tmp = w0
else
tmp = m_m * (((m_m * (d_m * h)) / (l / d_m)) * (w0 * ((-0.125d0) / (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 <= 4e-5) {
tmp = w0;
} else {
tmp = M_m * (((M_m * (D_m * h)) / (l / D_m)) * (w0 * (-0.125 / (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 <= 4e-5: tmp = w0 else: tmp = M_m * (((M_m * (D_m * h)) / (l / D_m)) * (w0 * (-0.125 / (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 <= 4e-5) tmp = w0; else tmp = Float64(M_m * Float64(Float64(Float64(M_m * Float64(D_m * h)) / Float64(l / D_m)) * Float64(w0 * Float64(-0.125 / 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 <= 4e-5)
tmp = w0;
else
tmp = M_m * (((M_m * (D_m * h)) / (l / D_m)) * (w0 * (-0.125 / (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, 4e-5], w0, N[(M$95$m * N[(N[(N[(M$95$m * N[(D$95$m * h), $MachinePrecision]), $MachinePrecision] / N[(l / D$95$m), $MachinePrecision]), $MachinePrecision] * N[(w0 * N[(-0.125 / 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 4 \cdot 10^{-5}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;M\_m \cdot \left(\frac{M\_m \cdot \left(D\_m \cdot h\right)}{\frac{\ell}{D\_m}} \cdot \left(w0 \cdot \frac{-0.125}{d\_m \cdot d\_m}\right)\right)\\
\end{array}
\end{array}
if M < 4.00000000000000033e-5Initial program 82.8%
Simplified86.5%
Taylor expanded in h around 0
Simplified78.1%
if 4.00000000000000033e-5 < M Initial program 78.6%
Simplified77.2%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6447.8%
Simplified47.8%
Taylor expanded in d around 0
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
unpow2N/A
*-lowering-*.f6423.8%
Simplified23.8%
associate-*r/N/A
associate-*r/N/A
associate-*r*N/A
associate-*l*N/A
associate-*l/N/A
associate-*r/N/A
associate-*r/N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
Applied egg-rr24.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 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 81.8%
Simplified84.3%
Taylor expanded in h around 0
Simplified71.0%
herbie shell --seed 2024138
(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))))))