
(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 20 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)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0
(*
(sqrt (/ d l))
(- 1.0 (* h (* (/ 0.125 l) (pow (* D_m (/ M_m d)) 2.0)))))))
(if (<= h -5e-312)
(* (/ (sqrt (- d)) (sqrt (- h))) t_0)
(* t_0 (/ (sqrt d) (sqrt h))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l)) * (1.0 - (h * ((0.125 / l) * pow((D_m * (M_m / d)), 2.0))));
double tmp;
if (h <= -5e-312) {
tmp = (sqrt(-d) / sqrt(-h)) * t_0;
} else {
tmp = t_0 * (sqrt(d) / sqrt(h));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((d / l)) * (1.0d0 - (h * ((0.125d0 / l) * ((d_m * (m_m / d)) ** 2.0d0))))
if (h <= (-5d-312)) then
tmp = (sqrt(-d) / sqrt(-h)) * t_0
else
tmp = t_0 * (sqrt(d) / sqrt(h))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((d / l)) * (1.0 - (h * ((0.125 / l) * Math.pow((D_m * (M_m / d)), 2.0))));
double tmp;
if (h <= -5e-312) {
tmp = (Math.sqrt(-d) / Math.sqrt(-h)) * t_0;
} else {
tmp = t_0 * (Math.sqrt(d) / Math.sqrt(h));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((d / l)) * (1.0 - (h * ((0.125 / l) * math.pow((D_m * (M_m / d)), 2.0)))) tmp = 0 if h <= -5e-312: tmp = (math.sqrt(-d) / math.sqrt(-h)) * t_0 else: tmp = t_0 * (math.sqrt(d) / math.sqrt(h)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(sqrt(Float64(d / l)) * Float64(1.0 - Float64(h * Float64(Float64(0.125 / l) * (Float64(D_m * Float64(M_m / d)) ^ 2.0))))) tmp = 0.0 if (h <= -5e-312) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0); else tmp = Float64(t_0 * Float64(sqrt(d) / sqrt(h))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((d / l)) * (1.0 - (h * ((0.125 / l) * ((D_m * (M_m / d)) ^ 2.0))));
tmp = 0.0;
if (h <= -5e-312)
tmp = (sqrt(-d) / sqrt(-h)) * t_0;
else
tmp = t_0 * (sqrt(d) / sqrt(h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(h * N[(N[(0.125 / l), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -5e-312], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}} \cdot \left(1 - h \cdot \left(\frac{0.125}{\ell} \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{if}\;h \leq -5 \cdot 10^{-312}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \frac{\sqrt{d}}{\sqrt{h}}\\
\end{array}
\end{array}
if h < -5.0000000000022e-312Initial program 62.2%
Simplified61.4%
Taylor expanded in h around -inf 43.3%
associate-*r*43.3%
neg-mul-143.3%
sub-neg43.3%
distribute-lft-in43.3%
Simplified63.1%
frac-2neg63.1%
sqrt-div79.1%
Applied egg-rr79.1%
if -5.0000000000022e-312 < h Initial program 66.8%
Simplified66.2%
Taylor expanded in h around -inf 45.2%
associate-*r*45.2%
neg-mul-145.2%
sub-neg45.2%
distribute-lft-in45.2%
Simplified67.8%
sqrt-div79.2%
Applied egg-rr79.2%
Final simplification79.1%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l)))
(t_1 (- 1.0 (* h (* (/ 0.125 l) (pow (* D_m (/ M_m d)) 2.0)))))
(t_2 (sqrt (- d))))
(if (<= l -2.6e+125)
(* (/ t_2 (sqrt (- h))) t_0)
(if (<= l -2e-310)
(* (sqrt (/ d h)) (* t_1 (/ t_2 (sqrt (- l)))))
(* (* t_0 t_1) (/ (sqrt d) (sqrt h)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double t_1 = 1.0 - (h * ((0.125 / l) * pow((D_m * (M_m / d)), 2.0)));
double t_2 = sqrt(-d);
double tmp;
if (l <= -2.6e+125) {
tmp = (t_2 / sqrt(-h)) * t_0;
} else if (l <= -2e-310) {
tmp = sqrt((d / h)) * (t_1 * (t_2 / sqrt(-l)));
} else {
tmp = (t_0 * t_1) * (sqrt(d) / sqrt(h));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = sqrt((d / l))
t_1 = 1.0d0 - (h * ((0.125d0 / l) * ((d_m * (m_m / d)) ** 2.0d0)))
t_2 = sqrt(-d)
if (l <= (-2.6d+125)) then
tmp = (t_2 / sqrt(-h)) * t_0
else if (l <= (-2d-310)) then
tmp = sqrt((d / h)) * (t_1 * (t_2 / sqrt(-l)))
else
tmp = (t_0 * t_1) * (sqrt(d) / sqrt(h))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((d / l));
double t_1 = 1.0 - (h * ((0.125 / l) * Math.pow((D_m * (M_m / d)), 2.0)));
double t_2 = Math.sqrt(-d);
double tmp;
if (l <= -2.6e+125) {
tmp = (t_2 / Math.sqrt(-h)) * t_0;
} else if (l <= -2e-310) {
tmp = Math.sqrt((d / h)) * (t_1 * (t_2 / Math.sqrt(-l)));
} else {
tmp = (t_0 * t_1) * (Math.sqrt(d) / Math.sqrt(h));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((d / l)) t_1 = 1.0 - (h * ((0.125 / l) * math.pow((D_m * (M_m / d)), 2.0))) t_2 = math.sqrt(-d) tmp = 0 if l <= -2.6e+125: tmp = (t_2 / math.sqrt(-h)) * t_0 elif l <= -2e-310: tmp = math.sqrt((d / h)) * (t_1 * (t_2 / math.sqrt(-l))) else: tmp = (t_0 * t_1) * (math.sqrt(d) / math.sqrt(h)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) t_1 = Float64(1.0 - Float64(h * Float64(Float64(0.125 / l) * (Float64(D_m * Float64(M_m / d)) ^ 2.0)))) t_2 = sqrt(Float64(-d)) tmp = 0.0 if (l <= -2.6e+125) tmp = Float64(Float64(t_2 / sqrt(Float64(-h))) * t_0); elseif (l <= -2e-310) tmp = Float64(sqrt(Float64(d / h)) * Float64(t_1 * Float64(t_2 / sqrt(Float64(-l))))); else tmp = Float64(Float64(t_0 * t_1) * Float64(sqrt(d) / sqrt(h))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((d / l));
t_1 = 1.0 - (h * ((0.125 / l) * ((D_m * (M_m / d)) ^ 2.0)));
t_2 = sqrt(-d);
tmp = 0.0;
if (l <= -2.6e+125)
tmp = (t_2 / sqrt(-h)) * t_0;
elseif (l <= -2e-310)
tmp = sqrt((d / h)) * (t_1 * (t_2 / sqrt(-l)));
else
tmp = (t_0 * t_1) * (sqrt(d) / sqrt(h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(1.0 - N[(h * N[(N[(0.125 / l), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[l, -2.6e+125], N[(N[(t$95$2 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[l, -2e-310], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(t$95$1 * N[(t$95$2 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * t$95$1), $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
t_1 := 1 - h \cdot \left(\frac{0.125}{\ell} \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)\\
t_2 := \sqrt{-d}\\
\mathbf{if}\;\ell \leq -2.6 \cdot 10^{+125}:\\
\;\;\;\;\frac{t\_2}{\sqrt{-h}} \cdot t\_0\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(t\_1 \cdot \frac{t\_2}{\sqrt{-\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_0 \cdot t\_1\right) \cdot \frac{\sqrt{d}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -2.60000000000000003e125Initial program 52.0%
Simplified51.9%
Taylor expanded in M around 0 47.5%
frac-2neg52.1%
sqrt-div77.5%
Applied egg-rr72.8%
if -2.60000000000000003e125 < l < -1.999999999999994e-310Initial program 67.0%
Simplified65.9%
Taylor expanded in h around -inf 48.0%
associate-*r*48.0%
neg-mul-148.0%
sub-neg48.0%
distribute-lft-in48.0%
Simplified68.2%
frac-2neg68.2%
sqrt-div73.6%
Applied egg-rr73.6%
if -1.999999999999994e-310 < l Initial program 66.8%
Simplified66.2%
Taylor expanded in h around -inf 45.2%
associate-*r*45.2%
neg-mul-145.2%
sub-neg45.2%
distribute-lft-in45.2%
Simplified67.8%
sqrt-div79.2%
Applied egg-rr79.2%
Final simplification76.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= l -2.85e+125)
(* (/ (sqrt (- d)) (sqrt (- h))) t_0)
(if (<= l -2e-310)
(*
(* t_0 (sqrt (/ d h)))
(- 1.0 (* (/ 0.125 l) (* h (pow (/ (* D_m M_m) d) 2.0)))))
(*
(* t_0 (- 1.0 (* h (* (/ 0.125 l) (pow (* D_m (/ M_m d)) 2.0)))))
(/ (sqrt d) (sqrt h)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double tmp;
if (l <= -2.85e+125) {
tmp = (sqrt(-d) / sqrt(-h)) * t_0;
} else if (l <= -2e-310) {
tmp = (t_0 * sqrt((d / h))) * (1.0 - ((0.125 / l) * (h * pow(((D_m * M_m) / d), 2.0))));
} else {
tmp = (t_0 * (1.0 - (h * ((0.125 / l) * pow((D_m * (M_m / d)), 2.0))))) * (sqrt(d) / sqrt(h));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((d / l))
if (l <= (-2.85d+125)) then
tmp = (sqrt(-d) / sqrt(-h)) * t_0
else if (l <= (-2d-310)) then
tmp = (t_0 * sqrt((d / h))) * (1.0d0 - ((0.125d0 / l) * (h * (((d_m * m_m) / d) ** 2.0d0))))
else
tmp = (t_0 * (1.0d0 - (h * ((0.125d0 / l) * ((d_m * (m_m / d)) ** 2.0d0))))) * (sqrt(d) / sqrt(h))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((d / l));
double tmp;
if (l <= -2.85e+125) {
tmp = (Math.sqrt(-d) / Math.sqrt(-h)) * t_0;
} else if (l <= -2e-310) {
tmp = (t_0 * Math.sqrt((d / h))) * (1.0 - ((0.125 / l) * (h * Math.pow(((D_m * M_m) / d), 2.0))));
} else {
tmp = (t_0 * (1.0 - (h * ((0.125 / l) * Math.pow((D_m * (M_m / d)), 2.0))))) * (Math.sqrt(d) / Math.sqrt(h));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((d / l)) tmp = 0 if l <= -2.85e+125: tmp = (math.sqrt(-d) / math.sqrt(-h)) * t_0 elif l <= -2e-310: tmp = (t_0 * math.sqrt((d / h))) * (1.0 - ((0.125 / l) * (h * math.pow(((D_m * M_m) / d), 2.0)))) else: tmp = (t_0 * (1.0 - (h * ((0.125 / l) * math.pow((D_m * (M_m / d)), 2.0))))) * (math.sqrt(d) / math.sqrt(h)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (l <= -2.85e+125) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0); elseif (l <= -2e-310) tmp = Float64(Float64(t_0 * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(0.125 / l) * Float64(h * (Float64(Float64(D_m * M_m) / d) ^ 2.0))))); else tmp = Float64(Float64(t_0 * Float64(1.0 - Float64(h * Float64(Float64(0.125 / l) * (Float64(D_m * Float64(M_m / d)) ^ 2.0))))) * Float64(sqrt(d) / sqrt(h))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((d / l));
tmp = 0.0;
if (l <= -2.85e+125)
tmp = (sqrt(-d) / sqrt(-h)) * t_0;
elseif (l <= -2e-310)
tmp = (t_0 * sqrt((d / h))) * (1.0 - ((0.125 / l) * (h * (((D_m * M_m) / d) ^ 2.0))));
else
tmp = (t_0 * (1.0 - (h * ((0.125 / l) * ((D_m * (M_m / d)) ^ 2.0))))) * (sqrt(d) / sqrt(h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -2.85e+125], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[l, -2e-310], N[(N[(t$95$0 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * N[(1.0 - N[(h * N[(N[(0.125 / l), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;\ell \leq -2.85 \cdot 10^{+125}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(t\_0 \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{0.125}{\ell} \cdot \left(h \cdot {\left(\frac{D\_m \cdot M\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_0 \cdot \left(1 - h \cdot \left(\frac{0.125}{\ell} \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\right) \cdot \frac{\sqrt{d}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -2.8499999999999998e125Initial program 52.0%
Simplified51.9%
Taylor expanded in M around 0 47.5%
frac-2neg52.1%
sqrt-div77.5%
Applied egg-rr72.8%
if -2.8499999999999998e125 < l < -1.999999999999994e-310Initial program 67.0%
Simplified65.9%
add-sqr-sqrt65.8%
pow265.8%
sqrt-prod65.8%
sqrt-pow167.1%
metadata-eval67.1%
pow167.1%
*-commutative67.1%
div-inv67.1%
metadata-eval67.1%
Applied egg-rr67.1%
Taylor expanded in h around inf 48.0%
sub-neg48.0%
distribute-lft-in48.0%
rgt-mult-inverse48.0%
distribute-rgt-neg-in48.0%
associate-/r*51.5%
associate-/l*51.5%
unpow251.5%
unpow251.5%
unpow251.5%
times-frac58.6%
swap-sqr68.2%
unpow268.2%
distribute-rgt-neg-in68.2%
Simplified69.3%
Taylor expanded in D around 0 69.4%
if -1.999999999999994e-310 < l Initial program 66.8%
Simplified66.2%
Taylor expanded in h around -inf 45.2%
associate-*r*45.2%
neg-mul-145.2%
sub-neg45.2%
distribute-lft-in45.2%
Simplified67.8%
sqrt-div79.2%
Applied egg-rr79.2%
Final simplification74.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= l -3.1e+125)
(* (/ (sqrt (- d)) (sqrt (- h))) t_0)
(if (<= l -2e-310)
(*
(* t_0 (sqrt (/ d h)))
(- 1.0 (* (/ 0.125 l) (* h (pow (/ (* D_m M_m) d) 2.0)))))
(*
(* t_0 (/ (sqrt d) (sqrt h)))
(- 1.0 (* (/ 0.125 l) (* h (pow (* D_m (/ M_m d)) 2.0)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double tmp;
if (l <= -3.1e+125) {
tmp = (sqrt(-d) / sqrt(-h)) * t_0;
} else if (l <= -2e-310) {
tmp = (t_0 * sqrt((d / h))) * (1.0 - ((0.125 / l) * (h * pow(((D_m * M_m) / d), 2.0))));
} else {
tmp = (t_0 * (sqrt(d) / sqrt(h))) * (1.0 - ((0.125 / l) * (h * pow((D_m * (M_m / d)), 2.0))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((d / l))
if (l <= (-3.1d+125)) then
tmp = (sqrt(-d) / sqrt(-h)) * t_0
else if (l <= (-2d-310)) then
tmp = (t_0 * sqrt((d / h))) * (1.0d0 - ((0.125d0 / l) * (h * (((d_m * m_m) / d) ** 2.0d0))))
else
tmp = (t_0 * (sqrt(d) / sqrt(h))) * (1.0d0 - ((0.125d0 / l) * (h * ((d_m * (m_m / d)) ** 2.0d0))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((d / l));
double tmp;
if (l <= -3.1e+125) {
tmp = (Math.sqrt(-d) / Math.sqrt(-h)) * t_0;
} else if (l <= -2e-310) {
tmp = (t_0 * Math.sqrt((d / h))) * (1.0 - ((0.125 / l) * (h * Math.pow(((D_m * M_m) / d), 2.0))));
} else {
tmp = (t_0 * (Math.sqrt(d) / Math.sqrt(h))) * (1.0 - ((0.125 / l) * (h * Math.pow((D_m * (M_m / d)), 2.0))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((d / l)) tmp = 0 if l <= -3.1e+125: tmp = (math.sqrt(-d) / math.sqrt(-h)) * t_0 elif l <= -2e-310: tmp = (t_0 * math.sqrt((d / h))) * (1.0 - ((0.125 / l) * (h * math.pow(((D_m * M_m) / d), 2.0)))) else: tmp = (t_0 * (math.sqrt(d) / math.sqrt(h))) * (1.0 - ((0.125 / l) * (h * math.pow((D_m * (M_m / d)), 2.0)))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (l <= -3.1e+125) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0); elseif (l <= -2e-310) tmp = Float64(Float64(t_0 * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(0.125 / l) * Float64(h * (Float64(Float64(D_m * M_m) / d) ^ 2.0))))); else tmp = Float64(Float64(t_0 * Float64(sqrt(d) / sqrt(h))) * Float64(1.0 - Float64(Float64(0.125 / l) * Float64(h * (Float64(D_m * Float64(M_m / d)) ^ 2.0))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((d / l));
tmp = 0.0;
if (l <= -3.1e+125)
tmp = (sqrt(-d) / sqrt(-h)) * t_0;
elseif (l <= -2e-310)
tmp = (t_0 * sqrt((d / h))) * (1.0 - ((0.125 / l) * (h * (((D_m * M_m) / d) ^ 2.0))));
else
tmp = (t_0 * (sqrt(d) / sqrt(h))) * (1.0 - ((0.125 / l) * (h * ((D_m * (M_m / d)) ^ 2.0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -3.1e+125], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[l, -2e-310], N[(N[(t$95$0 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;\ell \leq -3.1 \cdot 10^{+125}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(t\_0 \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{0.125}{\ell} \cdot \left(h \cdot {\left(\frac{D\_m \cdot M\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_0 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right) \cdot \left(1 - \frac{0.125}{\ell} \cdot \left(h \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if l < -3.1e125Initial program 52.0%
Simplified51.9%
Taylor expanded in M around 0 47.5%
frac-2neg52.1%
sqrt-div77.5%
Applied egg-rr72.8%
if -3.1e125 < l < -1.999999999999994e-310Initial program 67.0%
Simplified65.9%
add-sqr-sqrt65.8%
pow265.8%
sqrt-prod65.8%
sqrt-pow167.1%
metadata-eval67.1%
pow167.1%
*-commutative67.1%
div-inv67.1%
metadata-eval67.1%
Applied egg-rr67.1%
Taylor expanded in h around inf 48.0%
sub-neg48.0%
distribute-lft-in48.0%
rgt-mult-inverse48.0%
distribute-rgt-neg-in48.0%
associate-/r*51.5%
associate-/l*51.5%
unpow251.5%
unpow251.5%
unpow251.5%
times-frac58.6%
swap-sqr68.2%
unpow268.2%
distribute-rgt-neg-in68.2%
Simplified69.3%
Taylor expanded in D around 0 69.4%
if -1.999999999999994e-310 < l Initial program 66.8%
Simplified66.8%
add-sqr-sqrt66.8%
pow266.8%
sqrt-prod66.8%
sqrt-pow168.4%
metadata-eval68.4%
pow168.4%
*-commutative68.4%
div-inv68.4%
metadata-eval68.4%
Applied egg-rr68.4%
Taylor expanded in h around inf 45.2%
sub-neg45.2%
distribute-lft-in45.2%
rgt-mult-inverse45.2%
distribute-rgt-neg-in45.2%
associate-/r*48.2%
associate-/l*49.7%
unpow249.7%
unpow249.7%
unpow249.7%
times-frac58.3%
swap-sqr68.4%
unpow268.4%
distribute-rgt-neg-in68.4%
Simplified68.4%
sqrt-div79.2%
Applied egg-rr79.1%
Final simplification74.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= l -3e+123)
(* (/ (sqrt (- d)) (sqrt (- h))) t_0)
(if (<= l -2e-310)
(*
(* t_0 (sqrt (/ d h)))
(- 1.0 (* (/ 0.125 l) (* h (pow (/ (* D_m M_m) d) 2.0)))))
(if (<= l 7e+181)
(*
d
(/
(fma h (* (/ -0.125 l) (pow (* M_m (/ D_m d)) 2.0)) 1.0)
(sqrt (* h l))))
(* d (* (pow l -0.5) (pow h -0.5))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double tmp;
if (l <= -3e+123) {
tmp = (sqrt(-d) / sqrt(-h)) * t_0;
} else if (l <= -2e-310) {
tmp = (t_0 * sqrt((d / h))) * (1.0 - ((0.125 / l) * (h * pow(((D_m * M_m) / d), 2.0))));
} else if (l <= 7e+181) {
tmp = d * (fma(h, ((-0.125 / l) * pow((M_m * (D_m / d)), 2.0)), 1.0) / sqrt((h * l)));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (l <= -3e+123) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0); elseif (l <= -2e-310) tmp = Float64(Float64(t_0 * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(0.125 / l) * Float64(h * (Float64(Float64(D_m * M_m) / d) ^ 2.0))))); elseif (l <= 7e+181) tmp = Float64(d * Float64(fma(h, Float64(Float64(-0.125 / l) * (Float64(M_m * Float64(D_m / d)) ^ 2.0)), 1.0) / sqrt(Float64(h * l)))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -3e+123], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[l, -2e-310], N[(N[(t$95$0 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 7e+181], N[(d * N[(N[(h * N[(N[(-0.125 / l), $MachinePrecision] * N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[N[(h * l), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;\ell \leq -3 \cdot 10^{+123}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(t\_0 \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{0.125}{\ell} \cdot \left(h \cdot {\left(\frac{D\_m \cdot M\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{elif}\;\ell \leq 7 \cdot 10^{+181}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(h, \frac{-0.125}{\ell} \cdot {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}, 1\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -3.00000000000000008e123Initial program 52.0%
Simplified51.9%
Taylor expanded in M around 0 47.5%
frac-2neg52.1%
sqrt-div77.5%
Applied egg-rr72.8%
if -3.00000000000000008e123 < l < -1.999999999999994e-310Initial program 67.0%
Simplified65.9%
add-sqr-sqrt65.8%
pow265.8%
sqrt-prod65.8%
sqrt-pow167.1%
metadata-eval67.1%
pow167.1%
*-commutative67.1%
div-inv67.1%
metadata-eval67.1%
Applied egg-rr67.1%
Taylor expanded in h around inf 48.0%
sub-neg48.0%
distribute-lft-in48.0%
rgt-mult-inverse48.0%
distribute-rgt-neg-in48.0%
associate-/r*51.5%
associate-/l*51.5%
unpow251.5%
unpow251.5%
unpow251.5%
times-frac58.6%
swap-sqr68.2%
unpow268.2%
distribute-rgt-neg-in68.2%
Simplified69.3%
Taylor expanded in D around 0 69.4%
if -1.999999999999994e-310 < l < 7.00000000000000016e181Initial program 71.6%
Simplified71.6%
add-sqr-sqrt71.6%
pow271.6%
sqrt-prod71.6%
sqrt-pow172.6%
metadata-eval72.6%
pow172.6%
*-commutative72.6%
div-inv72.6%
metadata-eval72.6%
Applied egg-rr72.6%
Taylor expanded in h around inf 48.5%
sub-neg48.5%
distribute-lft-in48.5%
rgt-mult-inverse48.6%
distribute-rgt-neg-in48.6%
associate-/r*52.3%
associate-/l*54.1%
unpow254.1%
unpow254.1%
unpow254.1%
times-frac63.9%
swap-sqr73.5%
unpow273.5%
distribute-rgt-neg-in73.5%
Simplified73.6%
sub-neg73.6%
distribute-rgt-in59.0%
*-un-lft-identity59.0%
sqrt-div60.2%
sqrt-div64.5%
frac-times64.5%
add-sqr-sqrt64.6%
sqrt-prod58.7%
Applied egg-rr69.2%
*-lft-identity69.2%
distribute-rgt-in80.7%
associate-*l/80.9%
associate-/l*81.7%
+-commutative81.7%
*-commutative81.7%
associate-*l*84.5%
fma-define84.5%
associate-/r/84.6%
*-commutative84.6%
Simplified84.6%
if 7.00000000000000016e181 < l Initial program 47.5%
Simplified47.5%
pow1/247.5%
div-inv47.5%
unpow-prod-down57.8%
pow1/257.8%
Applied egg-rr57.8%
unpow1/257.8%
Simplified57.8%
Taylor expanded in d around inf 40.3%
unpow-140.3%
metadata-eval40.3%
pow-sqr40.3%
rem-sqrt-square40.3%
rem-square-sqrt40.1%
fabs-sqr40.1%
rem-square-sqrt40.3%
Simplified40.3%
*-commutative40.3%
unpow-prod-down69.0%
Applied egg-rr69.0%
Final simplification76.1%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= l -2.5e+125)
(* (/ (sqrt (- d)) (sqrt (- h))) t_0)
(if (<= l -2e-310)
(*
(* t_0 (sqrt (/ d h)))
(- 1.0 (* (/ 0.125 l) (* h (pow (* D_m (/ M_m d)) 2.0)))))
(if (<= l 2.9e+181)
(*
d
(/
(fma h (* (/ -0.125 l) (pow (* M_m (/ D_m d)) 2.0)) 1.0)
(sqrt (* h l))))
(* d (* (pow l -0.5) (pow h -0.5))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double tmp;
if (l <= -2.5e+125) {
tmp = (sqrt(-d) / sqrt(-h)) * t_0;
} else if (l <= -2e-310) {
tmp = (t_0 * sqrt((d / h))) * (1.0 - ((0.125 / l) * (h * pow((D_m * (M_m / d)), 2.0))));
} else if (l <= 2.9e+181) {
tmp = d * (fma(h, ((-0.125 / l) * pow((M_m * (D_m / d)), 2.0)), 1.0) / sqrt((h * l)));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (l <= -2.5e+125) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0); elseif (l <= -2e-310) tmp = Float64(Float64(t_0 * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(0.125 / l) * Float64(h * (Float64(D_m * Float64(M_m / d)) ^ 2.0))))); elseif (l <= 2.9e+181) tmp = Float64(d * Float64(fma(h, Float64(Float64(-0.125 / l) * (Float64(M_m * Float64(D_m / d)) ^ 2.0)), 1.0) / sqrt(Float64(h * l)))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -2.5e+125], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[l, -2e-310], N[(N[(t$95$0 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 2.9e+181], N[(d * N[(N[(h * N[(N[(-0.125 / l), $MachinePrecision] * N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[N[(h * l), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;\ell \leq -2.5 \cdot 10^{+125}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(t\_0 \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{0.125}{\ell} \cdot \left(h \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{elif}\;\ell \leq 2.9 \cdot 10^{+181}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(h, \frac{-0.125}{\ell} \cdot {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}, 1\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -2.49999999999999981e125Initial program 52.0%
Simplified51.9%
Taylor expanded in M around 0 47.5%
frac-2neg52.1%
sqrt-div77.5%
Applied egg-rr72.8%
if -2.49999999999999981e125 < l < -1.999999999999994e-310Initial program 67.0%
Simplified65.9%
add-sqr-sqrt65.8%
pow265.8%
sqrt-prod65.8%
sqrt-pow167.1%
metadata-eval67.1%
pow167.1%
*-commutative67.1%
div-inv67.1%
metadata-eval67.1%
Applied egg-rr67.1%
Taylor expanded in h around inf 48.0%
sub-neg48.0%
distribute-lft-in48.0%
rgt-mult-inverse48.0%
distribute-rgt-neg-in48.0%
associate-/r*51.5%
associate-/l*51.5%
unpow251.5%
unpow251.5%
unpow251.5%
times-frac58.6%
swap-sqr68.2%
unpow268.2%
distribute-rgt-neg-in68.2%
Simplified69.3%
if -1.999999999999994e-310 < l < 2.9e181Initial program 71.6%
Simplified71.6%
add-sqr-sqrt71.6%
pow271.6%
sqrt-prod71.6%
sqrt-pow172.6%
metadata-eval72.6%
pow172.6%
*-commutative72.6%
div-inv72.6%
metadata-eval72.6%
Applied egg-rr72.6%
Taylor expanded in h around inf 48.5%
sub-neg48.5%
distribute-lft-in48.5%
rgt-mult-inverse48.6%
distribute-rgt-neg-in48.6%
associate-/r*52.3%
associate-/l*54.1%
unpow254.1%
unpow254.1%
unpow254.1%
times-frac63.9%
swap-sqr73.5%
unpow273.5%
distribute-rgt-neg-in73.5%
Simplified73.6%
sub-neg73.6%
distribute-rgt-in59.0%
*-un-lft-identity59.0%
sqrt-div60.2%
sqrt-div64.5%
frac-times64.5%
add-sqr-sqrt64.6%
sqrt-prod58.7%
Applied egg-rr69.2%
*-lft-identity69.2%
distribute-rgt-in80.7%
associate-*l/80.9%
associate-/l*81.7%
+-commutative81.7%
*-commutative81.7%
associate-*l*84.5%
fma-define84.5%
associate-/r/84.6%
*-commutative84.6%
Simplified84.6%
if 2.9e181 < l Initial program 47.5%
Simplified47.5%
pow1/247.5%
div-inv47.5%
unpow-prod-down57.8%
pow1/257.8%
Applied egg-rr57.8%
unpow1/257.8%
Simplified57.8%
Taylor expanded in d around inf 40.3%
unpow-140.3%
metadata-eval40.3%
pow-sqr40.3%
rem-sqrt-square40.3%
rem-square-sqrt40.1%
fabs-sqr40.1%
rem-square-sqrt40.3%
Simplified40.3%
*-commutative40.3%
unpow-prod-down69.0%
Applied egg-rr69.0%
Final simplification76.1%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= l -2.65e+125)
(* (/ (sqrt (- d)) (sqrt (- h))) t_0)
(if (<= l 5e-305)
(*
(sqrt (/ d h))
(* t_0 (+ 1.0 (* h (* -0.125 (/ (pow (* D_m (/ M_m d)) 2.0) l))))))
(if (<= l 3.5e+184)
(*
d
(/
(fma h (* (/ -0.125 l) (pow (* M_m (/ D_m d)) 2.0)) 1.0)
(sqrt (* h l))))
(* d (* (pow l -0.5) (pow h -0.5))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double tmp;
if (l <= -2.65e+125) {
tmp = (sqrt(-d) / sqrt(-h)) * t_0;
} else if (l <= 5e-305) {
tmp = sqrt((d / h)) * (t_0 * (1.0 + (h * (-0.125 * (pow((D_m * (M_m / d)), 2.0) / l)))));
} else if (l <= 3.5e+184) {
tmp = d * (fma(h, ((-0.125 / l) * pow((M_m * (D_m / d)), 2.0)), 1.0) / sqrt((h * l)));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (l <= -2.65e+125) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0); elseif (l <= 5e-305) tmp = Float64(sqrt(Float64(d / h)) * Float64(t_0 * Float64(1.0 + Float64(h * Float64(-0.125 * Float64((Float64(D_m * Float64(M_m / d)) ^ 2.0) / l)))))); elseif (l <= 3.5e+184) tmp = Float64(d * Float64(fma(h, Float64(Float64(-0.125 / l) * (Float64(M_m * Float64(D_m / d)) ^ 2.0)), 1.0) / sqrt(Float64(h * l)))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -2.65e+125], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[l, 5e-305], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(t$95$0 * N[(1.0 + N[(h * N[(-0.125 * N[(N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.5e+184], N[(d * N[(N[(h * N[(N[(-0.125 / l), $MachinePrecision] * N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[N[(h * l), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;\ell \leq -2.65 \cdot 10^{+125}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\\
\mathbf{elif}\;\ell \leq 5 \cdot 10^{-305}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(t\_0 \cdot \left(1 + h \cdot \left(-0.125 \cdot \frac{{\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right)\right)\right)\\
\mathbf{elif}\;\ell \leq 3.5 \cdot 10^{+184}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(h, \frac{-0.125}{\ell} \cdot {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}, 1\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -2.6500000000000001e125Initial program 52.0%
Simplified51.9%
Taylor expanded in M around 0 47.5%
frac-2neg52.1%
sqrt-div77.5%
Applied egg-rr72.8%
if -2.6500000000000001e125 < l < 4.99999999999999985e-305Initial program 67.0%
Simplified65.9%
Taylor expanded in h around -inf 48.0%
associate-*r*48.0%
neg-mul-148.0%
sub-neg48.0%
distribute-lft-in48.0%
Simplified68.2%
pow168.2%
*-commutative68.2%
Applied egg-rr68.2%
unpow168.2%
*-commutative68.2%
distribute-lft-neg-in68.2%
distribute-rgt-neg-in68.2%
associate-*l/68.2%
associate-/l*68.2%
distribute-lft-neg-in68.2%
metadata-eval68.2%
Simplified68.2%
if 4.99999999999999985e-305 < l < 3.49999999999999978e184Initial program 71.6%
Simplified71.6%
add-sqr-sqrt71.6%
pow271.6%
sqrt-prod71.6%
sqrt-pow172.6%
metadata-eval72.6%
pow172.6%
*-commutative72.6%
div-inv72.6%
metadata-eval72.6%
Applied egg-rr72.6%
Taylor expanded in h around inf 48.5%
sub-neg48.5%
distribute-lft-in48.5%
rgt-mult-inverse48.6%
distribute-rgt-neg-in48.6%
associate-/r*52.3%
associate-/l*54.1%
unpow254.1%
unpow254.1%
unpow254.1%
times-frac63.9%
swap-sqr73.5%
unpow273.5%
distribute-rgt-neg-in73.5%
Simplified73.6%
sub-neg73.6%
distribute-rgt-in59.0%
*-un-lft-identity59.0%
sqrt-div60.2%
sqrt-div64.5%
frac-times64.5%
add-sqr-sqrt64.6%
sqrt-prod58.7%
Applied egg-rr69.2%
*-lft-identity69.2%
distribute-rgt-in80.7%
associate-*l/80.9%
associate-/l*81.7%
+-commutative81.7%
*-commutative81.7%
associate-*l*84.5%
fma-define84.5%
associate-/r/84.6%
*-commutative84.6%
Simplified84.6%
if 3.49999999999999978e184 < l Initial program 47.5%
Simplified47.5%
pow1/247.5%
div-inv47.5%
unpow-prod-down57.8%
pow1/257.8%
Applied egg-rr57.8%
unpow1/257.8%
Simplified57.8%
Taylor expanded in d around inf 40.3%
unpow-140.3%
metadata-eval40.3%
pow-sqr40.3%
rem-sqrt-square40.3%
rem-square-sqrt40.1%
fabs-sqr40.1%
rem-square-sqrt40.3%
Simplified40.3%
*-commutative40.3%
unpow-prod-down69.0%
Applied egg-rr69.0%
Final simplification75.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -5.8e+115)
(* (/ (sqrt (- d)) (sqrt (- h))) (sqrt (/ d l)))
(if (<= l -2e-310)
(*
(- 1.0 (* (/ 0.125 l) (* h (pow (* D_m (/ M_m d)) 2.0))))
(sqrt (* (/ d l) (/ d h))))
(if (<= l 1.35e+184)
(*
d
(/
(fma h (* (/ -0.125 l) (pow (* M_m (/ D_m d)) 2.0)) 1.0)
(sqrt (* h l))))
(* d (* (pow l -0.5) (pow h -0.5)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -5.8e+115) {
tmp = (sqrt(-d) / sqrt(-h)) * sqrt((d / l));
} else if (l <= -2e-310) {
tmp = (1.0 - ((0.125 / l) * (h * pow((D_m * (M_m / d)), 2.0)))) * sqrt(((d / l) * (d / h)));
} else if (l <= 1.35e+184) {
tmp = d * (fma(h, ((-0.125 / l) * pow((M_m * (D_m / d)), 2.0)), 1.0) / sqrt((h * l)));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -5.8e+115) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * sqrt(Float64(d / l))); elseif (l <= -2e-310) tmp = Float64(Float64(1.0 - Float64(Float64(0.125 / l) * Float64(h * (Float64(D_m * Float64(M_m / d)) ^ 2.0)))) * sqrt(Float64(Float64(d / l) * Float64(d / h)))); elseif (l <= 1.35e+184) tmp = Float64(d * Float64(fma(h, Float64(Float64(-0.125 / l) * (Float64(M_m * Float64(D_m / d)) ^ 2.0)), 1.0) / sqrt(Float64(h * l)))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -5.8e+115], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -2e-310], N[(N[(1.0 - N[(N[(0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.35e+184], N[(d * N[(N[(h * N[(N[(-0.125 / l), $MachinePrecision] * N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[N[(h * l), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -5.8 \cdot 10^{+115}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \sqrt{\frac{d}{\ell}}\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(1 - \frac{0.125}{\ell} \cdot \left(h \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)\right) \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{elif}\;\ell \leq 1.35 \cdot 10^{+184}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(h, \frac{-0.125}{\ell} \cdot {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}, 1\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -5.80000000000000009e115Initial program 53.2%
Simplified53.0%
Taylor expanded in M around 0 46.6%
frac-2neg53.3%
sqrt-div79.1%
Applied egg-rr72.4%
if -5.80000000000000009e115 < l < -1.999999999999994e-310Initial program 66.9%
Simplified65.8%
add-sqr-sqrt65.7%
pow265.7%
sqrt-prod65.7%
sqrt-pow167.0%
metadata-eval67.0%
pow167.0%
*-commutative67.0%
div-inv67.0%
metadata-eval67.0%
Applied egg-rr67.0%
Taylor expanded in h around inf 47.2%
sub-neg47.2%
distribute-lft-in47.2%
rgt-mult-inverse47.2%
distribute-rgt-neg-in47.2%
associate-/r*50.9%
associate-/l*50.9%
unpow250.9%
unpow250.9%
unpow250.9%
times-frac58.2%
swap-sqr68.2%
unpow268.2%
distribute-rgt-neg-in68.2%
Simplified69.3%
pow169.3%
sqrt-unprod59.3%
Applied egg-rr59.3%
unpow159.3%
Simplified59.3%
if -1.999999999999994e-310 < l < 1.35e184Initial program 71.6%
Simplified71.6%
add-sqr-sqrt71.6%
pow271.6%
sqrt-prod71.6%
sqrt-pow172.6%
metadata-eval72.6%
pow172.6%
*-commutative72.6%
div-inv72.6%
metadata-eval72.6%
Applied egg-rr72.6%
Taylor expanded in h around inf 48.5%
sub-neg48.5%
distribute-lft-in48.5%
rgt-mult-inverse48.6%
distribute-rgt-neg-in48.6%
associate-/r*52.3%
associate-/l*54.1%
unpow254.1%
unpow254.1%
unpow254.1%
times-frac63.9%
swap-sqr73.5%
unpow273.5%
distribute-rgt-neg-in73.5%
Simplified73.6%
sub-neg73.6%
distribute-rgt-in59.0%
*-un-lft-identity59.0%
sqrt-div60.2%
sqrt-div64.5%
frac-times64.5%
add-sqr-sqrt64.6%
sqrt-prod58.7%
Applied egg-rr69.2%
*-lft-identity69.2%
distribute-rgt-in80.7%
associate-*l/80.9%
associate-/l*81.7%
+-commutative81.7%
*-commutative81.7%
associate-*l*84.5%
fma-define84.5%
associate-/r/84.6%
*-commutative84.6%
Simplified84.6%
if 1.35e184 < l Initial program 47.5%
Simplified47.5%
pow1/247.5%
div-inv47.5%
unpow-prod-down57.8%
pow1/257.8%
Applied egg-rr57.8%
unpow1/257.8%
Simplified57.8%
Taylor expanded in d around inf 40.3%
unpow-140.3%
metadata-eval40.3%
pow-sqr40.3%
rem-sqrt-square40.3%
rem-square-sqrt40.1%
fabs-sqr40.1%
rem-square-sqrt40.3%
Simplified40.3%
*-commutative40.3%
unpow-prod-down69.0%
Applied egg-rr69.0%
Final simplification72.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -4.2e+120)
(* (/ (sqrt (- d)) (sqrt (- h))) (sqrt (/ d l)))
(if (<= l -2e-310)
(*
(- 1.0 (* (/ 0.125 l) (* h (pow (* D_m (/ M_m d)) 2.0))))
(sqrt (* (/ d l) (/ d h))))
(if (<= l 3e+184)
(*
(/ d (sqrt (* h l)))
(+ 1.0 (* (/ -0.125 l) (* h (pow (* M_m (/ D_m d)) 2.0)))))
(* d (* (pow l -0.5) (pow h -0.5)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.2e+120) {
tmp = (sqrt(-d) / sqrt(-h)) * sqrt((d / l));
} else if (l <= -2e-310) {
tmp = (1.0 - ((0.125 / l) * (h * pow((D_m * (M_m / d)), 2.0)))) * sqrt(((d / l) * (d / h)));
} else if (l <= 3e+184) {
tmp = (d / sqrt((h * l))) * (1.0 + ((-0.125 / l) * (h * pow((M_m * (D_m / d)), 2.0))));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
real(8) :: tmp
if (l <= (-4.2d+120)) then
tmp = (sqrt(-d) / sqrt(-h)) * sqrt((d / l))
else if (l <= (-2d-310)) then
tmp = (1.0d0 - ((0.125d0 / l) * (h * ((d_m * (m_m / d)) ** 2.0d0)))) * sqrt(((d / l) * (d / h)))
else if (l <= 3d+184) then
tmp = (d / sqrt((h * l))) * (1.0d0 + (((-0.125d0) / l) * (h * ((m_m * (d_m / d)) ** 2.0d0))))
else
tmp = d * ((l ** (-0.5d0)) * (h ** (-0.5d0)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.2e+120) {
tmp = (Math.sqrt(-d) / Math.sqrt(-h)) * Math.sqrt((d / l));
} else if (l <= -2e-310) {
tmp = (1.0 - ((0.125 / l) * (h * Math.pow((D_m * (M_m / d)), 2.0)))) * Math.sqrt(((d / l) * (d / h)));
} else if (l <= 3e+184) {
tmp = (d / Math.sqrt((h * l))) * (1.0 + ((-0.125 / l) * (h * Math.pow((M_m * (D_m / d)), 2.0))));
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -0.5));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -4.2e+120: tmp = (math.sqrt(-d) / math.sqrt(-h)) * math.sqrt((d / l)) elif l <= -2e-310: tmp = (1.0 - ((0.125 / l) * (h * math.pow((D_m * (M_m / d)), 2.0)))) * math.sqrt(((d / l) * (d / h))) elif l <= 3e+184: tmp = (d / math.sqrt((h * l))) * (1.0 + ((-0.125 / l) * (h * math.pow((M_m * (D_m / d)), 2.0)))) else: tmp = d * (math.pow(l, -0.5) * math.pow(h, -0.5)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -4.2e+120) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * sqrt(Float64(d / l))); elseif (l <= -2e-310) tmp = Float64(Float64(1.0 - Float64(Float64(0.125 / l) * Float64(h * (Float64(D_m * Float64(M_m / d)) ^ 2.0)))) * sqrt(Float64(Float64(d / l) * Float64(d / h)))); elseif (l <= 3e+184) tmp = Float64(Float64(d / sqrt(Float64(h * l))) * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(h * (Float64(M_m * Float64(D_m / d)) ^ 2.0))))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -4.2e+120)
tmp = (sqrt(-d) / sqrt(-h)) * sqrt((d / l));
elseif (l <= -2e-310)
tmp = (1.0 - ((0.125 / l) * (h * ((D_m * (M_m / d)) ^ 2.0)))) * sqrt(((d / l) * (d / h)));
elseif (l <= 3e+184)
tmp = (d / sqrt((h * l))) * (1.0 + ((-0.125 / l) * (h * ((M_m * (D_m / d)) ^ 2.0))));
else
tmp = d * ((l ^ -0.5) * (h ^ -0.5));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -4.2e+120], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -2e-310], N[(N[(1.0 - N[(N[(0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3e+184], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(M$95$m * N[(D$95$m / d), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4.2 \cdot 10^{+120}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \sqrt{\frac{d}{\ell}}\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(1 - \frac{0.125}{\ell} \cdot \left(h \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)\right) \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{elif}\;\ell \leq 3 \cdot 10^{+184}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot \left(1 + \frac{-0.125}{\ell} \cdot \left(h \cdot {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -4.2000000000000001e120Initial program 53.2%
Simplified53.0%
Taylor expanded in M around 0 46.6%
frac-2neg53.3%
sqrt-div79.1%
Applied egg-rr72.4%
if -4.2000000000000001e120 < l < -1.999999999999994e-310Initial program 66.9%
Simplified65.8%
add-sqr-sqrt65.7%
pow265.7%
sqrt-prod65.7%
sqrt-pow167.0%
metadata-eval67.0%
pow167.0%
*-commutative67.0%
div-inv67.0%
metadata-eval67.0%
Applied egg-rr67.0%
Taylor expanded in h around inf 47.2%
sub-neg47.2%
distribute-lft-in47.2%
rgt-mult-inverse47.2%
distribute-rgt-neg-in47.2%
associate-/r*50.9%
associate-/l*50.9%
unpow250.9%
unpow250.9%
unpow250.9%
times-frac58.2%
swap-sqr68.2%
unpow268.2%
distribute-rgt-neg-in68.2%
Simplified69.3%
pow169.3%
sqrt-unprod59.3%
Applied egg-rr59.3%
unpow159.3%
Simplified59.3%
if -1.999999999999994e-310 < l < 2.99999999999999986e184Initial program 71.6%
Simplified71.6%
add-sqr-sqrt71.6%
pow271.6%
sqrt-prod71.6%
sqrt-pow172.6%
metadata-eval72.6%
pow172.6%
*-commutative72.6%
div-inv72.6%
metadata-eval72.6%
Applied egg-rr72.6%
Taylor expanded in h around inf 48.5%
sub-neg48.5%
distribute-lft-in48.5%
rgt-mult-inverse48.6%
distribute-rgt-neg-in48.6%
associate-/r*52.3%
associate-/l*54.1%
unpow254.1%
unpow254.1%
unpow254.1%
times-frac63.9%
swap-sqr73.5%
unpow273.5%
distribute-rgt-neg-in73.5%
Simplified73.6%
sub-neg73.6%
distribute-rgt-in59.0%
*-un-lft-identity59.0%
sqrt-div60.2%
sqrt-div64.5%
frac-times64.5%
add-sqr-sqrt64.6%
sqrt-prod58.7%
Applied egg-rr69.2%
*-lft-identity69.2%
distribute-rgt-in80.7%
associate-*l*83.6%
associate-/r/83.6%
Simplified83.6%
if 2.99999999999999986e184 < l Initial program 47.5%
Simplified47.5%
pow1/247.5%
div-inv47.5%
unpow-prod-down57.8%
pow1/257.8%
Applied egg-rr57.8%
unpow1/257.8%
Simplified57.8%
Taylor expanded in d around inf 40.3%
unpow-140.3%
metadata-eval40.3%
pow-sqr40.3%
rem-sqrt-square40.3%
rem-square-sqrt40.1%
fabs-sqr40.1%
rem-square-sqrt40.3%
Simplified40.3%
*-commutative40.3%
unpow-prod-down69.0%
Applied egg-rr69.0%
Final simplification72.4%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -4.8e+94)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l 5e-305)
(*
(- 1.0 (* (/ 0.125 l) (* h (pow (* D_m (/ M_m d)) 2.0))))
(sqrt (* (/ d l) (/ d h))))
(if (<= l 4.8e+181)
(*
(/ d (sqrt (* h l)))
(+ 1.0 (* (/ -0.125 l) (* h (pow (* M_m (/ D_m d)) 2.0)))))
(* d (* (pow l -0.5) (pow h -0.5)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.8e+94) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (l <= 5e-305) {
tmp = (1.0 - ((0.125 / l) * (h * pow((D_m * (M_m / d)), 2.0)))) * sqrt(((d / l) * (d / h)));
} else if (l <= 4.8e+181) {
tmp = (d / sqrt((h * l))) * (1.0 + ((-0.125 / l) * (h * pow((M_m * (D_m / d)), 2.0))));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
real(8) :: tmp
if (l <= (-4.8d+94)) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else if (l <= 5d-305) then
tmp = (1.0d0 - ((0.125d0 / l) * (h * ((d_m * (m_m / d)) ** 2.0d0)))) * sqrt(((d / l) * (d / h)))
else if (l <= 4.8d+181) then
tmp = (d / sqrt((h * l))) * (1.0d0 + (((-0.125d0) / l) * (h * ((m_m * (d_m / d)) ** 2.0d0))))
else
tmp = d * ((l ** (-0.5d0)) * (h ** (-0.5d0)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.8e+94) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else if (l <= 5e-305) {
tmp = (1.0 - ((0.125 / l) * (h * Math.pow((D_m * (M_m / d)), 2.0)))) * Math.sqrt(((d / l) * (d / h)));
} else if (l <= 4.8e+181) {
tmp = (d / Math.sqrt((h * l))) * (1.0 + ((-0.125 / l) * (h * Math.pow((M_m * (D_m / d)), 2.0))));
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -0.5));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -4.8e+94: tmp = -d * math.sqrt(((1.0 / h) / l)) elif l <= 5e-305: tmp = (1.0 - ((0.125 / l) * (h * math.pow((D_m * (M_m / d)), 2.0)))) * math.sqrt(((d / l) * (d / h))) elif l <= 4.8e+181: tmp = (d / math.sqrt((h * l))) * (1.0 + ((-0.125 / l) * (h * math.pow((M_m * (D_m / d)), 2.0)))) else: tmp = d * (math.pow(l, -0.5) * math.pow(h, -0.5)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -4.8e+94) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= 5e-305) tmp = Float64(Float64(1.0 - Float64(Float64(0.125 / l) * Float64(h * (Float64(D_m * Float64(M_m / d)) ^ 2.0)))) * sqrt(Float64(Float64(d / l) * Float64(d / h)))); elseif (l <= 4.8e+181) tmp = Float64(Float64(d / sqrt(Float64(h * l))) * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(h * (Float64(M_m * Float64(D_m / d)) ^ 2.0))))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -4.8e+94)
tmp = -d * sqrt(((1.0 / h) / l));
elseif (l <= 5e-305)
tmp = (1.0 - ((0.125 / l) * (h * ((D_m * (M_m / d)) ^ 2.0)))) * sqrt(((d / l) * (d / h)));
elseif (l <= 4.8e+181)
tmp = (d / sqrt((h * l))) * (1.0 + ((-0.125 / l) * (h * ((M_m * (D_m / d)) ^ 2.0))));
else
tmp = d * ((l ^ -0.5) * (h ^ -0.5));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -4.8e+94], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5e-305], N[(N[(1.0 - N[(N[(0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 4.8e+181], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(M$95$m * N[(D$95$m / d), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4.8 \cdot 10^{+94}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq 5 \cdot 10^{-305}:\\
\;\;\;\;\left(1 - \frac{0.125}{\ell} \cdot \left(h \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)\right) \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{elif}\;\ell \leq 4.8 \cdot 10^{+181}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot \left(1 + \frac{-0.125}{\ell} \cdot \left(h \cdot {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -4.79999999999999965e94Initial program 51.0%
Simplified50.9%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt66.7%
neg-mul-166.7%
Simplified66.7%
if -4.79999999999999965e94 < l < 4.99999999999999985e-305Initial program 68.5%
Simplified67.3%
add-sqr-sqrt67.2%
pow267.2%
sqrt-prod67.3%
sqrt-pow167.4%
metadata-eval67.4%
pow167.4%
*-commutative67.4%
div-inv67.4%
metadata-eval67.4%
Applied egg-rr67.4%
Taylor expanded in h around inf 48.3%
sub-neg48.3%
distribute-lft-in48.3%
rgt-mult-inverse48.3%
distribute-rgt-neg-in48.3%
associate-/r*52.0%
associate-/l*52.0%
unpow252.0%
unpow252.0%
unpow252.0%
times-frac59.5%
swap-sqr69.8%
unpow269.8%
distribute-rgt-neg-in69.8%
Simplified70.9%
pow170.9%
sqrt-unprod60.7%
Applied egg-rr60.7%
unpow160.7%
Simplified60.7%
if 4.99999999999999985e-305 < l < 4.80000000000000004e181Initial program 71.6%
Simplified71.6%
add-sqr-sqrt71.6%
pow271.6%
sqrt-prod71.6%
sqrt-pow172.6%
metadata-eval72.6%
pow172.6%
*-commutative72.6%
div-inv72.6%
metadata-eval72.6%
Applied egg-rr72.6%
Taylor expanded in h around inf 48.5%
sub-neg48.5%
distribute-lft-in48.5%
rgt-mult-inverse48.6%
distribute-rgt-neg-in48.6%
associate-/r*52.3%
associate-/l*54.1%
unpow254.1%
unpow254.1%
unpow254.1%
times-frac63.9%
swap-sqr73.5%
unpow273.5%
distribute-rgt-neg-in73.5%
Simplified73.6%
sub-neg73.6%
distribute-rgt-in59.0%
*-un-lft-identity59.0%
sqrt-div60.2%
sqrt-div64.5%
frac-times64.5%
add-sqr-sqrt64.6%
sqrt-prod58.7%
Applied egg-rr69.2%
*-lft-identity69.2%
distribute-rgt-in80.7%
associate-*l*83.6%
associate-/r/83.6%
Simplified83.6%
if 4.80000000000000004e181 < l Initial program 47.5%
Simplified47.5%
pow1/247.5%
div-inv47.5%
unpow-prod-down57.8%
pow1/257.8%
Applied egg-rr57.8%
unpow1/257.8%
Simplified57.8%
Taylor expanded in d around inf 40.3%
unpow-140.3%
metadata-eval40.3%
pow-sqr40.3%
rem-sqrt-square40.3%
rem-square-sqrt40.1%
fabs-sqr40.1%
rem-square-sqrt40.3%
Simplified40.3%
*-commutative40.3%
unpow-prod-down69.0%
Applied egg-rr69.0%
Final simplification72.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -3.4e-172)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l -2e-310)
(* d (pow (+ -1.0 (fma h l 1.0)) -0.5))
(if (<= l 9e+182)
(*
(/ d (sqrt (* h l)))
(+ 1.0 (* (/ -0.125 l) (* h (pow (* M_m (/ D_m d)) 2.0)))))
(* d (* (pow l -0.5) (pow h -0.5)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -3.4e-172) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (l <= -2e-310) {
tmp = d * pow((-1.0 + fma(h, l, 1.0)), -0.5);
} else if (l <= 9e+182) {
tmp = (d / sqrt((h * l))) * (1.0 + ((-0.125 / l) * (h * pow((M_m * (D_m / d)), 2.0))));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -3.4e-172) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= -2e-310) tmp = Float64(d * (Float64(-1.0 + fma(h, l, 1.0)) ^ -0.5)); elseif (l <= 9e+182) tmp = Float64(Float64(d / sqrt(Float64(h * l))) * Float64(1.0 + Float64(Float64(-0.125 / l) * Float64(h * (Float64(M_m * Float64(D_m / d)) ^ 2.0))))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -3.4e-172], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $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, 9e+182], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(h * N[Power[N[(M$95$m * N[(D$95$m / d), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -3.4 \cdot 10^{-172}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\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 \cdot 10^{+182}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot \left(1 + \frac{-0.125}{\ell} \cdot \left(h \cdot {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -3.3999999999999999e-172Initial program 55.5%
Simplified54.2%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt54.8%
neg-mul-154.8%
Simplified54.8%
if -3.3999999999999999e-172 < l < -1.999999999999994e-310Initial program 76.0%
Simplified76.0%
pow1/276.0%
div-inv76.0%
unpow-prod-down0.0%
pow1/20.0%
Applied egg-rr0.0%
unpow1/20.0%
Simplified0.0%
Taylor expanded in d around inf 33.5%
unpow-133.5%
metadata-eval33.5%
pow-sqr33.5%
rem-sqrt-square28.8%
rem-square-sqrt28.8%
fabs-sqr28.8%
rem-square-sqrt28.8%
Simplified28.8%
expm1-log1p-u28.8%
expm1-undefine47.9%
Applied egg-rr47.9%
sub-neg47.9%
metadata-eval47.9%
+-commutative47.9%
log1p-undefine47.9%
rem-exp-log47.9%
+-commutative47.9%
fma-define47.9%
Simplified47.9%
if -1.999999999999994e-310 < l < 9.00000000000000058e182Initial program 71.6%
Simplified71.6%
add-sqr-sqrt71.6%
pow271.6%
sqrt-prod71.6%
sqrt-pow172.6%
metadata-eval72.6%
pow172.6%
*-commutative72.6%
div-inv72.6%
metadata-eval72.6%
Applied egg-rr72.6%
Taylor expanded in h around inf 48.5%
sub-neg48.5%
distribute-lft-in48.5%
rgt-mult-inverse48.6%
distribute-rgt-neg-in48.6%
associate-/r*52.3%
associate-/l*54.1%
unpow254.1%
unpow254.1%
unpow254.1%
times-frac63.9%
swap-sqr73.5%
unpow273.5%
distribute-rgt-neg-in73.5%
Simplified73.6%
sub-neg73.6%
distribute-rgt-in59.0%
*-un-lft-identity59.0%
sqrt-div60.2%
sqrt-div64.5%
frac-times64.5%
add-sqr-sqrt64.6%
sqrt-prod58.7%
Applied egg-rr69.2%
*-lft-identity69.2%
distribute-rgt-in80.7%
associate-*l*83.6%
associate-/r/83.6%
Simplified83.6%
if 9.00000000000000058e182 < l Initial program 47.5%
Simplified47.5%
pow1/247.5%
div-inv47.5%
unpow-prod-down57.8%
pow1/257.8%
Applied egg-rr57.8%
unpow1/257.8%
Simplified57.8%
Taylor expanded in d around inf 40.3%
unpow-140.3%
metadata-eval40.3%
pow-sqr40.3%
rem-sqrt-square40.3%
rem-square-sqrt40.1%
fabs-sqr40.1%
rem-square-sqrt40.3%
Simplified40.3%
*-commutative40.3%
unpow-prod-down69.0%
Applied egg-rr69.0%
Final simplification66.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -4.8e-170)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l 3.2e-301)
(* d (pow (+ -1.0 (fma h l 1.0)) -0.5))
(if (<= l 1.06e-248)
(* (sqrt (/ d h)) (/ (pow (/ d l) 1.5) (/ (- d) l)))
(* d (* (pow l -0.5) (pow h -0.5)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.8e-170) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (l <= 3.2e-301) {
tmp = d * pow((-1.0 + fma(h, l, 1.0)), -0.5);
} else if (l <= 1.06e-248) {
tmp = sqrt((d / h)) * (pow((d / l), 1.5) / (-d / l));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -4.8e-170) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= 3.2e-301) tmp = Float64(d * (Float64(-1.0 + fma(h, l, 1.0)) ^ -0.5)); elseif (l <= 1.06e-248) tmp = Float64(sqrt(Float64(d / h)) * Float64((Float64(d / l) ^ 1.5) / Float64(Float64(-d) / l))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -4.8e-170], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.2e-301], N[(d * N[Power[N[(-1.0 + N[(h * l + 1.0), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.06e-248], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Power[N[(d / l), $MachinePrecision], 1.5], $MachinePrecision] / N[((-d) / l), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4.8 \cdot 10^{-170}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq 3.2 \cdot 10^{-301}:\\
\;\;\;\;d \cdot {\left(-1 + \mathsf{fma}\left(h, \ell, 1\right)\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq 1.06 \cdot 10^{-248}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \frac{{\left(\frac{d}{\ell}\right)}^{1.5}}{\frac{-d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -4.7999999999999999e-170Initial program 55.5%
Simplified54.2%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt54.8%
neg-mul-154.8%
Simplified54.8%
if -4.7999999999999999e-170 < l < 3.1999999999999999e-301Initial program 76.5%
Simplified76.6%
pow1/276.6%
div-inv76.5%
unpow-prod-down2.4%
pow1/22.4%
Applied egg-rr2.4%
unpow1/22.4%
Simplified2.4%
Taylor expanded in d around inf 35.1%
unpow-135.1%
metadata-eval35.1%
pow-sqr35.1%
rem-sqrt-square30.5%
rem-square-sqrt30.5%
fabs-sqr30.5%
rem-square-sqrt30.5%
Simplified30.5%
expm1-log1p-u30.5%
expm1-undefine49.1%
Applied egg-rr49.1%
sub-neg49.1%
metadata-eval49.1%
+-commutative49.1%
log1p-undefine49.1%
rem-exp-log49.1%
+-commutative49.1%
fma-define49.1%
Simplified49.1%
if 3.1999999999999999e-301 < l < 1.06000000000000007e-248Initial program 85.7%
Simplified85.7%
Taylor expanded in M around 0 0.5%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt17.3%
mul-1-neg17.3%
Simplified17.3%
neg-sub017.3%
flip3--71.7%
metadata-eval71.7%
pow371.7%
add-sqr-sqrt71.7%
pow171.7%
pow1/271.7%
pow-prod-up71.7%
metadata-eval71.7%
metadata-eval71.7%
add-sqr-sqrt71.7%
Applied egg-rr71.7%
sub0-neg71.7%
+-lft-identity71.7%
mul0-lft71.7%
+-rgt-identity71.7%
Simplified71.7%
if 1.06000000000000007e-248 < l Initial program 65.5%
Simplified65.5%
pow1/265.5%
div-inv65.5%
unpow-prod-down70.5%
pow1/270.5%
Applied egg-rr70.5%
unpow1/270.5%
Simplified70.5%
Taylor expanded in d around inf 42.4%
unpow-142.4%
metadata-eval42.4%
pow-sqr42.5%
rem-sqrt-square42.9%
rem-square-sqrt42.6%
fabs-sqr42.6%
rem-square-sqrt42.9%
Simplified42.9%
*-commutative42.9%
unpow-prod-down53.1%
Applied egg-rr53.1%
Final simplification53.5%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -6.2e-169)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l -2e-310)
(* d (pow (+ -1.0 (fma h l 1.0)) -0.5))
(* d (* (pow l -0.5) (pow h -0.5))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -6.2e-169) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (l <= -2e-310) {
tmp = d * pow((-1.0 + fma(h, l, 1.0)), -0.5);
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -6.2e-169) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= -2e-310) tmp = Float64(d * (Float64(-1.0 + fma(h, l, 1.0)) ^ -0.5)); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -6.2e-169], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $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[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -6.2 \cdot 10^{-169}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\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 \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -6.2000000000000004e-169Initial program 55.5%
Simplified54.2%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt54.8%
neg-mul-154.8%
Simplified54.8%
if -6.2000000000000004e-169 < l < -1.999999999999994e-310Initial program 76.0%
Simplified76.0%
pow1/276.0%
div-inv76.0%
unpow-prod-down0.0%
pow1/20.0%
Applied egg-rr0.0%
unpow1/20.0%
Simplified0.0%
Taylor expanded in d around inf 33.5%
unpow-133.5%
metadata-eval33.5%
pow-sqr33.5%
rem-sqrt-square28.8%
rem-square-sqrt28.8%
fabs-sqr28.8%
rem-square-sqrt28.8%
Simplified28.8%
expm1-log1p-u28.8%
expm1-undefine47.9%
Applied egg-rr47.9%
sub-neg47.9%
metadata-eval47.9%
+-commutative47.9%
log1p-undefine47.9%
rem-exp-log47.9%
+-commutative47.9%
fma-define47.9%
Simplified47.9%
if -1.999999999999994e-310 < l Initial program 66.8%
Simplified66.8%
pow1/266.8%
div-inv66.8%
unpow-prod-down71.5%
pow1/271.5%
Applied egg-rr71.5%
unpow1/271.5%
Simplified71.5%
Taylor expanded in d around inf 40.6%
unpow-140.6%
metadata-eval40.6%
pow-sqr40.6%
rem-sqrt-square41.0%
rem-square-sqrt40.8%
fabs-sqr40.8%
rem-square-sqrt41.0%
Simplified41.0%
*-commutative41.0%
unpow-prod-down50.6%
Applied egg-rr50.6%
Final simplification51.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -1.5e-185)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l -2e-310)
(* d (cbrt (pow (* h l) -1.5)))
(* d (* (pow l -0.5) (pow h -0.5))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.5e-185) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (l <= -2e-310) {
tmp = d * cbrt(pow((h * l), -1.5));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.5e-185) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else if (l <= -2e-310) {
tmp = d * Math.cbrt(Math.pow((h * l), -1.5));
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.5e-185) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= -2e-310) tmp = Float64(d * cbrt((Float64(h * l) ^ -1.5))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.5e-185], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -2e-310], N[(d * N[Power[N[Power[N[(h * l), $MachinePrecision], -1.5], $MachinePrecision], 1/3], $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.5 \cdot 10^{-185}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;d \cdot \sqrt[3]{{\left(h \cdot \ell\right)}^{-1.5}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -1.50000000000000015e-185Initial program 57.0%
Simplified55.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt54.1%
neg-mul-154.1%
Simplified54.1%
if -1.50000000000000015e-185 < l < -1.999999999999994e-310Initial program 74.2%
Simplified74.2%
Taylor expanded in d around inf 36.0%
*-commutative36.0%
add-cbrt-cube38.5%
add-cbrt-cube24.6%
cbrt-unprod24.9%
add-sqr-sqrt24.9%
pow124.9%
pow1/224.9%
pow-prod-up24.9%
metadata-eval24.9%
pow324.9%
Applied egg-rr24.9%
cbrt-prod24.6%
rem-cbrt-cube38.5%
inv-pow38.5%
pow-pow38.5%
metadata-eval38.5%
Applied egg-rr38.5%
if -1.999999999999994e-310 < l Initial program 66.8%
Simplified66.8%
pow1/266.8%
div-inv66.8%
unpow-prod-down71.5%
pow1/271.5%
Applied egg-rr71.5%
unpow1/271.5%
Simplified71.5%
Taylor expanded in d around inf 40.6%
unpow-140.6%
metadata-eval40.6%
pow-sqr40.6%
rem-sqrt-square41.0%
rem-square-sqrt40.8%
fabs-sqr40.8%
rem-square-sqrt41.0%
Simplified41.0%
*-commutative41.0%
unpow-prod-down50.6%
Applied egg-rr50.6%
Final simplification50.0%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (let* ((t_0 (sqrt (/ (/ 1.0 h) l)))) (if (<= l -1.45e-185) (* (- d) t_0) (* d t_0))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt(((1.0 / h) / l));
double tmp;
if (l <= -1.45e-185) {
tmp = -d * t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(((1.0d0 / h) / l))
if (l <= (-1.45d-185)) then
tmp = -d * t_0
else
tmp = d * t_0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt(((1.0 / h) / l));
double tmp;
if (l <= -1.45e-185) {
tmp = -d * t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt(((1.0 / h) / l)) tmp = 0 if l <= -1.45e-185: tmp = -d * t_0 else: tmp = d * t_0 return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(Float64(1.0 / h) / l)) tmp = 0.0 if (l <= -1.45e-185) tmp = Float64(Float64(-d) * t_0); else tmp = Float64(d * t_0); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt(((1.0 / h) / l));
tmp = 0.0;
if (l <= -1.45e-185)
tmp = -d * t_0;
else
tmp = d * t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -1.45e-185], N[((-d) * t$95$0), $MachinePrecision], N[(d * t$95$0), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{if}\;\ell \leq -1.45 \cdot 10^{-185}:\\
\;\;\;\;\left(-d\right) \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if l < -1.44999999999999997e-185Initial program 57.0%
Simplified55.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt54.1%
neg-mul-154.1%
Simplified54.1%
if -1.44999999999999997e-185 < l Initial program 68.5%
Simplified68.5%
Taylor expanded in d around inf 39.6%
associate-/r*39.9%
Simplified39.9%
Final simplification44.7%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= l -4.2e-184) (/ d (- (sqrt (* h l)))) (* d (sqrt (/ (/ 1.0 h) l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.2e-184) {
tmp = d / -sqrt((h * l));
} else {
tmp = d * sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
real(8) :: tmp
if (l <= (-4.2d-184)) then
tmp = d / -sqrt((h * l))
else
tmp = d * sqrt(((1.0d0 / h) / l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.2e-184) {
tmp = d / -Math.sqrt((h * l));
} else {
tmp = d * Math.sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -4.2e-184: tmp = d / -math.sqrt((h * l)) else: tmp = d * math.sqrt(((1.0 / h) / l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -4.2e-184) tmp = Float64(d / Float64(-sqrt(Float64(h * l)))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -4.2e-184)
tmp = d / -sqrt((h * l));
else
tmp = d * sqrt(((1.0 / h) / l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -4.2e-184], N[(d / (-N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4.2 \cdot 10^{-184}:\\
\;\;\;\;\frac{d}{-\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\end{array}
\end{array}
if l < -4.1999999999999998e-184Initial program 57.0%
Simplified55.8%
Taylor expanded in M around 0 37.6%
pow137.6%
*-rgt-identity37.6%
sqrt-unprod29.5%
Applied egg-rr29.5%
unpow129.5%
*-commutative29.5%
Simplified29.5%
sqrt-prod37.6%
add-sqr-sqrt37.6%
sqr-neg37.6%
sqrt-unprod0.6%
add-sqr-sqrt3.8%
distribute-lft-neg-in3.8%
*-commutative3.8%
neg-sub03.8%
sqrt-div0.0%
sqrt-div0.0%
frac-times0.0%
add-sqr-sqrt0.0%
sqrt-prod53.4%
Applied egg-rr53.4%
neg-sub053.4%
distribute-neg-frac53.4%
Simplified53.4%
if -4.1999999999999998e-184 < l Initial program 68.5%
Simplified68.5%
Taylor expanded in d around inf 39.6%
associate-/r*39.9%
Simplified39.9%
Final simplification44.5%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= l -4.2e-184) (/ d (- (sqrt (* h l)))) (* d (sqrt (/ 1.0 (* h l))))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.2e-184) {
tmp = d / -sqrt((h * l));
} else {
tmp = d * sqrt((1.0 / (h * l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
real(8) :: tmp
if (l <= (-4.2d-184)) then
tmp = d / -sqrt((h * l))
else
tmp = d * sqrt((1.0d0 / (h * l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.2e-184) {
tmp = d / -Math.sqrt((h * l));
} else {
tmp = d * Math.sqrt((1.0 / (h * l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -4.2e-184: tmp = d / -math.sqrt((h * l)) else: tmp = d * math.sqrt((1.0 / (h * l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -4.2e-184) tmp = Float64(d / Float64(-sqrt(Float64(h * l)))); else tmp = Float64(d * sqrt(Float64(1.0 / Float64(h * l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -4.2e-184)
tmp = d / -sqrt((h * l));
else
tmp = d * sqrt((1.0 / (h * l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -4.2e-184], N[(d / (-N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4.2 \cdot 10^{-184}:\\
\;\;\;\;\frac{d}{-\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\end{array}
\end{array}
if l < -4.1999999999999998e-184Initial program 57.0%
Simplified55.8%
Taylor expanded in M around 0 37.6%
pow137.6%
*-rgt-identity37.6%
sqrt-unprod29.5%
Applied egg-rr29.5%
unpow129.5%
*-commutative29.5%
Simplified29.5%
sqrt-prod37.6%
add-sqr-sqrt37.6%
sqr-neg37.6%
sqrt-unprod0.6%
add-sqr-sqrt3.8%
distribute-lft-neg-in3.8%
*-commutative3.8%
neg-sub03.8%
sqrt-div0.0%
sqrt-div0.0%
frac-times0.0%
add-sqr-sqrt0.0%
sqrt-prod53.4%
Applied egg-rr53.4%
neg-sub053.4%
distribute-neg-frac53.4%
Simplified53.4%
if -4.1999999999999998e-184 < l Initial program 68.5%
Simplified68.5%
Taylor expanded in d around inf 39.6%
Final simplification44.3%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= l -4.3e-184) (/ d (- (sqrt (* h l)))) (* d (pow (* h l) -0.5))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.3e-184) {
tmp = d / -sqrt((h * l));
} else {
tmp = d * pow((h * l), -0.5);
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
real(8) :: tmp
if (l <= (-4.3d-184)) then
tmp = d / -sqrt((h * l))
else
tmp = d * ((h * l) ** (-0.5d0))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4.3e-184) {
tmp = d / -Math.sqrt((h * l));
} else {
tmp = d * Math.pow((h * l), -0.5);
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -4.3e-184: tmp = d / -math.sqrt((h * l)) else: tmp = d * math.pow((h * l), -0.5) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -4.3e-184) tmp = Float64(d / Float64(-sqrt(Float64(h * l)))); else tmp = Float64(d * (Float64(h * l) ^ -0.5)); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -4.3e-184)
tmp = d / -sqrt((h * l));
else
tmp = d * ((h * l) ^ -0.5);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -4.3e-184], N[(d / (-N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4.3 \cdot 10^{-184}:\\
\;\;\;\;\frac{d}{-\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\end{array}
\end{array}
if l < -4.30000000000000007e-184Initial program 57.0%
Simplified55.8%
Taylor expanded in M around 0 37.6%
pow137.6%
*-rgt-identity37.6%
sqrt-unprod29.5%
Applied egg-rr29.5%
unpow129.5%
*-commutative29.5%
Simplified29.5%
sqrt-prod37.6%
add-sqr-sqrt37.6%
sqr-neg37.6%
sqrt-unprod0.6%
add-sqr-sqrt3.8%
distribute-lft-neg-in3.8%
*-commutative3.8%
neg-sub03.8%
sqrt-div0.0%
sqrt-div0.0%
frac-times0.0%
add-sqr-sqrt0.0%
sqrt-prod53.4%
Applied egg-rr53.4%
neg-sub053.4%
distribute-neg-frac53.4%
Simplified53.4%
if -4.30000000000000007e-184 < l Initial program 68.5%
Simplified68.5%
pow1/268.5%
div-inv68.5%
unpow-prod-down55.4%
pow1/255.4%
Applied egg-rr55.4%
unpow1/255.4%
Simplified55.4%
Taylor expanded in d around inf 39.6%
unpow-139.6%
metadata-eval39.6%
pow-sqr39.6%
rem-sqrt-square38.7%
rem-square-sqrt38.6%
fabs-sqr38.6%
rem-square-sqrt38.7%
Simplified38.7%
Final simplification43.7%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (* d (pow (* h l) -0.5)))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
return d * pow((h * l), -0.5);
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
code = d * ((h * l) ** (-0.5d0))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d * Math.pow((h * l), -0.5);
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d * math.pow((h * l), -0.5)
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d * (Float64(h * l) ^ -0.5)) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d * ((h * l) ^ -0.5);
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
d \cdot {\left(h \cdot \ell\right)}^{-0.5}
\end{array}
Initial program 64.6%
Simplified64.2%
pow1/264.2%
div-inv64.2%
unpow-prod-down36.6%
pow1/236.6%
Applied egg-rr36.6%
unpow1/236.6%
Simplified36.6%
Taylor expanded in d around inf 27.4%
unpow-127.4%
metadata-eval27.4%
pow-sqr27.5%
rem-sqrt-square26.5%
rem-square-sqrt26.4%
fabs-sqr26.4%
rem-square-sqrt26.5%
Simplified26.5%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (/ d (sqrt (* h l))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
return d / sqrt((h * l));
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
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_m
code = d / sqrt((h * l))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d / Math.sqrt((h * l));
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d / math.sqrt((h * l))
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d / sqrt(Float64(h * l))) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d / sqrt((h * l));
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\frac{d}{\sqrt{h \cdot \ell}}
\end{array}
Initial program 64.6%
Simplified63.8%
Taylor expanded in M around 0 37.5%
pow137.5%
*-rgt-identity37.5%
sqrt-unprod31.0%
Applied egg-rr31.0%
unpow131.0%
*-commutative31.0%
Simplified31.0%
*-commutative31.0%
sqrt-unprod37.5%
*-un-lft-identity37.5%
sqrt-div23.4%
sqrt-div25.8%
frac-times25.8%
add-sqr-sqrt25.9%
sqrt-prod26.5%
Applied egg-rr26.5%
*-lft-identity26.5%
Simplified26.5%
herbie shell --seed 2024137
(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)))))