
(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 17 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 -4e-310)
(*
(sqrt (/ d h))
(*
(/ (sqrt (- d)) (sqrt (- l)))
(- 1.0 (* h (* (/ 0.125 l) (pow (* D (/ M_m d)) 2.0))))))
(*
(/ (sqrt d) (sqrt l))
(*
(/ (sqrt d) (sqrt h))
(+ 1.0 (* (/ h l) (* (pow (/ (* D (* M_m 0.5)) d) 2.0) -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 (h <= -4e-310) {
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * (1.0 - (h * ((0.125 / l) * pow((D * (M_m / d)), 2.0)))));
} else {
tmp = (sqrt(d) / sqrt(l)) * ((sqrt(d) / sqrt(h)) * (1.0 + ((h / l) * (pow(((D * (M_m * 0.5)) / d), 2.0) * -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 (h <= (-4d-310)) then
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * (1.0d0 - (h * ((0.125d0 / l) * ((d_1 * (m_m / d)) ** 2.0d0)))))
else
tmp = (sqrt(d) / sqrt(l)) * ((sqrt(d) / sqrt(h)) * (1.0d0 + ((h / l) * ((((d_1 * (m_m * 0.5d0)) / d) ** 2.0d0) * (-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 (h <= -4e-310) {
tmp = Math.sqrt((d / h)) * ((Math.sqrt(-d) / Math.sqrt(-l)) * (1.0 - (h * ((0.125 / l) * Math.pow((D * (M_m / d)), 2.0)))));
} else {
tmp = (Math.sqrt(d) / Math.sqrt(l)) * ((Math.sqrt(d) / Math.sqrt(h)) * (1.0 + ((h / l) * (Math.pow(((D * (M_m * 0.5)) / d), 2.0) * -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 h <= -4e-310: tmp = math.sqrt((d / h)) * ((math.sqrt(-d) / math.sqrt(-l)) * (1.0 - (h * ((0.125 / l) * math.pow((D * (M_m / d)), 2.0))))) else: tmp = (math.sqrt(d) / math.sqrt(l)) * ((math.sqrt(d) / math.sqrt(h)) * (1.0 + ((h / l) * (math.pow(((D * (M_m * 0.5)) / d), 2.0) * -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 (h <= -4e-310) tmp = Float64(sqrt(Float64(d / h)) * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * Float64(1.0 - Float64(h * Float64(Float64(0.125 / l) * (Float64(D * Float64(M_m / d)) ^ 2.0)))))); else tmp = Float64(Float64(sqrt(d) / sqrt(l)) * Float64(Float64(sqrt(d) / sqrt(h)) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(Float64(D * Float64(M_m * 0.5)) / d) ^ 2.0) * -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 (h <= -4e-310)
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * (1.0 - (h * ((0.125 / l) * ((D * (M_m / d)) ^ 2.0)))));
else
tmp = (sqrt(d) / sqrt(l)) * ((sqrt(d) / sqrt(h)) * (1.0 + ((h / l) * ((((D * (M_m * 0.5)) / d) ^ 2.0) * -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[LessEqual[h, -4e-310], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(h * N[(N[(0.125 / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(N[(D * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $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}\;h \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot \left(1 - h \cdot \left(\frac{0.125}{\ell} \cdot {\left(D \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{d}}{\sqrt{\ell}} \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(\frac{D \cdot \left(M\_m \cdot 0.5\right)}{d}\right)}^{2} \cdot -0.5\right)\right)\right)\\
\end{array}
\end{array}
if h < -3.999999999999988e-310Initial program 74.7%
Simplified75.3%
Taylor expanded in h around -inf 49.1%
associate-*r*49.1%
neg-mul-149.1%
sub-neg49.1%
distribute-lft-in49.1%
Simplified76.0%
frac-2neg76.0%
sqrt-div81.9%
Applied egg-rr81.9%
if -3.999999999999988e-310 < h Initial program 70.7%
Simplified70.7%
associate-*r/70.7%
div-inv70.7%
metadata-eval70.7%
Applied egg-rr70.7%
sqrt-div76.5%
Applied egg-rr76.5%
sqrt-div89.4%
Applied egg-rr89.4%
Final simplification85.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 (<=
(*
(* (pow (/ d h) 0.5) (pow (/ d l) 0.5))
(- 1.0 (* (/ h l) (* 0.5 (pow (/ (* D M_m) (* d 2.0)) 2.0)))))
INFINITY)
(*
(sqrt (/ d h))
(* (- 1.0 (* h (* (/ 0.125 l) (pow (* D (/ M_m d)) 2.0)))) (sqrt (/ d l))))
(*
(pow D 2.0)
(* (sqrt (/ h (pow l 3.0))) (/ (* -0.125 (pow M_m 2.0)) d)))))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 (((pow((d / h), 0.5) * pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * pow(((D * M_m) / (d * 2.0)), 2.0))))) <= ((double) INFINITY)) {
tmp = sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * pow((D * (M_m / d)), 2.0)))) * sqrt((d / l)));
} else {
tmp = pow(D, 2.0) * (sqrt((h / pow(l, 3.0))) * ((-0.125 * pow(M_m, 2.0)) / d));
}
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 (((Math.pow((d / h), 0.5) * Math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * Math.pow(((D * M_m) / (d * 2.0)), 2.0))))) <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * Math.pow((D * (M_m / d)), 2.0)))) * Math.sqrt((d / l)));
} else {
tmp = Math.pow(D, 2.0) * (Math.sqrt((h / Math.pow(l, 3.0))) * ((-0.125 * Math.pow(M_m, 2.0)) / d));
}
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 ((math.pow((d / h), 0.5) * math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * math.pow(((D * M_m) / (d * 2.0)), 2.0))))) <= math.inf: tmp = math.sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * math.pow((D * (M_m / d)), 2.0)))) * math.sqrt((d / l))) else: tmp = math.pow(D, 2.0) * (math.sqrt((h / math.pow(l, 3.0))) * ((-0.125 * math.pow(M_m, 2.0)) / d)) 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 (Float64(Float64((Float64(d / h) ^ 0.5) * (Float64(d / l) ^ 0.5)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(D * M_m) / Float64(d * 2.0)) ^ 2.0))))) <= Inf) tmp = Float64(sqrt(Float64(d / h)) * Float64(Float64(1.0 - Float64(h * Float64(Float64(0.125 / l) * (Float64(D * Float64(M_m / d)) ^ 2.0)))) * sqrt(Float64(d / l)))); else tmp = Float64((D ^ 2.0) * Float64(sqrt(Float64(h / (l ^ 3.0))) * Float64(Float64(-0.125 * (M_m ^ 2.0)) / d))); 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 (((((d / h) ^ 0.5) * ((d / l) ^ 0.5)) * (1.0 - ((h / l) * (0.5 * (((D * M_m) / (d * 2.0)) ^ 2.0))))) <= Inf)
tmp = sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * ((D * (M_m / d)) ^ 2.0)))) * sqrt((d / l)));
else
tmp = (D ^ 2.0) * (sqrt((h / (l ^ 3.0))) * ((-0.125 * (M_m ^ 2.0)) / d));
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[N[(N[(N[Power[N[(d / h), $MachinePrecision], 0.5], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(D * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 - N[(h * N[(N[(0.125 / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Power[D, 2.0], $MachinePrecision] * N[(N[Sqrt[N[(h / N[Power[l, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(-0.125 * N[Power[M$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / d), $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}\;\left({\left(\frac{d}{h}\right)}^{0.5} \cdot {\left(\frac{d}{\ell}\right)}^{0.5}\right) \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{D \cdot M\_m}{d \cdot 2}\right)}^{2}\right)\right) \leq \infty:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\left(1 - h \cdot \left(\frac{0.125}{\ell} \cdot {\left(D \cdot \frac{M\_m}{d}\right)}^{2}\right)\right) \cdot \sqrt{\frac{d}{\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;{D}^{2} \cdot \left(\sqrt{\frac{h}{{\ell}^{3}}} \cdot \frac{-0.125 \cdot {M\_m}^{2}}{d}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < +inf.0Initial program 86.0%
Simplified86.4%
Taylor expanded in h around -inf 56.1%
associate-*r*56.1%
neg-mul-156.1%
sub-neg56.1%
distribute-lft-in56.1%
Simplified86.3%
if +inf.0 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) Initial program 0.0%
Simplified0.0%
add-sqr-sqrt0.0%
pow20.0%
sqrt-prod0.0%
sqrt-pow10.3%
metadata-eval0.3%
pow10.3%
*-commutative0.3%
div-inv0.3%
metadata-eval0.3%
Applied egg-rr0.3%
Taylor expanded in d around 0 23.3%
*-commutative23.3%
associate-/l*20.8%
associate-*l*20.8%
associate-*r*20.8%
*-commutative20.8%
associate-*l*20.8%
*-commutative20.8%
associate-*r/20.8%
Simplified20.8%
Final simplification76.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 (<=
(*
(* (pow (/ d h) 0.5) (pow (/ d l) 0.5))
(- 1.0 (* (/ h l) (* 0.5 (pow (/ (* D M_m) (* d 2.0)) 2.0)))))
INFINITY)
(*
(sqrt (/ d h))
(* (- 1.0 (* h (* (/ 0.125 l) (pow (* D (/ M_m d)) 2.0)))) (sqrt (/ d l))))
(*
(sqrt (/ h (pow l 3.0)))
(* -0.125 (* (pow D 2.0) (/ (pow M_m 2.0) d))))))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 (((pow((d / h), 0.5) * pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * pow(((D * M_m) / (d * 2.0)), 2.0))))) <= ((double) INFINITY)) {
tmp = sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * pow((D * (M_m / d)), 2.0)))) * sqrt((d / l)));
} else {
tmp = sqrt((h / pow(l, 3.0))) * (-0.125 * (pow(D, 2.0) * (pow(M_m, 2.0) / d)));
}
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 (((Math.pow((d / h), 0.5) * Math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * Math.pow(((D * M_m) / (d * 2.0)), 2.0))))) <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * Math.pow((D * (M_m / d)), 2.0)))) * Math.sqrt((d / l)));
} else {
tmp = Math.sqrt((h / Math.pow(l, 3.0))) * (-0.125 * (Math.pow(D, 2.0) * (Math.pow(M_m, 2.0) / d)));
}
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 ((math.pow((d / h), 0.5) * math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * math.pow(((D * M_m) / (d * 2.0)), 2.0))))) <= math.inf: tmp = math.sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * math.pow((D * (M_m / d)), 2.0)))) * math.sqrt((d / l))) else: tmp = math.sqrt((h / math.pow(l, 3.0))) * (-0.125 * (math.pow(D, 2.0) * (math.pow(M_m, 2.0) / d))) 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 (Float64(Float64((Float64(d / h) ^ 0.5) * (Float64(d / l) ^ 0.5)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(D * M_m) / Float64(d * 2.0)) ^ 2.0))))) <= Inf) tmp = Float64(sqrt(Float64(d / h)) * Float64(Float64(1.0 - Float64(h * Float64(Float64(0.125 / l) * (Float64(D * Float64(M_m / d)) ^ 2.0)))) * sqrt(Float64(d / l)))); else tmp = Float64(sqrt(Float64(h / (l ^ 3.0))) * Float64(-0.125 * Float64((D ^ 2.0) * Float64((M_m ^ 2.0) / d)))); 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 (((((d / h) ^ 0.5) * ((d / l) ^ 0.5)) * (1.0 - ((h / l) * (0.5 * (((D * M_m) / (d * 2.0)) ^ 2.0))))) <= Inf)
tmp = sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * ((D * (M_m / d)) ^ 2.0)))) * sqrt((d / l)));
else
tmp = sqrt((h / (l ^ 3.0))) * (-0.125 * ((D ^ 2.0) * ((M_m ^ 2.0) / d)));
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[N[(N[(N[Power[N[(d / h), $MachinePrecision], 0.5], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(D * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 - N[(h * N[(N[(0.125 / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(h / N[Power[l, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-0.125 * N[(N[Power[D, 2.0], $MachinePrecision] * N[(N[Power[M$95$m, 2.0], $MachinePrecision] / d), $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}\;\left({\left(\frac{d}{h}\right)}^{0.5} \cdot {\left(\frac{d}{\ell}\right)}^{0.5}\right) \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{D \cdot M\_m}{d \cdot 2}\right)}^{2}\right)\right) \leq \infty:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\left(1 - h \cdot \left(\frac{0.125}{\ell} \cdot {\left(D \cdot \frac{M\_m}{d}\right)}^{2}\right)\right) \cdot \sqrt{\frac{d}{\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{h}{{\ell}^{3}}} \cdot \left(-0.125 \cdot \left({D}^{2} \cdot \frac{{M\_m}^{2}}{d}\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < +inf.0Initial program 86.0%
Simplified86.4%
Taylor expanded in h around -inf 56.1%
associate-*r*56.1%
neg-mul-156.1%
sub-neg56.1%
distribute-lft-in56.1%
Simplified86.3%
if +inf.0 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) Initial program 0.0%
Simplified0.0%
Taylor expanded in d around 0 23.3%
associate-*r*23.3%
associate-/l*20.8%
Simplified20.8%
Final simplification76.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
(let* ((t_0 (pow (* D (/ M_m d)) 2.0)) (t_1 (sqrt (/ d l))))
(if (<= h -1.4e+135)
(* (sqrt (/ d h)) (* (- 1.0 (* h (* (/ 0.125 l) t_0))) t_1))
(if (<= h -4e-310)
(* (* d (sqrt (/ 1.0 (* h l)))) (- -1.0 (* (/ h l) (* t_0 -0.125))))
(*
t_1
(*
(/ (sqrt d) (sqrt h))
(+ 1.0 (* h (/ (* -0.125 (pow (/ (* D M_m) d) 2.0)) 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) {
double t_0 = pow((D * (M_m / d)), 2.0);
double t_1 = sqrt((d / l));
double tmp;
if (h <= -1.4e+135) {
tmp = sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * t_0))) * t_1);
} else if (h <= -4e-310) {
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h / l) * (t_0 * -0.125)));
} else {
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0 + (h * ((-0.125 * pow(((D * M_m) / d), 2.0)) / l))));
}
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) :: t_1
real(8) :: tmp
t_0 = (d_1 * (m_m / d)) ** 2.0d0
t_1 = sqrt((d / l))
if (h <= (-1.4d+135)) then
tmp = sqrt((d / h)) * ((1.0d0 - (h * ((0.125d0 / l) * t_0))) * t_1)
else if (h <= (-4d-310)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((-1.0d0) - ((h / l) * (t_0 * (-0.125d0))))
else
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0d0 + (h * (((-0.125d0) * (((d_1 * m_m) / d) ** 2.0d0)) / l))))
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 * (M_m / d)), 2.0);
double t_1 = Math.sqrt((d / l));
double tmp;
if (h <= -1.4e+135) {
tmp = Math.sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * t_0))) * t_1);
} else if (h <= -4e-310) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h / l) * (t_0 * -0.125)));
} else {
tmp = t_1 * ((Math.sqrt(d) / Math.sqrt(h)) * (1.0 + (h * ((-0.125 * Math.pow(((D * M_m) / d), 2.0)) / l))));
}
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 * (M_m / d)), 2.0) t_1 = math.sqrt((d / l)) tmp = 0 if h <= -1.4e+135: tmp = math.sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * t_0))) * t_1) elif h <= -4e-310: tmp = (d * math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h / l) * (t_0 * -0.125))) else: tmp = t_1 * ((math.sqrt(d) / math.sqrt(h)) * (1.0 + (h * ((-0.125 * math.pow(((D * M_m) / d), 2.0)) / l)))) 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(M_m / d)) ^ 2.0 t_1 = sqrt(Float64(d / l)) tmp = 0.0 if (h <= -1.4e+135) tmp = Float64(sqrt(Float64(d / h)) * Float64(Float64(1.0 - Float64(h * Float64(Float64(0.125 / l) * t_0))) * t_1)); elseif (h <= -4e-310) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(-1.0 - Float64(Float64(h / l) * Float64(t_0 * -0.125)))); else tmp = Float64(t_1 * Float64(Float64(sqrt(d) / sqrt(h)) * Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(Float64(D * M_m) / d) ^ 2.0)) / l))))); 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 * (M_m / d)) ^ 2.0;
t_1 = sqrt((d / l));
tmp = 0.0;
if (h <= -1.4e+135)
tmp = sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * t_0))) * t_1);
elseif (h <= -4e-310)
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h / l) * (t_0 * -0.125)));
else
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0 + (h * ((-0.125 * (((D * M_m) / d) ^ 2.0)) / l))));
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[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -1.4e+135], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 - N[(h * N[(N[(0.125 / l), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -4e-310], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 - N[(N[(h / l), $MachinePrecision] * N[(t$95$0 * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(N[(D * M$95$m), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $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}
t_0 := {\left(D \cdot \frac{M\_m}{d}\right)}^{2}\\
t_1 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;h \leq -1.4 \cdot 10^{+135}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\left(1 - h \cdot \left(\frac{0.125}{\ell} \cdot t\_0\right)\right) \cdot t\_1\right)\\
\mathbf{elif}\;h \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(-1 - \frac{h}{\ell} \cdot \left(t\_0 \cdot -0.125\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot \left(1 + h \cdot \frac{-0.125 \cdot {\left(\frac{D \cdot M\_m}{d}\right)}^{2}}{\ell}\right)\right)\\
\end{array}
\end{array}
if h < -1.40000000000000001e135Initial program 57.6%
Simplified60.0%
Taylor expanded in h around -inf 38.7%
associate-*r*38.7%
neg-mul-138.7%
sub-neg38.7%
distribute-lft-in38.7%
Simplified65.0%
if -1.40000000000000001e135 < h < -3.999999999999988e-310Initial program 81.9%
Simplified81.8%
add-sqr-sqrt81.8%
pow281.8%
sqrt-prod81.8%
sqrt-pow182.7%
metadata-eval82.7%
pow182.7%
*-commutative82.7%
div-inv82.7%
metadata-eval82.7%
Applied egg-rr82.7%
pow182.7%
Applied egg-rr64.7%
unpow164.7%
*-commutative64.7%
associate-*r*64.7%
*-commutative64.7%
associate-*r*64.7%
associate-*r*64.7%
metadata-eval64.7%
associate-*r/63.8%
*-commutative63.8%
associate-*r/63.4%
Simplified63.4%
Taylor expanded in d around -inf 84.4%
if -3.999999999999988e-310 < h Initial program 70.7%
Simplified70.7%
associate-*r/70.7%
div-inv70.7%
metadata-eval70.7%
Applied egg-rr70.7%
associate-*l/72.5%
*-commutative72.5%
associate-*l/72.4%
*-commutative72.4%
*-commutative72.4%
associate-*r*72.4%
unpow-prod-down72.4%
metadata-eval72.4%
Applied egg-rr72.4%
associate-/l*72.4%
associate-*r*72.4%
metadata-eval72.4%
associate-*r/72.5%
Applied egg-rr72.5%
sqrt-div89.4%
Applied egg-rr85.4%
Final simplification81.7%
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 -4e-310)
(*
(sqrt (/ d h))
(*
(/ (sqrt (- d)) (sqrt (- l)))
(- 1.0 (* h (* (/ 0.125 l) (pow (* D (/ M_m d)) 2.0))))))
(*
(sqrt (/ d l))
(*
(/ (sqrt d) (sqrt h))
(+ 1.0 (* h (/ (* -0.125 (pow (/ (* D M_m) d) 2.0)) 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) {
double tmp;
if (l <= -4e-310) {
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * (1.0 - (h * ((0.125 / l) * pow((D * (M_m / d)), 2.0)))));
} else {
tmp = sqrt((d / l)) * ((sqrt(d) / sqrt(h)) * (1.0 + (h * ((-0.125 * pow(((D * M_m) / d), 2.0)) / l))));
}
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 <= (-4d-310)) then
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * (1.0d0 - (h * ((0.125d0 / l) * ((d_1 * (m_m / d)) ** 2.0d0)))))
else
tmp = sqrt((d / l)) * ((sqrt(d) / sqrt(h)) * (1.0d0 + (h * (((-0.125d0) * (((d_1 * m_m) / d) ** 2.0d0)) / l))))
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 <= -4e-310) {
tmp = Math.sqrt((d / h)) * ((Math.sqrt(-d) / Math.sqrt(-l)) * (1.0 - (h * ((0.125 / l) * Math.pow((D * (M_m / d)), 2.0)))));
} else {
tmp = Math.sqrt((d / l)) * ((Math.sqrt(d) / Math.sqrt(h)) * (1.0 + (h * ((-0.125 * Math.pow(((D * M_m) / d), 2.0)) / l))));
}
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 <= -4e-310: tmp = math.sqrt((d / h)) * ((math.sqrt(-d) / math.sqrt(-l)) * (1.0 - (h * ((0.125 / l) * math.pow((D * (M_m / d)), 2.0))))) else: tmp = math.sqrt((d / l)) * ((math.sqrt(d) / math.sqrt(h)) * (1.0 + (h * ((-0.125 * math.pow(((D * M_m) / d), 2.0)) / l)))) 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 <= -4e-310) tmp = Float64(sqrt(Float64(d / h)) * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * Float64(1.0 - Float64(h * Float64(Float64(0.125 / l) * (Float64(D * Float64(M_m / d)) ^ 2.0)))))); else tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(sqrt(d) / sqrt(h)) * Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(Float64(D * M_m) / d) ^ 2.0)) / l))))); 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 <= -4e-310)
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * (1.0 - (h * ((0.125 / l) * ((D * (M_m / d)) ^ 2.0)))));
else
tmp = sqrt((d / l)) * ((sqrt(d) / sqrt(h)) * (1.0 + (h * ((-0.125 * (((D * M_m) / d) ^ 2.0)) / l))));
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, -4e-310], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(h * N[(N[(0.125 / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(N[(D * M$95$m), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $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 -4 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot \left(1 - h \cdot \left(\frac{0.125}{\ell} \cdot {\left(D \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot \left(1 + h \cdot \frac{-0.125 \cdot {\left(\frac{D \cdot M\_m}{d}\right)}^{2}}{\ell}\right)\right)\\
\end{array}
\end{array}
if l < -3.999999999999988e-310Initial program 74.7%
Simplified75.3%
Taylor expanded in h around -inf 49.1%
associate-*r*49.1%
neg-mul-149.1%
sub-neg49.1%
distribute-lft-in49.1%
Simplified76.0%
frac-2neg76.0%
sqrt-div81.9%
Applied egg-rr81.9%
if -3.999999999999988e-310 < l Initial program 70.7%
Simplified70.7%
associate-*r/70.7%
div-inv70.7%
metadata-eval70.7%
Applied egg-rr70.7%
associate-*l/72.5%
*-commutative72.5%
associate-*l/72.4%
*-commutative72.4%
*-commutative72.4%
associate-*r*72.4%
unpow-prod-down72.4%
metadata-eval72.4%
Applied egg-rr72.4%
associate-/l*72.4%
associate-*r*72.4%
metadata-eval72.4%
associate-*r/72.5%
Applied egg-rr72.5%
sqrt-div89.4%
Applied egg-rr85.4%
Final simplification83.5%
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 (* h (/ (* -0.125 (pow (/ (* D M_m) d) 2.0)) l)))))
(if (<= l -4e-310)
(* (/ (sqrt (- d)) (sqrt (- l))) (* (sqrt (/ d h)) t_0))
(* (sqrt (/ d l)) (* (/ (sqrt d) (sqrt h)) 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 = 1.0 + (h * ((-0.125 * pow(((D * M_m) / d), 2.0)) / l));
double tmp;
if (l <= -4e-310) {
tmp = (sqrt(-d) / sqrt(-l)) * (sqrt((d / h)) * t_0);
} else {
tmp = sqrt((d / l)) * ((sqrt(d) / sqrt(h)) * 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 = 1.0d0 + (h * (((-0.125d0) * (((d_1 * m_m) / d) ** 2.0d0)) / l))
if (l <= (-4d-310)) then
tmp = (sqrt(-d) / sqrt(-l)) * (sqrt((d / h)) * t_0)
else
tmp = sqrt((d / l)) * ((sqrt(d) / sqrt(h)) * 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 = 1.0 + (h * ((-0.125 * Math.pow(((D * M_m) / d), 2.0)) / l));
double tmp;
if (l <= -4e-310) {
tmp = (Math.sqrt(-d) / Math.sqrt(-l)) * (Math.sqrt((d / h)) * t_0);
} else {
tmp = Math.sqrt((d / l)) * ((Math.sqrt(d) / Math.sqrt(h)) * 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 = 1.0 + (h * ((-0.125 * math.pow(((D * M_m) / d), 2.0)) / l)) tmp = 0 if l <= -4e-310: tmp = (math.sqrt(-d) / math.sqrt(-l)) * (math.sqrt((d / h)) * t_0) else: tmp = math.sqrt((d / l)) * ((math.sqrt(d) / math.sqrt(h)) * 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(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(Float64(D * M_m) / d) ^ 2.0)) / l))) tmp = 0.0 if (l <= -4e-310) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * Float64(sqrt(Float64(d / h)) * t_0)); else tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(sqrt(d) / sqrt(h)) * 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 = 1.0 + (h * ((-0.125 * (((D * M_m) / d) ^ 2.0)) / l));
tmp = 0.0;
if (l <= -4e-310)
tmp = (sqrt(-d) / sqrt(-l)) * (sqrt((d / h)) * t_0);
else
tmp = sqrt((d / l)) * ((sqrt(d) / sqrt(h)) * 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[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(N[(D * M$95$m), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -4e-310], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * t$95$0), $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 := 1 + h \cdot \frac{-0.125 \cdot {\left(\frac{D \cdot M\_m}{d}\right)}^{2}}{\ell}\\
\mathbf{if}\;\ell \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot t\_0\right)\\
\end{array}
\end{array}
if l < -3.999999999999988e-310Initial program 74.7%
Simplified75.1%
associate-*r/74.7%
div-inv74.7%
metadata-eval74.7%
Applied egg-rr74.7%
associate-*l/76.2%
*-commutative76.2%
associate-*l/75.5%
*-commutative75.5%
*-commutative75.5%
associate-*r*75.5%
unpow-prod-down75.5%
metadata-eval75.5%
Applied egg-rr75.5%
associate-/l*76.2%
associate-*r*76.2%
metadata-eval76.2%
associate-*r/75.6%
Applied egg-rr75.6%
frac-2neg76.0%
sqrt-div81.9%
Applied egg-rr81.9%
if -3.999999999999988e-310 < l Initial program 70.7%
Simplified70.7%
associate-*r/70.7%
div-inv70.7%
metadata-eval70.7%
Applied egg-rr70.7%
associate-*l/72.5%
*-commutative72.5%
associate-*l/72.4%
*-commutative72.4%
*-commutative72.4%
associate-*r*72.4%
unpow-prod-down72.4%
metadata-eval72.4%
Applied egg-rr72.4%
associate-/l*72.4%
associate-*r*72.4%
metadata-eval72.4%
associate-*r/72.5%
Applied egg-rr72.5%
sqrt-div89.4%
Applied egg-rr85.4%
Final simplification83.5%
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 (sqrt (/ d l)))
(t_1 (+ 1.0 (* h (/ (* -0.125 (pow (/ (* D M_m) d) 2.0)) l)))))
(if (<= l -4e-310)
(* t_0 (* t_1 (/ (sqrt (- d)) (sqrt (- h)))))
(* t_0 (* (/ (sqrt d) (sqrt h)) t_1)))))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 = sqrt((d / l));
double t_1 = 1.0 + (h * ((-0.125 * pow(((D * M_m) / d), 2.0)) / l));
double tmp;
if (l <= -4e-310) {
tmp = t_0 * (t_1 * (sqrt(-d) / sqrt(-h)));
} else {
tmp = t_0 * ((sqrt(d) / sqrt(h)) * t_1);
}
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) :: t_1
real(8) :: tmp
t_0 = sqrt((d / l))
t_1 = 1.0d0 + (h * (((-0.125d0) * (((d_1 * m_m) / d) ** 2.0d0)) / l))
if (l <= (-4d-310)) then
tmp = t_0 * (t_1 * (sqrt(-d) / sqrt(-h)))
else
tmp = t_0 * ((sqrt(d) / sqrt(h)) * t_1)
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.sqrt((d / l));
double t_1 = 1.0 + (h * ((-0.125 * Math.pow(((D * M_m) / d), 2.0)) / l));
double tmp;
if (l <= -4e-310) {
tmp = t_0 * (t_1 * (Math.sqrt(-d) / Math.sqrt(-h)));
} else {
tmp = t_0 * ((Math.sqrt(d) / Math.sqrt(h)) * t_1);
}
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.sqrt((d / l)) t_1 = 1.0 + (h * ((-0.125 * math.pow(((D * M_m) / d), 2.0)) / l)) tmp = 0 if l <= -4e-310: tmp = t_0 * (t_1 * (math.sqrt(-d) / math.sqrt(-h))) else: tmp = t_0 * ((math.sqrt(d) / math.sqrt(h)) * t_1) 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 = sqrt(Float64(d / l)) t_1 = Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(Float64(D * M_m) / d) ^ 2.0)) / l))) tmp = 0.0 if (l <= -4e-310) tmp = Float64(t_0 * Float64(t_1 * Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))))); else tmp = Float64(t_0 * Float64(Float64(sqrt(d) / sqrt(h)) * t_1)); 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 = sqrt((d / l));
t_1 = 1.0 + (h * ((-0.125 * (((D * M_m) / d) ^ 2.0)) / l));
tmp = 0.0;
if (l <= -4e-310)
tmp = t_0 * (t_1 * (sqrt(-d) / sqrt(-h)));
else
tmp = t_0 * ((sqrt(d) / sqrt(h)) * t_1);
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[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(N[(D * M$95$m), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -4e-310], N[(t$95$0 * N[(t$95$1 * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * t$95$1), $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 := \sqrt{\frac{d}{\ell}}\\
t_1 := 1 + h \cdot \frac{-0.125 \cdot {\left(\frac{D \cdot M\_m}{d}\right)}^{2}}{\ell}\\
\mathbf{if}\;\ell \leq -4 \cdot 10^{-310}:\\
\;\;\;\;t\_0 \cdot \left(t\_1 \cdot \frac{\sqrt{-d}}{\sqrt{-h}}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot t\_1\right)\\
\end{array}
\end{array}
if l < -3.999999999999988e-310Initial program 74.7%
Simplified75.1%
associate-*r/74.7%
div-inv74.7%
metadata-eval74.7%
Applied egg-rr74.7%
associate-*l/76.2%
*-commutative76.2%
associate-*l/75.5%
*-commutative75.5%
*-commutative75.5%
associate-*r*75.5%
unpow-prod-down75.5%
metadata-eval75.5%
Applied egg-rr75.5%
associate-/l*76.2%
associate-*r*76.2%
metadata-eval76.2%
associate-*r/75.6%
Applied egg-rr75.6%
frac-2neg75.6%
sqrt-div81.1%
Applied egg-rr81.1%
if -3.999999999999988e-310 < l Initial program 70.7%
Simplified70.7%
associate-*r/70.7%
div-inv70.7%
metadata-eval70.7%
Applied egg-rr70.7%
associate-*l/72.5%
*-commutative72.5%
associate-*l/72.4%
*-commutative72.4%
*-commutative72.4%
associate-*r*72.4%
unpow-prod-down72.4%
metadata-eval72.4%
Applied egg-rr72.4%
associate-/l*72.4%
associate-*r*72.4%
metadata-eval72.4%
associate-*r/72.5%
Applied egg-rr72.5%
sqrt-div89.4%
Applied egg-rr85.4%
Final simplification83.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 (* (sqrt (/ d h)) (* (- 1.0 (* h (* (/ 0.125 l) (pow (* D (/ M_m d)) 2.0)))) (sqrt (/ d 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 sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * pow((D * (M_m / d)), 2.0)))) * sqrt((d / 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 = sqrt((d / h)) * ((1.0d0 - (h * ((0.125d0 / l) * ((d_1 * (m_m / d)) ** 2.0d0)))) * sqrt((d / 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 Math.sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * Math.pow((D * (M_m / d)), 2.0)))) * Math.sqrt((d / 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 math.sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * math.pow((D * (M_m / d)), 2.0)))) * math.sqrt((d / 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(sqrt(Float64(d / h)) * Float64(Float64(1.0 - Float64(h * Float64(Float64(0.125 / l) * (Float64(D * Float64(M_m / d)) ^ 2.0)))) * sqrt(Float64(d / 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 = sqrt((d / h)) * ((1.0 - (h * ((0.125 / l) * ((D * (M_m / d)) ^ 2.0)))) * sqrt((d / 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[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 - N[(h * N[(N[(0.125 / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / 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])\\
\\
\sqrt{\frac{d}{h}} \cdot \left(\left(1 - h \cdot \left(\frac{0.125}{\ell} \cdot {\left(D \cdot \frac{M\_m}{d}\right)}^{2}\right)\right) \cdot \sqrt{\frac{d}{\ell}}\right)
\end{array}
Initial program 72.9%
Simplified73.2%
Taylor expanded in h around -inf 48.4%
associate-*r*48.4%
neg-mul-148.4%
sub-neg48.4%
distribute-lft-in48.4%
Simplified74.5%
Final simplification74.5%
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 (* (sqrt (/ d l)) (* (sqrt (/ d h)) (+ 1.0 (* h (* (pow (* D (/ M_m d)) 2.0) (/ -0.125 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 sqrt((d / l)) * (sqrt((d / h)) * (1.0 + (h * (pow((D * (M_m / d)), 2.0) * (-0.125 / 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 = sqrt((d / l)) * (sqrt((d / h)) * (1.0d0 + (h * (((d_1 * (m_m / d)) ** 2.0d0) * ((-0.125d0) / 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 Math.sqrt((d / l)) * (Math.sqrt((d / h)) * (1.0 + (h * (Math.pow((D * (M_m / d)), 2.0) * (-0.125 / 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 math.sqrt((d / l)) * (math.sqrt((d / h)) * (1.0 + (h * (math.pow((D * (M_m / d)), 2.0) * (-0.125 / 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(sqrt(Float64(d / l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(h * Float64((Float64(D * Float64(M_m / d)) ^ 2.0) * Float64(-0.125 / 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 = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + (h * (((D * (M_m / d)) ^ 2.0) * (-0.125 / 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[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(h * N[(N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.125 / l), $MachinePrecision]), $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])\\
\\
\sqrt{\frac{d}{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + h \cdot \left({\left(D \cdot \frac{M\_m}{d}\right)}^{2} \cdot \frac{-0.125}{\ell}\right)\right)\right)
\end{array}
Initial program 72.9%
Simplified73.1%
associate-*r/72.9%
div-inv72.9%
metadata-eval72.9%
Applied egg-rr72.9%
associate-*l/74.5%
*-commutative74.5%
associate-*l/74.1%
*-commutative74.1%
*-commutative74.1%
associate-*r*74.1%
unpow-prod-down74.1%
metadata-eval74.1%
Applied egg-rr74.1%
associate-/l*74.5%
associate-*r*74.5%
metadata-eval74.5%
associate-*r/74.2%
Applied egg-rr74.2%
Taylor expanded in M around 0 48.4%
*-commutative48.4%
times-frac48.5%
associate-*r/50.2%
unpow250.2%
unpow250.2%
times-frac62.8%
unpow262.8%
swap-sqr74.5%
*-commutative74.5%
*-commutative74.5%
unpow274.5%
associate-*l/74.5%
associate-/l*74.5%
associate-*r/74.2%
*-commutative74.2%
associate-/l*74.4%
Simplified74.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
(let* ((t_0 (* (pow (* D (/ M_m d)) 2.0) -0.125)))
(if (<= l -2.6e-229)
(* (* d (sqrt (/ 1.0 (* h l)))) (- -1.0 (* (/ h l) t_0)))
(* (sqrt (* (/ d h) (/ d l))) (+ 1.0 (/ (* h t_0) 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) {
double t_0 = pow((D * (M_m / d)), 2.0) * -0.125;
double tmp;
if (l <= -2.6e-229) {
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h / l) * t_0));
} else {
tmp = sqrt(((d / h) * (d / l))) * (1.0 + ((h * t_0) / l));
}
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 * (m_m / d)) ** 2.0d0) * (-0.125d0)
if (l <= (-2.6d-229)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((-1.0d0) - ((h / l) * t_0))
else
tmp = sqrt(((d / h) * (d / l))) * (1.0d0 + ((h * t_0) / l))
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 * (M_m / d)), 2.0) * -0.125;
double tmp;
if (l <= -2.6e-229) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h / l) * t_0));
} else {
tmp = Math.sqrt(((d / h) * (d / l))) * (1.0 + ((h * t_0) / l));
}
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 * (M_m / d)), 2.0) * -0.125 tmp = 0 if l <= -2.6e-229: tmp = (d * math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h / l) * t_0)) else: tmp = math.sqrt(((d / h) * (d / l))) * (1.0 + ((h * t_0) / l)) 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 * Float64(M_m / d)) ^ 2.0) * -0.125) tmp = 0.0 if (l <= -2.6e-229) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(-1.0 - Float64(Float64(h / l) * t_0))); else tmp = Float64(sqrt(Float64(Float64(d / h) * Float64(d / l))) * Float64(1.0 + Float64(Float64(h * t_0) / l))); 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 * (M_m / d)) ^ 2.0) * -0.125;
tmp = 0.0;
if (l <= -2.6e-229)
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h / l) * t_0));
else
tmp = sqrt(((d / h) * (d / l))) * (1.0 + ((h * t_0) / l));
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[(N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.125), $MachinePrecision]}, If[LessEqual[l, -2.6e-229], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 - N[(N[(h / l), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h * t$95$0), $MachinePrecision] / l), $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 \frac{M\_m}{d}\right)}^{2} \cdot -0.125\\
\mathbf{if}\;\ell \leq -2.6 \cdot 10^{-229}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(-1 - \frac{h}{\ell} \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}} \cdot \left(1 + \frac{h \cdot t\_0}{\ell}\right)\\
\end{array}
\end{array}
if l < -2.6000000000000001e-229Initial program 74.6%
Simplified75.3%
add-sqr-sqrt75.3%
pow275.3%
sqrt-prod75.3%
sqrt-pow176.0%
metadata-eval76.0%
pow176.0%
*-commutative76.0%
div-inv76.0%
metadata-eval76.0%
Applied egg-rr76.0%
pow176.0%
Applied egg-rr57.1%
unpow157.1%
*-commutative57.1%
associate-*r*57.1%
*-commutative57.1%
associate-*r*57.1%
associate-*r*57.1%
metadata-eval57.1%
associate-*r/55.6%
*-commutative55.6%
associate-*r/56.1%
Simplified56.1%
Taylor expanded in d around -inf 73.5%
if -2.6000000000000001e-229 < l Initial program 71.3%
Simplified71.2%
add-sqr-sqrt71.2%
pow271.2%
sqrt-prod71.2%
sqrt-pow172.0%
metadata-eval72.0%
pow172.0%
*-commutative72.0%
div-inv72.0%
metadata-eval72.0%
Applied egg-rr72.0%
pow172.0%
Applied egg-rr60.2%
unpow160.2%
*-commutative60.2%
associate-*r*60.2%
*-commutative60.2%
associate-*r*60.2%
associate-*r*60.2%
metadata-eval60.2%
associate-*r/60.3%
*-commutative60.3%
associate-*r/60.3%
Simplified60.3%
associate-*l/62.7%
*-commutative62.7%
Applied egg-rr62.7%
Final simplification68.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 (<= M_m 4.6e-207)
(* (sqrt (/ d h)) (sqrt (/ d l)))
(*
(sqrt (* (/ d h) (/ d l)))
(+ 1.0 (/ (* h (* (pow (* D (/ M_m d)) 2.0) -0.125)) 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) {
double tmp;
if (M_m <= 4.6e-207) {
tmp = sqrt((d / h)) * sqrt((d / l));
} else {
tmp = sqrt(((d / h) * (d / l))) * (1.0 + ((h * (pow((D * (M_m / d)), 2.0) * -0.125)) / l));
}
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 (m_m <= 4.6d-207) then
tmp = sqrt((d / h)) * sqrt((d / l))
else
tmp = sqrt(((d / h) * (d / l))) * (1.0d0 + ((h * (((d_1 * (m_m / d)) ** 2.0d0) * (-0.125d0))) / l))
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 (M_m <= 4.6e-207) {
tmp = Math.sqrt((d / h)) * Math.sqrt((d / l));
} else {
tmp = Math.sqrt(((d / h) * (d / l))) * (1.0 + ((h * (Math.pow((D * (M_m / d)), 2.0) * -0.125)) / l));
}
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 M_m <= 4.6e-207: tmp = math.sqrt((d / h)) * math.sqrt((d / l)) else: tmp = math.sqrt(((d / h) * (d / l))) * (1.0 + ((h * (math.pow((D * (M_m / d)), 2.0) * -0.125)) / l)) 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 (M_m <= 4.6e-207) tmp = Float64(sqrt(Float64(d / h)) * sqrt(Float64(d / l))); else tmp = Float64(sqrt(Float64(Float64(d / h) * Float64(d / l))) * Float64(1.0 + Float64(Float64(h * Float64((Float64(D * Float64(M_m / d)) ^ 2.0) * -0.125)) / l))); 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 (M_m <= 4.6e-207)
tmp = sqrt((d / h)) * sqrt((d / l));
else
tmp = sqrt(((d / h) * (d / l))) * (1.0 + ((h * (((D * (M_m / d)) ^ 2.0) * -0.125)) / l));
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[M$95$m, 4.6e-207], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h * N[(N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision] / l), $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}\;M\_m \leq 4.6 \cdot 10^{-207}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \sqrt{\frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}} \cdot \left(1 + \frac{h \cdot \left({\left(D \cdot \frac{M\_m}{d}\right)}^{2} \cdot -0.125\right)}{\ell}\right)\\
\end{array}
\end{array}
if M < 4.6000000000000001e-207Initial program 70.8%
Simplified71.4%
Taylor expanded in d around inf 43.8%
if 4.6000000000000001e-207 < M Initial program 75.6%
Simplified75.6%
add-sqr-sqrt75.6%
pow275.6%
sqrt-prod75.6%
sqrt-pow175.6%
metadata-eval75.6%
pow175.6%
*-commutative75.6%
div-inv75.6%
metadata-eval75.6%
Applied egg-rr75.6%
pow175.6%
Applied egg-rr61.0%
unpow161.0%
*-commutative61.0%
associate-*r*61.0%
*-commutative61.0%
associate-*r*61.0%
associate-*r*61.0%
metadata-eval61.0%
associate-*r/61.0%
*-commutative61.0%
associate-*r/60.1%
Simplified60.1%
associate-*l/61.1%
*-commutative61.1%
Applied egg-rr61.1%
Final simplification51.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 (<= M_m 5.5e-209)
(* (sqrt (/ d h)) (sqrt (/ d l)))
(*
(+ 1.0 (* (/ h l) (* (pow (* D (/ M_m d)) 2.0) -0.125)))
(sqrt (* (/ d h) (/ d 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) {
double tmp;
if (M_m <= 5.5e-209) {
tmp = sqrt((d / h)) * sqrt((d / l));
} else {
tmp = (1.0 + ((h / l) * (pow((D * (M_m / d)), 2.0) * -0.125))) * sqrt(((d / h) * (d / l)));
}
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 (m_m <= 5.5d-209) then
tmp = sqrt((d / h)) * sqrt((d / l))
else
tmp = (1.0d0 + ((h / l) * (((d_1 * (m_m / d)) ** 2.0d0) * (-0.125d0)))) * sqrt(((d / h) * (d / l)))
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 (M_m <= 5.5e-209) {
tmp = Math.sqrt((d / h)) * Math.sqrt((d / l));
} else {
tmp = (1.0 + ((h / l) * (Math.pow((D * (M_m / d)), 2.0) * -0.125))) * Math.sqrt(((d / h) * (d / l)));
}
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 M_m <= 5.5e-209: tmp = math.sqrt((d / h)) * math.sqrt((d / l)) else: tmp = (1.0 + ((h / l) * (math.pow((D * (M_m / d)), 2.0) * -0.125))) * math.sqrt(((d / h) * (d / l))) 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 (M_m <= 5.5e-209) tmp = Float64(sqrt(Float64(d / h)) * sqrt(Float64(d / l))); else tmp = Float64(Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D * Float64(M_m / d)) ^ 2.0) * -0.125))) * sqrt(Float64(Float64(d / h) * Float64(d / l)))); 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 (M_m <= 5.5e-209)
tmp = sqrt((d / h)) * sqrt((d / l));
else
tmp = (1.0 + ((h / l) * (((D * (M_m / d)) ^ 2.0) * -0.125))) * sqrt(((d / h) * (d / l)));
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[M$95$m, 5.5e-209], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / 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])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 5.5 \cdot 10^{-209}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \sqrt{\frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \frac{h}{\ell} \cdot \left({\left(D \cdot \frac{M\_m}{d}\right)}^{2} \cdot -0.125\right)\right) \cdot \sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\end{array}
\end{array}
if M < 5.5000000000000001e-209Initial program 70.8%
Simplified71.4%
Taylor expanded in d around inf 43.8%
if 5.5000000000000001e-209 < M Initial program 75.6%
Simplified75.6%
add-sqr-sqrt75.6%
pow275.6%
sqrt-prod75.6%
sqrt-pow175.6%
metadata-eval75.6%
pow175.6%
*-commutative75.6%
div-inv75.6%
metadata-eval75.6%
Applied egg-rr75.6%
pow175.6%
Applied egg-rr61.0%
unpow161.0%
*-commutative61.0%
associate-*r*61.0%
*-commutative61.0%
associate-*r*61.0%
associate-*r*61.0%
metadata-eval61.0%
associate-*r/61.0%
*-commutative61.0%
associate-*r/60.1%
Simplified60.1%
Final simplification50.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 -2e-182)
(* (- d) (pow (* h l) -0.5))
(if (<= l -1.85e-291)
(* d (pow (/ 1.0 (pow (* h l) 3.0)) 0.16666666666666666))
(if (<= l 1.65e-215)
(* d (- (sqrt (/ 1.0 (* h l)))))
(* d (/ (pow h -0.5) (sqrt 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) {
double tmp;
if (l <= -2e-182) {
tmp = -d * pow((h * l), -0.5);
} else if (l <= -1.85e-291) {
tmp = d * pow((1.0 / pow((h * l), 3.0)), 0.16666666666666666);
} else if (l <= 1.65e-215) {
tmp = d * -sqrt((1.0 / (h * l)));
} else {
tmp = d * (pow(h, -0.5) / sqrt(l));
}
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 <= (-2d-182)) then
tmp = -d * ((h * l) ** (-0.5d0))
else if (l <= (-1.85d-291)) then
tmp = d * ((1.0d0 / ((h * l) ** 3.0d0)) ** 0.16666666666666666d0)
else if (l <= 1.65d-215) then
tmp = d * -sqrt((1.0d0 / (h * l)))
else
tmp = d * ((h ** (-0.5d0)) / sqrt(l))
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 <= -2e-182) {
tmp = -d * Math.pow((h * l), -0.5);
} else if (l <= -1.85e-291) {
tmp = d * Math.pow((1.0 / Math.pow((h * l), 3.0)), 0.16666666666666666);
} else if (l <= 1.65e-215) {
tmp = d * -Math.sqrt((1.0 / (h * l)));
} else {
tmp = d * (Math.pow(h, -0.5) / Math.sqrt(l));
}
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 <= -2e-182: tmp = -d * math.pow((h * l), -0.5) elif l <= -1.85e-291: tmp = d * math.pow((1.0 / math.pow((h * l), 3.0)), 0.16666666666666666) elif l <= 1.65e-215: tmp = d * -math.sqrt((1.0 / (h * l))) else: tmp = d * (math.pow(h, -0.5) / math.sqrt(l)) 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 <= -2e-182) tmp = Float64(Float64(-d) * (Float64(h * l) ^ -0.5)); elseif (l <= -1.85e-291) tmp = Float64(d * (Float64(1.0 / (Float64(h * l) ^ 3.0)) ^ 0.16666666666666666)); elseif (l <= 1.65e-215) tmp = Float64(d * Float64(-sqrt(Float64(1.0 / Float64(h * l))))); else tmp = Float64(d * Float64((h ^ -0.5) / sqrt(l))); 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 <= -2e-182)
tmp = -d * ((h * l) ^ -0.5);
elseif (l <= -1.85e-291)
tmp = d * ((1.0 / ((h * l) ^ 3.0)) ^ 0.16666666666666666);
elseif (l <= 1.65e-215)
tmp = d * -sqrt((1.0 / (h * l)));
else
tmp = d * ((h ^ -0.5) / sqrt(l));
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, -2e-182], N[((-d) * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -1.85e-291], N[(d * N[Power[N[(1.0 / N[Power[N[(h * l), $MachinePrecision], 3.0], $MachinePrecision]), $MachinePrecision], 0.16666666666666666], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.65e-215], N[(d * (-N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(d * N[(N[Power[h, -0.5], $MachinePrecision] / N[Sqrt[l], $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 -2 \cdot 10^{-182}:\\
\;\;\;\;\left(-d\right) \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq -1.85 \cdot 10^{-291}:\\
\;\;\;\;d \cdot {\left(\frac{1}{{\left(h \cdot \ell\right)}^{3}}\right)}^{0.16666666666666666}\\
\mathbf{elif}\;\ell \leq 1.65 \cdot 10^{-215}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{1}{h \cdot \ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{{h}^{-0.5}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -2.0000000000000001e-182Initial program 75.5%
Simplified76.2%
Taylor expanded in d around inf 6.9%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
unpow1/20.0%
associate-/r*0.0%
rem-exp-log0.0%
exp-neg0.0%
exp-prod0.0%
distribute-lft-neg-out0.0%
distribute-rgt-neg-in0.0%
metadata-eval0.0%
exp-to-pow0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt55.1%
mul-1-neg55.1%
Simplified55.1%
if -2.0000000000000001e-182 < l < -1.85e-291Initial program 75.2%
Simplified75.2%
add-sqr-sqrt75.2%
pow275.2%
sqrt-prod75.2%
sqrt-pow175.2%
metadata-eval75.2%
pow175.2%
*-commutative75.2%
div-inv75.2%
metadata-eval75.2%
Applied egg-rr75.2%
Taylor expanded in d around inf 24.1%
associate-/r*24.1%
associate-/l/24.1%
associate-/r*24.1%
Simplified24.1%
pow1/224.1%
associate-/l/24.1%
inv-pow24.1%
pow-prod-down24.1%
inv-pow24.1%
inv-pow24.1%
div-inv24.1%
metadata-eval24.1%
pow-pow38.7%
sqr-pow38.7%
pow-prod-down53.1%
pow-prod-up53.1%
div-inv53.1%
inv-pow53.1%
inv-pow53.1%
pow-prod-down53.1%
inv-pow53.1%
metadata-eval53.1%
metadata-eval53.1%
Applied egg-rr53.1%
cube-div53.1%
metadata-eval53.1%
Simplified53.1%
if -1.85e-291 < l < 1.6499999999999999e-215Initial program 72.5%
Simplified72.5%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt45.7%
neg-mul-145.7%
Simplified45.7%
if 1.6499999999999999e-215 < l Initial program 69.3%
Simplified69.3%
add-sqr-sqrt69.2%
pow269.2%
sqrt-prod69.2%
sqrt-pow170.3%
metadata-eval70.3%
pow170.3%
*-commutative70.3%
div-inv70.3%
metadata-eval70.3%
Applied egg-rr70.3%
Taylor expanded in d around inf 44.3%
associate-/r*44.4%
associate-/l/44.3%
associate-/r*44.4%
Simplified44.4%
associate-/l/44.3%
inv-pow44.3%
pow-prod-down44.4%
inv-pow44.4%
inv-pow44.4%
div-inv44.4%
sqrt-div50.4%
inv-pow50.4%
sqrt-pow150.4%
metadata-eval50.4%
Applied egg-rr50.4%
Final simplification52.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 (if (<= l 5.4e-216) (* (- d) (pow (* h l) -0.5)) (* d (/ (pow h -0.5) (sqrt 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) {
double tmp;
if (l <= 5.4e-216) {
tmp = -d * pow((h * l), -0.5);
} else {
tmp = d * (pow(h, -0.5) / sqrt(l));
}
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 <= 5.4d-216) then
tmp = -d * ((h * l) ** (-0.5d0))
else
tmp = d * ((h ** (-0.5d0)) / sqrt(l))
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 <= 5.4e-216) {
tmp = -d * Math.pow((h * l), -0.5);
} else {
tmp = d * (Math.pow(h, -0.5) / Math.sqrt(l));
}
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 <= 5.4e-216: tmp = -d * math.pow((h * l), -0.5) else: tmp = d * (math.pow(h, -0.5) / math.sqrt(l)) 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 <= 5.4e-216) tmp = Float64(Float64(-d) * (Float64(h * l) ^ -0.5)); else tmp = Float64(d * Float64((h ^ -0.5) / sqrt(l))); 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 <= 5.4e-216)
tmp = -d * ((h * l) ^ -0.5);
else
tmp = d * ((h ^ -0.5) / sqrt(l));
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, 5.4e-216], N[((-d) * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[h, -0.5], $MachinePrecision] / N[Sqrt[l], $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.4 \cdot 10^{-216}:\\
\;\;\;\;\left(-d\right) \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{{h}^{-0.5}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < 5.3999999999999998e-216Initial program 75.0%
Simplified75.5%
Taylor expanded in d around inf 11.3%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
unpow1/20.0%
associate-/r*0.0%
rem-exp-log0.0%
exp-neg0.0%
exp-prod0.0%
distribute-lft-neg-out0.0%
distribute-rgt-neg-in0.0%
metadata-eval0.0%
exp-to-pow0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt46.8%
mul-1-neg46.8%
Simplified46.8%
if 5.3999999999999998e-216 < l Initial program 69.3%
Simplified69.3%
add-sqr-sqrt69.2%
pow269.2%
sqrt-prod69.2%
sqrt-pow170.3%
metadata-eval70.3%
pow170.3%
*-commutative70.3%
div-inv70.3%
metadata-eval70.3%
Applied egg-rr70.3%
Taylor expanded in d around inf 44.3%
associate-/r*44.4%
associate-/l/44.3%
associate-/r*44.4%
Simplified44.4%
associate-/l/44.3%
inv-pow44.3%
pow-prod-down44.4%
inv-pow44.4%
inv-pow44.4%
div-inv44.4%
sqrt-div50.4%
inv-pow50.4%
sqrt-pow150.4%
metadata-eval50.4%
Applied egg-rr50.4%
Final simplification48.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 (<= l 5.4e-216) (* (- d) (pow (* h l) -0.5)) (* d (sqrt (/ (/ 1.0 l) 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 <= 5.4e-216) {
tmp = -d * pow((h * l), -0.5);
} else {
tmp = d * sqrt(((1.0 / l) / 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 <= 5.4d-216) then
tmp = -d * ((h * l) ** (-0.5d0))
else
tmp = d * sqrt(((1.0d0 / l) / 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 <= 5.4e-216) {
tmp = -d * Math.pow((h * l), -0.5);
} else {
tmp = d * Math.sqrt(((1.0 / l) / 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 <= 5.4e-216: tmp = -d * math.pow((h * l), -0.5) else: tmp = d * math.sqrt(((1.0 / l) / 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 <= 5.4e-216) tmp = Float64(Float64(-d) * (Float64(h * l) ^ -0.5)); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / l) / 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 <= 5.4e-216)
tmp = -d * ((h * l) ^ -0.5);
else
tmp = d * sqrt(((1.0 / l) / 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, 5.4e-216], N[((-d) * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / 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.4 \cdot 10^{-216}:\\
\;\;\;\;\left(-d\right) \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\end{array}
\end{array}
if l < 5.3999999999999998e-216Initial program 75.0%
Simplified75.5%
Taylor expanded in d around inf 11.3%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
unpow1/20.0%
associate-/r*0.0%
rem-exp-log0.0%
exp-neg0.0%
exp-prod0.0%
distribute-lft-neg-out0.0%
distribute-rgt-neg-in0.0%
metadata-eval0.0%
exp-to-pow0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt46.8%
mul-1-neg46.8%
Simplified46.8%
if 5.3999999999999998e-216 < l Initial program 69.3%
Simplified69.3%
add-sqr-sqrt69.2%
pow269.2%
sqrt-prod69.2%
sqrt-pow170.3%
metadata-eval70.3%
pow170.3%
*-commutative70.3%
div-inv70.3%
metadata-eval70.3%
Applied egg-rr70.3%
Taylor expanded in d around inf 44.3%
associate-/r*44.4%
associate-/l/44.3%
associate-/r*44.4%
Simplified44.4%
Final simplification45.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 (* 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 72.9%
Simplified73.2%
add-sqr-sqrt73.2%
pow273.2%
sqrt-prod73.2%
sqrt-pow174.0%
metadata-eval74.0%
pow174.0%
*-commutative74.0%
div-inv74.0%
metadata-eval74.0%
Applied egg-rr74.0%
Taylor expanded in d around inf 23.3%
associate-/r*23.3%
unpow1/223.3%
associate-/r*23.3%
rem-exp-log22.5%
exp-neg22.5%
exp-prod22.5%
distribute-lft-neg-out22.5%
distribute-rgt-neg-in22.5%
metadata-eval22.5%
exp-to-pow23.3%
Simplified23.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 (/ d (sqrt (* 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((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((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((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((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(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((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[(h * l), $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])\\
\\
\frac{d}{\sqrt{h \cdot \ell}}
\end{array}
Initial program 72.9%
Simplified73.2%
add-sqr-sqrt73.2%
pow273.2%
sqrt-prod73.2%
sqrt-pow174.0%
metadata-eval74.0%
pow174.0%
*-commutative74.0%
div-inv74.0%
metadata-eval74.0%
Applied egg-rr74.0%
Taylor expanded in d around inf 23.3%
associate-/r*23.3%
associate-/l/23.3%
associate-/r*23.3%
Simplified23.3%
pow123.3%
associate-/l/23.3%
sqrt-div23.3%
metadata-eval23.3%
Applied egg-rr23.3%
unpow123.3%
associate-*r/23.3%
*-rgt-identity23.3%
Simplified23.3%
herbie shell --seed 2024147
(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)))))