
(FPCore (d h l M D) :precision binary64 (* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))
double code(double d, double h, double l, double M, double D) {
return (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
real(8) function code(d, h, l, m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (d h l M D) :precision binary64 (* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))
double code(double d, double h, double l, double M, double D) {
return (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
real(8) function code(d, h, l, m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= h -2e-310)
(*
(/ (sqrt (- d)) (sqrt (- h)))
(*
(sqrt (/ d l))
(+ 1.0 (* (/ h l) (* (pow (* (/ M_m 2.0) (/ D d)) 2.0) -0.5)))))
(*
(fma (/ h l) (* -0.5 (pow (* D (* M_m (/ 0.5 d))) 2.0)) 1.0)
(/ (/ d (sqrt l)) (sqrt h)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (h <= -2e-310) {
tmp = (sqrt(-d) / sqrt(-h)) * (sqrt((d / l)) * (1.0 + ((h / l) * (pow(((M_m / 2.0) * (D / d)), 2.0) * -0.5))));
} else {
tmp = fma((h / l), (-0.5 * pow((D * (M_m * (0.5 / d))), 2.0)), 1.0) * ((d / sqrt(l)) / sqrt(h));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (h <= -2e-310) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(sqrt(Float64(d / l)) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(Float64(M_m / 2.0) * Float64(D / d)) ^ 2.0) * -0.5))))); else tmp = Float64(fma(Float64(h / l), Float64(-0.5 * (Float64(D * Float64(M_m * Float64(0.5 / d))) ^ 2.0)), 1.0) * Float64(Float64(d / sqrt(l)) / sqrt(h))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[h, -2e-310], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;h \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(\frac{M_m}{2} \cdot \frac{D}{d}\right)}^{2} \cdot -0.5\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(D \cdot \left(M_m \cdot \frac{0.5}{d}\right)\right)}^{2}, 1\right) \cdot \frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if h < -1.999999999999994e-310Initial program 70.0%
Simplified69.2%
frac-2neg69.2%
sqrt-div79.6%
Applied egg-rr79.6%
if -1.999999999999994e-310 < h Initial program 72.1%
Simplified68.6%
Applied egg-rr24.1%
Simplified80.8%
Final simplification80.2%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -5e-310)
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D 2.0) (/ M_m d)) 2.0))))
(* (sqrt (/ d h)) (/ (sqrt (- d)) (sqrt (- l)))))
(*
(fma (/ h l) (* -0.5 (pow (* D (* M_m (/ 0.5 d))) 2.0)) 1.0)
(/ (/ d (sqrt l)) (sqrt h)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -5e-310) {
tmp = (1.0 - (0.5 * ((h / l) * pow(((D / 2.0) * (M_m / d)), 2.0)))) * (sqrt((d / h)) * (sqrt(-d) / sqrt(-l)));
} else {
tmp = fma((h / l), (-0.5 * pow((D * (M_m * (0.5 / d))), 2.0)), 1.0) * ((d / sqrt(l)) / sqrt(h));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -5e-310) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / 2.0) * Float64(M_m / d)) ^ 2.0)))) * Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))))); else tmp = Float64(fma(Float64(h / l), Float64(-0.5 * (Float64(D * Float64(M_m * Float64(0.5 / d))) ^ 2.0)), 1.0) * Float64(Float64(d / sqrt(l)) / sqrt(h))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -5e-310], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / 2.0), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{2} \cdot \frac{M_m}{d}\right)}^{2}\right)\right) \cdot \left(\sqrt{\frac{d}{h}} \cdot \frac{\sqrt{-d}}{\sqrt{-\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(D \cdot \left(M_m \cdot \frac{0.5}{d}\right)\right)}^{2}, 1\right) \cdot \frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -4.999999999999985e-310Initial program 70.0%
Simplified70.9%
frac-2neg70.9%
sqrt-div74.9%
Applied egg-rr74.9%
if -4.999999999999985e-310 < l Initial program 72.1%
Simplified68.6%
Applied egg-rr24.1%
Simplified80.8%
Final simplification78.1%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= h -2e-310)
(*
(* (/ (sqrt (- d)) (sqrt (- h))) (sqrt (/ d l)))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D 2.0) (/ M_m d)) 2.0)))))
(*
(fma (/ h l) (* -0.5 (pow (* D (* M_m (/ 0.5 d))) 2.0)) 1.0)
(/ (/ d (sqrt l)) (sqrt h)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (h <= -2e-310) {
tmp = ((sqrt(-d) / sqrt(-h)) * sqrt((d / l))) * (1.0 - (0.5 * ((h / l) * pow(((D / 2.0) * (M_m / d)), 2.0))));
} else {
tmp = fma((h / l), (-0.5 * pow((D * (M_m * (0.5 / d))), 2.0)), 1.0) * ((d / sqrt(l)) / sqrt(h));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (h <= -2e-310) tmp = Float64(Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * sqrt(Float64(d / l))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / 2.0) * Float64(M_m / d)) ^ 2.0))))); else tmp = Float64(fma(Float64(h / l), Float64(-0.5 * (Float64(D * Float64(M_m * Float64(0.5 / d))) ^ 2.0)), 1.0) * Float64(Float64(d / sqrt(l)) / sqrt(h))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[h, -2e-310], N[(N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / 2.0), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;h \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{2} \cdot \frac{M_m}{d}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(D \cdot \left(M_m \cdot \frac{0.5}{d}\right)\right)}^{2}, 1\right) \cdot \frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if h < -1.999999999999994e-310Initial program 70.0%
Simplified70.9%
frac-2neg69.2%
sqrt-div79.6%
Applied egg-rr81.1%
if -1.999999999999994e-310 < h Initial program 72.1%
Simplified68.6%
Applied egg-rr24.1%
Simplified80.8%
Final simplification80.9%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l 3.5e-305)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* 0.5 (/ (* h (* 0.25 (pow (/ D (/ d M_m)) 2.0))) l))))
(*
(fma (/ h l) (* -0.5 (pow (* D (* M_m (/ 0.5 d))) 2.0)) 1.0)
(/ (/ d (sqrt l)) (sqrt h)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 3.5e-305) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h * (0.25 * pow((D / (d / M_m)), 2.0))) / l)));
} else {
tmp = fma((h / l), (-0.5 * pow((D * (M_m * (0.5 / d))), 2.0)), 1.0) * ((d / sqrt(l)) / sqrt(h));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= 3.5e-305) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h * Float64(0.25 * (Float64(D / Float64(d / M_m)) ^ 2.0))) / l)))); else tmp = Float64(fma(Float64(h / l), Float64(-0.5 * (Float64(D * Float64(M_m * Float64(0.5 / d))) ^ 2.0)), 1.0) * Float64(Float64(d / sqrt(l)) / sqrt(h))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, 3.5e-305], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h * N[(0.25 * N[Power[N[(D / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3.5 \cdot 10^{-305}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \frac{h \cdot \left(0.25 \cdot {\left(\frac{D}{\frac{d}{M_m}}\right)}^{2}\right)}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(D \cdot \left(M_m \cdot \frac{0.5}{d}\right)\right)}^{2}, 1\right) \cdot \frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < 3.4999999999999998e-305Initial program 70.0%
Simplified70.9%
expm1-log1p-u70.5%
expm1-udef70.5%
*-commutative70.5%
frac-times69.7%
*-commutative69.7%
frac-times68.9%
div-inv68.9%
metadata-eval68.9%
Applied egg-rr68.9%
expm1-def68.9%
expm1-log1p69.2%
*-commutative69.2%
*-commutative69.2%
associate-*r*69.2%
metadata-eval69.2%
times-frac69.2%
associate-*r/69.2%
associate-*r*70.9%
*-commutative70.9%
*-commutative70.9%
associate-/r*70.9%
metadata-eval70.9%
Simplified70.9%
Taylor expanded in D around 0 70.0%
add-sqr-sqrt70.0%
pow270.0%
*-commutative70.0%
sqrt-prod70.0%
sqrt-pow170.0%
metadata-eval70.0%
times-frac70.0%
*-un-lft-identity70.0%
frac-times71.0%
sqrt-pow170.9%
sqrt-prod70.9%
pow270.9%
add-sqr-sqrt70.9%
associate-*r/71.0%
Applied egg-rr71.0%
if 3.4999999999999998e-305 < l Initial program 72.1%
Simplified68.6%
Applied egg-rr24.1%
Simplified80.8%
Final simplification76.3%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (pow (* D (* 0.5 (/ M_m d))) 2.0)))
(if (<= l -5.7e-8)
(* (- d) (sqrt (/ (/ 1.0 l) h)))
(if (<= l -5e-308)
(* (sqrt (* (/ d l) (/ d h))) (+ 1.0 (* t_0 (* (/ h l) -0.5))))
(* (/ (/ d (sqrt h)) (sqrt l)) (- 1.0 (* (/ h l) (* 0.5 t_0))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = pow((D * (0.5 * (M_m / d))), 2.0);
double tmp;
if (l <= -5.7e-8) {
tmp = -d * sqrt(((1.0 / l) / h));
} else if (l <= -5e-308) {
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (t_0 * ((h / l) * -0.5)));
} else {
tmp = ((d / sqrt(h)) / sqrt(l)) * (1.0 - ((h / l) * (0.5 * t_0)));
}
return tmp;
}
M_m = abs(M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: tmp
t_0 = (d_1 * (0.5d0 * (m_m / d))) ** 2.0d0
if (l <= (-5.7d-8)) then
tmp = -d * sqrt(((1.0d0 / l) / h))
else if (l <= (-5d-308)) then
tmp = sqrt(((d / l) * (d / h))) * (1.0d0 + (t_0 * ((h / l) * (-0.5d0))))
else
tmp = ((d / sqrt(h)) / sqrt(l)) * (1.0d0 - ((h / l) * (0.5d0 * t_0)))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.pow((D * (0.5 * (M_m / d))), 2.0);
double tmp;
if (l <= -5.7e-8) {
tmp = -d * Math.sqrt(((1.0 / l) / h));
} else if (l <= -5e-308) {
tmp = Math.sqrt(((d / l) * (d / h))) * (1.0 + (t_0 * ((h / l) * -0.5)));
} else {
tmp = ((d / Math.sqrt(h)) / Math.sqrt(l)) * (1.0 - ((h / l) * (0.5 * t_0)));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.pow((D * (0.5 * (M_m / d))), 2.0) tmp = 0 if l <= -5.7e-8: tmp = -d * math.sqrt(((1.0 / l) / h)) elif l <= -5e-308: tmp = math.sqrt(((d / l) * (d / h))) * (1.0 + (t_0 * ((h / l) * -0.5))) else: tmp = ((d / math.sqrt(h)) / math.sqrt(l)) * (1.0 - ((h / l) * (0.5 * t_0))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(D * Float64(0.5 * Float64(M_m / d))) ^ 2.0 tmp = 0.0 if (l <= -5.7e-8) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))); elseif (l <= -5e-308) tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * Float64(1.0 + Float64(t_0 * Float64(Float64(h / l) * -0.5)))); else tmp = Float64(Float64(Float64(d / sqrt(h)) / sqrt(l)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * t_0)))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = (D * (0.5 * (M_m / d))) ^ 2.0;
tmp = 0.0;
if (l <= -5.7e-8)
tmp = -d * sqrt(((1.0 / l) / h));
elseif (l <= -5e-308)
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (t_0 * ((h / l) * -0.5)));
else
tmp = ((d / sqrt(h)) / sqrt(l)) * (1.0 - ((h / l) * (0.5 * t_0)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Power[N[(D * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[l, -5.7e-8], N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-308], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(t$95$0 * N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(d / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := {\left(D \cdot \left(0.5 \cdot \frac{M_m}{d}\right)\right)}^{2}\\
\mathbf{if}\;\ell \leq -5.7 \cdot 10^{-8}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-308}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot \left(1 + t_0 \cdot \left(\frac{h}{\ell} \cdot -0.5\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{h}}}{\sqrt{\ell}} \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot t_0\right)\right)\\
\end{array}
\end{array}
if l < -5.70000000000000009e-8Initial program 61.4%
Simplified63.0%
frac-2neg59.8%
sqrt-div71.7%
Applied egg-rr74.5%
Taylor expanded in d around -inf 57.1%
associate-*r*57.1%
neg-mul-157.1%
associate-/l/58.3%
Simplified58.3%
if -5.70000000000000009e-8 < l < -4.99999999999999955e-308Initial program 79.1%
Simplified79.1%
frac-2neg79.1%
sqrt-div88.0%
Applied egg-rr88.0%
expm1-log1p-u33.3%
expm1-udef30.5%
Applied egg-rr23.4%
expm1-def26.1%
expm1-log1p70.9%
unpow1/270.9%
associate-*r*70.9%
associate-*l*70.9%
Simplified70.9%
if -4.99999999999999955e-308 < l Initial program 72.1%
Simplified68.6%
Applied egg-rr24.1%
expm1-def36.5%
expm1-log1p84.8%
associate-/r*80.1%
*-commutative80.1%
associate-*r/80.8%
associate-*l*80.8%
*-commutative80.8%
associate-*l/77.3%
*-commutative77.3%
associate-*l*77.3%
Simplified77.3%
Final simplification71.4%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= d -1.6e-167)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* 0.5 (/ (* h (* 0.25 (pow (/ D (/ d M_m)) 2.0))) l))))
(if (<= d 3.4e-292)
(* d (sqrt (log1p (expm1 (/ (/ 1.0 l) h)))))
(*
(/ (/ d (sqrt h)) (sqrt l))
(- 1.0 (* (/ h l) (* 0.5 (pow (* D (* 0.5 (/ M_m d))) 2.0))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= -1.6e-167) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h * (0.25 * pow((D / (d / M_m)), 2.0))) / l)));
} else if (d <= 3.4e-292) {
tmp = d * sqrt(log1p(expm1(((1.0 / l) / h))));
} else {
tmp = ((d / sqrt(h)) / sqrt(l)) * (1.0 - ((h / l) * (0.5 * pow((D * (0.5 * (M_m / d))), 2.0))));
}
return tmp;
}
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= -1.6e-167) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (0.5 * ((h * (0.25 * Math.pow((D / (d / M_m)), 2.0))) / l)));
} else if (d <= 3.4e-292) {
tmp = d * Math.sqrt(Math.log1p(Math.expm1(((1.0 / l) / h))));
} else {
tmp = ((d / Math.sqrt(h)) / Math.sqrt(l)) * (1.0 - ((h / l) * (0.5 * Math.pow((D * (0.5 * (M_m / d))), 2.0))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if d <= -1.6e-167: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (0.5 * ((h * (0.25 * math.pow((D / (d / M_m)), 2.0))) / l))) elif d <= 3.4e-292: tmp = d * math.sqrt(math.log1p(math.expm1(((1.0 / l) / h)))) else: tmp = ((d / math.sqrt(h)) / math.sqrt(l)) * (1.0 - ((h / l) * (0.5 * math.pow((D * (0.5 * (M_m / d))), 2.0)))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (d <= -1.6e-167) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h * Float64(0.25 * (Float64(D / Float64(d / M_m)) ^ 2.0))) / l)))); elseif (d <= 3.4e-292) tmp = Float64(d * sqrt(log1p(expm1(Float64(Float64(1.0 / l) / h))))); else tmp = Float64(Float64(Float64(d / sqrt(h)) / sqrt(l)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(D * Float64(0.5 * Float64(M_m / d))) ^ 2.0))))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[d, -1.6e-167], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h * N[(0.25 * N[Power[N[(D / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 3.4e-292], N[(d * N[Sqrt[N[Log[1 + N[(Exp[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(d / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(D * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -1.6 \cdot 10^{-167}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \frac{h \cdot \left(0.25 \cdot {\left(\frac{D}{\frac{d}{M_m}}\right)}^{2}\right)}{\ell}\right)\\
\mathbf{elif}\;d \leq 3.4 \cdot 10^{-292}:\\
\;\;\;\;d \cdot \sqrt{\mathsf{log1p}\left(\mathsf{expm1}\left(\frac{\frac{1}{\ell}}{h}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{h}}}{\sqrt{\ell}} \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(D \cdot \left(0.5 \cdot \frac{M_m}{d}\right)\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if d < -1.6000000000000001e-167Initial program 77.1%
Simplified78.2%
expm1-log1p-u77.7%
expm1-udef77.7%
*-commutative77.7%
frac-times76.7%
*-commutative76.7%
frac-times75.8%
div-inv75.8%
metadata-eval75.8%
Applied egg-rr75.8%
expm1-def75.8%
expm1-log1p76.2%
*-commutative76.2%
*-commutative76.2%
associate-*r*76.2%
metadata-eval76.2%
times-frac76.2%
associate-*r/76.2%
associate-*r*78.2%
*-commutative78.2%
*-commutative78.2%
associate-/r*78.2%
metadata-eval78.2%
Simplified78.2%
Taylor expanded in D around 0 77.1%
add-sqr-sqrt77.1%
pow277.1%
*-commutative77.1%
sqrt-prod77.1%
sqrt-pow177.1%
metadata-eval77.1%
times-frac77.1%
*-un-lft-identity77.1%
frac-times78.2%
sqrt-pow178.2%
sqrt-prod78.2%
pow278.2%
add-sqr-sqrt78.2%
associate-*r/79.4%
Applied egg-rr79.4%
if -1.6000000000000001e-167 < d < 3.40000000000000017e-292Initial program 38.6%
Simplified38.6%
Taylor expanded in d around inf 24.0%
*-commutative24.0%
associate-/r*24.0%
Simplified24.0%
log1p-expm1-u54.1%
Applied egg-rr54.1%
if 3.40000000000000017e-292 < d Initial program 72.4%
Simplified68.8%
Applied egg-rr24.5%
expm1-def37.0%
expm1-log1p85.4%
associate-/r*80.5%
*-commutative80.5%
associate-*r/81.2%
associate-*l*81.2%
*-commutative81.2%
associate-*l/77.7%
*-commutative77.7%
associate-*l*77.7%
Simplified77.7%
Final simplification76.2%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l 3e-187)
(*
(*
(sqrt (/ d l))
(+ 1.0 (* (/ h l) (* (pow (* (/ M_m 2.0) (/ D d)) 2.0) -0.5))))
(sqrt (/ d h)))
(*
(/ (/ d (sqrt h)) (sqrt l))
(- 1.0 (* (/ h l) (* 0.5 (pow (* D (* 0.5 (/ M_m d))) 2.0)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 3e-187) {
tmp = (sqrt((d / l)) * (1.0 + ((h / l) * (pow(((M_m / 2.0) * (D / d)), 2.0) * -0.5)))) * sqrt((d / h));
} else {
tmp = ((d / sqrt(h)) / sqrt(l)) * (1.0 - ((h / l) * (0.5 * pow((D * (0.5 * (M_m / d))), 2.0))));
}
return tmp;
}
M_m = abs(M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (l <= 3d-187) then
tmp = (sqrt((d / l)) * (1.0d0 + ((h / l) * ((((m_m / 2.0d0) * (d_1 / d)) ** 2.0d0) * (-0.5d0))))) * sqrt((d / h))
else
tmp = ((d / sqrt(h)) / sqrt(l)) * (1.0d0 - ((h / l) * (0.5d0 * ((d_1 * (0.5d0 * (m_m / d))) ** 2.0d0))))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 3e-187) {
tmp = (Math.sqrt((d / l)) * (1.0 + ((h / l) * (Math.pow(((M_m / 2.0) * (D / d)), 2.0) * -0.5)))) * Math.sqrt((d / h));
} else {
tmp = ((d / Math.sqrt(h)) / Math.sqrt(l)) * (1.0 - ((h / l) * (0.5 * Math.pow((D * (0.5 * (M_m / d))), 2.0))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= 3e-187: tmp = (math.sqrt((d / l)) * (1.0 + ((h / l) * (math.pow(((M_m / 2.0) * (D / d)), 2.0) * -0.5)))) * math.sqrt((d / h)) else: tmp = ((d / math.sqrt(h)) / math.sqrt(l)) * (1.0 - ((h / l) * (0.5 * math.pow((D * (0.5 * (M_m / d))), 2.0)))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= 3e-187) tmp = Float64(Float64(sqrt(Float64(d / l)) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(Float64(M_m / 2.0) * Float64(D / d)) ^ 2.0) * -0.5)))) * sqrt(Float64(d / h))); else tmp = Float64(Float64(Float64(d / sqrt(h)) / sqrt(l)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(D * Float64(0.5 * Float64(M_m / d))) ^ 2.0))))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= 3e-187)
tmp = (sqrt((d / l)) * (1.0 + ((h / l) * ((((M_m / 2.0) * (D / d)) ^ 2.0) * -0.5)))) * sqrt((d / h));
else
tmp = ((d / sqrt(h)) / sqrt(l)) * (1.0 - ((h / l) * (0.5 * ((D * (0.5 * (M_m / d))) ^ 2.0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, 3e-187], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(d / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(D * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3 \cdot 10^{-187}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(\frac{M_m}{2} \cdot \frac{D}{d}\right)}^{2} \cdot -0.5\right)\right)\right) \cdot \sqrt{\frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{h}}}{\sqrt{\ell}} \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(D \cdot \left(0.5 \cdot \frac{M_m}{d}\right)\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if l < 3.00000000000000004e-187Initial program 72.4%
Simplified71.7%
if 3.00000000000000004e-187 < l Initial program 69.6%
Simplified65.5%
Applied egg-rr24.2%
expm1-def38.8%
expm1-log1p82.1%
associate-/r*79.1%
*-commutative79.1%
associate-*r/79.9%
associate-*l*79.9%
*-commutative79.9%
associate-*l/75.8%
*-commutative75.8%
associate-*l*75.8%
Simplified75.8%
Final simplification73.6%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l 1.15e-184)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* 0.5 (* (/ h l) (pow (* D (* M_m (/ 0.5 d))) 2.0)))))
(*
(/ (/ d (sqrt h)) (sqrt l))
(- 1.0 (* (/ h l) (* 0.5 (pow (* D (* 0.5 (/ M_m d))) 2.0)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 1.15e-184) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h / l) * pow((D * (M_m * (0.5 / d))), 2.0))));
} else {
tmp = ((d / sqrt(h)) / sqrt(l)) * (1.0 - ((h / l) * (0.5 * pow((D * (0.5 * (M_m / d))), 2.0))));
}
return tmp;
}
M_m = abs(M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (l <= 1.15d-184) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (0.5d0 * ((h / l) * ((d_1 * (m_m * (0.5d0 / d))) ** 2.0d0))))
else
tmp = ((d / sqrt(h)) / sqrt(l)) * (1.0d0 - ((h / l) * (0.5d0 * ((d_1 * (0.5d0 * (m_m / d))) ** 2.0d0))))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 1.15e-184) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (0.5 * ((h / l) * Math.pow((D * (M_m * (0.5 / d))), 2.0))));
} else {
tmp = ((d / Math.sqrt(h)) / Math.sqrt(l)) * (1.0 - ((h / l) * (0.5 * Math.pow((D * (0.5 * (M_m / d))), 2.0))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= 1.15e-184: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (0.5 * ((h / l) * math.pow((D * (M_m * (0.5 / d))), 2.0)))) else: tmp = ((d / math.sqrt(h)) / math.sqrt(l)) * (1.0 - ((h / l) * (0.5 * math.pow((D * (0.5 * (M_m / d))), 2.0)))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= 1.15e-184) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(D * Float64(M_m * Float64(0.5 / d))) ^ 2.0))))); else tmp = Float64(Float64(Float64(d / sqrt(h)) / sqrt(l)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(D * Float64(0.5 * Float64(M_m / d))) ^ 2.0))))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= 1.15e-184)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h / l) * ((D * (M_m * (0.5 / d))) ^ 2.0))));
else
tmp = ((d / sqrt(h)) / sqrt(l)) * (1.0 - ((h / l) * (0.5 * ((D * (0.5 * (M_m / d))) ^ 2.0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, 1.15e-184], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(d / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(D * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.15 \cdot 10^{-184}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(D \cdot \left(M_m \cdot \frac{0.5}{d}\right)\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{h}}}{\sqrt{\ell}} \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(D \cdot \left(0.5 \cdot \frac{M_m}{d}\right)\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if l < 1.15e-184Initial program 72.4%
Simplified73.1%
expm1-log1p-u72.8%
expm1-udef72.8%
*-commutative72.8%
frac-times72.1%
*-commutative72.1%
frac-times71.5%
div-inv71.5%
metadata-eval71.5%
Applied egg-rr71.5%
expm1-def71.5%
expm1-log1p71.7%
*-commutative71.7%
*-commutative71.7%
associate-*r*71.7%
metadata-eval71.7%
times-frac71.7%
associate-*r/71.7%
associate-*r*73.1%
*-commutative73.1%
*-commutative73.1%
associate-/r*73.1%
metadata-eval73.1%
Simplified73.1%
if 1.15e-184 < l Initial program 69.6%
Simplified65.5%
Applied egg-rr24.2%
expm1-def38.8%
expm1-log1p82.1%
associate-/r*79.1%
*-commutative79.1%
associate-*r/79.9%
associate-*l*79.9%
*-commutative79.9%
associate-*l/75.8%
*-commutative75.8%
associate-*l*75.8%
Simplified75.8%
Final simplification74.4%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -3.8e-5)
(* (- d) (sqrt (/ (/ 1.0 l) h)))
(if (<= l 3.3e+177)
(*
(sqrt (* (/ d l) (/ d h)))
(+ 1.0 (* (pow (* D (* 0.5 (/ M_m d))) 2.0) (* (/ h l) -0.5))))
(* d (/ (pow l -0.5) (sqrt h))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -3.8e-5) {
tmp = -d * sqrt(((1.0 / l) / h));
} else if (l <= 3.3e+177) {
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (pow((D * (0.5 * (M_m / d))), 2.0) * ((h / l) * -0.5)));
} else {
tmp = d * (pow(l, -0.5) / sqrt(h));
}
return tmp;
}
M_m = abs(M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (l <= (-3.8d-5)) then
tmp = -d * sqrt(((1.0d0 / l) / h))
else if (l <= 3.3d+177) then
tmp = sqrt(((d / l) * (d / h))) * (1.0d0 + (((d_1 * (0.5d0 * (m_m / d))) ** 2.0d0) * ((h / l) * (-0.5d0))))
else
tmp = d * ((l ** (-0.5d0)) / sqrt(h))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -3.8e-5) {
tmp = -d * Math.sqrt(((1.0 / l) / h));
} else if (l <= 3.3e+177) {
tmp = Math.sqrt(((d / l) * (d / h))) * (1.0 + (Math.pow((D * (0.5 * (M_m / d))), 2.0) * ((h / l) * -0.5)));
} else {
tmp = d * (Math.pow(l, -0.5) / Math.sqrt(h));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -3.8e-5: tmp = -d * math.sqrt(((1.0 / l) / h)) elif l <= 3.3e+177: tmp = math.sqrt(((d / l) * (d / h))) * (1.0 + (math.pow((D * (0.5 * (M_m / d))), 2.0) * ((h / l) * -0.5))) else: tmp = d * (math.pow(l, -0.5) / math.sqrt(h)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -3.8e-5) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))); elseif (l <= 3.3e+177) tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * Float64(1.0 + Float64((Float64(D * Float64(0.5 * Float64(M_m / d))) ^ 2.0) * Float64(Float64(h / l) * -0.5)))); else tmp = Float64(d * Float64((l ^ -0.5) / sqrt(h))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -3.8e-5)
tmp = -d * sqrt(((1.0 / l) / h));
elseif (l <= 3.3e+177)
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (((D * (0.5 * (M_m / d))) ^ 2.0) * ((h / l) * -0.5)));
else
tmp = d * ((l ^ -0.5) / sqrt(h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -3.8e-5], N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.3e+177], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[Power[N[(D * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -3.8 \cdot 10^{-5}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{elif}\;\ell \leq 3.3 \cdot 10^{+177}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot \left(1 + {\left(D \cdot \left(0.5 \cdot \frac{M_m}{d}\right)\right)}^{2} \cdot \left(\frac{h}{\ell} \cdot -0.5\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{{\ell}^{-0.5}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -3.8000000000000002e-5Initial program 61.4%
Simplified63.0%
frac-2neg59.8%
sqrt-div71.7%
Applied egg-rr74.5%
Taylor expanded in d around -inf 57.1%
associate-*r*57.1%
neg-mul-157.1%
associate-/l/58.3%
Simplified58.3%
if -3.8000000000000002e-5 < l < 3.3000000000000001e177Initial program 78.9%
Simplified76.0%
frac-2neg78.3%
sqrt-div30.0%
Applied egg-rr30.0%
expm1-log1p-u11.4%
expm1-udef10.4%
Applied egg-rr17.4%
expm1-def22.3%
expm1-log1p66.7%
unpow1/266.7%
associate-*r*66.7%
associate-*l*66.7%
Simplified66.7%
if 3.3000000000000001e177 < l Initial program 46.3%
Simplified46.3%
Taylor expanded in d around inf 39.8%
*-commutative39.8%
associate-/r*39.7%
Simplified39.7%
Taylor expanded in d around 0 39.8%
associate-/l/39.7%
associate-/l/39.8%
unpow-139.8%
sqr-pow39.8%
rem-sqrt-square39.8%
metadata-eval39.8%
sqr-pow39.6%
fabs-sqr39.6%
sqr-pow39.8%
Simplified39.8%
add-sqr-sqrt39.6%
sqrt-unprod39.8%
pow-prod-up39.8%
metadata-eval39.8%
inv-pow39.8%
associate-/l/39.7%
sqrt-div62.5%
inv-pow62.5%
sqrt-pow162.6%
metadata-eval62.6%
Applied egg-rr62.6%
Final simplification64.3%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (* (- d) (sqrt (/ (/ 1.0 l) h)))))
(if (<= l -8.5e-221)
t_0
(if (<= l 2.8e-279)
(* d (pow (* h l) -0.5))
(if (<= l 6e-138) t_0 (* d (/ (pow l -0.5) (sqrt h))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = -d * sqrt(((1.0 / l) / h));
double tmp;
if (l <= -8.5e-221) {
tmp = t_0;
} else if (l <= 2.8e-279) {
tmp = d * pow((h * l), -0.5);
} else if (l <= 6e-138) {
tmp = t_0;
} else {
tmp = d * (pow(l, -0.5) / sqrt(h));
}
return tmp;
}
M_m = abs(M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: tmp
t_0 = -d * sqrt(((1.0d0 / l) / h))
if (l <= (-8.5d-221)) then
tmp = t_0
else if (l <= 2.8d-279) then
tmp = d * ((h * l) ** (-0.5d0))
else if (l <= 6d-138) then
tmp = t_0
else
tmp = d * ((l ** (-0.5d0)) / sqrt(h))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = -d * Math.sqrt(((1.0 / l) / h));
double tmp;
if (l <= -8.5e-221) {
tmp = t_0;
} else if (l <= 2.8e-279) {
tmp = d * Math.pow((h * l), -0.5);
} else if (l <= 6e-138) {
tmp = t_0;
} else {
tmp = d * (Math.pow(l, -0.5) / Math.sqrt(h));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = -d * math.sqrt(((1.0 / l) / h)) tmp = 0 if l <= -8.5e-221: tmp = t_0 elif l <= 2.8e-279: tmp = d * math.pow((h * l), -0.5) elif l <= 6e-138: tmp = t_0 else: tmp = d * (math.pow(l, -0.5) / math.sqrt(h)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))) tmp = 0.0 if (l <= -8.5e-221) tmp = t_0; elseif (l <= 2.8e-279) tmp = Float64(d * (Float64(h * l) ^ -0.5)); elseif (l <= 6e-138) tmp = t_0; else tmp = Float64(d * Float64((l ^ -0.5) / sqrt(h))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = -d * sqrt(((1.0 / l) / h));
tmp = 0.0;
if (l <= -8.5e-221)
tmp = t_0;
elseif (l <= 2.8e-279)
tmp = d * ((h * l) ^ -0.5);
elseif (l <= 6e-138)
tmp = t_0;
else
tmp = d * ((l ^ -0.5) / sqrt(h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -8.5e-221], t$95$0, If[LessEqual[l, 2.8e-279], N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 6e-138], t$95$0, N[(d * N[(N[Power[l, -0.5], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{if}\;\ell \leq -8.5 \cdot 10^{-221}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;\ell \leq 2.8 \cdot 10^{-279}:\\
\;\;\;\;d \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq 6 \cdot 10^{-138}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{{\ell}^{-0.5}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -8.49999999999999984e-221 or 2.8000000000000001e-279 < l < 6.0000000000000001e-138Initial program 72.3%
Simplified72.4%
frac-2neg71.6%
sqrt-div58.3%
Applied egg-rr59.6%
Taylor expanded in d around -inf 47.6%
associate-*r*47.6%
neg-mul-147.6%
associate-/l/48.1%
Simplified48.1%
if -8.49999999999999984e-221 < l < 2.8000000000000001e-279Initial program 89.9%
Simplified90.0%
Taylor expanded in d around inf 36.7%
*-commutative36.7%
associate-/r*36.7%
Simplified36.7%
Taylor expanded in d around 0 36.7%
associate-/l/36.7%
associate-/l/36.7%
unpow-136.7%
sqr-pow36.7%
rem-sqrt-square36.7%
metadata-eval36.7%
sqr-pow36.7%
fabs-sqr36.7%
sqr-pow36.7%
Simplified36.7%
if 6.0000000000000001e-138 < l Initial program 65.9%
Simplified62.0%
Taylor expanded in d around inf 40.8%
*-commutative40.8%
associate-/r*40.8%
Simplified40.8%
Taylor expanded in d around 0 40.8%
associate-/l/40.8%
associate-/l/40.8%
unpow-140.8%
sqr-pow40.9%
rem-sqrt-square40.9%
metadata-eval40.9%
sqr-pow40.7%
fabs-sqr40.7%
sqr-pow40.9%
Simplified40.9%
add-sqr-sqrt40.7%
sqrt-unprod40.9%
pow-prod-up40.8%
metadata-eval40.8%
inv-pow40.8%
associate-/l/40.8%
sqrt-div48.1%
inv-pow48.1%
sqrt-pow148.2%
metadata-eval48.2%
Applied egg-rr48.2%
Final simplification47.2%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (/ (/ 1.0 l) h)) (t_1 (* (- d) (sqrt t_0))))
(if (<= l -7e-221)
t_1
(if (<= l 2.7e-279)
(* d (cbrt (pow t_0 1.5)))
(if (<= l 2.55e-138) t_1 (* d (/ (pow l -0.5) (sqrt h))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = (1.0 / l) / h;
double t_1 = -d * sqrt(t_0);
double tmp;
if (l <= -7e-221) {
tmp = t_1;
} else if (l <= 2.7e-279) {
tmp = d * cbrt(pow(t_0, 1.5));
} else if (l <= 2.55e-138) {
tmp = t_1;
} else {
tmp = d * (pow(l, -0.5) / sqrt(h));
}
return tmp;
}
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = (1.0 / l) / h;
double t_1 = -d * Math.sqrt(t_0);
double tmp;
if (l <= -7e-221) {
tmp = t_1;
} else if (l <= 2.7e-279) {
tmp = d * Math.cbrt(Math.pow(t_0, 1.5));
} else if (l <= 2.55e-138) {
tmp = t_1;
} else {
tmp = d * (Math.pow(l, -0.5) / Math.sqrt(h));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(Float64(1.0 / l) / h) t_1 = Float64(Float64(-d) * sqrt(t_0)) tmp = 0.0 if (l <= -7e-221) tmp = t_1; elseif (l <= 2.7e-279) tmp = Float64(d * cbrt((t_0 ^ 1.5))); elseif (l <= 2.55e-138) tmp = t_1; else tmp = Float64(d * Float64((l ^ -0.5) / sqrt(h))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]}, Block[{t$95$1 = N[((-d) * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -7e-221], t$95$1, If[LessEqual[l, 2.7e-279], N[(d * N[Power[N[Power[t$95$0, 1.5], $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 2.55e-138], t$95$1, N[(d * N[(N[Power[l, -0.5], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{1}{\ell}}{h}\\
t_1 := \left(-d\right) \cdot \sqrt{t_0}\\
\mathbf{if}\;\ell \leq -7 \cdot 10^{-221}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;\ell \leq 2.7 \cdot 10^{-279}:\\
\;\;\;\;d \cdot \sqrt[3]{{t_0}^{1.5}}\\
\mathbf{elif}\;\ell \leq 2.55 \cdot 10^{-138}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{{\ell}^{-0.5}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -6.9999999999999998e-221 or 2.7000000000000001e-279 < l < 2.5500000000000001e-138Initial program 72.3%
Simplified72.4%
frac-2neg71.6%
sqrt-div58.3%
Applied egg-rr59.6%
Taylor expanded in d around -inf 47.6%
associate-*r*47.6%
neg-mul-147.6%
associate-/l/48.1%
Simplified48.1%
if -6.9999999999999998e-221 < l < 2.7000000000000001e-279Initial program 89.9%
Simplified90.0%
Taylor expanded in d around inf 36.7%
*-commutative36.7%
associate-/r*36.7%
Simplified36.7%
add-cbrt-cube46.4%
pow1/346.4%
add-sqr-sqrt46.4%
pow146.4%
pow1/246.4%
pow-prod-up46.4%
metadata-eval46.4%
Applied egg-rr46.4%
unpow1/346.4%
Simplified46.4%
if 2.5500000000000001e-138 < l Initial program 65.9%
Simplified62.0%
Taylor expanded in d around inf 40.8%
*-commutative40.8%
associate-/r*40.8%
Simplified40.8%
Taylor expanded in d around 0 40.8%
associate-/l/40.8%
associate-/l/40.8%
unpow-140.8%
sqr-pow40.9%
rem-sqrt-square40.9%
metadata-eval40.9%
sqr-pow40.7%
fabs-sqr40.7%
sqr-pow40.9%
Simplified40.9%
add-sqr-sqrt40.7%
sqrt-unprod40.9%
pow-prod-up40.8%
metadata-eval40.8%
inv-pow40.8%
associate-/l/40.8%
sqrt-div48.1%
inv-pow48.1%
sqrt-pow148.2%
metadata-eval48.2%
Applied egg-rr48.2%
Final simplification48.0%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (or (<= l -1.26e-220) (and (not (<= l 1.8e-279)) (<= l 6.6e-137))) (* (- d) (sqrt (/ (/ 1.0 l) h))) (* d (pow (* h l) -0.5))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if ((l <= -1.26e-220) || (!(l <= 1.8e-279) && (l <= 6.6e-137))) {
tmp = -d * sqrt(((1.0 / l) / h));
} else {
tmp = d * pow((h * l), -0.5);
}
return tmp;
}
M_m = abs(M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if ((l <= (-1.26d-220)) .or. (.not. (l <= 1.8d-279)) .and. (l <= 6.6d-137)) then
tmp = -d * sqrt(((1.0d0 / l) / h))
else
tmp = d * ((h * l) ** (-0.5d0))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if ((l <= -1.26e-220) || (!(l <= 1.8e-279) && (l <= 6.6e-137))) {
tmp = -d * Math.sqrt(((1.0 / l) / h));
} else {
tmp = d * Math.pow((h * l), -0.5);
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if (l <= -1.26e-220) or (not (l <= 1.8e-279) and (l <= 6.6e-137)): tmp = -d * math.sqrt(((1.0 / l) / h)) else: tmp = d * math.pow((h * l), -0.5) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if ((l <= -1.26e-220) || (!(l <= 1.8e-279) && (l <= 6.6e-137))) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))); else tmp = Float64(d * (Float64(h * l) ^ -0.5)); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if ((l <= -1.26e-220) || (~((l <= 1.8e-279)) && (l <= 6.6e-137)))
tmp = -d * sqrt(((1.0 / l) / h));
else
tmp = d * ((h * l) ^ -0.5);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[Or[LessEqual[l, -1.26e-220], And[N[Not[LessEqual[l, 1.8e-279]], $MachinePrecision], LessEqual[l, 6.6e-137]]], N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.26 \cdot 10^{-220} \lor \neg \left(\ell \leq 1.8 \cdot 10^{-279}\right) \land \ell \leq 6.6 \cdot 10^{-137}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\end{array}
\end{array}
if l < -1.25999999999999992e-220 or 1.7999999999999998e-279 < l < 6.6000000000000004e-137Initial program 72.3%
Simplified72.4%
frac-2neg71.6%
sqrt-div58.3%
Applied egg-rr59.6%
Taylor expanded in d around -inf 47.6%
associate-*r*47.6%
neg-mul-147.6%
associate-/l/48.1%
Simplified48.1%
if -1.25999999999999992e-220 < l < 1.7999999999999998e-279 or 6.6000000000000004e-137 < l Initial program 69.8%
Simplified66.6%
Taylor expanded in d around inf 40.2%
*-commutative40.2%
associate-/r*40.1%
Simplified40.1%
Taylor expanded in d around 0 40.2%
associate-/l/40.1%
associate-/l/40.2%
unpow-140.2%
sqr-pow40.2%
rem-sqrt-square40.2%
metadata-eval40.2%
sqr-pow40.0%
fabs-sqr40.0%
sqr-pow40.2%
Simplified40.2%
Final simplification44.3%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (pow (* h l) -0.5)))
(if (or (<= l -7e-221) (and (not (<= l 9e-280)) (<= l 2.6e-138)))
(* d (- t_0))
(* d t_0))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = pow((h * l), -0.5);
double tmp;
if ((l <= -7e-221) || (!(l <= 9e-280) && (l <= 2.6e-138))) {
tmp = d * -t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = abs(M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: tmp
t_0 = (h * l) ** (-0.5d0)
if ((l <= (-7d-221)) .or. (.not. (l <= 9d-280)) .and. (l <= 2.6d-138)) then
tmp = d * -t_0
else
tmp = d * t_0
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.pow((h * l), -0.5);
double tmp;
if ((l <= -7e-221) || (!(l <= 9e-280) && (l <= 2.6e-138))) {
tmp = d * -t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.pow((h * l), -0.5) tmp = 0 if (l <= -7e-221) or (not (l <= 9e-280) and (l <= 2.6e-138)): tmp = d * -t_0 else: tmp = d * t_0 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(h * l) ^ -0.5 tmp = 0.0 if ((l <= -7e-221) || (!(l <= 9e-280) && (l <= 2.6e-138))) tmp = Float64(d * Float64(-t_0)); else tmp = Float64(d * t_0); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = (h * l) ^ -0.5;
tmp = 0.0;
if ((l <= -7e-221) || (~((l <= 9e-280)) && (l <= 2.6e-138)))
tmp = d * -t_0;
else
tmp = d * t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]}, If[Or[LessEqual[l, -7e-221], And[N[Not[LessEqual[l, 9e-280]], $MachinePrecision], LessEqual[l, 2.6e-138]]], N[(d * (-t$95$0)), $MachinePrecision], N[(d * t$95$0), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -7 \cdot 10^{-221} \lor \neg \left(\ell \leq 9 \cdot 10^{-280}\right) \land \ell \leq 2.6 \cdot 10^{-138}:\\
\;\;\;\;d \cdot \left(-t_0\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot t_0\\
\end{array}
\end{array}
if l < -6.9999999999999998e-221 or 8.9999999999999991e-280 < l < 2.6e-138Initial program 72.3%
Simplified72.4%
frac-2neg71.6%
sqrt-div58.3%
Applied egg-rr59.6%
Taylor expanded in d around -inf 47.6%
mul-1-neg47.6%
*-commutative47.6%
associate-/l/48.1%
distribute-rgt-neg-in48.1%
associate-/l/47.6%
unpow-147.6%
sqr-pow47.6%
rem-sqrt-square47.6%
metadata-eval47.6%
sqr-pow47.4%
fabs-sqr47.4%
sqr-pow47.6%
Simplified47.6%
if -6.9999999999999998e-221 < l < 8.9999999999999991e-280 or 2.6e-138 < l Initial program 69.8%
Simplified66.6%
Taylor expanded in d around inf 40.2%
*-commutative40.2%
associate-/r*40.1%
Simplified40.1%
Taylor expanded in d around 0 40.2%
associate-/l/40.1%
associate-/l/40.2%
unpow-140.2%
sqr-pow40.2%
rem-sqrt-square40.2%
metadata-eval40.2%
sqr-pow40.0%
fabs-sqr40.0%
sqr-pow40.2%
Simplified40.2%
Final simplification44.0%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (* d (sqrt (/ 1.0 (* h l)))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
return d * sqrt((1.0 / (h * l)));
}
M_m = abs(M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
code = d * sqrt((1.0d0 / (h * l)))
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
return d * Math.sqrt((1.0 / (h * l)));
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): return d * math.sqrt((1.0 / (h * l)))
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) return Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp = code(d, h, l, M_m, D)
tmp = d * sqrt((1.0 / (h * l)));
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
d \cdot \sqrt{\frac{1}{h \cdot \ell}}
\end{array}
Initial program 71.1%
Simplified69.6%
Taylor expanded in d around inf 24.0%
Final simplification24.0%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (* d (pow (* h l) -0.5)))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
return d * pow((h * l), -0.5);
}
M_m = abs(M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
code = d * ((h * l) ** (-0.5d0))
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
return d * Math.pow((h * l), -0.5);
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): return d * math.pow((h * l), -0.5)
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) return Float64(d * (Float64(h * l) ^ -0.5)) end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp = code(d, h, l, M_m, D)
tmp = d * ((h * l) ^ -0.5);
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
d \cdot {\left(h \cdot \ell\right)}^{-0.5}
\end{array}
Initial program 71.1%
Simplified69.6%
Taylor expanded in d around inf 24.0%
*-commutative24.0%
associate-/r*24.0%
Simplified24.0%
Taylor expanded in d around 0 24.0%
associate-/l/24.0%
associate-/l/24.0%
unpow-124.0%
sqr-pow24.0%
rem-sqrt-square23.7%
metadata-eval23.7%
sqr-pow23.6%
fabs-sqr23.6%
sqr-pow23.7%
Simplified23.7%
Final simplification23.7%
herbie shell --seed 2023338
(FPCore (d h l M D)
:name "Henrywood and Agarwal, Equation (12)"
:precision binary64
(* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))