
(FPCore (d h l M D) :precision binary64 (* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))
double code(double d, double h, double l, double M, double D) {
return (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
real(8) function code(d, h, l, m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 20 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (d h l M D) :precision binary64 (* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))
double code(double d, double h, double l, double M, double D) {
return (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
real(8) function code(d, h, l, m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (- d))))
(if (<= l -1.8e-305)
(*
(/ t_0 (sqrt (- l)))
(*
(/ t_0 (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(if (<= l 2.6e-251)
(*
(sqrt (/ d l))
(*
(sqrt (/ d h))
(+ 1.0 (/ (* h (* -0.5 (pow (* M_m (* 0.5 (/ D_m d))) 2.0))) l))))
(*
d
(/
(fma h (* -0.5 (/ (pow (* D_m (/ (* M_m 0.5) d)) 2.0) l)) 1.0)
(* (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 (l <= -1.8e-305) {
tmp = (t_0 / sqrt(-l)) * ((t_0 / sqrt(-h)) * (1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else if (l <= 2.6e-251) {
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + ((h * (-0.5 * pow((M_m * (0.5 * (D_m / d))), 2.0))) / l)));
} else {
tmp = d * (fma(h, (-0.5 * (pow((D_m * ((M_m * 0.5) / d)), 2.0) / l)), 1.0) / (sqrt(l) * 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 (l <= -1.8e-305) tmp = Float64(Float64(t_0 / sqrt(Float64(-l))) * Float64(Float64(t_0 / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))))); elseif (l <= 2.6e-251) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(h * Float64(-0.5 * (Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0))) / l)))); else tmp = Float64(d * Float64(fma(h, Float64(-0.5 * Float64((Float64(D_m * Float64(Float64(M_m * 0.5) / d)) ^ 2.0) / l)), 1.0) / 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[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[l, -1.8e-305], N[(N[(t$95$0 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D$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[l, 2.6e-251], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h * N[(-0.5 * N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(h * N[(-0.5 * N[(N[Power[N[(D$95$m * N[(N[(M$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_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}\;\ell \leq -1.8 \cdot 10^{-305}:\\
\;\;\;\;\frac{t\_0}{\sqrt{-\ell}} \cdot \left(\frac{t\_0}{\sqrt{-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}\;\ell \leq 2.6 \cdot 10^{-251}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{h \cdot \left(-0.5 \cdot {\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}\right)}{\ell}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(h, -0.5 \cdot \frac{{\left(D\_m \cdot \frac{M\_m \cdot 0.5}{d}\right)}^{2}}{\ell}, 1\right)}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -1.80000000000000002e-305Initial program 66.6%
Simplified65.0%
frac-2neg65.0%
sqrt-div76.7%
Applied egg-rr76.7%
frac-2neg76.7%
sqrt-div84.3%
Applied egg-rr84.3%
if -1.80000000000000002e-305 < l < 2.5999999999999999e-251Initial program 93.6%
Simplified86.3%
Applied egg-rr87.7%
if 2.5999999999999999e-251 < l Initial program 61.9%
Applied egg-rr73.9%
distribute-rgt1-in78.1%
+-commutative78.1%
associate-*r/80.0%
*-commutative80.0%
associate-/l*80.0%
Simplified84.2%
Final simplification84.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
(let* ((t_0 (sqrt (/ d h))) (t_1 (sqrt (- d))))
(if (<= l -1e-130)
(*
(*
(/ t_1 (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5))))
(sqrt (/ d l)))
(if (<= l -5e-310)
(*
(/ t_1 (sqrt (- l)))
(*
t_0
(+ 1.0 (/ (* h (* -0.5 (pow (* M_m (* 0.5 (/ D_m d))) 2.0))) l))))
(if (<= l 7e-249)
(*
(* t_0 (* (sqrt d) (/ 1.0 (sqrt l))))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0)))))
(*
d
(/
(fma h (* -0.5 (/ (pow (* D_m (/ (* M_m 0.5) d)) 2.0) l)) 1.0)
(* (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 / h));
double t_1 = sqrt(-d);
double tmp;
if (l <= -1e-130) {
tmp = ((t_1 / sqrt(-h)) * (1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5)))) * sqrt((d / l));
} else if (l <= -5e-310) {
tmp = (t_1 / sqrt(-l)) * (t_0 * (1.0 + ((h * (-0.5 * pow((M_m * (0.5 * (D_m / d))), 2.0))) / l)));
} else if (l <= 7e-249) {
tmp = (t_0 * (sqrt(d) * (1.0 / sqrt(l)))) * (1.0 - (0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0))));
} else {
tmp = d * (fma(h, (-0.5 * (pow((D_m * ((M_m * 0.5) / d)), 2.0) / l)), 1.0) / (sqrt(l) * 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 / h)) t_1 = sqrt(Float64(-d)) tmp = 0.0 if (l <= -1e-130) tmp = Float64(Float64(Float64(t_1 / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5)))) * sqrt(Float64(d / l))); elseif (l <= -5e-310) tmp = Float64(Float64(t_1 / sqrt(Float64(-l))) * Float64(t_0 * Float64(1.0 + Float64(Float64(h * Float64(-0.5 * (Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0))) / l)))); elseif (l <= 7e-249) tmp = Float64(Float64(t_0 * Float64(sqrt(d) * Float64(1.0 / sqrt(l)))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0))))); else tmp = Float64(d * Float64(fma(h, Float64(-0.5 * Float64((Float64(D_m * Float64(Float64(M_m * 0.5) / d)) ^ 2.0) / l)), 1.0) / 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[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[l, -1e-130], N[(N[(N[(t$95$1 / N[Sqrt[(-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] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(t$95$1 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(1.0 + N[(N[(h * N[(-0.5 * N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 7e-249], N[(N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] * N[(1.0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(h * N[(-0.5 * N[(N[Power[N[(D$95$m * N[(N[(M$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_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}{h}}\\
t_1 := \sqrt{-d}\\
\mathbf{if}\;\ell \leq -1 \cdot 10^{-130}:\\
\;\;\;\;\left(\frac{t\_1}{\sqrt{-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) \cdot \sqrt{\frac{d}{\ell}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{t\_1}{\sqrt{-\ell}} \cdot \left(t\_0 \cdot \left(1 + \frac{h \cdot \left(-0.5 \cdot {\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}\right)}{\ell}\right)\right)\\
\mathbf{elif}\;\ell \leq 7 \cdot 10^{-249}:\\
\;\;\;\;\left(t\_0 \cdot \left(\sqrt{d} \cdot \frac{1}{\sqrt{\ell}}\right)\right) \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(h, -0.5 \cdot \frac{{\left(D\_m \cdot \frac{M\_m \cdot 0.5}{d}\right)}^{2}}{\ell}, 1\right)}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -1.0000000000000001e-130Initial program 60.1%
Simplified58.8%
frac-2neg58.8%
sqrt-div76.3%
Applied egg-rr76.3%
if -1.0000000000000001e-130 < l < -4.999999999999985e-310Initial program 76.7%
Simplified74.8%
Applied egg-rr80.9%
frac-2neg76.8%
sqrt-div85.7%
Applied egg-rr93.7%
if -4.999999999999985e-310 < l < 7.00000000000000025e-249Initial program 87.5%
Simplified80.9%
sqrt-div86.8%
div-inv87.0%
Applied egg-rr87.0%
if 7.00000000000000025e-249 < l Initial program 62.8%
Applied egg-rr74.2%
distribute-rgt1-in78.5%
+-commutative78.5%
associate-*r/80.5%
*-commutative80.5%
associate-/l*80.4%
Simplified84.7%
Final simplification84.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 (pow (* l h) -0.25)) (t_1 (sqrt (/ d l))) (t_2 (sqrt (/ d h))))
(if (<= d -1.55e+226)
(*
t_1
(* t_2 (+ 1.0 (/ (* h (* -0.5 (pow (* M_m (* 0.5 (/ D_m d))) 2.0))) l))))
(if (<= d -1.05e+143)
(* d (- (* t_0 t_0)))
(if (<= d -4.8e-202)
(*
t_1
(*
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5)))
t_2))
(if (<= d -2e-310)
(*
(sqrt (/ h (pow l 3.0)))
(* -0.125 (* (pow D_m 2.0) (/ (pow M_m 2.0) (- d)))))
(if (<= d 2.25e-218)
(*
(pow (* D_m (/ M_m (sqrt d))) 2.0)
(* -0.125 (/ (sqrt h) (pow l 1.5))))
(*
(+ 1.0 (* (* (/ h l) -0.5) (pow (/ (* 0.5 (* D_m M_m)) d) 2.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 = pow((l * h), -0.25);
double t_1 = sqrt((d / l));
double t_2 = sqrt((d / h));
double tmp;
if (d <= -1.55e+226) {
tmp = t_1 * (t_2 * (1.0 + ((h * (-0.5 * pow((M_m * (0.5 * (D_m / d))), 2.0))) / l)));
} else if (d <= -1.05e+143) {
tmp = d * -(t_0 * t_0);
} else if (d <= -4.8e-202) {
tmp = t_1 * ((1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))) * t_2);
} else if (d <= -2e-310) {
tmp = sqrt((h / pow(l, 3.0))) * (-0.125 * (pow(D_m, 2.0) * (pow(M_m, 2.0) / -d)));
} else if (d <= 2.25e-218) {
tmp = pow((D_m * (M_m / sqrt(d))), 2.0) * (-0.125 * (sqrt(h) / pow(l, 1.5)));
} else {
tmp = (1.0 + (((h / l) * -0.5) * pow(((0.5 * (D_m * M_m)) / d), 2.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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = (l * h) ** (-0.25d0)
t_1 = sqrt((d / l))
t_2 = sqrt((d / h))
if (d <= (-1.55d+226)) then
tmp = t_1 * (t_2 * (1.0d0 + ((h * ((-0.5d0) * ((m_m * (0.5d0 * (d_m / d))) ** 2.0d0))) / l)))
else if (d <= (-1.05d+143)) then
tmp = d * -(t_0 * t_0)
else if (d <= (-4.8d-202)) then
tmp = t_1 * ((1.0d0 + ((h / l) * (((d_m * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))) * t_2)
else if (d <= (-2d-310)) then
tmp = sqrt((h / (l ** 3.0d0))) * ((-0.125d0) * ((d_m ** 2.0d0) * ((m_m ** 2.0d0) / -d)))
else if (d <= 2.25d-218) then
tmp = ((d_m * (m_m / sqrt(d))) ** 2.0d0) * ((-0.125d0) * (sqrt(h) / (l ** 1.5d0)))
else
tmp = (1.0d0 + (((h / l) * (-0.5d0)) * (((0.5d0 * (d_m * m_m)) / d) ** 2.0d0))) * (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.pow((l * h), -0.25);
double t_1 = Math.sqrt((d / l));
double t_2 = Math.sqrt((d / h));
double tmp;
if (d <= -1.55e+226) {
tmp = t_1 * (t_2 * (1.0 + ((h * (-0.5 * Math.pow((M_m * (0.5 * (D_m / d))), 2.0))) / l)));
} else if (d <= -1.05e+143) {
tmp = d * -(t_0 * t_0);
} else if (d <= -4.8e-202) {
tmp = t_1 * ((1.0 + ((h / l) * (Math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))) * t_2);
} else if (d <= -2e-310) {
tmp = Math.sqrt((h / Math.pow(l, 3.0))) * (-0.125 * (Math.pow(D_m, 2.0) * (Math.pow(M_m, 2.0) / -d)));
} else if (d <= 2.25e-218) {
tmp = Math.pow((D_m * (M_m / Math.sqrt(d))), 2.0) * (-0.125 * (Math.sqrt(h) / Math.pow(l, 1.5)));
} else {
tmp = (1.0 + (((h / l) * -0.5) * Math.pow(((0.5 * (D_m * M_m)) / d), 2.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 = math.pow((l * h), -0.25) t_1 = math.sqrt((d / l)) t_2 = math.sqrt((d / h)) tmp = 0 if d <= -1.55e+226: tmp = t_1 * (t_2 * (1.0 + ((h * (-0.5 * math.pow((M_m * (0.5 * (D_m / d))), 2.0))) / l))) elif d <= -1.05e+143: tmp = d * -(t_0 * t_0) elif d <= -4.8e-202: tmp = t_1 * ((1.0 + ((h / l) * (math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))) * t_2) elif d <= -2e-310: tmp = math.sqrt((h / math.pow(l, 3.0))) * (-0.125 * (math.pow(D_m, 2.0) * (math.pow(M_m, 2.0) / -d))) elif d <= 2.25e-218: tmp = math.pow((D_m * (M_m / math.sqrt(d))), 2.0) * (-0.125 * (math.sqrt(h) / math.pow(l, 1.5))) else: tmp = (1.0 + (((h / l) * -0.5) * math.pow(((0.5 * (D_m * M_m)) / d), 2.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(l * h) ^ -0.25 t_1 = sqrt(Float64(d / l)) t_2 = sqrt(Float64(d / h)) tmp = 0.0 if (d <= -1.55e+226) tmp = Float64(t_1 * Float64(t_2 * Float64(1.0 + Float64(Float64(h * Float64(-0.5 * (Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0))) / l)))); elseif (d <= -1.05e+143) tmp = Float64(d * Float64(-Float64(t_0 * t_0))); elseif (d <= -4.8e-202) tmp = Float64(t_1 * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))) * t_2)); elseif (d <= -2e-310) tmp = Float64(sqrt(Float64(h / (l ^ 3.0))) * Float64(-0.125 * Float64((D_m ^ 2.0) * Float64((M_m ^ 2.0) / Float64(-d))))); elseif (d <= 2.25e-218) tmp = Float64((Float64(D_m * Float64(M_m / sqrt(d))) ^ 2.0) * Float64(-0.125 * Float64(sqrt(h) / (l ^ 1.5)))); else tmp = Float64(Float64(1.0 + Float64(Float64(Float64(h / l) * -0.5) * (Float64(Float64(0.5 * Float64(D_m * M_m)) / d) ^ 2.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 = (l * h) ^ -0.25;
t_1 = sqrt((d / l));
t_2 = sqrt((d / h));
tmp = 0.0;
if (d <= -1.55e+226)
tmp = t_1 * (t_2 * (1.0 + ((h * (-0.5 * ((M_m * (0.5 * (D_m / d))) ^ 2.0))) / l)));
elseif (d <= -1.05e+143)
tmp = d * -(t_0 * t_0);
elseif (d <= -4.8e-202)
tmp = t_1 * ((1.0 + ((h / l) * (((D_m * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))) * t_2);
elseif (d <= -2e-310)
tmp = sqrt((h / (l ^ 3.0))) * (-0.125 * ((D_m ^ 2.0) * ((M_m ^ 2.0) / -d)));
elseif (d <= 2.25e-218)
tmp = ((D_m * (M_m / sqrt(d))) ^ 2.0) * (-0.125 * (sqrt(h) / (l ^ 1.5)));
else
tmp = (1.0 + (((h / l) * -0.5) * (((0.5 * (D_m * M_m)) / d) ^ 2.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[Power[N[(l * h), $MachinePrecision], -0.25], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -1.55e+226], N[(t$95$1 * N[(t$95$2 * N[(1.0 + N[(N[(h * N[(-0.5 * N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -1.05e+143], N[(d * (-N[(t$95$0 * t$95$0), $MachinePrecision])), $MachinePrecision], If[LessEqual[d, -4.8e-202], N[(t$95$1 * N[(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] * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -2e-310], N[(N[Sqrt[N[(h / N[Power[l, 3.0], $MachinePrecision]), $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], If[LessEqual[d, 2.25e-218], N[(N[Power[N[(D$95$m * N[(M$95$m / N[Sqrt[d], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.125 * N[(N[Sqrt[h], $MachinePrecision] / N[Power[l, 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(N[(0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], 2.0], $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 := {\left(\ell \cdot h\right)}^{-0.25}\\
t_1 := \sqrt{\frac{d}{\ell}}\\
t_2 := \sqrt{\frac{d}{h}}\\
\mathbf{if}\;d \leq -1.55 \cdot 10^{+226}:\\
\;\;\;\;t\_1 \cdot \left(t\_2 \cdot \left(1 + \frac{h \cdot \left(-0.5 \cdot {\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}\right)}{\ell}\right)\right)\\
\mathbf{elif}\;d \leq -1.05 \cdot 10^{+143}:\\
\;\;\;\;d \cdot \left(-t\_0 \cdot t\_0\right)\\
\mathbf{elif}\;d \leq -4.8 \cdot 10^{-202}:\\
\;\;\;\;t\_1 \cdot \left(\left(1 + \frac{h}{\ell} \cdot \left({\left(D\_m \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right) \cdot t\_2\right)\\
\mathbf{elif}\;d \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{h}{{\ell}^{3}}} \cdot \left(-0.125 \cdot \left({D\_m}^{2} \cdot \frac{{M\_m}^{2}}{-d}\right)\right)\\
\mathbf{elif}\;d \leq 2.25 \cdot 10^{-218}:\\
\;\;\;\;{\left(D\_m \cdot \frac{M\_m}{\sqrt{d}}\right)}^{2} \cdot \left(-0.125 \cdot \frac{\sqrt{h}}{{\ell}^{1.5}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \left(\frac{h}{\ell} \cdot -0.5\right) \cdot {\left(\frac{0.5 \cdot \left(D\_m \cdot M\_m\right)}{d}\right)}^{2}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if d < -1.54999999999999988e226Initial program 84.5%
Simplified84.5%
Applied egg-rr84.5%
if -1.54999999999999988e226 < d < -1.04999999999999994e143Initial program 50.0%
Taylor expanded in d around inf 0.6%
*-commutative0.6%
Simplified0.6%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt85.4%
unpow-185.4%
metadata-eval85.4%
pow-sqr85.3%
rem-sqrt-square90.1%
rem-square-sqrt90.0%
fabs-sqr90.0%
rem-square-sqrt90.1%
mul-1-neg90.1%
Simplified90.1%
sqr-pow0.6%
metadata-eval0.6%
metadata-eval0.6%
Applied egg-rr90.3%
if -1.04999999999999994e143 < d < -4.8000000000000002e-202Initial program 78.6%
Simplified75.7%
if -4.8000000000000002e-202 < d < -1.999999999999994e-310Initial program 32.2%
Taylor expanded in h around -inf 0.0%
associate-*r*0.0%
*-commutative0.0%
associate-/l*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt49.6%
mul-1-neg49.6%
Simplified49.6%
if -1.999999999999994e-310 < d < 2.24999999999999988e-218Initial program 30.8%
Taylor expanded in d around 0 46.0%
associate-*r*46.0%
*-commutative46.0%
associate-/l*46.0%
Simplified46.0%
add-sqr-sqrt6.0%
pow26.0%
Applied egg-rr0.4%
unpow20.4%
*-commutative0.4%
*-commutative0.4%
swap-sqr0.3%
unpow20.3%
rem-square-sqrt80.1%
*-commutative80.1%
Simplified80.1%
if 2.24999999999999988e-218 < d Initial program 71.9%
Applied egg-rr77.4%
distribute-rgt1-in83.7%
+-commutative83.7%
associate-*r*83.7%
associate-*r*83.7%
associate-/l*83.8%
*-commutative83.8%
associate-/l*83.6%
*-commutative83.6%
associate-*r/83.6%
Simplified83.6%
Taylor expanded in D around 0 83.8%
associate-*r/83.8%
Simplified83.8%
Final simplification78.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (pow (* l h) -0.25)) (t_1 (sqrt (/ d l))) (t_2 (sqrt (/ d h))))
(if (<= d -6.2e+225)
(*
t_1
(* t_2 (+ 1.0 (/ (* h (* -0.5 (pow (* M_m (* 0.5 (/ D_m d))) 2.0))) l))))
(if (<= d -3.2e+141)
(* d (- (* t_0 t_0)))
(if (<= d -6.5e-205)
(*
t_1
(*
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5)))
t_2))
(if (<= d -2e-310)
(*
-0.125
(*
(pow D_m 2.0)
(* (* (pow M_m 2.0) (/ -1.0 d)) (sqrt (/ h (pow l 3.0))))))
(if (<= d 6e-219)
(*
(pow (* D_m (/ M_m (sqrt d))) 2.0)
(* -0.125 (/ (sqrt h) (pow l 1.5))))
(*
(+ 1.0 (* (* (/ h l) -0.5) (pow (/ (* 0.5 (* D_m M_m)) d) 2.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 = pow((l * h), -0.25);
double t_1 = sqrt((d / l));
double t_2 = sqrt((d / h));
double tmp;
if (d <= -6.2e+225) {
tmp = t_1 * (t_2 * (1.0 + ((h * (-0.5 * pow((M_m * (0.5 * (D_m / d))), 2.0))) / l)));
} else if (d <= -3.2e+141) {
tmp = d * -(t_0 * t_0);
} else if (d <= -6.5e-205) {
tmp = t_1 * ((1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))) * t_2);
} else if (d <= -2e-310) {
tmp = -0.125 * (pow(D_m, 2.0) * ((pow(M_m, 2.0) * (-1.0 / d)) * sqrt((h / pow(l, 3.0)))));
} else if (d <= 6e-219) {
tmp = pow((D_m * (M_m / sqrt(d))), 2.0) * (-0.125 * (sqrt(h) / pow(l, 1.5)));
} else {
tmp = (1.0 + (((h / l) * -0.5) * pow(((0.5 * (D_m * M_m)) / d), 2.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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = (l * h) ** (-0.25d0)
t_1 = sqrt((d / l))
t_2 = sqrt((d / h))
if (d <= (-6.2d+225)) then
tmp = t_1 * (t_2 * (1.0d0 + ((h * ((-0.5d0) * ((m_m * (0.5d0 * (d_m / d))) ** 2.0d0))) / l)))
else if (d <= (-3.2d+141)) then
tmp = d * -(t_0 * t_0)
else if (d <= (-6.5d-205)) then
tmp = t_1 * ((1.0d0 + ((h / l) * (((d_m * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))) * t_2)
else if (d <= (-2d-310)) then
tmp = (-0.125d0) * ((d_m ** 2.0d0) * (((m_m ** 2.0d0) * ((-1.0d0) / d)) * sqrt((h / (l ** 3.0d0)))))
else if (d <= 6d-219) then
tmp = ((d_m * (m_m / sqrt(d))) ** 2.0d0) * ((-0.125d0) * (sqrt(h) / (l ** 1.5d0)))
else
tmp = (1.0d0 + (((h / l) * (-0.5d0)) * (((0.5d0 * (d_m * m_m)) / d) ** 2.0d0))) * (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.pow((l * h), -0.25);
double t_1 = Math.sqrt((d / l));
double t_2 = Math.sqrt((d / h));
double tmp;
if (d <= -6.2e+225) {
tmp = t_1 * (t_2 * (1.0 + ((h * (-0.5 * Math.pow((M_m * (0.5 * (D_m / d))), 2.0))) / l)));
} else if (d <= -3.2e+141) {
tmp = d * -(t_0 * t_0);
} else if (d <= -6.5e-205) {
tmp = t_1 * ((1.0 + ((h / l) * (Math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))) * t_2);
} else if (d <= -2e-310) {
tmp = -0.125 * (Math.pow(D_m, 2.0) * ((Math.pow(M_m, 2.0) * (-1.0 / d)) * Math.sqrt((h / Math.pow(l, 3.0)))));
} else if (d <= 6e-219) {
tmp = Math.pow((D_m * (M_m / Math.sqrt(d))), 2.0) * (-0.125 * (Math.sqrt(h) / Math.pow(l, 1.5)));
} else {
tmp = (1.0 + (((h / l) * -0.5) * Math.pow(((0.5 * (D_m * M_m)) / d), 2.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 = math.pow((l * h), -0.25) t_1 = math.sqrt((d / l)) t_2 = math.sqrt((d / h)) tmp = 0 if d <= -6.2e+225: tmp = t_1 * (t_2 * (1.0 + ((h * (-0.5 * math.pow((M_m * (0.5 * (D_m / d))), 2.0))) / l))) elif d <= -3.2e+141: tmp = d * -(t_0 * t_0) elif d <= -6.5e-205: tmp = t_1 * ((1.0 + ((h / l) * (math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))) * t_2) elif d <= -2e-310: tmp = -0.125 * (math.pow(D_m, 2.0) * ((math.pow(M_m, 2.0) * (-1.0 / d)) * math.sqrt((h / math.pow(l, 3.0))))) elif d <= 6e-219: tmp = math.pow((D_m * (M_m / math.sqrt(d))), 2.0) * (-0.125 * (math.sqrt(h) / math.pow(l, 1.5))) else: tmp = (1.0 + (((h / l) * -0.5) * math.pow(((0.5 * (D_m * M_m)) / d), 2.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(l * h) ^ -0.25 t_1 = sqrt(Float64(d / l)) t_2 = sqrt(Float64(d / h)) tmp = 0.0 if (d <= -6.2e+225) tmp = Float64(t_1 * Float64(t_2 * Float64(1.0 + Float64(Float64(h * Float64(-0.5 * (Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0))) / l)))); elseif (d <= -3.2e+141) tmp = Float64(d * Float64(-Float64(t_0 * t_0))); elseif (d <= -6.5e-205) tmp = Float64(t_1 * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))) * t_2)); elseif (d <= -2e-310) tmp = Float64(-0.125 * Float64((D_m ^ 2.0) * Float64(Float64((M_m ^ 2.0) * Float64(-1.0 / d)) * sqrt(Float64(h / (l ^ 3.0)))))); elseif (d <= 6e-219) tmp = Float64((Float64(D_m * Float64(M_m / sqrt(d))) ^ 2.0) * Float64(-0.125 * Float64(sqrt(h) / (l ^ 1.5)))); else tmp = Float64(Float64(1.0 + Float64(Float64(Float64(h / l) * -0.5) * (Float64(Float64(0.5 * Float64(D_m * M_m)) / d) ^ 2.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 = (l * h) ^ -0.25;
t_1 = sqrt((d / l));
t_2 = sqrt((d / h));
tmp = 0.0;
if (d <= -6.2e+225)
tmp = t_1 * (t_2 * (1.0 + ((h * (-0.5 * ((M_m * (0.5 * (D_m / d))) ^ 2.0))) / l)));
elseif (d <= -3.2e+141)
tmp = d * -(t_0 * t_0);
elseif (d <= -6.5e-205)
tmp = t_1 * ((1.0 + ((h / l) * (((D_m * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))) * t_2);
elseif (d <= -2e-310)
tmp = -0.125 * ((D_m ^ 2.0) * (((M_m ^ 2.0) * (-1.0 / d)) * sqrt((h / (l ^ 3.0)))));
elseif (d <= 6e-219)
tmp = ((D_m * (M_m / sqrt(d))) ^ 2.0) * (-0.125 * (sqrt(h) / (l ^ 1.5)));
else
tmp = (1.0 + (((h / l) * -0.5) * (((0.5 * (D_m * M_m)) / d) ^ 2.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[Power[N[(l * h), $MachinePrecision], -0.25], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -6.2e+225], N[(t$95$1 * N[(t$95$2 * N[(1.0 + N[(N[(h * N[(-0.5 * N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -3.2e+141], N[(d * (-N[(t$95$0 * t$95$0), $MachinePrecision])), $MachinePrecision], If[LessEqual[d, -6.5e-205], N[(t$95$1 * N[(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] * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -2e-310], N[(-0.125 * N[(N[Power[D$95$m, 2.0], $MachinePrecision] * N[(N[(N[Power[M$95$m, 2.0], $MachinePrecision] * N[(-1.0 / d), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / N[Power[l, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 6e-219], N[(N[Power[N[(D$95$m * N[(M$95$m / N[Sqrt[d], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.125 * N[(N[Sqrt[h], $MachinePrecision] / N[Power[l, 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(N[(0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], 2.0], $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 := {\left(\ell \cdot h\right)}^{-0.25}\\
t_1 := \sqrt{\frac{d}{\ell}}\\
t_2 := \sqrt{\frac{d}{h}}\\
\mathbf{if}\;d \leq -6.2 \cdot 10^{+225}:\\
\;\;\;\;t\_1 \cdot \left(t\_2 \cdot \left(1 + \frac{h \cdot \left(-0.5 \cdot {\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}\right)}{\ell}\right)\right)\\
\mathbf{elif}\;d \leq -3.2 \cdot 10^{+141}:\\
\;\;\;\;d \cdot \left(-t\_0 \cdot t\_0\right)\\
\mathbf{elif}\;d \leq -6.5 \cdot 10^{-205}:\\
\;\;\;\;t\_1 \cdot \left(\left(1 + \frac{h}{\ell} \cdot \left({\left(D\_m \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right) \cdot t\_2\right)\\
\mathbf{elif}\;d \leq -2 \cdot 10^{-310}:\\
\;\;\;\;-0.125 \cdot \left({D\_m}^{2} \cdot \left(\left({M\_m}^{2} \cdot \frac{-1}{d}\right) \cdot \sqrt{\frac{h}{{\ell}^{3}}}\right)\right)\\
\mathbf{elif}\;d \leq 6 \cdot 10^{-219}:\\
\;\;\;\;{\left(D\_m \cdot \frac{M\_m}{\sqrt{d}}\right)}^{2} \cdot \left(-0.125 \cdot \frac{\sqrt{h}}{{\ell}^{1.5}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \left(\frac{h}{\ell} \cdot -0.5\right) \cdot {\left(\frac{0.5 \cdot \left(D\_m \cdot M\_m\right)}{d}\right)}^{2}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if d < -6.1999999999999995e225Initial program 84.5%
Simplified84.5%
Applied egg-rr84.5%
if -6.1999999999999995e225 < d < -3.20000000000000019e141Initial program 50.0%
Taylor expanded in d around inf 0.6%
*-commutative0.6%
Simplified0.6%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt85.4%
unpow-185.4%
metadata-eval85.4%
pow-sqr85.3%
rem-sqrt-square90.1%
rem-square-sqrt90.0%
fabs-sqr90.0%
rem-square-sqrt90.1%
mul-1-neg90.1%
Simplified90.1%
sqr-pow0.6%
metadata-eval0.6%
metadata-eval0.6%
Applied egg-rr90.3%
if -3.20000000000000019e141 < d < -6.49999999999999956e-205Initial program 78.6%
Simplified75.7%
if -6.49999999999999956e-205 < d < -1.999999999999994e-310Initial program 32.2%
Taylor expanded in h around -inf 0.0%
associate-/l*0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt45.6%
associate-/l*45.6%
Simplified45.6%
if -1.999999999999994e-310 < d < 6.0000000000000002e-219Initial program 30.8%
Taylor expanded in d around 0 46.0%
associate-*r*46.0%
*-commutative46.0%
associate-/l*46.0%
Simplified46.0%
add-sqr-sqrt6.0%
pow26.0%
Applied egg-rr0.4%
unpow20.4%
*-commutative0.4%
*-commutative0.4%
swap-sqr0.3%
unpow20.3%
rem-square-sqrt80.1%
*-commutative80.1%
Simplified80.1%
if 6.0000000000000002e-219 < d Initial program 71.9%
Applied egg-rr77.4%
distribute-rgt1-in83.7%
+-commutative83.7%
associate-*r*83.7%
associate-*r*83.7%
associate-/l*83.8%
*-commutative83.8%
associate-/l*83.6%
*-commutative83.6%
associate-*r/83.6%
Simplified83.6%
Taylor expanded in D around 0 83.8%
associate-*r/83.8%
Simplified83.8%
Final simplification78.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 -1.8e-223)
(*
(*
(/ (sqrt (- d)) (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5))))
(sqrt (/ d l)))
(if (<= l 2.6e-251)
(*
(*
(sqrt (/ d h))
(+ 1.0 (/ (* h (* -0.5 (pow (* M_m (* 0.5 (/ D_m d))) 2.0))) l)))
(/ 1.0 (sqrt (/ l d))))
(*
d
(/
(fma h (* -0.5 (/ (pow (* D_m (/ (* M_m 0.5) d)) 2.0) l)) 1.0)
(* (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 <= -1.8e-223) {
tmp = ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5)))) * sqrt((d / l));
} else if (l <= 2.6e-251) {
tmp = (sqrt((d / h)) * (1.0 + ((h * (-0.5 * pow((M_m * (0.5 * (D_m / d))), 2.0))) / l))) * (1.0 / sqrt((l / d)));
} else {
tmp = d * (fma(h, (-0.5 * (pow((D_m * ((M_m * 0.5) / d)), 2.0) / l)), 1.0) / (sqrt(l) * 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 <= -1.8e-223) tmp = Float64(Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5)))) * sqrt(Float64(d / l))); elseif (l <= 2.6e-251) tmp = Float64(Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(h * Float64(-0.5 * (Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0))) / l))) * Float64(1.0 / sqrt(Float64(l / d)))); else tmp = Float64(d * Float64(fma(h, Float64(-0.5 * Float64((Float64(D_m * Float64(Float64(M_m * 0.5) / d)) ^ 2.0) / l)), 1.0) / 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_] := If[LessEqual[l, -1.8e-223], N[(N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D$95$m * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 2.6e-251], N[(N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h * N[(-0.5 * N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[Sqrt[N[(l / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(h * N[(-0.5 * N[(N[Power[N[(D$95$m * N[(N[(M$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_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.8 \cdot 10^{-223}:\\
\;\;\;\;\left(\frac{\sqrt{-d}}{\sqrt{-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) \cdot \sqrt{\frac{d}{\ell}}\\
\mathbf{elif}\;\ell \leq 2.6 \cdot 10^{-251}:\\
\;\;\;\;\left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{h \cdot \left(-0.5 \cdot {\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}\right)}{\ell}\right)\right) \cdot \frac{1}{\sqrt{\frac{\ell}{d}}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(h, -0.5 \cdot \frac{{\left(D\_m \cdot \frac{M\_m \cdot 0.5}{d}\right)}^{2}}{\ell}, 1\right)}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -1.8000000000000002e-223Initial program 64.5%
Simplified62.5%
frac-2neg62.5%
sqrt-div77.0%
Applied egg-rr77.0%
if -1.8000000000000002e-223 < l < 2.5999999999999999e-251Initial program 82.9%
Simplified80.0%
Applied egg-rr83.1%
clear-num83.1%
sqrt-div83.8%
metadata-eval83.8%
Applied egg-rr83.8%
if 2.5999999999999999e-251 < l Initial program 61.9%
Applied egg-rr73.9%
distribute-rgt1-in78.1%
+-commutative78.1%
associate-*r/80.0%
*-commutative80.0%
associate-/l*80.0%
Simplified84.2%
Final simplification81.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l 2.6e-251)
(*
(sqrt (/ d l))
(*
(sqrt (/ d h))
(+ 1.0 (* (/ h l) (* -0.5 (pow (/ (* D_m (* M_m 0.5)) d) 2.0))))))
(*
d
(/
(fma h (* -0.5 (/ (pow (* D_m (/ (* M_m 0.5) d)) 2.0) l)) 1.0)
(* (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 <= 2.6e-251) {
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * pow(((D_m * (M_m * 0.5)) / d), 2.0)))));
} else {
tmp = d * (fma(h, (-0.5 * (pow((D_m * ((M_m * 0.5) / d)), 2.0) / l)), 1.0) / (sqrt(l) * 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 <= 2.6e-251) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(Float64(D_m * Float64(M_m * 0.5)) / d) ^ 2.0)))))); else tmp = Float64(d * Float64(fma(h, Float64(-0.5 * Float64((Float64(D_m * Float64(Float64(M_m * 0.5) / d)) ^ 2.0) / l)), 1.0) / 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_] := If[LessEqual[l, 2.6e-251], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(N[(D$95$m * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(h * N[(-0.5 * N[(N[Power[N[(D$95$m * N[(N[(M$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_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 2.6 \cdot 10^{-251}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(\frac{D\_m \cdot \left(M\_m \cdot 0.5\right)}{d}\right)}^{2}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(h, -0.5 \cdot \frac{{\left(D\_m \cdot \frac{M\_m \cdot 0.5}{d}\right)}^{2}}{\ell}, 1\right)}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < 2.5999999999999999e-251Initial program 69.7%
Simplified67.5%
associate-*r/69.7%
div-inv69.7%
associate-*r*69.7%
*-commutative69.7%
div-inv69.7%
associate-/r*69.7%
frac-times67.6%
associate-*r/69.7%
div-inv69.7%
metadata-eval69.7%
Applied egg-rr69.7%
if 2.5999999999999999e-251 < l Initial program 61.9%
Applied egg-rr73.9%
distribute-rgt1-in78.1%
+-commutative78.1%
associate-*r/80.0%
*-commutative80.0%
associate-/l*80.0%
Simplified84.2%
Final simplification76.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 (pow (* l h) -0.5)))
(if (<= l -1.25e-169)
(* d (- t_0))
(if (<= l -5e-310)
(* d (log (exp t_0)))
(*
(/ d (* (sqrt l) (sqrt h)))
(+ 1.0 (* (* (/ h l) -0.5) (pow (* D_m (* 0.5 (/ M_m d))) 2.0))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = pow((l * h), -0.5);
double tmp;
if (l <= -1.25e-169) {
tmp = d * -t_0;
} else if (l <= -5e-310) {
tmp = d * log(exp(t_0));
} else {
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0 + (((h / l) * -0.5) * pow((D_m * (0.5 * (M_m / d))), 2.0)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = (l * h) ** (-0.5d0)
if (l <= (-1.25d-169)) then
tmp = d * -t_0
else if (l <= (-5d-310)) then
tmp = d * log(exp(t_0))
else
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0d0 + (((h / l) * (-0.5d0)) * ((d_m * (0.5d0 * (m_m / d))) ** 2.0d0)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.pow((l * h), -0.5);
double tmp;
if (l <= -1.25e-169) {
tmp = d * -t_0;
} else if (l <= -5e-310) {
tmp = d * Math.log(Math.exp(t_0));
} else {
tmp = (d / (Math.sqrt(l) * Math.sqrt(h))) * (1.0 + (((h / l) * -0.5) * Math.pow((D_m * (0.5 * (M_m / d))), 2.0)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.pow((l * h), -0.5) tmp = 0 if l <= -1.25e-169: tmp = d * -t_0 elif l <= -5e-310: tmp = d * math.log(math.exp(t_0)) else: tmp = (d / (math.sqrt(l) * math.sqrt(h))) * (1.0 + (((h / l) * -0.5) * math.pow((D_m * (0.5 * (M_m / d))), 2.0))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(l * h) ^ -0.5 tmp = 0.0 if (l <= -1.25e-169) tmp = Float64(d * Float64(-t_0)); elseif (l <= -5e-310) tmp = Float64(d * log(exp(t_0))); else tmp = Float64(Float64(d / Float64(sqrt(l) * sqrt(h))) * Float64(1.0 + Float64(Float64(Float64(h / l) * -0.5) * (Float64(D_m * Float64(0.5 * Float64(M_m / d))) ^ 2.0)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = (l * h) ^ -0.5;
tmp = 0.0;
if (l <= -1.25e-169)
tmp = d * -t_0;
elseif (l <= -5e-310)
tmp = d * log(exp(t_0));
else
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0 + (((h / l) * -0.5) * ((D_m * (0.5 * (M_m / d))) ^ 2.0)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -1.25e-169], N[(d * (-t$95$0)), $MachinePrecision], If[LessEqual[l, -5e-310], N[(d * N[Log[N[Exp[t$95$0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $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}
t_0 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -1.25 \cdot 10^{-169}:\\
\;\;\;\;d \cdot \left(-t\_0\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;d \cdot \log \left(e^{t\_0}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}} \cdot \left(1 + \left(\frac{h}{\ell} \cdot -0.5\right) \cdot {\left(D\_m \cdot \left(0.5 \cdot \frac{M\_m}{d}\right)\right)}^{2}\right)\\
\end{array}
\end{array}
if l < -1.2500000000000001e-169Initial program 61.8%
Taylor expanded in d around inf 9.8%
*-commutative9.8%
Simplified9.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.5%
unpow-148.5%
metadata-eval48.5%
pow-sqr48.5%
rem-sqrt-square49.3%
rem-square-sqrt49.1%
fabs-sqr49.1%
rem-square-sqrt49.3%
mul-1-neg49.3%
Simplified49.3%
if -1.2500000000000001e-169 < l < -4.999999999999985e-310Initial program 77.4%
Taylor expanded in d around inf 35.7%
*-commutative35.7%
Simplified35.7%
add-log-exp55.9%
inv-pow55.9%
sqrt-pow155.9%
*-commutative55.9%
metadata-eval55.9%
Applied egg-rr55.9%
if -4.999999999999985e-310 < l Initial program 65.6%
Applied egg-rr74.1%
distribute-rgt1-in79.5%
+-commutative79.5%
associate-*r*79.5%
associate-*r*79.5%
associate-/l*79.5%
*-commutative79.5%
associate-/l*79.4%
*-commutative79.4%
associate-*r/79.4%
Simplified79.4%
Final simplification65.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (pow (* l h) -0.5)))
(if (<= l -6e-168)
(* d (- t_0))
(if (<= l -5e-310)
(* d (log (exp t_0)))
(*
(+ 1.0 (* (* (/ h l) -0.5) (pow (/ (* 0.5 (* D_m M_m)) d) 2.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 = pow((l * h), -0.5);
double tmp;
if (l <= -6e-168) {
tmp = d * -t_0;
} else if (l <= -5e-310) {
tmp = d * log(exp(t_0));
} else {
tmp = (1.0 + (((h / l) * -0.5) * pow(((0.5 * (D_m * M_m)) / d), 2.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 = (l * h) ** (-0.5d0)
if (l <= (-6d-168)) then
tmp = d * -t_0
else if (l <= (-5d-310)) then
tmp = d * log(exp(t_0))
else
tmp = (1.0d0 + (((h / l) * (-0.5d0)) * (((0.5d0 * (d_m * m_m)) / d) ** 2.0d0))) * (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.pow((l * h), -0.5);
double tmp;
if (l <= -6e-168) {
tmp = d * -t_0;
} else if (l <= -5e-310) {
tmp = d * Math.log(Math.exp(t_0));
} else {
tmp = (1.0 + (((h / l) * -0.5) * Math.pow(((0.5 * (D_m * M_m)) / d), 2.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 = math.pow((l * h), -0.5) tmp = 0 if l <= -6e-168: tmp = d * -t_0 elif l <= -5e-310: tmp = d * math.log(math.exp(t_0)) else: tmp = (1.0 + (((h / l) * -0.5) * math.pow(((0.5 * (D_m * M_m)) / d), 2.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(l * h) ^ -0.5 tmp = 0.0 if (l <= -6e-168) tmp = Float64(d * Float64(-t_0)); elseif (l <= -5e-310) tmp = Float64(d * log(exp(t_0))); else tmp = Float64(Float64(1.0 + Float64(Float64(Float64(h / l) * -0.5) * (Float64(Float64(0.5 * Float64(D_m * M_m)) / d) ^ 2.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 = (l * h) ^ -0.5;
tmp = 0.0;
if (l <= -6e-168)
tmp = d * -t_0;
elseif (l <= -5e-310)
tmp = d * log(exp(t_0));
else
tmp = (1.0 + (((h / l) * -0.5) * (((0.5 * (D_m * M_m)) / d) ^ 2.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[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -6e-168], N[(d * (-t$95$0)), $MachinePrecision], If[LessEqual[l, -5e-310], N[(d * N[Log[N[Exp[t$95$0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(N[(0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], 2.0], $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 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -6 \cdot 10^{-168}:\\
\;\;\;\;d \cdot \left(-t\_0\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;d \cdot \log \left(e^{t\_0}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \left(\frac{h}{\ell} \cdot -0.5\right) \cdot {\left(\frac{0.5 \cdot \left(D\_m \cdot M\_m\right)}{d}\right)}^{2}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -5.99999999999999983e-168Initial program 61.8%
Taylor expanded in d around inf 9.8%
*-commutative9.8%
Simplified9.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.5%
unpow-148.5%
metadata-eval48.5%
pow-sqr48.5%
rem-sqrt-square49.3%
rem-square-sqrt49.1%
fabs-sqr49.1%
rem-square-sqrt49.3%
mul-1-neg49.3%
Simplified49.3%
if -5.99999999999999983e-168 < l < -4.999999999999985e-310Initial program 77.4%
Taylor expanded in d around inf 35.7%
*-commutative35.7%
Simplified35.7%
add-log-exp55.9%
inv-pow55.9%
sqrt-pow155.9%
*-commutative55.9%
metadata-eval55.9%
Applied egg-rr55.9%
if -4.999999999999985e-310 < l Initial program 65.6%
Applied egg-rr74.1%
distribute-rgt1-in79.5%
+-commutative79.5%
associate-*r*79.5%
associate-*r*79.5%
associate-/l*79.5%
*-commutative79.5%
associate-/l*79.4%
*-commutative79.4%
associate-*r/79.4%
Simplified79.4%
Taylor expanded in D around 0 79.5%
associate-*r/79.5%
Simplified79.5%
Final simplification65.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -5e-310)
(*
(sqrt (/ d l))
(*
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5)))
(sqrt (/ d h))))
(*
(+ 1.0 (* (* (/ h l) -0.5) (pow (/ (* 0.5 (* D_m M_m)) d) 2.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 tmp;
if (l <= -5e-310) {
tmp = sqrt((d / l)) * ((1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))) * sqrt((d / h)));
} else {
tmp = (1.0 + (((h / l) * -0.5) * pow(((0.5 * (D_m * M_m)) / d), 2.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) :: tmp
if (l <= (-5d-310)) then
tmp = sqrt((d / l)) * ((1.0d0 + ((h / l) * (((d_m * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))) * sqrt((d / h)))
else
tmp = (1.0d0 + (((h / l) * (-0.5d0)) * (((0.5d0 * (d_m * m_m)) / d) ** 2.0d0))) * (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 <= -5e-310) {
tmp = Math.sqrt((d / l)) * ((1.0 + ((h / l) * (Math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))) * Math.sqrt((d / h)));
} else {
tmp = (1.0 + (((h / l) * -0.5) * Math.pow(((0.5 * (D_m * M_m)) / d), 2.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): tmp = 0 if l <= -5e-310: tmp = math.sqrt((d / l)) * ((1.0 + ((h / l) * (math.pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))) * math.sqrt((d / h))) else: tmp = (1.0 + (((h / l) * -0.5) * math.pow(((0.5 * (D_m * M_m)) / d), 2.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) tmp = 0.0 if (l <= -5e-310) tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))) * sqrt(Float64(d / h)))); else tmp = Float64(Float64(1.0 + Float64(Float64(Float64(h / l) * -0.5) * (Float64(Float64(0.5 * Float64(D_m * M_m)) / d) ^ 2.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)
tmp = 0.0;
if (l <= -5e-310)
tmp = sqrt((d / l)) * ((1.0 + ((h / l) * (((D_m * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))) * sqrt((d / h)));
else
tmp = (1.0 + (((h / l) * -0.5) * (((0.5 * (D_m * M_m)) / d) ^ 2.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_] := If[LessEqual[l, -5e-310], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(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] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(N[(0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], 2.0], $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}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\left(1 + \frac{h}{\ell} \cdot \left({\left(D\_m \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right) \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \left(\frac{h}{\ell} \cdot -0.5\right) \cdot {\left(\frac{0.5 \cdot \left(D\_m \cdot M\_m\right)}{d}\right)}^{2}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -4.999999999999985e-310Initial program 66.6%
Simplified65.0%
if -4.999999999999985e-310 < l Initial program 65.6%
Applied egg-rr74.1%
distribute-rgt1-in79.5%
+-commutative79.5%
associate-*r*79.5%
associate-*r*79.5%
associate-/l*79.5%
*-commutative79.5%
associate-/l*79.4%
*-commutative79.4%
associate-*r/79.4%
Simplified79.4%
Taylor expanded in D around 0 79.5%
associate-*r/79.5%
Simplified79.5%
Final simplification72.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 2.65e-254)
(*
(sqrt (/ d l))
(*
(sqrt (/ d h))
(+ 1.0 (* (/ h l) (* -0.5 (pow (/ (* D_m (* M_m 0.5)) d) 2.0))))))
(*
(/ d (* (sqrt l) (sqrt h)))
(+ 1.0 (* (* (/ h l) -0.5) (pow (* D_m (* 0.5 (/ M_m d))) 2.0))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 2.65e-254) {
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * pow(((D_m * (M_m * 0.5)) / d), 2.0)))));
} else {
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0 + (((h / l) * -0.5) * pow((D_m * (0.5 * (M_m / d))), 2.0)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 2.65d-254) then
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0d0 + ((h / l) * ((-0.5d0) * (((d_m * (m_m * 0.5d0)) / d) ** 2.0d0)))))
else
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0d0 + (((h / l) * (-0.5d0)) * ((d_m * (0.5d0 * (m_m / d))) ** 2.0d0)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 2.65e-254) {
tmp = Math.sqrt((d / l)) * (Math.sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * Math.pow(((D_m * (M_m * 0.5)) / d), 2.0)))));
} else {
tmp = (d / (Math.sqrt(l) * Math.sqrt(h))) * (1.0 + (((h / l) * -0.5) * Math.pow((D_m * (0.5 * (M_m / d))), 2.0)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 2.65e-254: tmp = math.sqrt((d / l)) * (math.sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * math.pow(((D_m * (M_m * 0.5)) / d), 2.0))))) else: tmp = (d / (math.sqrt(l) * math.sqrt(h))) * (1.0 + (((h / l) * -0.5) * math.pow((D_m * (0.5 * (M_m / d))), 2.0))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 2.65e-254) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(Float64(D_m * Float64(M_m * 0.5)) / d) ^ 2.0)))))); else tmp = Float64(Float64(d / Float64(sqrt(l) * sqrt(h))) * Float64(1.0 + Float64(Float64(Float64(h / l) * -0.5) * (Float64(D_m * Float64(0.5 * Float64(M_m / d))) ^ 2.0)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 2.65e-254)
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * (((D_m * (M_m * 0.5)) / d) ^ 2.0)))));
else
tmp = (d / (sqrt(l) * sqrt(h))) * (1.0 + (((h / l) * -0.5) * ((D_m * (0.5 * (M_m / d))) ^ 2.0)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 2.65e-254], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(N[(D$95$m * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $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}\;\ell \leq 2.65 \cdot 10^{-254}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(\frac{D\_m \cdot \left(M\_m \cdot 0.5\right)}{d}\right)}^{2}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}} \cdot \left(1 + \left(\frac{h}{\ell} \cdot -0.5\right) \cdot {\left(D\_m \cdot \left(0.5 \cdot \frac{M\_m}{d}\right)\right)}^{2}\right)\\
\end{array}
\end{array}
if l < 2.65000000000000018e-254Initial program 69.5%
Simplified67.2%
associate-*r/69.5%
div-inv69.5%
associate-*r*69.5%
*-commutative69.5%
div-inv69.5%
associate-/r*69.5%
frac-times67.4%
associate-*r/69.5%
div-inv69.5%
metadata-eval69.5%
Applied egg-rr69.5%
if 2.65000000000000018e-254 < l Initial program 62.2%
Applied egg-rr74.1%
distribute-rgt1-in78.3%
+-commutative78.3%
associate-*r*78.3%
associate-*r*78.3%
associate-/l*77.5%
*-commutative77.5%
associate-/l*78.3%
*-commutative78.3%
associate-*r/78.3%
Simplified78.3%
Final simplification73.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 (pow (* l h) -0.5)))
(if (<= l -3.2e-172)
(* d (- t_0))
(if (<= l -5e-310)
(log1p (expm1 (* d t_0)))
(if (<= l 5.8e+165)
(*
(+ 1.0 (* (* (/ h l) -0.5) (pow (/ (* 0.5 (* D_m M_m)) d) 2.0)))
(/ d (sqrt (* l h))))
(* d (/ (sqrt (/ 1.0 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 = pow((l * h), -0.5);
double tmp;
if (l <= -3.2e-172) {
tmp = d * -t_0;
} else if (l <= -5e-310) {
tmp = log1p(expm1((d * t_0)));
} else if (l <= 5.8e+165) {
tmp = (1.0 + (((h / l) * -0.5) * pow(((0.5 * (D_m * M_m)) / d), 2.0))) * (d / sqrt((l * h)));
} else {
tmp = d * (sqrt((1.0 / 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.pow((l * h), -0.5);
double tmp;
if (l <= -3.2e-172) {
tmp = d * -t_0;
} else if (l <= -5e-310) {
tmp = Math.log1p(Math.expm1((d * t_0)));
} else if (l <= 5.8e+165) {
tmp = (1.0 + (((h / l) * -0.5) * Math.pow(((0.5 * (D_m * M_m)) / d), 2.0))) * (d / Math.sqrt((l * h)));
} else {
tmp = d * (Math.sqrt((1.0 / 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.pow((l * h), -0.5) tmp = 0 if l <= -3.2e-172: tmp = d * -t_0 elif l <= -5e-310: tmp = math.log1p(math.expm1((d * t_0))) elif l <= 5.8e+165: tmp = (1.0 + (((h / l) * -0.5) * math.pow(((0.5 * (D_m * M_m)) / d), 2.0))) * (d / math.sqrt((l * h))) else: tmp = d * (math.sqrt((1.0 / 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(l * h) ^ -0.5 tmp = 0.0 if (l <= -3.2e-172) tmp = Float64(d * Float64(-t_0)); elseif (l <= -5e-310) tmp = log1p(expm1(Float64(d * t_0))); elseif (l <= 5.8e+165) tmp = Float64(Float64(1.0 + Float64(Float64(Float64(h / l) * -0.5) * (Float64(Float64(0.5 * Float64(D_m * M_m)) / d) ^ 2.0))) * Float64(d / sqrt(Float64(l * h)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / 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[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -3.2e-172], N[(d * (-t$95$0)), $MachinePrecision], If[LessEqual[l, -5e-310], N[Log[1 + N[(Exp[N[(d * t$95$0), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 5.8e+165], N[(N[(1.0 + N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(N[(0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -3.2 \cdot 10^{-172}:\\
\;\;\;\;d \cdot \left(-t\_0\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\mathsf{log1p}\left(\mathsf{expm1}\left(d \cdot t\_0\right)\right)\\
\mathbf{elif}\;\ell \leq 5.8 \cdot 10^{+165}:\\
\;\;\;\;\left(1 + \left(\frac{h}{\ell} \cdot -0.5\right) \cdot {\left(\frac{0.5 \cdot \left(D\_m \cdot M\_m\right)}{d}\right)}^{2}\right) \cdot \frac{d}{\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -3.2000000000000001e-172Initial program 61.8%
Taylor expanded in d around inf 9.8%
*-commutative9.8%
Simplified9.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.5%
unpow-148.5%
metadata-eval48.5%
pow-sqr48.5%
rem-sqrt-square49.3%
rem-square-sqrt49.1%
fabs-sqr49.1%
rem-square-sqrt49.3%
mul-1-neg49.3%
Simplified49.3%
if -3.2000000000000001e-172 < l < -4.999999999999985e-310Initial program 77.4%
Taylor expanded in d around inf 35.7%
*-commutative35.7%
Simplified35.7%
log1p-expm1-u48.3%
inv-pow48.3%
sqrt-pow148.3%
*-commutative48.3%
metadata-eval48.3%
Applied egg-rr48.3%
if -4.999999999999985e-310 < l < 5.80000000000000011e165Initial program 68.4%
Applied egg-rr73.4%
distribute-rgt1-in80.9%
+-commutative80.9%
associate-*r*80.9%
associate-*r*80.9%
associate-/l*82.1%
*-commutative82.1%
associate-/l*80.8%
*-commutative80.8%
associate-*r/80.8%
Simplified80.8%
Taylor expanded in D around 0 82.1%
associate-*r/82.1%
Simplified82.1%
Taylor expanded in l around 0 71.9%
if 5.80000000000000011e165 < l Initial program 58.7%
Taylor expanded in d around inf 61.4%
*-commutative61.4%
Simplified61.4%
associate-/r*61.3%
sqrt-div72.6%
Applied egg-rr72.6%
Final simplification60.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 (pow (* l h) -0.5)))
(if (<= l -3.1e-171)
(* d (- t_0))
(if (<= l -5e-310)
(* d (log (exp t_0)))
(if (<= l 1.75e+165)
(*
(+ 1.0 (* (* (/ h l) -0.5) (pow (/ (* 0.5 (* D_m M_m)) d) 2.0)))
(/ d (sqrt (* l h))))
(* d (/ (sqrt (/ 1.0 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 = pow((l * h), -0.5);
double tmp;
if (l <= -3.1e-171) {
tmp = d * -t_0;
} else if (l <= -5e-310) {
tmp = d * log(exp(t_0));
} else if (l <= 1.75e+165) {
tmp = (1.0 + (((h / l) * -0.5) * pow(((0.5 * (D_m * M_m)) / d), 2.0))) * (d / sqrt((l * h)));
} else {
tmp = d * (sqrt((1.0 / 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 = (l * h) ** (-0.5d0)
if (l <= (-3.1d-171)) then
tmp = d * -t_0
else if (l <= (-5d-310)) then
tmp = d * log(exp(t_0))
else if (l <= 1.75d+165) then
tmp = (1.0d0 + (((h / l) * (-0.5d0)) * (((0.5d0 * (d_m * m_m)) / d) ** 2.0d0))) * (d / sqrt((l * h)))
else
tmp = d * (sqrt((1.0d0 / 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.pow((l * h), -0.5);
double tmp;
if (l <= -3.1e-171) {
tmp = d * -t_0;
} else if (l <= -5e-310) {
tmp = d * Math.log(Math.exp(t_0));
} else if (l <= 1.75e+165) {
tmp = (1.0 + (((h / l) * -0.5) * Math.pow(((0.5 * (D_m * M_m)) / d), 2.0))) * (d / Math.sqrt((l * h)));
} else {
tmp = d * (Math.sqrt((1.0 / 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.pow((l * h), -0.5) tmp = 0 if l <= -3.1e-171: tmp = d * -t_0 elif l <= -5e-310: tmp = d * math.log(math.exp(t_0)) elif l <= 1.75e+165: tmp = (1.0 + (((h / l) * -0.5) * math.pow(((0.5 * (D_m * M_m)) / d), 2.0))) * (d / math.sqrt((l * h))) else: tmp = d * (math.sqrt((1.0 / 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(l * h) ^ -0.5 tmp = 0.0 if (l <= -3.1e-171) tmp = Float64(d * Float64(-t_0)); elseif (l <= -5e-310) tmp = Float64(d * log(exp(t_0))); elseif (l <= 1.75e+165) tmp = Float64(Float64(1.0 + Float64(Float64(Float64(h / l) * -0.5) * (Float64(Float64(0.5 * Float64(D_m * M_m)) / d) ^ 2.0))) * Float64(d / sqrt(Float64(l * h)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / 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 = (l * h) ^ -0.5;
tmp = 0.0;
if (l <= -3.1e-171)
tmp = d * -t_0;
elseif (l <= -5e-310)
tmp = d * log(exp(t_0));
elseif (l <= 1.75e+165)
tmp = (1.0 + (((h / l) * -0.5) * (((0.5 * (D_m * M_m)) / d) ^ 2.0))) * (d / sqrt((l * h)));
else
tmp = d * (sqrt((1.0 / 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[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -3.1e-171], N[(d * (-t$95$0)), $MachinePrecision], If[LessEqual[l, -5e-310], N[(d * N[Log[N[Exp[t$95$0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.75e+165], N[(N[(1.0 + N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(N[(0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -3.1 \cdot 10^{-171}:\\
\;\;\;\;d \cdot \left(-t\_0\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;d \cdot \log \left(e^{t\_0}\right)\\
\mathbf{elif}\;\ell \leq 1.75 \cdot 10^{+165}:\\
\;\;\;\;\left(1 + \left(\frac{h}{\ell} \cdot -0.5\right) \cdot {\left(\frac{0.5 \cdot \left(D\_m \cdot M\_m\right)}{d}\right)}^{2}\right) \cdot \frac{d}{\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -3.1e-171Initial program 61.8%
Taylor expanded in d around inf 9.8%
*-commutative9.8%
Simplified9.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.5%
unpow-148.5%
metadata-eval48.5%
pow-sqr48.5%
rem-sqrt-square49.3%
rem-square-sqrt49.1%
fabs-sqr49.1%
rem-square-sqrt49.3%
mul-1-neg49.3%
Simplified49.3%
if -3.1e-171 < l < -4.999999999999985e-310Initial program 77.4%
Taylor expanded in d around inf 35.7%
*-commutative35.7%
Simplified35.7%
add-log-exp55.9%
inv-pow55.9%
sqrt-pow155.9%
*-commutative55.9%
metadata-eval55.9%
Applied egg-rr55.9%
if -4.999999999999985e-310 < l < 1.74999999999999998e165Initial program 68.4%
Applied egg-rr73.4%
distribute-rgt1-in80.9%
+-commutative80.9%
associate-*r*80.9%
associate-*r*80.9%
associate-/l*82.1%
*-commutative82.1%
associate-/l*80.8%
*-commutative80.8%
associate-*r/80.8%
Simplified80.8%
Taylor expanded in D around 0 82.1%
associate-*r/82.1%
Simplified82.1%
Taylor expanded in l around 0 71.9%
if 1.74999999999999998e165 < l Initial program 58.7%
Taylor expanded in d around inf 61.4%
*-commutative61.4%
Simplified61.4%
associate-/r*61.3%
sqrt-div72.6%
Applied egg-rr72.6%
Final simplification61.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -4.6e-171)
(* d (- (pow (* l h) -0.5)))
(if (<= l -5e-310)
(* d (cbrt (pow (* l h) -1.5)))
(if (<= l 5.4e+163)
(*
(+ 1.0 (* (* (/ h l) -0.5) (pow (* D_m (* 0.5 (/ M_m d))) 2.0)))
(/ d (sqrt (* l h))))
(* d (/ (sqrt (/ 1.0 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 <= -4.6e-171) {
tmp = d * -pow((l * h), -0.5);
} else if (l <= -5e-310) {
tmp = d * cbrt(pow((l * h), -1.5));
} else if (l <= 5.4e+163) {
tmp = (1.0 + (((h / l) * -0.5) * pow((D_m * (0.5 * (M_m / d))), 2.0))) * (d / sqrt((l * h)));
} else {
tmp = d * (sqrt((1.0 / 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 tmp;
if (l <= -4.6e-171) {
tmp = d * -Math.pow((l * h), -0.5);
} else if (l <= -5e-310) {
tmp = d * Math.cbrt(Math.pow((l * h), -1.5));
} else if (l <= 5.4e+163) {
tmp = (1.0 + (((h / l) * -0.5) * Math.pow((D_m * (0.5 * (M_m / d))), 2.0))) * (d / Math.sqrt((l * h)));
} else {
tmp = d * (Math.sqrt((1.0 / 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 <= -4.6e-171) tmp = Float64(d * Float64(-(Float64(l * h) ^ -0.5))); elseif (l <= -5e-310) tmp = Float64(d * cbrt((Float64(l * h) ^ -1.5))); elseif (l <= 5.4e+163) tmp = Float64(Float64(1.0 + Float64(Float64(Float64(h / l) * -0.5) * (Float64(D_m * Float64(0.5 * Float64(M_m / d))) ^ 2.0))) * Float64(d / sqrt(Float64(l * h)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / 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_] := If[LessEqual[l, -4.6e-171], N[(d * (-N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, -5e-310], N[(d * N[Power[N[Power[N[(l * h), $MachinePrecision], -1.5], $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5.4e+163], N[(N[(1.0 + N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / l), $MachinePrecision]], $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 -4.6 \cdot 10^{-171}:\\
\;\;\;\;d \cdot \left(-{\left(\ell \cdot h\right)}^{-0.5}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;d \cdot \sqrt[3]{{\left(\ell \cdot h\right)}^{-1.5}}\\
\mathbf{elif}\;\ell \leq 5.4 \cdot 10^{+163}:\\
\;\;\;\;\left(1 + \left(\frac{h}{\ell} \cdot -0.5\right) \cdot {\left(D\_m \cdot \left(0.5 \cdot \frac{M\_m}{d}\right)\right)}^{2}\right) \cdot \frac{d}{\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -4.59999999999999956e-171Initial program 61.8%
Taylor expanded in d around inf 9.8%
*-commutative9.8%
Simplified9.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.5%
unpow-148.5%
metadata-eval48.5%
pow-sqr48.5%
rem-sqrt-square49.3%
rem-square-sqrt49.1%
fabs-sqr49.1%
rem-square-sqrt49.3%
mul-1-neg49.3%
Simplified49.3%
if -4.59999999999999956e-171 < l < -4.999999999999985e-310Initial program 77.4%
Taylor expanded in d around inf 35.7%
*-commutative35.7%
Simplified35.7%
Taylor expanded in l around 0 35.7%
unpow-135.7%
metadata-eval35.7%
pow-sqr35.7%
rem-sqrt-square33.2%
rem-square-sqrt33.2%
fabs-sqr33.2%
rem-square-sqrt33.2%
Simplified33.2%
sqr-pow33.2%
metadata-eval33.2%
metadata-eval33.2%
Applied egg-rr33.2%
add-cbrt-cube33.2%
add-cbrt-cube33.2%
cbrt-unprod45.9%
pow-prod-up45.9%
metadata-eval45.9%
pow-prod-up45.9%
*-commutative45.9%
metadata-eval45.9%
pow-prod-up45.9%
metadata-eval45.9%
pow-prod-up45.9%
*-commutative45.9%
metadata-eval45.9%
Applied egg-rr45.9%
pow-sqr45.9%
metadata-eval45.9%
Simplified45.9%
if -4.999999999999985e-310 < l < 5.39999999999999998e163Initial program 68.4%
Applied egg-rr73.4%
distribute-rgt1-in80.9%
+-commutative80.9%
associate-*r*80.9%
associate-*r*80.9%
associate-/l*82.1%
*-commutative82.1%
associate-/l*80.8%
*-commutative80.8%
associate-*r/80.8%
Simplified80.8%
Taylor expanded in l around 0 70.9%
if 5.39999999999999998e163 < l Initial program 58.7%
Taylor expanded in d around inf 61.4%
*-commutative61.4%
Simplified61.4%
associate-/r*61.3%
sqrt-div72.6%
Applied egg-rr72.6%
Final simplification60.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 (<= l -5.5e-171)
(* d (- (pow (* l h) -0.5)))
(if (<= l -5e-310)
(* d (cbrt (pow (* l h) -1.5)))
(if (<= l 1.02e+163)
(*
(+ 1.0 (* (* (/ h l) -0.5) (pow (/ (* 0.5 (* D_m M_m)) d) 2.0)))
(/ d (sqrt (* l h))))
(* d (/ (sqrt (/ 1.0 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 <= -5.5e-171) {
tmp = d * -pow((l * h), -0.5);
} else if (l <= -5e-310) {
tmp = d * cbrt(pow((l * h), -1.5));
} else if (l <= 1.02e+163) {
tmp = (1.0 + (((h / l) * -0.5) * pow(((0.5 * (D_m * M_m)) / d), 2.0))) * (d / sqrt((l * h)));
} else {
tmp = d * (sqrt((1.0 / 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 tmp;
if (l <= -5.5e-171) {
tmp = d * -Math.pow((l * h), -0.5);
} else if (l <= -5e-310) {
tmp = d * Math.cbrt(Math.pow((l * h), -1.5));
} else if (l <= 1.02e+163) {
tmp = (1.0 + (((h / l) * -0.5) * Math.pow(((0.5 * (D_m * M_m)) / d), 2.0))) * (d / Math.sqrt((l * h)));
} else {
tmp = d * (Math.sqrt((1.0 / 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 <= -5.5e-171) tmp = Float64(d * Float64(-(Float64(l * h) ^ -0.5))); elseif (l <= -5e-310) tmp = Float64(d * cbrt((Float64(l * h) ^ -1.5))); elseif (l <= 1.02e+163) tmp = Float64(Float64(1.0 + Float64(Float64(Float64(h / l) * -0.5) * (Float64(Float64(0.5 * Float64(D_m * M_m)) / d) ^ 2.0))) * Float64(d / sqrt(Float64(l * h)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / 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_] := If[LessEqual[l, -5.5e-171], N[(d * (-N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, -5e-310], N[(d * N[Power[N[Power[N[(l * h), $MachinePrecision], -1.5], $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.02e+163], N[(N[(1.0 + N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(N[(0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / l), $MachinePrecision]], $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 -5.5 \cdot 10^{-171}:\\
\;\;\;\;d \cdot \left(-{\left(\ell \cdot h\right)}^{-0.5}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;d \cdot \sqrt[3]{{\left(\ell \cdot h\right)}^{-1.5}}\\
\mathbf{elif}\;\ell \leq 1.02 \cdot 10^{+163}:\\
\;\;\;\;\left(1 + \left(\frac{h}{\ell} \cdot -0.5\right) \cdot {\left(\frac{0.5 \cdot \left(D\_m \cdot M\_m\right)}{d}\right)}^{2}\right) \cdot \frac{d}{\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -5.50000000000000037e-171Initial program 61.8%
Taylor expanded in d around inf 9.8%
*-commutative9.8%
Simplified9.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.5%
unpow-148.5%
metadata-eval48.5%
pow-sqr48.5%
rem-sqrt-square49.3%
rem-square-sqrt49.1%
fabs-sqr49.1%
rem-square-sqrt49.3%
mul-1-neg49.3%
Simplified49.3%
if -5.50000000000000037e-171 < l < -4.999999999999985e-310Initial program 77.4%
Taylor expanded in d around inf 35.7%
*-commutative35.7%
Simplified35.7%
Taylor expanded in l around 0 35.7%
unpow-135.7%
metadata-eval35.7%
pow-sqr35.7%
rem-sqrt-square33.2%
rem-square-sqrt33.2%
fabs-sqr33.2%
rem-square-sqrt33.2%
Simplified33.2%
sqr-pow33.2%
metadata-eval33.2%
metadata-eval33.2%
Applied egg-rr33.2%
add-cbrt-cube33.2%
add-cbrt-cube33.2%
cbrt-unprod45.9%
pow-prod-up45.9%
metadata-eval45.9%
pow-prod-up45.9%
*-commutative45.9%
metadata-eval45.9%
pow-prod-up45.9%
metadata-eval45.9%
pow-prod-up45.9%
*-commutative45.9%
metadata-eval45.9%
Applied egg-rr45.9%
pow-sqr45.9%
metadata-eval45.9%
Simplified45.9%
if -4.999999999999985e-310 < l < 1.02e163Initial program 68.4%
Applied egg-rr73.4%
distribute-rgt1-in80.9%
+-commutative80.9%
associate-*r*80.9%
associate-*r*80.9%
associate-/l*82.1%
*-commutative82.1%
associate-/l*80.8%
*-commutative80.8%
associate-*r/80.8%
Simplified80.8%
Taylor expanded in D around 0 82.1%
associate-*r/82.1%
Simplified82.1%
Taylor expanded in l around 0 71.9%
if 1.02e163 < l Initial program 58.7%
Taylor expanded in d around inf 61.4%
*-commutative61.4%
Simplified61.4%
associate-/r*61.3%
sqrt-div72.6%
Applied egg-rr72.6%
Final simplification60.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 -1.6e-171)
(* d (- (pow (* l h) -0.5)))
(if (<= l -5e-310)
(* d (cbrt (pow (* l h) -1.5)))
(* d (* (pow l -0.5) (pow h -0.5))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.6e-171) {
tmp = d * -pow((l * h), -0.5);
} else if (l <= -5e-310) {
tmp = d * cbrt(pow((l * h), -1.5));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.6e-171) {
tmp = d * -Math.pow((l * h), -0.5);
} else if (l <= -5e-310) {
tmp = d * Math.cbrt(Math.pow((l * h), -1.5));
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.6e-171) tmp = Float64(d * Float64(-(Float64(l * h) ^ -0.5))); elseif (l <= -5e-310) tmp = Float64(d * cbrt((Float64(l * h) ^ -1.5))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.6e-171], N[(d * (-N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, -5e-310], N[(d * N[Power[N[Power[N[(l * h), $MachinePrecision], -1.5], $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.6 \cdot 10^{-171}:\\
\;\;\;\;d \cdot \left(-{\left(\ell \cdot h\right)}^{-0.5}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;d \cdot \sqrt[3]{{\left(\ell \cdot h\right)}^{-1.5}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -1.6000000000000001e-171Initial program 61.8%
Taylor expanded in d around inf 9.8%
*-commutative9.8%
Simplified9.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.5%
unpow-148.5%
metadata-eval48.5%
pow-sqr48.5%
rem-sqrt-square49.3%
rem-square-sqrt49.1%
fabs-sqr49.1%
rem-square-sqrt49.3%
mul-1-neg49.3%
Simplified49.3%
if -1.6000000000000001e-171 < l < -4.999999999999985e-310Initial program 77.4%
Taylor expanded in d around inf 35.7%
*-commutative35.7%
Simplified35.7%
Taylor expanded in l around 0 35.7%
unpow-135.7%
metadata-eval35.7%
pow-sqr35.7%
rem-sqrt-square33.2%
rem-square-sqrt33.2%
fabs-sqr33.2%
rem-square-sqrt33.2%
Simplified33.2%
sqr-pow33.2%
metadata-eval33.2%
metadata-eval33.2%
Applied egg-rr33.2%
add-cbrt-cube33.2%
add-cbrt-cube33.2%
cbrt-unprod45.9%
pow-prod-up45.9%
metadata-eval45.9%
pow-prod-up45.9%
*-commutative45.9%
metadata-eval45.9%
pow-prod-up45.9%
metadata-eval45.9%
pow-prod-up45.9%
*-commutative45.9%
metadata-eval45.9%
Applied egg-rr45.9%
pow-sqr45.9%
metadata-eval45.9%
Simplified45.9%
if -4.999999999999985e-310 < l Initial program 65.6%
Taylor expanded in d around inf 41.3%
*-commutative41.3%
Simplified41.3%
Taylor expanded in l around 0 41.3%
unpow-141.3%
metadata-eval41.3%
pow-sqr41.3%
rem-sqrt-square41.9%
rem-square-sqrt41.7%
fabs-sqr41.7%
rem-square-sqrt41.9%
Simplified41.9%
*-commutative41.9%
unpow-prod-down48.8%
Applied egg-rr48.8%
Final simplification48.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
(let* ((t_0 (pow (* l h) -0.5)))
(if (<= l -4.1e-169)
(* d (- t_0))
(if (<= l -2.6e-307) (* d (cbrt (pow (* l h) -1.5))) (* 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 = pow((l * h), -0.5);
double tmp;
if (l <= -4.1e-169) {
tmp = d * -t_0;
} else if (l <= -2.6e-307) {
tmp = d * cbrt(pow((l * h), -1.5));
} else {
tmp = d * t_0;
}
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.pow((l * h), -0.5);
double tmp;
if (l <= -4.1e-169) {
tmp = d * -t_0;
} else if (l <= -2.6e-307) {
tmp = d * Math.cbrt(Math.pow((l * h), -1.5));
} 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 = Float64(l * h) ^ -0.5 tmp = 0.0 if (l <= -4.1e-169) tmp = Float64(d * Float64(-t_0)); elseif (l <= -2.6e-307) tmp = Float64(d * cbrt((Float64(l * h) ^ -1.5))); else tmp = Float64(d * t_0); 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[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -4.1e-169], N[(d * (-t$95$0)), $MachinePrecision], If[LessEqual[l, -2.6e-307], N[(d * N[Power[N[Power[N[(l * h), $MachinePrecision], -1.5], $MachinePrecision], 1/3], $MachinePrecision]), $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 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -4.1 \cdot 10^{-169}:\\
\;\;\;\;d \cdot \left(-t\_0\right)\\
\mathbf{elif}\;\ell \leq -2.6 \cdot 10^{-307}:\\
\;\;\;\;d \cdot \sqrt[3]{{\left(\ell \cdot h\right)}^{-1.5}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if l < -4.0999999999999998e-169Initial program 61.8%
Taylor expanded in d around inf 9.8%
*-commutative9.8%
Simplified9.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.5%
unpow-148.5%
metadata-eval48.5%
pow-sqr48.5%
rem-sqrt-square49.3%
rem-square-sqrt49.1%
fabs-sqr49.1%
rem-square-sqrt49.3%
mul-1-neg49.3%
Simplified49.3%
if -4.0999999999999998e-169 < l < -2.59999999999999996e-307Initial program 76.8%
Taylor expanded in d around inf 36.6%
*-commutative36.6%
Simplified36.6%
Taylor expanded in l around 0 36.6%
unpow-136.6%
metadata-eval36.6%
pow-sqr36.6%
rem-sqrt-square34.0%
rem-square-sqrt34.0%
fabs-sqr34.0%
rem-square-sqrt34.0%
Simplified34.0%
sqr-pow34.0%
metadata-eval34.0%
metadata-eval34.0%
Applied egg-rr34.0%
add-cbrt-cube34.0%
add-cbrt-cube34.0%
cbrt-unprod47.1%
pow-prod-up47.1%
metadata-eval47.1%
pow-prod-up47.1%
*-commutative47.1%
metadata-eval47.1%
pow-prod-up47.1%
metadata-eval47.1%
pow-prod-up47.1%
*-commutative47.1%
metadata-eval47.1%
Applied egg-rr47.1%
pow-sqr47.1%
metadata-eval47.1%
Simplified47.1%
if -2.59999999999999996e-307 < l Initial program 65.9%
Taylor expanded in d around inf 41.0%
*-commutative41.0%
Simplified41.0%
Taylor expanded in l around 0 41.0%
unpow-141.0%
metadata-eval41.0%
pow-sqr41.0%
rem-sqrt-square41.6%
rem-square-sqrt41.4%
fabs-sqr41.4%
rem-square-sqrt41.6%
Simplified41.6%
Final simplification45.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (pow (* l h) -0.5)))
(if (<= l -6e-172)
(* d (- t_0))
(if (<= l -6.3e-267)
(* d (sqrt (/ 1.0 (* l h))))
(if (<= l 2.75e-250) (* d (- (sqrt (/ (/ 1.0 h) l)))) (* 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 = pow((l * h), -0.5);
double tmp;
if (l <= -6e-172) {
tmp = d * -t_0;
} else if (l <= -6.3e-267) {
tmp = d * sqrt((1.0 / (l * h)));
} else if (l <= 2.75e-250) {
tmp = d * -sqrt(((1.0 / h) / l));
} 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 = (l * h) ** (-0.5d0)
if (l <= (-6d-172)) then
tmp = d * -t_0
else if (l <= (-6.3d-267)) then
tmp = d * sqrt((1.0d0 / (l * h)))
else if (l <= 2.75d-250) then
tmp = d * -sqrt(((1.0d0 / h) / l))
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.pow((l * h), -0.5);
double tmp;
if (l <= -6e-172) {
tmp = d * -t_0;
} else if (l <= -6.3e-267) {
tmp = d * Math.sqrt((1.0 / (l * h)));
} else if (l <= 2.75e-250) {
tmp = d * -Math.sqrt(((1.0 / h) / l));
} 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.pow((l * h), -0.5) tmp = 0 if l <= -6e-172: tmp = d * -t_0 elif l <= -6.3e-267: tmp = d * math.sqrt((1.0 / (l * h))) elif l <= 2.75e-250: tmp = d * -math.sqrt(((1.0 / h) / l)) 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 = Float64(l * h) ^ -0.5 tmp = 0.0 if (l <= -6e-172) tmp = Float64(d * Float64(-t_0)); elseif (l <= -6.3e-267) tmp = Float64(d * sqrt(Float64(1.0 / Float64(l * h)))); elseif (l <= 2.75e-250) tmp = Float64(d * Float64(-sqrt(Float64(Float64(1.0 / h) / l)))); 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 = (l * h) ^ -0.5;
tmp = 0.0;
if (l <= -6e-172)
tmp = d * -t_0;
elseif (l <= -6.3e-267)
tmp = d * sqrt((1.0 / (l * h)));
elseif (l <= 2.75e-250)
tmp = d * -sqrt(((1.0 / h) / l));
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[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -6e-172], N[(d * (-t$95$0)), $MachinePrecision], If[LessEqual[l, -6.3e-267], N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 2.75e-250], N[(d * (-N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision])), $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 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -6 \cdot 10^{-172}:\\
\;\;\;\;d \cdot \left(-t\_0\right)\\
\mathbf{elif}\;\ell \leq -6.3 \cdot 10^{-267}:\\
\;\;\;\;d \cdot \sqrt{\frac{1}{\ell \cdot h}}\\
\mathbf{elif}\;\ell \leq 2.75 \cdot 10^{-250}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{\frac{1}{h}}{\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if l < -5.99999999999999967e-172Initial program 61.8%
Taylor expanded in d around inf 9.8%
*-commutative9.8%
Simplified9.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.5%
unpow-148.5%
metadata-eval48.5%
pow-sqr48.5%
rem-sqrt-square49.3%
rem-square-sqrt49.1%
fabs-sqr49.1%
rem-square-sqrt49.3%
mul-1-neg49.3%
Simplified49.3%
if -5.99999999999999967e-172 < l < -6.30000000000000042e-267Initial program 88.4%
Taylor expanded in d around inf 45.4%
*-commutative45.4%
Simplified45.4%
if -6.30000000000000042e-267 < l < 2.75e-250Initial program 75.5%
Taylor expanded in d around inf 15.7%
*-commutative15.7%
Simplified15.7%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt28.7%
unpow-128.7%
metadata-eval28.7%
pow-sqr28.7%
rem-sqrt-square28.6%
rem-square-sqrt28.5%
fabs-sqr28.5%
rem-square-sqrt28.6%
mul-1-neg28.6%
Simplified28.6%
Taylor expanded in d around 0 28.7%
mul-1-neg28.7%
distribute-rgt-neg-in28.7%
associate-/r*28.7%
Simplified28.7%
if 2.75e-250 < l Initial program 62.3%
Taylor expanded in d around inf 44.5%
*-commutative44.5%
Simplified44.5%
Taylor expanded in l around 0 44.5%
unpow-144.5%
metadata-eval44.5%
pow-sqr44.5%
rem-sqrt-square45.1%
rem-square-sqrt45.0%
fabs-sqr45.0%
rem-square-sqrt45.1%
Simplified45.1%
Final simplification44.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 (pow (* l h) -0.5)) (t_1 (* d (- t_0))))
(if (<= l -4.4e-172)
t_1
(if (<= l -4.5e-270)
(* d (sqrt (/ 1.0 (* l h))))
(if (<= l 6.8e-249) t_1 (* 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 = pow((l * h), -0.5);
double t_1 = d * -t_0;
double tmp;
if (l <= -4.4e-172) {
tmp = t_1;
} else if (l <= -4.5e-270) {
tmp = d * sqrt((1.0 / (l * h)));
} else if (l <= 6.8e-249) {
tmp = t_1;
} 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) :: t_1
real(8) :: tmp
t_0 = (l * h) ** (-0.5d0)
t_1 = d * -t_0
if (l <= (-4.4d-172)) then
tmp = t_1
else if (l <= (-4.5d-270)) then
tmp = d * sqrt((1.0d0 / (l * h)))
else if (l <= 6.8d-249) then
tmp = t_1
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.pow((l * h), -0.5);
double t_1 = d * -t_0;
double tmp;
if (l <= -4.4e-172) {
tmp = t_1;
} else if (l <= -4.5e-270) {
tmp = d * Math.sqrt((1.0 / (l * h)));
} else if (l <= 6.8e-249) {
tmp = t_1;
} 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.pow((l * h), -0.5) t_1 = d * -t_0 tmp = 0 if l <= -4.4e-172: tmp = t_1 elif l <= -4.5e-270: tmp = d * math.sqrt((1.0 / (l * h))) elif l <= 6.8e-249: tmp = t_1 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 = Float64(l * h) ^ -0.5 t_1 = Float64(d * Float64(-t_0)) tmp = 0.0 if (l <= -4.4e-172) tmp = t_1; elseif (l <= -4.5e-270) tmp = Float64(d * sqrt(Float64(1.0 / Float64(l * h)))); elseif (l <= 6.8e-249) tmp = t_1; 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 = (l * h) ^ -0.5;
t_1 = d * -t_0;
tmp = 0.0;
if (l <= -4.4e-172)
tmp = t_1;
elseif (l <= -4.5e-270)
tmp = d * sqrt((1.0 / (l * h)));
elseif (l <= 6.8e-249)
tmp = t_1;
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[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, Block[{t$95$1 = N[(d * (-t$95$0)), $MachinePrecision]}, If[LessEqual[l, -4.4e-172], t$95$1, If[LessEqual[l, -4.5e-270], N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 6.8e-249], t$95$1, 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 := {\left(\ell \cdot h\right)}^{-0.5}\\
t_1 := d \cdot \left(-t\_0\right)\\
\mathbf{if}\;\ell \leq -4.4 \cdot 10^{-172}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;\ell \leq -4.5 \cdot 10^{-270}:\\
\;\;\;\;d \cdot \sqrt{\frac{1}{\ell \cdot h}}\\
\mathbf{elif}\;\ell \leq 6.8 \cdot 10^{-249}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if l < -4.40000000000000018e-172 or -4.49999999999999998e-270 < l < 6.7999999999999996e-249Initial program 65.1%
Taylor expanded in d around inf 11.2%
*-commutative11.2%
Simplified11.2%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt43.8%
unpow-143.8%
metadata-eval43.8%
pow-sqr43.8%
rem-sqrt-square44.4%
rem-square-sqrt44.3%
fabs-sqr44.3%
rem-square-sqrt44.4%
mul-1-neg44.4%
Simplified44.4%
if -4.40000000000000018e-172 < l < -4.49999999999999998e-270Initial program 88.4%
Taylor expanded in d around inf 45.4%
*-commutative45.4%
Simplified45.4%
if 6.7999999999999996e-249 < l Initial program 62.3%
Taylor expanded in d around inf 44.5%
*-commutative44.5%
Simplified44.5%
Taylor expanded in l around 0 44.5%
unpow-144.5%
metadata-eval44.5%
pow-sqr44.5%
rem-sqrt-square45.1%
rem-square-sqrt45.0%
fabs-sqr45.0%
rem-square-sqrt45.1%
Simplified45.1%
Final simplification44.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 (pow (* l h) -0.5))) (if (<= l -3.2e-172) (* 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 = pow((l * h), -0.5);
double tmp;
if (l <= -3.2e-172) {
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 = (l * h) ** (-0.5d0)
if (l <= (-3.2d-172)) 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.pow((l * h), -0.5);
double tmp;
if (l <= -3.2e-172) {
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.pow((l * h), -0.5) tmp = 0 if l <= -3.2e-172: 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 = Float64(l * h) ^ -0.5 tmp = 0.0 if (l <= -3.2e-172) 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 = (l * h) ^ -0.5;
tmp = 0.0;
if (l <= -3.2e-172)
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[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -3.2e-172], 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 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -3.2 \cdot 10^{-172}:\\
\;\;\;\;d \cdot \left(-t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if l < -3.2000000000000001e-172Initial program 61.8%
Taylor expanded in d around inf 9.8%
*-commutative9.8%
Simplified9.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.5%
unpow-148.5%
metadata-eval48.5%
pow-sqr48.5%
rem-sqrt-square49.3%
rem-square-sqrt49.1%
fabs-sqr49.1%
rem-square-sqrt49.3%
mul-1-neg49.3%
Simplified49.3%
if -3.2000000000000001e-172 < l Initial program 68.3%
Taylor expanded in d around inf 40.0%
*-commutative40.0%
Simplified40.0%
Taylor expanded in l around 0 40.0%
unpow-140.0%
metadata-eval40.0%
pow-sqr40.0%
rem-sqrt-square39.9%
rem-square-sqrt39.8%
fabs-sqr39.8%
rem-square-sqrt39.9%
Simplified39.9%
Final simplification43.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 (* d (pow (* l h) -0.5)))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
return d * pow((l * h), -0.5);
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
code = d * ((l * h) ** (-0.5d0))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d * Math.pow((l * h), -0.5);
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d * math.pow((l * h), -0.5)
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d * (Float64(l * h) ^ -0.5)) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d * ((l * h) ^ -0.5);
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
d \cdot {\left(\ell \cdot h\right)}^{-0.5}
\end{array}
Initial program 66.1%
Taylor expanded in d around inf 29.8%
*-commutative29.8%
Simplified29.8%
Taylor expanded in l around 0 29.8%
unpow-129.8%
metadata-eval29.8%
pow-sqr29.8%
rem-sqrt-square29.7%
rem-square-sqrt29.6%
fabs-sqr29.6%
rem-square-sqrt29.7%
Simplified29.7%
Final simplification29.7%
herbie shell --seed 2024054
(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)))))