
(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 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (w0 M D h l d) :precision binary64 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))
double code(double w0, double M, double D, double h, double l, double d) {
return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
real(8) function code(w0, m, d, h, l, d_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_1
code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function
public static double code(double w0, double M, double D, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
def code(w0, M, D, h, l, d): return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))
function code(w0, M, D, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))))) end
function tmp = code(w0, M, D, h, l, d) tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l)))); end
code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}
\end{array}
M_m = (fabs.f64 M)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D h l d_m)
:precision binary64
(if (<= (* (pow (/ (* M_m D) (* 2.0 d_m)) 2.0) (/ h l)) (- INFINITY))
(pow
(*
(cbrt w0)
(pow
(exp 0.16666666666666666)
(fma -2.0 (log d_m) (log (* -0.25 (/ (* h (pow (* M_m D) 2.0)) l))))))
3.0)
(*
w0
(sqrt
(-
1.0
(* (/ (* M_m (/ 0.5 (/ d_m D))) l) (* h (* M_m (* D (/ 0.5 d_m))))))))))M_m = fabs(M);
d_m = fabs(d);
assert(w0 < M_m && M_m < D && D < h && h < l && l < d_m);
double code(double w0, double M_m, double D, double h, double l, double d_m) {
double tmp;
if ((pow(((M_m * D) / (2.0 * d_m)), 2.0) * (h / l)) <= -((double) INFINITY)) {
tmp = pow((cbrt(w0) * pow(exp(0.16666666666666666), fma(-2.0, log(d_m), log((-0.25 * ((h * pow((M_m * D), 2.0)) / l)))))), 3.0);
} else {
tmp = w0 * sqrt((1.0 - (((M_m * (0.5 / (d_m / D))) / l) * (h * (M_m * (D * (0.5 / d_m)))))));
}
return tmp;
}
M_m = abs(M) d_m = abs(d) w0, M_m, D, h, l, d_m = sort([w0, M_m, D, h, l, d_m]) function code(w0, M_m, D, h, l, d_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= Float64(-Inf)) tmp = Float64(cbrt(w0) * (exp(0.16666666666666666) ^ fma(-2.0, log(d_m), log(Float64(-0.25 * Float64(Float64(h * (Float64(M_m * D) ^ 2.0)) / l)))))) ^ 3.0; else tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(Float64(M_m * Float64(0.5 / Float64(d_m / D))) / l) * Float64(h * Float64(M_m * Float64(D * Float64(0.5 / d_m)))))))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[Power[N[(N[Power[w0, 1/3], $MachinePrecision] * N[Power[N[Exp[0.16666666666666666], $MachinePrecision], N[(-2.0 * N[Log[d$95$m], $MachinePrecision] + N[Log[N[(-0.25 * N[(N[(h * N[Power[N[(M$95$m * D), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 3.0], $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(N[(M$95$m * N[(0.5 / N[(d$95$m / D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(h * N[(M$95$m * N[(D * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D, h, l, d_m] = \mathsf{sort}([w0, M_m, D, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -\infty:\\
\;\;\;\;{\left(\sqrt[3]{w0} \cdot {\left(e^{0.16666666666666666}\right)}^{\left(\mathsf{fma}\left(-2, \log d\_m, \log \left(-0.25 \cdot \frac{h \cdot {\left(M\_m \cdot D\right)}^{2}}{\ell}\right)\right)\right)}\right)}^{3}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{M\_m \cdot \frac{0.5}{\frac{d\_m}{D}}}{\ell} \cdot \left(h \cdot \left(M\_m \cdot \left(D \cdot \frac{0.5}{d\_m}\right)\right)\right)}\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 2 d)) 2) (/.f64 h l)) < -inf.0Initial program 59.8%
Simplified59.8%
add-cube-cbrt59.8%
pow359.8%
Applied egg-rr59.8%
Taylor expanded in d around 0 20.3%
unpow1/332.2%
*-lft-identity32.2%
exp-prod32.0%
+-commutative32.0%
fma-define32.0%
distribute-lft-neg-in32.0%
metadata-eval32.0%
associate-*r*32.0%
unpow232.0%
unpow232.0%
swap-sqr42.0%
unpow242.0%
Simplified42.0%
if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 2 d)) 2) (/.f64 h l)) Initial program 94.4%
Simplified94.0%
associate-*r/96.2%
add-sqr-sqrt96.2%
pow296.2%
sqrt-pow196.2%
metadata-eval96.2%
pow196.2%
*-un-lft-identity96.2%
times-frac96.2%
metadata-eval96.2%
Applied egg-rr96.2%
associate-*r/94.0%
clear-num94.0%
div-inv94.5%
unpow294.5%
div-inv94.5%
times-frac98.1%
clear-num98.1%
un-div-inv98.1%
clear-num98.1%
un-div-inv98.1%
Applied egg-rr98.1%
div-inv98.1%
inv-pow98.1%
pow-flip98.1%
metadata-eval98.1%
pow198.1%
associate-/r/98.1%
*-commutative98.1%
Applied egg-rr98.1%
Final simplification85.2%
M_m = (fabs.f64 M)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D h l d_m)
:precision binary64
(let* ((t_0 (* D (/ 0.5 d_m))))
(if (<= (* M_m D) 5.5e-18)
w0
(* w0 (sqrt (- 1.0 (* (* M_m (/ t_0 l)) (* h (* M_m t_0)))))))))M_m = fabs(M);
d_m = fabs(d);
assert(w0 < M_m && M_m < D && D < h && h < l && l < d_m);
double code(double w0, double M_m, double D, double h, double l, double d_m) {
double t_0 = D * (0.5 / d_m);
double tmp;
if ((M_m * D) <= 5.5e-18) {
tmp = w0;
} else {
tmp = w0 * sqrt((1.0 - ((M_m * (t_0 / l)) * (h * (M_m * t_0)))));
}
return tmp;
}
M_m = abs(m)
d_m = abs(d)
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d, h, l, d_m)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = d * (0.5d0 / d_m)
if ((m_m * d) <= 5.5d-18) then
tmp = w0
else
tmp = w0 * sqrt((1.0d0 - ((m_m * (t_0 / l)) * (h * (m_m * t_0)))))
end if
code = tmp
end function
M_m = Math.abs(M);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D && D < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D, double h, double l, double d_m) {
double t_0 = D * (0.5 / d_m);
double tmp;
if ((M_m * D) <= 5.5e-18) {
tmp = w0;
} else {
tmp = w0 * Math.sqrt((1.0 - ((M_m * (t_0 / l)) * (h * (M_m * t_0)))));
}
return tmp;
}
M_m = math.fabs(M) d_m = math.fabs(d) [w0, M_m, D, h, l, d_m] = sort([w0, M_m, D, h, l, d_m]) def code(w0, M_m, D, h, l, d_m): t_0 = D * (0.5 / d_m) tmp = 0 if (M_m * D) <= 5.5e-18: tmp = w0 else: tmp = w0 * math.sqrt((1.0 - ((M_m * (t_0 / l)) * (h * (M_m * t_0))))) return tmp
M_m = abs(M) d_m = abs(d) w0, M_m, D, h, l, d_m = sort([w0, M_m, D, h, l, d_m]) function code(w0, M_m, D, h, l, d_m) t_0 = Float64(D * Float64(0.5 / d_m)) tmp = 0.0 if (Float64(M_m * D) <= 5.5e-18) tmp = w0; else tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(M_m * Float64(t_0 / l)) * Float64(h * Float64(M_m * t_0)))))); end return tmp end
M_m = abs(M);
d_m = abs(d);
w0, M_m, D, h, l, d_m = num2cell(sort([w0, M_m, D, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D, h, l, d_m)
t_0 = D * (0.5 / d_m);
tmp = 0.0;
if ((M_m * D) <= 5.5e-18)
tmp = w0;
else
tmp = w0 * sqrt((1.0 - ((M_m * (t_0 / l)) * (h * (M_m * t_0)))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
d_m = N[Abs[d], $MachinePrecision]
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(D * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(M$95$m * D), $MachinePrecision], 5.5e-18], w0, N[(w0 * N[Sqrt[N[(1.0 - N[(N[(M$95$m * N[(t$95$0 / l), $MachinePrecision]), $MachinePrecision] * N[(h * N[(M$95$m * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D, h, l, d_m] = \mathsf{sort}([w0, M_m, D, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := D \cdot \frac{0.5}{d\_m}\\
\mathbf{if}\;M\_m \cdot D \leq 5.5 \cdot 10^{-18}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 - \left(M\_m \cdot \frac{t\_0}{\ell}\right) \cdot \left(h \cdot \left(M\_m \cdot t\_0\right)\right)}\\
\end{array}
\end{array}
if (*.f64 M D) < 5.5e-18Initial program 88.2%
Simplified87.8%
Taylor expanded in M around 0 77.4%
if 5.5e-18 < (*.f64 M D) Initial program 78.9%
Simplified78.9%
associate-*r/75.1%
add-sqr-sqrt75.1%
pow275.1%
sqrt-pow175.1%
metadata-eval75.1%
pow175.1%
*-un-lft-identity75.1%
times-frac75.1%
metadata-eval75.1%
Applied egg-rr75.1%
associate-*r/78.9%
clear-num78.9%
div-inv78.9%
unpow278.9%
div-inv78.9%
times-frac79.0%
clear-num79.0%
un-div-inv79.0%
clear-num79.0%
un-div-inv79.0%
Applied egg-rr79.0%
associate-/l*79.0%
associate-/r/79.0%
associate-/r/79.0%
/-rgt-identity79.0%
associate-/r/79.0%
Simplified79.0%
Final simplification77.7%
M_m = (fabs.f64 M) d_m = (fabs.f64 d) NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D h l d_m) :precision binary64 (let* ((t_0 (* M_m (/ 0.5 (/ d_m D))))) (if (<= D 5.3e+82) w0 (* w0 (sqrt (- 1.0 (* t_0 (* (/ h l) t_0))))))))
M_m = fabs(M);
d_m = fabs(d);
assert(w0 < M_m && M_m < D && D < h && h < l && l < d_m);
double code(double w0, double M_m, double D, double h, double l, double d_m) {
double t_0 = M_m * (0.5 / (d_m / D));
double tmp;
if (D <= 5.3e+82) {
tmp = w0;
} else {
tmp = w0 * sqrt((1.0 - (t_0 * ((h / l) * t_0))));
}
return tmp;
}
M_m = abs(m)
d_m = abs(d)
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d, h, l, d_m)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = m_m * (0.5d0 / (d_m / d))
if (d <= 5.3d+82) then
tmp = w0
else
tmp = w0 * sqrt((1.0d0 - (t_0 * ((h / l) * t_0))))
end if
code = tmp
end function
M_m = Math.abs(M);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D && D < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D, double h, double l, double d_m) {
double t_0 = M_m * (0.5 / (d_m / D));
double tmp;
if (D <= 5.3e+82) {
tmp = w0;
} else {
tmp = w0 * Math.sqrt((1.0 - (t_0 * ((h / l) * t_0))));
}
return tmp;
}
M_m = math.fabs(M) d_m = math.fabs(d) [w0, M_m, D, h, l, d_m] = sort([w0, M_m, D, h, l, d_m]) def code(w0, M_m, D, h, l, d_m): t_0 = M_m * (0.5 / (d_m / D)) tmp = 0 if D <= 5.3e+82: tmp = w0 else: tmp = w0 * math.sqrt((1.0 - (t_0 * ((h / l) * t_0)))) return tmp
M_m = abs(M) d_m = abs(d) w0, M_m, D, h, l, d_m = sort([w0, M_m, D, h, l, d_m]) function code(w0, M_m, D, h, l, d_m) t_0 = Float64(M_m * Float64(0.5 / Float64(d_m / D))) tmp = 0.0 if (D <= 5.3e+82) tmp = w0; else tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(t_0 * Float64(Float64(h / l) * t_0))))); end return tmp end
M_m = abs(M);
d_m = abs(d);
w0, M_m, D, h, l, d_m = num2cell(sort([w0, M_m, D, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D, h, l, d_m)
t_0 = M_m * (0.5 / (d_m / D));
tmp = 0.0;
if (D <= 5.3e+82)
tmp = w0;
else
tmp = w0 * sqrt((1.0 - (t_0 * ((h / l) * t_0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
d_m = N[Abs[d], $MachinePrecision]
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(M$95$m * N[(0.5 / N[(d$95$m / D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[D, 5.3e+82], w0, N[(w0 * N[Sqrt[N[(1.0 - N[(t$95$0 * N[(N[(h / l), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D, h, l, d_m] = \mathsf{sort}([w0, M_m, D, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := M\_m \cdot \frac{0.5}{\frac{d\_m}{D}}\\
\mathbf{if}\;D \leq 5.3 \cdot 10^{+82}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 - t\_0 \cdot \left(\frac{h}{\ell} \cdot t\_0\right)}\\
\end{array}
\end{array}
if D < 5.29999999999999977e82Initial program 86.6%
Simplified86.3%
Taylor expanded in M around 0 74.0%
if 5.29999999999999977e82 < D Initial program 85.0%
Simplified84.9%
associate-*r/84.9%
add-sqr-sqrt84.9%
pow284.9%
sqrt-pow184.9%
metadata-eval84.9%
pow184.9%
*-un-lft-identity84.9%
times-frac84.9%
metadata-eval84.9%
Applied egg-rr84.9%
associate-*r/84.9%
*-commutative84.9%
unpow284.9%
associate-*r*90.1%
clear-num90.1%
un-div-inv90.1%
clear-num90.1%
un-div-inv90.1%
Applied egg-rr90.1%
Final simplification76.4%
M_m = (fabs.f64 M)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D h l d_m)
:precision binary64
(if (<= D 7.2e+114)
w0
(+
w0
(* -0.125 (/ (* (* h w0) (* (* M_m D) (* M_m D))) (* l (pow d_m 2.0)))))))M_m = fabs(M);
d_m = fabs(d);
assert(w0 < M_m && M_m < D && D < h && h < l && l < d_m);
double code(double w0, double M_m, double D, double h, double l, double d_m) {
double tmp;
if (D <= 7.2e+114) {
tmp = w0;
} else {
tmp = w0 + (-0.125 * (((h * w0) * ((M_m * D) * (M_m * D))) / (l * pow(d_m, 2.0))));
}
return tmp;
}
M_m = abs(m)
d_m = abs(d)
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d, h, l, d_m)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= 7.2d+114) then
tmp = w0
else
tmp = w0 + ((-0.125d0) * (((h * w0) * ((m_m * d) * (m_m * d))) / (l * (d_m ** 2.0d0))))
end if
code = tmp
end function
M_m = Math.abs(M);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D && D < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D, double h, double l, double d_m) {
double tmp;
if (D <= 7.2e+114) {
tmp = w0;
} else {
tmp = w0 + (-0.125 * (((h * w0) * ((M_m * D) * (M_m * D))) / (l * Math.pow(d_m, 2.0))));
}
return tmp;
}
M_m = math.fabs(M) d_m = math.fabs(d) [w0, M_m, D, h, l, d_m] = sort([w0, M_m, D, h, l, d_m]) def code(w0, M_m, D, h, l, d_m): tmp = 0 if D <= 7.2e+114: tmp = w0 else: tmp = w0 + (-0.125 * (((h * w0) * ((M_m * D) * (M_m * D))) / (l * math.pow(d_m, 2.0)))) return tmp
M_m = abs(M) d_m = abs(d) w0, M_m, D, h, l, d_m = sort([w0, M_m, D, h, l, d_m]) function code(w0, M_m, D, h, l, d_m) tmp = 0.0 if (D <= 7.2e+114) tmp = w0; else tmp = Float64(w0 + Float64(-0.125 * Float64(Float64(Float64(h * w0) * Float64(Float64(M_m * D) * Float64(M_m * D))) / Float64(l * (d_m ^ 2.0))))); end return tmp end
M_m = abs(M);
d_m = abs(d);
w0, M_m, D, h, l, d_m = num2cell(sort([w0, M_m, D, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D, h, l, d_m)
tmp = 0.0;
if (D <= 7.2e+114)
tmp = w0;
else
tmp = w0 + (-0.125 * (((h * w0) * ((M_m * D) * (M_m * D))) / (l * (d_m ^ 2.0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D_, h_, l_, d$95$m_] := If[LessEqual[D, 7.2e+114], w0, N[(w0 + N[(-0.125 * N[(N[(N[(h * w0), $MachinePrecision] * N[(N[(M$95$m * D), $MachinePrecision] * N[(M$95$m * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(l * N[Power[d$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D, h, l, d_m] = \mathsf{sort}([w0, M_m, D, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;D \leq 7.2 \cdot 10^{+114}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 + -0.125 \cdot \frac{\left(h \cdot w0\right) \cdot \left(\left(M\_m \cdot D\right) \cdot \left(M\_m \cdot D\right)\right)}{\ell \cdot {d\_m}^{2}}\\
\end{array}
\end{array}
if D < 7.2000000000000001e114Initial program 86.7%
Simplified86.4%
Taylor expanded in M around 0 73.8%
if 7.2000000000000001e114 < D Initial program 83.7%
Simplified83.7%
Taylor expanded in M around 0 35.1%
pow135.1%
associate-*r*35.1%
pow-prod-down73.4%
Applied egg-rr73.4%
unpow173.4%
*-commutative73.4%
Simplified73.4%
unpow273.4%
*-commutative73.4%
*-commutative73.4%
Applied egg-rr73.4%
Final simplification73.8%
M_m = (fabs.f64 M)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D h l d_m)
:precision binary64
(*
w0
(sqrt
(-
1.0
(* (/ (* M_m (/ 0.5 (/ d_m D))) l) (* h (* M_m (* D (/ 0.5 d_m)))))))))M_m = fabs(M);
d_m = fabs(d);
assert(w0 < M_m && M_m < D && D < h && h < l && l < d_m);
double code(double w0, double M_m, double D, double h, double l, double d_m) {
return w0 * sqrt((1.0 - (((M_m * (0.5 / (d_m / D))) / l) * (h * (M_m * (D * (0.5 / d_m)))))));
}
M_m = abs(m)
d_m = abs(d)
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d, h, l, d_m)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m
code = w0 * sqrt((1.0d0 - (((m_m * (0.5d0 / (d_m / d))) / l) * (h * (m_m * (d * (0.5d0 / d_m)))))))
end function
M_m = Math.abs(M);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D && D < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D, double h, double l, double d_m) {
return w0 * Math.sqrt((1.0 - (((M_m * (0.5 / (d_m / D))) / l) * (h * (M_m * (D * (0.5 / d_m)))))));
}
M_m = math.fabs(M) d_m = math.fabs(d) [w0, M_m, D, h, l, d_m] = sort([w0, M_m, D, h, l, d_m]) def code(w0, M_m, D, h, l, d_m): return w0 * math.sqrt((1.0 - (((M_m * (0.5 / (d_m / D))) / l) * (h * (M_m * (D * (0.5 / d_m)))))))
M_m = abs(M) d_m = abs(d) w0, M_m, D, h, l, d_m = sort([w0, M_m, D, h, l, d_m]) function code(w0, M_m, D, h, l, d_m) return Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(Float64(M_m * Float64(0.5 / Float64(d_m / D))) / l) * Float64(h * Float64(M_m * Float64(D * Float64(0.5 / d_m)))))))) end
M_m = abs(M);
d_m = abs(d);
w0, M_m, D, h, l, d_m = num2cell(sort([w0, M_m, D, h, l, d_m])){:}
function tmp = code(w0, M_m, D, h, l, d_m)
tmp = w0 * sqrt((1.0 - (((M_m * (0.5 / (d_m / D))) / l) * (h * (M_m * (D * (0.5 / d_m)))))));
end
M_m = N[Abs[M], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D_, h_, l_, d$95$m_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[(N[(M$95$m * N[(0.5 / N[(d$95$m / D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(h * N[(M$95$m * N[(D * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D, h, l, d_m] = \mathsf{sort}([w0, M_m, D, h, l, d_m])\\
\\
w0 \cdot \sqrt{1 - \frac{M\_m \cdot \frac{0.5}{\frac{d\_m}{D}}}{\ell} \cdot \left(h \cdot \left(M\_m \cdot \left(D \cdot \frac{0.5}{d\_m}\right)\right)\right)}
\end{array}
Initial program 86.4%
Simplified86.1%
associate-*r/88.1%
add-sqr-sqrt88.1%
pow288.1%
sqrt-pow188.1%
metadata-eval88.1%
pow188.1%
*-un-lft-identity88.1%
times-frac88.1%
metadata-eval88.1%
Applied egg-rr88.1%
associate-*r/86.1%
clear-num86.1%
div-inv86.5%
unpow286.5%
div-inv86.5%
times-frac91.1%
clear-num91.1%
un-div-inv91.1%
clear-num91.1%
un-div-inv91.1%
Applied egg-rr91.1%
div-inv91.1%
inv-pow91.1%
pow-flip91.1%
metadata-eval91.1%
pow191.1%
associate-/r/91.1%
*-commutative91.1%
Applied egg-rr91.1%
Final simplification91.1%
M_m = (fabs.f64 M) d_m = (fabs.f64 d) NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D h l d_m) :precision binary64 w0)
M_m = fabs(M);
d_m = fabs(d);
assert(w0 < M_m && M_m < D && D < h && h < l && l < d_m);
double code(double w0, double M_m, double D, double h, double l, double d_m) {
return w0;
}
M_m = abs(m)
d_m = abs(d)
NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d, h, l, d_m)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m
code = w0
end function
M_m = Math.abs(M);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D && D < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D, double h, double l, double d_m) {
return w0;
}
M_m = math.fabs(M) d_m = math.fabs(d) [w0, M_m, D, h, l, d_m] = sort([w0, M_m, D, h, l, d_m]) def code(w0, M_m, D, h, l, d_m): return w0
M_m = abs(M) d_m = abs(d) w0, M_m, D, h, l, d_m = sort([w0, M_m, D, h, l, d_m]) function code(w0, M_m, D, h, l, d_m) return w0 end
M_m = abs(M);
d_m = abs(d);
w0, M_m, D, h, l, d_m = num2cell(sort([w0, M_m, D, h, l, d_m])){:}
function tmp = code(w0, M_m, D, h, l, d_m)
tmp = w0;
end
M_m = N[Abs[M], $MachinePrecision] d_m = N[Abs[d], $MachinePrecision] NOTE: w0, M_m, D, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D_, h_, l_, d$95$m_] := w0
\begin{array}{l}
M_m = \left|M\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D, h, l, d_m] = \mathsf{sort}([w0, M_m, D, h, l, d_m])\\
\\
w0
\end{array}
Initial program 86.4%
Simplified86.1%
Taylor expanded in M around 0 70.1%
Final simplification70.1%
herbie shell --seed 2024050
(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))))))