
(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
(let* ((t_0 (sqrt (- d))))
(if (<= l -5e-310)
(*
(/ t_0 (sqrt (- l)))
(*
(/ t_0 (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* D (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(*
(/ d (* (sqrt l) (sqrt h)))
(- 1.0 (* (/ h l) (* 0.5 (pow (* (/ M_m d) (/ D 2.0)) 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 t_0 = sqrt(-d);
double tmp;
if (l <= -5e-310) {
tmp = (t_0 / sqrt(-l)) * ((t_0 / sqrt(-h)) * (1.0 + ((h / l) * (pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else {
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0 - ((h / l) * (0.5 * pow(((M_m / d) * (D / 2.0)), 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) :: t_0
real(8) :: tmp
t_0 = sqrt(-d)
if (l <= (-5d-310)) then
tmp = (t_0 / sqrt(-l)) * ((t_0 / sqrt(-h)) * (1.0d0 + ((h / l) * (((d_1 * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))))
else
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0d0 - ((h / l) * (0.5d0 * (((m_m / d) * (d_1 / 2.0d0)) ** 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 t_0 = Math.sqrt(-d);
double tmp;
if (l <= -5e-310) {
tmp = (t_0 / Math.sqrt(-l)) * ((t_0 / Math.sqrt(-h)) * (1.0 + ((h / l) * (Math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else {
tmp = (d / (Math.sqrt(l) * Math.sqrt(h))) * (1.0 - ((h / l) * (0.5 * Math.pow(((M_m / d) * (D / 2.0)), 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): t_0 = math.sqrt(-d) tmp = 0 if l <= -5e-310: tmp = (t_0 / math.sqrt(-l)) * ((t_0 / math.sqrt(-h)) * (1.0 + ((h / l) * (math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5)))) else: tmp = (d / (math.sqrt(l) * math.sqrt(h))) * (1.0 - ((h / l) * (0.5 * math.pow(((M_m / d) * (D / 2.0)), 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) t_0 = sqrt(Float64(-d)) tmp = 0.0 if (l <= -5e-310) tmp = Float64(Float64(t_0 / sqrt(Float64(-l))) * Float64(Float64(t_0 / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))))); else tmp = Float64(Float64(d / Float64(sqrt(l) * sqrt(h))) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(M_m / d) * Float64(D / 2.0)) ^ 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)
t_0 = sqrt(-d);
tmp = 0.0;
if (l <= -5e-310)
tmp = (t_0 / sqrt(-l)) * ((t_0 / sqrt(-h)) * (1.0 + ((h / l) * (((D * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))));
else
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0 - ((h / l) * (0.5 * (((M_m / d) * (D / 2.0)) ^ 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_] := Block[{t$95$0 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[l, -5e-310], N[(N[(t$95$0 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D / 2.0), $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}
t_0 := \sqrt{-d}\\
\mathbf{if}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{t\_0}{\sqrt{-\ell}} \cdot \left(\frac{t\_0}{\sqrt{-h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(D \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}} \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{M\_m}{d} \cdot \frac{D}{2}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if l < -4.999999999999985e-310Initial program 69.5%
Simplified67.5%
frac-2neg67.5%
sqrt-div78.5%
Applied egg-rr78.5%
frac-2neg78.5%
sqrt-div82.2%
Applied egg-rr82.2%
if -4.999999999999985e-310 < l Initial program 64.4%
pow164.4%
Applied egg-rr81.0%
Final simplification81.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 (<= d -1.46e+251)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= d -4.2e-233)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* 0.5 (/ (* h (pow (* (/ M_m d) (/ D 2.0)) 2.0)) l))))
(if (<= d -5e-310)
(*
(sqrt (/ h (pow l 3.0)))
(* -0.125 (* (pow D 2.0) (* (pow M_m 2.0) (/ -1.0 d)))))
(*
d
(/
(fma (pow (* M_m (/ D (* d 2.0))) 2.0) (* (/ h l) -0.5) 1.0)
(* (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 (d <= -1.46e+251) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (d <= -4.2e-233) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h * pow(((M_m / d) * (D / 2.0)), 2.0)) / l)));
} else if (d <= -5e-310) {
tmp = sqrt((h / pow(l, 3.0))) * (-0.125 * (pow(D, 2.0) * (pow(M_m, 2.0) * (-1.0 / d))));
} else {
tmp = d * (fma(pow((M_m * (D / (d * 2.0))), 2.0), ((h / l) * -0.5), 1.0) / (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 (d <= -1.46e+251) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (d <= -4.2e-233) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h * (Float64(Float64(M_m / d) * Float64(D / 2.0)) ^ 2.0)) / l)))); elseif (d <= -5e-310) tmp = Float64(sqrt(Float64(h / (l ^ 3.0))) * Float64(-0.125 * Float64((D ^ 2.0) * Float64((M_m ^ 2.0) * Float64(-1.0 / d))))); else tmp = Float64(d * Float64(fma((Float64(M_m * Float64(D / Float64(d * 2.0))) ^ 2.0), Float64(Float64(h / l) * -0.5), 1.0) / Float64(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[d, -1.46e+251], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -4.2e-233], 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[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -5e-310], 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] * N[(-1.0 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(N[Power[N[(M$95$m * N[(D / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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.46 \cdot 10^{+251}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;d \leq -4.2 \cdot 10^{-233}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \frac{h \cdot {\left(\frac{M\_m}{d} \cdot \frac{D}{2}\right)}^{2}}{\ell}\right)\\
\mathbf{elif}\;d \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{h}{{\ell}^{3}}} \cdot \left(-0.125 \cdot \left({D}^{2} \cdot \left({M\_m}^{2} \cdot \frac{-1}{d}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left({\left(M\_m \cdot \frac{D}{d \cdot 2}\right)}^{2}, \frac{h}{\ell} \cdot -0.5, 1\right)}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if d < -1.4600000000000001e251Initial program 53.2%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt92.0%
neg-mul-192.0%
Simplified92.0%
if -1.4600000000000001e251 < d < -4.1999999999999997e-233Initial program 78.0%
Simplified78.0%
associate-*r/82.2%
frac-times82.3%
*-commutative82.3%
times-frac80.2%
Applied egg-rr80.2%
if -4.1999999999999997e-233 < d < -4.999999999999985e-310Initial program 40.5%
Taylor expanded in h around -inf 0.0%
associate-*r*0.0%
*-commutative0.0%
associate-/l*0.0%
unpow20.0%
rem-square-sqrt63.2%
associate-/l*63.2%
Simplified63.2%
if -4.999999999999985e-310 < d Initial program 64.4%
pow164.4%
Applied egg-rr81.0%
unpow181.0%
associate-*l/81.9%
associate-/l*81.7%
Simplified82.5%
Final simplification80.8%
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 (* (/ M_m d) (/ D 2.0)) 2.0)))
(if (<= d -3.1e+251)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= d -1e-236)
(* (* (sqrt (/ d l)) (sqrt (/ d h))) (- 1.0 (* 0.5 (/ (* h t_0) l))))
(if (<= d -5e-310)
(*
(sqrt (/ h (pow l 3.0)))
(* -0.125 (* (pow D 2.0) (* (pow M_m 2.0) (/ -1.0 d)))))
(* (- 1.0 (* (/ h l) (* 0.5 t_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 t_0 = pow(((M_m / d) * (D / 2.0)), 2.0);
double tmp;
if (d <= -3.1e+251) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (d <= -1e-236) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l)));
} else if (d <= -5e-310) {
tmp = sqrt((h / pow(l, 3.0))) * (-0.125 * (pow(D, 2.0) * (pow(M_m, 2.0) * (-1.0 / d))));
} else {
tmp = (1.0 - ((h / l) * (0.5 * t_0))) * ((d / sqrt(l)) / 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 = ((m_m / d) * (d_1 / 2.0d0)) ** 2.0d0
if (d <= (-3.1d+251)) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else if (d <= (-1d-236)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (0.5d0 * ((h * t_0) / l)))
else if (d <= (-5d-310)) then
tmp = sqrt((h / (l ** 3.0d0))) * ((-0.125d0) * ((d_1 ** 2.0d0) * ((m_m ** 2.0d0) * ((-1.0d0) / d))))
else
tmp = (1.0d0 - ((h / l) * (0.5d0 * t_0))) * ((d / sqrt(l)) / 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 = Math.pow(((M_m / d) * (D / 2.0)), 2.0);
double tmp;
if (d <= -3.1e+251) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else if (d <= -1e-236) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l)));
} else if (d <= -5e-310) {
tmp = Math.sqrt((h / Math.pow(l, 3.0))) * (-0.125 * (Math.pow(D, 2.0) * (Math.pow(M_m, 2.0) * (-1.0 / d))));
} else {
tmp = (1.0 - ((h / l) * (0.5 * t_0))) * ((d / Math.sqrt(l)) / 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 = math.pow(((M_m / d) * (D / 2.0)), 2.0) tmp = 0 if d <= -3.1e+251: tmp = -d * math.sqrt(((1.0 / h) / l)) elif d <= -1e-236: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l))) elif d <= -5e-310: tmp = math.sqrt((h / math.pow(l, 3.0))) * (-0.125 * (math.pow(D, 2.0) * (math.pow(M_m, 2.0) * (-1.0 / d)))) else: tmp = (1.0 - ((h / l) * (0.5 * t_0))) * ((d / math.sqrt(l)) / 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(M_m / d) * Float64(D / 2.0)) ^ 2.0 tmp = 0.0 if (d <= -3.1e+251) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (d <= -1e-236) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h * t_0) / l)))); elseif (d <= -5e-310) tmp = Float64(sqrt(Float64(h / (l ^ 3.0))) * Float64(-0.125 * Float64((D ^ 2.0) * Float64((M_m ^ 2.0) * Float64(-1.0 / d))))); else tmp = Float64(Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * t_0))) * Float64(Float64(d / sqrt(l)) / 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 = ((M_m / d) * (D / 2.0)) ^ 2.0;
tmp = 0.0;
if (d <= -3.1e+251)
tmp = -d * sqrt(((1.0 / h) / l));
elseif (d <= -1e-236)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l)));
elseif (d <= -5e-310)
tmp = sqrt((h / (l ^ 3.0))) * (-0.125 * ((D ^ 2.0) * ((M_m ^ 2.0) * (-1.0 / d))));
else
tmp = (1.0 - ((h / l) * (0.5 * t_0))) * ((d / sqrt(l)) / 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[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[d, -3.1e+251], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -1e-236], 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 * t$95$0), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -5e-310], 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] * N[(-1.0 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * t$95$0), $MachinePrecision]), $MachinePrecision]), $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}
t_0 := {\left(\frac{M\_m}{d} \cdot \frac{D}{2}\right)}^{2}\\
\mathbf{if}\;d \leq -3.1 \cdot 10^{+251}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;d \leq -1 \cdot 10^{-236}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \frac{h \cdot t\_0}{\ell}\right)\\
\mathbf{elif}\;d \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{h}{{\ell}^{3}}} \cdot \left(-0.125 \cdot \left({D}^{2} \cdot \left({M\_m}^{2} \cdot \frac{-1}{d}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot t\_0\right)\right) \cdot \frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if d < -3.0999999999999998e251Initial program 53.2%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt92.0%
neg-mul-192.0%
Simplified92.0%
if -3.0999999999999998e251 < d < -1e-236Initial program 78.0%
Simplified78.0%
associate-*r/82.2%
frac-times82.3%
*-commutative82.3%
times-frac80.2%
Applied egg-rr80.2%
if -1e-236 < d < -4.999999999999985e-310Initial program 40.5%
Taylor expanded in h around -inf 0.0%
associate-*r*0.0%
*-commutative0.0%
associate-/l*0.0%
unpow20.0%
rem-square-sqrt63.2%
associate-/l*63.2%
Simplified63.2%
if -4.999999999999985e-310 < d Initial program 64.4%
pow164.4%
Applied egg-rr81.0%
unpow181.0%
associate-/r*79.9%
Simplified79.9%
Final simplification79.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 (pow (* (/ M_m d) (/ D 2.0)) 2.0)))
(if (<= d -1.35e+251)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= d -5.8e-235)
(* (* (sqrt (/ d l)) (sqrt (/ d h))) (- 1.0 (* 0.5 (/ (* h t_0) l))))
(if (<= d -5e-310)
(*
(sqrt (/ h (pow l 3.0)))
(* -0.125 (* (pow D 2.0) (* (pow M_m 2.0) (/ -1.0 d)))))
(* (/ d (* (sqrt l) (sqrt h))) (- 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(((M_m / d) * (D / 2.0)), 2.0);
double tmp;
if (d <= -1.35e+251) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (d <= -5.8e-235) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l)));
} else if (d <= -5e-310) {
tmp = sqrt((h / pow(l, 3.0))) * (-0.125 * (pow(D, 2.0) * (pow(M_m, 2.0) * (-1.0 / d))));
} else {
tmp = (d / (sqrt(l) * sqrt(h))) * (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 = ((m_m / d) * (d_1 / 2.0d0)) ** 2.0d0
if (d <= (-1.35d+251)) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else if (d <= (-5.8d-235)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (0.5d0 * ((h * t_0) / l)))
else if (d <= (-5d-310)) then
tmp = sqrt((h / (l ** 3.0d0))) * ((-0.125d0) * ((d_1 ** 2.0d0) * ((m_m ** 2.0d0) * ((-1.0d0) / d))))
else
tmp = (d / (sqrt(l) * sqrt(h))) * (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(((M_m / d) * (D / 2.0)), 2.0);
double tmp;
if (d <= -1.35e+251) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else if (d <= -5.8e-235) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l)));
} else if (d <= -5e-310) {
tmp = Math.sqrt((h / Math.pow(l, 3.0))) * (-0.125 * (Math.pow(D, 2.0) * (Math.pow(M_m, 2.0) * (-1.0 / d))));
} else {
tmp = (d / (Math.sqrt(l) * Math.sqrt(h))) * (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(((M_m / d) * (D / 2.0)), 2.0) tmp = 0 if d <= -1.35e+251: tmp = -d * math.sqrt(((1.0 / h) / l)) elif d <= -5.8e-235: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l))) elif d <= -5e-310: tmp = math.sqrt((h / math.pow(l, 3.0))) * (-0.125 * (math.pow(D, 2.0) * (math.pow(M_m, 2.0) * (-1.0 / d)))) else: tmp = (d / (math.sqrt(l) * math.sqrt(h))) * (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(Float64(M_m / d) * Float64(D / 2.0)) ^ 2.0 tmp = 0.0 if (d <= -1.35e+251) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (d <= -5.8e-235) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h * t_0) / l)))); elseif (d <= -5e-310) tmp = Float64(sqrt(Float64(h / (l ^ 3.0))) * Float64(-0.125 * Float64((D ^ 2.0) * Float64((M_m ^ 2.0) * Float64(-1.0 / d))))); else tmp = Float64(Float64(d / Float64(sqrt(l) * sqrt(h))) * 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 = ((M_m / d) * (D / 2.0)) ^ 2.0;
tmp = 0.0;
if (d <= -1.35e+251)
tmp = -d * sqrt(((1.0 / h) / l));
elseif (d <= -5.8e-235)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l)));
elseif (d <= -5e-310)
tmp = sqrt((h / (l ^ 3.0))) * (-0.125 * ((D ^ 2.0) * ((M_m ^ 2.0) * (-1.0 / d))));
else
tmp = (d / (sqrt(l) * sqrt(h))) * (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[(N[(M$95$m / d), $MachinePrecision] * N[(D / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[d, -1.35e+251], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -5.8e-235], 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 * t$95$0), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -5e-310], 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] * N[(-1.0 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $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(\frac{M\_m}{d} \cdot \frac{D}{2}\right)}^{2}\\
\mathbf{if}\;d \leq -1.35 \cdot 10^{+251}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;d \leq -5.8 \cdot 10^{-235}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \frac{h \cdot t\_0}{\ell}\right)\\
\mathbf{elif}\;d \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{h}{{\ell}^{3}}} \cdot \left(-0.125 \cdot \left({D}^{2} \cdot \left({M\_m}^{2} \cdot \frac{-1}{d}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}} \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot t\_0\right)\right)\\
\end{array}
\end{array}
if d < -1.3500000000000001e251Initial program 53.2%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt92.0%
neg-mul-192.0%
Simplified92.0%
if -1.3500000000000001e251 < d < -5.80000000000000018e-235Initial program 78.0%
Simplified78.0%
associate-*r/82.2%
frac-times82.3%
*-commutative82.3%
times-frac80.2%
Applied egg-rr80.2%
if -5.80000000000000018e-235 < d < -4.999999999999985e-310Initial program 40.5%
Taylor expanded in h around -inf 0.0%
associate-*r*0.0%
*-commutative0.0%
associate-/l*0.0%
unpow20.0%
rem-square-sqrt63.2%
associate-/l*63.2%
Simplified63.2%
if -4.999999999999985e-310 < d Initial program 64.4%
pow164.4%
Applied egg-rr81.0%
Final simplification80.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 -5e-311)
(*
(*
(/ (sqrt (- d)) (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* D (/ (/ M_m 2.0) d)) 2.0) -0.5))))
(sqrt (/ d l)))
(*
(/ d (* (sqrt l) (sqrt h)))
(- 1.0 (* (/ h l) (* 0.5 (pow (* (/ M_m d) (/ D 2.0)) 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 (h <= -5e-311) {
tmp = ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5)))) * sqrt((d / l));
} else {
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0 - ((h / l) * (0.5 * pow(((M_m / d) * (D / 2.0)), 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 (h <= (-5d-311)) then
tmp = ((sqrt(-d) / sqrt(-h)) * (1.0d0 + ((h / l) * (((d_1 * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0))))) * sqrt((d / l))
else
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0d0 - ((h / l) * (0.5d0 * (((m_m / d) * (d_1 / 2.0d0)) ** 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 (h <= -5e-311) {
tmp = ((Math.sqrt(-d) / Math.sqrt(-h)) * (1.0 + ((h / l) * (Math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5)))) * Math.sqrt((d / l));
} else {
tmp = (d / (Math.sqrt(l) * Math.sqrt(h))) * (1.0 - ((h / l) * (0.5 * Math.pow(((M_m / d) * (D / 2.0)), 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 h <= -5e-311: tmp = ((math.sqrt(-d) / math.sqrt(-h)) * (1.0 + ((h / l) * (math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5)))) * math.sqrt((d / l)) else: tmp = (d / (math.sqrt(l) * math.sqrt(h))) * (1.0 - ((h / l) * (0.5 * math.pow(((M_m / d) * (D / 2.0)), 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 (h <= -5e-311) tmp = Float64(Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5)))) * sqrt(Float64(d / l))); else tmp = Float64(Float64(d / Float64(sqrt(l) * sqrt(h))) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(M_m / d) * Float64(D / 2.0)) ^ 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 (h <= -5e-311)
tmp = ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (((D * ((M_m / 2.0) / d)) ^ 2.0) * -0.5)))) * sqrt((d / l));
else
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0 - ((h / l) * (0.5 * (((M_m / d) * (D / 2.0)) ^ 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[h, -5e-311], N[(N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D / 2.0), $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}\;h \leq -5 \cdot 10^{-311}:\\
\;\;\;\;\left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(D \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right)\right) \cdot \sqrt{\frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}} \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{M\_m}{d} \cdot \frac{D}{2}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if h < -5.00000000000023e-311Initial program 69.5%
Simplified67.5%
frac-2neg67.5%
sqrt-div78.5%
Applied egg-rr78.5%
if -5.00000000000023e-311 < h Initial program 64.4%
pow164.4%
Applied egg-rr81.0%
Final simplification79.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 (<= h -5e-311)
(*
(sqrt (/ d l))
(*
(/ (sqrt (- d)) (sqrt (- h)))
(+ 1.0 (* (/ h l) (* -0.5 (pow (/ (/ (* D M_m) d) 2.0) 2.0))))))
(*
(/ d (* (sqrt l) (sqrt h)))
(- 1.0 (* (/ h l) (* 0.5 (pow (* (/ M_m d) (/ D 2.0)) 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 (h <= -5e-311) {
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (-0.5 * pow((((D * M_m) / d) / 2.0), 2.0)))));
} else {
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0 - ((h / l) * (0.5 * pow(((M_m / d) * (D / 2.0)), 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 (h <= (-5d-311)) then
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * (1.0d0 + ((h / l) * ((-0.5d0) * ((((d_1 * m_m) / d) / 2.0d0) ** 2.0d0)))))
else
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0d0 - ((h / l) * (0.5d0 * (((m_m / d) * (d_1 / 2.0d0)) ** 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 (h <= -5e-311) {
tmp = Math.sqrt((d / l)) * ((Math.sqrt(-d) / Math.sqrt(-h)) * (1.0 + ((h / l) * (-0.5 * Math.pow((((D * M_m) / d) / 2.0), 2.0)))));
} else {
tmp = (d / (Math.sqrt(l) * Math.sqrt(h))) * (1.0 - ((h / l) * (0.5 * Math.pow(((M_m / d) * (D / 2.0)), 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 h <= -5e-311: tmp = math.sqrt((d / l)) * ((math.sqrt(-d) / math.sqrt(-h)) * (1.0 + ((h / l) * (-0.5 * math.pow((((D * M_m) / d) / 2.0), 2.0))))) else: tmp = (d / (math.sqrt(l) * math.sqrt(h))) * (1.0 - ((h / l) * (0.5 * math.pow(((M_m / d) * (D / 2.0)), 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 (h <= -5e-311) tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(Float64(Float64(D * M_m) / d) / 2.0) ^ 2.0)))))); else tmp = Float64(Float64(d / Float64(sqrt(l) * sqrt(h))) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(M_m / d) * Float64(D / 2.0)) ^ 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 (h <= -5e-311)
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (-0.5 * ((((D * M_m) / d) / 2.0) ^ 2.0)))));
else
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0 - ((h / l) * (0.5 * (((M_m / d) * (D / 2.0)) ^ 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[h, -5e-311], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(N[(N[(D * M$95$m), $MachinePrecision] / d), $MachinePrecision] / 2.0), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D / 2.0), $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}\;h \leq -5 \cdot 10^{-311}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(\frac{\frac{D \cdot M\_m}{d}}{2}\right)}^{2}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}} \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{M\_m}{d} \cdot \frac{D}{2}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if h < -5.00000000000023e-311Initial program 69.5%
Simplified67.5%
frac-2neg67.5%
sqrt-div78.5%
Applied egg-rr78.5%
associate-*r/80.5%
*-un-lft-identity80.5%
times-frac78.5%
associate-/l/78.5%
*-commutative78.5%
times-frac80.5%
*-commutative80.5%
*-un-lft-identity80.5%
frac-times80.5%
associate-*l/80.5%
associate-*r/80.5%
Applied egg-rr80.5%
if -5.00000000000023e-311 < h Initial program 64.4%
pow164.4%
Applied egg-rr81.0%
Final simplification80.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 (<= d -1.7e+251)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= d -5e-310)
(*
(sqrt (/ d l))
(*
(+ 1.0 (* (/ h l) (* (pow (* D (/ (/ M_m 2.0) d)) 2.0) -0.5)))
(sqrt (/ d h))))
(*
(- 1.0 (* (/ h l) (* 0.5 (pow (* (/ M_m d) (/ D 2.0)) 2.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 (d <= -1.7e+251) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (d <= -5e-310) {
tmp = sqrt((d / l)) * ((1.0 + ((h / l) * (pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))) * sqrt((d / h)));
} else {
tmp = (1.0 - ((h / l) * (0.5 * pow(((M_m / d) * (D / 2.0)), 2.0)))) * ((d / sqrt(l)) / 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 (d <= (-1.7d+251)) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else if (d <= (-5d-310)) then
tmp = sqrt((d / l)) * ((1.0d0 + ((h / l) * (((d_1 * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))) * sqrt((d / h)))
else
tmp = (1.0d0 - ((h / l) * (0.5d0 * (((m_m / d) * (d_1 / 2.0d0)) ** 2.0d0)))) * ((d / sqrt(l)) / 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 (d <= -1.7e+251) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else if (d <= -5e-310) {
tmp = Math.sqrt((d / l)) * ((1.0 + ((h / l) * (Math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))) * Math.sqrt((d / h)));
} else {
tmp = (1.0 - ((h / l) * (0.5 * Math.pow(((M_m / d) * (D / 2.0)), 2.0)))) * ((d / Math.sqrt(l)) / 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 d <= -1.7e+251: tmp = -d * math.sqrt(((1.0 / h) / l)) elif d <= -5e-310: tmp = math.sqrt((d / l)) * ((1.0 + ((h / l) * (math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))) * math.sqrt((d / h))) else: tmp = (1.0 - ((h / l) * (0.5 * math.pow(((M_m / d) * (D / 2.0)), 2.0)))) * ((d / math.sqrt(l)) / 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 (d <= -1.7e+251) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (d <= -5e-310) tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))) * sqrt(Float64(d / h)))); else tmp = Float64(Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(M_m / d) * Float64(D / 2.0)) ^ 2.0)))) * Float64(Float64(d / sqrt(l)) / 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 (d <= -1.7e+251)
tmp = -d * sqrt(((1.0 / h) / l));
elseif (d <= -5e-310)
tmp = sqrt((d / l)) * ((1.0 + ((h / l) * (((D * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))) * sqrt((d / h)));
else
tmp = (1.0 - ((h / l) * (0.5 * (((M_m / d) * (D / 2.0)) ^ 2.0)))) * ((d / sqrt(l)) / 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[d, -1.7e+251], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -5e-310], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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}\;d \leq -1.7 \cdot 10^{+251}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;d \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\left(1 + \frac{h}{\ell} \cdot \left({\left(D \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right) \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{M\_m}{d} \cdot \frac{D}{2}\right)}^{2}\right)\right) \cdot \frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if d < -1.70000000000000006e251Initial program 53.2%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt92.0%
neg-mul-192.0%
Simplified92.0%
if -1.70000000000000006e251 < d < -4.999999999999985e-310Initial program 71.8%
Simplified69.5%
if -4.999999999999985e-310 < d Initial program 64.4%
pow164.4%
Applied egg-rr81.0%
unpow181.0%
associate-/r*79.9%
Simplified79.9%
Final simplification76.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
(let* ((t_0 (pow (* (/ M_m d) (/ D 2.0)) 2.0)))
(if (<= d -2.3e+251)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= d -5e-310)
(* (* (sqrt (/ d l)) (sqrt (/ d h))) (- 1.0 (* 0.5 (/ (* h t_0) l))))
(* (- 1.0 (* (/ h l) (* 0.5 t_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 t_0 = pow(((M_m / d) * (D / 2.0)), 2.0);
double tmp;
if (d <= -2.3e+251) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (d <= -5e-310) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l)));
} else {
tmp = (1.0 - ((h / l) * (0.5 * t_0))) * ((d / sqrt(l)) / 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 = ((m_m / d) * (d_1 / 2.0d0)) ** 2.0d0
if (d <= (-2.3d+251)) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else if (d <= (-5d-310)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (0.5d0 * ((h * t_0) / l)))
else
tmp = (1.0d0 - ((h / l) * (0.5d0 * t_0))) * ((d / sqrt(l)) / 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 = Math.pow(((M_m / d) * (D / 2.0)), 2.0);
double tmp;
if (d <= -2.3e+251) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else if (d <= -5e-310) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l)));
} else {
tmp = (1.0 - ((h / l) * (0.5 * t_0))) * ((d / Math.sqrt(l)) / 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 = math.pow(((M_m / d) * (D / 2.0)), 2.0) tmp = 0 if d <= -2.3e+251: tmp = -d * math.sqrt(((1.0 / h) / l)) elif d <= -5e-310: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l))) else: tmp = (1.0 - ((h / l) * (0.5 * t_0))) * ((d / math.sqrt(l)) / 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(M_m / d) * Float64(D / 2.0)) ^ 2.0 tmp = 0.0 if (d <= -2.3e+251) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (d <= -5e-310) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h * t_0) / l)))); else tmp = Float64(Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * t_0))) * Float64(Float64(d / sqrt(l)) / 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 = ((M_m / d) * (D / 2.0)) ^ 2.0;
tmp = 0.0;
if (d <= -2.3e+251)
tmp = -d * sqrt(((1.0 / h) / l));
elseif (d <= -5e-310)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((h * t_0) / l)));
else
tmp = (1.0 - ((h / l) * (0.5 * t_0))) * ((d / sqrt(l)) / 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[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[d, -2.3e+251], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -5e-310], 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 * t$95$0), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * t$95$0), $MachinePrecision]), $MachinePrecision]), $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}
t_0 := {\left(\frac{M\_m}{d} \cdot \frac{D}{2}\right)}^{2}\\
\mathbf{if}\;d \leq -2.3 \cdot 10^{+251}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;d \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \frac{h \cdot t\_0}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot t\_0\right)\right) \cdot \frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if d < -2.29999999999999988e251Initial program 53.2%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt92.0%
neg-mul-192.0%
Simplified92.0%
if -2.29999999999999988e251 < d < -4.999999999999985e-310Initial program 71.8%
Simplified71.8%
associate-*r/75.3%
frac-times75.3%
*-commutative75.3%
times-frac73.1%
Applied egg-rr73.1%
if -4.999999999999985e-310 < d Initial program 64.4%
pow164.4%
Applied egg-rr81.0%
unpow181.0%
associate-/r*79.9%
Simplified79.9%
Final simplification77.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 (<= d -1.35e+157)
(* (- d) (sqrt (/ (/ 1.0 l) h)))
(if (<= d -2e-299)
(*
(sqrt (* (/ d l) (/ d h)))
(+ 1.0 (* -0.5 (* (/ h l) (pow (* D (* M_m (/ 0.5 d))) 2.0)))))
(*
(- 1.0 (* (/ h l) (* 0.5 (pow (* (/ M_m d) (/ D 2.0)) 2.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 (d <= -1.35e+157) {
tmp = -d * sqrt(((1.0 / l) / h));
} else if (d <= -2e-299) {
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * ((h / l) * pow((D * (M_m * (0.5 / d))), 2.0))));
} else {
tmp = (1.0 - ((h / l) * (0.5 * pow(((M_m / d) * (D / 2.0)), 2.0)))) * ((d / sqrt(l)) / 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 (d <= (-1.35d+157)) then
tmp = -d * sqrt(((1.0d0 / l) / h))
else if (d <= (-2d-299)) then
tmp = sqrt(((d / l) * (d / h))) * (1.0d0 + ((-0.5d0) * ((h / l) * ((d_1 * (m_m * (0.5d0 / d))) ** 2.0d0))))
else
tmp = (1.0d0 - ((h / l) * (0.5d0 * (((m_m / d) * (d_1 / 2.0d0)) ** 2.0d0)))) * ((d / sqrt(l)) / 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 (d <= -1.35e+157) {
tmp = -d * Math.sqrt(((1.0 / l) / h));
} else if (d <= -2e-299) {
tmp = Math.sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * ((h / l) * Math.pow((D * (M_m * (0.5 / d))), 2.0))));
} else {
tmp = (1.0 - ((h / l) * (0.5 * Math.pow(((M_m / d) * (D / 2.0)), 2.0)))) * ((d / Math.sqrt(l)) / 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 d <= -1.35e+157: tmp = -d * math.sqrt(((1.0 / l) / h)) elif d <= -2e-299: tmp = math.sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * ((h / l) * math.pow((D * (M_m * (0.5 / d))), 2.0)))) else: tmp = (1.0 - ((h / l) * (0.5 * math.pow(((M_m / d) * (D / 2.0)), 2.0)))) * ((d / math.sqrt(l)) / 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 (d <= -1.35e+157) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))); elseif (d <= -2e-299) tmp = Float64(sqrt(Float64(Float64(d / l) * 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(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(M_m / d) * Float64(D / 2.0)) ^ 2.0)))) * Float64(Float64(d / sqrt(l)) / 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 (d <= -1.35e+157)
tmp = -d * sqrt(((1.0 / l) / h));
elseif (d <= -2e-299)
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * ((h / l) * ((D * (M_m * (0.5 / d))) ^ 2.0))));
else
tmp = (1.0 - ((h / l) * (0.5 * (((M_m / d) * (D / 2.0)) ^ 2.0)))) * ((d / sqrt(l)) / 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[d, -1.35e+157], N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -2e-299], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * 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[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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}\;d \leq -1.35 \cdot 10^{+157}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{elif}\;d \leq -2 \cdot 10^{-299}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \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}:\\
\;\;\;\;\left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{M\_m}{d} \cdot \frac{D}{2}\right)}^{2}\right)\right) \cdot \frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if d < -1.35e157Initial program 68.3%
Taylor expanded in d around inf 1.2%
associate-/r*1.2%
Simplified1.2%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt82.5%
neg-mul-182.5%
Simplified82.5%
if -1.35e157 < d < -1.99999999999999998e-299Initial program 69.9%
Simplified69.9%
add-sqr-sqrt69.9%
pow269.9%
sqrt-prod69.9%
sqrt-pow169.9%
metadata-eval69.9%
pow169.9%
frac-times70.9%
*-commutative70.9%
times-frac68.3%
Applied egg-rr68.3%
Simplified67.3%
pow167.3%
sqrt-unprod55.6%
cancel-sign-sub-inv55.6%
metadata-eval55.6%
associate-*r*56.5%
unpow-prod-down55.5%
pow255.5%
add-sqr-sqrt55.5%
Applied egg-rr55.5%
unpow155.5%
*-commutative55.5%
*-commutative55.5%
Simplified55.5%
if -1.99999999999999998e-299 < d Initial program 64.4%
pow164.4%
Applied egg-rr81.0%
unpow181.0%
associate-/r*79.9%
Simplified79.9%
Final simplification70.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
(let* ((t_0
(*
(sqrt (* (/ d l) (/ d h)))
(+ 1.0 (* -0.5 (* (/ h l) (pow (* D (* M_m (/ 0.5 d))) 2.0)))))))
(if (<= l -3.2e+167)
t_0
(if (<= l -3e+77)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l 5.5e-63) t_0 (* d (* (pow h -0.5) (sqrt (/ 1.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 = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * ((h / l) * pow((D * (M_m * (0.5 / d))), 2.0))));
double tmp;
if (l <= -3.2e+167) {
tmp = t_0;
} else if (l <= -3e+77) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (l <= 5.5e-63) {
tmp = t_0;
} else {
tmp = d * (pow(h, -0.5) * sqrt((1.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 = sqrt(((d / l) * (d / h))) * (1.0d0 + ((-0.5d0) * ((h / l) * ((d_1 * (m_m * (0.5d0 / d))) ** 2.0d0))))
if (l <= (-3.2d+167)) then
tmp = t_0
else if (l <= (-3d+77)) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else if (l <= 5.5d-63) then
tmp = t_0
else
tmp = d * ((h ** (-0.5d0)) * sqrt((1.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.sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * ((h / l) * Math.pow((D * (M_m * (0.5 / d))), 2.0))));
double tmp;
if (l <= -3.2e+167) {
tmp = t_0;
} else if (l <= -3e+77) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else if (l <= 5.5e-63) {
tmp = t_0;
} else {
tmp = d * (Math.pow(h, -0.5) * Math.sqrt((1.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.sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * ((h / l) * math.pow((D * (M_m * (0.5 / d))), 2.0)))) tmp = 0 if l <= -3.2e+167: tmp = t_0 elif l <= -3e+77: tmp = -d * math.sqrt(((1.0 / h) / l)) elif l <= 5.5e-63: tmp = t_0 else: tmp = d * (math.pow(h, -0.5) * math.sqrt((1.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(sqrt(Float64(Float64(d / l) * Float64(d / h))) * Float64(1.0 + Float64(-0.5 * Float64(Float64(h / l) * (Float64(D * Float64(M_m * Float64(0.5 / d))) ^ 2.0))))) tmp = 0.0 if (l <= -3.2e+167) tmp = t_0; elseif (l <= -3e+77) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= 5.5e-63) tmp = t_0; else tmp = Float64(d * Float64((h ^ -0.5) * sqrt(Float64(1.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 = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * ((h / l) * ((D * (M_m * (0.5 / d))) ^ 2.0))));
tmp = 0.0;
if (l <= -3.2e+167)
tmp = t_0;
elseif (l <= -3e+77)
tmp = -d * sqrt(((1.0 / h) / l));
elseif (l <= 5.5e-63)
tmp = t_0;
else
tmp = d * ((h ^ -0.5) * sqrt((1.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[Sqrt[N[(N[(d / l), $MachinePrecision] * 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]}, If[LessEqual[l, -3.2e+167], t$95$0, If[LessEqual[l, -3e+77], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5.5e-63], t$95$0, N[(d * N[(N[Power[h, -0.5], $MachinePrecision] * N[Sqrt[N[(1.0 / 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}
t_0 := \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \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{if}\;\ell \leq -3.2 \cdot 10^{+167}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \leq -3 \cdot 10^{+77}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq 5.5 \cdot 10^{-63}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({h}^{-0.5} \cdot \sqrt{\frac{1}{\ell}}\right)\\
\end{array}
\end{array}
if l < -3.19999999999999981e167 or -2.9999999999999998e77 < l < 5.50000000000000043e-63Initial program 69.4%
Simplified69.4%
add-sqr-sqrt69.4%
pow269.4%
sqrt-prod69.4%
sqrt-pow169.4%
metadata-eval69.4%
pow169.4%
frac-times70.0%
*-commutative70.0%
times-frac69.4%
Applied egg-rr69.4%
Simplified68.8%
pow168.8%
sqrt-unprod59.1%
cancel-sign-sub-inv59.1%
metadata-eval59.1%
associate-*r*59.7%
unpow-prod-down59.0%
pow259.0%
add-sqr-sqrt59.0%
Applied egg-rr59.0%
unpow159.0%
*-commutative59.0%
*-commutative59.0%
Simplified59.0%
if -3.19999999999999981e167 < l < -2.9999999999999998e77Initial program 70.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt76.7%
neg-mul-176.7%
Simplified76.7%
if 5.50000000000000043e-63 < l Initial program 61.0%
Taylor expanded in d around inf 53.4%
associate-/r*53.4%
Simplified53.4%
div-inv53.4%
sqrt-prod65.9%
inv-pow65.9%
sqrt-pow165.9%
metadata-eval65.9%
Applied egg-rr65.9%
Final simplification62.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
(if (<= l -4.6e+223)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(if (<= l -5e-310)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(/ 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 <= -4.6e+223) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else if (l <= -5e-310) {
tmp = -d * sqrt(((1.0 / h) / l));
} else {
tmp = d / (sqrt(l) * 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 <= (-4.6d+223)) then
tmp = sqrt((d / l)) * sqrt((d / h))
else if (l <= (-5d-310)) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else
tmp = d / (sqrt(l) * 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 <= -4.6e+223) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else if (l <= -5e-310) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else {
tmp = d / (Math.sqrt(l) * 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 <= -4.6e+223: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) elif l <= -5e-310: tmp = -d * math.sqrt(((1.0 / h) / l)) else: tmp = d / (math.sqrt(l) * 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 <= -4.6e+223) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); elseif (l <= -5e-310) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = Float64(d / Float64(sqrt(l) * 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 <= -4.6e+223)
tmp = sqrt((d / l)) * sqrt((d / h));
elseif (l <= -5e-310)
tmp = -d * sqrt(((1.0 / h) / l));
else
tmp = d / (sqrt(l) * 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, -4.6e+223], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[l], $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 -4.6 \cdot 10^{+223}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -4.60000000000000009e223Initial program 70.8%
Simplified70.8%
frac-2neg70.8%
sqrt-div75.2%
Applied egg-rr75.2%
Taylor expanded in d around inf 57.4%
if -4.60000000000000009e223 < l < -4.999999999999985e-310Initial program 69.3%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt46.8%
neg-mul-146.8%
Simplified46.8%
if -4.999999999999985e-310 < l Initial program 64.4%
Taylor expanded in d around inf 45.4%
associate-/r*45.4%
Simplified45.4%
pow145.4%
associate-/l/45.4%
sqrt-div45.4%
metadata-eval45.4%
Applied egg-rr45.4%
unpow145.4%
associate-*r/45.5%
*-rgt-identity45.5%
*-commutative45.5%
Simplified45.5%
pow1/245.5%
*-commutative45.5%
unpow-prod-down55.3%
pow1/255.3%
pow1/255.3%
Applied egg-rr55.3%
Final simplification51.8%
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 4.3e-308) (* (- d) (sqrt (/ (/ 1.0 h) l))) (/ 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 <= 4.3e-308) {
tmp = -d * sqrt(((1.0 / h) / l));
} else {
tmp = d / (sqrt(l) * 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 <= 4.3d-308) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else
tmp = d / (sqrt(l) * 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 <= 4.3e-308) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else {
tmp = d / (Math.sqrt(l) * 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 <= 4.3e-308: tmp = -d * math.sqrt(((1.0 / h) / l)) else: tmp = d / (math.sqrt(l) * 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 <= 4.3e-308) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = Float64(d / Float64(sqrt(l) * 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 <= 4.3e-308)
tmp = -d * sqrt(((1.0 / h) / l));
else
tmp = d / (sqrt(l) * 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, 4.3e-308], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[l], $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 4.3 \cdot 10^{-308}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < 4.3000000000000002e-308Initial program 69.5%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt45.0%
neg-mul-145.0%
Simplified45.0%
if 4.3000000000000002e-308 < l Initial program 64.4%
Taylor expanded in d around inf 45.4%
associate-/r*45.4%
Simplified45.4%
pow145.4%
associate-/l/45.4%
sqrt-div45.4%
metadata-eval45.4%
Applied egg-rr45.4%
unpow145.4%
associate-*r/45.5%
*-rgt-identity45.5%
*-commutative45.5%
Simplified45.5%
pow1/245.5%
*-commutative45.5%
unpow-prod-down55.3%
pow1/255.3%
pow1/255.3%
Applied egg-rr55.3%
Final simplification50.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 (<= d 6.2e-167) (* (- d) (sqrt (/ (/ 1.0 h) l))) (/ d (sqrt (* 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 (d <= 6.2e-167) {
tmp = -d * sqrt(((1.0 / h) / l));
} else {
tmp = d / sqrt((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 (d <= 6.2d-167) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else
tmp = d / sqrt((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 (d <= 6.2e-167) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else {
tmp = d / Math.sqrt((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 d <= 6.2e-167: tmp = -d * math.sqrt(((1.0 / h) / l)) else: tmp = d / math.sqrt((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 (d <= 6.2e-167) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = Float64(d / sqrt(Float64(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 (d <= 6.2e-167)
tmp = -d * sqrt(((1.0 / h) / l));
else
tmp = d / sqrt((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[d, 6.2e-167], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[Sqrt[N[(l * 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}\;d \leq 6.2 \cdot 10^{-167}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell \cdot h}}\\
\end{array}
\end{array}
if d < 6.2e-167Initial program 66.1%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt42.1%
neg-mul-142.1%
Simplified42.1%
if 6.2e-167 < d Initial program 68.4%
Taylor expanded in d around inf 51.1%
associate-/r*51.2%
Simplified51.2%
pow151.2%
associate-/l/51.1%
sqrt-div51.1%
metadata-eval51.1%
Applied egg-rr51.1%
unpow151.1%
associate-*r/51.2%
*-rgt-identity51.2%
*-commutative51.2%
Simplified51.2%
Final simplification45.8%
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.9e-167) (* (- d) (pow (* l h) -0.5)) (/ d (sqrt (* 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 (d <= 1.9e-167) {
tmp = -d * pow((l * h), -0.5);
} else {
tmp = d / sqrt((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 (d <= 1.9d-167) then
tmp = -d * ((l * h) ** (-0.5d0))
else
tmp = d / sqrt((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 (d <= 1.9e-167) {
tmp = -d * Math.pow((l * h), -0.5);
} else {
tmp = d / Math.sqrt((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 d <= 1.9e-167: tmp = -d * math.pow((l * h), -0.5) else: tmp = d / math.sqrt((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 (d <= 1.9e-167) tmp = Float64(Float64(-d) * (Float64(l * h) ^ -0.5)); else tmp = Float64(d / sqrt(Float64(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 (d <= 1.9e-167)
tmp = -d * ((l * h) ^ -0.5);
else
tmp = d / sqrt((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[d, 1.9e-167], N[((-d) * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(d / N[Sqrt[N[(l * 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}\;d \leq 1.9 \cdot 10^{-167}:\\
\;\;\;\;\left(-d\right) \cdot {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell \cdot h}}\\
\end{array}
\end{array}
if d < 1.89999999999999984e-167Initial program 66.1%
Taylor expanded in d around inf 8.9%
associate-/r*8.8%
Simplified8.8%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
*-commutative0.0%
unpow1/20.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%
*-commutative0.0%
unpow20.0%
rem-square-sqrt41.0%
neg-mul-141.0%
Simplified41.0%
if 1.89999999999999984e-167 < d Initial program 68.4%
Taylor expanded in d around inf 51.1%
associate-/r*51.2%
Simplified51.2%
pow151.2%
associate-/l/51.1%
sqrt-div51.1%
metadata-eval51.1%
Applied egg-rr51.1%
unpow151.1%
associate-*r/51.2%
*-rgt-identity51.2%
*-commutative51.2%
Simplified51.2%
Final simplification45.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 (let* ((t_0 (sqrt (* l h)))) (if (<= d 2e-167) (/ 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 = sqrt((l * h));
double tmp;
if (d <= 2e-167) {
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 = sqrt((l * h))
if (d <= 2d-167) 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.sqrt((l * h));
double tmp;
if (d <= 2e-167) {
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.sqrt((l * h)) tmp = 0 if d <= 2e-167: 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 = sqrt(Float64(l * h)) tmp = 0.0 if (d <= 2e-167) 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 = sqrt((l * h));
tmp = 0.0;
if (d <= 2e-167)
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[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, 2e-167], 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 := \sqrt{\ell \cdot h}\\
\mathbf{if}\;d \leq 2 \cdot 10^{-167}:\\
\;\;\;\;\frac{d}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{t\_0}\\
\end{array}
\end{array}
if d < 2e-167Initial program 66.1%
Simplified66.1%
add-sqr-sqrt66.1%
pow266.1%
sqrt-prod66.1%
sqrt-pow166.3%
metadata-eval66.3%
pow166.3%
frac-times67.0%
*-commutative67.0%
times-frac65.2%
Applied egg-rr65.2%
Simplified64.6%
clear-num64.6%
sqrt-div64.9%
metadata-eval64.9%
Applied egg-rr64.9%
Taylor expanded in d around -inf 41.0%
mul-1-neg41.0%
*-commutative41.0%
unpow1/241.0%
rem-exp-log39.2%
exp-neg39.2%
exp-prod39.2%
distribute-lft-neg-out39.2%
rec-exp39.2%
exp-to-pow41.0%
unpow1/241.0%
/-rgt-identity41.0%
times-frac41.0%
*-lft-identity41.0%
*-rgt-identity41.0%
Simplified41.0%
if 2e-167 < d Initial program 68.4%
Taylor expanded in d around inf 51.1%
associate-/r*51.2%
Simplified51.2%
pow151.2%
associate-/l/51.1%
sqrt-div51.1%
metadata-eval51.1%
Applied egg-rr51.1%
unpow151.1%
associate-*r/51.2%
*-rgt-identity51.2%
*-commutative51.2%
Simplified51.2%
Final simplification45.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 (/ d (sqrt (* 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) {
return d / sqrt((l * h));
}
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((l * h))
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((l * h));
}
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((l * h))
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(l * h))) 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((l * h));
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[(l * 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])\\
\\
\frac{d}{\sqrt{\ell \cdot h}}
\end{array}
Initial program 67.0%
Taylor expanded in d around inf 25.9%
associate-/r*25.9%
Simplified25.9%
pow125.9%
associate-/l/25.9%
sqrt-div25.5%
metadata-eval25.5%
Applied egg-rr25.5%
unpow125.5%
associate-*r/25.6%
*-rgt-identity25.6%
*-commutative25.6%
Simplified25.6%
Final simplification25.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 (* d (sqrt 0.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) {
return d * sqrt(0.0);
}
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(0.0d0)
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(0.0);
}
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(0.0)
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(0.0)) 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(0.0);
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[0.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])\\
\\
d \cdot \sqrt{0}
\end{array}
Initial program 67.0%
Taylor expanded in d around inf 25.9%
associate-/r*25.9%
Simplified25.9%
expm1-log1p-u25.3%
expm1-undefine16.2%
associate-/l/16.2%
Applied egg-rr16.2%
Taylor expanded in l around inf 5.7%
Final simplification5.7%
herbie shell --seed 2024051
(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)))))