
(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 8 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)) -5e+44)
(* w0 (* D_m (* (sqrt (* (/ h l) -0.25)) (/ (fabs M_m) d_m))))
(*
w0
(sqrt
(-
1.0
(*
h
(* (* (/ D_m d_m) (/ M_m 2.0)) (* (/ D_m d_m) (* M_m (/ 0.5 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)) <= -5e+44) {
tmp = w0 * (D_m * (sqrt(((h / l) * -0.25)) * (fabs(M_m) / d_m)));
} else {
tmp = w0 * sqrt((1.0 - (h * (((D_m / d_m) * (M_m / 2.0)) * ((D_m / d_m) * (M_m * (0.5 / 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 * d_m) / (2.0d0 * d_m_1)) ** 2.0d0) * (h / l)) <= (-5d+44)) then
tmp = w0 * (d_m * (sqrt(((h / l) * (-0.25d0))) * (abs(m_m) / d_m_1)))
else
tmp = w0 * sqrt((1.0d0 - (h * (((d_m / d_m_1) * (m_m / 2.0d0)) * ((d_m / d_m_1) * (m_m * (0.5d0 / 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 ((Math.pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -5e+44) {
tmp = w0 * (D_m * (Math.sqrt(((h / l) * -0.25)) * (Math.abs(M_m) / d_m)));
} else {
tmp = w0 * Math.sqrt((1.0 - (h * (((D_m / d_m) * (M_m / 2.0)) * ((D_m / d_m) * (M_m * (0.5 / 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)) <= -5e+44: tmp = w0 * (D_m * (math.sqrt(((h / l) * -0.25)) * (math.fabs(M_m) / d_m))) else: tmp = w0 * math.sqrt((1.0 - (h * (((D_m / d_m) * (M_m / 2.0)) * ((D_m / d_m) * (M_m * (0.5 / 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)) <= -5e+44) tmp = Float64(w0 * Float64(D_m * Float64(sqrt(Float64(Float64(h / l) * -0.25)) * Float64(abs(M_m) / d_m)))); else tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(h * Float64(Float64(Float64(D_m / d_m) * Float64(M_m / 2.0)) * Float64(Float64(D_m / d_m) * Float64(M_m * Float64(0.5 / 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)) <= -5e+44)
tmp = w0 * (D_m * (sqrt(((h / l) * -0.25)) * (abs(M_m) / d_m)));
else
tmp = w0 * sqrt((1.0 - (h * (((D_m / d_m) * (M_m / 2.0)) * ((D_m / d_m) * (M_m * (0.5 / 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], -5e+44], N[(w0 * N[(D$95$m * N[(N[Sqrt[N[(N[(h / l), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision] * N[(N[Abs[M$95$m], $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 - N[(h * N[(N[(N[(D$95$m / d$95$m), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m / d$95$m), $MachinePrecision] * N[(M$95$m * N[(0.5 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+44}:\\
\;\;\;\;w0 \cdot \left(D\_m \cdot \left(\sqrt{\frac{h}{\ell} \cdot -0.25} \cdot \frac{\left|M\_m\right|}{d\_m}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 - h \cdot \left(\left(\frac{D\_m}{d\_m} \cdot \frac{M\_m}{2}\right) \cdot \left(\frac{D\_m}{d\_m} \cdot \left(M\_m \cdot \frac{0.5}{\ell}\right)\right)\right)}\\
\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)) < -4.9999999999999996e44Initial program 56.6%
Simplified56.5%
Taylor expanded in D around inf 36.3%
*-commutative36.3%
times-frac33.8%
Simplified33.8%
pow1/233.8%
associate-*l*33.8%
unpow-prod-down36.2%
pow1/236.2%
sqrt-div38.6%
sqrt-pow121.9%
metadata-eval21.9%
pow121.9%
sqrt-pow134.0%
metadata-eval34.0%
pow134.0%
associate-/l*34.0%
Applied egg-rr34.0%
unpow1/234.0%
associate-*l*34.0%
Simplified34.0%
sqrt-prod37.6%
Applied egg-rr37.6%
unpow237.6%
rem-sqrt-square48.7%
associate-*l/48.7%
Simplified48.7%
pow148.7%
associate-*r*51.0%
associate-/l*51.0%
Applied egg-rr51.0%
unpow151.0%
associate-*l*48.7%
associate-*l/45.1%
associate-/l*47.6%
*-commutative47.6%
associate-/l*47.5%
associate-*r/47.5%
*-commutative47.5%
associate-/l*47.5%
Simplified47.5%
if -4.9999999999999996e44 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 85.1%
Simplified86.3%
Applied egg-rr86.3%
unpow186.3%
associate-*l/94.8%
associate-/l*94.8%
associate-*r/93.7%
*-rgt-identity93.7%
times-frac94.8%
/-rgt-identity94.8%
Simplified94.8%
unpow294.8%
*-un-lft-identity94.8%
times-frac97.3%
associate-*l/96.1%
*-commutative96.1%
times-frac97.3%
associate-*l/96.1%
*-commutative96.1%
times-frac97.3%
Applied egg-rr97.3%
Taylor expanded in D around 0 91.2%
*-commutative91.2%
associate-/r*96.1%
associate-*l/97.3%
associate-*l/97.3%
associate-*r*97.3%
associate-*r/93.8%
associate-/l*93.8%
Simplified93.8%
Final simplification79.2%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= d_m 1.5e-128)
(* w0 (+ 1.0 (* h (* (pow (* D_m (/ M_m d_m)) 2.0) (/ -0.125 l)))))
(*
w0
(sqrt
(-
1.0
(*
h
(* (* 0.5 (/ (* M_m D_m) d_m)) (* 0.5 (/ (* 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.5e-128) {
tmp = w0 * (1.0 + (h * (pow((D_m * (M_m / d_m)), 2.0) * (-0.125 / l))));
} else {
tmp = w0 * sqrt((1.0 - (h * ((0.5 * ((M_m * D_m) / d_m)) * (0.5 * ((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 <= 1.5d-128) then
tmp = w0 * (1.0d0 + (h * (((d_m * (m_m / d_m_1)) ** 2.0d0) * ((-0.125d0) / l))))
else
tmp = w0 * sqrt((1.0d0 - (h * ((0.5d0 * ((m_m * d_m) / d_m_1)) * (0.5d0 * ((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.5e-128) {
tmp = w0 * (1.0 + (h * (Math.pow((D_m * (M_m / d_m)), 2.0) * (-0.125 / l))));
} else {
tmp = w0 * Math.sqrt((1.0 - (h * ((0.5 * ((M_m * D_m) / d_m)) * (0.5 * ((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.5e-128: tmp = w0 * (1.0 + (h * (math.pow((D_m * (M_m / d_m)), 2.0) * (-0.125 / l)))) else: tmp = w0 * math.sqrt((1.0 - (h * ((0.5 * ((M_m * D_m) / d_m)) * (0.5 * ((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.5e-128) tmp = Float64(w0 * Float64(1.0 + Float64(h * Float64((Float64(D_m * Float64(M_m / d_m)) ^ 2.0) * Float64(-0.125 / l))))); else tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(h * Float64(Float64(0.5 * Float64(Float64(M_m * D_m) / d_m)) * Float64(0.5 * Float64(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.5e-128)
tmp = w0 * (1.0 + (h * (((D_m * (M_m / d_m)) ^ 2.0) * (-0.125 / l))));
else
tmp = w0 * sqrt((1.0 - (h * ((0.5 * ((M_m * D_m) / d_m)) * (0.5 * ((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.5e-128], N[(w0 * N[(1.0 + N[(h * N[(N[Power[N[(D$95$m * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.125 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 - N[(h * N[(N[(0.5 * N[(N[(M$95$m * D$95$m), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision] * N[(0.5 * N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(d$95$m * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d\_m \leq 1.5 \cdot 10^{-128}:\\
\;\;\;\;w0 \cdot \left(1 + h \cdot \left({\left(D\_m \cdot \frac{M\_m}{d\_m}\right)}^{2} \cdot \frac{-0.125}{\ell}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 - h \cdot \left(\left(0.5 \cdot \frac{M\_m \cdot D\_m}{d\_m}\right) \cdot \left(0.5 \cdot \frac{M\_m \cdot D\_m}{d\_m \cdot \ell}\right)\right)}\\
\end{array}
\end{array}
if d < 1.49999999999999989e-128Initial program 71.8%
Simplified73.0%
Applied egg-rr73.0%
unpow173.0%
associate-*l/77.6%
associate-/l*78.8%
associate-*r/78.2%
*-rgt-identity78.2%
times-frac78.8%
/-rgt-identity78.8%
Simplified78.8%
Taylor expanded in h around 0 44.3%
associate-*r/44.3%
associate-*r*45.6%
unpow245.6%
unpow245.6%
swap-sqr56.9%
unpow256.9%
associate-*r*56.9%
Simplified56.9%
Taylor expanded in D around 0 44.3%
associate-*r*45.6%
unpow245.6%
unpow245.6%
swap-sqr56.9%
unpow256.9%
associate-*r/58.8%
*-commutative58.8%
associate-*l*58.8%
associate-*r/56.9%
*-commutative56.9%
*-commutative56.9%
associate-*r/59.4%
*-commutative59.4%
times-frac60.6%
Simplified72.3%
if 1.49999999999999989e-128 < d Initial program 84.3%
Simplified84.3%
Applied egg-rr84.3%
unpow184.3%
associate-*l/91.3%
associate-/l*90.2%
associate-*r/90.2%
*-rgt-identity90.2%
times-frac90.2%
/-rgt-identity90.2%
Simplified90.2%
unpow290.2%
*-un-lft-identity90.2%
times-frac93.4%
associate-*l/93.4%
*-commutative93.4%
times-frac93.4%
associate-*l/93.4%
*-commutative93.4%
times-frac93.4%
Applied egg-rr93.4%
Taylor expanded in D around 0 93.4%
Taylor expanded in D around 0 92.4%
Final simplification79.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 (* (/ D_m d_m) (/ M_m 2.0)))) (* w0 (sqrt (- 1.0 (* h (* t_0 (/ t_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 t_0 = (D_m / d_m) * (M_m / 2.0);
return w0 * sqrt((1.0 - (h * (t_0 * (t_0 / l)))));
}
M_m = abs(m)
D_m = abs(d)
d_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: t_0
t_0 = (d_m / d_m_1) * (m_m / 2.0d0)
code = w0 * sqrt((1.0d0 - (h * (t_0 * (t_0 / l)))))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
d_m = Math.abs(d);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = (D_m / d_m) * (M_m / 2.0);
return w0 * Math.sqrt((1.0 - (h * (t_0 * (t_0 / l)))));
}
M_m = math.fabs(M) D_m = math.fabs(D) d_m = math.fabs(d) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): t_0 = (D_m / d_m) * (M_m / 2.0) return w0 * math.sqrt((1.0 - (h * (t_0 * (t_0 / l)))))
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(Float64(D_m / d_m) * Float64(M_m / 2.0)) return Float64(w0 * sqrt(Float64(1.0 - Float64(h * Float64(t_0 * Float64(t_0 / l)))))) end
M_m = abs(M);
D_m = abs(D);
d_m = abs(d);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp = code(w0, M_m, D_m, h, l, d_m)
t_0 = (D_m / d_m) * (M_m / 2.0);
tmp = w0 * sqrt((1.0 - (h * (t_0 * (t_0 / l)))));
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
d_m = N[Abs[d], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(N[(D$95$m / d$95$m), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision]}, N[(w0 * N[Sqrt[N[(1.0 - N[(h * N[(t$95$0 * N[(t$95$0 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := \frac{D\_m}{d\_m} \cdot \frac{M\_m}{2}\\
w0 \cdot \sqrt{1 - h \cdot \left(t\_0 \cdot \frac{t\_0}{\ell}\right)}
\end{array}
\end{array}
Initial program 76.1%
Simplified76.8%
Applied egg-rr76.8%
unpow176.8%
associate-*l/82.3%
associate-/l*82.7%
associate-*r/82.3%
*-rgt-identity82.3%
times-frac82.7%
/-rgt-identity82.7%
Simplified82.7%
unpow282.7%
*-un-lft-identity82.7%
times-frac85.1%
associate-*l/84.4%
*-commutative84.4%
times-frac85.1%
associate-*l/84.4%
*-commutative84.4%
times-frac85.1%
Applied egg-rr85.1%
Final simplification85.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
(*
w0
(sqrt
(-
1.0
(* h (* (/ (* (/ D_m d_m) (/ M_m 2.0)) l) (* 0.5 (/ (* 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) {
return w0 * sqrt((1.0 - (h * ((((D_m / d_m) * (M_m / 2.0)) / l) * (0.5 * ((M_m * D_m) / d_m))))));
}
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 * sqrt((1.0d0 - (h * ((((d_m / d_m_1) * (m_m / 2.0d0)) / l) * (0.5d0 * ((m_m * d_m) / d_m_1))))))
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 * Math.sqrt((1.0 - (h * ((((D_m / d_m) * (M_m / 2.0)) / l) * (0.5 * ((M_m * D_m) / d_m))))));
}
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 * math.sqrt((1.0 - (h * ((((D_m / d_m) * (M_m / 2.0)) / l) * (0.5 * ((M_m * D_m) / d_m))))))
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 Float64(w0 * sqrt(Float64(1.0 - Float64(h * Float64(Float64(Float64(Float64(D_m / d_m) * Float64(M_m / 2.0)) / l) * Float64(0.5 * Float64(Float64(M_m * D_m) / d_m))))))) 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 * sqrt((1.0 - (h * ((((D_m / d_m) * (M_m / 2.0)) / l) * (0.5 * ((M_m * D_m) / d_m))))));
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_] := N[(w0 * N[Sqrt[N[(1.0 - N[(h * N[(N[(N[(N[(D$95$m / d$95$m), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(0.5 * N[(N[(M$95$m * D$95$m), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
w0 \cdot \sqrt{1 - h \cdot \left(\frac{\frac{D\_m}{d\_m} \cdot \frac{M\_m}{2}}{\ell} \cdot \left(0.5 \cdot \frac{M\_m \cdot D\_m}{d\_m}\right)\right)}
\end{array}
Initial program 76.1%
Simplified76.8%
Applied egg-rr76.8%
unpow176.8%
associate-*l/82.3%
associate-/l*82.7%
associate-*r/82.3%
*-rgt-identity82.3%
times-frac82.7%
/-rgt-identity82.7%
Simplified82.7%
unpow282.7%
*-un-lft-identity82.7%
times-frac85.1%
associate-*l/84.4%
*-commutative84.4%
times-frac85.1%
associate-*l/84.4%
*-commutative84.4%
times-frac85.1%
Applied egg-rr85.1%
Taylor expanded in D around 0 84.4%
Final simplification84.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
(*
w0
(sqrt
(-
1.0
(* h (* (* (/ D_m d_m) (* M_m (/ 0.5 l))) (* 0.5 (/ (* 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) {
return w0 * sqrt((1.0 - (h * (((D_m / d_m) * (M_m * (0.5 / l))) * (0.5 * ((M_m * D_m) / d_m))))));
}
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 * sqrt((1.0d0 - (h * (((d_m / d_m_1) * (m_m * (0.5d0 / l))) * (0.5d0 * ((m_m * d_m) / d_m_1))))))
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 * Math.sqrt((1.0 - (h * (((D_m / d_m) * (M_m * (0.5 / l))) * (0.5 * ((M_m * D_m) / d_m))))));
}
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 * math.sqrt((1.0 - (h * (((D_m / d_m) * (M_m * (0.5 / l))) * (0.5 * ((M_m * D_m) / d_m))))))
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 Float64(w0 * sqrt(Float64(1.0 - Float64(h * Float64(Float64(Float64(D_m / d_m) * Float64(M_m * Float64(0.5 / l))) * Float64(0.5 * Float64(Float64(M_m * D_m) / d_m))))))) 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 * sqrt((1.0 - (h * (((D_m / d_m) * (M_m * (0.5 / l))) * (0.5 * ((M_m * D_m) / d_m))))));
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_] := N[(w0 * N[Sqrt[N[(1.0 - N[(h * N[(N[(N[(D$95$m / d$95$m), $MachinePrecision] * N[(M$95$m * N[(0.5 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 * N[(N[(M$95$m * D$95$m), $MachinePrecision] / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
w0 \cdot \sqrt{1 - h \cdot \left(\left(\frac{D\_m}{d\_m} \cdot \left(M\_m \cdot \frac{0.5}{\ell}\right)\right) \cdot \left(0.5 \cdot \frac{M\_m \cdot D\_m}{d\_m}\right)\right)}
\end{array}
Initial program 76.1%
Simplified76.8%
Applied egg-rr76.8%
unpow176.8%
associate-*l/82.3%
associate-/l*82.7%
associate-*r/82.3%
*-rgt-identity82.3%
times-frac82.7%
/-rgt-identity82.7%
Simplified82.7%
unpow282.7%
*-un-lft-identity82.7%
times-frac85.1%
associate-*l/84.4%
*-commutative84.4%
times-frac85.1%
associate-*l/84.4%
*-commutative84.4%
times-frac85.1%
Applied egg-rr85.1%
Taylor expanded in D around 0 84.4%
Taylor expanded in D around 0 81.0%
*-commutative80.3%
associate-/r*84.4%
associate-*l/85.1%
associate-*l/85.1%
associate-*r*85.1%
associate-*r/81.6%
associate-/l*81.6%
Simplified80.8%
Final simplification80.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 6e+50) w0 (* -0.125 (* (pow (* D_m (/ M_m d_m)) 2.0) (* h (/ 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 <= 6e+50) {
tmp = w0;
} else {
tmp = -0.125 * (pow((D_m * (M_m / d_m)), 2.0) * (h * (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 <= 6d+50) then
tmp = w0
else
tmp = (-0.125d0) * (((d_m * (m_m / d_m_1)) ** 2.0d0) * (h * (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 <= 6e+50) {
tmp = w0;
} else {
tmp = -0.125 * (Math.pow((D_m * (M_m / d_m)), 2.0) * (h * (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 <= 6e+50: tmp = w0 else: tmp = -0.125 * (math.pow((D_m * (M_m / d_m)), 2.0) * (h * (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 <= 6e+50) tmp = w0; else tmp = Float64(-0.125 * Float64((Float64(D_m * Float64(M_m / d_m)) ^ 2.0) * Float64(h * 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 <= 6e+50)
tmp = w0;
else
tmp = -0.125 * (((D_m * (M_m / d_m)) ^ 2.0) * (h * (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, 6e+50], w0, N[(-0.125 * N[(N[Power[N[(D$95$m * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h * N[(w0 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 6 \cdot 10^{+50}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;-0.125 \cdot \left({\left(D\_m \cdot \frac{M\_m}{d\_m}\right)}^{2} \cdot \left(h \cdot \frac{w0}{\ell}\right)\right)\\
\end{array}
\end{array}
if M < 5.9999999999999996e50Initial program 79.0%
Simplified79.9%
Taylor expanded in D around 0 72.9%
if 5.9999999999999996e50 < M Initial program 61.2%
Simplified61.2%
Applied egg-rr61.2%
unpow161.2%
associate-*l/61.6%
associate-/l*66.1%
associate-*r/66.2%
*-rgt-identity66.2%
times-frac66.2%
/-rgt-identity66.2%
Simplified66.2%
Taylor expanded in h around 0 37.4%
associate-*r/37.4%
associate-*r*39.6%
unpow239.6%
unpow239.6%
swap-sqr54.3%
unpow254.3%
associate-*r*54.3%
Simplified54.3%
Taylor expanded in D around inf 27.9%
associate-*r*27.9%
unpow227.9%
unpow227.9%
swap-sqr33.7%
unpow233.7%
times-frac33.8%
unpow233.8%
unpow233.8%
times-frac34.1%
associate-*r/34.1%
associate-*r/34.1%
unpow134.1%
pow-plus34.1%
metadata-eval34.1%
associate-/l*34.3%
Simplified34.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 (+ 1.0 (* h (* (pow (* D_m (/ M_m d_m)) 2.0) (/ -0.125 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) {
return w0 * (1.0 + (h * (pow((D_m * (M_m / d_m)), 2.0) * (-0.125 / l))));
}
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 * (1.0d0 + (h * (((d_m * (m_m / d_m_1)) ** 2.0d0) * ((-0.125d0) / l))))
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 * (1.0 + (h * (Math.pow((D_m * (M_m / d_m)), 2.0) * (-0.125 / l))));
}
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 * (1.0 + (h * (math.pow((D_m * (M_m / d_m)), 2.0) * (-0.125 / l))))
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 Float64(w0 * Float64(1.0 + Float64(h * Float64((Float64(D_m * Float64(M_m / d_m)) ^ 2.0) * Float64(-0.125 / l))))) 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 * (1.0 + (h * (((D_m * (M_m / d_m)) ^ 2.0) * (-0.125 / l))));
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_] := N[(w0 * N[(1.0 + N[(h * N[(N[Power[N[(D$95$m * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.125 / 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])\\
\\
w0 \cdot \left(1 + h \cdot \left({\left(D\_m \cdot \frac{M\_m}{d\_m}\right)}^{2} \cdot \frac{-0.125}{\ell}\right)\right)
\end{array}
Initial program 76.1%
Simplified76.8%
Applied egg-rr76.8%
unpow176.8%
associate-*l/82.3%
associate-/l*82.7%
associate-*r/82.3%
*-rgt-identity82.3%
times-frac82.7%
/-rgt-identity82.7%
Simplified82.7%
Taylor expanded in h around 0 49.9%
associate-*r/49.9%
associate-*r*51.9%
unpow251.9%
unpow251.9%
swap-sqr64.8%
unpow264.8%
associate-*r*64.8%
Simplified64.8%
Taylor expanded in D around 0 49.9%
associate-*r*51.9%
unpow251.9%
unpow251.9%
swap-sqr64.8%
unpow264.8%
associate-*r/66.4%
*-commutative66.4%
associate-*l*66.4%
associate-*r/64.8%
*-commutative64.8%
*-commutative64.8%
associate-*r/67.2%
*-commutative67.2%
times-frac68.8%
Simplified77.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 76.1%
Simplified76.8%
Taylor expanded in D around 0 65.4%
herbie shell --seed 2024144
(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))))))