
(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 22 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 (/ h l))) (t_1 (/ M_m (/ d D_m))))
(if (<= d -1.35e-194)
(*
(* (/ (sqrt (- d)) (sqrt (- h))) (sqrt (/ d l)))
(- 1.0 (* 0.5 (/ (* h (* 0.25 (pow t_1 2.0))) l))))
(if (<= d 4.2e-291)
(*
d
(/
(fma
-0.125
(* (sqrt (pow (/ h l) 3.0)) (pow (* D_m (/ M_m d)) 2.0))
t_0)
h))
(*
(pow (cbrt (/ d (* (sqrt h) (sqrt l)))) 3.0)
(- 1.0 (* 0.5 (pow (* t_0 (* 0.5 t_1)) 2.0))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((h / l));
double t_1 = M_m / (d / D_m);
double tmp;
if (d <= -1.35e-194) {
tmp = ((sqrt(-d) / sqrt(-h)) * sqrt((d / l))) * (1.0 - (0.5 * ((h * (0.25 * pow(t_1, 2.0))) / l)));
} else if (d <= 4.2e-291) {
tmp = d * (fma(-0.125, (sqrt(pow((h / l), 3.0)) * pow((D_m * (M_m / d)), 2.0)), t_0) / h);
} else {
tmp = pow(cbrt((d / (sqrt(h) * sqrt(l)))), 3.0) * (1.0 - (0.5 * pow((t_0 * (0.5 * t_1)), 2.0)));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(h / l)) t_1 = Float64(M_m / Float64(d / D_m)) tmp = 0.0 if (d <= -1.35e-194) tmp = Float64(Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * sqrt(Float64(d / l))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h * Float64(0.25 * (t_1 ^ 2.0))) / l)))); elseif (d <= 4.2e-291) tmp = Float64(d * Float64(fma(-0.125, Float64(sqrt((Float64(h / l) ^ 3.0)) * (Float64(D_m * Float64(M_m / d)) ^ 2.0)), t_0) / h)); else tmp = Float64((cbrt(Float64(d / Float64(sqrt(h) * sqrt(l)))) ^ 3.0) * Float64(1.0 - Float64(0.5 * (Float64(t_0 * Float64(0.5 * t_1)) ^ 2.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[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(M$95$m / N[(d / D$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -1.35e-194], N[(N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h * N[(0.25 * N[Power[t$95$1, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 4.2e-291], N[(d * N[(N[(-0.125 * N[(N[Sqrt[N[Power[N[(h / l), $MachinePrecision], 3.0], $MachinePrecision]], $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision] / h), $MachinePrecision]), $MachinePrecision], N[(N[Power[N[Power[N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision], 3.0], $MachinePrecision] * N[(1.0 - N[(0.5 * N[Power[N[(t$95$0 * N[(0.5 * t$95$1), $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 := \sqrt{\frac{h}{\ell}}\\
t_1 := \frac{M\_m}{\frac{d}{D\_m}}\\
\mathbf{if}\;d \leq -1.35 \cdot 10^{-194}:\\
\;\;\;\;\left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(1 - 0.5 \cdot \frac{h \cdot \left(0.25 \cdot {t\_1}^{2}\right)}{\ell}\right)\\
\mathbf{elif}\;d \leq 4.2 \cdot 10^{-291}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(-0.125, \sqrt{{\left(\frac{h}{\ell}\right)}^{3}} \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}, t\_0\right)}{h}\\
\mathbf{else}:\\
\;\;\;\;{\left(\sqrt[3]{\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}}\right)}^{3} \cdot \left(1 - 0.5 \cdot {\left(t\_0 \cdot \left(0.5 \cdot t\_1\right)\right)}^{2}\right)\\
\end{array}
\end{array}
if d < -1.35e-194Initial program 64.8%
Simplified63.8%
associate-*r/68.1%
associate-*l/68.1%
div-inv68.1%
metadata-eval68.1%
*-commutative68.1%
unpow-prod-down68.1%
metadata-eval68.1%
clear-num68.0%
un-div-inv68.0%
Applied egg-rr68.0%
frac-2neg68.0%
sqrt-div78.9%
Applied egg-rr78.9%
if -1.35e-194 < d < 4.1999999999999999e-291Initial program 28.4%
Simplified28.4%
add-cube-cbrt28.2%
pow328.2%
sqrt-div6.8%
sqrt-div6.9%
frac-times6.9%
add-sqr-sqrt6.9%
Applied egg-rr6.9%
pow16.9%
rem-cube-cbrt6.9%
sqrt-unprod7.8%
cancel-sign-sub-inv7.8%
metadata-eval7.8%
*-commutative7.8%
div-inv7.8%
metadata-eval7.8%
Applied egg-rr7.8%
unpow17.8%
associate-*l/7.7%
associate-/l*7.7%
Simplified7.7%
Taylor expanded in h around 0 17.4%
Simplified56.4%
if 4.1999999999999999e-291 < d Initial program 66.6%
Simplified68.2%
add-cube-cbrt67.7%
pow367.7%
sqrt-div80.7%
sqrt-div84.6%
frac-times84.6%
add-sqr-sqrt84.6%
Applied egg-rr84.6%
add-sqr-sqrt84.6%
pow284.6%
sqrt-prod84.6%
sqrt-pow187.2%
metadata-eval87.2%
associate-*l/87.2%
div-inv87.2%
metadata-eval87.2%
*-commutative87.2%
pow187.2%
clear-num86.6%
un-div-inv86.6%
Applied egg-rr86.6%
Final simplification80.2%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ M_m (/ d D_m))) (t_1 (sqrt (- d))))
(if (<= l -7.5e+116)
(*
(- 1.0 (* 0.5 (pow (* (sqrt (/ h l)) (* 0.5 t_0)) 2.0)))
(* (sqrt (/ d h)) (/ t_1 (sqrt (- l)))))
(if (<= l -4e-310)
(*
(* (/ t_1 (sqrt (- h))) (sqrt (/ d l)))
(- 1.0 (* 0.5 (/ (* h (* 0.25 (pow t_0 2.0))) l))))
(*
d
(/
(fma (* -0.125 (pow (* M_m (/ D_m d)) 2.0)) (/ h l) 1.0)
(* (sqrt h) (sqrt l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = M_m / (d / D_m);
double t_1 = sqrt(-d);
double tmp;
if (l <= -7.5e+116) {
tmp = (1.0 - (0.5 * pow((sqrt((h / l)) * (0.5 * t_0)), 2.0))) * (sqrt((d / h)) * (t_1 / sqrt(-l)));
} else if (l <= -4e-310) {
tmp = ((t_1 / sqrt(-h)) * sqrt((d / l))) * (1.0 - (0.5 * ((h * (0.25 * pow(t_0, 2.0))) / l)));
} else {
tmp = d * (fma((-0.125 * pow((M_m * (D_m / d)), 2.0)), (h / l), 1.0) / (sqrt(h) * sqrt(l)));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(M_m / Float64(d / D_m)) t_1 = sqrt(Float64(-d)) tmp = 0.0 if (l <= -7.5e+116) tmp = Float64(Float64(1.0 - Float64(0.5 * (Float64(sqrt(Float64(h / l)) * Float64(0.5 * t_0)) ^ 2.0))) * Float64(sqrt(Float64(d / h)) * Float64(t_1 / sqrt(Float64(-l))))); elseif (l <= -4e-310) tmp = Float64(Float64(Float64(t_1 / sqrt(Float64(-h))) * sqrt(Float64(d / l))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h * Float64(0.25 * (t_0 ^ 2.0))) / l)))); else tmp = Float64(d * Float64(fma(Float64(-0.125 * (Float64(M_m * Float64(D_m / d)) ^ 2.0)), Float64(h / l), 1.0) / Float64(sqrt(h) * sqrt(l)))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(M$95$m / N[(d / D$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[l, -7.5e+116], N[(N[(1.0 - N[(0.5 * N[Power[N[(N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision] * N[(0.5 * t$95$0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(t$95$1 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -4e-310], N[(N[(N[(t$95$1 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h * N[(0.25 * N[Power[t$95$0, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(N[(-0.125 * N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{M\_m}{\frac{d}{D\_m}}\\
t_1 := \sqrt{-d}\\
\mathbf{if}\;\ell \leq -7.5 \cdot 10^{+116}:\\
\;\;\;\;\left(1 - 0.5 \cdot {\left(\sqrt{\frac{h}{\ell}} \cdot \left(0.5 \cdot t\_0\right)\right)}^{2}\right) \cdot \left(\sqrt{\frac{d}{h}} \cdot \frac{t\_1}{\sqrt{-\ell}}\right)\\
\mathbf{elif}\;\ell \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\left(\frac{t\_1}{\sqrt{-h}} \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(1 - 0.5 \cdot \frac{h \cdot \left(0.25 \cdot {t\_0}^{2}\right)}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(-0.125 \cdot {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}, \frac{h}{\ell}, 1\right)}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -7.5e116Initial program 59.4%
Simplified59.4%
add-sqr-sqrt0.0%
pow20.0%
sqrt-prod0.0%
sqrt-pow10.0%
metadata-eval0.0%
associate-*l/0.0%
div-inv0.0%
metadata-eval0.0%
*-commutative0.0%
pow10.0%
clear-num0.0%
un-div-inv0.0%
Applied egg-rr67.0%
frac-2neg67.0%
sqrt-div77.2%
Applied egg-rr77.2%
if -7.5e116 < l < -3.999999999999988e-310Initial program 56.2%
Simplified55.0%
associate-*r/60.0%
associate-*l/60.0%
div-inv60.0%
metadata-eval60.0%
*-commutative60.0%
unpow-prod-down60.0%
metadata-eval60.0%
clear-num60.0%
un-div-inv60.0%
Applied egg-rr60.0%
frac-2neg60.0%
sqrt-div73.5%
Applied egg-rr73.5%
if -3.999999999999988e-310 < l Initial program 65.6%
Simplified67.1%
pow167.1%
associate-*r*67.1%
sqrt-div79.6%
sqrt-div83.4%
frac-times83.3%
add-sqr-sqrt83.4%
unpow-prod-down83.4%
metadata-eval83.4%
clear-num82.9%
un-div-inv82.9%
Applied egg-rr82.9%
unpow182.9%
associate-*l/84.4%
associate-/l*85.1%
fma-define85.1%
associate-*r*85.1%
fma-define85.1%
*-commutative85.1%
associate-*l*85.1%
metadata-eval85.1%
*-commutative85.1%
associate-/r/85.1%
associate-*l/83.7%
associate-/l*85.7%
Simplified85.7%
Final simplification80.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 (sqrt (- d))))
(if (<= l -1.5e-179)
(*
(sqrt (/ d l))
(*
(/ t_0 (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(if (<= l -4e-310)
(*
(- 1.0 (* 0.5 (/ (* h (* 0.25 (pow (/ M_m (/ d D_m)) 2.0))) l)))
(* (sqrt (/ d h)) (/ t_0 (sqrt (- l)))))
(*
d
(/
(fma (* -0.125 (pow (* M_m (/ D_m d)) 2.0)) (/ h l) 1.0)
(* (sqrt h) (sqrt l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt(-d);
double tmp;
if (l <= -1.5e-179) {
tmp = sqrt((d / l)) * ((t_0 / sqrt(-h)) * (1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else if (l <= -4e-310) {
tmp = (1.0 - (0.5 * ((h * (0.25 * pow((M_m / (d / D_m)), 2.0))) / l))) * (sqrt((d / h)) * (t_0 / sqrt(-l)));
} else {
tmp = d * (fma((-0.125 * pow((M_m * (D_m / d)), 2.0)), (h / l), 1.0) / (sqrt(h) * sqrt(l)));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(-d)) tmp = 0.0 if (l <= -1.5e-179) tmp = Float64(sqrt(Float64(d / 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 <= -4e-310) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h * Float64(0.25 * (Float64(M_m / Float64(d / D_m)) ^ 2.0))) / l))) * Float64(sqrt(Float64(d / h)) * Float64(t_0 / sqrt(Float64(-l))))); else tmp = Float64(d * Float64(fma(Float64(-0.125 * (Float64(M_m * Float64(D_m / d)) ^ 2.0)), Float64(h / l), 1.0) / Float64(sqrt(h) * sqrt(l)))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[l, -1.5e-179], N[(N[Sqrt[N[(d / 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, -4e-310], N[(N[(1.0 - N[(0.5 * N[(N[(h * N[(0.25 * N[Power[N[(M$95$m / N[(d / D$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(t$95$0 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(N[(-0.125 * N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{-d}\\
\mathbf{if}\;\ell \leq -1.5 \cdot 10^{-179}:\\
\;\;\;\;\sqrt{\frac{d}{\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 -4 \cdot 10^{-310}:\\
\;\;\;\;\left(1 - 0.5 \cdot \frac{h \cdot \left(0.25 \cdot {\left(\frac{M\_m}{\frac{d}{D\_m}}\right)}^{2}\right)}{\ell}\right) \cdot \left(\sqrt{\frac{d}{h}} \cdot \frac{t\_0}{\sqrt{-\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(-0.125 \cdot {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}, \frac{h}{\ell}, 1\right)}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.50000000000000003e-179Initial program 58.3%
Simplified58.3%
frac-2neg58.4%
sqrt-div69.4%
Applied egg-rr72.4%
if -1.50000000000000003e-179 < l < -3.999999999999988e-310Initial program 52.9%
Simplified48.9%
associate-*r/65.3%
associate-*l/65.3%
div-inv65.3%
metadata-eval65.3%
*-commutative65.3%
unpow-prod-down65.3%
metadata-eval65.3%
clear-num65.3%
un-div-inv65.3%
Applied egg-rr65.3%
frac-2neg49.1%
sqrt-div52.6%
Applied egg-rr83.9%
if -3.999999999999988e-310 < l Initial program 65.6%
Simplified67.1%
pow167.1%
associate-*r*67.1%
sqrt-div79.6%
sqrt-div83.4%
frac-times83.3%
add-sqr-sqrt83.4%
unpow-prod-down83.4%
metadata-eval83.4%
clear-num82.9%
un-div-inv82.9%
Applied egg-rr82.9%
unpow182.9%
associate-*l/84.4%
associate-/l*85.1%
fma-define85.1%
associate-*r*85.1%
fma-define85.1%
*-commutative85.1%
associate-*l*85.1%
metadata-eval85.1%
*-commutative85.1%
associate-/r/85.1%
associate-*l/83.7%
associate-/l*85.7%
Simplified85.7%
Final simplification80.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 l))) (t_1 (pow (* M_m (/ D_m d)) 2.0)))
(if (<= l -7.5e-187)
(*
t_0
(*
(/ (sqrt (- d)) (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* D_m (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(if (<= l 8e-309)
(* (* t_0 (sqrt (/ d h))) (- 1.0 (* 0.5 (* h (* 0.25 (/ t_1 l))))))
(* d (/ (fma (* -0.125 t_1) (/ h l) 1.0) (* (sqrt h) (sqrt l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double t_1 = pow((M_m * (D_m / d)), 2.0);
double tmp;
if (l <= -7.5e-187) {
tmp = t_0 * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (pow((D_m * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else if (l <= 8e-309) {
tmp = (t_0 * sqrt((d / h))) * (1.0 - (0.5 * (h * (0.25 * (t_1 / l)))));
} else {
tmp = d * (fma((-0.125 * t_1), (h / l), 1.0) / (sqrt(h) * sqrt(l)));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) t_1 = Float64(M_m * Float64(D_m / d)) ^ 2.0 tmp = 0.0 if (l <= -7.5e-187) tmp = Float64(t_0 * 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))))); elseif (l <= 8e-309) tmp = Float64(Float64(t_0 * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(h * Float64(0.25 * Float64(t_1 / l)))))); else tmp = Float64(d * Float64(fma(Float64(-0.125 * t_1), Float64(h / l), 1.0) / Float64(sqrt(h) * sqrt(l)))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[l, -7.5e-187], N[(t$95$0 * 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]), $MachinePrecision], If[LessEqual[l, 8e-309], N[(N[(t$95$0 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(h * N[(0.25 * N[(t$95$1 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(N[(-0.125 * t$95$1), $MachinePrecision] * N[(h / l), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
t_1 := {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}\\
\mathbf{if}\;\ell \leq -7.5 \cdot 10^{-187}:\\
\;\;\;\;t\_0 \cdot \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)\\
\mathbf{elif}\;\ell \leq 8 \cdot 10^{-309}:\\
\;\;\;\;\left(t\_0 \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \left(h \cdot \left(0.25 \cdot \frac{t\_1}{\ell}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(-0.125 \cdot t\_1, \frac{h}{\ell}, 1\right)}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -7.5000000000000004e-187Initial program 58.3%
Simplified58.3%
frac-2neg58.4%
sqrt-div69.4%
Applied egg-rr72.4%
if -7.5000000000000004e-187 < l < 8.0000000000000003e-309Initial program 52.9%
Simplified48.9%
Taylor expanded in M around 0 49.5%
associate-*r*49.8%
times-frac40.9%
associate-/l*40.9%
*-commutative40.9%
unpow240.9%
unpow240.9%
times-frac40.9%
unpow240.9%
swap-sqr52.9%
associate-/r/48.9%
associate-/r/48.9%
unpow248.9%
associate-*l*48.9%
*-commutative48.9%
associate-*l/65.3%
associate-/l*65.3%
associate-/l*65.3%
Simplified65.3%
if 8.0000000000000003e-309 < l Initial program 65.6%
Simplified67.1%
pow167.1%
associate-*r*67.1%
sqrt-div79.6%
sqrt-div83.4%
frac-times83.3%
add-sqr-sqrt83.4%
unpow-prod-down83.4%
metadata-eval83.4%
clear-num82.9%
un-div-inv82.9%
Applied egg-rr82.9%
unpow182.9%
associate-*l/84.4%
associate-/l*85.1%
fma-define85.1%
associate-*r*85.1%
fma-define85.1%
*-commutative85.1%
associate-*l*85.1%
metadata-eval85.1%
*-commutative85.1%
associate-/r/85.1%
associate-*l/83.7%
associate-/l*85.7%
Simplified85.7%
Final simplification78.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 (* M_m (/ D_m d)) 2.0)))
(if (<= d -1.5e-143)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* 0.5 (* h (* 0.25 (/ t_0 l))))))
(if (<= d -1.35e-303)
(*
(* (pow D_m 2.0) (* (pow M_m 2.0) 0.125))
(/ (sqrt (/ h (pow l 3.0))) d))
(* d (/ (fma (* -0.125 t_0) (/ h l) 1.0) (* (sqrt h) (sqrt l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = pow((M_m * (D_m / d)), 2.0);
double tmp;
if (d <= -1.5e-143) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * (h * (0.25 * (t_0 / l)))));
} else if (d <= -1.35e-303) {
tmp = (pow(D_m, 2.0) * (pow(M_m, 2.0) * 0.125)) * (sqrt((h / pow(l, 3.0))) / d);
} else {
tmp = d * (fma((-0.125 * t_0), (h / l), 1.0) / (sqrt(h) * sqrt(l)));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(M_m * Float64(D_m / d)) ^ 2.0 tmp = 0.0 if (d <= -1.5e-143) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(h * Float64(0.25 * Float64(t_0 / l)))))); elseif (d <= -1.35e-303) tmp = Float64(Float64((D_m ^ 2.0) * Float64((M_m ^ 2.0) * 0.125)) * Float64(sqrt(Float64(h / (l ^ 3.0))) / d)); else tmp = Float64(d * Float64(fma(Float64(-0.125 * t_0), Float64(h / l), 1.0) / Float64(sqrt(h) * sqrt(l)))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[d, -1.5e-143], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(h * N[(0.25 * N[(t$95$0 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -1.35e-303], N[(N[(N[Power[D$95$m, 2.0], $MachinePrecision] * N[(N[Power[M$95$m, 2.0], $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(h / N[Power[l, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(N[(-0.125 * t$95$0), $MachinePrecision] * N[(h / l), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}\\
\mathbf{if}\;d \leq -1.5 \cdot 10^{-143}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \left(h \cdot \left(0.25 \cdot \frac{t\_0}{\ell}\right)\right)\right)\\
\mathbf{elif}\;d \leq -1.35 \cdot 10^{-303}:\\
\;\;\;\;\left({D\_m}^{2} \cdot \left({M\_m}^{2} \cdot 0.125\right)\right) \cdot \frac{\sqrt{\frac{h}{{\ell}^{3}}}}{d}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(-0.125 \cdot t\_0, \frac{h}{\ell}, 1\right)}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -1.49999999999999993e-143Initial program 71.3%
Simplified70.2%
Taylor expanded in M around 0 55.6%
associate-*r*56.1%
times-frac51.5%
associate-/l*51.5%
*-commutative51.5%
unpow251.5%
unpow251.5%
times-frac58.3%
unpow258.3%
swap-sqr71.4%
associate-/r/70.2%
associate-/r/70.2%
unpow270.2%
associate-*l*70.2%
*-commutative70.2%
associate-*l/74.8%
associate-/l*75.9%
associate-/l*75.9%
Simplified75.9%
if -1.49999999999999993e-143 < d < -1.34999999999999993e-303Initial program 19.7%
Simplified19.7%
Taylor expanded in M around 0 9.5%
associate-*r*9.5%
times-frac9.5%
associate-/l*9.5%
*-commutative9.5%
unpow29.5%
unpow29.5%
times-frac19.3%
unpow219.3%
swap-sqr19.7%
associate-/r/19.7%
associate-/r/19.7%
unpow219.7%
associate-*l*19.7%
*-commutative19.7%
associate-*l/20.0%
associate-/l*20.0%
associate-/l*20.0%
Simplified20.0%
add-sqr-sqrt20.0%
pow220.0%
associate-*r*20.0%
associate-*r/20.0%
Applied egg-rr20.0%
Taylor expanded in h around -inf 0.0%
associate-*l/0.0%
associate-/l*0.0%
unpow20.0%
rem-square-sqrt0.0%
unpow20.0%
rem-square-sqrt35.3%
metadata-eval35.3%
Simplified35.3%
if -1.34999999999999993e-303 < d Initial program 65.1%
Simplified66.6%
pow166.6%
associate-*r*66.6%
sqrt-div79.0%
sqrt-div82.8%
frac-times82.7%
add-sqr-sqrt82.8%
unpow-prod-down82.8%
metadata-eval82.8%
clear-num82.3%
un-div-inv82.3%
Applied egg-rr82.3%
unpow182.3%
associate-*l/83.8%
associate-/l*84.5%
fma-define84.5%
associate-*r*84.5%
fma-define84.5%
*-commutative84.5%
associate-*l*84.5%
metadata-eval84.5%
*-commutative84.5%
associate-/r/84.4%
associate-*l/83.0%
associate-/l*85.0%
Simplified85.0%
Final simplification75.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= d -1.55e-142)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* 0.5 (* h (* 0.25 (/ (pow (* M_m (/ D_m d)) 2.0) l))))))
(if (<= d -1.35e-303)
(*
(* (pow D_m 2.0) (* (pow M_m 2.0) 0.125))
(/ (sqrt (/ h (pow l 3.0))) d))
(*
(/ d (* (sqrt h) (sqrt l)))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -1.55e-142) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * (h * (0.25 * (pow((M_m * (D_m / d)), 2.0) / l)))));
} else if (d <= -1.35e-303) {
tmp = (pow(D_m, 2.0) * (pow(M_m, 2.0) * 0.125)) * (sqrt((h / pow(l, 3.0))) / d);
} else {
tmp = (d / (sqrt(h) * sqrt(l))) * (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= (-1.55d-142)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (0.5d0 * (h * (0.25d0 * (((m_m * (d_m / d)) ** 2.0d0) / l)))))
else if (d <= (-1.35d-303)) then
tmp = ((d_m ** 2.0d0) * ((m_m ** 2.0d0) * 0.125d0)) * (sqrt((h / (l ** 3.0d0))) / d)
else
tmp = (d / (sqrt(h) * sqrt(l))) * (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -1.55e-142) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (0.5 * (h * (0.25 * (Math.pow((M_m * (D_m / d)), 2.0) / l)))));
} else if (d <= -1.35e-303) {
tmp = (Math.pow(D_m, 2.0) * (Math.pow(M_m, 2.0) * 0.125)) * (Math.sqrt((h / Math.pow(l, 3.0))) / d);
} else {
tmp = (d / (Math.sqrt(h) * Math.sqrt(l))) * (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= -1.55e-142: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (0.5 * (h * (0.25 * (math.pow((M_m * (D_m / d)), 2.0) / l))))) elif d <= -1.35e-303: tmp = (math.pow(D_m, 2.0) * (math.pow(M_m, 2.0) * 0.125)) * (math.sqrt((h / math.pow(l, 3.0))) / d) else: tmp = (d / (math.sqrt(h) * math.sqrt(l))) * (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -1.55e-142) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(h * Float64(0.25 * Float64((Float64(M_m * Float64(D_m / d)) ^ 2.0) / l)))))); elseif (d <= -1.35e-303) tmp = Float64(Float64((D_m ^ 2.0) * Float64((M_m ^ 2.0) * 0.125)) * Float64(sqrt(Float64(h / (l ^ 3.0))) / d)); else tmp = Float64(Float64(d / Float64(sqrt(h) * sqrt(l))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= -1.55e-142)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * (h * (0.25 * (((M_m * (D_m / d)) ^ 2.0) / l)))));
elseif (d <= -1.35e-303)
tmp = ((D_m ^ 2.0) * ((M_m ^ 2.0) * 0.125)) * (sqrt((h / (l ^ 3.0))) / d);
else
tmp = (d / (sqrt(h) * sqrt(l))) * (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -1.55e-142], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(h * N[(0.25 * N[(N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -1.35e-303], N[(N[(N[Power[D$95$m, 2.0], $MachinePrecision] * N[(N[Power[M$95$m, 2.0], $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(h / N[Power[l, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -1.55 \cdot 10^{-142}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \left(h \cdot \left(0.25 \cdot \frac{{\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}}{\ell}\right)\right)\right)\\
\mathbf{elif}\;d \leq -1.35 \cdot 10^{-303}:\\
\;\;\;\;\left({D\_m}^{2} \cdot \left({M\_m}^{2} \cdot 0.125\right)\right) \cdot \frac{\sqrt{\frac{h}{{\ell}^{3}}}}{d}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}} \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if d < -1.55e-142Initial program 71.3%
Simplified70.2%
Taylor expanded in M around 0 55.6%
associate-*r*56.1%
times-frac51.5%
associate-/l*51.5%
*-commutative51.5%
unpow251.5%
unpow251.5%
times-frac58.3%
unpow258.3%
swap-sqr71.4%
associate-/r/70.2%
associate-/r/70.2%
unpow270.2%
associate-*l*70.2%
*-commutative70.2%
associate-*l/74.8%
associate-/l*75.9%
associate-/l*75.9%
Simplified75.9%
if -1.55e-142 < d < -1.34999999999999993e-303Initial program 19.7%
Simplified19.7%
Taylor expanded in M around 0 9.5%
associate-*r*9.5%
times-frac9.5%
associate-/l*9.5%
*-commutative9.5%
unpow29.5%
unpow29.5%
times-frac19.3%
unpow219.3%
swap-sqr19.7%
associate-/r/19.7%
associate-/r/19.7%
unpow219.7%
associate-*l*19.7%
*-commutative19.7%
associate-*l/20.0%
associate-/l*20.0%
associate-/l*20.0%
Simplified20.0%
add-sqr-sqrt20.0%
pow220.0%
associate-*r*20.0%
associate-*r/20.0%
Applied egg-rr20.0%
Taylor expanded in h around -inf 0.0%
associate-*l/0.0%
associate-/l*0.0%
unpow20.0%
rem-square-sqrt0.0%
unpow20.0%
rem-square-sqrt35.3%
metadata-eval35.3%
Simplified35.3%
if -1.34999999999999993e-303 < d Initial program 65.1%
Simplified66.6%
*-commutative66.6%
sqrt-div70.5%
sqrt-div82.8%
frac-times82.7%
add-sqr-sqrt82.8%
Applied egg-rr82.8%
Final simplification74.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 (<= h -9.8e-209)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* 0.5 (* h (* 0.25 (/ (pow (* M_m (/ D_m d)) 2.0) l))))))
(if (<= h 2.25e-305)
(* d (- (pow (* h l) -0.5)))
(*
(/ d (* (sqrt h) (sqrt l)))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 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 (h <= -9.8e-209) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * (h * (0.25 * (pow((M_m * (D_m / d)), 2.0) / l)))));
} else if (h <= 2.25e-305) {
tmp = d * -pow((h * l), -0.5);
} else {
tmp = (d / (sqrt(h) * sqrt(l))) * (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 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 (h <= (-9.8d-209)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (0.5d0 * (h * (0.25d0 * (((m_m * (d_m / d)) ** 2.0d0) / l)))))
else if (h <= 2.25d-305) then
tmp = d * -((h * l) ** (-0.5d0))
else
tmp = (d / (sqrt(h) * sqrt(l))) * (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 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 (h <= -9.8e-209) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (0.5 * (h * (0.25 * (Math.pow((M_m * (D_m / d)), 2.0) / l)))));
} else if (h <= 2.25e-305) {
tmp = d * -Math.pow((h * l), -0.5);
} else {
tmp = (d / (Math.sqrt(h) * Math.sqrt(l))) * (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 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 h <= -9.8e-209: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (0.5 * (h * (0.25 * (math.pow((M_m * (D_m / d)), 2.0) / l))))) elif h <= 2.25e-305: tmp = d * -math.pow((h * l), -0.5) else: tmp = (d / (math.sqrt(h) * math.sqrt(l))) * (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 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 (h <= -9.8e-209) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(h * Float64(0.25 * Float64((Float64(M_m * Float64(D_m / d)) ^ 2.0) / l)))))); elseif (h <= 2.25e-305) tmp = Float64(d * Float64(-(Float64(h * l) ^ -0.5))); else tmp = Float64(Float64(d / Float64(sqrt(h) * sqrt(l))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 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 (h <= -9.8e-209)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * (h * (0.25 * (((M_m * (D_m / d)) ^ 2.0) / l)))));
elseif (h <= 2.25e-305)
tmp = d * -((h * l) ^ -0.5);
else
tmp = (d / (sqrt(h) * sqrt(l))) * (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 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[h, -9.8e-209], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(h * N[(0.25 * N[(N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 2.25e-305], N[(d * (-N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], N[(N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;h \leq -9.8 \cdot 10^{-209}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot \left(h \cdot \left(0.25 \cdot \frac{{\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}}{\ell}\right)\right)\right)\\
\mathbf{elif}\;h \leq 2.25 \cdot 10^{-305}:\\
\;\;\;\;d \cdot \left(-{\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}} \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if h < -9.8000000000000007e-209Initial program 57.8%
Simplified56.8%
Taylor expanded in M around 0 47.8%
associate-*r*48.2%
times-frac44.2%
associate-/l*44.2%
*-commutative44.2%
unpow244.2%
unpow244.2%
times-frac50.3%
unpow250.3%
swap-sqr57.8%
associate-/r/56.8%
associate-/r/56.7%
unpow256.7%
associate-*l*56.7%
*-commutative56.7%
associate-*l/61.0%
associate-/l*61.9%
associate-/l*61.9%
Simplified61.9%
if -9.8000000000000007e-209 < h < 2.2500000000000001e-305Initial program 51.9%
Simplified51.9%
Taylor expanded in d around inf 6.0%
Taylor expanded in h around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt73.2%
mul-1-neg73.2%
unpow-173.2%
metadata-eval73.2%
pow-sqr73.3%
rem-sqrt-square73.3%
rem-square-sqrt73.1%
fabs-sqr73.1%
rem-square-sqrt73.3%
Simplified73.3%
if 2.2500000000000001e-305 < h Initial program 66.1%
Simplified67.6%
*-commutative67.6%
sqrt-div71.5%
sqrt-div84.0%
frac-times83.9%
add-sqr-sqrt84.1%
Applied egg-rr84.1%
Final simplification74.4%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= h -4.45e-209)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* 0.125 (* (/ h l) (pow (* D_m (/ M_m d)) 2.0)))))
(if (<= h 2.25e-305)
(* d (- (pow (* h l) -0.5)))
(*
(/ d (* (sqrt h) (sqrt l)))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 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 (h <= -4.45e-209) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.125 * ((h / l) * pow((D_m * (M_m / d)), 2.0))));
} else if (h <= 2.25e-305) {
tmp = d * -pow((h * l), -0.5);
} else {
tmp = (d / (sqrt(h) * sqrt(l))) * (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 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 (h <= (-4.45d-209)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (0.125d0 * ((h / l) * ((d_m * (m_m / d)) ** 2.0d0))))
else if (h <= 2.25d-305) then
tmp = d * -((h * l) ** (-0.5d0))
else
tmp = (d / (sqrt(h) * sqrt(l))) * (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 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 (h <= -4.45e-209) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (0.125 * ((h / l) * Math.pow((D_m * (M_m / d)), 2.0))));
} else if (h <= 2.25e-305) {
tmp = d * -Math.pow((h * l), -0.5);
} else {
tmp = (d / (Math.sqrt(h) * Math.sqrt(l))) * (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 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 h <= -4.45e-209: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (0.125 * ((h / l) * math.pow((D_m * (M_m / d)), 2.0)))) elif h <= 2.25e-305: tmp = d * -math.pow((h * l), -0.5) else: tmp = (d / (math.sqrt(h) * math.sqrt(l))) * (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 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 (h <= -4.45e-209) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.125 * Float64(Float64(h / l) * (Float64(D_m * Float64(M_m / d)) ^ 2.0))))); elseif (h <= 2.25e-305) tmp = Float64(d * Float64(-(Float64(h * l) ^ -0.5))); else tmp = Float64(Float64(d / Float64(sqrt(h) * sqrt(l))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 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 (h <= -4.45e-209)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.125 * ((h / l) * ((D_m * (M_m / d)) ^ 2.0))));
elseif (h <= 2.25e-305)
tmp = d * -((h * l) ^ -0.5);
else
tmp = (d / (sqrt(h) * sqrt(l))) * (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 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[h, -4.45e-209], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.125 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 2.25e-305], N[(d * (-N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], N[(N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;h \leq -4.45 \cdot 10^{-209}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.125 \cdot \left(\frac{h}{\ell} \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{elif}\;h \leq 2.25 \cdot 10^{-305}:\\
\;\;\;\;d \cdot \left(-{\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}} \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if h < -4.4500000000000003e-209Initial program 57.8%
Simplified56.8%
Taylor expanded in M around 0 47.8%
associate-*r*48.2%
times-frac44.2%
associate-/l*44.2%
*-commutative44.2%
unpow244.2%
unpow244.2%
times-frac50.3%
unpow250.3%
swap-sqr57.8%
associate-/r/56.8%
associate-/r/56.7%
unpow256.7%
associate-*l*56.7%
*-commutative56.7%
associate-*l/61.0%
associate-/l*61.9%
associate-/l*61.9%
Simplified61.9%
Taylor expanded in h around 0 47.8%
associate-*r*48.2%
times-frac44.2%
*-commutative44.2%
associate-/l*42.1%
unpow242.1%
unpow242.1%
unpow242.1%
times-frac48.1%
swap-sqr56.8%
unpow256.8%
*-commutative56.8%
associate-*r/57.8%
*-commutative57.8%
associate-/l*57.8%
Simplified57.8%
if -4.4500000000000003e-209 < h < 2.2500000000000001e-305Initial program 51.9%
Simplified51.9%
Taylor expanded in d around inf 6.0%
Taylor expanded in h around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt73.2%
mul-1-neg73.2%
unpow-173.2%
metadata-eval73.2%
pow-sqr73.3%
rem-sqrt-square73.3%
rem-square-sqrt73.1%
fabs-sqr73.1%
rem-square-sqrt73.3%
Simplified73.3%
if 2.2500000000000001e-305 < h Initial program 66.1%
Simplified67.6%
*-commutative67.6%
sqrt-div71.5%
sqrt-div84.0%
frac-times83.9%
add-sqr-sqrt84.1%
Applied egg-rr84.1%
Final simplification72.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -4e-310)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* 0.125 (* (/ h l) (pow (* D_m (/ M_m d)) 2.0)))))
(if (<= l 2.2e+131)
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))))
(* d (pow (* h l) -0.5)))
(/ d (* (sqrt h) (sqrt l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4e-310) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.125 * ((h / l) * pow((D_m * (M_m / d)), 2.0))));
} else if (l <= 2.2e+131) {
tmp = (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * pow((h * l), -0.5));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-4d-310)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (0.125d0 * ((h / l) * ((d_m * (m_m / d)) ** 2.0d0))))
else if (l <= 2.2d+131) then
tmp = (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0)))) * (d * ((h * l) ** (-0.5d0)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -4e-310) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (0.125 * ((h / l) * Math.pow((D_m * (M_m / d)), 2.0))));
} else if (l <= 2.2e+131) {
tmp = (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * Math.pow((h * l), -0.5));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -4e-310: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (0.125 * ((h / l) * math.pow((D_m * (M_m / d)), 2.0)))) elif l <= 2.2e+131: tmp = (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * math.pow((h * l), -0.5)) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -4e-310) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.125 * Float64(Float64(h / l) * (Float64(D_m * Float64(M_m / d)) ^ 2.0))))); elseif (l <= 2.2e+131) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0)))) * Float64(d * (Float64(h * l) ^ -0.5))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -4e-310)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.125 * ((h / l) * ((D_m * (M_m / d)) ^ 2.0))));
elseif (l <= 2.2e+131)
tmp = (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0)))) * (d * ((h * l) ^ -0.5));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -4e-310], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.125 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 2.2e+131], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.125 \cdot \left(\frac{h}{\ell} \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{elif}\;\ell \leq 2.2 \cdot 10^{+131}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right) \cdot \left(d \cdot {\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -3.999999999999988e-310Initial program 57.2%
Simplified56.4%
Taylor expanded in M around 0 43.1%
associate-*r*43.4%
times-frac40.1%
associate-/l*40.1%
*-commutative40.1%
unpow240.1%
unpow240.1%
times-frac47.6%
unpow247.6%
swap-sqr57.2%
associate-/r/56.4%
associate-/r/56.3%
unpow256.3%
associate-*l*56.3%
*-commutative56.3%
associate-*l/59.8%
associate-/l*60.6%
associate-/l*60.6%
Simplified60.6%
Taylor expanded in h around 0 43.1%
associate-*r*43.4%
times-frac40.1%
*-commutative40.1%
associate-/l*38.4%
unpow238.4%
unpow238.4%
unpow238.4%
times-frac45.0%
swap-sqr56.4%
unpow256.4%
*-commutative56.4%
associate-*r/57.2%
*-commutative57.2%
associate-/l*57.2%
Simplified57.2%
if -3.999999999999988e-310 < l < 2.1999999999999999e131Initial program 72.3%
Simplified73.4%
add-cube-cbrt73.0%
pow373.1%
sqrt-div87.7%
sqrt-div90.3%
frac-times90.3%
add-sqr-sqrt90.4%
Applied egg-rr90.4%
rem-cube-cbrt90.8%
div-inv90.7%
metadata-eval90.7%
sqrt-unprod80.1%
sqrt-div80.1%
*-commutative80.1%
pow1/280.1%
inv-pow80.1%
pow-pow80.1%
metadata-eval80.1%
Applied egg-rr80.1%
if 2.1999999999999999e131 < l Initial program 52.4%
Simplified54.6%
Taylor expanded in d around inf 41.6%
sqrt-div41.5%
metadata-eval41.5%
sqrt-unprod62.6%
div-inv62.6%
associate-/r*56.5%
Applied egg-rr56.5%
associate-/l/62.6%
Simplified62.6%
Final simplification66.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 -1.72e+130)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(if (<= l -4e-310)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l 9e+132)
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))))
(* d (pow (* h l) -0.5)))
(/ d (* (sqrt h) (sqrt l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.72e+130) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else if (l <= -4e-310) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (l <= 9e+132) {
tmp = (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * pow((h * l), -0.5));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-1.72d+130)) then
tmp = sqrt((d / l)) * sqrt((d / h))
else if (l <= (-4d-310)) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else if (l <= 9d+132) then
tmp = (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0)))) * (d * ((h * l) ** (-0.5d0)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.72e+130) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else if (l <= -4e-310) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else if (l <= 9e+132) {
tmp = (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * Math.pow((h * l), -0.5));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -1.72e+130: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) elif l <= -4e-310: tmp = -d * math.sqrt(((1.0 / h) / l)) elif l <= 9e+132: tmp = (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * math.pow((h * l), -0.5)) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.72e+130) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); elseif (l <= -4e-310) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= 9e+132) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0)))) * Float64(d * (Float64(h * l) ^ -0.5))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -1.72e+130)
tmp = sqrt((d / l)) * sqrt((d / h));
elseif (l <= -4e-310)
tmp = -d * sqrt(((1.0 / h) / l));
elseif (l <= 9e+132)
tmp = (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0)))) * (d * ((h * l) ^ -0.5));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.72e+130], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -4e-310], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 9e+132], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.72 \cdot 10^{+130}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;\ell \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq 9 \cdot 10^{+132}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right) \cdot \left(d \cdot {\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.72000000000000008e130Initial program 60.7%
Simplified60.7%
Taylor expanded in d around inf 49.9%
if -1.72000000000000008e130 < l < -3.999999999999988e-310Initial program 55.8%
Simplified54.6%
Taylor expanded in M around 0 39.6%
associate-*r*40.1%
times-frac37.5%
associate-/l*37.5%
*-commutative37.5%
unpow237.5%
unpow237.5%
times-frac45.8%
unpow245.8%
swap-sqr55.8%
associate-/r/54.6%
associate-/r/54.6%
unpow254.6%
associate-*l*54.6%
*-commutative54.6%
associate-*l/59.4%
associate-/l*59.4%
associate-/l*59.4%
Simplified59.4%
add-sqr-sqrt59.4%
pow259.4%
associate-*r*59.4%
associate-*r/59.4%
Applied egg-rr59.4%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt44.8%
neg-mul-144.8%
Simplified44.8%
if -3.999999999999988e-310 < l < 8.99999999999999944e132Initial program 72.3%
Simplified73.4%
add-cube-cbrt73.0%
pow373.1%
sqrt-div87.7%
sqrt-div90.3%
frac-times90.3%
add-sqr-sqrt90.4%
Applied egg-rr90.4%
rem-cube-cbrt90.8%
div-inv90.7%
metadata-eval90.7%
sqrt-unprod80.1%
sqrt-div80.1%
*-commutative80.1%
pow1/280.1%
inv-pow80.1%
pow-pow80.1%
metadata-eval80.1%
Applied egg-rr80.1%
if 8.99999999999999944e132 < l Initial program 52.4%
Simplified54.6%
Taylor expanded in d around inf 41.6%
sqrt-div41.5%
metadata-eval41.5%
sqrt-unprod62.6%
div-inv62.6%
associate-/r*56.5%
Applied egg-rr56.5%
associate-/l/62.6%
Simplified62.6%
Final simplification60.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 -6.5e+127)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(if (<= l -4e-310)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l 6.5e+133)
(*
d
(/
(+ 1.0 (* (/ h l) (* -0.125 (pow (* M_m (/ D_m d)) 2.0))))
(sqrt (* h l))))
(/ d (* (sqrt h) (sqrt l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -6.5e+127) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else if (l <= -4e-310) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (l <= 6.5e+133) {
tmp = d * ((1.0 + ((h / l) * (-0.125 * pow((M_m * (D_m / d)), 2.0)))) / sqrt((h * l)));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-6.5d+127)) then
tmp = sqrt((d / l)) * sqrt((d / h))
else if (l <= (-4d-310)) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else if (l <= 6.5d+133) then
tmp = d * ((1.0d0 + ((h / l) * ((-0.125d0) * ((m_m * (d_m / d)) ** 2.0d0)))) / sqrt((h * l)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -6.5e+127) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else if (l <= -4e-310) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else if (l <= 6.5e+133) {
tmp = d * ((1.0 + ((h / l) * (-0.125 * Math.pow((M_m * (D_m / d)), 2.0)))) / Math.sqrt((h * l)));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -6.5e+127: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) elif l <= -4e-310: tmp = -d * math.sqrt(((1.0 / h) / l)) elif l <= 6.5e+133: tmp = d * ((1.0 + ((h / l) * (-0.125 * math.pow((M_m * (D_m / d)), 2.0)))) / math.sqrt((h * l))) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -6.5e+127) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); elseif (l <= -4e-310) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= 6.5e+133) tmp = Float64(d * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64(-0.125 * (Float64(M_m * Float64(D_m / d)) ^ 2.0)))) / sqrt(Float64(h * l)))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -6.5e+127)
tmp = sqrt((d / l)) * sqrt((d / h));
elseif (l <= -4e-310)
tmp = -d * sqrt(((1.0 / h) / l));
elseif (l <= 6.5e+133)
tmp = d * ((1.0 + ((h / l) * (-0.125 * ((M_m * (D_m / d)) ^ 2.0)))) / sqrt((h * l)));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -6.5e+127], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -4e-310], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 6.5e+133], N[(d * N[(N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.125 * N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -6.5 \cdot 10^{+127}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;\ell \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq 6.5 \cdot 10^{+133}:\\
\;\;\;\;d \cdot \frac{1 + \frac{h}{\ell} \cdot \left(-0.125 \cdot {\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -6.5e127Initial program 60.7%
Simplified60.7%
Taylor expanded in d around inf 49.9%
if -6.5e127 < l < -3.999999999999988e-310Initial program 55.8%
Simplified54.6%
Taylor expanded in M around 0 39.6%
associate-*r*40.1%
times-frac37.5%
associate-/l*37.5%
*-commutative37.5%
unpow237.5%
unpow237.5%
times-frac45.8%
unpow245.8%
swap-sqr55.8%
associate-/r/54.6%
associate-/r/54.6%
unpow254.6%
associate-*l*54.6%
*-commutative54.6%
associate-*l/59.4%
associate-/l*59.4%
associate-/l*59.4%
Simplified59.4%
add-sqr-sqrt59.4%
pow259.4%
associate-*r*59.4%
associate-*r/59.4%
Applied egg-rr59.4%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt44.8%
neg-mul-144.8%
Simplified44.8%
if -3.999999999999988e-310 < l < 6.5000000000000004e133Initial program 72.3%
Simplified73.4%
add-cube-cbrt73.0%
pow373.1%
sqrt-div87.7%
sqrt-div90.3%
frac-times90.3%
add-sqr-sqrt90.4%
Applied egg-rr90.4%
pow190.4%
rem-cube-cbrt90.8%
sqrt-unprod80.2%
cancel-sign-sub-inv80.2%
metadata-eval80.2%
*-commutative80.2%
div-inv80.2%
metadata-eval80.2%
Applied egg-rr80.2%
unpow180.2%
associate-*l/80.2%
associate-/l*80.1%
Simplified79.2%
fma-undefine79.2%
*-commutative79.2%
associate-/r/79.3%
div-inv79.3%
clear-num80.1%
Applied egg-rr80.1%
if 6.5000000000000004e133 < l Initial program 52.4%
Simplified54.6%
Taylor expanded in d around inf 41.6%
sqrt-div41.5%
metadata-eval41.5%
sqrt-unprod62.6%
div-inv62.6%
associate-/r*56.5%
Applied egg-rr56.5%
associate-/l/62.6%
Simplified62.6%
Final simplification60.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 (<= d -4.8e+203)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(if (<= d 3.3e-289)
(* d (- (pow (* h l) -0.5)))
(if (<= d 8e-45)
(*
d
(/ (* h (* (pow (* D_m (/ M_m d)) 2.0) (/ -0.125 l))) (sqrt (* h l))))
(/ d (* (sqrt h) (sqrt l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -4.8e+203) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else if (d <= 3.3e-289) {
tmp = d * -pow((h * l), -0.5);
} else if (d <= 8e-45) {
tmp = d * ((h * (pow((D_m * (M_m / d)), 2.0) * (-0.125 / l))) / sqrt((h * l)));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= (-4.8d+203)) then
tmp = sqrt((d / l)) * sqrt((d / h))
else if (d <= 3.3d-289) then
tmp = d * -((h * l) ** (-0.5d0))
else if (d <= 8d-45) then
tmp = d * ((h * (((d_m * (m_m / d)) ** 2.0d0) * ((-0.125d0) / l))) / sqrt((h * l)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -4.8e+203) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else if (d <= 3.3e-289) {
tmp = d * -Math.pow((h * l), -0.5);
} else if (d <= 8e-45) {
tmp = d * ((h * (Math.pow((D_m * (M_m / d)), 2.0) * (-0.125 / l))) / Math.sqrt((h * l)));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= -4.8e+203: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) elif d <= 3.3e-289: tmp = d * -math.pow((h * l), -0.5) elif d <= 8e-45: tmp = d * ((h * (math.pow((D_m * (M_m / d)), 2.0) * (-0.125 / l))) / math.sqrt((h * l))) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -4.8e+203) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); elseif (d <= 3.3e-289) tmp = Float64(d * Float64(-(Float64(h * l) ^ -0.5))); elseif (d <= 8e-45) tmp = Float64(d * Float64(Float64(h * Float64((Float64(D_m * Float64(M_m / d)) ^ 2.0) * Float64(-0.125 / l))) / sqrt(Float64(h * l)))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= -4.8e+203)
tmp = sqrt((d / l)) * sqrt((d / h));
elseif (d <= 3.3e-289)
tmp = d * -((h * l) ^ -0.5);
elseif (d <= 8e-45)
tmp = d * ((h * (((D_m * (M_m / d)) ^ 2.0) * (-0.125 / l))) / sqrt((h * l)));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -4.8e+203], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 3.3e-289], N[(d * (-N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], If[LessEqual[d, 8e-45], N[(d * N[(N[(h * N[(N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.125 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -4.8 \cdot 10^{+203}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;d \leq 3.3 \cdot 10^{-289}:\\
\;\;\;\;d \cdot \left(-{\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{elif}\;d \leq 8 \cdot 10^{-45}:\\
\;\;\;\;d \cdot \frac{h \cdot \left({\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2} \cdot \frac{-0.125}{\ell}\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -4.8000000000000002e203Initial program 86.4%
Simplified86.2%
Taylor expanded in d around inf 82.0%
if -4.8000000000000002e203 < d < 3.29999999999999997e-289Initial program 49.8%
Simplified48.9%
Taylor expanded in d around inf 6.1%
Taylor expanded in h around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt35.3%
mul-1-neg35.3%
unpow-135.3%
metadata-eval35.3%
pow-sqr35.3%
rem-sqrt-square35.3%
rem-square-sqrt35.1%
fabs-sqr35.1%
rem-square-sqrt35.3%
Simplified35.3%
if 3.29999999999999997e-289 < d < 7.99999999999999987e-45Initial program 49.5%
Simplified49.5%
add-cube-cbrt49.1%
pow349.1%
sqrt-div67.3%
sqrt-div73.6%
frac-times73.6%
add-sqr-sqrt73.7%
Applied egg-rr73.7%
pow173.7%
rem-cube-cbrt73.9%
sqrt-unprod66.9%
cancel-sign-sub-inv66.9%
metadata-eval66.9%
*-commutative66.9%
div-inv66.9%
metadata-eval66.9%
Applied egg-rr66.9%
unpow166.9%
associate-*l/68.6%
associate-/l*68.5%
Simplified68.5%
Taylor expanded in D around inf 42.0%
Simplified54.1%
if 7.99999999999999987e-45 < d Initial program 80.9%
Simplified83.7%
Taylor expanded in d around inf 52.3%
sqrt-div52.3%
metadata-eval52.3%
sqrt-unprod73.3%
div-inv73.3%
associate-/r*69.4%
Applied egg-rr69.4%
associate-/l/73.3%
Simplified73.3%
Final simplification54.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 (<= d -8.5e+203)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(if (<= d 3.3e-289)
(* d (- (pow (* h l) -0.5)))
(if (<= d 3.4e-44)
(*
d
(/ (* -0.125 (* (/ h l) (pow (* D_m (/ M_m d)) 2.0))) (sqrt (* h l))))
(/ d (* (sqrt h) (sqrt l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -8.5e+203) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else if (d <= 3.3e-289) {
tmp = d * -pow((h * l), -0.5);
} else if (d <= 3.4e-44) {
tmp = d * ((-0.125 * ((h / l) * pow((D_m * (M_m / d)), 2.0))) / sqrt((h * l)));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= (-8.5d+203)) then
tmp = sqrt((d / l)) * sqrt((d / h))
else if (d <= 3.3d-289) then
tmp = d * -((h * l) ** (-0.5d0))
else if (d <= 3.4d-44) then
tmp = d * (((-0.125d0) * ((h / l) * ((d_m * (m_m / d)) ** 2.0d0))) / sqrt((h * l)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -8.5e+203) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else if (d <= 3.3e-289) {
tmp = d * -Math.pow((h * l), -0.5);
} else if (d <= 3.4e-44) {
tmp = d * ((-0.125 * ((h / l) * Math.pow((D_m * (M_m / d)), 2.0))) / Math.sqrt((h * l)));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= -8.5e+203: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) elif d <= 3.3e-289: tmp = d * -math.pow((h * l), -0.5) elif d <= 3.4e-44: tmp = d * ((-0.125 * ((h / l) * math.pow((D_m * (M_m / d)), 2.0))) / math.sqrt((h * l))) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -8.5e+203) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); elseif (d <= 3.3e-289) tmp = Float64(d * Float64(-(Float64(h * l) ^ -0.5))); elseif (d <= 3.4e-44) tmp = Float64(d * Float64(Float64(-0.125 * Float64(Float64(h / l) * (Float64(D_m * Float64(M_m / d)) ^ 2.0))) / sqrt(Float64(h * l)))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= -8.5e+203)
tmp = sqrt((d / l)) * sqrt((d / h));
elseif (d <= 3.3e-289)
tmp = d * -((h * l) ^ -0.5);
elseif (d <= 3.4e-44)
tmp = d * ((-0.125 * ((h / l) * ((D_m * (M_m / d)) ^ 2.0))) / sqrt((h * l)));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -8.5e+203], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 3.3e-289], N[(d * (-N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], If[LessEqual[d, 3.4e-44], N[(d * N[(N[(-0.125 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -8.5 \cdot 10^{+203}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;d \leq 3.3 \cdot 10^{-289}:\\
\;\;\;\;d \cdot \left(-{\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{elif}\;d \leq 3.4 \cdot 10^{-44}:\\
\;\;\;\;d \cdot \frac{-0.125 \cdot \left(\frac{h}{\ell} \cdot {\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -8.50000000000000025e203Initial program 86.4%
Simplified86.2%
Taylor expanded in d around inf 82.0%
if -8.50000000000000025e203 < d < 3.29999999999999997e-289Initial program 49.8%
Simplified48.9%
Taylor expanded in d around inf 6.1%
Taylor expanded in h around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt35.3%
mul-1-neg35.3%
unpow-135.3%
metadata-eval35.3%
pow-sqr35.3%
rem-sqrt-square35.3%
rem-square-sqrt35.1%
fabs-sqr35.1%
rem-square-sqrt35.3%
Simplified35.3%
if 3.29999999999999997e-289 < d < 3.40000000000000016e-44Initial program 49.5%
Simplified49.5%
add-cube-cbrt49.1%
pow349.1%
sqrt-div67.3%
sqrt-div73.6%
frac-times73.6%
add-sqr-sqrt73.7%
Applied egg-rr73.7%
pow173.7%
rem-cube-cbrt73.9%
sqrt-unprod66.9%
cancel-sign-sub-inv66.9%
metadata-eval66.9%
*-commutative66.9%
div-inv66.9%
metadata-eval66.9%
Applied egg-rr66.9%
unpow166.9%
associate-*l/68.6%
associate-/l*68.5%
Simplified68.5%
*-commutative68.5%
associate-/r/68.6%
div-inv68.6%
clear-num68.5%
associate-*r/68.5%
Applied egg-rr68.5%
Taylor expanded in M around inf 42.0%
associate-/l*42.0%
times-frac42.1%
associate-*r*42.0%
*-commutative42.0%
unpow242.0%
unpow242.0%
times-frac48.6%
unpow248.6%
swap-sqr52.2%
unpow252.2%
associate-*l/52.2%
associate-*r/52.2%
*-commutative52.2%
associate-*r/52.2%
associate-*l/52.2%
*-commutative52.2%
Simplified52.2%
if 3.40000000000000016e-44 < d Initial program 80.9%
Simplified83.7%
Taylor expanded in d around inf 52.3%
sqrt-div52.3%
metadata-eval52.3%
sqrt-unprod73.3%
div-inv73.3%
associate-/r*69.4%
Applied egg-rr69.4%
associate-/l/73.3%
Simplified73.3%
Final simplification53.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 2e-308)
(*
(- 1.0 (* 0.5 (* h (* 0.25 (/ (pow (* M_m (/ D_m d)) 2.0) l)))))
(sqrt (* (/ d l) (/ d h))))
(if (<= l 3.8e+133)
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))))
(* d (pow (* h l) -0.5)))
(/ d (* (sqrt h) (sqrt l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 2e-308) {
tmp = (1.0 - (0.5 * (h * (0.25 * (pow((M_m * (D_m / d)), 2.0) / l))))) * sqrt(((d / l) * (d / h)));
} else if (l <= 3.8e+133) {
tmp = (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * pow((h * l), -0.5));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 2d-308) then
tmp = (1.0d0 - (0.5d0 * (h * (0.25d0 * (((m_m * (d_m / d)) ** 2.0d0) / l))))) * sqrt(((d / l) * (d / h)))
else if (l <= 3.8d+133) then
tmp = (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0)))) * (d * ((h * l) ** (-0.5d0)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 2e-308) {
tmp = (1.0 - (0.5 * (h * (0.25 * (Math.pow((M_m * (D_m / d)), 2.0) / l))))) * Math.sqrt(((d / l) * (d / h)));
} else if (l <= 3.8e+133) {
tmp = (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * Math.pow((h * l), -0.5));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 2e-308: tmp = (1.0 - (0.5 * (h * (0.25 * (math.pow((M_m * (D_m / d)), 2.0) / l))))) * math.sqrt(((d / l) * (d / h))) elif l <= 3.8e+133: tmp = (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * math.pow((h * l), -0.5)) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 2e-308) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(h * Float64(0.25 * Float64((Float64(M_m * Float64(D_m / d)) ^ 2.0) / l))))) * sqrt(Float64(Float64(d / l) * Float64(d / h)))); elseif (l <= 3.8e+133) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0)))) * Float64(d * (Float64(h * l) ^ -0.5))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 2e-308)
tmp = (1.0 - (0.5 * (h * (0.25 * (((M_m * (D_m / d)) ^ 2.0) / l))))) * sqrt(((d / l) * (d / h)));
elseif (l <= 3.8e+133)
tmp = (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0)))) * (d * ((h * l) ^ -0.5));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 2e-308], N[(N[(1.0 - N[(0.5 * N[(h * N[(0.25 * N[(N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.8e+133], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2 \cdot 10^{-308}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(h \cdot \left(0.25 \cdot \frac{{\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}}{\ell}\right)\right)\right) \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{elif}\;\ell \leq 3.8 \cdot 10^{+133}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right) \cdot \left(d \cdot {\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < 1.9999999999999998e-308Initial program 57.2%
Simplified56.4%
Taylor expanded in M around 0 43.1%
associate-*r*43.4%
times-frac40.1%
associate-/l*40.1%
*-commutative40.1%
unpow240.1%
unpow240.1%
times-frac47.6%
unpow247.6%
swap-sqr57.2%
associate-/r/56.4%
associate-/r/56.3%
unpow256.3%
associate-*l*56.3%
*-commutative56.3%
associate-*l/59.8%
associate-/l*60.6%
associate-/l*60.6%
Simplified60.6%
*-commutative60.6%
sqrt-unprod48.1%
Applied egg-rr48.1%
if 1.9999999999999998e-308 < l < 3.8000000000000002e133Initial program 72.3%
Simplified73.4%
add-cube-cbrt73.0%
pow373.1%
sqrt-div87.7%
sqrt-div90.3%
frac-times90.3%
add-sqr-sqrt90.4%
Applied egg-rr90.4%
rem-cube-cbrt90.8%
div-inv90.7%
metadata-eval90.7%
sqrt-unprod80.1%
sqrt-div80.1%
*-commutative80.1%
pow1/280.1%
inv-pow80.1%
pow-pow80.1%
metadata-eval80.1%
Applied egg-rr80.1%
if 3.8000000000000002e133 < l Initial program 52.4%
Simplified54.6%
Taylor expanded in d around inf 41.6%
sqrt-div41.5%
metadata-eval41.5%
sqrt-unprod62.6%
div-inv62.6%
associate-/r*56.5%
Applied egg-rr56.5%
associate-/l/62.6%
Simplified62.6%
Final simplification61.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l 9e-309)
(*
(sqrt (* (/ d l) (/ d h)))
(- 1.0 (* 0.5 (* h (* 0.25 (/ (pow (* D_m (/ M_m d)) 2.0) l))))))
(if (<= l 1.1e+131)
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))))
(* d (pow (* h l) -0.5)))
(/ d (* (sqrt h) (sqrt l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 9e-309) {
tmp = sqrt(((d / l) * (d / h))) * (1.0 - (0.5 * (h * (0.25 * (pow((D_m * (M_m / d)), 2.0) / l)))));
} else if (l <= 1.1e+131) {
tmp = (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * pow((h * l), -0.5));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 9d-309) then
tmp = sqrt(((d / l) * (d / h))) * (1.0d0 - (0.5d0 * (h * (0.25d0 * (((d_m * (m_m / d)) ** 2.0d0) / l)))))
else if (l <= 1.1d+131) then
tmp = (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0)))) * (d * ((h * l) ** (-0.5d0)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 9e-309) {
tmp = Math.sqrt(((d / l) * (d / h))) * (1.0 - (0.5 * (h * (0.25 * (Math.pow((D_m * (M_m / d)), 2.0) / l)))));
} else if (l <= 1.1e+131) {
tmp = (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * Math.pow((h * l), -0.5));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 9e-309: tmp = math.sqrt(((d / l) * (d / h))) * (1.0 - (0.5 * (h * (0.25 * (math.pow((D_m * (M_m / d)), 2.0) / l))))) elif l <= 1.1e+131: tmp = (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d * math.pow((h * l), -0.5)) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 9e-309) tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * Float64(1.0 - Float64(0.5 * Float64(h * Float64(0.25 * Float64((Float64(D_m * Float64(M_m / d)) ^ 2.0) / l)))))); elseif (l <= 1.1e+131) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0)))) * Float64(d * (Float64(h * l) ^ -0.5))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 9e-309)
tmp = sqrt(((d / l) * (d / h))) * (1.0 - (0.5 * (h * (0.25 * (((D_m * (M_m / d)) ^ 2.0) / l)))));
elseif (l <= 1.1e+131)
tmp = (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0)))) * (d * ((h * l) ^ -0.5));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 9e-309], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(0.5 * N[(h * N[(0.25 * N[(N[Power[N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.1e+131], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 9 \cdot 10^{-309}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot \left(1 - 0.5 \cdot \left(h \cdot \left(0.25 \cdot \frac{{\left(D\_m \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right)\right)\right)\\
\mathbf{elif}\;\ell \leq 1.1 \cdot 10^{+131}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right) \cdot \left(d \cdot {\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < 9.0000000000000021e-309Initial program 57.2%
Simplified56.4%
Taylor expanded in M around 0 43.1%
associate-*r*43.4%
times-frac40.1%
associate-/l*40.1%
*-commutative40.1%
unpow240.1%
unpow240.1%
times-frac47.6%
unpow247.6%
swap-sqr57.2%
associate-/r/56.4%
associate-/r/56.3%
unpow256.3%
associate-*l*56.3%
*-commutative56.3%
associate-*l/59.8%
associate-/l*60.6%
associate-/l*60.6%
Simplified60.6%
pow160.6%
sqrt-unprod48.1%
associate-*r*48.1%
associate-*r/48.1%
Applied egg-rr48.1%
unpow148.1%
*-commutative48.1%
associate-*l*48.1%
associate-/l*48.1%
associate-*r/49.7%
*-commutative49.7%
associate-/l*49.7%
Simplified49.7%
if 9.0000000000000021e-309 < l < 1.0999999999999999e131Initial program 72.3%
Simplified73.4%
add-cube-cbrt73.0%
pow373.1%
sqrt-div87.7%
sqrt-div90.3%
frac-times90.3%
add-sqr-sqrt90.4%
Applied egg-rr90.4%
rem-cube-cbrt90.8%
div-inv90.7%
metadata-eval90.7%
sqrt-unprod80.1%
sqrt-div80.1%
*-commutative80.1%
pow1/280.1%
inv-pow80.1%
pow-pow80.1%
metadata-eval80.1%
Applied egg-rr80.1%
if 1.0999999999999999e131 < l Initial program 52.4%
Simplified54.6%
Taylor expanded in d around inf 41.6%
sqrt-div41.5%
metadata-eval41.5%
sqrt-unprod62.6%
div-inv62.6%
associate-/r*56.5%
Applied egg-rr56.5%
associate-/l/62.6%
Simplified62.6%
Final simplification62.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -1.05e+127)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(if (<= l 6.5e-294)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(/ d (* (sqrt h) (sqrt l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.05e+127) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else if (l <= 6.5e-294) {
tmp = -d * sqrt(((1.0 / h) / l));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-1.05d+127)) then
tmp = sqrt((d / l)) * sqrt((d / h))
else if (l <= 6.5d-294) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.05e+127) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else if (l <= 6.5e-294) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -1.05e+127: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) elif l <= 6.5e-294: tmp = -d * math.sqrt(((1.0 / h) / l)) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.05e+127) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); elseif (l <= 6.5e-294) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -1.05e+127)
tmp = sqrt((d / l)) * sqrt((d / h));
elseif (l <= 6.5e-294)
tmp = -d * sqrt(((1.0 / h) / l));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.05e+127], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 6.5e-294], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.05 \cdot 10^{+127}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;\ell \leq 6.5 \cdot 10^{-294}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.04999999999999996e127Initial program 60.7%
Simplified60.7%
Taylor expanded in d around inf 49.9%
if -1.04999999999999996e127 < l < 6.4999999999999995e-294Initial program 55.0%
Simplified53.9%
Taylor expanded in M around 0 39.4%
associate-*r*39.9%
times-frac37.4%
associate-/l*37.4%
*-commutative37.4%
unpow237.4%
unpow237.4%
times-frac45.4%
unpow245.4%
swap-sqr55.1%
associate-/r/53.9%
associate-/r/53.9%
unpow253.9%
associate-*l*53.9%
*-commutative53.9%
associate-*l/58.6%
associate-/l*58.6%
associate-/l*58.6%
Simplified58.6%
add-sqr-sqrt58.6%
pow258.6%
associate-*r*58.6%
associate-*r/58.6%
Applied egg-rr58.6%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt44.5%
neg-mul-144.5%
Simplified44.5%
if 6.4999999999999995e-294 < l Initial program 66.4%
Simplified67.9%
Taylor expanded in d around inf 39.9%
sqrt-div39.9%
metadata-eval39.9%
sqrt-unprod53.6%
div-inv53.6%
associate-/r*51.5%
Applied egg-rr51.5%
associate-/l/53.6%
Simplified53.6%
Final simplification49.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 (<= d 1.3e-270) (* (- d) (sqrt (/ (/ 1.0 h) l))) (/ d (* (sqrt h) (sqrt l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= 1.3e-270) {
tmp = -d * sqrt(((1.0 / h) / l));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= 1.3d-270) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= 1.3e-270) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= 1.3e-270: tmp = -d * math.sqrt(((1.0 / h) / l)) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= 1.3e-270) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= 1.3e-270)
tmp = -d * sqrt(((1.0 / h) / l));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, 1.3e-270], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq 1.3 \cdot 10^{-270}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < 1.3000000000000001e-270Initial program 56.7%
Simplified56.0%
Taylor expanded in M around 0 41.2%
associate-*r*41.5%
times-frac38.4%
associate-/l*38.4%
*-commutative38.4%
unpow238.4%
unpow238.4%
times-frac45.5%
unpow245.5%
swap-sqr56.8%
associate-/r/55.9%
associate-/r/55.9%
unpow255.9%
associate-*l*55.9%
*-commutative55.9%
associate-*l/58.4%
associate-/l*59.9%
associate-/l*59.9%
Simplified60.0%
add-sqr-sqrt59.9%
pow259.9%
associate-*r*59.9%
associate-*r/59.9%
Applied egg-rr59.9%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt39.1%
neg-mul-139.1%
Simplified39.1%
if 1.3000000000000001e-270 < d Initial program 66.6%
Simplified68.2%
Taylor expanded in d around inf 40.7%
sqrt-div40.7%
metadata-eval40.7%
sqrt-unprod54.9%
div-inv55.0%
associate-/r*52.8%
Applied egg-rr52.8%
associate-/l/55.0%
Simplified55.0%
Final simplification46.9%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (let* ((t_0 (sqrt (/ (/ 1.0 h) l)))) (if (<= d 1.8e-270) (* (- d) t_0) (* d t_0))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt(((1.0 / h) / l));
double tmp;
if (d <= 1.8e-270) {
tmp = -d * t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(((1.0d0 / h) / l))
if (d <= 1.8d-270) then
tmp = -d * t_0
else
tmp = d * t_0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt(((1.0 / h) / l));
double tmp;
if (d <= 1.8e-270) {
tmp = -d * t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt(((1.0 / h) / l)) tmp = 0 if d <= 1.8e-270: tmp = -d * t_0 else: tmp = d * t_0 return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(Float64(1.0 / h) / l)) tmp = 0.0 if (d <= 1.8e-270) tmp = Float64(Float64(-d) * t_0); else tmp = Float64(d * t_0); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt(((1.0 / h) / l));
tmp = 0.0;
if (d <= 1.8e-270)
tmp = -d * t_0;
else
tmp = d * t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, 1.8e-270], N[((-d) * t$95$0), $MachinePrecision], N[(d * t$95$0), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{if}\;d \leq 1.8 \cdot 10^{-270}:\\
\;\;\;\;\left(-d\right) \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if d < 1.7999999999999999e-270Initial program 56.7%
Simplified56.0%
Taylor expanded in M around 0 41.2%
associate-*r*41.5%
times-frac38.4%
associate-/l*38.4%
*-commutative38.4%
unpow238.4%
unpow238.4%
times-frac45.5%
unpow245.5%
swap-sqr56.8%
associate-/r/55.9%
associate-/r/55.9%
unpow255.9%
associate-*l*55.9%
*-commutative55.9%
associate-*l/58.4%
associate-/l*59.9%
associate-/l*59.9%
Simplified60.0%
add-sqr-sqrt59.9%
pow259.9%
associate-*r*59.9%
associate-*r/59.9%
Applied egg-rr59.9%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt39.1%
neg-mul-139.1%
Simplified39.1%
if 1.7999999999999999e-270 < d Initial program 66.6%
Simplified68.2%
Taylor expanded in M around 0 37.6%
associate-*r*39.2%
times-frac39.9%
associate-/l*41.5%
*-commutative41.5%
unpow241.5%
unpow241.5%
times-frac53.8%
unpow253.8%
swap-sqr67.4%
associate-/r/67.4%
associate-/r/68.2%
unpow268.2%
associate-*l*68.2%
*-commutative68.2%
associate-*l/66.0%
associate-/l*68.3%
associate-/l*68.3%
Simplified68.3%
add-sqr-sqrt68.3%
pow268.3%
associate-*r*68.3%
associate-*r/68.3%
Applied egg-rr68.3%
Taylor expanded in d around inf 40.7%
associate-/r*41.7%
Simplified41.7%
Final simplification40.4%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= d 2.8e-269) (* d (- (pow (* h l) -0.5))) (* d (sqrt (/ (/ 1.0 h) l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= 2.8e-269) {
tmp = d * -pow((h * l), -0.5);
} else {
tmp = d * sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= 2.8d-269) then
tmp = d * -((h * l) ** (-0.5d0))
else
tmp = d * sqrt(((1.0d0 / h) / l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= 2.8e-269) {
tmp = d * -Math.pow((h * l), -0.5);
} else {
tmp = d * Math.sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= 2.8e-269: tmp = d * -math.pow((h * l), -0.5) else: tmp = d * math.sqrt(((1.0 / h) / l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= 2.8e-269) tmp = Float64(d * Float64(-(Float64(h * l) ^ -0.5))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= 2.8e-269)
tmp = d * -((h * l) ^ -0.5);
else
tmp = d * sqrt(((1.0 / h) / l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, 2.8e-269], N[(d * (-N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq 2.8 \cdot 10^{-269}:\\
\;\;\;\;d \cdot \left(-{\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\end{array}
\end{array}
if d < 2.79999999999999995e-269Initial program 56.7%
Simplified55.9%
Taylor expanded in d around inf 6.1%
Taylor expanded in h around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt37.4%
mul-1-neg37.4%
unpow-137.4%
metadata-eval37.4%
pow-sqr37.5%
rem-sqrt-square37.5%
rem-square-sqrt37.3%
fabs-sqr37.3%
rem-square-sqrt37.5%
Simplified37.5%
if 2.79999999999999995e-269 < d Initial program 66.6%
Simplified68.2%
Taylor expanded in M around 0 37.6%
associate-*r*39.2%
times-frac39.9%
associate-/l*41.5%
*-commutative41.5%
unpow241.5%
unpow241.5%
times-frac53.8%
unpow253.8%
swap-sqr67.4%
associate-/r/67.4%
associate-/r/68.2%
unpow268.2%
associate-*l*68.2%
*-commutative68.2%
associate-*l/66.0%
associate-/l*68.3%
associate-/l*68.3%
Simplified68.3%
add-sqr-sqrt68.3%
pow268.3%
associate-*r*68.3%
associate-*r/68.3%
Applied egg-rr68.3%
Taylor expanded in d around inf 40.7%
associate-/r*41.7%
Simplified41.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 (<= d 2e-269) (* d (- (pow (* h l) -0.5))) (/ d (sqrt (* h l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= 2e-269) {
tmp = d * -pow((h * l), -0.5);
} else {
tmp = d / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= 2d-269) then
tmp = d * -((h * l) ** (-0.5d0))
else
tmp = d / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= 2e-269) {
tmp = d * -Math.pow((h * l), -0.5);
} else {
tmp = d / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= 2e-269: tmp = d * -math.pow((h * l), -0.5) else: tmp = d / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= 2e-269) tmp = Float64(d * Float64(-(Float64(h * l) ^ -0.5))); else tmp = Float64(d / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= 2e-269)
tmp = d * -((h * l) ^ -0.5);
else
tmp = d / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, 2e-269], N[(d * (-N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq 2 \cdot 10^{-269}:\\
\;\;\;\;d \cdot \left(-{\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if d < 1.9999999999999999e-269Initial program 56.7%
Simplified55.9%
Taylor expanded in d around inf 6.1%
Taylor expanded in h around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt37.4%
mul-1-neg37.4%
unpow-137.4%
metadata-eval37.4%
pow-sqr37.5%
rem-sqrt-square37.5%
rem-square-sqrt37.3%
fabs-sqr37.3%
rem-square-sqrt37.5%
Simplified37.5%
if 1.9999999999999999e-269 < d Initial program 66.6%
Simplified68.2%
Taylor expanded in d around inf 40.7%
sqrt-div40.7%
metadata-eval40.7%
sqrt-unprod54.9%
div-inv55.0%
sqrt-unprod40.7%
Applied egg-rr40.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 (sqrt (* h l)))) (if (<= d 2.6e-269) (/ (- d) t_0) (/ d t_0))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((h * l));
double tmp;
if (d <= 2.6e-269) {
tmp = -d / t_0;
} else {
tmp = d / t_0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((h * l))
if (d <= 2.6d-269) then
tmp = -d / t_0
else
tmp = d / t_0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((h * l));
double tmp;
if (d <= 2.6e-269) {
tmp = -d / t_0;
} else {
tmp = d / t_0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((h * l)) tmp = 0 if d <= 2.6e-269: tmp = -d / t_0 else: tmp = d / t_0 return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(h * l)) tmp = 0.0 if (d <= 2.6e-269) tmp = Float64(Float64(-d) / t_0); else tmp = Float64(d / t_0); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((h * l));
tmp = 0.0;
if (d <= 2.6e-269)
tmp = -d / t_0;
else
tmp = d / t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, 2.6e-269], N[((-d) / t$95$0), $MachinePrecision], N[(d / t$95$0), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{h \cdot \ell}\\
\mathbf{if}\;d \leq 2.6 \cdot 10^{-269}:\\
\;\;\;\;\frac{-d}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{t\_0}\\
\end{array}
\end{array}
if d < 2.6e-269Initial program 56.7%
Simplified56.0%
Taylor expanded in M around 0 41.2%
associate-*r*41.5%
times-frac38.4%
associate-/l*38.4%
*-commutative38.4%
unpow238.4%
unpow238.4%
times-frac45.5%
unpow245.5%
swap-sqr56.8%
associate-/r/55.9%
associate-/r/55.9%
unpow255.9%
associate-*l*55.9%
*-commutative55.9%
associate-*l/58.4%
associate-/l*59.9%
associate-/l*59.9%
Simplified60.0%
add-sqr-sqrt59.9%
pow259.9%
associate-*r*59.9%
associate-*r/59.9%
Applied egg-rr59.9%
Taylor expanded in l around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt37.4%
mul-1-neg37.4%
distribute-rgt-neg-out37.4%
*-commutative37.4%
Simplified37.4%
if 2.6e-269 < d Initial program 66.6%
Simplified68.2%
Taylor expanded in d around inf 40.7%
sqrt-div40.7%
metadata-eval40.7%
sqrt-unprod54.9%
div-inv55.0%
sqrt-unprod40.7%
Applied egg-rr40.7%
Final simplification39.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 (/ d (sqrt (* h l))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
return d / sqrt((h * l));
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
code = d / sqrt((h * l))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d / Math.sqrt((h * l));
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d / math.sqrt((h * l))
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d / sqrt(Float64(h * l))) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d / sqrt((h * l));
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\frac{d}{\sqrt{h \cdot \ell}}
\end{array}
Initial program 61.6%
Simplified62.0%
Taylor expanded in d around inf 23.1%
sqrt-div23.1%
metadata-eval23.1%
sqrt-unprod27.8%
div-inv27.8%
sqrt-unprod23.1%
Applied egg-rr23.1%
herbie shell --seed 2024181
(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)))))