
(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 16 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 (/ (cbrt h) l)) (t_1 (sqrt (- d))))
(if (<= d -58000000.0)
(*
(* (/ t_1 (sqrt (- h))) (sqrt (/ d l)))
(- 1.0 (* 0.5 (pow (* (* (/ D_m d) (* 0.5 M_m)) (sqrt (/ h l))) 2.0))))
(if (<= d -6e-300)
(*
(/ t_1 (sqrt (- l)))
(*
(sqrt (/ d h))
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(if (<= d 1.05e-194)
(*
(* (fabs t_0) (sqrt t_0))
(* -0.125 (* (pow D_m 2.0) (/ (pow M_m 2.0) d))))
(*
(+ 1.0 (* h (/ (* -0.125 (pow (* D_m (/ M_m d)) 2.0)) l)))
(/ d (* (sqrt l) (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 = cbrt(h) / l;
double t_1 = sqrt(-d);
double tmp;
if (d <= -58000000.0) {
tmp = ((t_1 / sqrt(-h)) * sqrt((d / l))) * (1.0 - (0.5 * pow((((D_m / d) * (0.5 * M_m)) * sqrt((h / l))), 2.0)));
} else if (d <= -6e-300) {
tmp = (t_1 / sqrt(-l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else if (d <= 1.05e-194) {
tmp = (fabs(t_0) * sqrt(t_0)) * (-0.125 * (pow(D_m, 2.0) * (pow(M_m, 2.0) / d)));
} else {
tmp = (1.0 + (h * ((-0.125 * pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (sqrt(l) * sqrt(h)));
}
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 t_0 = Math.cbrt(h) / l;
double t_1 = Math.sqrt(-d);
double tmp;
if (d <= -58000000.0) {
tmp = ((t_1 / Math.sqrt(-h)) * Math.sqrt((d / l))) * (1.0 - (0.5 * Math.pow((((D_m / d) * (0.5 * M_m)) * Math.sqrt((h / l))), 2.0)));
} else if (d <= -6e-300) {
tmp = (t_1 / Math.sqrt(-l)) * (Math.sqrt((d / h)) * (1.0 + ((h / l) * (Math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else if (d <= 1.05e-194) {
tmp = (Math.abs(t_0) * Math.sqrt(t_0)) * (-0.125 * (Math.pow(D_m, 2.0) * (Math.pow(M_m, 2.0) / d)));
} else {
tmp = (1.0 + (h * ((-0.125 * Math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (Math.sqrt(l) * 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(cbrt(h) / l) t_1 = sqrt(Float64(-d)) tmp = 0.0 if (d <= -58000000.0) tmp = Float64(Float64(Float64(t_1 / sqrt(Float64(-h))) * sqrt(Float64(d / l))) * Float64(1.0 - Float64(0.5 * (Float64(Float64(Float64(D_m / d) * Float64(0.5 * M_m)) * sqrt(Float64(h / l))) ^ 2.0)))); elseif (d <= -6e-300) tmp = Float64(Float64(t_1 / sqrt(Float64(-l))) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))))); elseif (d <= 1.05e-194) tmp = Float64(Float64(abs(t_0) * sqrt(t_0)) * Float64(-0.125 * Float64((D_m ^ 2.0) * Float64((M_m ^ 2.0) / d)))); else tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(D_m * Float64(M_m / d)) ^ 2.0)) / l))) * Float64(d / Float64(sqrt(l) * sqrt(h)))); 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[(N[Power[h, 1/3], $MachinePrecision] / l), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[d, -58000000.0], N[(N[(N[(t$95$1 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[Power[N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(0.5 * M$95$m), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -6e-300], N[(N[(t$95$1 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D$95$m * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.05e-194], N[(N[(N[Abs[t$95$0], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision] * N[(-0.125 * N[(N[Power[D$95$m, 2.0], $MachinePrecision] * N[(N[Power[M$95$m, 2.0], $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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 := \frac{\sqrt[3]{h}}{\ell}\\
t_1 := \sqrt{-d}\\
\mathbf{if}\;d \leq -58000000:\\
\;\;\;\;\left(\frac{t\_1}{\sqrt{-h}} \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(1 - 0.5 \cdot {\left(\left(\frac{D\_m}{d} \cdot \left(0.5 \cdot M\_m\right)\right) \cdot \sqrt{\frac{h}{\ell}}\right)}^{2}\right)\\
\mathbf{elif}\;d \leq -6 \cdot 10^{-300}:\\
\;\;\;\;\frac{t\_1}{\sqrt{-\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(D\_m \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right)\right)\\
\mathbf{elif}\;d \leq 1.05 \cdot 10^{-194}:\\
\;\;\;\;\left(\left|t\_0\right| \cdot \sqrt{t\_0}\right) \cdot \left(-0.125 \cdot \left({D\_m}^{2} \cdot \frac{{M\_m}^{2}}{d}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.125 \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if d < -5.8e7Initial program 77.8%
Simplified77.8%
add-sqr-sqrt77.7%
pow277.7%
sqrt-prod77.7%
sqrt-pow179.1%
metadata-eval79.1%
pow179.1%
*-commutative79.1%
div-inv79.1%
metadata-eval79.1%
Applied egg-rr79.1%
frac-2neg79.1%
sqrt-div92.8%
Applied egg-rr92.8%
if -5.8e7 < d < -6.00000000000000048e-300Initial program 63.7%
Simplified63.7%
frac-2neg63.7%
sqrt-div72.2%
Applied egg-rr72.2%
if -6.00000000000000048e-300 < d < 1.05e-194Initial program 18.4%
Simplified18.4%
Taylor expanded in d around 0 36.8%
associate-*r*36.8%
*-commutative36.8%
associate-/l*36.8%
Simplified36.8%
pow1/236.8%
add-cube-cbrt36.7%
unpow-prod-down36.7%
pow236.7%
cbrt-div36.6%
unpow336.6%
add-cbrt-cube36.7%
cbrt-div36.7%
unpow336.7%
add-cbrt-cube55.2%
Applied egg-rr55.2%
unpow1/255.2%
unpow255.2%
rem-sqrt-square59.8%
unpow1/259.8%
Simplified59.8%
if 1.05e-194 < d Initial program 68.1%
Simplified67.1%
add-sqr-sqrt67.1%
pow267.1%
sqrt-prod67.1%
sqrt-pow171.0%
metadata-eval71.0%
pow171.0%
*-commutative71.0%
div-inv71.0%
metadata-eval71.0%
Applied egg-rr71.0%
Taylor expanded in h around inf 52.3%
sub-neg52.3%
distribute-lft-in52.3%
rgt-mult-inverse52.4%
distribute-lft-neg-in52.4%
metadata-eval52.4%
associate-/r*53.5%
associate-*r/53.5%
Simplified71.5%
*-commutative71.5%
sqrt-div75.4%
sqrt-div90.9%
frac-times90.9%
add-sqr-sqrt91.0%
Applied egg-rr91.0%
Final simplification84.2%
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))))
(if (<= d -27000000.0)
(*
(* (/ t_0 (sqrt (- h))) (sqrt (/ d l)))
(- 1.0 (* 0.5 (pow (* (* (/ D_m d) (* 0.5 M_m)) (sqrt (/ h l))) 2.0))))
(if (<= d -6e-300)
(*
(/ t_0 (sqrt (- l)))
(*
(sqrt (/ d h))
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(*
(+ 1.0 (* h (/ (* -0.125 (pow (* D_m (/ M_m d)) 2.0)) l)))
(/ d (* (sqrt l) (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);
double tmp;
if (d <= -27000000.0) {
tmp = ((t_0 / sqrt(-h)) * sqrt((d / l))) * (1.0 - (0.5 * pow((((D_m / d) * (0.5 * M_m)) * sqrt((h / l))), 2.0)));
} else if (d <= -6e-300) {
tmp = (t_0 / sqrt(-l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else {
tmp = (1.0 + (h * ((-0.125 * pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (sqrt(l) * 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)
if (d <= (-27000000.0d0)) then
tmp = ((t_0 / sqrt(-h)) * sqrt((d / l))) * (1.0d0 - (0.5d0 * ((((d_m / d) * (0.5d0 * m_m)) * sqrt((h / l))) ** 2.0d0)))
else if (d <= (-6d-300)) then
tmp = (t_0 / sqrt(-l)) * (sqrt((d / h)) * (1.0d0 + ((h / l) * (((d_m * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))))
else
tmp = (1.0d0 + (h * (((-0.125d0) * ((d_m * (m_m / d)) ** 2.0d0)) / l))) * (d / (sqrt(l) * 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);
double tmp;
if (d <= -27000000.0) {
tmp = ((t_0 / Math.sqrt(-h)) * Math.sqrt((d / l))) * (1.0 - (0.5 * Math.pow((((D_m / d) * (0.5 * M_m)) * Math.sqrt((h / l))), 2.0)));
} else if (d <= -6e-300) {
tmp = (t_0 / Math.sqrt(-l)) * (Math.sqrt((d / h)) * (1.0 + ((h / l) * (Math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else {
tmp = (1.0 + (h * ((-0.125 * Math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (Math.sqrt(l) * 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) tmp = 0 if d <= -27000000.0: tmp = ((t_0 / math.sqrt(-h)) * math.sqrt((d / l))) * (1.0 - (0.5 * math.pow((((D_m / d) * (0.5 * M_m)) * math.sqrt((h / l))), 2.0))) elif d <= -6e-300: tmp = (t_0 / math.sqrt(-l)) * (math.sqrt((d / h)) * (1.0 + ((h / l) * (math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5)))) else: tmp = (1.0 + (h * ((-0.125 * math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (math.sqrt(l) * 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)) tmp = 0.0 if (d <= -27000000.0) tmp = Float64(Float64(Float64(t_0 / sqrt(Float64(-h))) * sqrt(Float64(d / l))) * Float64(1.0 - Float64(0.5 * (Float64(Float64(Float64(D_m / d) * Float64(0.5 * M_m)) * sqrt(Float64(h / l))) ^ 2.0)))); elseif (d <= -6e-300) tmp = Float64(Float64(t_0 / sqrt(Float64(-l))) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))))); else tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(D_m * Float64(M_m / d)) ^ 2.0)) / l))) * Float64(d / Float64(sqrt(l) * 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);
tmp = 0.0;
if (d <= -27000000.0)
tmp = ((t_0 / sqrt(-h)) * sqrt((d / l))) * (1.0 - (0.5 * ((((D_m / d) * (0.5 * M_m)) * sqrt((h / l))) ^ 2.0)));
elseif (d <= -6e-300)
tmp = (t_0 / sqrt(-l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (((D_m * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))));
else
tmp = (1.0 + (h * ((-0.125 * ((D_m * (M_m / d)) ^ 2.0)) / l))) * (d / (sqrt(l) * 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[(-d)], $MachinePrecision]}, If[LessEqual[d, -27000000.0], N[(N[(N[(t$95$0 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[Power[N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(0.5 * M$95$m), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -6e-300], N[(N[(t$95$0 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D$95$m * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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{-d}\\
\mathbf{if}\;d \leq -27000000:\\
\;\;\;\;\left(\frac{t\_0}{\sqrt{-h}} \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(1 - 0.5 \cdot {\left(\left(\frac{D\_m}{d} \cdot \left(0.5 \cdot M\_m\right)\right) \cdot \sqrt{\frac{h}{\ell}}\right)}^{2}\right)\\
\mathbf{elif}\;d \leq -6 \cdot 10^{-300}:\\
\;\;\;\;\frac{t\_0}{\sqrt{-\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(D\_m \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.125 \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if d < -2.7e7Initial program 77.8%
Simplified77.8%
add-sqr-sqrt77.7%
pow277.7%
sqrt-prod77.7%
sqrt-pow179.1%
metadata-eval79.1%
pow179.1%
*-commutative79.1%
div-inv79.1%
metadata-eval79.1%
Applied egg-rr79.1%
frac-2neg79.1%
sqrt-div92.8%
Applied egg-rr92.8%
if -2.7e7 < d < -6.00000000000000048e-300Initial program 63.7%
Simplified63.7%
frac-2neg63.7%
sqrt-div72.2%
Applied egg-rr72.2%
if -6.00000000000000048e-300 < d Initial program 58.9%
Simplified58.1%
add-sqr-sqrt58.1%
pow258.1%
sqrt-prod58.1%
sqrt-pow161.3%
metadata-eval61.3%
pow161.3%
*-commutative61.3%
div-inv61.3%
metadata-eval61.3%
Applied egg-rr61.3%
Taylor expanded in h around inf 43.6%
sub-neg43.6%
distribute-lft-in43.6%
rgt-mult-inverse43.6%
distribute-lft-neg-in43.6%
metadata-eval43.6%
associate-/r*44.5%
associate-*r/44.5%
Simplified61.7%
*-commutative61.7%
sqrt-div64.9%
sqrt-div81.7%
frac-times81.7%
add-sqr-sqrt81.8%
Applied egg-rr81.8%
Final simplification82.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
(let* ((t_0 (sqrt (/ d l))) (t_1 (sqrt (/ d h))) (t_2 (sqrt (- d))))
(if (<= d -5.5e+33)
(*
(* (/ t_2 (sqrt (- h))) t_0)
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0)))))
(if (<= d -7.2e-144)
(*
(* t_0 t_1)
(- 1.0 (* (* (pow (* D_m M_m) 2.0) (/ h (pow d 2.0))) (/ 0.125 l))))
(if (<= d -6e-300)
(*
(/ t_2 (sqrt (- l)))
(*
t_1
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(*
(+ 1.0 (* h (/ (* -0.125 (pow (* D_m (/ M_m d)) 2.0)) l)))
(/ d (* (sqrt l) (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 = sqrt((d / h));
double t_2 = sqrt(-d);
double tmp;
if (d <= -5.5e+33) {
tmp = ((t_2 / sqrt(-h)) * t_0) * (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0))));
} else if (d <= -7.2e-144) {
tmp = (t_0 * t_1) * (1.0 - ((pow((D_m * M_m), 2.0) * (h / pow(d, 2.0))) * (0.125 / l)));
} else if (d <= -6e-300) {
tmp = (t_2 / sqrt(-l)) * (t_1 * (1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else {
tmp = (1.0 + (h * ((-0.125 * pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (sqrt(l) * 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 = sqrt((d / h))
t_2 = sqrt(-d)
if (d <= (-5.5d+33)) then
tmp = ((t_2 / sqrt(-h)) * t_0) * (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0))))
else if (d <= (-7.2d-144)) then
tmp = (t_0 * t_1) * (1.0d0 - ((((d_m * m_m) ** 2.0d0) * (h / (d ** 2.0d0))) * (0.125d0 / l)))
else if (d <= (-6d-300)) then
tmp = (t_2 / sqrt(-l)) * (t_1 * (1.0d0 + ((h / l) * (((d_m * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))))
else
tmp = (1.0d0 + (h * (((-0.125d0) * ((d_m * (m_m / d)) ** 2.0d0)) / l))) * (d / (sqrt(l) * 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 = Math.sqrt((d / h));
double t_2 = Math.sqrt(-d);
double tmp;
if (d <= -5.5e+33) {
tmp = ((t_2 / Math.sqrt(-h)) * t_0) * (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0))));
} else if (d <= -7.2e-144) {
tmp = (t_0 * t_1) * (1.0 - ((Math.pow((D_m * M_m), 2.0) * (h / Math.pow(d, 2.0))) * (0.125 / l)));
} else if (d <= -6e-300) {
tmp = (t_2 / Math.sqrt(-l)) * (t_1 * (1.0 + ((h / l) * (Math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else {
tmp = (1.0 + (h * ((-0.125 * Math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (Math.sqrt(l) * 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 = math.sqrt((d / h)) t_2 = math.sqrt(-d) tmp = 0 if d <= -5.5e+33: tmp = ((t_2 / math.sqrt(-h)) * t_0) * (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) elif d <= -7.2e-144: tmp = (t_0 * t_1) * (1.0 - ((math.pow((D_m * M_m), 2.0) * (h / math.pow(d, 2.0))) * (0.125 / l))) elif d <= -6e-300: tmp = (t_2 / math.sqrt(-l)) * (t_1 * (1.0 + ((h / l) * (math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5)))) else: tmp = (1.0 + (h * ((-0.125 * math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (math.sqrt(l) * 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 = sqrt(Float64(d / h)) t_2 = sqrt(Float64(-d)) tmp = 0.0 if (d <= -5.5e+33) tmp = Float64(Float64(Float64(t_2 / sqrt(Float64(-h))) * t_0) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0))))); elseif (d <= -7.2e-144) tmp = Float64(Float64(t_0 * t_1) * Float64(1.0 - Float64(Float64((Float64(D_m * M_m) ^ 2.0) * Float64(h / (d ^ 2.0))) * Float64(0.125 / l)))); elseif (d <= -6e-300) tmp = Float64(Float64(t_2 / sqrt(Float64(-l))) * Float64(t_1 * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))))); else tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(D_m * Float64(M_m / d)) ^ 2.0)) / l))) * Float64(d / Float64(sqrt(l) * 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 = sqrt((d / h));
t_2 = sqrt(-d);
tmp = 0.0;
if (d <= -5.5e+33)
tmp = ((t_2 / sqrt(-h)) * t_0) * (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0))));
elseif (d <= -7.2e-144)
tmp = (t_0 * t_1) * (1.0 - ((((D_m * M_m) ^ 2.0) * (h / (d ^ 2.0))) * (0.125 / l)));
elseif (d <= -6e-300)
tmp = (t_2 / sqrt(-l)) * (t_1 * (1.0 + ((h / l) * (((D_m * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))));
else
tmp = (1.0 + (h * ((-0.125 * ((D_m * (M_m / d)) ^ 2.0)) / l))) * (d / (sqrt(l) * 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[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[d, -5.5e+33], N[(N[(N[(t$95$2 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -7.2e-144], N[(N[(t$95$0 * t$95$1), $MachinePrecision] * N[(1.0 - N[(N[(N[Power[N[(D$95$m * M$95$m), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / N[Power[d, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.125 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -6e-300], N[(N[(t$95$2 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(t$95$1 * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D$95$m * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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}}\\
t_1 := \sqrt{\frac{d}{h}}\\
t_2 := \sqrt{-d}\\
\mathbf{if}\;d \leq -5.5 \cdot 10^{+33}:\\
\;\;\;\;\left(\frac{t\_2}{\sqrt{-h}} \cdot t\_0\right) \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right)\\
\mathbf{elif}\;d \leq -7.2 \cdot 10^{-144}:\\
\;\;\;\;\left(t\_0 \cdot t\_1\right) \cdot \left(1 - \left({\left(D\_m \cdot M\_m\right)}^{2} \cdot \frac{h}{{d}^{2}}\right) \cdot \frac{0.125}{\ell}\right)\\
\mathbf{elif}\;d \leq -6 \cdot 10^{-300}:\\
\;\;\;\;\frac{t\_2}{\sqrt{-\ell}} \cdot \left(t\_1 \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(D\_m \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.125 \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if d < -5.5000000000000006e33Initial program 79.5%
Simplified79.5%
frac-2neg79.5%
sqrt-div95.0%
Applied egg-rr93.6%
if -5.5000000000000006e33 < d < -7.2000000000000001e-144Initial program 79.6%
Simplified79.6%
expm1-log1p-u78.5%
expm1-undefine78.5%
*-commutative78.5%
*-commutative78.5%
div-inv78.5%
metadata-eval78.5%
Applied egg-rr78.5%
expm1-define78.5%
associate-*l/91.4%
associate-/l*91.4%
Simplified91.4%
Taylor expanded in h around 0 59.6%
associate-/r*68.0%
associate-*r/68.0%
*-commutative68.0%
associate-/l*68.0%
associate-*r*71.1%
associate-/l*71.1%
unpow271.1%
unpow271.1%
swap-sqr93.9%
unpow293.9%
Simplified93.9%
if -7.2000000000000001e-144 < d < -6.00000000000000048e-300Initial program 49.5%
Simplified49.5%
frac-2neg49.5%
sqrt-div63.9%
Applied egg-rr63.9%
if -6.00000000000000048e-300 < d Initial program 58.9%
Simplified58.1%
add-sqr-sqrt58.1%
pow258.1%
sqrt-prod58.1%
sqrt-pow161.3%
metadata-eval61.3%
pow161.3%
*-commutative61.3%
div-inv61.3%
metadata-eval61.3%
Applied egg-rr61.3%
Taylor expanded in h around inf 43.6%
sub-neg43.6%
distribute-lft-in43.6%
rgt-mult-inverse43.6%
distribute-lft-neg-in43.6%
metadata-eval43.6%
associate-/r*44.5%
associate-*r/44.5%
Simplified61.7%
*-commutative61.7%
sqrt-div64.9%
sqrt-div81.7%
frac-times81.7%
add-sqr-sqrt81.8%
Applied egg-rr81.8%
Final simplification83.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
(let* ((t_0 (sqrt (/ d l)))
(t_1 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0)))))
(if (<= d -1.8e+33)
(* (* (/ (sqrt (- d)) (sqrt (- h))) t_0) (- 1.0 t_1))
(if (<= d -7.8e-144)
(*
(* t_0 (sqrt (/ d h)))
(- 1.0 (* (* (pow (* D_m M_m) 2.0) (/ h (pow d 2.0))) (/ 0.125 l))))
(if (<= d -6e-300)
(* (* d (sqrt (/ 1.0 (* h l)))) (+ t_1 -1.0))
(*
(+ 1.0 (* h (/ (* -0.125 (pow (* D_m (/ M_m d)) 2.0)) l)))
(/ d (* (sqrt l) (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 = 0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0));
double tmp;
if (d <= -1.8e+33) {
tmp = ((sqrt(-d) / sqrt(-h)) * t_0) * (1.0 - t_1);
} else if (d <= -7.8e-144) {
tmp = (t_0 * sqrt((d / h))) * (1.0 - ((pow((D_m * M_m), 2.0) * (h / pow(d, 2.0))) * (0.125 / l)));
} else if (d <= -6e-300) {
tmp = (d * sqrt((1.0 / (h * l)))) * (t_1 + -1.0);
} else {
tmp = (1.0 + (h * ((-0.125 * pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (sqrt(l) * 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) :: tmp
t_0 = sqrt((d / l))
t_1 = 0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0))
if (d <= (-1.8d+33)) then
tmp = ((sqrt(-d) / sqrt(-h)) * t_0) * (1.0d0 - t_1)
else if (d <= (-7.8d-144)) then
tmp = (t_0 * sqrt((d / h))) * (1.0d0 - ((((d_m * m_m) ** 2.0d0) * (h / (d ** 2.0d0))) * (0.125d0 / l)))
else if (d <= (-6d-300)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * (t_1 + (-1.0d0))
else
tmp = (1.0d0 + (h * (((-0.125d0) * ((d_m * (m_m / d)) ** 2.0d0)) / l))) * (d / (sqrt(l) * 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 = 0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0));
double tmp;
if (d <= -1.8e+33) {
tmp = ((Math.sqrt(-d) / Math.sqrt(-h)) * t_0) * (1.0 - t_1);
} else if (d <= -7.8e-144) {
tmp = (t_0 * Math.sqrt((d / h))) * (1.0 - ((Math.pow((D_m * M_m), 2.0) * (h / Math.pow(d, 2.0))) * (0.125 / l)));
} else if (d <= -6e-300) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (t_1 + -1.0);
} else {
tmp = (1.0 + (h * ((-0.125 * Math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (Math.sqrt(l) * 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 = 0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)) tmp = 0 if d <= -1.8e+33: tmp = ((math.sqrt(-d) / math.sqrt(-h)) * t_0) * (1.0 - t_1) elif d <= -7.8e-144: tmp = (t_0 * math.sqrt((d / h))) * (1.0 - ((math.pow((D_m * M_m), 2.0) * (h / math.pow(d, 2.0))) * (0.125 / l))) elif d <= -6e-300: tmp = (d * math.sqrt((1.0 / (h * l)))) * (t_1 + -1.0) else: tmp = (1.0 + (h * ((-0.125 * math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (math.sqrt(l) * 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(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0))) tmp = 0.0 if (d <= -1.8e+33) tmp = Float64(Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0) * Float64(1.0 - t_1)); elseif (d <= -7.8e-144) tmp = Float64(Float64(t_0 * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64((Float64(D_m * M_m) ^ 2.0) * Float64(h / (d ^ 2.0))) * Float64(0.125 / l)))); elseif (d <= -6e-300) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(t_1 + -1.0)); else tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(D_m * Float64(M_m / d)) ^ 2.0)) / l))) * Float64(d / Float64(sqrt(l) * 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 = 0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0));
tmp = 0.0;
if (d <= -1.8e+33)
tmp = ((sqrt(-d) / sqrt(-h)) * t_0) * (1.0 - t_1);
elseif (d <= -7.8e-144)
tmp = (t_0 * sqrt((d / h))) * (1.0 - ((((D_m * M_m) ^ 2.0) * (h / (d ^ 2.0))) * (0.125 / l)));
elseif (d <= -6e-300)
tmp = (d * sqrt((1.0 / (h * l)))) * (t_1 + -1.0);
else
tmp = (1.0 + (h * ((-0.125 * ((D_m * (M_m / d)) ^ 2.0)) / l))) * (d / (sqrt(l) * 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[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -1.8e+33], N[(N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(1.0 - t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -7.8e-144], N[(N[(t$95$0 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[Power[N[(D$95$m * M$95$m), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / N[Power[d, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.125 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -6e-300], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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}}\\
t_1 := 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\\
\mathbf{if}\;d \leq -1.8 \cdot 10^{+33}:\\
\;\;\;\;\left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\right) \cdot \left(1 - t\_1\right)\\
\mathbf{elif}\;d \leq -7.8 \cdot 10^{-144}:\\
\;\;\;\;\left(t\_0 \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \left({\left(D\_m \cdot M\_m\right)}^{2} \cdot \frac{h}{{d}^{2}}\right) \cdot \frac{0.125}{\ell}\right)\\
\mathbf{elif}\;d \leq -6 \cdot 10^{-300}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(t\_1 + -1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.125 \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if d < -1.8000000000000001e33Initial program 79.5%
Simplified79.5%
frac-2neg79.5%
sqrt-div95.0%
Applied egg-rr93.6%
if -1.8000000000000001e33 < d < -7.8000000000000003e-144Initial program 79.6%
Simplified79.6%
expm1-log1p-u78.5%
expm1-undefine78.5%
*-commutative78.5%
*-commutative78.5%
div-inv78.5%
metadata-eval78.5%
Applied egg-rr78.5%
expm1-define78.5%
associate-*l/91.4%
associate-/l*91.4%
Simplified91.4%
Taylor expanded in h around 0 59.6%
associate-/r*68.0%
associate-*r/68.0%
*-commutative68.0%
associate-/l*68.0%
associate-*r*71.1%
associate-/l*71.1%
unpow271.1%
unpow271.1%
swap-sqr93.9%
unpow293.9%
Simplified93.9%
if -7.8000000000000003e-144 < d < -6.00000000000000048e-300Initial program 49.5%
Simplified46.9%
frac-2neg47.3%
sqrt-div52.6%
Applied egg-rr52.2%
Taylor expanded in d around -inf 61.4%
if -6.00000000000000048e-300 < d Initial program 58.9%
Simplified58.1%
add-sqr-sqrt58.1%
pow258.1%
sqrt-prod58.1%
sqrt-pow161.3%
metadata-eval61.3%
pow161.3%
*-commutative61.3%
div-inv61.3%
metadata-eval61.3%
Applied egg-rr61.3%
Taylor expanded in h around inf 43.6%
sub-neg43.6%
distribute-lft-in43.6%
rgt-mult-inverse43.6%
distribute-lft-neg-in43.6%
metadata-eval43.6%
associate-/r*44.5%
associate-*r/44.5%
Simplified61.7%
*-commutative61.7%
sqrt-div64.9%
sqrt-div81.7%
frac-times81.7%
add-sqr-sqrt81.8%
Applied egg-rr81.8%
Final simplification83.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
(let* ((t_0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0)))))
(if (<= h -2.8e+112)
(* (- 1.0 t_0) (/ (sqrt (* d (/ d (- l)))) (sqrt (- h))))
(if (<= h -5e-311)
(* (* d (sqrt (/ 1.0 (* h l)))) (+ t_0 -1.0))
(*
(+ 1.0 (* h (/ (* -0.125 (pow (* D_m (/ M_m d)) 2.0)) l)))
(/ d (* (sqrt l) (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 = 0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0));
double tmp;
if (h <= -2.8e+112) {
tmp = (1.0 - t_0) * (sqrt((d * (d / -l))) / sqrt(-h));
} else if (h <= -5e-311) {
tmp = (d * sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
} else {
tmp = (1.0 + (h * ((-0.125 * pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (sqrt(l) * 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 = 0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0))
if (h <= (-2.8d+112)) then
tmp = (1.0d0 - t_0) * (sqrt((d * (d / -l))) / sqrt(-h))
else if (h <= (-5d-311)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * (t_0 + (-1.0d0))
else
tmp = (1.0d0 + (h * (((-0.125d0) * ((d_m * (m_m / d)) ** 2.0d0)) / l))) * (d / (sqrt(l) * 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 = 0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0));
double tmp;
if (h <= -2.8e+112) {
tmp = (1.0 - t_0) * (Math.sqrt((d * (d / -l))) / Math.sqrt(-h));
} else if (h <= -5e-311) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
} else {
tmp = (1.0 + (h * ((-0.125 * Math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (Math.sqrt(l) * 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 = 0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)) tmp = 0 if h <= -2.8e+112: tmp = (1.0 - t_0) * (math.sqrt((d * (d / -l))) / math.sqrt(-h)) elif h <= -5e-311: tmp = (d * math.sqrt((1.0 / (h * l)))) * (t_0 + -1.0) else: tmp = (1.0 + (h * ((-0.125 * math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (math.sqrt(l) * 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(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0))) tmp = 0.0 if (h <= -2.8e+112) tmp = Float64(Float64(1.0 - t_0) * Float64(sqrt(Float64(d * Float64(d / Float64(-l)))) / sqrt(Float64(-h)))); elseif (h <= -5e-311) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(t_0 + -1.0)); else tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(D_m * Float64(M_m / d)) ^ 2.0)) / l))) * Float64(d / Float64(sqrt(l) * 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 = 0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0));
tmp = 0.0;
if (h <= -2.8e+112)
tmp = (1.0 - t_0) * (sqrt((d * (d / -l))) / sqrt(-h));
elseif (h <= -5e-311)
tmp = (d * sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
else
tmp = (1.0 + (h * ((-0.125 * ((D_m * (M_m / d)) ^ 2.0)) / l))) * (d / (sqrt(l) * 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[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -2.8e+112], N[(N[(1.0 - t$95$0), $MachinePrecision] * N[(N[Sqrt[N[(d * N[(d / (-l)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -5e-311], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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 := 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\\
\mathbf{if}\;h \leq -2.8 \cdot 10^{+112}:\\
\;\;\;\;\left(1 - t\_0\right) \cdot \frac{\sqrt{d \cdot \frac{d}{-\ell}}}{\sqrt{-h}}\\
\mathbf{elif}\;h \leq -5 \cdot 10^{-311}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(t\_0 + -1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.125 \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if h < -2.8000000000000001e112Initial program 71.5%
Simplified71.5%
frac-2neg71.5%
sqrt-div77.1%
Applied egg-rr77.0%
associate-*l/77.1%
pow1/277.1%
pow1/277.1%
pow-prod-down77.3%
Applied egg-rr77.3%
unpow1/277.3%
*-commutative77.3%
Simplified77.3%
if -2.8000000000000001e112 < h < -5.00000000000023e-311Initial program 70.4%
Simplified69.5%
frac-2neg70.5%
sqrt-div80.2%
Applied egg-rr78.3%
Taylor expanded in d around -inf 78.2%
if -5.00000000000023e-311 < h Initial program 59.4%
Simplified58.6%
add-sqr-sqrt58.6%
pow258.6%
sqrt-prod58.6%
sqrt-pow161.8%
metadata-eval61.8%
pow161.8%
*-commutative61.8%
div-inv61.8%
metadata-eval61.8%
Applied egg-rr61.8%
Taylor expanded in h around inf 43.9%
sub-neg43.9%
distribute-lft-in43.9%
rgt-mult-inverse44.0%
distribute-lft-neg-in44.0%
metadata-eval44.0%
associate-/r*44.9%
associate-*r/44.9%
Simplified62.2%
*-commutative62.2%
sqrt-div65.4%
sqrt-div82.4%
frac-times82.4%
add-sqr-sqrt82.5%
Applied egg-rr82.5%
Final simplification80.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 (+ 1.0 (* h (/ (* -0.125 (pow (* D_m (/ M_m d)) 2.0)) l)))))
(if (<= h -1.22e-17)
(* t_0 (* (sqrt (/ d l)) (sqrt (/ d h))))
(if (<= h -5e-311)
(*
(* d (sqrt (/ 1.0 (* h l))))
(+ (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))) -1.0))
(* t_0 (/ d (* (sqrt l) (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 = 1.0 + (h * ((-0.125 * pow((D_m * (M_m / d)), 2.0)) / l));
double tmp;
if (h <= -1.22e-17) {
tmp = t_0 * (sqrt((d / l)) * sqrt((d / h)));
} else if (h <= -5e-311) {
tmp = (d * sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else {
tmp = t_0 * (d / (sqrt(l) * 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 = 1.0d0 + (h * (((-0.125d0) * ((d_m * (m_m / d)) ** 2.0d0)) / l))
if (h <= (-1.22d-17)) then
tmp = t_0 * (sqrt((d / l)) * sqrt((d / h)))
else if (h <= (-5d-311)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0))) + (-1.0d0))
else
tmp = t_0 * (d / (sqrt(l) * 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 = 1.0 + (h * ((-0.125 * Math.pow((D_m * (M_m / d)), 2.0)) / l));
double tmp;
if (h <= -1.22e-17) {
tmp = t_0 * (Math.sqrt((d / l)) * Math.sqrt((d / h)));
} else if (h <= -5e-311) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else {
tmp = t_0 * (d / (Math.sqrt(l) * 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 = 1.0 + (h * ((-0.125 * math.pow((D_m * (M_m / d)), 2.0)) / l)) tmp = 0 if h <= -1.22e-17: tmp = t_0 * (math.sqrt((d / l)) * math.sqrt((d / h))) elif h <= -5e-311: tmp = (d * math.sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0) else: tmp = t_0 * (d / (math.sqrt(l) * 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(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(D_m * Float64(M_m / d)) ^ 2.0)) / l))) tmp = 0.0 if (h <= -1.22e-17) tmp = Float64(t_0 * Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h)))); elseif (h <= -5e-311) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0))) + -1.0)); else tmp = Float64(t_0 * Float64(d / Float64(sqrt(l) * 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 = 1.0 + (h * ((-0.125 * ((D_m * (M_m / d)) ^ 2.0)) / l));
tmp = 0.0;
if (h <= -1.22e-17)
tmp = t_0 * (sqrt((d / l)) * sqrt((d / h)));
elseif (h <= -5e-311)
tmp = (d * sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0))) + -1.0);
else
tmp = t_0 * (d / (sqrt(l) * 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[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -1.22e-17], N[(t$95$0 * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -5e-311], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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 := 1 + h \cdot \frac{-0.125 \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\\
\mathbf{if}\;h \leq -1.22 \cdot 10^{-17}:\\
\;\;\;\;t\_0 \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{elif}\;h \leq -5 \cdot 10^{-311}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right) + -1\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if h < -1.22e-17Initial program 75.4%
Simplified75.4%
add-sqr-sqrt75.4%
pow275.4%
sqrt-prod75.4%
sqrt-pow176.7%
metadata-eval76.7%
pow176.7%
*-commutative76.7%
div-inv76.7%
metadata-eval76.7%
Applied egg-rr76.7%
Taylor expanded in h around inf 47.4%
sub-neg47.4%
distribute-lft-in47.4%
rgt-mult-inverse47.5%
distribute-lft-neg-in47.5%
metadata-eval47.5%
associate-/r*50.3%
associate-*r/50.3%
Simplified79.0%
if -1.22e-17 < h < -5.00000000000023e-311Initial program 65.7%
Simplified64.3%
frac-2neg64.4%
sqrt-div79.5%
Applied egg-rr78.0%
Taylor expanded in d around -inf 76.7%
if -5.00000000000023e-311 < h Initial program 59.4%
Simplified58.6%
add-sqr-sqrt58.6%
pow258.6%
sqrt-prod58.6%
sqrt-pow161.8%
metadata-eval61.8%
pow161.8%
*-commutative61.8%
div-inv61.8%
metadata-eval61.8%
Applied egg-rr61.8%
Taylor expanded in h around inf 43.9%
sub-neg43.9%
distribute-lft-in43.9%
rgt-mult-inverse44.0%
distribute-lft-neg-in44.0%
metadata-eval44.0%
associate-/r*44.9%
associate-*r/44.9%
Simplified62.2%
*-commutative62.2%
sqrt-div65.4%
sqrt-div82.4%
frac-times82.4%
add-sqr-sqrt82.5%
Applied egg-rr82.5%
Final simplification80.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 (<= h -3e+98)
(*
(sqrt (* (/ d l) (/ d h)))
(+ 1.0 (* -0.5 (* h (/ (pow (* M_m (* 0.5 (/ D_m d))) 2.0) l)))))
(if (<= h -5e-311)
(*
(* d (sqrt (/ 1.0 (* h l))))
(+ (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))) -1.0))
(*
(+ 1.0 (* h (/ (* -0.125 (pow (* D_m (/ M_m d)) 2.0)) l)))
(/ d (* (sqrt l) (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 tmp;
if (h <= -3e+98) {
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (pow((M_m * (0.5 * (D_m / d))), 2.0) / l))));
} else if (h <= -5e-311) {
tmp = (d * sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else {
tmp = (1.0 + (h * ((-0.125 * pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (sqrt(l) * 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) :: tmp
if (h <= (-3d+98)) then
tmp = sqrt(((d / l) * (d / h))) * (1.0d0 + ((-0.5d0) * (h * (((m_m * (0.5d0 * (d_m / d))) ** 2.0d0) / l))))
else if (h <= (-5d-311)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0))) + (-1.0d0))
else
tmp = (1.0d0 + (h * (((-0.125d0) * ((d_m * (m_m / d)) ** 2.0d0)) / l))) * (d / (sqrt(l) * 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 tmp;
if (h <= -3e+98) {
tmp = Math.sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (Math.pow((M_m * (0.5 * (D_m / d))), 2.0) / l))));
} else if (h <= -5e-311) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else {
tmp = (1.0 + (h * ((-0.125 * Math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (Math.sqrt(l) * 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): tmp = 0 if h <= -3e+98: tmp = math.sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (math.pow((M_m * (0.5 * (D_m / d))), 2.0) / l)))) elif h <= -5e-311: tmp = (d * math.sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0) else: tmp = (1.0 + (h * ((-0.125 * math.pow((D_m * (M_m / d)), 2.0)) / l))) * (d / (math.sqrt(l) * 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) tmp = 0.0 if (h <= -3e+98) tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * Float64(1.0 + Float64(-0.5 * Float64(h * Float64((Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0) / l))))); elseif (h <= -5e-311) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0))) + -1.0)); else tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(D_m * Float64(M_m / d)) ^ 2.0)) / l))) * Float64(d / Float64(sqrt(l) * 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)
tmp = 0.0;
if (h <= -3e+98)
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (((M_m * (0.5 * (D_m / d))) ^ 2.0) / l))));
elseif (h <= -5e-311)
tmp = (d * sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0))) + -1.0);
else
tmp = (1.0 + (h * ((-0.125 * ((D_m * (M_m / d)) ^ 2.0)) / l))) * (d / (sqrt(l) * 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_] := If[LessEqual[h, -3e+98], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(h * N[(N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -5e-311], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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}\;h \leq -3 \cdot 10^{+98}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot \left(1 + -0.5 \cdot \left(h \cdot \frac{{\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}}{\ell}\right)\right)\\
\mathbf{elif}\;h \leq -5 \cdot 10^{-311}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right) + -1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.125 \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if h < -3.0000000000000001e98Initial program 71.2%
Simplified71.2%
expm1-log1p-u71.0%
expm1-undefine71.0%
*-commutative71.0%
*-commutative71.0%
div-inv71.0%
metadata-eval71.0%
Applied egg-rr71.0%
expm1-define71.0%
associate-*l/71.0%
associate-/l*73.3%
Simplified73.3%
pow173.3%
Applied egg-rr61.1%
unpow161.1%
*-commutative61.1%
associate-*r/63.6%
associate-*l*63.6%
Simplified63.6%
if -3.0000000000000001e98 < h < -5.00000000000023e-311Initial program 70.5%
Simplified69.5%
frac-2neg70.6%
sqrt-div80.6%
Applied egg-rr78.6%
Taylor expanded in d around -inf 78.5%
if -5.00000000000023e-311 < h Initial program 59.4%
Simplified58.6%
add-sqr-sqrt58.6%
pow258.6%
sqrt-prod58.6%
sqrt-pow161.8%
metadata-eval61.8%
pow161.8%
*-commutative61.8%
div-inv61.8%
metadata-eval61.8%
Applied egg-rr61.8%
Taylor expanded in h around inf 43.9%
sub-neg43.9%
distribute-lft-in43.9%
rgt-mult-inverse44.0%
distribute-lft-neg-in44.0%
metadata-eval44.0%
associate-/r*44.9%
associate-*r/44.9%
Simplified62.2%
*-commutative62.2%
sqrt-div65.4%
sqrt-div82.4%
frac-times82.4%
add-sqr-sqrt82.5%
Applied egg-rr82.5%
Final simplification78.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
(if (<= h -1.4e+98)
(*
(sqrt (* (/ d l) (/ d h)))
(+ 1.0 (* -0.5 (* h (/ (pow (* M_m (* 0.5 (/ D_m d))) 2.0) l)))))
(if (<= h -5e-311)
(*
(* d (sqrt (/ 1.0 (* h l))))
(+ (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))) -1.0))
(*
(fma -0.125 (* (/ h l) (pow (* D_m (/ M_m d)) 2.0)) 1.0)
(/ 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) {
double tmp;
if (h <= -1.4e+98) {
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (pow((M_m * (0.5 * (D_m / d))), 2.0) / l))));
} else if (h <= -5e-311) {
tmp = (d * sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else {
tmp = fma(-0.125, ((h / l) * pow((D_m * (M_m / d)), 2.0)), 1.0) * (d / sqrt((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 (h <= -1.4e+98) tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * Float64(1.0 + Float64(-0.5 * Float64(h * Float64((Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0) / l))))); elseif (h <= -5e-311) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0))) + -1.0)); else tmp = Float64(fma(-0.125, Float64(Float64(h / l) * (Float64(D_m * Float64(M_m / d)) ^ 2.0)), 1.0) * Float64(d / sqrt(Float64(h * l)))); 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[h, -1.4e+98], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(h * N[(N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -5e-311], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(-0.125 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[(d / N[Sqrt[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}\;h \leq -1.4 \cdot 10^{+98}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot \left(1 + -0.5 \cdot \left(h \cdot \frac{{\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}}{\ell}\right)\right)\\
\mathbf{elif}\;h \leq -5 \cdot 10^{-311}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right) + -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-0.125, \frac{h}{\ell} \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}, 1\right) \cdot \frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if h < -1.4e98Initial program 71.2%
Simplified71.2%
expm1-log1p-u71.0%
expm1-undefine71.0%
*-commutative71.0%
*-commutative71.0%
div-inv71.0%
metadata-eval71.0%
Applied egg-rr71.0%
expm1-define71.0%
associate-*l/71.0%
associate-/l*73.3%
Simplified73.3%
pow173.3%
Applied egg-rr61.1%
unpow161.1%
*-commutative61.1%
associate-*r/63.6%
associate-*l*63.6%
Simplified63.6%
if -1.4e98 < h < -5.00000000000023e-311Initial program 70.5%
Simplified69.5%
frac-2neg70.6%
sqrt-div80.6%
Applied egg-rr78.6%
Taylor expanded in d around -inf 78.5%
if -5.00000000000023e-311 < h Initial program 59.4%
Simplified58.6%
add-sqr-sqrt58.6%
pow258.6%
sqrt-prod58.6%
sqrt-pow161.8%
metadata-eval61.8%
pow161.8%
*-commutative61.8%
div-inv61.8%
metadata-eval61.8%
Applied egg-rr61.8%
pow161.8%
Applied egg-rr73.2%
Simplified74.0%
Final simplification74.2%
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 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0)))))
(if (<= h -9e+95)
(*
(sqrt (* (/ d l) (/ d h)))
(+ 1.0 (* -0.5 (* h (/ (pow (* M_m (* 0.5 (/ D_m d))) 2.0) l)))))
(if (<= h -5e-311)
(* (* d (sqrt (/ 1.0 (* h l)))) (+ t_0 -1.0))
(* (- 1.0 t_0) (/ 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) {
double t_0 = 0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0));
double tmp;
if (h <= -9e+95) {
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (pow((M_m * (0.5 * (D_m / d))), 2.0) / l))));
} else if (h <= -5e-311) {
tmp = (d * sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
} else {
tmp = (1.0 - t_0) * (d / sqrt((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) :: t_0
real(8) :: tmp
t_0 = 0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0))
if (h <= (-9d+95)) then
tmp = sqrt(((d / l) * (d / h))) * (1.0d0 + ((-0.5d0) * (h * (((m_m * (0.5d0 * (d_m / d))) ** 2.0d0) / l))))
else if (h <= (-5d-311)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * (t_0 + (-1.0d0))
else
tmp = (1.0d0 - t_0) * (d / sqrt((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 t_0 = 0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0));
double tmp;
if (h <= -9e+95) {
tmp = Math.sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (Math.pow((M_m * (0.5 * (D_m / d))), 2.0) / l))));
} else if (h <= -5e-311) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
} else {
tmp = (1.0 - t_0) * (d / Math.sqrt((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): t_0 = 0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)) tmp = 0 if h <= -9e+95: tmp = math.sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (math.pow((M_m * (0.5 * (D_m / d))), 2.0) / l)))) elif h <= -5e-311: tmp = (d * math.sqrt((1.0 / (h * l)))) * (t_0 + -1.0) else: tmp = (1.0 - t_0) * (d / math.sqrt((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) t_0 = Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0))) tmp = 0.0 if (h <= -9e+95) tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * Float64(1.0 + Float64(-0.5 * Float64(h * Float64((Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0) / l))))); elseif (h <= -5e-311) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(t_0 + -1.0)); else tmp = Float64(Float64(1.0 - t_0) * Float64(d / sqrt(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)
t_0 = 0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0));
tmp = 0.0;
if (h <= -9e+95)
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (((M_m * (0.5 * (D_m / d))) ^ 2.0) / l))));
elseif (h <= -5e-311)
tmp = (d * sqrt((1.0 / (h * l)))) * (t_0 + -1.0);
else
tmp = (1.0 - t_0) * (d / sqrt((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_] := Block[{t$95$0 = N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -9e+95], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(h * N[(N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -5e-311], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - t$95$0), $MachinePrecision] * N[(d / N[Sqrt[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}
t_0 := 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\\
\mathbf{if}\;h \leq -9 \cdot 10^{+95}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot \left(1 + -0.5 \cdot \left(h \cdot \frac{{\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}}{\ell}\right)\right)\\
\mathbf{elif}\;h \leq -5 \cdot 10^{-311}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(t\_0 + -1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - t\_0\right) \cdot \frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if h < -9.00000000000000033e95Initial program 71.2%
Simplified71.2%
expm1-log1p-u71.0%
expm1-undefine71.0%
*-commutative71.0%
*-commutative71.0%
div-inv71.0%
metadata-eval71.0%
Applied egg-rr71.0%
expm1-define71.0%
associate-*l/71.0%
associate-/l*73.3%
Simplified73.3%
pow173.3%
Applied egg-rr61.1%
unpow161.1%
*-commutative61.1%
associate-*r/63.6%
associate-*l*63.6%
Simplified63.6%
if -9.00000000000000033e95 < h < -5.00000000000023e-311Initial program 70.5%
Simplified69.5%
frac-2neg70.6%
sqrt-div80.6%
Applied egg-rr78.6%
Taylor expanded in d around -inf 78.5%
if -5.00000000000023e-311 < h Initial program 59.4%
Simplified58.6%
*-commutative62.2%
sqrt-div65.4%
sqrt-div82.4%
frac-times82.4%
add-sqr-sqrt82.5%
Applied egg-rr77.2%
Taylor expanded in l around 0 73.2%
Final simplification73.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 -9e+130)
(* d (- (sqrt (/ 1.0 (* h l)))))
(if (<= l 2.1e-265)
(*
(sqrt (* (/ d l) (/ d h)))
(+ 1.0 (* -0.5 (* h (/ (pow (* M_m (* 0.5 (/ D_m d))) 2.0) l)))))
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))))
(/ 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) {
double tmp;
if (l <= -9e+130) {
tmp = d * -sqrt((1.0 / (h * l)));
} else if (l <= 2.1e-265) {
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (pow((M_m * (0.5 * (D_m / d))), 2.0) / l))));
} else {
tmp = (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d / sqrt((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 <= (-9d+130)) then
tmp = d * -sqrt((1.0d0 / (h * l)))
else if (l <= 2.1d-265) then
tmp = sqrt(((d / l) * (d / h))) * (1.0d0 + ((-0.5d0) * (h * (((m_m * (0.5d0 * (d_m / d))) ** 2.0d0) / l))))
else
tmp = (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0)))) * (d / sqrt((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 <= -9e+130) {
tmp = d * -Math.sqrt((1.0 / (h * l)));
} else if (l <= 2.1e-265) {
tmp = Math.sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (Math.pow((M_m * (0.5 * (D_m / d))), 2.0) / l))));
} else {
tmp = (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d / Math.sqrt((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 <= -9e+130: tmp = d * -math.sqrt((1.0 / (h * l))) elif l <= 2.1e-265: tmp = math.sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (math.pow((M_m * (0.5 * (D_m / d))), 2.0) / l)))) else: tmp = (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d / math.sqrt((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 <= -9e+130) tmp = Float64(d * Float64(-sqrt(Float64(1.0 / Float64(h * l))))); elseif (l <= 2.1e-265) tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * Float64(1.0 + Float64(-0.5 * Float64(h * Float64((Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0) / l))))); else tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0)))) * Float64(d / sqrt(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 <= -9e+130)
tmp = d * -sqrt((1.0 / (h * l)));
elseif (l <= 2.1e-265)
tmp = sqrt(((d / l) * (d / h))) * (1.0 + (-0.5 * (h * (((M_m * (0.5 * (D_m / d))) ^ 2.0) / l))));
else
tmp = (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0)))) * (d / sqrt((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, -9e+130], N[(d * (-N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 2.1e-265], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(h * N[(N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[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 -9 \cdot 10^{+130}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{1}{h \cdot \ell}}\right)\\
\mathbf{elif}\;\ell \leq 2.1 \cdot 10^{-265}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot \left(1 + -0.5 \cdot \left(h \cdot \frac{{\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}}{\ell}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right) \cdot \frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < -9.00000000000000078e130Initial program 56.1%
Simplified56.1%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt62.2%
neg-mul-162.2%
Simplified62.2%
if -9.00000000000000078e130 < l < 2.10000000000000004e-265Initial program 74.9%
Simplified74.0%
expm1-log1p-u73.7%
expm1-undefine73.7%
*-commutative73.7%
*-commutative73.7%
div-inv73.7%
metadata-eval73.7%
Applied egg-rr73.7%
expm1-define73.7%
associate-*l/79.7%
associate-/l*79.7%
Simplified79.7%
pow179.7%
Applied egg-rr73.6%
unpow173.6%
*-commutative73.6%
associate-*r/73.6%
associate-*l*73.6%
Simplified73.6%
if 2.10000000000000004e-265 < l Initial program 59.3%
Simplified58.4%
*-commutative60.4%
sqrt-div63.2%
sqrt-div80.8%
frac-times80.8%
add-sqr-sqrt80.9%
Applied egg-rr77.9%
Taylor expanded in l around 0 73.5%
Final simplification71.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 -1.25e+131)
(* d (- (sqrt (/ 1.0 (* h l)))))
(if (<= l 7.2e-266)
(*
(+ 1.0 (* h (/ (* -0.125 (pow (* D_m (/ M_m d)) 2.0)) l)))
(sqrt (* (/ d l) (/ d h))))
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))))
(/ 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) {
double tmp;
if (l <= -1.25e+131) {
tmp = d * -sqrt((1.0 / (h * l)));
} else if (l <= 7.2e-266) {
tmp = (1.0 + (h * ((-0.125 * pow((D_m * (M_m / d)), 2.0)) / l))) * sqrt(((d / l) * (d / h)));
} else {
tmp = (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d / sqrt((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 <= (-1.25d+131)) then
tmp = d * -sqrt((1.0d0 / (h * l)))
else if (l <= 7.2d-266) then
tmp = (1.0d0 + (h * (((-0.125d0) * ((d_m * (m_m / d)) ** 2.0d0)) / l))) * sqrt(((d / l) * (d / h)))
else
tmp = (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0)))) * (d / sqrt((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 <= -1.25e+131) {
tmp = d * -Math.sqrt((1.0 / (h * l)));
} else if (l <= 7.2e-266) {
tmp = (1.0 + (h * ((-0.125 * Math.pow((D_m * (M_m / d)), 2.0)) / l))) * Math.sqrt(((d / l) * (d / h)));
} else {
tmp = (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d / Math.sqrt((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 <= -1.25e+131: tmp = d * -math.sqrt((1.0 / (h * l))) elif l <= 7.2e-266: tmp = (1.0 + (h * ((-0.125 * math.pow((D_m * (M_m / d)), 2.0)) / l))) * math.sqrt(((d / l) * (d / h))) else: tmp = (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d / math.sqrt((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 <= -1.25e+131) tmp = Float64(d * Float64(-sqrt(Float64(1.0 / Float64(h * l))))); elseif (l <= 7.2e-266) tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(D_m * Float64(M_m / d)) ^ 2.0)) / l))) * sqrt(Float64(Float64(d / l) * Float64(d / h)))); else tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0)))) * Float64(d / sqrt(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 <= -1.25e+131)
tmp = d * -sqrt((1.0 / (h * l)));
elseif (l <= 7.2e-266)
tmp = (1.0 + (h * ((-0.125 * ((D_m * (M_m / d)) ^ 2.0)) / l))) * sqrt(((d / l) * (d / h)));
else
tmp = (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0)))) * (d / sqrt((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, -1.25e+131], N[(d * (-N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 7.2e-266], N[(N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[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 -1.25 \cdot 10^{+131}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{1}{h \cdot \ell}}\right)\\
\mathbf{elif}\;\ell \leq 7.2 \cdot 10^{-266}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.125 \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right) \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right) \cdot \frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < -1.24999999999999999e131Initial program 56.1%
Simplified56.1%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt62.2%
neg-mul-162.2%
Simplified62.2%
if -1.24999999999999999e131 < l < 7.1999999999999999e-266Initial program 74.9%
Simplified74.0%
add-sqr-sqrt74.0%
pow274.0%
sqrt-prod74.0%
sqrt-pow174.0%
metadata-eval74.0%
pow174.0%
*-commutative74.0%
div-inv74.0%
metadata-eval74.0%
Applied egg-rr74.0%
Taylor expanded in h around inf 51.7%
sub-neg51.7%
distribute-lft-in51.7%
rgt-mult-inverse51.8%
distribute-lft-neg-in51.8%
metadata-eval51.8%
associate-/r*54.4%
associate-*r/54.4%
Simplified79.3%
*-commutative79.3%
sqrt-unprod72.9%
Applied egg-rr72.9%
if 7.1999999999999999e-266 < l Initial program 59.3%
Simplified58.4%
*-commutative60.4%
sqrt-div63.2%
sqrt-div80.8%
frac-times80.8%
add-sqr-sqrt80.9%
Applied egg-rr77.9%
Taylor expanded in l around 0 73.5%
Final simplification71.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 -8.8e+130)
(* d (- (sqrt (/ 1.0 (* h l)))))
(if (<= l 3.4e+99)
(*
(+ 1.0 (* h (/ (* -0.125 (pow (* D_m (/ M_m d)) 2.0)) l)))
(sqrt (* (/ d l) (/ d h))))
(/ d (* (sqrt l) (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 tmp;
if (l <= -8.8e+130) {
tmp = d * -sqrt((1.0 / (h * l)));
} else if (l <= 3.4e+99) {
tmp = (1.0 + (h * ((-0.125 * pow((D_m * (M_m / d)), 2.0)) / l))) * sqrt(((d / l) * (d / h)));
} else {
tmp = d / (sqrt(l) * 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) :: tmp
if (l <= (-8.8d+130)) then
tmp = d * -sqrt((1.0d0 / (h * l)))
else if (l <= 3.4d+99) then
tmp = (1.0d0 + (h * (((-0.125d0) * ((d_m * (m_m / d)) ** 2.0d0)) / l))) * sqrt(((d / l) * (d / h)))
else
tmp = d / (sqrt(l) * 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 tmp;
if (l <= -8.8e+130) {
tmp = d * -Math.sqrt((1.0 / (h * l)));
} else if (l <= 3.4e+99) {
tmp = (1.0 + (h * ((-0.125 * Math.pow((D_m * (M_m / d)), 2.0)) / l))) * Math.sqrt(((d / l) * (d / h)));
} else {
tmp = d / (Math.sqrt(l) * 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): tmp = 0 if l <= -8.8e+130: tmp = d * -math.sqrt((1.0 / (h * l))) elif l <= 3.4e+99: tmp = (1.0 + (h * ((-0.125 * math.pow((D_m * (M_m / d)), 2.0)) / l))) * math.sqrt(((d / l) * (d / h))) else: tmp = d / (math.sqrt(l) * 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) tmp = 0.0 if (l <= -8.8e+130) tmp = Float64(d * Float64(-sqrt(Float64(1.0 / Float64(h * l))))); elseif (l <= 3.4e+99) tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.125 * (Float64(D_m * Float64(M_m / d)) ^ 2.0)) / l))) * sqrt(Float64(Float64(d / l) * Float64(d / h)))); else tmp = Float64(d / Float64(sqrt(l) * 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)
tmp = 0.0;
if (l <= -8.8e+130)
tmp = d * -sqrt((1.0 / (h * l)));
elseif (l <= 3.4e+99)
tmp = (1.0 + (h * ((-0.125 * ((D_m * (M_m / d)) ^ 2.0)) / l))) * sqrt(((d / l) * (d / h)));
else
tmp = d / (sqrt(l) * 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_] := If[LessEqual[l, -8.8e+130], N[(d * (-N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 3.4e+99], N[(N[(1.0 + N[(h * N[(N[(-0.125 * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_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 -8.8 \cdot 10^{+130}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{1}{h \cdot \ell}}\right)\\
\mathbf{elif}\;\ell \leq 3.4 \cdot 10^{+99}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.125 \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right) \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -8.79999999999999974e130Initial program 56.1%
Simplified56.1%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt62.2%
neg-mul-162.2%
Simplified62.2%
if -8.79999999999999974e130 < l < 3.39999999999999984e99Initial program 75.5%
Simplified74.4%
add-sqr-sqrt74.4%
pow274.4%
sqrt-prod74.4%
sqrt-pow174.4%
metadata-eval74.4%
pow174.4%
*-commutative74.4%
div-inv74.4%
metadata-eval74.4%
Applied egg-rr74.4%
Taylor expanded in h around inf 53.6%
sub-neg53.6%
distribute-lft-in53.6%
rgt-mult-inverse53.6%
distribute-lft-neg-in53.6%
metadata-eval53.6%
associate-/r*55.8%
associate-*r/55.8%
Simplified78.8%
*-commutative78.8%
sqrt-unprod73.2%
Applied egg-rr73.2%
if 3.39999999999999984e99 < l Initial program 32.5%
Simplified32.4%
Taylor expanded in d around inf 46.0%
sqrt-div46.0%
metadata-eval46.0%
*-commutative46.0%
sqrt-unprod48.3%
div-inv48.3%
associate-/r*48.5%
Applied egg-rr48.5%
associate-/l/48.3%
Simplified48.3%
Final simplification67.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 (<= D_m 1.45e+141)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(*
(sqrt (* (/ d l) (/ d h)))
(* -0.125 (* (/ h l) (pow (* (/ D_m d) M_m) 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 tmp;
if (D_m <= 1.45e+141) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else {
tmp = sqrt(((d / l) * (d / h))) * (-0.125 * ((h / l) * pow(((D_m / d) * M_m), 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) :: tmp
if (d_m <= 1.45d+141) then
tmp = sqrt((d / l)) * sqrt((d / h))
else
tmp = sqrt(((d / l) * (d / h))) * ((-0.125d0) * ((h / l) * (((d_m / d) * m_m) ** 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 tmp;
if (D_m <= 1.45e+141) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else {
tmp = Math.sqrt(((d / l) * (d / h))) * (-0.125 * ((h / l) * Math.pow(((D_m / d) * M_m), 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): tmp = 0 if D_m <= 1.45e+141: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) else: tmp = math.sqrt(((d / l) * (d / h))) * (-0.125 * ((h / l) * math.pow(((D_m / d) * M_m), 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) tmp = 0.0 if (D_m <= 1.45e+141) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); else tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * Float64(-0.125 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * M_m) ^ 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)
tmp = 0.0;
if (D_m <= 1.45e+141)
tmp = sqrt((d / l)) * sqrt((d / h));
else
tmp = sqrt(((d / l) * (d / h))) * (-0.125 * ((h / l) * (((D_m / d) * M_m) ^ 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_] := If[LessEqual[D$95$m, 1.45e+141], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-0.125 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision], 2.0], $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}\;D\_m \leq 1.45 \cdot 10^{+141}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot \left(-0.125 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot M\_m\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if D < 1.45000000000000003e141Initial program 65.4%
Simplified65.4%
Taylor expanded in d around inf 41.0%
if 1.45000000000000003e141 < D Initial program 65.9%
Simplified60.0%
Taylor expanded in M around inf 22.2%
associate-*r*22.2%
times-frac22.3%
*-commutative22.3%
associate-/l*22.4%
unpow222.4%
unpow222.4%
unpow222.4%
times-frac25.8%
swap-sqr38.1%
unpow238.1%
Simplified38.1%
pow138.1%
associate-*r*38.0%
sqrt-unprod37.9%
associate-*r/41.1%
Applied egg-rr41.1%
unpow141.1%
*-commutative41.1%
associate-/l*37.9%
Simplified37.9%
Final simplification40.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 (<= d 2.3e-143) (/ d (- (sqrt (* h l)))) (/ d (* (sqrt l) (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 tmp;
if (d <= 2.3e-143) {
tmp = d / -sqrt((h * l));
} else {
tmp = d / (sqrt(l) * 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) :: tmp
if (d <= 2.3d-143) then
tmp = d / -sqrt((h * l))
else
tmp = d / (sqrt(l) * 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 tmp;
if (d <= 2.3e-143) {
tmp = d / -Math.sqrt((h * l));
} else {
tmp = d / (Math.sqrt(l) * 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): tmp = 0 if d <= 2.3e-143: tmp = d / -math.sqrt((h * l)) else: tmp = d / (math.sqrt(l) * 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) tmp = 0.0 if (d <= 2.3e-143) tmp = Float64(d / Float64(-sqrt(Float64(h * l)))); else tmp = Float64(d / Float64(sqrt(l) * 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)
tmp = 0.0;
if (d <= 2.3e-143)
tmp = d / -sqrt((h * l));
else
tmp = d / (sqrt(l) * 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_] := If[LessEqual[d, 2.3e-143], N[(d / (-N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_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}\;d \leq 2.3 \cdot 10^{-143}:\\
\;\;\;\;\frac{d}{-\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if d < 2.30000000000000011e-143Initial program 64.0%
Simplified62.9%
add-sqr-sqrt62.9%
pow262.9%
sqrt-prod62.9%
sqrt-pow163.5%
metadata-eval63.5%
pow163.5%
*-commutative63.5%
div-inv63.5%
metadata-eval63.5%
Applied egg-rr63.5%
Taylor expanded in l around -inf 0.0%
remove-double-neg0.0%
distribute-lft-neg-in0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt39.9%
neg-mul-139.9%
remove-double-neg39.9%
associate-/r*39.9%
unpow1/239.9%
associate-/r*39.9%
rem-exp-log38.0%
exp-neg38.0%
exp-prod38.5%
distribute-lft-neg-out38.5%
rec-exp38.5%
exp-to-pow40.4%
unpow1/240.4%
associate-/l*40.5%
*-rgt-identity40.5%
Simplified40.5%
if 2.30000000000000011e-143 < d Initial program 68.2%
Simplified68.2%
Taylor expanded in d around inf 59.4%
sqrt-div59.5%
metadata-eval59.5%
*-commutative59.5%
sqrt-unprod62.7%
div-inv62.8%
associate-/r*61.7%
Applied egg-rr61.7%
associate-/l/62.8%
Simplified62.8%
Final simplification48.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 (* h l)))) (if (<= l -1.5e-258) (/ 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((h * l));
double tmp;
if (l <= -1.5e-258) {
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((h * l))
if (l <= (-1.5d-258)) 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((h * l));
double tmp;
if (l <= -1.5e-258) {
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((h * l)) tmp = 0 if l <= -1.5e-258: 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(h * l)) tmp = 0.0 if (l <= -1.5e-258) tmp = Float64(d / Float64(-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((h * l));
tmp = 0.0;
if (l <= -1.5e-258)
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[(h * l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -1.5e-258], 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{h \cdot \ell}\\
\mathbf{if}\;\ell \leq -1.5 \cdot 10^{-258}:\\
\;\;\;\;\frac{d}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{t\_0}\\
\end{array}
\end{array}
if l < -1.5000000000000001e-258Initial program 71.6%
Simplified70.8%
add-sqr-sqrt70.8%
pow270.8%
sqrt-prod70.8%
sqrt-pow171.7%
metadata-eval71.7%
pow171.7%
*-commutative71.7%
div-inv71.7%
metadata-eval71.7%
Applied egg-rr71.7%
Taylor expanded in l around -inf 0.0%
remove-double-neg0.0%
distribute-lft-neg-in0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.3%
neg-mul-148.3%
remove-double-neg48.3%
associate-/r*48.3%
unpow1/248.3%
associate-/r*48.3%
rem-exp-log45.8%
exp-neg45.8%
exp-prod46.5%
distribute-lft-neg-out46.5%
rec-exp46.5%
exp-to-pow48.9%
unpow1/248.9%
associate-/l*49.0%
*-rgt-identity49.0%
Simplified49.0%
if -1.5000000000000001e-258 < l Initial program 59.6%
Simplified58.9%
Taylor expanded in d around inf 46.6%
sqrt-div46.7%
metadata-eval46.7%
*-commutative46.7%
sqrt-unprod43.3%
div-inv43.4%
sqrt-unprod46.7%
*-commutative46.7%
Applied egg-rr46.7%
Final simplification47.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 (/ 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 65.5%
Simplified64.7%
Taylor expanded in d around inf 27.5%
sqrt-div26.4%
metadata-eval26.4%
*-commutative26.4%
sqrt-unprod22.2%
div-inv22.2%
sqrt-unprod26.5%
*-commutative26.5%
Applied egg-rr26.5%
herbie shell --seed 2024177
(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)))))