
(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 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (d h l M D) :precision binary64 (* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))
double code(double d, double h, double l, double M, double D) {
return (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
real(8) function code(d, h, l, m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= h -1e-310)
(*
(/ (sqrt (- d)) (sqrt (- h)))
(* t_0 (fma h (* (/ -0.125 l) (pow (* D (/ M_m d)) 2.0)) 1.0)))
(*
(* t_0 (/ (sqrt d) (sqrt h)))
(+
1.0
(* 0.5 (/ -1.0 (/ l (* h (pow (/ D (* d (/ 2.0 M_m))) 2.0))))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt((d / l));
double tmp;
if (h <= -1e-310) {
tmp = (sqrt(-d) / sqrt(-h)) * (t_0 * fma(h, ((-0.125 / l) * pow((D * (M_m / d)), 2.0)), 1.0));
} else {
tmp = (t_0 * (sqrt(d) / sqrt(h))) * (1.0 + (0.5 * (-1.0 / (l / (h * pow((D / (d * (2.0 / M_m))), 2.0))))));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (h <= -1e-310) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(t_0 * fma(h, Float64(Float64(-0.125 / l) * (Float64(D * Float64(M_m / d)) ^ 2.0)), 1.0))); else tmp = Float64(Float64(t_0 * Float64(sqrt(d) / sqrt(h))) * Float64(1.0 + Float64(0.5 * Float64(-1.0 / Float64(l / Float64(h * (Float64(D / Float64(d * Float64(2.0 / M_m))) ^ 2.0))))))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -1e-310], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(h * N[(N[(-0.125 / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(0.5 * N[(-1.0 / N[(l / N[(h * N[Power[N[(D / N[(d * N[(2.0 / M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;h \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(t\_0 \cdot \mathsf{fma}\left(h, \frac{-0.125}{\ell} \cdot {\left(D \cdot \frac{M\_m}{d}\right)}^{2}, 1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_0 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right) \cdot \left(1 + 0.5 \cdot \frac{-1}{\frac{\ell}{h \cdot {\left(\frac{D}{d \cdot \frac{2}{M\_m}}\right)}^{2}}}\right)\\
\end{array}
\end{array}
if h < -9.999999999999969e-311Initial program 64.6%
Simplified64.5%
Taylor expanded in M around 0 41.8%
Simplified69.9%
frac-2neg69.9%
sqrt-div83.5%
Applied egg-rr83.5%
if -9.999999999999969e-311 < h Initial program 68.5%
Simplified68.5%
associate-*r/71.6%
clear-num71.6%
frac-times71.6%
*-commutative71.6%
*-un-lft-identity71.6%
times-frac69.9%
*-commutative69.9%
associate-/l/69.9%
times-frac71.6%
*-un-lft-identity71.6%
associate-*r/69.9%
clear-num69.9%
un-div-inv69.9%
div-inv69.8%
clear-num69.8%
Applied egg-rr69.8%
sqrt-div77.1%
div-inv77.1%
Applied egg-rr77.1%
associate-*r/77.1%
*-rgt-identity77.1%
Simplified77.1%
Final simplification80.6%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (- d)))
(t_1
(+
1.0
(* 0.5 (/ -1.0 (/ l (* h (pow (/ D (* d (/ 2.0 M_m))) 2.0)))))))
(t_2 (sqrt (/ d l))))
(if (<= h -5.7e-145)
(*
t_2
(*
(/ t_0 (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* D (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(if (<= h -1e-310)
(* t_1 (* (sqrt (/ d h)) (/ t_0 (sqrt (- l)))))
(* (* t_2 (/ (sqrt d) (sqrt h))) t_1)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt(-d);
double t_1 = 1.0 + (0.5 * (-1.0 / (l / (h * pow((D / (d * (2.0 / M_m))), 2.0)))));
double t_2 = sqrt((d / l));
double tmp;
if (h <= -5.7e-145) {
tmp = t_2 * ((t_0 / sqrt(-h)) * (1.0 + ((h / l) * (pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else if (h <= -1e-310) {
tmp = t_1 * (sqrt((d / h)) * (t_0 / sqrt(-l)));
} else {
tmp = (t_2 * (sqrt(d) / sqrt(h))) * t_1;
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = sqrt(-d)
t_1 = 1.0d0 + (0.5d0 * ((-1.0d0) / (l / (h * ((d_1 / (d * (2.0d0 / m_m))) ** 2.0d0)))))
t_2 = sqrt((d / l))
if (h <= (-5.7d-145)) then
tmp = t_2 * ((t_0 / sqrt(-h)) * (1.0d0 + ((h / l) * (((d_1 * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))))
else if (h <= (-1d-310)) then
tmp = t_1 * (sqrt((d / h)) * (t_0 / sqrt(-l)))
else
tmp = (t_2 * (sqrt(d) / sqrt(h))) * t_1
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt(-d);
double t_1 = 1.0 + (0.5 * (-1.0 / (l / (h * Math.pow((D / (d * (2.0 / M_m))), 2.0)))));
double t_2 = Math.sqrt((d / l));
double tmp;
if (h <= -5.7e-145) {
tmp = t_2 * ((t_0 / Math.sqrt(-h)) * (1.0 + ((h / l) * (Math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else if (h <= -1e-310) {
tmp = t_1 * (Math.sqrt((d / h)) * (t_0 / Math.sqrt(-l)));
} else {
tmp = (t_2 * (Math.sqrt(d) / Math.sqrt(h))) * t_1;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt(-d) t_1 = 1.0 + (0.5 * (-1.0 / (l / (h * math.pow((D / (d * (2.0 / M_m))), 2.0))))) t_2 = math.sqrt((d / l)) tmp = 0 if h <= -5.7e-145: tmp = t_2 * ((t_0 / math.sqrt(-h)) * (1.0 + ((h / l) * (math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5)))) elif h <= -1e-310: tmp = t_1 * (math.sqrt((d / h)) * (t_0 / math.sqrt(-l))) else: tmp = (t_2 * (math.sqrt(d) / math.sqrt(h))) * t_1 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(-d)) t_1 = Float64(1.0 + Float64(0.5 * Float64(-1.0 / Float64(l / Float64(h * (Float64(D / Float64(d * Float64(2.0 / M_m))) ^ 2.0)))))) t_2 = sqrt(Float64(d / l)) tmp = 0.0 if (h <= -5.7e-145) tmp = Float64(t_2 * Float64(Float64(t_0 / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))))); elseif (h <= -1e-310) tmp = Float64(t_1 * Float64(sqrt(Float64(d / h)) * Float64(t_0 / sqrt(Float64(-l))))); else tmp = Float64(Float64(t_2 * Float64(sqrt(d) / sqrt(h))) * t_1); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt(-d);
t_1 = 1.0 + (0.5 * (-1.0 / (l / (h * ((D / (d * (2.0 / M_m))) ^ 2.0)))));
t_2 = sqrt((d / l));
tmp = 0.0;
if (h <= -5.7e-145)
tmp = t_2 * ((t_0 / sqrt(-h)) * (1.0 + ((h / l) * (((D * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))));
elseif (h <= -1e-310)
tmp = t_1 * (sqrt((d / h)) * (t_0 / sqrt(-l)));
else
tmp = (t_2 * (sqrt(d) / sqrt(h))) * t_1;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[(-d)], $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(0.5 * N[(-1.0 / N[(l / N[(h * N[Power[N[(D / N[(d * N[(2.0 / M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -5.7e-145], N[(t$95$2 * N[(N[(t$95$0 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -1e-310], N[(t$95$1 * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(t$95$0 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{-d}\\
t_1 := 1 + 0.5 \cdot \frac{-1}{\frac{\ell}{h \cdot {\left(\frac{D}{d \cdot \frac{2}{M\_m}}\right)}^{2}}}\\
t_2 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;h \leq -5.7 \cdot 10^{-145}:\\
\;\;\;\;t\_2 \cdot \left(\frac{t\_0}{\sqrt{-h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(D \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right)\right)\\
\mathbf{elif}\;h \leq -1 \cdot 10^{-310}:\\
\;\;\;\;t\_1 \cdot \left(\sqrt{\frac{d}{h}} \cdot \frac{t\_0}{\sqrt{-\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_2 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right) \cdot t\_1\\
\end{array}
\end{array}
if h < -5.70000000000000032e-145Initial program 68.6%
Simplified67.9%
frac-2neg71.4%
sqrt-div84.9%
Applied egg-rr79.8%
if -5.70000000000000032e-145 < h < -9.999999999999969e-311Initial program 41.0%
Simplified36.0%
associate-*r/56.0%
clear-num56.0%
frac-times61.0%
*-commutative61.0%
*-un-lft-identity61.0%
times-frac61.0%
*-commutative61.0%
associate-/l/61.0%
times-frac61.0%
*-un-lft-identity61.0%
associate-*r/61.0%
clear-num61.0%
un-div-inv61.0%
div-inv61.0%
clear-num61.0%
Applied egg-rr61.0%
frac-2neg61.0%
sqrt-div81.1%
Applied egg-rr81.1%
if -9.999999999999969e-311 < h Initial program 68.5%
Simplified68.5%
associate-*r/71.6%
clear-num71.6%
frac-times71.6%
*-commutative71.6%
*-un-lft-identity71.6%
times-frac69.9%
*-commutative69.9%
associate-/l/69.9%
times-frac71.6%
*-un-lft-identity71.6%
associate-*r/69.9%
clear-num69.9%
un-div-inv69.9%
div-inv69.8%
clear-num69.8%
Applied egg-rr69.8%
sqrt-div77.1%
div-inv77.1%
Applied egg-rr77.1%
associate-*r/77.1%
*-rgt-identity77.1%
Simplified77.1%
Final simplification78.7%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= h -1.16e-232)
(*
t_0
(*
(/ (sqrt (- d)) (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* D (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(if (<= h 5.2e-217)
(*
(+ 1.0 (* 0.5 (/ -1.0 (/ l (* h (pow (/ D (* d (/ 2.0 M_m))) 2.0))))))
(* t_0 (sqrt (/ d h))))
(*
(* t_0 (* (sqrt d) (/ 1.0 (sqrt h))))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D d)) 2.0)))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt((d / l));
double tmp;
if (h <= -1.16e-232) {
tmp = t_0 * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else if (h <= 5.2e-217) {
tmp = (1.0 + (0.5 * (-1.0 / (l / (h * pow((D / (d * (2.0 / M_m))), 2.0)))))) * (t_0 * sqrt((d / h)));
} else {
tmp = (t_0 * (sqrt(d) * (1.0 / sqrt(h)))) * (1.0 - (0.5 * ((h / l) * pow(((M_m / 2.0) * (D / d)), 2.0))));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((d / l))
if (h <= (-1.16d-232)) then
tmp = t_0 * ((sqrt(-d) / sqrt(-h)) * (1.0d0 + ((h / l) * (((d_1 * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))))
else if (h <= 5.2d-217) then
tmp = (1.0d0 + (0.5d0 * ((-1.0d0) / (l / (h * ((d_1 / (d * (2.0d0 / m_m))) ** 2.0d0)))))) * (t_0 * sqrt((d / h)))
else
tmp = (t_0 * (sqrt(d) * (1.0d0 / sqrt(h)))) * (1.0d0 - (0.5d0 * ((h / l) * (((m_m / 2.0d0) * (d_1 / d)) ** 2.0d0))))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt((d / l));
double tmp;
if (h <= -1.16e-232) {
tmp = t_0 * ((Math.sqrt(-d) / Math.sqrt(-h)) * (1.0 + ((h / l) * (Math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else if (h <= 5.2e-217) {
tmp = (1.0 + (0.5 * (-1.0 / (l / (h * Math.pow((D / (d * (2.0 / M_m))), 2.0)))))) * (t_0 * Math.sqrt((d / h)));
} else {
tmp = (t_0 * (Math.sqrt(d) * (1.0 / Math.sqrt(h)))) * (1.0 - (0.5 * ((h / l) * Math.pow(((M_m / 2.0) * (D / d)), 2.0))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt((d / l)) tmp = 0 if h <= -1.16e-232: tmp = t_0 * ((math.sqrt(-d) / math.sqrt(-h)) * (1.0 + ((h / l) * (math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5)))) elif h <= 5.2e-217: tmp = (1.0 + (0.5 * (-1.0 / (l / (h * math.pow((D / (d * (2.0 / M_m))), 2.0)))))) * (t_0 * math.sqrt((d / h))) else: tmp = (t_0 * (math.sqrt(d) * (1.0 / math.sqrt(h)))) * (1.0 - (0.5 * ((h / l) * math.pow(((M_m / 2.0) * (D / d)), 2.0)))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (h <= -1.16e-232) tmp = Float64(t_0 * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))))); elseif (h <= 5.2e-217) tmp = Float64(Float64(1.0 + Float64(0.5 * Float64(-1.0 / Float64(l / Float64(h * (Float64(D / Float64(d * Float64(2.0 / M_m))) ^ 2.0)))))) * Float64(t_0 * sqrt(Float64(d / h)))); else tmp = Float64(Float64(t_0 * Float64(sqrt(d) * Float64(1.0 / sqrt(h)))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D / d)) ^ 2.0))))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt((d / l));
tmp = 0.0;
if (h <= -1.16e-232)
tmp = t_0 * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (((D * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))));
elseif (h <= 5.2e-217)
tmp = (1.0 + (0.5 * (-1.0 / (l / (h * ((D / (d * (2.0 / M_m))) ^ 2.0)))))) * (t_0 * sqrt((d / h)));
else
tmp = (t_0 * (sqrt(d) * (1.0 / sqrt(h)))) * (1.0 - (0.5 * ((h / l) * (((M_m / 2.0) * (D / d)) ^ 2.0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -1.16e-232], 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 * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 5.2e-217], N[(N[(1.0 + N[(0.5 * N[(-1.0 / N[(l / N[(h * N[Power[N[(D / N[(d * N[(2.0 / M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] * N[(1.0 / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;h \leq -1.16 \cdot 10^{-232}:\\
\;\;\;\;t\_0 \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(D \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right)\right)\\
\mathbf{elif}\;h \leq 5.2 \cdot 10^{-217}:\\
\;\;\;\;\left(1 + 0.5 \cdot \frac{-1}{\frac{\ell}{h \cdot {\left(\frac{D}{d \cdot \frac{2}{M\_m}}\right)}^{2}}}\right) \cdot \left(t\_0 \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_0 \cdot \left(\sqrt{d} \cdot \frac{1}{\sqrt{h}}\right)\right) \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D}{d}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if h < -1.15999999999999993e-232Initial program 66.1%
Simplified65.4%
frac-2neg68.6%
sqrt-div83.1%
Applied egg-rr78.5%
if -1.15999999999999993e-232 < h < 5.19999999999999986e-217Initial program 42.9%
Simplified42.9%
associate-*r/65.5%
clear-num65.5%
frac-times65.5%
*-commutative65.5%
*-un-lft-identity65.5%
times-frac65.5%
*-commutative65.5%
associate-/l/65.5%
times-frac65.5%
*-un-lft-identity65.5%
associate-*r/65.5%
clear-num65.5%
un-div-inv65.5%
div-inv65.5%
clear-num65.5%
Applied egg-rr65.5%
if 5.19999999999999986e-217 < h Initial program 73.3%
Simplified73.3%
sqrt-div79.5%
div-inv79.5%
Applied egg-rr79.2%
Final simplification77.4%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (+ 1.0 (* (/ h l) (* (pow (* D (/ (/ M_m 2.0) d)) 2.0) -0.5))))
(t_1 (sqrt (/ d l))))
(if (<= h -1.16e-232)
(* t_1 (* (/ (sqrt (- d)) (sqrt (- h))) t_0))
(if (<= h 2e-213)
(*
(+ 1.0 (* 0.5 (/ -1.0 (/ l (* h (pow (/ D (* d (/ 2.0 M_m))) 2.0))))))
(* t_1 (sqrt (/ d h))))
(* t_1 (* (/ (sqrt d) (sqrt h)) t_0))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = 1.0 + ((h / l) * (pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5));
double t_1 = sqrt((d / l));
double tmp;
if (h <= -1.16e-232) {
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0);
} else if (h <= 2e-213) {
tmp = (1.0 + (0.5 * (-1.0 / (l / (h * pow((D / (d * (2.0 / M_m))), 2.0)))))) * (t_1 * sqrt((d / h)));
} else {
tmp = t_1 * ((sqrt(d) / sqrt(h)) * t_0);
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 1.0d0 + ((h / l) * (((d_1 * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))
t_1 = sqrt((d / l))
if (h <= (-1.16d-232)) then
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0)
else if (h <= 2d-213) then
tmp = (1.0d0 + (0.5d0 * ((-1.0d0) / (l / (h * ((d_1 / (d * (2.0d0 / m_m))) ** 2.0d0)))))) * (t_1 * sqrt((d / h)))
else
tmp = t_1 * ((sqrt(d) / sqrt(h)) * t_0)
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = 1.0 + ((h / l) * (Math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5));
double t_1 = Math.sqrt((d / l));
double tmp;
if (h <= -1.16e-232) {
tmp = t_1 * ((Math.sqrt(-d) / Math.sqrt(-h)) * t_0);
} else if (h <= 2e-213) {
tmp = (1.0 + (0.5 * (-1.0 / (l / (h * Math.pow((D / (d * (2.0 / M_m))), 2.0)))))) * (t_1 * Math.sqrt((d / h)));
} else {
tmp = t_1 * ((Math.sqrt(d) / Math.sqrt(h)) * t_0);
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = 1.0 + ((h / l) * (math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5)) t_1 = math.sqrt((d / l)) tmp = 0 if h <= -1.16e-232: tmp = t_1 * ((math.sqrt(-d) / math.sqrt(-h)) * t_0) elif h <= 2e-213: tmp = (1.0 + (0.5 * (-1.0 / (l / (h * math.pow((D / (d * (2.0 / M_m))), 2.0)))))) * (t_1 * math.sqrt((d / h))) else: tmp = t_1 * ((math.sqrt(d) / math.sqrt(h)) * t_0) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))) t_1 = sqrt(Float64(d / l)) tmp = 0.0 if (h <= -1.16e-232) tmp = Float64(t_1 * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0)); elseif (h <= 2e-213) tmp = Float64(Float64(1.0 + Float64(0.5 * Float64(-1.0 / Float64(l / Float64(h * (Float64(D / Float64(d * Float64(2.0 / M_m))) ^ 2.0)))))) * Float64(t_1 * sqrt(Float64(d / h)))); else tmp = Float64(t_1 * Float64(Float64(sqrt(d) / sqrt(h)) * t_0)); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = 1.0 + ((h / l) * (((D * ((M_m / 2.0) / d)) ^ 2.0) * -0.5));
t_1 = sqrt((d / l));
tmp = 0.0;
if (h <= -1.16e-232)
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0);
elseif (h <= 2e-213)
tmp = (1.0 + (0.5 * (-1.0 / (l / (h * ((D / (d * (2.0 / M_m))) ^ 2.0)))))) * (t_1 * sqrt((d / h)));
else
tmp = t_1 * ((sqrt(d) / sqrt(h)) * t_0);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -1.16e-232], N[(t$95$1 * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 2e-213], N[(N[(1.0 + N[(0.5 * N[(-1.0 / N[(l / N[(h * N[Power[N[(D / N[(d * N[(2.0 / M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := 1 + \frac{h}{\ell} \cdot \left({\left(D \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\\
t_1 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;h \leq -1.16 \cdot 10^{-232}:\\
\;\;\;\;t\_1 \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\right)\\
\mathbf{elif}\;h \leq 2 \cdot 10^{-213}:\\
\;\;\;\;\left(1 + 0.5 \cdot \frac{-1}{\frac{\ell}{h \cdot {\left(\frac{D}{d \cdot \frac{2}{M\_m}}\right)}^{2}}}\right) \cdot \left(t\_1 \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot t\_0\right)\\
\end{array}
\end{array}
if h < -1.15999999999999993e-232Initial program 66.1%
Simplified65.4%
frac-2neg68.6%
sqrt-div83.1%
Applied egg-rr78.5%
if -1.15999999999999993e-232 < h < 1.9999999999999999e-213Initial program 42.9%
Simplified42.9%
associate-*r/65.5%
clear-num65.5%
frac-times65.5%
*-commutative65.5%
*-un-lft-identity65.5%
times-frac65.5%
*-commutative65.5%
associate-/l/65.5%
times-frac65.5%
*-un-lft-identity65.5%
associate-*r/65.5%
clear-num65.5%
un-div-inv65.5%
div-inv65.5%
clear-num65.5%
Applied egg-rr65.5%
if 1.9999999999999999e-213 < h Initial program 73.3%
Simplified71.3%
sqrt-div79.5%
div-inv79.5%
Applied egg-rr78.1%
associate-*r/79.5%
*-rgt-identity79.5%
Simplified78.0%
Final simplification77.0%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (/ d l)))
(t_1
(+
1.0
(* 0.5 (/ -1.0 (/ l (* h (pow (/ D (* d (/ 2.0 M_m))) 2.0))))))))
(if (<= h -1e-310)
(* t_1 (* (/ (sqrt (- d)) (sqrt (- h))) t_0))
(* (* t_0 (/ (sqrt d) (sqrt h))) t_1))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt((d / l));
double t_1 = 1.0 + (0.5 * (-1.0 / (l / (h * pow((D / (d * (2.0 / M_m))), 2.0)))));
double tmp;
if (h <= -1e-310) {
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0);
} else {
tmp = (t_0 * (sqrt(d) / sqrt(h))) * t_1;
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sqrt((d / l))
t_1 = 1.0d0 + (0.5d0 * ((-1.0d0) / (l / (h * ((d_1 / (d * (2.0d0 / m_m))) ** 2.0d0)))))
if (h <= (-1d-310)) then
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0)
else
tmp = (t_0 * (sqrt(d) / sqrt(h))) * t_1
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt((d / l));
double t_1 = 1.0 + (0.5 * (-1.0 / (l / (h * Math.pow((D / (d * (2.0 / M_m))), 2.0)))));
double tmp;
if (h <= -1e-310) {
tmp = t_1 * ((Math.sqrt(-d) / Math.sqrt(-h)) * t_0);
} else {
tmp = (t_0 * (Math.sqrt(d) / Math.sqrt(h))) * t_1;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt((d / l)) t_1 = 1.0 + (0.5 * (-1.0 / (l / (h * math.pow((D / (d * (2.0 / M_m))), 2.0))))) tmp = 0 if h <= -1e-310: tmp = t_1 * ((math.sqrt(-d) / math.sqrt(-h)) * t_0) else: tmp = (t_0 * (math.sqrt(d) / math.sqrt(h))) * t_1 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(d / l)) t_1 = Float64(1.0 + Float64(0.5 * Float64(-1.0 / Float64(l / Float64(h * (Float64(D / Float64(d * Float64(2.0 / M_m))) ^ 2.0)))))) tmp = 0.0 if (h <= -1e-310) tmp = Float64(t_1 * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0)); else tmp = Float64(Float64(t_0 * Float64(sqrt(d) / sqrt(h))) * t_1); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt((d / l));
t_1 = 1.0 + (0.5 * (-1.0 / (l / (h * ((D / (d * (2.0 / M_m))) ^ 2.0)))));
tmp = 0.0;
if (h <= -1e-310)
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0);
else
tmp = (t_0 * (sqrt(d) / sqrt(h))) * t_1;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(0.5 * N[(-1.0 / N[(l / N[(h * N[Power[N[(D / N[(d * N[(2.0 / M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -1e-310], N[(t$95$1 * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
t_1 := 1 + 0.5 \cdot \frac{-1}{\frac{\ell}{h \cdot {\left(\frac{D}{d \cdot \frac{2}{M\_m}}\right)}^{2}}}\\
\mathbf{if}\;h \leq -1 \cdot 10^{-310}:\\
\;\;\;\;t\_1 \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_0 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right) \cdot t\_1\\
\end{array}
\end{array}
if h < -9.999999999999969e-311Initial program 64.6%
Simplified64.5%
associate-*r/70.4%
clear-num70.5%
frac-times70.5%
*-commutative70.5%
*-un-lft-identity70.5%
times-frac69.9%
*-commutative69.9%
associate-/l/69.9%
times-frac70.5%
*-un-lft-identity70.5%
associate-*r/69.9%
clear-num69.9%
un-div-inv70.5%
div-inv70.5%
clear-num70.5%
Applied egg-rr70.5%
frac-2neg69.9%
sqrt-div83.5%
Applied egg-rr83.3%
if -9.999999999999969e-311 < h Initial program 68.5%
Simplified68.5%
associate-*r/71.6%
clear-num71.6%
frac-times71.6%
*-commutative71.6%
*-un-lft-identity71.6%
times-frac69.9%
*-commutative69.9%
associate-/l/69.9%
times-frac71.6%
*-un-lft-identity71.6%
associate-*r/69.9%
clear-num69.9%
un-div-inv69.9%
div-inv69.8%
clear-num69.8%
Applied egg-rr69.8%
sqrt-div77.1%
div-inv77.1%
Applied egg-rr77.1%
associate-*r/77.1%
*-rgt-identity77.1%
Simplified77.1%
Final simplification80.5%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= h -1.7e-285)
(*
t_0
(*
(/ (sqrt (- d)) (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* D (/ (/ M_m 2.0) d)) 2.0) -0.5)))))
(*
(* t_0 (/ (sqrt d) (sqrt h)))
(+
1.0
(* 0.5 (/ -1.0 (/ l (* h (pow (/ D (* d (/ 2.0 M_m))) 2.0))))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt((d / l));
double tmp;
if (h <= -1.7e-285) {
tmp = t_0 * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else {
tmp = (t_0 * (sqrt(d) / sqrt(h))) * (1.0 + (0.5 * (-1.0 / (l / (h * pow((D / (d * (2.0 / M_m))), 2.0))))));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((d / l))
if (h <= (-1.7d-285)) then
tmp = t_0 * ((sqrt(-d) / sqrt(-h)) * (1.0d0 + ((h / l) * (((d_1 * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))))
else
tmp = (t_0 * (sqrt(d) / sqrt(h))) * (1.0d0 + (0.5d0 * ((-1.0d0) / (l / (h * ((d_1 / (d * (2.0d0 / m_m))) ** 2.0d0))))))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt((d / l));
double tmp;
if (h <= -1.7e-285) {
tmp = t_0 * ((Math.sqrt(-d) / Math.sqrt(-h)) * (1.0 + ((h / l) * (Math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))));
} else {
tmp = (t_0 * (Math.sqrt(d) / Math.sqrt(h))) * (1.0 + (0.5 * (-1.0 / (l / (h * Math.pow((D / (d * (2.0 / M_m))), 2.0))))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt((d / l)) tmp = 0 if h <= -1.7e-285: tmp = t_0 * ((math.sqrt(-d) / math.sqrt(-h)) * (1.0 + ((h / l) * (math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5)))) else: tmp = (t_0 * (math.sqrt(d) / math.sqrt(h))) * (1.0 + (0.5 * (-1.0 / (l / (h * math.pow((D / (d * (2.0 / M_m))), 2.0)))))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (h <= -1.7e-285) tmp = Float64(t_0 * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))))); else tmp = Float64(Float64(t_0 * Float64(sqrt(d) / sqrt(h))) * Float64(1.0 + Float64(0.5 * Float64(-1.0 / Float64(l / Float64(h * (Float64(D / Float64(d * Float64(2.0 / M_m))) ^ 2.0))))))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt((d / l));
tmp = 0.0;
if (h <= -1.7e-285)
tmp = t_0 * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (((D * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))));
else
tmp = (t_0 * (sqrt(d) / sqrt(h))) * (1.0 + (0.5 * (-1.0 / (l / (h * ((D / (d * (2.0 / M_m))) ^ 2.0))))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -1.7e-285], 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 * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(0.5 * N[(-1.0 / N[(l / N[(h * N[Power[N[(D / N[(d * N[(2.0 / M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;h \leq -1.7 \cdot 10^{-285}:\\
\;\;\;\;t\_0 \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(D \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_0 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right) \cdot \left(1 + 0.5 \cdot \frac{-1}{\frac{\ell}{h \cdot {\left(\frac{D}{d \cdot \frac{2}{M\_m}}\right)}^{2}}}\right)\\
\end{array}
\end{array}
if h < -1.7e-285Initial program 65.6%
Simplified64.9%
frac-2neg70.2%
sqrt-div84.0%
Applied egg-rr77.4%
if -1.7e-285 < h Initial program 67.4%
Simplified67.4%
associate-*r/71.2%
clear-num71.2%
frac-times71.2%
*-commutative71.2%
*-un-lft-identity71.2%
times-frac69.5%
*-commutative69.5%
associate-/l/69.5%
times-frac71.2%
*-un-lft-identity71.2%
associate-*r/69.5%
clear-num69.5%
un-div-inv69.5%
div-inv69.5%
clear-num69.5%
Applied egg-rr69.5%
sqrt-div75.8%
div-inv75.8%
Applied egg-rr75.8%
associate-*r/75.8%
*-rgt-identity75.8%
Simplified75.8%
Final simplification76.7%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (* (* (sqrt (/ d l)) (fma h (* (/ -0.125 l) (pow (* D (/ M_m d)) 2.0)) 1.0)) (sqrt (/ d h))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
return (sqrt((d / l)) * fma(h, ((-0.125 / l) * pow((D * (M_m / d)), 2.0)), 1.0)) * sqrt((d / h));
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) return Float64(Float64(sqrt(Float64(d / l)) * fma(h, Float64(Float64(-0.125 / l) * (Float64(D * Float64(M_m / d)) ^ 2.0)), 1.0)) * sqrt(Float64(d / h))) end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(h * N[(N[(-0.125 / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\left(\sqrt{\frac{d}{\ell}} \cdot \mathsf{fma}\left(h, \frac{-0.125}{\ell} \cdot {\left(D \cdot \frac{M\_m}{d}\right)}^{2}, 1\right)\right) \cdot \sqrt{\frac{d}{h}}
\end{array}
Initial program 66.4%
Simplified66.3%
Taylor expanded in M around 0 42.9%
Simplified70.3%
Final simplification70.3%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (/ d h))) (t_1 (sqrt (/ d l))))
(if (<= (* D M_m) 5e-279)
(* t_1 t_0)
(if (<= (* D M_m) 2e+179)
(*
t_1
(* t_0 (+ 1.0 (* (/ h l) (* -0.5 (pow (/ (/ (* D M_m) d) 2.0) 2.0))))))
(* t_0 (* t_1 (* h (* (/ -0.125 l) (pow (* D (/ M_m d)) 2.0)))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt((d / h));
double t_1 = sqrt((d / l));
double tmp;
if ((D * M_m) <= 5e-279) {
tmp = t_1 * t_0;
} else if ((D * M_m) <= 2e+179) {
tmp = t_1 * (t_0 * (1.0 + ((h / l) * (-0.5 * pow((((D * M_m) / d) / 2.0), 2.0)))));
} else {
tmp = t_0 * (t_1 * (h * ((-0.125 / l) * pow((D * (M_m / d)), 2.0))));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sqrt((d / h))
t_1 = sqrt((d / l))
if ((d_1 * m_m) <= 5d-279) then
tmp = t_1 * t_0
else if ((d_1 * m_m) <= 2d+179) then
tmp = t_1 * (t_0 * (1.0d0 + ((h / l) * ((-0.5d0) * ((((d_1 * m_m) / d) / 2.0d0) ** 2.0d0)))))
else
tmp = t_0 * (t_1 * (h * (((-0.125d0) / l) * ((d_1 * (m_m / d)) ** 2.0d0))))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt((d / h));
double t_1 = Math.sqrt((d / l));
double tmp;
if ((D * M_m) <= 5e-279) {
tmp = t_1 * t_0;
} else if ((D * M_m) <= 2e+179) {
tmp = t_1 * (t_0 * (1.0 + ((h / l) * (-0.5 * Math.pow((((D * M_m) / d) / 2.0), 2.0)))));
} else {
tmp = t_0 * (t_1 * (h * ((-0.125 / l) * Math.pow((D * (M_m / d)), 2.0))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt((d / h)) t_1 = math.sqrt((d / l)) tmp = 0 if (D * M_m) <= 5e-279: tmp = t_1 * t_0 elif (D * M_m) <= 2e+179: tmp = t_1 * (t_0 * (1.0 + ((h / l) * (-0.5 * math.pow((((D * M_m) / d) / 2.0), 2.0))))) else: tmp = t_0 * (t_1 * (h * ((-0.125 / l) * math.pow((D * (M_m / d)), 2.0)))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(d / h)) t_1 = sqrt(Float64(d / l)) tmp = 0.0 if (Float64(D * M_m) <= 5e-279) tmp = Float64(t_1 * t_0); elseif (Float64(D * M_m) <= 2e+179) tmp = Float64(t_1 * Float64(t_0 * Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(Float64(Float64(D * M_m) / d) / 2.0) ^ 2.0)))))); else tmp = Float64(t_0 * Float64(t_1 * Float64(h * Float64(Float64(-0.125 / l) * (Float64(D * Float64(M_m / d)) ^ 2.0))))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt((d / h));
t_1 = sqrt((d / l));
tmp = 0.0;
if ((D * M_m) <= 5e-279)
tmp = t_1 * t_0;
elseif ((D * M_m) <= 2e+179)
tmp = t_1 * (t_0 * (1.0 + ((h / l) * (-0.5 * ((((D * M_m) / d) / 2.0) ^ 2.0)))));
else
tmp = t_0 * (t_1 * (h * ((-0.125 / l) * ((D * (M_m / d)) ^ 2.0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(D * M$95$m), $MachinePrecision], 5e-279], N[(t$95$1 * t$95$0), $MachinePrecision], If[LessEqual[N[(D * M$95$m), $MachinePrecision], 2e+179], N[(t$95$1 * N[(t$95$0 * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(N[(N[(D * M$95$m), $MachinePrecision] / d), $MachinePrecision] / 2.0), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(t$95$1 * N[(h * N[(N[(-0.125 / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{h}}\\
t_1 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;D \cdot M\_m \leq 5 \cdot 10^{-279}:\\
\;\;\;\;t\_1 \cdot t\_0\\
\mathbf{elif}\;D \cdot M\_m \leq 2 \cdot 10^{+179}:\\
\;\;\;\;t\_1 \cdot \left(t\_0 \cdot \left(1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(\frac{\frac{D \cdot M\_m}{d}}{2}\right)}^{2}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(t\_1 \cdot \left(h \cdot \left(\frac{-0.125}{\ell} \cdot {\left(D \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 M D) < 4.99999999999999969e-279Initial program 64.3%
Simplified65.0%
Taylor expanded in M around 0 40.6%
if 4.99999999999999969e-279 < (*.f64 M D) < 1.99999999999999996e179Initial program 69.3%
Simplified66.7%
associate-*r/69.3%
*-un-lft-identity69.3%
times-frac66.7%
associate-/l/66.7%
*-commutative66.7%
times-frac69.3%
*-commutative69.3%
*-un-lft-identity69.3%
frac-times67.7%
associate-*l/67.7%
associate-*r/69.3%
Applied egg-rr69.3%
if 1.99999999999999996e179 < (*.f64 M D) Initial program 68.5%
Simplified68.7%
Taylor expanded in M around inf 51.3%
Simplified80.7%
Final simplification55.2%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (/ d l))) (t_1 (sqrt (/ d h))))
(if (<= M_m 1.2e-121)
(* t_0 (/ 1.0 (sqrt (/ h d))))
(if (<= M_m 1.24e-76)
(/ d (* (sqrt h) (sqrt l)))
(if (<= M_m 1.7e-55)
(* t_1 (/ 1.0 (sqrt (/ l d))))
(* t_1 (* t_0 (* h (* (/ -0.125 l) (pow (* D (/ M_m d)) 2.0))))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt((d / l));
double t_1 = sqrt((d / h));
double tmp;
if (M_m <= 1.2e-121) {
tmp = t_0 * (1.0 / sqrt((h / d)));
} else if (M_m <= 1.24e-76) {
tmp = d / (sqrt(h) * sqrt(l));
} else if (M_m <= 1.7e-55) {
tmp = t_1 * (1.0 / sqrt((l / d)));
} else {
tmp = t_1 * (t_0 * (h * ((-0.125 / l) * pow((D * (M_m / d)), 2.0))));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sqrt((d / l))
t_1 = sqrt((d / h))
if (m_m <= 1.2d-121) then
tmp = t_0 * (1.0d0 / sqrt((h / d)))
else if (m_m <= 1.24d-76) then
tmp = d / (sqrt(h) * sqrt(l))
else if (m_m <= 1.7d-55) then
tmp = t_1 * (1.0d0 / sqrt((l / d)))
else
tmp = t_1 * (t_0 * (h * (((-0.125d0) / l) * ((d_1 * (m_m / d)) ** 2.0d0))))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt((d / l));
double t_1 = Math.sqrt((d / h));
double tmp;
if (M_m <= 1.2e-121) {
tmp = t_0 * (1.0 / Math.sqrt((h / d)));
} else if (M_m <= 1.24e-76) {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
} else if (M_m <= 1.7e-55) {
tmp = t_1 * (1.0 / Math.sqrt((l / d)));
} else {
tmp = t_1 * (t_0 * (h * ((-0.125 / l) * Math.pow((D * (M_m / d)), 2.0))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt((d / l)) t_1 = math.sqrt((d / h)) tmp = 0 if M_m <= 1.2e-121: tmp = t_0 * (1.0 / math.sqrt((h / d))) elif M_m <= 1.24e-76: tmp = d / (math.sqrt(h) * math.sqrt(l)) elif M_m <= 1.7e-55: tmp = t_1 * (1.0 / math.sqrt((l / d))) else: tmp = t_1 * (t_0 * (h * ((-0.125 / l) * math.pow((D * (M_m / d)), 2.0)))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(d / l)) t_1 = sqrt(Float64(d / h)) tmp = 0.0 if (M_m <= 1.2e-121) tmp = Float64(t_0 * Float64(1.0 / sqrt(Float64(h / d)))); elseif (M_m <= 1.24e-76) tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); elseif (M_m <= 1.7e-55) tmp = Float64(t_1 * Float64(1.0 / sqrt(Float64(l / d)))); else tmp = Float64(t_1 * Float64(t_0 * Float64(h * Float64(Float64(-0.125 / l) * (Float64(D * Float64(M_m / d)) ^ 2.0))))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt((d / l));
t_1 = sqrt((d / h));
tmp = 0.0;
if (M_m <= 1.2e-121)
tmp = t_0 * (1.0 / sqrt((h / d)));
elseif (M_m <= 1.24e-76)
tmp = d / (sqrt(h) * sqrt(l));
elseif (M_m <= 1.7e-55)
tmp = t_1 * (1.0 / sqrt((l / d)));
else
tmp = t_1 * (t_0 * (h * ((-0.125 / l) * ((D * (M_m / d)) ^ 2.0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[M$95$m, 1.2e-121], N[(t$95$0 * N[(1.0 / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[M$95$m, 1.24e-76], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[M$95$m, 1.7e-55], N[(t$95$1 * N[(1.0 / N[Sqrt[N[(l / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(t$95$0 * N[(h * N[(N[(-0.125 / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
t_1 := \sqrt{\frac{d}{h}}\\
\mathbf{if}\;M\_m \leq 1.2 \cdot 10^{-121}:\\
\;\;\;\;t\_0 \cdot \frac{1}{\sqrt{\frac{h}{d}}}\\
\mathbf{elif}\;M\_m \leq 1.24 \cdot 10^{-76}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\mathbf{elif}\;M\_m \leq 1.7 \cdot 10^{-55}:\\
\;\;\;\;t\_1 \cdot \frac{1}{\sqrt{\frac{\ell}{d}}}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left(t\_0 \cdot \left(h \cdot \left(\frac{-0.125}{\ell} \cdot {\left(D \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\right)\\
\end{array}
\end{array}
if M < 1.20000000000000002e-121Initial program 70.2%
Simplified69.5%
Taylor expanded in M around 0 43.8%
clear-num43.7%
sqrt-div44.2%
metadata-eval44.2%
Applied egg-rr44.2%
if 1.20000000000000002e-121 < M < 1.24000000000000003e-76Initial program 33.6%
Simplified33.6%
Taylor expanded in M around 0 24.5%
*-commutative24.5%
*-rgt-identity24.5%
sqrt-div41.0%
sqrt-div59.9%
frac-times60.1%
add-sqr-sqrt60.1%
Applied egg-rr60.1%
if 1.24000000000000003e-76 < M < 1.69999999999999986e-55Initial program 58.2%
Simplified58.2%
Taylor expanded in M around 0 58.3%
clear-num58.3%
sqrt-div58.1%
metadata-eval58.1%
Applied egg-rr58.1%
if 1.69999999999999986e-55 < M Initial program 63.2%
Simplified64.5%
Taylor expanded in M around inf 35.4%
Simplified50.1%
Final simplification46.9%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l 3.8e+254)
(*
(+ 1.0 (* 0.5 (/ -1.0 (/ l (* h (pow (/ D (* d (/ 2.0 M_m))) 2.0))))))
(* (sqrt (/ d l)) (sqrt (/ d h))))
(/ d (* (sqrt h) (sqrt l)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 3.8e+254) {
tmp = (1.0 + (0.5 * (-1.0 / (l / (h * pow((D / (d * (2.0 / M_m))), 2.0)))))) * (sqrt((d / l)) * sqrt((d / h)));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (l <= 3.8d+254) then
tmp = (1.0d0 + (0.5d0 * ((-1.0d0) / (l / (h * ((d_1 / (d * (2.0d0 / m_m))) ** 2.0d0)))))) * (sqrt((d / l)) * sqrt((d / h)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 3.8e+254) {
tmp = (1.0 + (0.5 * (-1.0 / (l / (h * Math.pow((D / (d * (2.0 / M_m))), 2.0)))))) * (Math.sqrt((d / l)) * Math.sqrt((d / h)));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= 3.8e+254: tmp = (1.0 + (0.5 * (-1.0 / (l / (h * math.pow((D / (d * (2.0 / M_m))), 2.0)))))) * (math.sqrt((d / l)) * math.sqrt((d / h))) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= 3.8e+254) tmp = Float64(Float64(1.0 + Float64(0.5 * Float64(-1.0 / Float64(l / Float64(h * (Float64(D / Float64(d * Float64(2.0 / M_m))) ^ 2.0)))))) * Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h)))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= 3.8e+254)
tmp = (1.0 + (0.5 * (-1.0 / (l / (h * ((D / (d * (2.0 / M_m))) ^ 2.0)))))) * (sqrt((d / l)) * sqrt((d / h)));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, 3.8e+254], N[(N[(1.0 + N[(0.5 * N[(-1.0 / N[(l / N[(h * N[Power[N[(D / N[(d * N[(2.0 / M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $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, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3.8 \cdot 10^{+254}:\\
\;\;\;\;\left(1 + 0.5 \cdot \frac{-1}{\frac{\ell}{h \cdot {\left(\frac{D}{d \cdot \frac{2}{M\_m}}\right)}^{2}}}\right) \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < 3.80000000000000002e254Initial program 67.7%
Simplified67.6%
associate-*r/72.4%
clear-num72.4%
frac-times72.5%
*-commutative72.5%
*-un-lft-identity72.5%
times-frac71.3%
*-commutative71.3%
associate-/l/71.3%
times-frac72.5%
*-un-lft-identity72.5%
associate-*r/71.3%
clear-num71.3%
un-div-inv71.6%
div-inv71.6%
clear-num71.6%
Applied egg-rr71.6%
if 3.80000000000000002e254 < l Initial program 38.6%
Simplified38.6%
Taylor expanded in M around 0 39.2%
*-commutative39.2%
*-rgt-identity39.2%
sqrt-div64.8%
sqrt-div90.1%
frac-times90.1%
add-sqr-sqrt90.3%
Applied egg-rr90.3%
Final simplification72.4%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= d 2.8e+186)
(*
(sqrt (/ d l))
(*
(+ 1.0 (* (/ h l) (* (pow (* D (/ (/ M_m 2.0) d)) 2.0) -0.5)))
(sqrt (/ d h))))
(/ d (* (sqrt h) (sqrt l)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= 2.8e+186) {
tmp = sqrt((d / l)) * ((1.0 + ((h / l) * (pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))) * sqrt((d / h)));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (d <= 2.8d+186) then
tmp = sqrt((d / l)) * ((1.0d0 + ((h / l) * (((d_1 * ((m_m / 2.0d0) / d)) ** 2.0d0) * (-0.5d0)))) * sqrt((d / h)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= 2.8e+186) {
tmp = Math.sqrt((d / l)) * ((1.0 + ((h / l) * (Math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))) * Math.sqrt((d / h)));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if d <= 2.8e+186: tmp = math.sqrt((d / l)) * ((1.0 + ((h / l) * (math.pow((D * ((M_m / 2.0) / d)), 2.0) * -0.5))) * math.sqrt((d / h))) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (d <= 2.8e+186) tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(D * Float64(Float64(M_m / 2.0) / d)) ^ 2.0) * -0.5))) * sqrt(Float64(d / h)))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (d <= 2.8e+186)
tmp = sqrt((d / l)) * ((1.0 + ((h / l) * (((D * ((M_m / 2.0) / d)) ^ 2.0) * -0.5))) * sqrt((d / h)));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[d, 2.8e+186], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(D * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $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, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq 2.8 \cdot 10^{+186}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\left(1 + \frac{h}{\ell} \cdot \left({\left(D \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2} \cdot -0.5\right)\right) \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < 2.80000000000000018e186Initial program 67.6%
Simplified66.8%
if 2.80000000000000018e186 < d Initial program 53.4%
Simplified53.4%
Taylor expanded in M around 0 45.5%
*-commutative45.5%
*-rgt-identity45.5%
sqrt-div62.8%
sqrt-div80.5%
frac-times80.1%
add-sqr-sqrt80.6%
Applied egg-rr80.6%
Final simplification67.9%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (<= d -4e-310) (* (/ (sqrt (- d)) (sqrt (- h))) (sqrt (/ d l))) (/ d (* (sqrt h) (sqrt l)))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= -4e-310) {
tmp = (sqrt(-d) / sqrt(-h)) * sqrt((d / l));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (d <= (-4d-310)) then
tmp = (sqrt(-d) / sqrt(-h)) * sqrt((d / l))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= -4e-310) {
tmp = (Math.sqrt(-d) / Math.sqrt(-h)) * Math.sqrt((d / l));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if d <= -4e-310: tmp = (math.sqrt(-d) / math.sqrt(-h)) * math.sqrt((d / l)) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (d <= -4e-310) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * sqrt(Float64(d / l))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (d <= -4e-310)
tmp = (sqrt(-d) / sqrt(-h)) * sqrt((d / l));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[d, -4e-310], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / 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, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \sqrt{\frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -3.999999999999988e-310Initial program 64.6%
Simplified64.5%
Taylor expanded in M around 0 42.2%
frac-2neg69.9%
sqrt-div83.5%
Applied egg-rr49.2%
if -3.999999999999988e-310 < d Initial program 68.5%
Simplified68.5%
Taylor expanded in M around 0 32.0%
*-commutative32.0%
*-rgt-identity32.0%
sqrt-div40.3%
sqrt-div45.0%
frac-times44.9%
add-sqr-sqrt45.1%
Applied egg-rr45.1%
Final simplification47.3%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (<= d 3.6e-229) (* (- d) (sqrt (/ (/ 1.0 l) h))) (/ d (* (sqrt h) (sqrt l)))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= 3.6e-229) {
tmp = -d * sqrt(((1.0 / l) / h));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (d <= 3.6d-229) then
tmp = -d * sqrt(((1.0d0 / l) / h))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= 3.6e-229) {
tmp = -d * Math.sqrt(((1.0 / l) / h));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if d <= 3.6e-229: tmp = -d * math.sqrt(((1.0 / l) / h)) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (d <= 3.6e-229) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (d <= 3.6e-229)
tmp = -d * sqrt(((1.0 / l) / h));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[d, 3.6e-229], N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $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, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq 3.6 \cdot 10^{-229}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < 3.60000000000000003e-229Initial program 64.4%
Simplified64.3%
Taylor expanded in M around 0 39.5%
Taylor expanded in h around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt43.1%
neg-mul-143.1%
*-commutative43.1%
associate-/r*43.7%
Simplified43.7%
if 3.60000000000000003e-229 < d Initial program 69.6%
Simplified69.5%
Taylor expanded in M around 0 34.4%
*-commutative34.4%
*-rgt-identity34.4%
sqrt-div42.3%
sqrt-div47.9%
frac-times47.8%
add-sqr-sqrt48.0%
Applied egg-rr48.0%
Final simplification45.3%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (let* ((t_0 (sqrt (/ (/ 1.0 l) h)))) (if (<= d 2.8e-200) (* (- d) t_0) (* d t_0))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt(((1.0 / l) / h));
double tmp;
if (d <= 2.8e-200) {
tmp = -d * t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(((1.0d0 / l) / h))
if (d <= 2.8d-200) then
tmp = -d * t_0
else
tmp = d * t_0
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt(((1.0 / l) / h));
double tmp;
if (d <= 2.8e-200) {
tmp = -d * t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt(((1.0 / l) / h)) tmp = 0 if d <= 2.8e-200: tmp = -d * t_0 else: tmp = d * t_0 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(Float64(1.0 / l) / h)) tmp = 0.0 if (d <= 2.8e-200) tmp = Float64(Float64(-d) * t_0); else tmp = Float64(d * t_0); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt(((1.0 / l) / h));
tmp = 0.0;
if (d <= 2.8e-200)
tmp = -d * t_0;
else
tmp = d * t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, 2.8e-200], N[((-d) * t$95$0), $MachinePrecision], N[(d * t$95$0), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{if}\;d \leq 2.8 \cdot 10^{-200}:\\
\;\;\;\;\left(-d\right) \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if d < 2.80000000000000007e-200Initial program 64.6%
Simplified64.4%
Taylor expanded in M around 0 38.7%
Taylor expanded in h around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt41.6%
neg-mul-141.6%
*-commutative41.6%
associate-/r*42.2%
Simplified42.2%
if 2.80000000000000007e-200 < d Initial program 69.6%
Simplified69.6%
Taylor expanded in M around 0 35.4%
Taylor expanded in d around 0 43.2%
*-commutative43.2%
associate-/r*43.6%
Simplified43.6%
Final simplification42.7%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (<= d -6.6e-112) (sqrt (* (/ d l) (/ d h))) (* d (sqrt (/ 1.0 (* h l))))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= -6.6e-112) {
tmp = sqrt(((d / l) * (d / h)));
} else {
tmp = d * sqrt((1.0 / (h * l)));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (d <= (-6.6d-112)) then
tmp = sqrt(((d / l) * (d / h)))
else
tmp = d * sqrt((1.0d0 / (h * l)))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= -6.6e-112) {
tmp = Math.sqrt(((d / l) * (d / h)));
} else {
tmp = d * Math.sqrt((1.0 / (h * l)));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if d <= -6.6e-112: tmp = math.sqrt(((d / l) * (d / h))) else: tmp = d * math.sqrt((1.0 / (h * l))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (d <= -6.6e-112) tmp = sqrt(Float64(Float64(d / l) * Float64(d / h))); else tmp = Float64(d * sqrt(Float64(1.0 / Float64(h * l)))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (d <= -6.6e-112)
tmp = sqrt(((d / l) * (d / h)));
else
tmp = d * sqrt((1.0 / (h * l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[d, -6.6e-112], N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -6.6 \cdot 10^{-112}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\end{array}
\end{array}
if d < -6.6000000000000002e-112Initial program 73.9%
Simplified73.9%
Taylor expanded in M around 0 53.3%
*-rgt-identity53.3%
pow1/253.3%
pow1/253.3%
pow-prod-down42.2%
Applied egg-rr42.2%
unpow1/242.2%
*-commutative42.2%
Simplified42.2%
if -6.6000000000000002e-112 < d Initial program 61.5%
Simplified61.4%
Taylor expanded in M around 0 27.2%
Taylor expanded in d around 0 32.8%
*-commutative32.8%
Simplified32.8%
Final simplification36.5%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (<= d -6.6e-112) (sqrt (* (/ d l) (/ d h))) (* d (sqrt (/ (/ 1.0 l) h)))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= -6.6e-112) {
tmp = sqrt(((d / l) * (d / h)));
} else {
tmp = d * sqrt(((1.0 / l) / h));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (d <= (-6.6d-112)) then
tmp = sqrt(((d / l) * (d / h)))
else
tmp = d * sqrt(((1.0d0 / l) / h))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (d <= -6.6e-112) {
tmp = Math.sqrt(((d / l) * (d / h)));
} else {
tmp = d * Math.sqrt(((1.0 / l) / h));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if d <= -6.6e-112: tmp = math.sqrt(((d / l) * (d / h))) else: tmp = d * math.sqrt(((1.0 / l) / h)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (d <= -6.6e-112) tmp = sqrt(Float64(Float64(d / l) * Float64(d / h))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / l) / h))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (d <= -6.6e-112)
tmp = sqrt(((d / l) * (d / h)));
else
tmp = d * sqrt(((1.0 / l) / h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[d, -6.6e-112], N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -6.6 \cdot 10^{-112}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\end{array}
\end{array}
if d < -6.6000000000000002e-112Initial program 73.9%
Simplified73.9%
Taylor expanded in M around 0 53.3%
*-rgt-identity53.3%
pow1/253.3%
pow1/253.3%
pow-prod-down42.2%
Applied egg-rr42.2%
unpow1/242.2%
*-commutative42.2%
Simplified42.2%
if -6.6000000000000002e-112 < d Initial program 61.5%
Simplified61.4%
Taylor expanded in M around 0 27.2%
Taylor expanded in d around 0 32.8%
*-commutative32.8%
associate-/r*33.0%
Simplified33.0%
Final simplification36.7%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (sqrt (* (/ d l) (/ d h))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
return sqrt(((d / l) * (d / h)));
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
code = sqrt(((d / l) * (d / h)))
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
return Math.sqrt(((d / l) * (d / h)));
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): return math.sqrt(((d / l) * (d / h)))
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) return sqrt(Float64(Float64(d / l) * Float64(d / h))) end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp = code(d, h, l, M_m, D)
tmp = sqrt(((d / l) * (d / h)));
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}
\end{array}
Initial program 66.4%
Simplified66.3%
Taylor expanded in M around 0 37.5%
*-rgt-identity37.5%
pow1/237.5%
pow1/237.5%
pow-prod-down30.8%
Applied egg-rr30.8%
unpow1/230.8%
*-commutative30.8%
Simplified30.8%
Final simplification30.8%
herbie shell --seed 2024112
(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)))))