
(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 5 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (w0 M D h l d) :precision binary64 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))
double code(double w0, double M, double D, double h, double l, double d) {
return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
real(8) function code(w0, m, d, h, l, d_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_1
code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function
public static double code(double w0, double M, double D, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
def code(w0, M, D, h, l, d): return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))
function code(w0, M, D, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))))) end
function tmp = code(w0, M, D, h, l, d) tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l)))); end
code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}
\end{array}
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(let* ((t_0 (* D_m (/ M_m d_m)))
(t_1 (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l))))
(if (<= t_1 (- INFINITY))
(pow
(*
(cbrt w0)
(exp
(*
0.16666666666666666
(+
(* -2.0 (log (/ 1.0 D_m)))
(+ (log (* -0.25 (* (/ h l) (pow M_m 2.0)))) (* -2.0 (log d_m)))))))
3.0)
(if (<= t_1 0.01)
(* w0 (sqrt (fma (/ (* t_0 t_0) 4.0) (/ h (- l)) 1.0)))
(*
w0
(sqrt
(+
1.0
(+
1.0
(-
-1.0
(*
D_m
(*
0.25
(/ (* D_m (* h (pow M_m 2.0))) (* l (pow d_m 2.0))))))))))))))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 * (M_m / d_m);
double t_1 = pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l);
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = pow((cbrt(w0) * exp((0.16666666666666666 * ((-2.0 * log((1.0 / D_m))) + (log((-0.25 * ((h / l) * pow(M_m, 2.0)))) + (-2.0 * log(d_m))))))), 3.0);
} else if (t_1 <= 0.01) {
tmp = w0 * sqrt(fma(((t_0 * t_0) / 4.0), (h / -l), 1.0));
} else {
tmp = w0 * sqrt((1.0 + (1.0 + (-1.0 - (D_m * (0.25 * ((D_m * (h * pow(M_m, 2.0))) / (l * pow(d_m, 2.0)))))))));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d_m = abs(d) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(D_m * Float64(M_m / d_m)) t_1 = Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(cbrt(w0) * exp(Float64(0.16666666666666666 * Float64(Float64(-2.0 * log(Float64(1.0 / D_m))) + Float64(log(Float64(-0.25 * Float64(Float64(h / l) * (M_m ^ 2.0)))) + Float64(-2.0 * log(d_m))))))) ^ 3.0; elseif (t_1 <= 0.01) tmp = Float64(w0 * sqrt(fma(Float64(Float64(t_0 * t_0) / 4.0), Float64(h / Float64(-l)), 1.0))); else tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(1.0 + Float64(-1.0 - Float64(D_m * Float64(0.25 * Float64(Float64(D_m * Float64(h * (M_m ^ 2.0))) / Float64(l * (d_m ^ 2.0)))))))))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
d_m = N[Abs[d], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(D$95$m * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = 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]}, If[LessEqual[t$95$1, (-Infinity)], N[Power[N[(N[Power[w0, 1/3], $MachinePrecision] * N[Exp[N[(0.16666666666666666 * N[(N[(-2.0 * N[Log[N[(1.0 / D$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Log[N[(-0.25 * N[(N[(h / l), $MachinePrecision] * N[Power[M$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(-2.0 * N[Log[d$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 3.0], $MachinePrecision], If[LessEqual[t$95$1, 0.01], N[(w0 * N[Sqrt[N[(N[(N[(t$95$0 * t$95$0), $MachinePrecision] / 4.0), $MachinePrecision] * N[(h / (-l)), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 + N[(1.0 + N[(-1.0 - N[(D$95$m * N[(0.25 * N[(N[(D$95$m * N[(h * N[Power[M$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(l * N[Power[d$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := D\_m \cdot \frac{M\_m}{d\_m}\\
t_1 := {\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell}\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;{\left(\sqrt[3]{w0} \cdot e^{0.16666666666666666 \cdot \left(-2 \cdot \log \left(\frac{1}{D\_m}\right) + \left(\log \left(-0.25 \cdot \left(\frac{h}{\ell} \cdot {M\_m}^{2}\right)\right) + -2 \cdot \log d\_m\right)\right)}\right)}^{3}\\
\mathbf{elif}\;t\_1 \leq 0.01:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{t\_0 \cdot t\_0}{4}, \frac{h}{-\ell}, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \left(1 + \left(-1 - D\_m \cdot \left(0.25 \cdot \frac{D\_m \cdot \left(h \cdot {M\_m}^{2}\right)}{\ell \cdot {d\_m}^{2}}\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)) < -inf.0Initial program 56.5%
Simplified60.0%
Applied egg-rr60.0%
Taylor expanded in D around inf 41.2%
Taylor expanded in d around 0 15.4%
distribute-lft-neg-in15.4%
metadata-eval15.4%
associate-/l*15.4%
Simplified15.4%
if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < 0.0100000000000000002Initial program 99.9%
*-commutative99.9%
cancel-sign-sub-inv99.9%
distribute-frac-neg299.9%
*-commutative99.9%
+-commutative99.9%
fma-define99.9%
*-commutative99.9%
times-frac98.8%
Simplified98.8%
unpow298.8%
associate-*l/98.8%
associate-*l/98.8%
frac-times98.8%
metadata-eval98.8%
Applied egg-rr98.8%
if 0.0100000000000000002 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 0.0%
*-commutative0.0%
cancel-sign-sub-inv0.0%
distribute-frac-neg20.0%
*-commutative0.0%
+-commutative0.0%
fma-define0.0%
*-commutative0.0%
times-frac3.8%
Simplified3.8%
unpow23.8%
associate-*r/0.0%
associate-*l/0.0%
frac-times0.0%
div-inv0.0%
metadata-eval0.0%
*-commutative0.0%
Applied egg-rr0.0%
fma-undefine0.0%
associate-/l*0.0%
associate-*l*0.0%
distribute-frac-neg20.0%
Applied egg-rr0.0%
+-commutative0.0%
distribute-rgt-neg-out0.0%
unsub-neg0.0%
associate-*l*3.8%
*-commutative3.8%
times-frac3.8%
Simplified3.8%
expm1-log1p-u3.7%
expm1-undefine3.7%
Applied egg-rr0.1%
Taylor expanded in M around 0 52.8%
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 (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -4e+283)
(pow
(*
(cbrt w0)
(exp
(*
0.16666666666666666
(+
(+ (log (* -0.25 (/ (/ h l) (pow d_m 2.0)))) (* 2.0 (log M_m)))
(* -2.0 (log (/ 1.0 D_m)))))))
3.0)
(* w0 (sqrt (- 1.0 (/ (* h (pow (* D_m (/ M_m (* 2.0 d_m))) 2.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)) <= -4e+283) {
tmp = pow((cbrt(w0) * exp((0.16666666666666666 * ((log((-0.25 * ((h / l) / pow(d_m, 2.0)))) + (2.0 * log(M_m))) + (-2.0 * log((1.0 / D_m))))))), 3.0);
} else {
tmp = w0 * sqrt((1.0 - ((h * pow((D_m * (M_m / (2.0 * d_m))), 2.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)) <= -4e+283) {
tmp = Math.pow((Math.cbrt(w0) * Math.exp((0.16666666666666666 * ((Math.log((-0.25 * ((h / l) / Math.pow(d_m, 2.0)))) + (2.0 * Math.log(M_m))) + (-2.0 * Math.log((1.0 / D_m))))))), 3.0);
} else {
tmp = w0 * Math.sqrt((1.0 - ((h * Math.pow((D_m * (M_m / (2.0 * d_m))), 2.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)) <= -4e+283) tmp = Float64(cbrt(w0) * exp(Float64(0.16666666666666666 * Float64(Float64(log(Float64(-0.25 * Float64(Float64(h / l) / (d_m ^ 2.0)))) + Float64(2.0 * log(M_m))) + Float64(-2.0 * log(Float64(1.0 / D_m))))))) ^ 3.0; else tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(h * (Float64(D_m * Float64(M_m / Float64(2.0 * d_m))) ^ 2.0)) / l)))); end return 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], -4e+283], N[Power[N[(N[Power[w0, 1/3], $MachinePrecision] * N[Exp[N[(0.16666666666666666 * N[(N[(N[Log[N[(-0.25 * N[(N[(h / l), $MachinePrecision] / N[Power[d$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(2.0 * N[Log[M$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * N[Log[N[(1.0 / D$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 3.0], $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(h * N[Power[N[(D$95$m * N[(M$95$m / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -4 \cdot 10^{+283}:\\
\;\;\;\;{\left(\sqrt[3]{w0} \cdot e^{0.16666666666666666 \cdot \left(\left(\log \left(-0.25 \cdot \frac{\frac{h}{\ell}}{{d\_m}^{2}}\right) + 2 \cdot \log M\_m\right) + -2 \cdot \log \left(\frac{1}{D\_m}\right)\right)}\right)}^{3}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{h \cdot {\left(D\_m \cdot \frac{M\_m}{2 \cdot d\_m}\right)}^{2}}{\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)) < -3.99999999999999982e283Initial program 57.2%
Simplified59.0%
Applied egg-rr58.9%
Taylor expanded in D around inf 40.5%
Taylor expanded in M around 0 25.4%
distribute-lft-neg-in25.4%
metadata-eval25.4%
*-commutative25.4%
associate-/r*25.7%
Simplified25.7%
if -3.99999999999999982e283 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 86.5%
Simplified86.5%
associate-*r/94.4%
add-sqr-sqrt94.4%
pow294.4%
sqrt-pow194.4%
metadata-eval94.4%
pow194.4%
associate-/l/94.4%
*-commutative94.4%
Applied egg-rr94.4%
Final simplification79.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
d_m = (fabs.f64 d)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(let* ((t_0 (* D_m (/ M_m d_m))))
(if (<= (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l))) 2e+211)
(* w0 (sqrt (fma (/ (* t_0 t_0) 4.0) (/ h (- l)) 1.0)))
(*
w0
(sqrt
(+
1.0
(+
1.0
(-
-1.0
(*
D_m
(/
(* h (* (* M_m 0.5) (* (* D_m 0.5) (* M_m (pow d_m -2.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 * (M_m / d_m);
double tmp;
if ((1.0 - (pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l))) <= 2e+211) {
tmp = w0 * sqrt(fma(((t_0 * t_0) / 4.0), (h / -l), 1.0));
} else {
tmp = w0 * sqrt((1.0 + (1.0 + (-1.0 - (D_m * ((h * ((M_m * 0.5) * ((D_m * 0.5) * (M_m * pow(d_m, -2.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) t_0 = Float64(D_m * Float64(M_m / d_m)) tmp = 0.0 if (Float64(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l))) <= 2e+211) tmp = Float64(w0 * sqrt(fma(Float64(Float64(t_0 * t_0) / 4.0), Float64(h / Float64(-l)), 1.0))); else tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(1.0 + Float64(-1.0 - Float64(D_m * Float64(Float64(h * Float64(Float64(M_m * 0.5) * Float64(Float64(D_m * 0.5) * Float64(M_m * (d_m ^ -2.0))))) / l))))))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
d_m = N[Abs[d], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(D$95$m * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(1.0 - 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]), $MachinePrecision], 2e+211], N[(w0 * N[Sqrt[N[(N[(N[(t$95$0 * t$95$0), $MachinePrecision] / 4.0), $MachinePrecision] * N[(h / (-l)), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 + N[(1.0 + N[(-1.0 - N[(D$95$m * N[(N[(h * N[(N[(M$95$m * 0.5), $MachinePrecision] * N[(N[(D$95$m * 0.5), $MachinePrecision] * N[(M$95$m * N[Power[d$95$m, -2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
d_m = \left|d\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := D\_m \cdot \frac{M\_m}{d\_m}\\
\mathbf{if}\;1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq 2 \cdot 10^{+211}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{t\_0 \cdot t\_0}{4}, \frac{h}{-\ell}, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \left(1 + \left(-1 - D\_m \cdot \frac{h \cdot \left(\left(M\_m \cdot 0.5\right) \cdot \left(\left(D\_m \cdot 0.5\right) \cdot \left(M\_m \cdot {d\_m}^{-2}\right)\right)\right)}{\ell}\right)\right)}\\
\end{array}
\end{array}
if (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))) < 1.9999999999999999e211Initial program 99.9%
*-commutative99.9%
cancel-sign-sub-inv99.9%
distribute-frac-neg299.9%
*-commutative99.9%
+-commutative99.9%
fma-define99.9%
*-commutative99.9%
times-frac99.4%
Simplified99.4%
unpow299.4%
associate-*l/99.4%
associate-*l/99.4%
frac-times99.4%
metadata-eval99.4%
Applied egg-rr99.4%
if 1.9999999999999999e211 < (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))) Initial program 41.2%
*-commutative41.2%
cancel-sign-sub-inv41.2%
distribute-frac-neg241.2%
*-commutative41.2%
+-commutative41.2%
fma-define41.2%
*-commutative41.2%
times-frac43.5%
Simplified43.5%
unpow243.5%
associate-*r/40.1%
associate-*l/40.1%
frac-times40.1%
div-inv40.1%
metadata-eval40.1%
*-commutative40.1%
Applied egg-rr40.1%
fma-undefine40.1%
associate-/l*40.1%
associate-*l*40.1%
distribute-frac-neg240.1%
Applied egg-rr40.1%
+-commutative40.1%
distribute-rgt-neg-out40.1%
unsub-neg40.1%
associate-*l*43.5%
*-commutative43.5%
times-frac42.5%
Simplified42.5%
expm1-log1p-u2.4%
expm1-undefine2.4%
Applied egg-rr41.1%
associate-*r/60.0%
associate-*l*62.4%
div-inv62.4%
pow-flip62.4%
metadata-eval62.4%
Applied egg-rr62.4%
Final simplification86.9%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) d_m = (fabs.f64 d) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (let* ((t_0 (* D_m (/ M_m d_m)))) (* w0 (sqrt (+ 1.0 (* h (* -0.25 (/ (* 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 * (M_m / d_m);
return w0 * sqrt((1.0 + (h * (-0.25 * ((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 * (m_m / d_m_1)
code = w0 * sqrt((1.0d0 + (h * ((-0.25d0) * ((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 * (M_m / d_m);
return w0 * Math.sqrt((1.0 + (h * (-0.25 * ((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 * (M_m / d_m) return w0 * math.sqrt((1.0 + (h * (-0.25 * ((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(D_m * Float64(M_m / d_m)) return Float64(w0 * sqrt(Float64(1.0 + Float64(h * Float64(-0.25 * Float64(Float64(t_0 * 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 * (M_m / d_m);
tmp = w0 * sqrt((1.0 + (h * (-0.25 * ((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[(D$95$m * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]}, N[(w0 * N[Sqrt[N[(1.0 + N[(h * N[(-0.25 * N[(N[(t$95$0 * t$95$0), $MachinePrecision] / 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 := D\_m \cdot \frac{M\_m}{d\_m}\\
w0 \cdot \sqrt{1 + h \cdot \left(-0.25 \cdot \frac{t\_0 \cdot t\_0}{\ell}\right)}
\end{array}
\end{array}
Initial program 80.2%
Simplified80.6%
Taylor expanded in h around inf 58.2%
cancel-sign-sub-inv58.2%
metadata-eval58.2%
+-commutative58.2%
distribute-lft-in58.2%
fma-define58.2%
Simplified73.8%
fma-undefine73.8%
associate-/l*73.8%
pow-prod-down86.8%
Applied egg-rr86.8%
unpow286.8%
Applied egg-rr86.8%
Final simplification86.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 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 80.2%
Simplified80.6%
Taylor expanded in D around 0 69.8%
herbie shell --seed 2024163
(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))))))