
(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 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (d h l M D) :precision binary64 (* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))
double code(double d, double h, double l, double M, double D) {
return (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
real(8) function code(d, h, l, m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (- d)))
(t_1 (* D_m (* 0.5 (/ M_m d))))
(t_2 (+ 1.0 (* h (* (/ t_1 l) (/ t_1 -2.0)))))
(t_3 (* t_2 (sqrt (/ d l)))))
(if (<= l -2.1e+150)
(* (sqrt (/ d h)) (* (/ t_0 (sqrt (- l))) t_2))
(if (<= l -1e-310)
(* (/ t_0 (sqrt (- h))) t_3)
(* t_3 (* (sqrt d) (sqrt (/ 1.0 h))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt(-d);
double t_1 = D_m * (0.5 * (M_m / d));
double t_2 = 1.0 + (h * ((t_1 / l) * (t_1 / -2.0)));
double t_3 = t_2 * sqrt((d / l));
double tmp;
if (l <= -2.1e+150) {
tmp = sqrt((d / h)) * ((t_0 / sqrt(-l)) * t_2);
} else if (l <= -1e-310) {
tmp = (t_0 / sqrt(-h)) * t_3;
} else {
tmp = t_3 * (sqrt(d) * sqrt((1.0 / h)));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_0 = sqrt(-d)
t_1 = d_m * (0.5d0 * (m_m / d))
t_2 = 1.0d0 + (h * ((t_1 / l) * (t_1 / (-2.0d0))))
t_3 = t_2 * sqrt((d / l))
if (l <= (-2.1d+150)) then
tmp = sqrt((d / h)) * ((t_0 / sqrt(-l)) * t_2)
else if (l <= (-1d-310)) then
tmp = (t_0 / sqrt(-h)) * t_3
else
tmp = t_3 * (sqrt(d) * sqrt((1.0d0 / h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt(-d);
double t_1 = D_m * (0.5 * (M_m / d));
double t_2 = 1.0 + (h * ((t_1 / l) * (t_1 / -2.0)));
double t_3 = t_2 * Math.sqrt((d / l));
double tmp;
if (l <= -2.1e+150) {
tmp = Math.sqrt((d / h)) * ((t_0 / Math.sqrt(-l)) * t_2);
} else if (l <= -1e-310) {
tmp = (t_0 / Math.sqrt(-h)) * t_3;
} else {
tmp = t_3 * (Math.sqrt(d) * Math.sqrt((1.0 / h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt(-d) t_1 = D_m * (0.5 * (M_m / d)) t_2 = 1.0 + (h * ((t_1 / l) * (t_1 / -2.0))) t_3 = t_2 * math.sqrt((d / l)) tmp = 0 if l <= -2.1e+150: tmp = math.sqrt((d / h)) * ((t_0 / math.sqrt(-l)) * t_2) elif l <= -1e-310: tmp = (t_0 / math.sqrt(-h)) * t_3 else: tmp = t_3 * (math.sqrt(d) * math.sqrt((1.0 / h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(-d)) t_1 = Float64(D_m * Float64(0.5 * Float64(M_m / d))) t_2 = Float64(1.0 + Float64(h * Float64(Float64(t_1 / l) * Float64(t_1 / -2.0)))) t_3 = Float64(t_2 * sqrt(Float64(d / l))) tmp = 0.0 if (l <= -2.1e+150) tmp = Float64(sqrt(Float64(d / h)) * Float64(Float64(t_0 / sqrt(Float64(-l))) * t_2)); elseif (l <= -1e-310) tmp = Float64(Float64(t_0 / sqrt(Float64(-h))) * t_3); else tmp = Float64(t_3 * Float64(sqrt(d) * sqrt(Float64(1.0 / h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt(-d);
t_1 = D_m * (0.5 * (M_m / d));
t_2 = 1.0 + (h * ((t_1 / l) * (t_1 / -2.0)));
t_3 = t_2 * sqrt((d / l));
tmp = 0.0;
if (l <= -2.1e+150)
tmp = sqrt((d / h)) * ((t_0 / sqrt(-l)) * t_2);
elseif (l <= -1e-310)
tmp = (t_0 / sqrt(-h)) * t_3;
else
tmp = t_3 * (sqrt(d) * sqrt((1.0 / h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[(-d)], $MachinePrecision]}, Block[{t$95$1 = N[(D$95$m * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(1.0 + N[(h * N[(N[(t$95$1 / l), $MachinePrecision] * N[(t$95$1 / -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -2.1e+150], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(t$95$0 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -1e-310], N[(N[(t$95$0 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$3), $MachinePrecision], N[(t$95$3 * N[(N[Sqrt[d], $MachinePrecision] * N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{-d}\\
t_1 := D\_m \cdot \left(0.5 \cdot \frac{M\_m}{d}\right)\\
t_2 := 1 + h \cdot \left(\frac{t\_1}{\ell} \cdot \frac{t\_1}{-2}\right)\\
t_3 := t\_2 \cdot \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;\ell \leq -2.1 \cdot 10^{+150}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\frac{t\_0}{\sqrt{-\ell}} \cdot t\_2\right)\\
\mathbf{elif}\;\ell \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\frac{t\_0}{\sqrt{-h}} \cdot t\_3\\
\mathbf{else}:\\
\;\;\;\;t\_3 \cdot \left(\sqrt{d} \cdot \sqrt{\frac{1}{h}}\right)\\
\end{array}
\end{array}
if l < -2.09999999999999998e150Initial program 60.5%
Simplified63.1%
expm1-log1p-u55.0%
expm1-udef55.0%
Applied egg-rr55.0%
expm1-def55.0%
expm1-log1p63.1%
associate-*l/60.4%
*-commutative60.4%
associate-*l/63.1%
*-commutative63.1%
associate-/l*63.1%
Simplified60.5%
unpow260.5%
div-inv60.5%
times-frac60.6%
associate-*r/60.6%
*-commutative60.6%
*-un-lft-identity60.6%
times-frac60.6%
metadata-eval60.6%
associate-*r/60.6%
*-commutative60.6%
*-un-lft-identity60.6%
times-frac60.6%
metadata-eval60.6%
metadata-eval60.6%
Applied egg-rr60.6%
frac-2neg60.6%
sqrt-div83.8%
Applied egg-rr83.8%
if -2.09999999999999998e150 < l < -9.999999999999969e-311Initial program 73.5%
Simplified73.5%
expm1-log1p-u39.3%
expm1-udef39.3%
Applied egg-rr39.3%
expm1-def39.3%
expm1-log1p73.5%
associate-*l/75.5%
*-commutative75.5%
associate-*l/75.6%
*-commutative75.6%
associate-/l*75.6%
Simplified74.7%
unpow274.7%
div-inv74.7%
times-frac75.6%
associate-*r/75.6%
*-commutative75.6%
*-un-lft-identity75.6%
times-frac75.6%
metadata-eval75.6%
associate-*r/75.6%
*-commutative75.6%
*-un-lft-identity75.6%
times-frac75.6%
metadata-eval75.6%
metadata-eval75.6%
Applied egg-rr75.6%
frac-2neg75.6%
sqrt-div87.2%
Applied egg-rr87.2%
if -9.999999999999969e-311 < l Initial program 63.8%
Simplified63.8%
expm1-log1p-u38.6%
expm1-udef38.6%
Applied egg-rr38.6%
expm1-def38.6%
expm1-log1p63.8%
associate-*l/67.7%
*-commutative67.7%
associate-*l/68.5%
*-commutative68.5%
associate-/l*68.5%
Simplified67.6%
unpow267.6%
div-inv67.6%
times-frac68.6%
associate-*r/68.6%
*-commutative68.6%
*-un-lft-identity68.6%
times-frac68.6%
metadata-eval68.6%
associate-*r/68.6%
*-commutative68.6%
*-un-lft-identity68.6%
times-frac68.6%
metadata-eval68.6%
metadata-eval68.6%
Applied egg-rr68.6%
pow1/268.6%
metadata-eval68.6%
div-inv68.6%
unpow-prod-down80.4%
metadata-eval80.4%
pow1/280.4%
metadata-eval80.4%
Applied egg-rr80.4%
unpow1/280.4%
Simplified80.4%
Final simplification83.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (* D_m (* 0.5 (/ M_m d))))
(t_1 (+ 1.0 (* h (* (/ t_0 l) (/ t_0 -2.0))))))
(if (<= h -5e-310)
(* (sqrt (/ d h)) (* (/ (sqrt (- d)) (sqrt (- l))) t_1))
(* (* t_1 (sqrt (/ d l))) (/ (sqrt d) (sqrt h))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = D_m * (0.5 * (M_m / d));
double t_1 = 1.0 + (h * ((t_0 / l) * (t_0 / -2.0)));
double tmp;
if (h <= -5e-310) {
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * t_1);
} else {
tmp = (t_1 * sqrt((d / l))) * (sqrt(d) / sqrt(h));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = d_m * (0.5d0 * (m_m / d))
t_1 = 1.0d0 + (h * ((t_0 / l) * (t_0 / (-2.0d0))))
if (h <= (-5d-310)) then
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * t_1)
else
tmp = (t_1 * sqrt((d / l))) * (sqrt(d) / sqrt(h))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = D_m * (0.5 * (M_m / d));
double t_1 = 1.0 + (h * ((t_0 / l) * (t_0 / -2.0)));
double tmp;
if (h <= -5e-310) {
tmp = Math.sqrt((d / h)) * ((Math.sqrt(-d) / Math.sqrt(-l)) * t_1);
} else {
tmp = (t_1 * Math.sqrt((d / l))) * (Math.sqrt(d) / Math.sqrt(h));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = D_m * (0.5 * (M_m / d)) t_1 = 1.0 + (h * ((t_0 / l) * (t_0 / -2.0))) tmp = 0 if h <= -5e-310: tmp = math.sqrt((d / h)) * ((math.sqrt(-d) / math.sqrt(-l)) * t_1) else: tmp = (t_1 * math.sqrt((d / l))) * (math.sqrt(d) / math.sqrt(h)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(D_m * Float64(0.5 * Float64(M_m / d))) t_1 = Float64(1.0 + Float64(h * Float64(Float64(t_0 / l) * Float64(t_0 / -2.0)))) tmp = 0.0 if (h <= -5e-310) tmp = Float64(sqrt(Float64(d / h)) * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * t_1)); else tmp = Float64(Float64(t_1 * sqrt(Float64(d / l))) * Float64(sqrt(d) / sqrt(h))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = D_m * (0.5 * (M_m / d));
t_1 = 1.0 + (h * ((t_0 / l) * (t_0 / -2.0)));
tmp = 0.0;
if (h <= -5e-310)
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * t_1);
else
tmp = (t_1 * sqrt((d / l))) * (sqrt(d) / sqrt(h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(D$95$m * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(h * N[(N[(t$95$0 / l), $MachinePrecision] * N[(t$95$0 / -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -5e-310], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := D\_m \cdot \left(0.5 \cdot \frac{M\_m}{d}\right)\\
t_1 := 1 + h \cdot \left(\frac{t\_0}{\ell} \cdot \frac{t\_0}{-2}\right)\\
\mathbf{if}\;h \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot t\_1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \frac{\sqrt{d}}{\sqrt{h}}\\
\end{array}
\end{array}
if h < -4.999999999999985e-310Initial program 70.2%
Simplified70.9%
expm1-log1p-u43.3%
expm1-udef43.3%
Applied egg-rr43.3%
expm1-def43.3%
expm1-log1p70.9%
associate-*l/71.7%
*-commutative71.7%
associate-*l/72.4%
*-commutative72.4%
associate-/l*72.4%
Simplified71.1%
unpow271.1%
div-inv71.1%
times-frac71.8%
associate-*r/71.8%
*-commutative71.8%
*-un-lft-identity71.8%
times-frac71.8%
metadata-eval71.8%
associate-*r/71.8%
*-commutative71.8%
*-un-lft-identity71.8%
times-frac71.8%
metadata-eval71.8%
metadata-eval71.8%
Applied egg-rr71.8%
frac-2neg71.8%
sqrt-div81.8%
Applied egg-rr81.8%
if -4.999999999999985e-310 < h Initial program 63.8%
Simplified63.8%
expm1-log1p-u38.6%
expm1-udef38.6%
Applied egg-rr38.6%
expm1-def38.6%
expm1-log1p63.8%
associate-*l/67.7%
*-commutative67.7%
associate-*l/68.5%
*-commutative68.5%
associate-/l*68.5%
Simplified67.6%
unpow267.6%
div-inv67.6%
times-frac68.6%
associate-*r/68.6%
*-commutative68.6%
*-un-lft-identity68.6%
times-frac68.6%
metadata-eval68.6%
associate-*r/68.6%
*-commutative68.6%
*-un-lft-identity68.6%
times-frac68.6%
metadata-eval68.6%
metadata-eval68.6%
Applied egg-rr68.6%
sqrt-div80.4%
div-inv80.4%
Applied egg-rr80.4%
associate-*r/80.4%
*-rgt-identity80.4%
Simplified80.4%
Final simplification81.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 (* D_m (* 0.5 (/ M_m d))))
(t_1 (+ 1.0 (* h (* (/ t_0 l) (/ t_0 -2.0))))))
(if (<= h -5e-310)
(* (sqrt (/ d h)) (* (/ (sqrt (- d)) (sqrt (- l))) t_1))
(* (* t_1 (sqrt (/ d l))) (* (sqrt d) (sqrt (/ 1.0 h)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = D_m * (0.5 * (M_m / d));
double t_1 = 1.0 + (h * ((t_0 / l) * (t_0 / -2.0)));
double tmp;
if (h <= -5e-310) {
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * t_1);
} else {
tmp = (t_1 * sqrt((d / l))) * (sqrt(d) * sqrt((1.0 / h)));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = d_m * (0.5d0 * (m_m / d))
t_1 = 1.0d0 + (h * ((t_0 / l) * (t_0 / (-2.0d0))))
if (h <= (-5d-310)) then
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * t_1)
else
tmp = (t_1 * sqrt((d / l))) * (sqrt(d) * sqrt((1.0d0 / h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = D_m * (0.5 * (M_m / d));
double t_1 = 1.0 + (h * ((t_0 / l) * (t_0 / -2.0)));
double tmp;
if (h <= -5e-310) {
tmp = Math.sqrt((d / h)) * ((Math.sqrt(-d) / Math.sqrt(-l)) * t_1);
} else {
tmp = (t_1 * Math.sqrt((d / l))) * (Math.sqrt(d) * Math.sqrt((1.0 / h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = D_m * (0.5 * (M_m / d)) t_1 = 1.0 + (h * ((t_0 / l) * (t_0 / -2.0))) tmp = 0 if h <= -5e-310: tmp = math.sqrt((d / h)) * ((math.sqrt(-d) / math.sqrt(-l)) * t_1) else: tmp = (t_1 * math.sqrt((d / l))) * (math.sqrt(d) * math.sqrt((1.0 / h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(D_m * Float64(0.5 * Float64(M_m / d))) t_1 = Float64(1.0 + Float64(h * Float64(Float64(t_0 / l) * Float64(t_0 / -2.0)))) tmp = 0.0 if (h <= -5e-310) tmp = Float64(sqrt(Float64(d / h)) * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * t_1)); else tmp = Float64(Float64(t_1 * sqrt(Float64(d / l))) * Float64(sqrt(d) * sqrt(Float64(1.0 / h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = D_m * (0.5 * (M_m / d));
t_1 = 1.0 + (h * ((t_0 / l) * (t_0 / -2.0)));
tmp = 0.0;
if (h <= -5e-310)
tmp = sqrt((d / h)) * ((sqrt(-d) / sqrt(-l)) * t_1);
else
tmp = (t_1 * sqrt((d / l))) * (sqrt(d) * sqrt((1.0 / h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(D$95$m * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(h * N[(N[(t$95$0 / l), $MachinePrecision] * N[(t$95$0 / -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -5e-310], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] * N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := D\_m \cdot \left(0.5 \cdot \frac{M\_m}{d}\right)\\
t_1 := 1 + h \cdot \left(\frac{t\_0}{\ell} \cdot \frac{t\_0}{-2}\right)\\
\mathbf{if}\;h \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot t\_1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(\sqrt{d} \cdot \sqrt{\frac{1}{h}}\right)\\
\end{array}
\end{array}
if h < -4.999999999999985e-310Initial program 70.2%
Simplified70.9%
expm1-log1p-u43.3%
expm1-udef43.3%
Applied egg-rr43.3%
expm1-def43.3%
expm1-log1p70.9%
associate-*l/71.7%
*-commutative71.7%
associate-*l/72.4%
*-commutative72.4%
associate-/l*72.4%
Simplified71.1%
unpow271.1%
div-inv71.1%
times-frac71.8%
associate-*r/71.8%
*-commutative71.8%
*-un-lft-identity71.8%
times-frac71.8%
metadata-eval71.8%
associate-*r/71.8%
*-commutative71.8%
*-un-lft-identity71.8%
times-frac71.8%
metadata-eval71.8%
metadata-eval71.8%
Applied egg-rr71.8%
frac-2neg71.8%
sqrt-div81.8%
Applied egg-rr81.8%
if -4.999999999999985e-310 < h Initial program 63.8%
Simplified63.8%
expm1-log1p-u38.6%
expm1-udef38.6%
Applied egg-rr38.6%
expm1-def38.6%
expm1-log1p63.8%
associate-*l/67.7%
*-commutative67.7%
associate-*l/68.5%
*-commutative68.5%
associate-/l*68.5%
Simplified67.6%
unpow267.6%
div-inv67.6%
times-frac68.6%
associate-*r/68.6%
*-commutative68.6%
*-un-lft-identity68.6%
times-frac68.6%
metadata-eval68.6%
associate-*r/68.6%
*-commutative68.6%
*-un-lft-identity68.6%
times-frac68.6%
metadata-eval68.6%
metadata-eval68.6%
Applied egg-rr68.6%
pow1/268.6%
metadata-eval68.6%
div-inv68.6%
unpow-prod-down80.4%
metadata-eval80.4%
pow1/280.4%
metadata-eval80.4%
Applied egg-rr80.4%
unpow1/280.4%
Simplified80.4%
Final simplification81.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 (* D_m (* 0.5 (/ M_m d)))) (t_1 (sqrt (/ d h))))
(if (<= h -5e-310)
(* t_1 (* (sqrt (/ d l)) (+ 1.0 (* h (* t_0 (* t_0 (/ -0.5 l)))))))
(*
t_1
(* (+ 1.0 (* h (* (/ t_0 l) (/ t_0 -2.0)))) (/ (sqrt d) (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 = D_m * (0.5 * (M_m / d));
double t_1 = sqrt((d / h));
double tmp;
if (h <= -5e-310) {
tmp = t_1 * (sqrt((d / l)) * (1.0 + (h * (t_0 * (t_0 * (-0.5 / l))))));
} else {
tmp = t_1 * ((1.0 + (h * ((t_0 / l) * (t_0 / -2.0)))) * (sqrt(d) / 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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = d_m * (0.5d0 * (m_m / d))
t_1 = sqrt((d / h))
if (h <= (-5d-310)) then
tmp = t_1 * (sqrt((d / l)) * (1.0d0 + (h * (t_0 * (t_0 * ((-0.5d0) / l))))))
else
tmp = t_1 * ((1.0d0 + (h * ((t_0 / l) * (t_0 / (-2.0d0))))) * (sqrt(d) / 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 t_0 = D_m * (0.5 * (M_m / d));
double t_1 = Math.sqrt((d / h));
double tmp;
if (h <= -5e-310) {
tmp = t_1 * (Math.sqrt((d / l)) * (1.0 + (h * (t_0 * (t_0 * (-0.5 / l))))));
} else {
tmp = t_1 * ((1.0 + (h * ((t_0 / l) * (t_0 / -2.0)))) * (Math.sqrt(d) / 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): t_0 = D_m * (0.5 * (M_m / d)) t_1 = math.sqrt((d / h)) tmp = 0 if h <= -5e-310: tmp = t_1 * (math.sqrt((d / l)) * (1.0 + (h * (t_0 * (t_0 * (-0.5 / l)))))) else: tmp = t_1 * ((1.0 + (h * ((t_0 / l) * (t_0 / -2.0)))) * (math.sqrt(d) / 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) t_0 = Float64(D_m * Float64(0.5 * Float64(M_m / d))) t_1 = sqrt(Float64(d / h)) tmp = 0.0 if (h <= -5e-310) tmp = Float64(t_1 * Float64(sqrt(Float64(d / l)) * Float64(1.0 + Float64(h * Float64(t_0 * Float64(t_0 * Float64(-0.5 / l))))))); else tmp = Float64(t_1 * Float64(Float64(1.0 + Float64(h * Float64(Float64(t_0 / l) * Float64(t_0 / -2.0)))) * Float64(sqrt(d) / 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)
t_0 = D_m * (0.5 * (M_m / d));
t_1 = sqrt((d / h));
tmp = 0.0;
if (h <= -5e-310)
tmp = t_1 * (sqrt((d / l)) * (1.0 + (h * (t_0 * (t_0 * (-0.5 / l))))));
else
tmp = t_1 * ((1.0 + (h * ((t_0 / l) * (t_0 / -2.0)))) * (sqrt(d) / 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_] := Block[{t$95$0 = N[(D$95$m * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -5e-310], N[(t$95$1 * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(h * N[(t$95$0 * N[(t$95$0 * N[(-0.5 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[(1.0 + N[(h * N[(N[(t$95$0 / l), $MachinePrecision] * N[(t$95$0 / -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[d], $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 := D\_m \cdot \left(0.5 \cdot \frac{M\_m}{d}\right)\\
t_1 := \sqrt{\frac{d}{h}}\\
\mathbf{if}\;h \leq -5 \cdot 10^{-310}:\\
\;\;\;\;t\_1 \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \left(1 + h \cdot \left(t\_0 \cdot \left(t\_0 \cdot \frac{-0.5}{\ell}\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left(\left(1 + h \cdot \left(\frac{t\_0}{\ell} \cdot \frac{t\_0}{-2}\right)\right) \cdot \frac{\sqrt{d}}{\sqrt{\ell}}\right)\\
\end{array}
\end{array}
if h < -4.999999999999985e-310Initial program 70.2%
Simplified70.9%
expm1-log1p-u43.3%
expm1-udef43.3%
Applied egg-rr43.3%
expm1-def43.3%
expm1-log1p70.9%
associate-*l/71.7%
*-commutative71.7%
associate-*l/72.4%
*-commutative72.4%
associate-/l*72.4%
Simplified71.1%
div-inv71.1%
unpow271.1%
clear-num71.1%
associate-*l*71.8%
associate-*r/71.8%
*-commutative71.8%
*-un-lft-identity71.8%
times-frac71.8%
metadata-eval71.8%
associate-*r/71.8%
*-commutative71.8%
*-un-lft-identity71.8%
times-frac71.8%
metadata-eval71.8%
Applied egg-rr71.8%
if -4.999999999999985e-310 < h Initial program 63.8%
Simplified63.8%
expm1-log1p-u38.6%
expm1-udef38.6%
Applied egg-rr38.6%
expm1-def38.6%
expm1-log1p63.8%
associate-*l/67.7%
*-commutative67.7%
associate-*l/68.5%
*-commutative68.5%
associate-/l*68.5%
Simplified67.6%
unpow267.6%
div-inv67.6%
times-frac68.6%
associate-*r/68.6%
*-commutative68.6%
*-un-lft-identity68.6%
times-frac68.6%
metadata-eval68.6%
associate-*r/68.6%
*-commutative68.6%
*-un-lft-identity68.6%
times-frac68.6%
metadata-eval68.6%
metadata-eval68.6%
Applied egg-rr68.6%
sqrt-div75.6%
div-inv75.6%
Applied egg-rr75.6%
associate-*r/75.6%
*-rgt-identity75.6%
Simplified75.6%
Final simplification73.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 (* D_m (* 0.5 (/ M_m d)))) (t_1 (sqrt (/ d l))))
(if (<= h -5e-310)
(* (sqrt (/ d h)) (* t_1 (+ 1.0 (* h (* t_0 (* t_0 (/ -0.5 l)))))))
(*
(* (+ 1.0 (* h (* (/ t_0 l) (/ t_0 -2.0)))) t_1)
(/ (sqrt d) (sqrt h))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = D_m * (0.5 * (M_m / d));
double t_1 = sqrt((d / l));
double tmp;
if (h <= -5e-310) {
tmp = sqrt((d / h)) * (t_1 * (1.0 + (h * (t_0 * (t_0 * (-0.5 / l))))));
} else {
tmp = ((1.0 + (h * ((t_0 / l) * (t_0 / -2.0)))) * t_1) * (sqrt(d) / sqrt(h));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = d_m * (0.5d0 * (m_m / d))
t_1 = sqrt((d / l))
if (h <= (-5d-310)) then
tmp = sqrt((d / h)) * (t_1 * (1.0d0 + (h * (t_0 * (t_0 * ((-0.5d0) / l))))))
else
tmp = ((1.0d0 + (h * ((t_0 / l) * (t_0 / (-2.0d0))))) * t_1) * (sqrt(d) / sqrt(h))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = D_m * (0.5 * (M_m / d));
double t_1 = Math.sqrt((d / l));
double tmp;
if (h <= -5e-310) {
tmp = Math.sqrt((d / h)) * (t_1 * (1.0 + (h * (t_0 * (t_0 * (-0.5 / l))))));
} else {
tmp = ((1.0 + (h * ((t_0 / l) * (t_0 / -2.0)))) * t_1) * (Math.sqrt(d) / Math.sqrt(h));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = D_m * (0.5 * (M_m / d)) t_1 = math.sqrt((d / l)) tmp = 0 if h <= -5e-310: tmp = math.sqrt((d / h)) * (t_1 * (1.0 + (h * (t_0 * (t_0 * (-0.5 / l)))))) else: tmp = ((1.0 + (h * ((t_0 / l) * (t_0 / -2.0)))) * t_1) * (math.sqrt(d) / math.sqrt(h)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(D_m * Float64(0.5 * Float64(M_m / d))) t_1 = sqrt(Float64(d / l)) tmp = 0.0 if (h <= -5e-310) tmp = Float64(sqrt(Float64(d / h)) * Float64(t_1 * Float64(1.0 + Float64(h * Float64(t_0 * Float64(t_0 * Float64(-0.5 / l))))))); else tmp = Float64(Float64(Float64(1.0 + Float64(h * Float64(Float64(t_0 / l) * Float64(t_0 / -2.0)))) * t_1) * Float64(sqrt(d) / sqrt(h))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = D_m * (0.5 * (M_m / d));
t_1 = sqrt((d / l));
tmp = 0.0;
if (h <= -5e-310)
tmp = sqrt((d / h)) * (t_1 * (1.0 + (h * (t_0 * (t_0 * (-0.5 / l))))));
else
tmp = ((1.0 + (h * ((t_0 / l) * (t_0 / -2.0)))) * t_1) * (sqrt(d) / sqrt(h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(D$95$m * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -5e-310], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(t$95$1 * N[(1.0 + N[(h * N[(t$95$0 * N[(t$95$0 * N[(-0.5 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + N[(h * N[(N[(t$95$0 / l), $MachinePrecision] * N[(t$95$0 / -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := D\_m \cdot \left(0.5 \cdot \frac{M\_m}{d}\right)\\
t_1 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;h \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(t\_1 \cdot \left(1 + h \cdot \left(t\_0 \cdot \left(t\_0 \cdot \frac{-0.5}{\ell}\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(1 + h \cdot \left(\frac{t\_0}{\ell} \cdot \frac{t\_0}{-2}\right)\right) \cdot t\_1\right) \cdot \frac{\sqrt{d}}{\sqrt{h}}\\
\end{array}
\end{array}
if h < -4.999999999999985e-310Initial program 70.2%
Simplified70.9%
expm1-log1p-u43.3%
expm1-udef43.3%
Applied egg-rr43.3%
expm1-def43.3%
expm1-log1p70.9%
associate-*l/71.7%
*-commutative71.7%
associate-*l/72.4%
*-commutative72.4%
associate-/l*72.4%
Simplified71.1%
div-inv71.1%
unpow271.1%
clear-num71.1%
associate-*l*71.8%
associate-*r/71.8%
*-commutative71.8%
*-un-lft-identity71.8%
times-frac71.8%
metadata-eval71.8%
associate-*r/71.8%
*-commutative71.8%
*-un-lft-identity71.8%
times-frac71.8%
metadata-eval71.8%
Applied egg-rr71.8%
if -4.999999999999985e-310 < h Initial program 63.8%
Simplified63.8%
expm1-log1p-u38.6%
expm1-udef38.6%
Applied egg-rr38.6%
expm1-def38.6%
expm1-log1p63.8%
associate-*l/67.7%
*-commutative67.7%
associate-*l/68.5%
*-commutative68.5%
associate-/l*68.5%
Simplified67.6%
unpow267.6%
div-inv67.6%
times-frac68.6%
associate-*r/68.6%
*-commutative68.6%
*-un-lft-identity68.6%
times-frac68.6%
metadata-eval68.6%
associate-*r/68.6%
*-commutative68.6%
*-un-lft-identity68.6%
times-frac68.6%
metadata-eval68.6%
metadata-eval68.6%
Applied egg-rr68.6%
sqrt-div80.4%
div-inv80.4%
Applied egg-rr80.4%
associate-*r/80.4%
*-rgt-identity80.4%
Simplified80.4%
Final simplification75.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 (* D_m (* 0.5 (/ M_m d)))))
(if (<= l 2.7e+125)
(*
(sqrt (/ d h))
(* (sqrt (/ d l)) (+ 1.0 (* h (* t_0 (* t_0 (/ -0.5 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 t_0 = D_m * (0.5 * (M_m / d));
double tmp;
if (l <= 2.7e+125) {
tmp = sqrt((d / h)) * (sqrt((d / l)) * (1.0 + (h * (t_0 * (t_0 * (-0.5 / 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) :: t_0
real(8) :: tmp
t_0 = d_m * (0.5d0 * (m_m / d))
if (l <= 2.7d+125) then
tmp = sqrt((d / h)) * (sqrt((d / l)) * (1.0d0 + (h * (t_0 * (t_0 * ((-0.5d0) / 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 t_0 = D_m * (0.5 * (M_m / d));
double tmp;
if (l <= 2.7e+125) {
tmp = Math.sqrt((d / h)) * (Math.sqrt((d / l)) * (1.0 + (h * (t_0 * (t_0 * (-0.5 / 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): t_0 = D_m * (0.5 * (M_m / d)) tmp = 0 if l <= 2.7e+125: tmp = math.sqrt((d / h)) * (math.sqrt((d / l)) * (1.0 + (h * (t_0 * (t_0 * (-0.5 / 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) t_0 = Float64(D_m * Float64(0.5 * Float64(M_m / d))) tmp = 0.0 if (l <= 2.7e+125) tmp = Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(d / l)) * Float64(1.0 + Float64(h * Float64(t_0 * Float64(t_0 * Float64(-0.5 / 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)
t_0 = D_m * (0.5 * (M_m / d));
tmp = 0.0;
if (l <= 2.7e+125)
tmp = sqrt((d / h)) * (sqrt((d / l)) * (1.0 + (h * (t_0 * (t_0 * (-0.5 / 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_] := Block[{t$95$0 = N[(D$95$m * N[(0.5 * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 2.7e+125], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(h * N[(t$95$0 * N[(t$95$0 * N[(-0.5 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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}
t_0 := D\_m \cdot \left(0.5 \cdot \frac{M\_m}{d}\right)\\
\mathbf{if}\;\ell \leq 2.7 \cdot 10^{+125}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \left(1 + h \cdot \left(t\_0 \cdot \left(t\_0 \cdot \frac{-0.5}{\ell}\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < 2.6999999999999999e125Initial program 70.7%
Simplified71.1%
expm1-log1p-u41.2%
expm1-udef41.2%
Applied egg-rr41.2%
expm1-def41.2%
expm1-log1p71.1%
associate-*l/73.5%
*-commutative73.5%
associate-*l/74.3%
*-commutative74.3%
associate-/l*74.3%
Simplified73.1%
div-inv73.1%
unpow273.1%
clear-num73.1%
associate-*l*73.5%
associate-*r/73.6%
*-commutative73.6%
*-un-lft-identity73.6%
times-frac73.6%
metadata-eval73.6%
associate-*r/73.5%
*-commutative73.5%
*-un-lft-identity73.5%
times-frac73.5%
metadata-eval73.5%
Applied egg-rr73.5%
if 2.6999999999999999e125 < l Initial program 44.8%
Simplified45.0%
Taylor expanded in h around 0 42.9%
*-commutative42.9%
*-rgt-identity42.9%
sqrt-div48.7%
sqrt-div69.0%
frac-times68.8%
add-sqr-sqrt69.1%
Applied egg-rr69.1%
Final simplification73.0%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= d 1.8e-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.8e-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.8d-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.8e-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.8e-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.8e-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.8e-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.8e-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.8 \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.7999999999999999e-270Initial program 68.8%
Simplified68.8%
Taylor expanded in h around 0 44.5%
*-rgt-identity44.5%
pow1/244.5%
pow1/244.5%
pow-prod-down36.3%
Applied egg-rr36.3%
unpow1/236.3%
associate-*l/34.5%
Simplified34.5%
Taylor expanded in d around -inf 49.3%
associate-*r*49.3%
neg-mul-149.3%
associate-/r*49.3%
Simplified49.3%
if 1.7999999999999999e-270 < d Initial program 65.6%
Simplified64.8%
Taylor expanded in h around 0 43.1%
*-commutative43.1%
*-rgt-identity43.1%
sqrt-div47.4%
sqrt-div54.4%
frac-times54.3%
add-sqr-sqrt54.4%
Applied egg-rr54.4%
Final simplification51.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 -6e-309)
(* (- d) (sqrt (/ (/ 1.0 l) h)))
(if (<= h 1.9e+164)
(* d (sqrt (/ (/ 1.0 h) l)))
(sqrt (* (/ d h) (/ d l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (h <= -6e-309) {
tmp = -d * sqrt(((1.0 / l) / h));
} else if (h <= 1.9e+164) {
tmp = d * sqrt(((1.0 / h) / l));
} else {
tmp = sqrt(((d / h) * (d / 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 (h <= (-6d-309)) then
tmp = -d * sqrt(((1.0d0 / l) / h))
else if (h <= 1.9d+164) then
tmp = d * sqrt(((1.0d0 / h) / l))
else
tmp = sqrt(((d / h) * (d / 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 (h <= -6e-309) {
tmp = -d * Math.sqrt(((1.0 / l) / h));
} else if (h <= 1.9e+164) {
tmp = d * Math.sqrt(((1.0 / h) / l));
} else {
tmp = Math.sqrt(((d / h) * (d / 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 h <= -6e-309: tmp = -d * math.sqrt(((1.0 / l) / h)) elif h <= 1.9e+164: tmp = d * math.sqrt(((1.0 / h) / l)) else: tmp = math.sqrt(((d / h) * (d / l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (h <= -6e-309) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))); elseif (h <= 1.9e+164) tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = sqrt(Float64(Float64(d / h) * Float64(d / 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 (h <= -6e-309)
tmp = -d * sqrt(((1.0 / l) / h));
elseif (h <= 1.9e+164)
tmp = d * sqrt(((1.0 / h) / l));
else
tmp = sqrt(((d / h) * (d / 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[h, -6e-309], N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 1.9e+164], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / 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}\;h \leq -6 \cdot 10^{-309}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{elif}\;h \leq 1.9 \cdot 10^{+164}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\end{array}
\end{array}
if h < -6.000000000000001e-309Initial program 70.0%
Simplified70.0%
Taylor expanded in h around 0 45.6%
*-rgt-identity45.6%
pow1/245.6%
pow1/245.6%
pow-prod-down37.3%
Applied egg-rr37.3%
unpow1/237.3%
associate-*l/35.4%
Simplified35.4%
Taylor expanded in d around -inf 50.5%
mul-1-neg50.5%
distribute-rgt-neg-in50.5%
*-commutative50.5%
associate-/r*50.5%
Simplified50.5%
if -6.000000000000001e-309 < h < 1.90000000000000011e164Initial program 68.8%
Simplified67.9%
Taylor expanded in h around 0 43.1%
*-rgt-identity43.1%
pow1/243.1%
pow1/243.1%
pow-prod-down31.5%
Applied egg-rr31.5%
unpow1/231.5%
associate-*l/29.3%
Simplified29.3%
Taylor expanded in d around 0 49.3%
associate-/r*49.4%
Simplified49.4%
if 1.90000000000000011e164 < h Initial program 46.1%
Simplified46.1%
Taylor expanded in h around 0 35.9%
*-rgt-identity35.9%
sqrt-unprod31.9%
Applied egg-rr31.9%
Final simplification48.5%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ (/ 1.0 h) l))))
(if (<= h -6e-309)
(* (- d) t_0)
(if (<= h 7.5e+155) (* d t_0) (sqrt (* (/ d h) (/ d 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(((1.0 / h) / l));
double tmp;
if (h <= -6e-309) {
tmp = -d * t_0;
} else if (h <= 7.5e+155) {
tmp = d * t_0;
} else {
tmp = sqrt(((d / h) * (d / l)));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(((1.0d0 / h) / l))
if (h <= (-6d-309)) then
tmp = -d * t_0
else if (h <= 7.5d+155) then
tmp = d * t_0
else
tmp = sqrt(((d / h) * (d / l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt(((1.0 / h) / l));
double tmp;
if (h <= -6e-309) {
tmp = -d * t_0;
} else if (h <= 7.5e+155) {
tmp = d * t_0;
} else {
tmp = Math.sqrt(((d / h) * (d / l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt(((1.0 / h) / l)) tmp = 0 if h <= -6e-309: tmp = -d * t_0 elif h <= 7.5e+155: tmp = d * t_0 else: tmp = math.sqrt(((d / h) * (d / 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(Float64(1.0 / h) / l)) tmp = 0.0 if (h <= -6e-309) tmp = Float64(Float64(-d) * t_0); elseif (h <= 7.5e+155) tmp = Float64(d * t_0); else tmp = sqrt(Float64(Float64(d / h) * Float64(d / l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt(((1.0 / h) / l));
tmp = 0.0;
if (h <= -6e-309)
tmp = -d * t_0;
elseif (h <= 7.5e+155)
tmp = d * t_0;
else
tmp = sqrt(((d / h) * (d / l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -6e-309], N[((-d) * t$95$0), $MachinePrecision], If[LessEqual[h, 7.5e+155], N[(d * t$95$0), $MachinePrecision], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / 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}
t_0 := \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{if}\;h \leq -6 \cdot 10^{-309}:\\
\;\;\;\;\left(-d\right) \cdot t\_0\\
\mathbf{elif}\;h \leq 7.5 \cdot 10^{+155}:\\
\;\;\;\;d \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\end{array}
\end{array}
if h < -6.000000000000001e-309Initial program 70.0%
Simplified70.0%
Taylor expanded in h around 0 45.6%
*-rgt-identity45.6%
pow1/245.6%
pow1/245.6%
pow-prod-down37.3%
Applied egg-rr37.3%
unpow1/237.3%
associate-*l/35.4%
Simplified35.4%
Taylor expanded in d around -inf 50.5%
associate-*r*50.5%
neg-mul-150.5%
associate-/r*50.6%
Simplified50.6%
if -6.000000000000001e-309 < h < 7.4999999999999999e155Initial program 68.8%
Simplified67.9%
Taylor expanded in h around 0 43.1%
*-rgt-identity43.1%
pow1/243.1%
pow1/243.1%
pow-prod-down31.5%
Applied egg-rr31.5%
unpow1/231.5%
associate-*l/29.3%
Simplified29.3%
Taylor expanded in d around 0 49.3%
associate-/r*49.4%
Simplified49.4%
if 7.4999999999999999e155 < h Initial program 46.1%
Simplified46.1%
Taylor expanded in h around 0 35.9%
*-rgt-identity35.9%
sqrt-unprod31.9%
Applied egg-rr31.9%
Final simplification48.5%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= d -4.2e-94) (sqrt (* (/ d h) (/ d l))) (* d (sqrt (/ 1.0 (* l h))))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -4.2e-94) {
tmp = sqrt(((d / h) * (d / l)));
} else {
tmp = d * sqrt((1.0 / (l * h)));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= (-4.2d-94)) then
tmp = sqrt(((d / h) * (d / l)))
else
tmp = d * sqrt((1.0d0 / (l * h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -4.2e-94) {
tmp = Math.sqrt(((d / h) * (d / l)));
} else {
tmp = d * Math.sqrt((1.0 / (l * h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= -4.2e-94: tmp = math.sqrt(((d / h) * (d / l))) else: tmp = d * math.sqrt((1.0 / (l * h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -4.2e-94) tmp = sqrt(Float64(Float64(d / h) * Float64(d / l))); else tmp = Float64(d * sqrt(Float64(1.0 / Float64(l * h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= -4.2e-94)
tmp = sqrt(((d / h) * (d / l)));
else
tmp = d * sqrt((1.0 / (l * h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -4.2e-94], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -4.2 \cdot 10^{-94}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{1}{\ell \cdot h}}\\
\end{array}
\end{array}
if d < -4.2000000000000002e-94Initial program 81.2%
Simplified81.2%
Taylor expanded in h around 0 53.4%
*-rgt-identity53.4%
sqrt-unprod46.0%
Applied egg-rr46.0%
if -4.2000000000000002e-94 < d Initial program 58.6%
Simplified58.1%
Taylor expanded in h around 0 37.8%
Taylor expanded in d around 0 35.6%
Final simplification39.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 -2.1e-94) (sqrt (* (/ d h) (/ d l))) (* d (sqrt (/ (/ 1.0 h) l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -2.1e-94) {
tmp = sqrt(((d / h) * (d / l)));
} else {
tmp = d * sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= (-2.1d-94)) then
tmp = sqrt(((d / h) * (d / l)))
else
tmp = d * sqrt(((1.0d0 / h) / l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -2.1e-94) {
tmp = Math.sqrt(((d / h) * (d / l)));
} else {
tmp = d * Math.sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= -2.1e-94: tmp = math.sqrt(((d / h) * (d / l))) else: tmp = d * math.sqrt(((1.0 / h) / l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -2.1e-94) tmp = sqrt(Float64(Float64(d / h) * Float64(d / l))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= -2.1e-94)
tmp = sqrt(((d / h) * (d / l)));
else
tmp = d * sqrt(((1.0 / h) / l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -2.1e-94], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -2.1 \cdot 10^{-94}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\end{array}
\end{array}
if d < -2.1000000000000001e-94Initial program 81.2%
Simplified81.2%
Taylor expanded in h around 0 53.4%
*-rgt-identity53.4%
sqrt-unprod46.0%
Applied egg-rr46.0%
if -2.1000000000000001e-94 < d Initial program 58.6%
Simplified58.1%
Taylor expanded in h around 0 37.8%
*-rgt-identity37.8%
pow1/237.8%
pow1/237.8%
pow-prod-down27.6%
Applied egg-rr27.6%
unpow1/227.6%
associate-*l/24.5%
Simplified24.5%
Taylor expanded in d around 0 35.6%
associate-/r*35.6%
Simplified35.6%
Final simplification39.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 (sqrt (* (/ d h) (/ d 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 sqrt(((d / h) * (d / 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 = sqrt(((d / h) * (d / 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 Math.sqrt(((d / h) * (d / 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 math.sqrt(((d / h) * (d / 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 sqrt(Float64(Float64(d / h) * Float64(d / 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 = sqrt(((d / h) * (d / 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[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / 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])\\
\\
\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}
\end{array}
Initial program 67.4%
Simplified67.1%
Taylor expanded in h around 0 43.9%
*-rgt-identity43.9%
sqrt-unprod34.8%
Applied egg-rr34.8%
Final simplification34.8%
herbie shell --seed 2024026
(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)))))