
(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 13 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
(if (<= l -5e-310)
(*
(sqrt (/ d l))
(*
(/ (sqrt (- d)) (sqrt (- h)))
(+ 1.0 (* (/ h l) (* (pow (* (/ M_m 2.0) (/ D_m d)) 2.0) -0.5)))))
(*
(+ 1.0 (* h (/ (* -0.5 (pow (* M_m (* (/ D_m d) 0.5)) 2.0)) l)))
(/ d (* (sqrt h) (sqrt l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -5e-310) {
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (pow(((M_m / 2.0) * (D_m / d)), 2.0) * -0.5))));
} else {
tmp = (1.0 + (h * ((-0.5 * pow((M_m * ((D_m / d) * 0.5)), 2.0)) / l))) * (d / (sqrt(h) * sqrt(l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-5d-310)) then
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * (1.0d0 + ((h / l) * ((((m_m / 2.0d0) * (d_m / d)) ** 2.0d0) * (-0.5d0)))))
else
tmp = (1.0d0 + (h * (((-0.5d0) * ((m_m * ((d_m / d) * 0.5d0)) ** 2.0d0)) / l))) * (d / (sqrt(h) * sqrt(l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -5e-310) {
tmp = Math.sqrt((d / l)) * ((Math.sqrt(-d) / Math.sqrt(-h)) * (1.0 + ((h / l) * (Math.pow(((M_m / 2.0) * (D_m / d)), 2.0) * -0.5))));
} else {
tmp = (1.0 + (h * ((-0.5 * Math.pow((M_m * ((D_m / d) * 0.5)), 2.0)) / l))) * (d / (Math.sqrt(h) * Math.sqrt(l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -5e-310: tmp = math.sqrt((d / l)) * ((math.sqrt(-d) / math.sqrt(-h)) * (1.0 + ((h / l) * (math.pow(((M_m / 2.0) * (D_m / d)), 2.0) * -0.5)))) else: tmp = (1.0 + (h * ((-0.5 * math.pow((M_m * ((D_m / d) * 0.5)), 2.0)) / l))) * (d / (math.sqrt(h) * math.sqrt(l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -5e-310) tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0) * -0.5))))); else tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.5 * (Float64(M_m * Float64(Float64(D_m / d) * 0.5)) ^ 2.0)) / l))) * Float64(d / Float64(sqrt(h) * sqrt(l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -5e-310)
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * ((((M_m / 2.0) * (D_m / d)) ^ 2.0) * -0.5))));
else
tmp = (1.0 + (h * ((-0.5 * ((M_m * ((D_m / d) * 0.5)) ^ 2.0)) / l))) * (d / (sqrt(h) * sqrt(l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -5e-310], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(h * N[(N[(-0.5 * N[Power[N[(M$95$m * N[(N[(D$95$m / d), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left({\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2} \cdot -0.5\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.5 \cdot {\left(M\_m \cdot \left(\frac{D\_m}{d} \cdot 0.5\right)\right)}^{2}}{\ell}\right) \cdot \frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -4.999999999999985e-310Initial program 69.3%
Simplified69.3%
frac-2neg69.3%
sqrt-div80.5%
Applied egg-rr80.5%
if -4.999999999999985e-310 < l Initial program 64.4%
Simplified65.2%
sub-neg65.2%
distribute-rgt-in47.9%
*-un-lft-identity47.9%
sqrt-div50.1%
sqrt-div52.2%
frac-times52.2%
add-sqr-sqrt52.2%
Applied egg-rr68.3%
distribute-rgt1-in81.6%
+-commutative81.6%
associate-*l/85.5%
associate-/l*85.5%
associate-*l*85.5%
Simplified85.5%
Final simplification83.1%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= h -4.3e-271)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* 0.5 (pow (* (* (/ D_m d) (* M_m 0.5)) (sqrt (/ h l))) 2.0))))
(if (<= h -5e-310)
(* (- d) (pow (* l h) -0.5))
(*
(+ 1.0 (* h (/ (* -0.5 (pow (* M_m (* (/ D_m d) 0.5)) 2.0)) 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 (h <= -4.3e-271) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * pow((((D_m / d) * (M_m * 0.5)) * sqrt((h / l))), 2.0)));
} else if (h <= -5e-310) {
tmp = -d * pow((l * h), -0.5);
} else {
tmp = (1.0 + (h * ((-0.5 * pow((M_m * ((D_m / d) * 0.5)), 2.0)) / l))) * (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 (h <= (-4.3d-271)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (0.5d0 * ((((d_m / d) * (m_m * 0.5d0)) * sqrt((h / l))) ** 2.0d0)))
else if (h <= (-5d-310)) then
tmp = -d * ((l * h) ** (-0.5d0))
else
tmp = (1.0d0 + (h * (((-0.5d0) * ((m_m * ((d_m / d) * 0.5d0)) ** 2.0d0)) / l))) * (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 (h <= -4.3e-271) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (0.5 * Math.pow((((D_m / d) * (M_m * 0.5)) * Math.sqrt((h / l))), 2.0)));
} else if (h <= -5e-310) {
tmp = -d * Math.pow((l * h), -0.5);
} else {
tmp = (1.0 + (h * ((-0.5 * Math.pow((M_m * ((D_m / d) * 0.5)), 2.0)) / l))) * (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 h <= -4.3e-271: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (0.5 * math.pow((((D_m / d) * (M_m * 0.5)) * math.sqrt((h / l))), 2.0))) elif h <= -5e-310: tmp = -d * math.pow((l * h), -0.5) else: tmp = (1.0 + (h * ((-0.5 * math.pow((M_m * ((D_m / d) * 0.5)), 2.0)) / l))) * (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 (h <= -4.3e-271) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(0.5 * (Float64(Float64(Float64(D_m / d) * Float64(M_m * 0.5)) * sqrt(Float64(h / l))) ^ 2.0)))); elseif (h <= -5e-310) tmp = Float64(Float64(-d) * (Float64(l * h) ^ -0.5)); else tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.5 * (Float64(M_m * Float64(Float64(D_m / d) * 0.5)) ^ 2.0)) / l))) * 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 (h <= -4.3e-271)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (0.5 * ((((D_m / d) * (M_m * 0.5)) * sqrt((h / l))) ^ 2.0)));
elseif (h <= -5e-310)
tmp = -d * ((l * h) ^ -0.5);
else
tmp = (1.0 + (h * ((-0.5 * ((M_m * ((D_m / d) * 0.5)) ^ 2.0)) / l))) * (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[h, -4.3e-271], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(0.5 * N[Power[N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -5e-310], N[((-d) * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(h * N[(N[(-0.5 * N[Power[N[(M$95$m * N[(N[(D$95$m / d), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;h \leq -4.3 \cdot 10^{-271}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - 0.5 \cdot {\left(\left(\frac{D\_m}{d} \cdot \left(M\_m \cdot 0.5\right)\right) \cdot \sqrt{\frac{h}{\ell}}\right)}^{2}\right)\\
\mathbf{elif}\;h \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(-d\right) \cdot {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.5 \cdot {\left(M\_m \cdot \left(\frac{D\_m}{d} \cdot 0.5\right)\right)}^{2}}{\ell}\right) \cdot \frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if h < -4.3e-271Initial program 71.5%
Simplified71.5%
add-sqr-sqrt71.5%
pow271.5%
sqrt-prod71.5%
sqrt-pow173.2%
metadata-eval73.2%
pow173.2%
div-inv73.2%
metadata-eval73.2%
Applied egg-rr73.2%
if -4.3e-271 < h < -4.999999999999985e-310Initial program 47.7%
Simplified47.7%
clear-num47.6%
sqrt-div63.8%
metadata-eval63.8%
Applied egg-rr63.8%
Taylor expanded in d around -inf 99.9%
mul-1-neg99.9%
distribute-rgt-neg-in99.9%
unpow1/299.9%
rem-exp-log95.9%
exp-neg95.9%
exp-prod95.9%
distribute-lft-neg-out95.9%
distribute-rgt-neg-in95.9%
metadata-eval95.9%
exp-to-pow99.9%
Simplified99.9%
if -4.999999999999985e-310 < h Initial program 64.4%
Simplified65.2%
sub-neg65.2%
distribute-rgt-in47.9%
*-un-lft-identity47.9%
sqrt-div50.1%
sqrt-div52.2%
frac-times52.2%
add-sqr-sqrt52.2%
Applied egg-rr68.3%
distribute-rgt1-in81.6%
+-commutative81.6%
associate-*l/85.5%
associate-/l*85.5%
associate-*l*85.5%
Simplified85.5%
Final simplification80.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (pow (* l h) -0.5)))
(if (<= l -2.4e-181)
(* (- d) t_0)
(if (<= l 5.4e-308)
(* d (log (exp t_0)))
(if (<= l 1.12e+133)
(*
d
(/
(fma (/ h l) (* -0.5 (pow (* M_m (* (/ D_m d) 0.5)) 2.0)) 1.0)
(sqrt (* l h))))
(* d (* (pow l -0.5) (pow h -0.5))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = pow((l * h), -0.5);
double tmp;
if (l <= -2.4e-181) {
tmp = -d * t_0;
} else if (l <= 5.4e-308) {
tmp = d * log(exp(t_0));
} else if (l <= 1.12e+133) {
tmp = d * (fma((h / l), (-0.5 * pow((M_m * ((D_m / d) * 0.5)), 2.0)), 1.0) / sqrt((l * h)));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(l * h) ^ -0.5 tmp = 0.0 if (l <= -2.4e-181) tmp = Float64(Float64(-d) * t_0); elseif (l <= 5.4e-308) tmp = Float64(d * log(exp(t_0))); elseif (l <= 1.12e+133) tmp = Float64(d * Float64(fma(Float64(h / l), Float64(-0.5 * (Float64(M_m * Float64(Float64(D_m / d) * 0.5)) ^ 2.0)), 1.0) / sqrt(Float64(l * h)))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -2.4e-181], N[((-d) * t$95$0), $MachinePrecision], If[LessEqual[l, 5.4e-308], N[(d * N[Log[N[Exp[t$95$0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.12e+133], N[(d * N[(N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(M$95$m * N[(N[(D$95$m / d), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -2.4 \cdot 10^{-181}:\\
\;\;\;\;\left(-d\right) \cdot t\_0\\
\mathbf{elif}\;\ell \leq 5.4 \cdot 10^{-308}:\\
\;\;\;\;d \cdot \log \left(e^{t\_0}\right)\\
\mathbf{elif}\;\ell \leq 1.12 \cdot 10^{+133}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(M\_m \cdot \left(\frac{D\_m}{d} \cdot 0.5\right)\right)}^{2}, 1\right)}{\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -2.4000000000000001e-181Initial program 64.6%
Simplified64.6%
clear-num64.5%
sqrt-div66.5%
metadata-eval66.5%
Applied egg-rr66.5%
Taylor expanded in d around -inf 49.6%
mul-1-neg49.6%
distribute-rgt-neg-in49.6%
unpow1/249.6%
rem-exp-log47.8%
exp-neg47.8%
exp-prod47.8%
distribute-lft-neg-out47.8%
distribute-rgt-neg-in47.8%
metadata-eval47.8%
exp-to-pow49.6%
Simplified49.6%
if -2.4000000000000001e-181 < l < 5.4000000000000003e-308Initial program 80.8%
Simplified80.8%
add-sqr-sqrt80.8%
pow280.8%
sqrt-prod80.8%
sqrt-pow180.8%
metadata-eval80.8%
pow180.8%
div-inv80.8%
metadata-eval80.8%
Applied egg-rr80.8%
Taylor expanded in d around inf 36.8%
unpow1/236.8%
sqr-pow36.9%
sqr-pow36.8%
rem-exp-log36.6%
exp-neg36.6%
exp-prod36.6%
distribute-lft-neg-out36.6%
distribute-rgt-neg-in36.6%
metadata-eval36.6%
exp-to-pow36.9%
Simplified36.9%
add-log-exp52.5%
Applied egg-rr52.5%
if 5.4000000000000003e-308 < l < 1.12e133Initial program 69.6%
Simplified70.6%
Applied egg-rr26.6%
associate-*l/26.6%
pow-prod-down26.6%
+-commutative26.6%
fma-define26.6%
associate-*l*26.6%
Applied egg-rr26.6%
*-un-lft-identity26.6%
sqrt-div29.4%
sqrt-pow179.7%
metadata-eval79.7%
pow179.7%
associate-*r/79.7%
Applied egg-rr79.7%
*-lft-identity79.7%
associate-/l*80.7%
*-commutative80.7%
associate-/l*80.7%
Simplified80.7%
if 1.12e133 < l Initial program 51.0%
Simplified51.0%
add-sqr-sqrt50.9%
pow250.9%
sqrt-prod51.0%
sqrt-pow152.9%
metadata-eval52.9%
pow152.9%
div-inv52.9%
metadata-eval52.9%
Applied egg-rr52.9%
Taylor expanded in d around inf 46.0%
unpow1/246.0%
sqr-pow45.9%
sqr-pow46.0%
rem-exp-log44.1%
exp-neg44.0%
exp-prod44.0%
distribute-lft-neg-out44.0%
distribute-rgt-neg-in44.0%
metadata-eval44.0%
exp-to-pow46.0%
Simplified46.0%
*-commutative46.0%
unpow-prod-down62.5%
Applied egg-rr62.5%
Final simplification63.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -1.4e+208)
(* (- d) (pow (* l h) -0.5))
(if (<= l -5e-310)
(*
(sqrt (* (/ d l) (/ d h)))
(fma (/ h l) (* -0.5 (pow (* M_m (/ (* D_m 0.5) d)) 2.0)) 1.0))
(if (<= l 1.75e+132)
(*
d
(/
(fma (/ h l) (* -0.5 (pow (* M_m (* (/ D_m d) 0.5)) 2.0)) 1.0)
(sqrt (* l h))))
(* d (* (pow l -0.5) (pow h -0.5)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.4e+208) {
tmp = -d * pow((l * h), -0.5);
} else if (l <= -5e-310) {
tmp = sqrt(((d / l) * (d / h))) * fma((h / l), (-0.5 * pow((M_m * ((D_m * 0.5) / d)), 2.0)), 1.0);
} else if (l <= 1.75e+132) {
tmp = d * (fma((h / l), (-0.5 * pow((M_m * ((D_m / d) * 0.5)), 2.0)), 1.0) / sqrt((l * h)));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.4e+208) tmp = Float64(Float64(-d) * (Float64(l * h) ^ -0.5)); elseif (l <= -5e-310) tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * fma(Float64(h / l), Float64(-0.5 * (Float64(M_m * Float64(Float64(D_m * 0.5) / d)) ^ 2.0)), 1.0)); elseif (l <= 1.75e+132) tmp = Float64(d * Float64(fma(Float64(h / l), Float64(-0.5 * (Float64(M_m * Float64(Float64(D_m / d) * 0.5)) ^ 2.0)), 1.0) / sqrt(Float64(l * h)))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.4e+208], N[((-d) * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(M$95$m * N[(N[(D$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.75e+132], N[(d * N[(N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(M$95$m * N[(N[(D$95$m / d), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.4 \cdot 10^{+208}:\\
\;\;\;\;\left(-d\right) \cdot {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot \mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(M\_m \cdot \frac{D\_m \cdot 0.5}{d}\right)}^{2}, 1\right)\\
\mathbf{elif}\;\ell \leq 1.75 \cdot 10^{+132}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(M\_m \cdot \left(\frac{D\_m}{d} \cdot 0.5\right)\right)}^{2}, 1\right)}{\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -1.40000000000000011e208Initial program 40.8%
Simplified40.8%
clear-num40.7%
sqrt-div47.1%
metadata-eval47.1%
Applied egg-rr47.1%
Taylor expanded in d around -inf 67.1%
mul-1-neg67.1%
distribute-rgt-neg-in67.1%
unpow1/267.1%
rem-exp-log64.5%
exp-neg64.5%
exp-prod64.5%
distribute-lft-neg-out64.5%
distribute-rgt-neg-in64.5%
metadata-eval64.5%
exp-to-pow67.1%
Simplified67.1%
if -1.40000000000000011e208 < l < -4.999999999999985e-310Initial program 74.4%
Simplified74.3%
add-sqr-sqrt74.3%
pow274.3%
sqrt-prod74.3%
sqrt-pow176.2%
metadata-eval76.2%
pow176.2%
div-inv76.2%
metadata-eval76.2%
Applied egg-rr76.2%
pow176.2%
sqrt-unprod63.7%
cancel-sign-sub-inv63.7%
metadata-eval63.7%
*-commutative63.7%
unpow-prod-down61.9%
pow261.9%
add-sqr-sqrt61.9%
associate-*l*61.9%
Applied egg-rr61.9%
unpow161.9%
+-commutative61.9%
*-commutative61.9%
associate-*r*61.9%
fma-undefine61.9%
*-commutative61.9%
associate-*r/61.9%
Simplified61.9%
if -4.999999999999985e-310 < l < 1.7500000000000001e132Initial program 68.9%
Simplified69.9%
Applied egg-rr26.4%
associate-*l/26.4%
pow-prod-down26.4%
+-commutative26.4%
fma-define26.4%
associate-*l*26.4%
Applied egg-rr26.4%
*-un-lft-identity26.4%
sqrt-div29.1%
sqrt-pow179.0%
metadata-eval79.0%
pow179.0%
associate-*r/79.0%
Applied egg-rr79.0%
*-lft-identity79.0%
associate-/l*79.9%
*-commutative79.9%
associate-/l*79.9%
Simplified79.9%
if 1.7500000000000001e132 < l Initial program 51.0%
Simplified51.0%
add-sqr-sqrt50.9%
pow250.9%
sqrt-prod51.0%
sqrt-pow152.9%
metadata-eval52.9%
pow152.9%
div-inv52.9%
metadata-eval52.9%
Applied egg-rr52.9%
Taylor expanded in d around inf 46.0%
unpow1/246.0%
sqr-pow45.9%
sqr-pow46.0%
rem-exp-log44.1%
exp-neg44.0%
exp-prod44.0%
distribute-lft-neg-out44.0%
distribute-rgt-neg-in44.0%
metadata-eval44.0%
exp-to-pow46.0%
Simplified46.0%
*-commutative46.0%
unpow-prod-down62.5%
Applied egg-rr62.5%
Final simplification69.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 -8.5e-209)
(*
(sqrt (* (/ d l) (/ d h)))
(fma (/ h l) (* -0.5 (pow (* M_m (/ (* D_m 0.5) d)) 2.0)) 1.0))
(if (<= d -5e-310)
(* d (log (exp (pow (* l h) -0.5))))
(*
(+ 1.0 (* h (/ (* -0.5 (pow (* M_m (* (/ D_m d) 0.5)) 2.0)) l)))
(/ d (* (sqrt h) (sqrt l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -8.5e-209) {
tmp = sqrt(((d / l) * (d / h))) * fma((h / l), (-0.5 * pow((M_m * ((D_m * 0.5) / d)), 2.0)), 1.0);
} else if (d <= -5e-310) {
tmp = d * log(exp(pow((l * h), -0.5)));
} else {
tmp = (1.0 + (h * ((-0.5 * pow((M_m * ((D_m / d) * 0.5)), 2.0)) / l))) * (d / (sqrt(h) * sqrt(l)));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -8.5e-209) tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * fma(Float64(h / l), Float64(-0.5 * (Float64(M_m * Float64(Float64(D_m * 0.5) / d)) ^ 2.0)), 1.0)); elseif (d <= -5e-310) tmp = Float64(d * log(exp((Float64(l * h) ^ -0.5)))); else tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.5 * (Float64(M_m * Float64(Float64(D_m / d) * 0.5)) ^ 2.0)) / l))) * Float64(d / Float64(sqrt(h) * sqrt(l)))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -8.5e-209], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(M$95$m * N[(N[(D$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -5e-310], N[(d * N[Log[N[Exp[N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(h * N[(N[(-0.5 * N[Power[N[(M$95$m * N[(N[(D$95$m / d), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -8.5 \cdot 10^{-209}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot \mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(M\_m \cdot \frac{D\_m \cdot 0.5}{d}\right)}^{2}, 1\right)\\
\mathbf{elif}\;d \leq -5 \cdot 10^{-310}:\\
\;\;\;\;d \cdot \log \left(e^{{\left(\ell \cdot h\right)}^{-0.5}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.5 \cdot {\left(M\_m \cdot \left(\frac{D\_m}{d} \cdot 0.5\right)\right)}^{2}}{\ell}\right) \cdot \frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -8.5e-209Initial program 75.4%
Simplified75.3%
add-sqr-sqrt75.3%
pow275.3%
sqrt-prod75.3%
sqrt-pow177.2%
metadata-eval77.2%
pow177.2%
div-inv77.2%
metadata-eval77.2%
Applied egg-rr77.2%
pow177.2%
sqrt-unprod70.3%
cancel-sign-sub-inv70.3%
metadata-eval70.3%
*-commutative70.3%
unpow-prod-down68.4%
pow268.4%
add-sqr-sqrt68.4%
associate-*l*68.4%
Applied egg-rr68.4%
unpow168.4%
+-commutative68.4%
*-commutative68.4%
associate-*r*68.4%
fma-undefine68.4%
*-commutative68.4%
associate-*r/68.4%
Simplified68.4%
if -8.5e-209 < d < -4.999999999999985e-310Initial program 43.8%
Simplified43.8%
add-sqr-sqrt43.8%
pow243.8%
sqrt-prod43.8%
sqrt-pow144.0%
metadata-eval44.0%
pow144.0%
div-inv44.0%
metadata-eval44.0%
Applied egg-rr44.0%
Taylor expanded in d around inf 11.2%
unpow1/211.2%
sqr-pow11.2%
sqr-pow11.2%
rem-exp-log11.2%
exp-neg11.2%
exp-prod11.2%
distribute-lft-neg-out11.2%
distribute-rgt-neg-in11.2%
metadata-eval11.2%
exp-to-pow11.2%
Simplified11.2%
add-log-exp45.3%
Applied egg-rr45.3%
if -4.999999999999985e-310 < d Initial program 64.4%
Simplified65.2%
sub-neg65.2%
distribute-rgt-in47.9%
*-un-lft-identity47.9%
sqrt-div50.1%
sqrt-div52.2%
frac-times52.2%
add-sqr-sqrt52.2%
Applied egg-rr68.3%
distribute-rgt1-in81.6%
+-commutative81.6%
associate-*l/85.5%
associate-/l*85.5%
associate-*l*85.5%
Simplified85.5%
Final simplification75.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 -8.8e-275)
(*
(sqrt (/ d l))
(*
(sqrt (/ d h))
(+ 1.0 (* h (* (pow (* M_m (* D_m (/ 0.5 d))) 2.0) (/ -0.5 l))))))
(if (<= h -5e-310)
(* (- d) (pow (* l h) -0.5))
(*
(+ 1.0 (* h (/ (* -0.5 (pow (* M_m (* (/ D_m d) 0.5)) 2.0)) 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 (h <= -8.8e-275) {
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + (h * (pow((M_m * (D_m * (0.5 / d))), 2.0) * (-0.5 / l)))));
} else if (h <= -5e-310) {
tmp = -d * pow((l * h), -0.5);
} else {
tmp = (1.0 + (h * ((-0.5 * pow((M_m * ((D_m / d) * 0.5)), 2.0)) / l))) * (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 (h <= (-8.8d-275)) then
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0d0 + (h * (((m_m * (d_m * (0.5d0 / d))) ** 2.0d0) * ((-0.5d0) / l)))))
else if (h <= (-5d-310)) then
tmp = -d * ((l * h) ** (-0.5d0))
else
tmp = (1.0d0 + (h * (((-0.5d0) * ((m_m * ((d_m / d) * 0.5d0)) ** 2.0d0)) / l))) * (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 (h <= -8.8e-275) {
tmp = Math.sqrt((d / l)) * (Math.sqrt((d / h)) * (1.0 + (h * (Math.pow((M_m * (D_m * (0.5 / d))), 2.0) * (-0.5 / l)))));
} else if (h <= -5e-310) {
tmp = -d * Math.pow((l * h), -0.5);
} else {
tmp = (1.0 + (h * ((-0.5 * Math.pow((M_m * ((D_m / d) * 0.5)), 2.0)) / l))) * (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 h <= -8.8e-275: tmp = math.sqrt((d / l)) * (math.sqrt((d / h)) * (1.0 + (h * (math.pow((M_m * (D_m * (0.5 / d))), 2.0) * (-0.5 / l))))) elif h <= -5e-310: tmp = -d * math.pow((l * h), -0.5) else: tmp = (1.0 + (h * ((-0.5 * math.pow((M_m * ((D_m / d) * 0.5)), 2.0)) / l))) * (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 (h <= -8.8e-275) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(h * Float64((Float64(M_m * Float64(D_m * Float64(0.5 / d))) ^ 2.0) * Float64(-0.5 / l)))))); elseif (h <= -5e-310) tmp = Float64(Float64(-d) * (Float64(l * h) ^ -0.5)); else tmp = Float64(Float64(1.0 + Float64(h * Float64(Float64(-0.5 * (Float64(M_m * Float64(Float64(D_m / d) * 0.5)) ^ 2.0)) / l))) * 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 (h <= -8.8e-275)
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + (h * (((M_m * (D_m * (0.5 / d))) ^ 2.0) * (-0.5 / l)))));
elseif (h <= -5e-310)
tmp = -d * ((l * h) ^ -0.5);
else
tmp = (1.0 + (h * ((-0.5 * ((M_m * ((D_m / d) * 0.5)) ^ 2.0)) / l))) * (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[h, -8.8e-275], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(h * N[(N[Power[N[(M$95$m * N[(D$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.5 / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -5e-310], N[((-d) * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(h * N[(N[(-0.5 * N[Power[N[(M$95$m * N[(N[(D$95$m / d), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;h \leq -8.8 \cdot 10^{-275}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + h \cdot \left({\left(M\_m \cdot \left(D\_m \cdot \frac{0.5}{d}\right)\right)}^{2} \cdot \frac{-0.5}{\ell}\right)\right)\right)\\
\mathbf{elif}\;h \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(-d\right) \cdot {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + h \cdot \frac{-0.5 \cdot {\left(M\_m \cdot \left(\frac{D\_m}{d} \cdot 0.5\right)\right)}^{2}}{\ell}\right) \cdot \frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if h < -8.79999999999999955e-275Initial program 71.5%
Simplified71.5%
*-commutative71.5%
clear-num71.5%
un-div-inv71.5%
div-inv71.5%
metadata-eval71.5%
Applied egg-rr71.5%
associate-/r/72.5%
*-commutative72.5%
associate-/l*72.4%
associate-*r/72.5%
associate-*l/72.5%
associate-/r/72.4%
associate-/l*72.4%
associate-/r/72.4%
Simplified72.4%
if -8.79999999999999955e-275 < h < -4.999999999999985e-310Initial program 47.7%
Simplified47.7%
clear-num47.6%
sqrt-div63.8%
metadata-eval63.8%
Applied egg-rr63.8%
Taylor expanded in d around -inf 99.9%
mul-1-neg99.9%
distribute-rgt-neg-in99.9%
unpow1/299.9%
rem-exp-log95.9%
exp-neg95.9%
exp-prod95.9%
distribute-lft-neg-out95.9%
distribute-rgt-neg-in95.9%
metadata-eval95.9%
exp-to-pow99.9%
Simplified99.9%
if -4.999999999999985e-310 < h Initial program 64.4%
Simplified65.2%
sub-neg65.2%
distribute-rgt-in47.9%
*-un-lft-identity47.9%
sqrt-div50.1%
sqrt-div52.2%
frac-times52.2%
add-sqr-sqrt52.2%
Applied egg-rr68.3%
distribute-rgt1-in81.6%
+-commutative81.6%
associate-*l/85.5%
associate-/l*85.5%
associate-*l*85.5%
Simplified85.5%
Final simplification80.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (pow (* l h) -0.5)))
(if (<= l -6.5e-183)
(* (- d) t_0)
(if (<= l 2e-309)
(log1p (expm1 (* d t_0)))
(* d (* (pow l -0.5) (pow h -0.5)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = pow((l * h), -0.5);
double tmp;
if (l <= -6.5e-183) {
tmp = -d * t_0;
} else if (l <= 2e-309) {
tmp = log1p(expm1((d * t_0)));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.pow((l * h), -0.5);
double tmp;
if (l <= -6.5e-183) {
tmp = -d * t_0;
} else if (l <= 2e-309) {
tmp = Math.log1p(Math.expm1((d * t_0)));
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -0.5));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.pow((l * h), -0.5) tmp = 0 if l <= -6.5e-183: tmp = -d * t_0 elif l <= 2e-309: tmp = math.log1p(math.expm1((d * t_0))) else: tmp = d * (math.pow(l, -0.5) * math.pow(h, -0.5)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(l * h) ^ -0.5 tmp = 0.0 if (l <= -6.5e-183) tmp = Float64(Float64(-d) * t_0); elseif (l <= 2e-309) tmp = log1p(expm1(Float64(d * t_0))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -6.5e-183], N[((-d) * t$95$0), $MachinePrecision], If[LessEqual[l, 2e-309], N[Log[1 + N[(Exp[N[(d * t$95$0), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -6.5 \cdot 10^{-183}:\\
\;\;\;\;\left(-d\right) \cdot t\_0\\
\mathbf{elif}\;\ell \leq 2 \cdot 10^{-309}:\\
\;\;\;\;\mathsf{log1p}\left(\mathsf{expm1}\left(d \cdot t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -6.50000000000000014e-183Initial program 64.6%
Simplified64.6%
clear-num64.5%
sqrt-div66.5%
metadata-eval66.5%
Applied egg-rr66.5%
Taylor expanded in d around -inf 49.6%
mul-1-neg49.6%
distribute-rgt-neg-in49.6%
unpow1/249.6%
rem-exp-log47.8%
exp-neg47.8%
exp-prod47.8%
distribute-lft-neg-out47.8%
distribute-rgt-neg-in47.8%
metadata-eval47.8%
exp-to-pow49.6%
Simplified49.6%
if -6.50000000000000014e-183 < l < 1.9999999999999988e-309Initial program 83.5%
Simplified83.5%
add-sqr-sqrt83.5%
pow283.5%
sqrt-prod83.5%
sqrt-pow183.5%
metadata-eval83.5%
pow183.5%
div-inv83.5%
metadata-eval83.5%
Applied egg-rr83.5%
Taylor expanded in d around inf 34.8%
unpow1/234.8%
sqr-pow34.8%
sqr-pow34.8%
rem-exp-log34.8%
exp-neg34.8%
exp-prod34.8%
distribute-lft-neg-out34.8%
distribute-rgt-neg-in34.8%
metadata-eval34.8%
exp-to-pow34.8%
Simplified34.8%
log1p-expm1-u53.7%
Applied egg-rr53.7%
if 1.9999999999999988e-309 < l Initial program 64.4%
Simplified65.2%
add-sqr-sqrt65.2%
pow265.2%
sqrt-prod65.2%
sqrt-pow165.7%
metadata-eval65.7%
pow165.7%
div-inv65.7%
metadata-eval65.7%
Applied egg-rr65.7%
Taylor expanded in d around inf 41.5%
unpow1/241.5%
sqr-pow41.5%
sqr-pow41.5%
rem-exp-log40.1%
exp-neg40.1%
exp-prod40.1%
distribute-lft-neg-out40.1%
distribute-rgt-neg-in40.1%
metadata-eval40.1%
exp-to-pow41.6%
Simplified41.6%
*-commutative41.6%
unpow-prod-down47.0%
Applied egg-rr47.0%
Final simplification48.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (pow (* l h) -0.5)))
(if (<= l -2.6e-184)
(* (- d) t_0)
(if (<= l -5e-310)
(* d (log (exp t_0)))
(* d (* (pow l -0.5) (pow h -0.5)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = pow((l * h), -0.5);
double tmp;
if (l <= -2.6e-184) {
tmp = -d * t_0;
} else if (l <= -5e-310) {
tmp = d * log(exp(t_0));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = (l * h) ** (-0.5d0)
if (l <= (-2.6d-184)) then
tmp = -d * t_0
else if (l <= (-5d-310)) then
tmp = d * log(exp(t_0))
else
tmp = d * ((l ** (-0.5d0)) * (h ** (-0.5d0)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.pow((l * h), -0.5);
double tmp;
if (l <= -2.6e-184) {
tmp = -d * t_0;
} else if (l <= -5e-310) {
tmp = d * Math.log(Math.exp(t_0));
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -0.5));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.pow((l * h), -0.5) tmp = 0 if l <= -2.6e-184: tmp = -d * t_0 elif l <= -5e-310: tmp = d * math.log(math.exp(t_0)) else: tmp = d * (math.pow(l, -0.5) * math.pow(h, -0.5)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(l * h) ^ -0.5 tmp = 0.0 if (l <= -2.6e-184) tmp = Float64(Float64(-d) * t_0); elseif (l <= -5e-310) tmp = Float64(d * log(exp(t_0))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = (l * h) ^ -0.5;
tmp = 0.0;
if (l <= -2.6e-184)
tmp = -d * t_0;
elseif (l <= -5e-310)
tmp = d * log(exp(t_0));
else
tmp = d * ((l ^ -0.5) * (h ^ -0.5));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -2.6e-184], N[((-d) * t$95$0), $MachinePrecision], If[LessEqual[l, -5e-310], N[(d * N[Log[N[Exp[t$95$0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -2.6 \cdot 10^{-184}:\\
\;\;\;\;\left(-d\right) \cdot t\_0\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;d \cdot \log \left(e^{t\_0}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -2.59999999999999978e-184Initial program 64.6%
Simplified64.6%
clear-num64.5%
sqrt-div66.5%
metadata-eval66.5%
Applied egg-rr66.5%
Taylor expanded in d around -inf 49.6%
mul-1-neg49.6%
distribute-rgt-neg-in49.6%
unpow1/249.6%
rem-exp-log47.8%
exp-neg47.8%
exp-prod47.8%
distribute-lft-neg-out47.8%
distribute-rgt-neg-in47.8%
metadata-eval47.8%
exp-to-pow49.6%
Simplified49.6%
if -2.59999999999999978e-184 < l < -4.999999999999985e-310Initial program 83.5%
Simplified83.5%
add-sqr-sqrt83.5%
pow283.5%
sqrt-prod83.5%
sqrt-pow183.5%
metadata-eval83.5%
pow183.5%
div-inv83.5%
metadata-eval83.5%
Applied egg-rr83.5%
Taylor expanded in d around inf 34.8%
unpow1/234.8%
sqr-pow34.8%
sqr-pow34.8%
rem-exp-log34.8%
exp-neg34.8%
exp-prod34.8%
distribute-lft-neg-out34.8%
distribute-rgt-neg-in34.8%
metadata-eval34.8%
exp-to-pow34.8%
Simplified34.8%
add-log-exp53.9%
Applied egg-rr53.9%
if -4.999999999999985e-310 < l Initial program 64.4%
Simplified65.2%
add-sqr-sqrt65.2%
pow265.2%
sqrt-prod65.2%
sqrt-pow165.7%
metadata-eval65.7%
pow165.7%
div-inv65.7%
metadata-eval65.7%
Applied egg-rr65.7%
Taylor expanded in d around inf 41.5%
unpow1/241.5%
sqr-pow41.5%
sqr-pow41.5%
rem-exp-log40.1%
exp-neg40.1%
exp-prod40.1%
distribute-lft-neg-out40.1%
distribute-rgt-neg-in40.1%
metadata-eval40.1%
exp-to-pow41.6%
Simplified41.6%
*-commutative41.6%
unpow-prod-down47.0%
Applied egg-rr47.0%
Final simplification48.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (pow (* l h) -0.5)) (t_1 (* (- d) t_0)))
(if (<= d -4.5e-38)
t_1
(if (<= d -3.8e-139)
(* d t_0)
(if (<= d 1.18e-150) t_1 (* d (* (pow l -0.5) (pow h -0.5))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = pow((l * h), -0.5);
double t_1 = -d * t_0;
double tmp;
if (d <= -4.5e-38) {
tmp = t_1;
} else if (d <= -3.8e-139) {
tmp = d * t_0;
} else if (d <= 1.18e-150) {
tmp = t_1;
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (l * h) ** (-0.5d0)
t_1 = -d * t_0
if (d <= (-4.5d-38)) then
tmp = t_1
else if (d <= (-3.8d-139)) then
tmp = d * t_0
else if (d <= 1.18d-150) then
tmp = t_1
else
tmp = d * ((l ** (-0.5d0)) * (h ** (-0.5d0)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.pow((l * h), -0.5);
double t_1 = -d * t_0;
double tmp;
if (d <= -4.5e-38) {
tmp = t_1;
} else if (d <= -3.8e-139) {
tmp = d * t_0;
} else if (d <= 1.18e-150) {
tmp = t_1;
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -0.5));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.pow((l * h), -0.5) t_1 = -d * t_0 tmp = 0 if d <= -4.5e-38: tmp = t_1 elif d <= -3.8e-139: tmp = d * t_0 elif d <= 1.18e-150: tmp = t_1 else: tmp = d * (math.pow(l, -0.5) * math.pow(h, -0.5)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(l * h) ^ -0.5 t_1 = Float64(Float64(-d) * t_0) tmp = 0.0 if (d <= -4.5e-38) tmp = t_1; elseif (d <= -3.8e-139) tmp = Float64(d * t_0); elseif (d <= 1.18e-150) tmp = t_1; else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = (l * h) ^ -0.5;
t_1 = -d * t_0;
tmp = 0.0;
if (d <= -4.5e-38)
tmp = t_1;
elseif (d <= -3.8e-139)
tmp = d * t_0;
elseif (d <= 1.18e-150)
tmp = t_1;
else
tmp = d * ((l ^ -0.5) * (h ^ -0.5));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, Block[{t$95$1 = N[((-d) * t$95$0), $MachinePrecision]}, If[LessEqual[d, -4.5e-38], t$95$1, If[LessEqual[d, -3.8e-139], N[(d * t$95$0), $MachinePrecision], If[LessEqual[d, 1.18e-150], t$95$1, N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := {\left(\ell \cdot h\right)}^{-0.5}\\
t_1 := \left(-d\right) \cdot t\_0\\
\mathbf{if}\;d \leq -4.5 \cdot 10^{-38}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;d \leq -3.8 \cdot 10^{-139}:\\
\;\;\;\;d \cdot t\_0\\
\mathbf{elif}\;d \leq 1.18 \cdot 10^{-150}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if d < -4.50000000000000009e-38 or -3.80000000000000008e-139 < d < 1.18e-150Initial program 60.7%
Simplified60.7%
clear-num59.9%
sqrt-div61.2%
metadata-eval61.2%
Applied egg-rr61.2%
Taylor expanded in d around -inf 39.9%
mul-1-neg39.9%
distribute-rgt-neg-in39.9%
unpow1/239.9%
rem-exp-log38.7%
exp-neg38.7%
exp-prod38.7%
distribute-lft-neg-out38.7%
distribute-rgt-neg-in38.7%
metadata-eval38.7%
exp-to-pow39.9%
Simplified39.9%
if -4.50000000000000009e-38 < d < -3.80000000000000008e-139Initial program 74.3%
Simplified74.3%
add-sqr-sqrt74.3%
pow274.3%
sqrt-prod74.3%
sqrt-pow186.6%
metadata-eval86.6%
pow186.6%
div-inv86.6%
metadata-eval86.6%
Applied egg-rr86.6%
Taylor expanded in d around inf 35.7%
unpow1/235.7%
sqr-pow35.7%
sqr-pow35.7%
rem-exp-log35.7%
exp-neg35.7%
exp-prod35.7%
distribute-lft-neg-out35.7%
distribute-rgt-neg-in35.7%
metadata-eval35.7%
exp-to-pow35.7%
Simplified35.7%
if 1.18e-150 < d Initial program 73.6%
Simplified74.6%
add-sqr-sqrt74.6%
pow274.6%
sqrt-prod74.6%
sqrt-pow175.2%
metadata-eval75.2%
pow175.2%
div-inv75.2%
metadata-eval75.2%
Applied egg-rr75.2%
Taylor expanded in d around inf 53.6%
unpow1/253.6%
sqr-pow53.5%
sqr-pow53.6%
rem-exp-log51.7%
exp-neg51.7%
exp-prod51.7%
distribute-lft-neg-out51.7%
distribute-rgt-neg-in51.7%
metadata-eval51.7%
exp-to-pow53.7%
Simplified53.7%
*-commutative53.7%
unpow-prod-down60.7%
Applied egg-rr60.7%
Final simplification48.1%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -1.4e-184)
(* (- d) (pow (* l h) -0.5))
(if (<= l 1.02e-286)
(* d (pow (pow (* l h) 2.0) -0.25))
(* d (* (pow l -0.5) (pow h -0.5))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.4e-184) {
tmp = -d * pow((l * h), -0.5);
} else if (l <= 1.02e-286) {
tmp = d * pow(pow((l * h), 2.0), -0.25);
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-1.4d-184)) then
tmp = -d * ((l * h) ** (-0.5d0))
else if (l <= 1.02d-286) then
tmp = d * (((l * h) ** 2.0d0) ** (-0.25d0))
else
tmp = d * ((l ** (-0.5d0)) * (h ** (-0.5d0)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.4e-184) {
tmp = -d * Math.pow((l * h), -0.5);
} else if (l <= 1.02e-286) {
tmp = d * Math.pow(Math.pow((l * h), 2.0), -0.25);
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -0.5));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -1.4e-184: tmp = -d * math.pow((l * h), -0.5) elif l <= 1.02e-286: tmp = d * math.pow(math.pow((l * h), 2.0), -0.25) else: tmp = d * (math.pow(l, -0.5) * math.pow(h, -0.5)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.4e-184) tmp = Float64(Float64(-d) * (Float64(l * h) ^ -0.5)); elseif (l <= 1.02e-286) tmp = Float64(d * ((Float64(l * h) ^ 2.0) ^ -0.25)); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -1.4e-184)
tmp = -d * ((l * h) ^ -0.5);
elseif (l <= 1.02e-286)
tmp = d * (((l * h) ^ 2.0) ^ -0.25);
else
tmp = d * ((l ^ -0.5) * (h ^ -0.5));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.4e-184], N[((-d) * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.02e-286], N[(d * N[Power[N[Power[N[(l * h), $MachinePrecision], 2.0], $MachinePrecision], -0.25], $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.4 \cdot 10^{-184}:\\
\;\;\;\;\left(-d\right) \cdot {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq 1.02 \cdot 10^{-286}:\\
\;\;\;\;d \cdot {\left({\left(\ell \cdot h\right)}^{2}\right)}^{-0.25}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -1.3999999999999999e-184Initial program 64.6%
Simplified64.6%
clear-num64.5%
sqrt-div66.5%
metadata-eval66.5%
Applied egg-rr66.5%
Taylor expanded in d around -inf 49.6%
mul-1-neg49.6%
distribute-rgt-neg-in49.6%
unpow1/249.6%
rem-exp-log47.8%
exp-neg47.8%
exp-prod47.8%
distribute-lft-neg-out47.8%
distribute-rgt-neg-in47.8%
metadata-eval47.8%
exp-to-pow49.6%
Simplified49.6%
if -1.3999999999999999e-184 < l < 1.01999999999999996e-286Initial program 75.8%
Simplified75.8%
Taylor expanded in d around inf 39.0%
*-commutative39.0%
associate-/r*39.0%
Simplified39.0%
pow1/239.0%
div-inv39.0%
unpow-prod-down10.8%
pow1/210.8%
Applied egg-rr10.8%
unpow1/210.8%
Simplified10.8%
sqrt-unprod39.0%
inv-pow39.0%
inv-pow39.0%
unpow-prod-down39.0%
*-commutative39.0%
sqrt-pow139.1%
metadata-eval39.1%
sqr-pow39.0%
pow-prod-down44.2%
pow244.2%
metadata-eval44.2%
Applied egg-rr44.2%
if 1.01999999999999996e-286 < l Initial program 65.6%
Simplified66.4%
add-sqr-sqrt66.4%
pow266.4%
sqrt-prod66.4%
sqrt-pow166.9%
metadata-eval66.9%
pow166.9%
div-inv66.9%
metadata-eval66.9%
Applied egg-rr66.9%
Taylor expanded in d around inf 40.7%
unpow1/240.7%
sqr-pow40.6%
sqr-pow40.7%
rem-exp-log39.3%
exp-neg39.2%
exp-prod39.2%
distribute-lft-neg-out39.2%
distribute-rgt-neg-in39.2%
metadata-eval39.2%
exp-to-pow40.7%
Simplified40.7%
*-commutative40.7%
unpow-prod-down46.5%
Applied egg-rr46.5%
Final simplification47.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 (pow (* l h) -0.5))) (if (<= l -3.5e-186) (* (- d) t_0) (* d t_0))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = pow((l * h), -0.5);
double tmp;
if (l <= -3.5e-186) {
tmp = -d * t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = (l * h) ** (-0.5d0)
if (l <= (-3.5d-186)) then
tmp = -d * t_0
else
tmp = d * t_0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.pow((l * h), -0.5);
double tmp;
if (l <= -3.5e-186) {
tmp = -d * t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.pow((l * h), -0.5) tmp = 0 if l <= -3.5e-186: tmp = -d * t_0 else: tmp = d * t_0 return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(l * h) ^ -0.5 tmp = 0.0 if (l <= -3.5e-186) tmp = Float64(Float64(-d) * t_0); else tmp = Float64(d * t_0); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = (l * h) ^ -0.5;
tmp = 0.0;
if (l <= -3.5e-186)
tmp = -d * t_0;
else
tmp = d * t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -3.5e-186], N[((-d) * t$95$0), $MachinePrecision], N[(d * t$95$0), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -3.5 \cdot 10^{-186}:\\
\;\;\;\;\left(-d\right) \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if l < -3.49999999999999989e-186Initial program 64.6%
Simplified64.6%
clear-num64.5%
sqrt-div66.5%
metadata-eval66.5%
Applied egg-rr66.5%
Taylor expanded in d around -inf 49.6%
mul-1-neg49.6%
distribute-rgt-neg-in49.6%
unpow1/249.6%
rem-exp-log47.8%
exp-neg47.8%
exp-prod47.8%
distribute-lft-neg-out47.8%
distribute-rgt-neg-in47.8%
metadata-eval47.8%
exp-to-pow49.6%
Simplified49.6%
if -3.49999999999999989e-186 < l Initial program 67.9%
Simplified68.5%
add-sqr-sqrt68.5%
pow268.5%
sqrt-prod68.5%
sqrt-pow168.9%
metadata-eval68.9%
pow168.9%
div-inv68.9%
metadata-eval68.9%
Applied egg-rr68.9%
Taylor expanded in d around inf 40.3%
unpow1/240.3%
sqr-pow40.3%
sqr-pow40.3%
rem-exp-log39.2%
exp-neg39.1%
exp-prod39.1%
distribute-lft-neg-out39.1%
distribute-rgt-neg-in39.1%
metadata-eval39.1%
exp-to-pow40.4%
Simplified40.4%
Final simplification43.6%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= l -5.8e-185) (* (- d) (pow (* l h) -0.5)) (* 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 (l <= -5.8e-185) {
tmp = -d * pow((l * h), -0.5);
} 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 (l <= (-5.8d-185)) then
tmp = -d * ((l * h) ** (-0.5d0))
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 (l <= -5.8e-185) {
tmp = -d * Math.pow((l * h), -0.5);
} 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 l <= -5.8e-185: tmp = -d * math.pow((l * h), -0.5) 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 (l <= -5.8e-185) tmp = Float64(Float64(-d) * (Float64(l * h) ^ -0.5)); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / 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 (l <= -5.8e-185)
tmp = -d * ((l * h) ^ -0.5);
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[l, -5.8e-185], N[((-d) * N[Power[N[(l * h), $MachinePrecision], -0.5], $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -5.8 \cdot 10^{-185}:\\
\;\;\;\;\left(-d\right) \cdot {\left(\ell \cdot h\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\end{array}
\end{array}
if l < -5.79999999999999989e-185Initial program 64.6%
Simplified64.6%
clear-num64.5%
sqrt-div66.5%
metadata-eval66.5%
Applied egg-rr66.5%
Taylor expanded in d around -inf 49.6%
mul-1-neg49.6%
distribute-rgt-neg-in49.6%
unpow1/249.6%
rem-exp-log47.8%
exp-neg47.8%
exp-prod47.8%
distribute-lft-neg-out47.8%
distribute-rgt-neg-in47.8%
metadata-eval47.8%
exp-to-pow49.6%
Simplified49.6%
if -5.79999999999999989e-185 < l Initial program 67.9%
Simplified68.5%
Taylor expanded in d around inf 40.3%
*-commutative40.3%
associate-/r*40.8%
Simplified40.8%
Final simplification43.9%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (* d (pow (* l h) -0.5)))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
return d * pow((l * h), -0.5);
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
code = d * ((l * h) ** (-0.5d0))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d * Math.pow((l * h), -0.5);
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d * math.pow((l * h), -0.5)
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d * (Float64(l * h) ^ -0.5)) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d * ((l * h) ^ -0.5);
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
d \cdot {\left(\ell \cdot h\right)}^{-0.5}
\end{array}
Initial program 66.7%
Simplified67.1%
add-sqr-sqrt67.1%
pow267.1%
sqrt-prod67.1%
sqrt-pow168.1%
metadata-eval68.1%
pow168.1%
div-inv68.1%
metadata-eval68.1%
Applied egg-rr68.1%
Taylor expanded in d around inf 28.5%
unpow1/228.5%
sqr-pow28.4%
sqr-pow28.5%
rem-exp-log27.7%
exp-neg27.7%
exp-prod27.7%
distribute-lft-neg-out27.7%
distribute-rgt-neg-in27.7%
metadata-eval27.7%
exp-to-pow28.5%
Simplified28.5%
Final simplification28.5%
herbie shell --seed 2024050
(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)))))