
(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 21 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 (- 1.0 (* h (* 0.125 (/ (pow (* M_m (/ D d)) 2.0) l)))))
(t_1 (/ (sqrt d) (sqrt l))))
(if (<= d -4e-306)
(* (/ (sqrt (- d)) (sqrt (- h))) (* (sqrt (/ d l)) t_0))
(if (<= d 1.82e-121)
(*
t_1
(*
(/ (sqrt d) (sqrt h))
(+ 1.0 (* (/ h l) (* (pow (* D (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(* (sqrt (/ d h)) (* t_0 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 = 1.0 - (h * (0.125 * (pow((M_m * (D / d)), 2.0) / l)));
double t_1 = sqrt(d) / sqrt(l);
double tmp;
if (d <= -4e-306) {
tmp = (sqrt(-d) / sqrt(-h)) * (sqrt((d / l)) * t_0);
} else if (d <= 1.82e-121) {
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0 + ((h / l) * (pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else {
tmp = sqrt((d / h)) * (t_0 * 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 = 1.0d0 - (h * (0.125d0 * (((m_m * (d_1 / d)) ** 2.0d0) / l)))
t_1 = sqrt(d) / sqrt(l)
if (d <= (-4d-306)) then
tmp = (sqrt(-d) / sqrt(-h)) * (sqrt((d / l)) * t_0)
else if (d <= 1.82d-121) then
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0d0 + ((h / l) * (((d_1 * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))))
else
tmp = sqrt((d / h)) * (t_0 * 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 = 1.0 - (h * (0.125 * (Math.pow((M_m * (D / d)), 2.0) / l)));
double t_1 = Math.sqrt(d) / Math.sqrt(l);
double tmp;
if (d <= -4e-306) {
tmp = (Math.sqrt(-d) / Math.sqrt(-h)) * (Math.sqrt((d / l)) * t_0);
} else if (d <= 1.82e-121) {
tmp = t_1 * ((Math.sqrt(d) / Math.sqrt(h)) * (1.0 + ((h / l) * (Math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else {
tmp = Math.sqrt((d / h)) * (t_0 * 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 = 1.0 - (h * (0.125 * (math.pow((M_m * (D / d)), 2.0) / l))) t_1 = math.sqrt(d) / math.sqrt(l) tmp = 0 if d <= -4e-306: tmp = (math.sqrt(-d) / math.sqrt(-h)) * (math.sqrt((d / l)) * t_0) elif d <= 1.82e-121: tmp = t_1 * ((math.sqrt(d) / math.sqrt(h)) * (1.0 + ((h / l) * (math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5)))) else: tmp = math.sqrt((d / h)) * (t_0 * 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 = Float64(1.0 - Float64(h * Float64(0.125 * Float64((Float64(M_m * Float64(D / d)) ^ 2.0) / l)))) t_1 = Float64(sqrt(d) / sqrt(l)) tmp = 0.0 if (d <= -4e-306) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(sqrt(Float64(d / l)) * t_0)); elseif (d <= 1.82e-121) tmp = Float64(t_1 * Float64(Float64(sqrt(d) / sqrt(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(sqrt(Float64(d / h)) * Float64(t_0 * 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 = 1.0 - (h * (0.125 * (((M_m * (D / d)) ^ 2.0) / l)));
t_1 = sqrt(d) / sqrt(l);
tmp = 0.0;
if (d <= -4e-306)
tmp = (sqrt(-d) / sqrt(-h)) * (sqrt((d / l)) * t_0);
elseif (d <= 1.82e-121)
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0 + ((h / l) * (((D * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))));
else
tmp = sqrt((d / h)) * (t_0 * 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[(1.0 - N[(h * N[(0.125 * N[(N[Power[N[(M$95$m * N[(D / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -4e-306], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.82e-121], N[(t$95$1 * 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]), $MachinePrecision], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(t$95$0 * 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 := 1 - h \cdot \left(0.125 \cdot \frac{{\left(M\_m \cdot \frac{D}{d}\right)}^{2}}{\ell}\right)\\
t_1 := \frac{\sqrt{d}}{\sqrt{\ell}}\\
\mathbf{if}\;d \leq -4 \cdot 10^{-306}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(\sqrt{\frac{d}{\ell}} \cdot t\_0\right)\\
\mathbf{elif}\;d \leq 1.82 \cdot 10^{-121}:\\
\;\;\;\;t\_1 \cdot \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)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(t\_0 \cdot t\_1\right)\\
\end{array}
\end{array}
if d < -4.00000000000000011e-306Initial program 62.0%
Simplified60.0%
Taylor expanded in h around -inf 35.8%
associate-*r*35.8%
neg-mul-135.8%
sub-neg35.8%
distribute-lft-in35.8%
Simplified61.8%
frac-2neg61.8%
sqrt-div79.6%
Applied egg-rr79.6%
if -4.00000000000000011e-306 < d < 1.81999999999999999e-121Initial program 41.1%
Simplified39.0%
sqrt-div43.5%
Applied egg-rr43.5%
sqrt-div67.2%
Applied egg-rr67.2%
if 1.81999999999999999e-121 < d Initial program 77.1%
Simplified75.9%
Taylor expanded in h around -inf 50.1%
associate-*r*50.1%
neg-mul-150.1%
sub-neg50.1%
distribute-lft-in50.1%
Simplified79.6%
sqrt-div81.1%
Applied egg-rr89.7%
Final simplification81.2%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0
(*
(* (pow (/ d h) 0.5) (pow (/ d l) 0.5))
(- 1.0 (* (/ h l) (* 0.5 (pow (/ (* M_m D) (* d 2.0)) 2.0)))))))
(if (<= t_0 1e+248)
t_0
(*
(fabs (/ d (sqrt (* h l))))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 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 = (pow((d / h), 0.5) * pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * pow(((M_m * D) / (d * 2.0)), 2.0))));
double tmp;
if (t_0 <= 1e+248) {
tmp = t_0;
} else {
tmp = fabs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * pow(((D / d) * (M_m / 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 = (((d / h) ** 0.5d0) * ((d / l) ** 0.5d0)) * (1.0d0 - ((h / l) * (0.5d0 * (((m_m * d_1) / (d * 2.0d0)) ** 2.0d0))))
if (t_0 <= 1d+248) then
tmp = t_0
else
tmp = abs((d / sqrt((h * l)))) * (1.0d0 - (0.5d0 * ((h / l) * (((d_1 / d) * (m_m / 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.pow((d / h), 0.5) * Math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * Math.pow(((M_m * D) / (d * 2.0)), 2.0))));
double tmp;
if (t_0 <= 1e+248) {
tmp = t_0;
} else {
tmp = Math.abs((d / Math.sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * Math.pow(((D / d) * (M_m / 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.pow((d / h), 0.5) * math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * math.pow(((M_m * D) / (d * 2.0)), 2.0)))) tmp = 0 if t_0 <= 1e+248: tmp = t_0 else: tmp = math.fabs((d / math.sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * math.pow(((D / d) * (M_m / 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 = Float64(Float64((Float64(d / h) ^ 0.5) * (Float64(d / l) ^ 0.5)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(M_m * D) / Float64(d * 2.0)) ^ 2.0))))) tmp = 0.0 if (t_0 <= 1e+248) tmp = t_0; else tmp = Float64(abs(Float64(d / sqrt(Float64(h * l)))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 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 = (((d / h) ^ 0.5) * ((d / l) ^ 0.5)) * (1.0 - ((h / l) * (0.5 * (((M_m * D) / (d * 2.0)) ^ 2.0))));
tmp = 0.0;
if (t_0 <= 1e+248)
tmp = t_0;
else
tmp = abs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * (((D / d) * (M_m / 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[(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[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 1e+248], t$95$0, N[(N[Abs[N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 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 := \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{M\_m \cdot D}{d \cdot 2}\right)}^{2}\right)\right)\\
\mathbf{if}\;t\_0 \leq 10^{+248}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\left|\frac{d}{\sqrt{h \cdot \ell}}\right| \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\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)))) < 1.00000000000000005e248Initial program 87.5%
if 1.00000000000000005e248 < (*.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 19.9%
Simplified19.9%
add-sqr-sqrt19.9%
pow219.9%
sqrt-unprod18.9%
pow1/218.9%
sqrt-pow118.9%
metadata-eval18.9%
Applied egg-rr18.9%
add-sqr-sqrt18.9%
sqrt-prod18.9%
rem-sqrt-square18.9%
pow-pow18.9%
metadata-eval18.9%
pow1/218.9%
frac-times21.1%
sqrt-div26.6%
sqrt-unprod24.7%
add-sqr-sqrt56.5%
Applied egg-rr56.5%
Final simplification76.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
(let* ((t_0 (- 1.0 (* h (* 0.125 (/ (pow (* M_m (/ D d)) 2.0) l))))))
(if (<= l -2e-310)
(* (/ (sqrt (- d)) (sqrt (- h))) (* (sqrt (/ d l)) t_0))
(if (<= l 1.85e+55)
(* (/ (sqrt d) (sqrt h)) (* t_0 (/ 1.0 (sqrt (/ l d)))))
(*
(/ (sqrt d) (sqrt 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) {
double t_0 = 1.0 - (h * (0.125 * (pow((M_m * (D / d)), 2.0) / l)));
double tmp;
if (l <= -2e-310) {
tmp = (sqrt(-d) / sqrt(-h)) * (sqrt((d / l)) * t_0);
} else if (l <= 1.85e+55) {
tmp = (sqrt(d) / sqrt(h)) * (t_0 * (1.0 / sqrt((l / d))));
} else {
tmp = (sqrt(d) / sqrt(l)) * (sqrt((d / h)) * (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) :: t_0
real(8) :: tmp
t_0 = 1.0d0 - (h * (0.125d0 * (((m_m * (d_1 / d)) ** 2.0d0) / l)))
if (l <= (-2d-310)) then
tmp = (sqrt(-d) / sqrt(-h)) * (sqrt((d / l)) * t_0)
else if (l <= 1.85d+55) then
tmp = (sqrt(d) / sqrt(h)) * (t_0 * (1.0d0 / sqrt((l / d))))
else
tmp = (sqrt(d) / sqrt(l)) * (sqrt((d / h)) * (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 t_0 = 1.0 - (h * (0.125 * (Math.pow((M_m * (D / d)), 2.0) / l)));
double tmp;
if (l <= -2e-310) {
tmp = (Math.sqrt(-d) / Math.sqrt(-h)) * (Math.sqrt((d / l)) * t_0);
} else if (l <= 1.85e+55) {
tmp = (Math.sqrt(d) / Math.sqrt(h)) * (t_0 * (1.0 / Math.sqrt((l / d))));
} else {
tmp = (Math.sqrt(d) / Math.sqrt(l)) * (Math.sqrt((d / h)) * (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): t_0 = 1.0 - (h * (0.125 * (math.pow((M_m * (D / d)), 2.0) / l))) tmp = 0 if l <= -2e-310: tmp = (math.sqrt(-d) / math.sqrt(-h)) * (math.sqrt((d / l)) * t_0) elif l <= 1.85e+55: tmp = (math.sqrt(d) / math.sqrt(h)) * (t_0 * (1.0 / math.sqrt((l / d)))) else: tmp = (math.sqrt(d) / math.sqrt(l)) * (math.sqrt((d / h)) * (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) t_0 = Float64(1.0 - Float64(h * Float64(0.125 * Float64((Float64(M_m * Float64(D / d)) ^ 2.0) / l)))) tmp = 0.0 if (l <= -2e-310) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(sqrt(Float64(d / l)) * t_0)); elseif (l <= 1.85e+55) tmp = Float64(Float64(sqrt(d) / sqrt(h)) * Float64(t_0 * Float64(1.0 / sqrt(Float64(l / d))))); else tmp = Float64(Float64(sqrt(d) / sqrt(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 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 * (((M_m * (D / d)) ^ 2.0) / l)));
tmp = 0.0;
if (l <= -2e-310)
tmp = (sqrt(-d) / sqrt(-h)) * (sqrt((d / l)) * t_0);
elseif (l <= 1.85e+55)
tmp = (sqrt(d) / sqrt(h)) * (t_0 * (1.0 / sqrt((l / d))));
else
tmp = (sqrt(d) / sqrt(l)) * (sqrt((d / h)) * (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_] := Block[{t$95$0 = N[(1.0 - N[(h * N[(0.125 * N[(N[Power[N[(M$95$m * N[(D / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -2e-310], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.85e+55], N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(1.0 / N[Sqrt[N[(l / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[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])\\
\\
\begin{array}{l}
t_0 := 1 - h \cdot \left(0.125 \cdot \frac{{\left(M\_m \cdot \frac{D}{d}\right)}^{2}}{\ell}\right)\\
\mathbf{if}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(\sqrt{\frac{d}{\ell}} \cdot t\_0\right)\\
\mathbf{elif}\;\ell \leq 1.85 \cdot 10^{+55}:\\
\;\;\;\;\frac{\sqrt{d}}{\sqrt{h}} \cdot \left(t\_0 \cdot \frac{1}{\sqrt{\frac{\ell}{d}}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{d}}{\sqrt{\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}
\end{array}
if l < -1.999999999999994e-310Initial program 61.5%
Simplified59.5%
Taylor expanded in h around -inf 35.5%
associate-*r*35.5%
neg-mul-135.5%
sub-neg35.5%
distribute-lft-in35.5%
Simplified61.3%
frac-2neg61.3%
sqrt-div78.9%
Applied egg-rr78.9%
if -1.999999999999994e-310 < l < 1.8500000000000001e55Initial program 68.6%
Simplified67.3%
Taylor expanded in h around -inf 38.0%
associate-*r*38.0%
neg-mul-138.0%
sub-neg38.0%
distribute-lft-in38.0%
Simplified67.8%
clear-num67.8%
sqrt-div69.9%
metadata-eval69.9%
Applied egg-rr69.9%
sqrt-div85.3%
Applied egg-rr85.5%
if 1.8500000000000001e55 < l Initial program 62.7%
Simplified62.7%
Taylor expanded in D around 0 62.7%
*-commutative62.7%
associate-*l/62.7%
associate-*r*62.7%
Simplified62.7%
Taylor expanded in D around 0 39.3%
*-commutative39.3%
associate-/l*37.3%
unpow237.3%
unpow237.3%
unpow237.3%
times-frac47.2%
swap-sqr62.7%
unpow262.7%
associate-*r/62.7%
*-commutative62.7%
associate-/l*62.7%
Simplified62.7%
expm1-log1p-u52.2%
expm1-undefine52.2%
associate-*l/52.2%
associate-/l*52.2%
clear-num52.2%
un-div-inv52.2%
Applied egg-rr52.2%
sub-neg52.2%
metadata-eval52.2%
+-commutative52.2%
log1p-undefine52.2%
rem-exp-log64.9%
associate-+r+64.9%
metadata-eval64.9%
cancel-sign-sub64.9%
associate-/l*63.0%
neg-sub063.0%
distribute-neg-frac63.0%
Simplified65.0%
sqrt-div69.9%
Applied egg-rr76.1%
Final simplification80.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)))
(if (<= l -2e-310)
(*
(sqrt (/ d l))
(* (/ (sqrt (- d)) (sqrt (- h))) (+ 1.0 (* (/ h l) (* t_0 -0.125)))))
(if (<= l 7.8e+55)
(*
(/ (sqrt d) (sqrt h))
(*
(- 1.0 (* h (* 0.125 (/ (pow (* M_m (/ D d)) 2.0) l))))
(/ 1.0 (sqrt (/ l d)))))
(*
(/ (sqrt d) (sqrt l))
(* (sqrt (/ d h)) (+ 1.0 (* h (* t_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 t_0 = pow((D * (M_m / d)), 2.0);
double tmp;
if (l <= -2e-310) {
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (t_0 * -0.125))));
} else if (l <= 7.8e+55) {
tmp = (sqrt(d) / sqrt(h)) * ((1.0 - (h * (0.125 * (pow((M_m * (D / d)), 2.0) / l)))) * (1.0 / sqrt((l / d))));
} else {
tmp = (sqrt(d) / sqrt(l)) * (sqrt((d / h)) * (1.0 + (h * (t_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) :: t_0
real(8) :: tmp
t_0 = (d_1 * (m_m / d)) ** 2.0d0
if (l <= (-2d-310)) then
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * (1.0d0 + ((h / l) * (t_0 * (-0.125d0)))))
else if (l <= 7.8d+55) then
tmp = (sqrt(d) / sqrt(h)) * ((1.0d0 - (h * (0.125d0 * (((m_m * (d_1 / d)) ** 2.0d0) / l)))) * (1.0d0 / sqrt((l / d))))
else
tmp = (sqrt(d) / sqrt(l)) * (sqrt((d / h)) * (1.0d0 + (h * (t_0 * ((-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 t_0 = Math.pow((D * (M_m / d)), 2.0);
double tmp;
if (l <= -2e-310) {
tmp = Math.sqrt((d / l)) * ((Math.sqrt(-d) / Math.sqrt(-h)) * (1.0 + ((h / l) * (t_0 * -0.125))));
} else if (l <= 7.8e+55) {
tmp = (Math.sqrt(d) / Math.sqrt(h)) * ((1.0 - (h * (0.125 * (Math.pow((M_m * (D / d)), 2.0) / l)))) * (1.0 / Math.sqrt((l / d))));
} else {
tmp = (Math.sqrt(d) / Math.sqrt(l)) * (Math.sqrt((d / h)) * (1.0 + (h * (t_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): t_0 = math.pow((D * (M_m / d)), 2.0) tmp = 0 if l <= -2e-310: tmp = math.sqrt((d / l)) * ((math.sqrt(-d) / math.sqrt(-h)) * (1.0 + ((h / l) * (t_0 * -0.125)))) elif l <= 7.8e+55: tmp = (math.sqrt(d) / math.sqrt(h)) * ((1.0 - (h * (0.125 * (math.pow((M_m * (D / d)), 2.0) / l)))) * (1.0 / math.sqrt((l / d)))) else: tmp = (math.sqrt(d) / math.sqrt(l)) * (math.sqrt((d / h)) * (1.0 + (h * (t_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) t_0 = Float64(D * Float64(M_m / d)) ^ 2.0 tmp = 0.0 if (l <= -2e-310) tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64(t_0 * -0.125))))); elseif (l <= 7.8e+55) tmp = Float64(Float64(sqrt(d) / sqrt(h)) * Float64(Float64(1.0 - Float64(h * Float64(0.125 * Float64((Float64(M_m * Float64(D / d)) ^ 2.0) / l)))) * Float64(1.0 / sqrt(Float64(l / d))))); else tmp = Float64(Float64(sqrt(d) / sqrt(l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(h * Float64(t_0 * Float64(-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)
t_0 = (D * (M_m / d)) ^ 2.0;
tmp = 0.0;
if (l <= -2e-310)
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (t_0 * -0.125))));
elseif (l <= 7.8e+55)
tmp = (sqrt(d) / sqrt(h)) * ((1.0 - (h * (0.125 * (((M_m * (D / d)) ^ 2.0) / l)))) * (1.0 / sqrt((l / d))));
else
tmp = (sqrt(d) / sqrt(l)) * (sqrt((d / h)) * (1.0 + (h * (t_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_] := Block[{t$95$0 = N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[l, -2e-310], 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[(t$95$0 * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 7.8e+55], N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(h * N[(0.125 * N[(N[Power[N[(M$95$m * N[(D / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[Sqrt[N[(l / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(h * N[(t$95$0 * 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])\\
\\
\begin{array}{l}
t_0 := {\left(D \cdot \frac{M\_m}{d}\right)}^{2}\\
\mathbf{if}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left(t\_0 \cdot -0.125\right)\right)\right)\\
\mathbf{elif}\;\ell \leq 7.8 \cdot 10^{+55}:\\
\;\;\;\;\frac{\sqrt{d}}{\sqrt{h}} \cdot \left(\left(1 - h \cdot \left(0.125 \cdot \frac{{\left(M\_m \cdot \frac{D}{d}\right)}^{2}}{\ell}\right)\right) \cdot \frac{1}{\sqrt{\frac{\ell}{d}}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{d}}{\sqrt{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + h \cdot \left(t\_0 \cdot \frac{-0.125}{\ell}\right)\right)\right)\\
\end{array}
\end{array}
if l < -1.999999999999994e-310Initial program 61.5%
Simplified62.3%
Taylor expanded in D around 0 61.5%
*-commutative61.5%
associate-*l/60.3%
associate-*r*60.3%
Simplified60.3%
Taylor expanded in D around 0 37.8%
*-commutative37.8%
associate-/l*37.1%
unpow237.1%
unpow237.1%
unpow237.1%
times-frac51.0%
swap-sqr60.3%
unpow260.3%
associate-*r/61.5%
*-commutative61.5%
associate-/l*62.3%
Simplified62.3%
frac-2neg61.3%
sqrt-div78.9%
Applied egg-rr79.8%
if -1.999999999999994e-310 < l < 7.80000000000000054e55Initial program 68.6%
Simplified67.3%
Taylor expanded in h around -inf 38.0%
associate-*r*38.0%
neg-mul-138.0%
sub-neg38.0%
distribute-lft-in38.0%
Simplified67.8%
clear-num67.8%
sqrt-div69.9%
metadata-eval69.9%
Applied egg-rr69.9%
sqrt-div85.3%
Applied egg-rr85.5%
if 7.80000000000000054e55 < l Initial program 62.7%
Simplified62.7%
Taylor expanded in D around 0 62.7%
*-commutative62.7%
associate-*l/62.7%
associate-*r*62.7%
Simplified62.7%
Taylor expanded in D around 0 39.3%
*-commutative39.3%
associate-/l*37.3%
unpow237.3%
unpow237.3%
unpow237.3%
times-frac47.2%
swap-sqr62.7%
unpow262.7%
associate-*r/62.7%
*-commutative62.7%
associate-/l*62.7%
Simplified62.7%
expm1-log1p-u52.2%
expm1-undefine52.2%
associate-*l/52.2%
associate-/l*52.2%
clear-num52.2%
un-div-inv52.2%
Applied egg-rr52.2%
sub-neg52.2%
metadata-eval52.2%
+-commutative52.2%
log1p-undefine52.2%
rem-exp-log64.9%
associate-+r+64.9%
metadata-eval64.9%
cancel-sign-sub64.9%
associate-/l*63.0%
neg-sub063.0%
distribute-neg-frac63.0%
Simplified65.0%
sqrt-div69.9%
Applied egg-rr76.1%
Final simplification80.9%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (+ 1.0 (* (/ h l) (* (pow (* D (/ M_m d)) 2.0) -0.125))))
(t_1 (sqrt (/ d l))))
(if (<= d -4e-306)
(* t_1 (* (/ (sqrt (- d)) (sqrt (- h))) t_0))
(if (<= d 1.25e-120)
(* t_1 (* (/ (sqrt d) (sqrt h)) t_0))
(*
(sqrt (/ d h))
(*
(- 1.0 (* h (* 0.125 (/ (pow (* M_m (/ D d)) 2.0) l))))
(/ (sqrt d) (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 t_0 = 1.0 + ((h / l) * (pow((D * (M_m / d)), 2.0) * -0.125));
double t_1 = sqrt((d / l));
double tmp;
if (d <= -4e-306) {
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0);
} else if (d <= 1.25e-120) {
tmp = t_1 * ((sqrt(d) / sqrt(h)) * t_0);
} else {
tmp = sqrt((d / h)) * ((1.0 - (h * (0.125 * (pow((M_m * (D / d)), 2.0) / l)))) * (sqrt(d) / 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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 1.0d0 + ((h / l) * (((d_1 * (m_m / d)) ** 2.0d0) * (-0.125d0)))
t_1 = sqrt((d / l))
if (d <= (-4d-306)) then
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0)
else if (d <= 1.25d-120) then
tmp = t_1 * ((sqrt(d) / sqrt(h)) * t_0)
else
tmp = sqrt((d / h)) * ((1.0d0 - (h * (0.125d0 * (((m_m * (d_1 / d)) ** 2.0d0) / l)))) * (sqrt(d) / 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 t_0 = 1.0 + ((h / l) * (Math.pow((D * (M_m / d)), 2.0) * -0.125));
double t_1 = Math.sqrt((d / l));
double tmp;
if (d <= -4e-306) {
tmp = t_1 * ((Math.sqrt(-d) / Math.sqrt(-h)) * t_0);
} else if (d <= 1.25e-120) {
tmp = t_1 * ((Math.sqrt(d) / Math.sqrt(h)) * t_0);
} else {
tmp = Math.sqrt((d / h)) * ((1.0 - (h * (0.125 * (Math.pow((M_m * (D / d)), 2.0) / l)))) * (Math.sqrt(d) / 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): t_0 = 1.0 + ((h / l) * (math.pow((D * (M_m / d)), 2.0) * -0.125)) t_1 = math.sqrt((d / l)) tmp = 0 if d <= -4e-306: tmp = t_1 * ((math.sqrt(-d) / math.sqrt(-h)) * t_0) elif d <= 1.25e-120: tmp = t_1 * ((math.sqrt(d) / math.sqrt(h)) * t_0) else: tmp = math.sqrt((d / h)) * ((1.0 - (h * (0.125 * (math.pow((M_m * (D / d)), 2.0) / l)))) * (math.sqrt(d) / 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) t_0 = Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D * Float64(M_m / d)) ^ 2.0) * -0.125))) t_1 = sqrt(Float64(d / l)) tmp = 0.0 if (d <= -4e-306) tmp = Float64(t_1 * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0)); elseif (d <= 1.25e-120) tmp = Float64(t_1 * Float64(Float64(sqrt(d) / sqrt(h)) * t_0)); else tmp = Float64(sqrt(Float64(d / h)) * Float64(Float64(1.0 - Float64(h * Float64(0.125 * Float64((Float64(M_m * Float64(D / d)) ^ 2.0) / l)))) * Float64(sqrt(d) / 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)
t_0 = 1.0 + ((h / l) * (((D * (M_m / d)) ^ 2.0) * -0.125));
t_1 = sqrt((d / l));
tmp = 0.0;
if (d <= -4e-306)
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0);
elseif (d <= 1.25e-120)
tmp = t_1 * ((sqrt(d) / sqrt(h)) * t_0);
else
tmp = sqrt((d / h)) * ((1.0 - (h * (0.125 * (((M_m * (D / d)) ^ 2.0) / l)))) * (sqrt(d) / 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_] := Block[{t$95$0 = 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]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -4e-306], N[(t$95$1 * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.25e-120], N[(t$95$1 * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 - N[(h * N[(0.125 * N[(N[Power[N[(M$95$m * N[(D / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[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 := 1 + \frac{h}{\ell} \cdot \left({\left(D \cdot \frac{M\_m}{d}\right)}^{2} \cdot -0.125\right)\\
t_1 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;d \leq -4 \cdot 10^{-306}:\\
\;\;\;\;t\_1 \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\right)\\
\mathbf{elif}\;d \leq 1.25 \cdot 10^{-120}:\\
\;\;\;\;t\_1 \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\left(1 - h \cdot \left(0.125 \cdot \frac{{\left(M\_m \cdot \frac{D}{d}\right)}^{2}}{\ell}\right)\right) \cdot \frac{\sqrt{d}}{\sqrt{\ell}}\right)\\
\end{array}
\end{array}
if d < -4.00000000000000011e-306Initial program 62.0%
Simplified62.8%
Taylor expanded in D around 0 62.0%
*-commutative62.0%
associate-*l/60.8%
associate-*r*60.8%
Simplified60.8%
Taylor expanded in D around 0 38.2%
*-commutative38.2%
associate-/l*37.4%
unpow237.4%
unpow237.4%
unpow237.4%
times-frac51.4%
swap-sqr60.8%
unpow260.8%
associate-*r/62.0%
*-commutative62.0%
associate-/l*62.8%
Simplified62.8%
frac-2neg61.8%
sqrt-div79.6%
Applied egg-rr80.5%
if -4.00000000000000011e-306 < d < 1.25000000000000002e-120Initial program 41.1%
Simplified39.0%
Taylor expanded in D around 0 41.2%
*-commutative41.2%
associate-*l/41.2%
associate-*r*41.2%
Simplified41.2%
Taylor expanded in D around 0 14.8%
*-commutative14.8%
associate-/l*14.8%
unpow214.8%
unpow214.8%
unpow214.8%
times-frac29.5%
swap-sqr41.2%
unpow241.2%
associate-*r/41.2%
*-commutative41.2%
associate-/l*39.0%
Simplified39.0%
sqrt-div67.2%
Applied egg-rr60.3%
if 1.25000000000000002e-120 < d Initial program 77.1%
Simplified75.9%
Taylor expanded in h around -inf 50.1%
associate-*r*50.1%
neg-mul-150.1%
sub-neg50.1%
distribute-lft-in50.1%
Simplified79.6%
sqrt-div81.1%
Applied egg-rr89.7%
Final simplification80.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 (<= M_m 3.6e-253)
(*
(sqrt (/ d h))
(*
(sqrt (/ d l))
(+ 1.0 (* h (* -0.125 (/ (pow (* D (/ M_m d)) 2.0) l))))))
(*
(fabs (/ d (sqrt (* h l))))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 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 (M_m <= 3.6e-253) {
tmp = sqrt((d / h)) * (sqrt((d / l)) * (1.0 + (h * (-0.125 * (pow((D * (M_m / d)), 2.0) / l)))));
} else {
tmp = fabs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * pow(((D / d) * (M_m / 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 (m_m <= 3.6d-253) then
tmp = sqrt((d / h)) * (sqrt((d / l)) * (1.0d0 + (h * ((-0.125d0) * (((d_1 * (m_m / d)) ** 2.0d0) / l)))))
else
tmp = abs((d / sqrt((h * l)))) * (1.0d0 - (0.5d0 * ((h / l) * (((d_1 / d) * (m_m / 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 (M_m <= 3.6e-253) {
tmp = Math.sqrt((d / h)) * (Math.sqrt((d / l)) * (1.0 + (h * (-0.125 * (Math.pow((D * (M_m / d)), 2.0) / l)))));
} else {
tmp = Math.abs((d / Math.sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * Math.pow(((D / d) * (M_m / 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 M_m <= 3.6e-253: tmp = math.sqrt((d / h)) * (math.sqrt((d / l)) * (1.0 + (h * (-0.125 * (math.pow((D * (M_m / d)), 2.0) / l))))) else: tmp = math.fabs((d / math.sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * math.pow(((D / d) * (M_m / 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 (M_m <= 3.6e-253) tmp = Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(d / l)) * Float64(1.0 + Float64(h * Float64(-0.125 * Float64((Float64(D * Float64(M_m / d)) ^ 2.0) / l)))))); else tmp = Float64(abs(Float64(d / sqrt(Float64(h * l)))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 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 (M_m <= 3.6e-253)
tmp = sqrt((d / h)) * (sqrt((d / l)) * (1.0 + (h * (-0.125 * (((D * (M_m / d)) ^ 2.0) / l)))));
else
tmp = abs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * (((D / d) * (M_m / 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[M$95$m, 3.6e-253], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(h * N[(-0.125 * N[(N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Abs[N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 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}\;M\_m \leq 3.6 \cdot 10^{-253}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \left(1 + h \cdot \left(-0.125 \cdot \frac{{\left(D \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left|\frac{d}{\sqrt{h \cdot \ell}}\right| \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if M < 3.6e-253Initial program 62.5%
Simplified60.7%
Taylor expanded in h around -inf 40.9%
associate-*r*40.9%
neg-mul-140.9%
sub-neg40.9%
distribute-lft-in40.9%
Simplified65.5%
pow165.5%
associate-*r/65.5%
Applied egg-rr65.5%
unpow165.5%
distribute-lft-neg-in65.5%
distribute-rgt-neg-in65.5%
associate-/l*65.5%
distribute-lft-neg-in65.5%
metadata-eval65.5%
associate-*r/67.3%
*-commutative67.3%
associate-/l*67.3%
Simplified67.3%
if 3.6e-253 < M Initial program 65.5%
Simplified65.4%
add-sqr-sqrt65.3%
pow265.3%
sqrt-unprod53.6%
pow1/253.6%
sqrt-pow153.6%
metadata-eval53.6%
Applied egg-rr53.6%
add-sqr-sqrt53.6%
sqrt-prod53.6%
rem-sqrt-square53.6%
pow-pow53.7%
metadata-eval53.7%
pow1/253.7%
frac-times43.0%
sqrt-div44.5%
sqrt-unprod39.0%
add-sqr-sqrt74.1%
Applied egg-rr74.1%
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
(if (<= M_m 3.6e-253)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(*
(fabs (/ d (sqrt (* h l))))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 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 (M_m <= 3.6e-253) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else {
tmp = fabs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * pow(((D / d) * (M_m / 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 (m_m <= 3.6d-253) then
tmp = sqrt((d / l)) * sqrt((d / h))
else
tmp = abs((d / sqrt((h * l)))) * (1.0d0 - (0.5d0 * ((h / l) * (((d_1 / d) * (m_m / 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 (M_m <= 3.6e-253) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else {
tmp = Math.abs((d / Math.sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * Math.pow(((D / d) * (M_m / 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 M_m <= 3.6e-253: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) else: tmp = math.fabs((d / math.sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * math.pow(((D / d) * (M_m / 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 (M_m <= 3.6e-253) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); else tmp = Float64(abs(Float64(d / sqrt(Float64(h * l)))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 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 (M_m <= 3.6e-253)
tmp = sqrt((d / l)) * sqrt((d / h));
else
tmp = abs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * (((D / d) * (M_m / 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[M$95$m, 3.6e-253], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Abs[N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 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}\;M\_m \leq 3.6 \cdot 10^{-253}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\left|\frac{d}{\sqrt{h \cdot \ell}}\right| \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if M < 3.6e-253Initial program 62.5%
Simplified60.7%
Taylor expanded in d around inf 40.6%
if 3.6e-253 < M Initial program 65.5%
Simplified65.4%
add-sqr-sqrt65.3%
pow265.3%
sqrt-unprod53.6%
pow1/253.6%
sqrt-pow153.6%
metadata-eval53.6%
Applied egg-rr53.6%
add-sqr-sqrt53.6%
sqrt-prod53.6%
rem-sqrt-square53.6%
pow-pow53.7%
metadata-eval53.7%
pow1/253.7%
frac-times43.0%
sqrt-div44.5%
sqrt-unprod39.0%
add-sqr-sqrt74.1%
Applied egg-rr74.1%
Final simplification57.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 (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 2.0)) 2.0)))))
(if (<= l -2e-310)
(* (* d (sqrt (/ 1.0 (* h l)))) (+ t_0 -1.0))
(if (<= l 5.5e+118)
(* (/ d (sqrt (* h l))) (- 1.0 t_0))
(* (/ (sqrt d) (sqrt l)) (sqrt (/ d 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 = 0.5 * ((h / l) * pow(((D / d) * (M_m / 2.0)), 2.0));
double tmp;
if (l <= -2e-310) {
tmp = (d * sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
} else if (l <= 5.5e+118) {
tmp = (d / sqrt((h * l))) * (1.0 - t_0);
} else {
tmp = (sqrt(d) / sqrt(l)) * sqrt((d / 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 = 0.5d0 * ((h / l) * (((d_1 / d) * (m_m / 2.0d0)) ** 2.0d0))
if (l <= (-2d-310)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * (t_0 + (-1.0d0))
else if (l <= 5.5d+118) then
tmp = (d / sqrt((h * l))) * (1.0d0 - t_0)
else
tmp = (sqrt(d) / sqrt(l)) * sqrt((d / 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 = 0.5 * ((h / l) * Math.pow(((D / d) * (M_m / 2.0)), 2.0));
double tmp;
if (l <= -2e-310) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
} else if (l <= 5.5e+118) {
tmp = (d / Math.sqrt((h * l))) * (1.0 - t_0);
} else {
tmp = (Math.sqrt(d) / Math.sqrt(l)) * Math.sqrt((d / 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 = 0.5 * ((h / l) * math.pow(((D / d) * (M_m / 2.0)), 2.0)) tmp = 0 if l <= -2e-310: tmp = (d * math.sqrt((1.0 / (h * l)))) * (t_0 + -1.0) elif l <= 5.5e+118: tmp = (d / math.sqrt((h * l))) * (1.0 - t_0) else: tmp = (math.sqrt(d) / math.sqrt(l)) * math.sqrt((d / 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(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 2.0)) ^ 2.0))) tmp = 0.0 if (l <= -2e-310) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(t_0 + -1.0)); elseif (l <= 5.5e+118) tmp = Float64(Float64(d / sqrt(Float64(h * l))) * Float64(1.0 - t_0)); else tmp = Float64(Float64(sqrt(d) / sqrt(l)) * sqrt(Float64(d / 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 = 0.5 * ((h / l) * (((D / d) * (M_m / 2.0)) ^ 2.0));
tmp = 0.0;
if (l <= -2e-310)
tmp = (d * sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
elseif (l <= 5.5e+118)
tmp = (d / sqrt((h * l))) * (1.0 - t_0);
else
tmp = (sqrt(d) / sqrt(l)) * sqrt((d / 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[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -2e-310], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5.5e+118], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / 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 := 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\\
\mathbf{if}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(t\_0 + -1\right)\\
\mathbf{elif}\;\ell \leq 5.5 \cdot 10^{+118}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot \left(1 - t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{d}}{\sqrt{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\end{array}
\end{array}
if l < -1.999999999999994e-310Initial program 61.5%
Simplified60.3%
add-sqr-sqrt60.2%
pow260.2%
sqrt-unprod49.2%
pow1/249.2%
sqrt-pow149.2%
metadata-eval49.2%
Applied egg-rr49.2%
Taylor expanded in d around -inf 68.9%
if -1.999999999999994e-310 < l < 5.5000000000000003e118Initial program 69.4%
Simplified68.3%
add-sqr-sqrt68.3%
pow268.3%
sqrt-unprod55.7%
pow1/255.7%
sqrt-pow155.7%
metadata-eval55.7%
Applied egg-rr55.7%
*-un-lft-identity55.7%
pow-pow55.8%
metadata-eval55.8%
pow1/255.8%
frac-times44.6%
sqrt-div50.7%
sqrt-unprod77.9%
add-sqr-sqrt78.1%
Applied egg-rr78.1%
*-lft-identity78.1%
Simplified78.1%
if 5.5000000000000003e118 < l Initial program 58.4%
Simplified58.4%
sqrt-div65.7%
Applied egg-rr65.5%
Taylor expanded in M around 0 59.3%
Final simplification70.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
(let* ((t_0 (- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 2.0)) 2.0))))))
(if (<= l -1.8e+38)
(* (- d) (pow (* h l) -0.5))
(if (<= l 3.5e-309)
(* t_0 (sqrt (* (/ d l) (/ d h))))
(if (<= l 1.4e+131)
(* (/ d (sqrt (* h l))) t_0)
(* d (* (pow l -0.5) (pow h -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 t_0 = 1.0 - (0.5 * ((h / l) * pow(((D / d) * (M_m / 2.0)), 2.0)));
double tmp;
if (l <= -1.8e+38) {
tmp = -d * pow((h * l), -0.5);
} else if (l <= 3.5e-309) {
tmp = t_0 * sqrt(((d / l) * (d / h)));
} else if (l <= 1.4e+131) {
tmp = (d / sqrt((h * l))) * t_0;
} else {
tmp = d * (pow(l, -0.5) * pow(h, -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) :: t_0
real(8) :: tmp
t_0 = 1.0d0 - (0.5d0 * ((h / l) * (((d_1 / d) * (m_m / 2.0d0)) ** 2.0d0)))
if (l <= (-1.8d+38)) then
tmp = -d * ((h * l) ** (-0.5d0))
else if (l <= 3.5d-309) then
tmp = t_0 * sqrt(((d / l) * (d / h)))
else if (l <= 1.4d+131) then
tmp = (d / sqrt((h * l))) * t_0
else
tmp = d * ((l ** (-0.5d0)) * (h ** (-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 t_0 = 1.0 - (0.5 * ((h / l) * Math.pow(((D / d) * (M_m / 2.0)), 2.0)));
double tmp;
if (l <= -1.8e+38) {
tmp = -d * Math.pow((h * l), -0.5);
} else if (l <= 3.5e-309) {
tmp = t_0 * Math.sqrt(((d / l) * (d / h)));
} else if (l <= 1.4e+131) {
tmp = (d / Math.sqrt((h * l))) * t_0;
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -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): t_0 = 1.0 - (0.5 * ((h / l) * math.pow(((D / d) * (M_m / 2.0)), 2.0))) tmp = 0 if l <= -1.8e+38: tmp = -d * math.pow((h * l), -0.5) elif l <= 3.5e-309: tmp = t_0 * math.sqrt(((d / l) * (d / h))) elif l <= 1.4e+131: tmp = (d / math.sqrt((h * l))) * t_0 else: tmp = d * (math.pow(l, -0.5) * math.pow(h, -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) t_0 = Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 2.0)) ^ 2.0)))) tmp = 0.0 if (l <= -1.8e+38) tmp = Float64(Float64(-d) * (Float64(h * l) ^ -0.5)); elseif (l <= 3.5e-309) tmp = Float64(t_0 * sqrt(Float64(Float64(d / l) * Float64(d / h)))); elseif (l <= 1.4e+131) tmp = Float64(Float64(d / sqrt(Float64(h * l))) * t_0); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -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)
t_0 = 1.0 - (0.5 * ((h / l) * (((D / d) * (M_m / 2.0)) ^ 2.0)));
tmp = 0.0;
if (l <= -1.8e+38)
tmp = -d * ((h * l) ^ -0.5);
elseif (l <= 3.5e-309)
tmp = t_0 * sqrt(((d / l) * (d / h)));
elseif (l <= 1.4e+131)
tmp = (d / sqrt((h * l))) * t_0;
else
tmp = d * ((l ^ -0.5) * (h ^ -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_] := Block[{t$95$0 = N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -1.8e+38], N[((-d) * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.5e-309], N[(t$95$0 * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.4e+131], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $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 := 1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\\
\mathbf{if}\;\ell \leq -1.8 \cdot 10^{+38}:\\
\;\;\;\;\left(-d\right) \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq 3.5 \cdot 10^{-309}:\\
\;\;\;\;t\_0 \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{elif}\;\ell \leq 1.4 \cdot 10^{+131}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -1.79999999999999985e38Initial program 52.7%
Simplified53.5%
Taylor expanded in d around inf 6.0%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow-10.0%
metadata-eval0.0%
pow-sqr0.0%
rem-sqrt-square0.0%
rem-square-sqrt0.0%
fabs-sqr0.0%
rem-square-sqrt0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt58.7%
mul-1-neg58.7%
Simplified58.7%
if -1.79999999999999985e38 < l < 3.4999999999999992e-309Initial program 70.1%
Simplified67.0%
pow167.0%
sqrt-unprod59.2%
Applied egg-rr59.2%
unpow159.2%
Simplified59.2%
if 3.4999999999999992e-309 < l < 1.4e131Initial program 69.3%
Simplified68.3%
add-sqr-sqrt68.2%
pow268.2%
sqrt-unprod56.1%
pow1/256.1%
sqrt-pow156.0%
metadata-eval56.0%
Applied egg-rr56.0%
*-un-lft-identity56.0%
pow-pow56.1%
metadata-eval56.1%
pow1/256.1%
frac-times45.3%
sqrt-div51.2%
sqrt-unprod77.6%
add-sqr-sqrt77.7%
Applied egg-rr77.7%
*-lft-identity77.7%
Simplified77.7%
if 1.4e131 < l Initial program 57.7%
Simplified57.7%
sqrt-div65.6%
Applied egg-rr65.4%
Taylor expanded in d around inf 41.5%
unpow-141.5%
metadata-eval41.5%
pow-sqr41.5%
rem-sqrt-square41.5%
rem-square-sqrt41.2%
fabs-sqr41.2%
rem-square-sqrt41.5%
Simplified41.5%
*-commutative41.5%
unpow-prod-down58.6%
Applied egg-rr58.6%
Final simplification66.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 -1.02e-81)
(* (- d) (pow (* h l) -0.5))
(if (<= l -2e-310)
(* d (pow (+ -1.0 (fma h l 1.0)) -0.5))
(if (<= l 9.5e+130)
(*
(/ d (sqrt (* h l)))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 2.0)) 2.0)))))
(* d (* (pow l -0.5) (pow h -0.5)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.02e-81) {
tmp = -d * pow((h * l), -0.5);
} else if (l <= -2e-310) {
tmp = d * pow((-1.0 + fma(h, l, 1.0)), -0.5);
} else if (l <= 9.5e+130) {
tmp = (d / sqrt((h * l))) * (1.0 - (0.5 * ((h / l) * pow(((D / d) * (M_m / 2.0)), 2.0))));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -1.02e-81) tmp = Float64(Float64(-d) * (Float64(h * l) ^ -0.5)); elseif (l <= -2e-310) tmp = Float64(d * (Float64(-1.0 + fma(h, l, 1.0)) ^ -0.5)); elseif (l <= 9.5e+130) tmp = Float64(Float64(d / sqrt(Float64(h * l))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 2.0)) ^ 2.0))))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -1.02e-81], N[((-d) * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -2e-310], N[(d * N[Power[N[(-1.0 + N[(h * l + 1.0), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 9.5e+130], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.02 \cdot 10^{-81}:\\
\;\;\;\;\left(-d\right) \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;d \cdot {\left(-1 + \mathsf{fma}\left(h, \ell, 1\right)\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq 9.5 \cdot 10^{+130}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -1.01999999999999998e-81Initial program 55.7%
Simplified55.1%
Taylor expanded in d around inf 6.6%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow-10.0%
metadata-eval0.0%
pow-sqr0.0%
rem-sqrt-square0.0%
rem-square-sqrt0.0%
fabs-sqr0.0%
rem-square-sqrt0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt53.8%
mul-1-neg53.8%
Simplified53.8%
if -1.01999999999999998e-81 < l < -1.999999999999994e-310Initial program 72.4%
Simplified67.8%
sqrt-div0.0%
Applied egg-rr0.0%
Taylor expanded in d around inf 18.2%
unpow-118.2%
metadata-eval18.2%
pow-sqr18.2%
rem-sqrt-square18.2%
rem-square-sqrt18.2%
fabs-sqr18.2%
rem-square-sqrt18.2%
Simplified18.2%
expm1-log1p-u18.2%
expm1-undefine43.0%
Applied egg-rr43.0%
sub-neg43.0%
metadata-eval43.0%
+-commutative43.0%
log1p-undefine43.0%
rem-exp-log43.0%
+-commutative43.0%
fma-define43.0%
Simplified43.0%
if -1.999999999999994e-310 < l < 9.5000000000000009e130Initial program 69.3%
Simplified68.3%
add-sqr-sqrt68.2%
pow268.2%
sqrt-unprod56.1%
pow1/256.1%
sqrt-pow156.0%
metadata-eval56.0%
Applied egg-rr56.0%
*-un-lft-identity56.0%
pow-pow56.1%
metadata-eval56.1%
pow1/256.1%
frac-times45.3%
sqrt-div51.2%
sqrt-unprod77.6%
add-sqr-sqrt77.7%
Applied egg-rr77.7%
*-lft-identity77.7%
Simplified77.7%
if 9.5000000000000009e130 < l Initial program 57.7%
Simplified57.7%
sqrt-div65.6%
Applied egg-rr65.4%
Taylor expanded in d around inf 41.5%
unpow-141.5%
metadata-eval41.5%
pow-sqr41.5%
rem-sqrt-square41.5%
rem-square-sqrt41.2%
fabs-sqr41.2%
rem-square-sqrt41.5%
Simplified41.5%
*-commutative41.5%
unpow-prod-down58.6%
Applied egg-rr58.6%
Final simplification61.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 (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 2.0)) 2.0)))))
(if (<= l -2e-310)
(* (* d (sqrt (/ 1.0 (* h l)))) (+ t_0 -1.0))
(if (<= l 1.45e+131)
(* (/ d (sqrt (* h l))) (- 1.0 t_0))
(* d (* (pow l -0.5) (pow h -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 t_0 = 0.5 * ((h / l) * pow(((D / d) * (M_m / 2.0)), 2.0));
double tmp;
if (l <= -2e-310) {
tmp = (d * sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
} else if (l <= 1.45e+131) {
tmp = (d / sqrt((h * l))) * (1.0 - t_0);
} else {
tmp = d * (pow(l, -0.5) * pow(h, -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) :: t_0
real(8) :: tmp
t_0 = 0.5d0 * ((h / l) * (((d_1 / d) * (m_m / 2.0d0)) ** 2.0d0))
if (l <= (-2d-310)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * (t_0 + (-1.0d0))
else if (l <= 1.45d+131) then
tmp = (d / sqrt((h * l))) * (1.0d0 - t_0)
else
tmp = d * ((l ** (-0.5d0)) * (h ** (-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 t_0 = 0.5 * ((h / l) * Math.pow(((D / d) * (M_m / 2.0)), 2.0));
double tmp;
if (l <= -2e-310) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
} else if (l <= 1.45e+131) {
tmp = (d / Math.sqrt((h * l))) * (1.0 - t_0);
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -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): t_0 = 0.5 * ((h / l) * math.pow(((D / d) * (M_m / 2.0)), 2.0)) tmp = 0 if l <= -2e-310: tmp = (d * math.sqrt((1.0 / (h * l)))) * (t_0 + -1.0) elif l <= 1.45e+131: tmp = (d / math.sqrt((h * l))) * (1.0 - t_0) else: tmp = d * (math.pow(l, -0.5) * math.pow(h, -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) t_0 = Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 2.0)) ^ 2.0))) tmp = 0.0 if (l <= -2e-310) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(t_0 + -1.0)); elseif (l <= 1.45e+131) tmp = Float64(Float64(d / sqrt(Float64(h * l))) * Float64(1.0 - t_0)); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -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)
t_0 = 0.5 * ((h / l) * (((D / d) * (M_m / 2.0)) ^ 2.0));
tmp = 0.0;
if (l <= -2e-310)
tmp = (d * sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
elseif (l <= 1.45e+131)
tmp = (d / sqrt((h * l))) * (1.0 - t_0);
else
tmp = d * ((l ^ -0.5) * (h ^ -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_] := Block[{t$95$0 = N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -2e-310], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.45e+131], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - t$95$0), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $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 := 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\\
\mathbf{if}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(t\_0 + -1\right)\\
\mathbf{elif}\;\ell \leq 1.45 \cdot 10^{+131}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot \left(1 - t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -1.999999999999994e-310Initial program 61.5%
Simplified60.3%
add-sqr-sqrt60.2%
pow260.2%
sqrt-unprod49.2%
pow1/249.2%
sqrt-pow149.2%
metadata-eval49.2%
Applied egg-rr49.2%
Taylor expanded in d around -inf 68.9%
if -1.999999999999994e-310 < l < 1.45000000000000005e131Initial program 69.3%
Simplified68.3%
add-sqr-sqrt68.2%
pow268.2%
sqrt-unprod56.1%
pow1/256.1%
sqrt-pow156.0%
metadata-eval56.0%
Applied egg-rr56.0%
*-un-lft-identity56.0%
pow-pow56.1%
metadata-eval56.1%
pow1/256.1%
frac-times45.3%
sqrt-div51.2%
sqrt-unprod77.6%
add-sqr-sqrt77.7%
Applied egg-rr77.7%
*-lft-identity77.7%
Simplified77.7%
if 1.45000000000000005e131 < l Initial program 57.7%
Simplified57.7%
sqrt-div65.6%
Applied egg-rr65.4%
Taylor expanded in d around inf 41.5%
unpow-141.5%
metadata-eval41.5%
pow-sqr41.5%
rem-sqrt-square41.5%
rem-square-sqrt41.2%
fabs-sqr41.2%
rem-square-sqrt41.5%
Simplified41.5%
*-commutative41.5%
unpow-prod-down58.6%
Applied egg-rr58.6%
Final simplification70.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 -9.8e-82)
(* (- d) (pow (* h l) -0.5))
(if (<= l -2e-310)
(* d (pow (+ -1.0 (fma h l 1.0)) -0.5))
(* d (/ (sqrt (/ 1.0 h)) (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 <= -9.8e-82) {
tmp = -d * pow((h * l), -0.5);
} else if (l <= -2e-310) {
tmp = d * pow((-1.0 + fma(h, l, 1.0)), -0.5);
} else {
tmp = d * (sqrt((1.0 / h)) / 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 <= -9.8e-82) tmp = Float64(Float64(-d) * (Float64(h * l) ^ -0.5)); elseif (l <= -2e-310) tmp = Float64(d * (Float64(-1.0 + fma(h, l, 1.0)) ^ -0.5)); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -9.8e-82], N[((-d) * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -2e-310], N[(d * N[Power[N[(-1.0 + N[(h * l + 1.0), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $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 -9.8 \cdot 10^{-82}:\\
\;\;\;\;\left(-d\right) \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;d \cdot {\left(-1 + \mathsf{fma}\left(h, \ell, 1\right)\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -9.8000000000000006e-82Initial program 55.7%
Simplified55.1%
Taylor expanded in d around inf 6.6%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow-10.0%
metadata-eval0.0%
pow-sqr0.0%
rem-sqrt-square0.0%
rem-square-sqrt0.0%
fabs-sqr0.0%
rem-square-sqrt0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt53.8%
mul-1-neg53.8%
Simplified53.8%
if -9.8000000000000006e-82 < l < -1.999999999999994e-310Initial program 72.4%
Simplified67.8%
sqrt-div0.0%
Applied egg-rr0.0%
Taylor expanded in d around inf 18.2%
unpow-118.2%
metadata-eval18.2%
pow-sqr18.2%
rem-sqrt-square18.2%
rem-square-sqrt18.2%
fabs-sqr18.2%
rem-square-sqrt18.2%
Simplified18.2%
expm1-log1p-u18.2%
expm1-undefine43.0%
Applied egg-rr43.0%
sub-neg43.0%
metadata-eval43.0%
+-commutative43.0%
log1p-undefine43.0%
rem-exp-log43.0%
+-commutative43.0%
fma-define43.0%
Simplified43.0%
if -1.999999999999994e-310 < l Initial program 66.3%
Simplified65.5%
Taylor expanded in d around inf 44.4%
associate-/r*45.3%
sqrt-div50.3%
Applied egg-rr50.3%
Final simplification50.2%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (<= l -1.1e-81) (* (- d) (pow (* h l) -0.5)) (if (<= l 9.5e-250) (log1p (expm1 d)) (* d (/ (sqrt (/ 1.0 h)) (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 <= -1.1e-81) {
tmp = -d * pow((h * l), -0.5);
} else if (l <= 9.5e-250) {
tmp = log1p(expm1(d));
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
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 (l <= -1.1e-81) {
tmp = -d * Math.pow((h * l), -0.5);
} else if (l <= 9.5e-250) {
tmp = Math.log1p(Math.expm1(d));
} else {
tmp = d * (Math.sqrt((1.0 / h)) / 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 <= -1.1e-81: tmp = -d * math.pow((h * l), -0.5) elif l <= 9.5e-250: tmp = math.log1p(math.expm1(d)) else: tmp = d * (math.sqrt((1.0 / h)) / 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 <= -1.1e-81) tmp = Float64(Float64(-d) * (Float64(h * l) ^ -0.5)); elseif (l <= 9.5e-250) tmp = log1p(expm1(d)); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -1.1e-81], N[((-d) * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 9.5e-250], N[Log[1 + N[(Exp[d] - 1), $MachinePrecision]], $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $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 -1.1 \cdot 10^{-81}:\\
\;\;\;\;\left(-d\right) \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq 9.5 \cdot 10^{-250}:\\
\;\;\;\;\mathsf{log1p}\left(\mathsf{expm1}\left(d\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.1e-81Initial program 55.7%
Simplified55.1%
Taylor expanded in d around inf 6.6%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow-10.0%
metadata-eval0.0%
pow-sqr0.0%
rem-sqrt-square0.0%
rem-square-sqrt0.0%
fabs-sqr0.0%
rem-square-sqrt0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt53.8%
mul-1-neg53.8%
Simplified53.8%
if -1.1e-81 < l < 9.5000000000000002e-250Initial program 73.9%
Simplified70.5%
Taylor expanded in d around inf 20.8%
add-exp-log20.8%
log-rec20.8%
Applied egg-rr20.8%
exp-neg20.8%
add-exp-log20.8%
add-sqr-sqrt20.8%
associate-/r*20.8%
metadata-eval20.8%
sqrt-div20.8%
add-exp-log20.8%
exp-neg20.8%
add-sqr-sqrt20.4%
sqrt-unprod20.8%
sqr-neg20.8%
sqrt-unprod0.5%
add-sqr-sqrt1.7%
add-exp-log1.7%
*-commutative1.7%
*-commutative1.7%
Applied egg-rr1.7%
*-inverses2.9%
Simplified2.9%
metadata-eval2.9%
*-rgt-identity2.9%
log1p-expm1-u32.6%
Applied egg-rr32.6%
if 9.5000000000000002e-250 < l Initial program 64.8%
Simplified64.0%
Taylor expanded in d around inf 46.2%
associate-/r*47.2%
sqrt-div52.8%
Applied egg-rr52.8%
Final simplification48.6%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (<= l -1.1e-81) (* (- d) (pow (* h l) -0.5)) (if (<= l 9.5e-250) (log1p (expm1 d)) (* d (* (pow l -0.5) (pow h -0.5))))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.1e-81) {
tmp = -d * pow((h * l), -0.5);
} else if (l <= 9.5e-250) {
tmp = log1p(expm1(d));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
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 (l <= -1.1e-81) {
tmp = -d * Math.pow((h * l), -0.5);
} else if (l <= 9.5e-250) {
tmp = Math.log1p(Math.expm1(d));
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -0.5));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -1.1e-81: tmp = -d * math.pow((h * l), -0.5) elif l <= 9.5e-250: tmp = math.log1p(math.expm1(d)) else: tmp = d * (math.pow(l, -0.5) * math.pow(h, -0.5)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -1.1e-81) tmp = Float64(Float64(-d) * (Float64(h * l) ^ -0.5)); elseif (l <= 9.5e-250) tmp = log1p(expm1(d)); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -1.1e-81], N[((-d) * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 9.5e-250], N[Log[1 + N[(Exp[d] - 1), $MachinePrecision]], $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.1 \cdot 10^{-81}:\\
\;\;\;\;\left(-d\right) \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq 9.5 \cdot 10^{-250}:\\
\;\;\;\;\mathsf{log1p}\left(\mathsf{expm1}\left(d\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -1.1e-81Initial program 55.7%
Simplified55.1%
Taylor expanded in d around inf 6.6%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow-10.0%
metadata-eval0.0%
pow-sqr0.0%
rem-sqrt-square0.0%
rem-square-sqrt0.0%
fabs-sqr0.0%
rem-square-sqrt0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt53.8%
mul-1-neg53.8%
Simplified53.8%
if -1.1e-81 < l < 9.5000000000000002e-250Initial program 73.9%
Simplified70.5%
Taylor expanded in d around inf 20.8%
add-exp-log20.8%
log-rec20.8%
Applied egg-rr20.8%
exp-neg20.8%
add-exp-log20.8%
add-sqr-sqrt20.8%
associate-/r*20.8%
metadata-eval20.8%
sqrt-div20.8%
add-exp-log20.8%
exp-neg20.8%
add-sqr-sqrt20.4%
sqrt-unprod20.8%
sqr-neg20.8%
sqrt-unprod0.5%
add-sqr-sqrt1.7%
add-exp-log1.7%
*-commutative1.7%
*-commutative1.7%
Applied egg-rr1.7%
*-inverses2.9%
Simplified2.9%
metadata-eval2.9%
*-rgt-identity2.9%
log1p-expm1-u32.6%
Applied egg-rr32.6%
if 9.5000000000000002e-250 < l Initial program 64.8%
Simplified64.0%
sqrt-div68.8%
Applied egg-rr68.7%
Taylor expanded in d around inf 46.2%
unpow-146.2%
metadata-eval46.2%
pow-sqr46.2%
rem-sqrt-square46.9%
rem-square-sqrt46.7%
fabs-sqr46.7%
rem-square-sqrt46.9%
Simplified46.9%
*-commutative46.9%
unpow-prod-down52.8%
Applied egg-rr52.8%
Final simplification48.6%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (<= l -1.45e-81) (* (- d) (pow (* h l) -0.5)) (if (<= l 9.5e-250) (log1p (expm1 d)) (* 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 <= -1.45e-81) {
tmp = -d * pow((h * l), -0.5);
} else if (l <= 9.5e-250) {
tmp = log1p(expm1(d));
} else {
tmp = d * sqrt(((1.0 / l) / h));
}
return tmp;
}
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.45e-81) {
tmp = -d * Math.pow((h * l), -0.5);
} else if (l <= 9.5e-250) {
tmp = Math.log1p(Math.expm1(d));
} 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 <= -1.45e-81: tmp = -d * math.pow((h * l), -0.5) elif l <= 9.5e-250: tmp = math.log1p(math.expm1(d)) 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 <= -1.45e-81) tmp = Float64(Float64(-d) * (Float64(h * l) ^ -0.5)); elseif (l <= 9.5e-250) tmp = log1p(expm1(d)); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / l) / h))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -1.45e-81], N[((-d) * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 9.5e-250], N[Log[1 + N[(Exp[d] - 1), $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 -1.45 \cdot 10^{-81}:\\
\;\;\;\;\left(-d\right) \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq 9.5 \cdot 10^{-250}:\\
\;\;\;\;\mathsf{log1p}\left(\mathsf{expm1}\left(d\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\end{array}
\end{array}
if l < -1.44999999999999994e-81Initial program 55.7%
Simplified55.1%
Taylor expanded in d around inf 6.6%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow-10.0%
metadata-eval0.0%
pow-sqr0.0%
rem-sqrt-square0.0%
rem-square-sqrt0.0%
fabs-sqr0.0%
rem-square-sqrt0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt53.8%
mul-1-neg53.8%
Simplified53.8%
if -1.44999999999999994e-81 < l < 9.5000000000000002e-250Initial program 73.9%
Simplified70.5%
Taylor expanded in d around inf 20.8%
add-exp-log20.8%
log-rec20.8%
Applied egg-rr20.8%
exp-neg20.8%
add-exp-log20.8%
add-sqr-sqrt20.8%
associate-/r*20.8%
metadata-eval20.8%
sqrt-div20.8%
add-exp-log20.8%
exp-neg20.8%
add-sqr-sqrt20.4%
sqrt-unprod20.8%
sqr-neg20.8%
sqrt-unprod0.5%
add-sqr-sqrt1.7%
add-exp-log1.7%
*-commutative1.7%
*-commutative1.7%
Applied egg-rr1.7%
*-inverses2.9%
Simplified2.9%
metadata-eval2.9%
*-rgt-identity2.9%
log1p-expm1-u32.6%
Applied egg-rr32.6%
if 9.5000000000000002e-250 < l Initial program 64.8%
Simplified64.0%
Taylor expanded in d around inf 46.2%
add-exp-log43.8%
log-rec43.8%
Applied egg-rr43.8%
exp-neg43.8%
add-exp-log46.2%
*-commutative46.2%
associate-/r*47.3%
Applied egg-rr47.3%
Final simplification46.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 -1.45e-247) (* (- 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 <= -1.45e-247) {
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 <= (-1.45d-247)) 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 <= -1.45e-247) {
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 <= -1.45e-247: 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 <= -1.45e-247) 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 <= -1.45e-247)
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, -1.45e-247], 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 -1.45 \cdot 10^{-247}:\\
\;\;\;\;\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 < -1.45e-247Initial program 59.0%
Simplified57.7%
Taylor expanded in d around inf 8.8%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow-10.0%
metadata-eval0.0%
pow-sqr0.0%
rem-sqrt-square0.0%
rem-square-sqrt0.0%
fabs-sqr0.0%
rem-square-sqrt0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt43.9%
mul-1-neg43.9%
Simplified43.9%
if -1.45e-247 < l Initial program 67.9%
Simplified66.5%
Taylor expanded in d around inf 43.5%
add-exp-log41.5%
log-rec41.5%
Applied egg-rr41.5%
exp-neg41.5%
add-exp-log43.5%
*-commutative43.5%
associate-/r*44.4%
Applied egg-rr44.4%
Final simplification44.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 (* 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) {
return d * sqrt(((1.0 / 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(((1.0d0 / 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(((1.0 / 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(((1.0 / 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(Float64(1.0 / 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(((1.0 / 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[(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])\\
\\
d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}
\end{array}
Initial program 64.0%
Simplified62.6%
Taylor expanded in d around inf 28.2%
add-exp-log27.0%
log-rec27.0%
Applied egg-rr27.0%
exp-neg27.0%
add-exp-log28.2%
*-commutative28.2%
associate-/r*28.7%
Applied egg-rr28.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 (* d (sqrt (/ (/ 1.0 h) l))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
return d * sqrt(((1.0 / h) / l));
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
code = d * sqrt(((1.0d0 / h) / l))
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
return d * Math.sqrt(((1.0 / h) / l));
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): return d * math.sqrt(((1.0 / h) / l))
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) return Float64(d * sqrt(Float64(Float64(1.0 / h) / l))) end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp = code(d, h, l, M_m, D)
tmp = d * sqrt(((1.0 / h) / l));
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := N[(d * N[Sqrt[N[(N[(1.0 / h), $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])\\
\\
d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}
\end{array}
Initial program 64.0%
Simplified62.6%
sqrt-div36.3%
Applied egg-rr36.2%
Taylor expanded in d around inf 28.2%
associate-/r*28.6%
Simplified28.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 (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 64.0%
Simplified62.6%
sqrt-div36.3%
Applied egg-rr36.2%
Taylor expanded in d around inf 28.2%
unpow-128.2%
metadata-eval28.2%
pow-sqr28.1%
rem-sqrt-square28.5%
rem-square-sqrt28.4%
fabs-sqr28.4%
rem-square-sqrt28.5%
Simplified28.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 (fabs 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) {
return fabs(d);
}
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 = abs(d)
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.abs(d);
}
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.fabs(d)
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 abs(d) 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 = abs(d);
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[Abs[d], $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\left|d\right|
\end{array}
Initial program 64.0%
Simplified62.6%
Taylor expanded in d around inf 28.2%
add-exp-log27.0%
log-rec27.0%
Applied egg-rr27.0%
exp-neg27.0%
add-exp-log28.2%
add-sqr-sqrt28.1%
associate-/r*28.1%
metadata-eval28.1%
sqrt-div28.2%
add-exp-log27.3%
exp-neg27.3%
add-sqr-sqrt16.0%
sqrt-unprod17.4%
sqr-neg17.4%
sqrt-unprod1.3%
add-sqr-sqrt2.7%
add-exp-log2.7%
*-commutative2.7%
*-commutative2.7%
Applied egg-rr2.7%
*-inverses3.5%
Simplified3.5%
metadata-eval3.5%
*-rgt-identity3.5%
add-sqr-sqrt2.2%
pow1/22.2%
pow1/22.2%
pow-prod-down10.5%
pow210.5%
Applied egg-rr10.5%
unpow1/210.5%
unpow210.5%
rem-sqrt-square4.2%
Simplified4.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 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) {
return d;
}
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
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;
}
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
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 d 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;
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_] := d
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
d
\end{array}
Initial program 64.0%
Simplified62.6%
Taylor expanded in d around inf 28.2%
add-exp-log27.0%
log-rec27.0%
Applied egg-rr27.0%
exp-neg27.0%
add-exp-log28.2%
add-sqr-sqrt28.1%
associate-/r*28.1%
metadata-eval28.1%
sqrt-div28.2%
add-exp-log27.3%
exp-neg27.3%
add-sqr-sqrt16.0%
sqrt-unprod17.4%
sqr-neg17.4%
sqrt-unprod1.3%
add-sqr-sqrt2.7%
add-exp-log2.7%
*-commutative2.7%
*-commutative2.7%
Applied egg-rr2.7%
*-inverses3.5%
Simplified3.5%
Taylor expanded in d around 0 3.5%
herbie shell --seed 2024130
(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)))))