
(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 23 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
(+
1.0
(/
(* (/ D_m (/ d M_m)) (* (/ D_m (/ (* d 4.0) M_m)) (* h -0.5)))
l))))
(if (<= d -1.55e-286)
(* (/ (pow (- 0.0 d) 0.5) (sqrt (- 0.0 l))) (* (sqrt (/ d h)) t_0))
(if (<= d 5.6e-226)
(*
(/ 1.0 h)
(+
(* D_m (* (/ (* (* M_m (* D_m M_m)) -0.125) d) (pow (/ h l) 1.5)))
(* d (pow (/ h l) 0.5))))
(* (sqrt (/ d l)) (* t_0 (/ (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 = 1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / l);
double tmp;
if (d <= -1.55e-286) {
tmp = (pow((0.0 - d), 0.5) / sqrt((0.0 - l))) * (sqrt((d / h)) * t_0);
} else if (d <= 5.6e-226) {
tmp = (1.0 / h) * ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * pow((h / l), 1.5))) + (d * pow((h / l), 0.5)));
} else {
tmp = sqrt((d / l)) * (t_0 * (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) :: tmp
t_0 = 1.0d0 + (((d_m / (d / m_m)) * ((d_m / ((d * 4.0d0) / m_m)) * (h * (-0.5d0)))) / l)
if (d <= (-1.55d-286)) then
tmp = (((0.0d0 - d) ** 0.5d0) / sqrt((0.0d0 - l))) * (sqrt((d / h)) * t_0)
else if (d <= 5.6d-226) then
tmp = (1.0d0 / h) * ((d_m * ((((m_m * (d_m * m_m)) * (-0.125d0)) / d) * ((h / l) ** 1.5d0))) + (d * ((h / l) ** 0.5d0)))
else
tmp = sqrt((d / l)) * (t_0 * (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 = 1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / l);
double tmp;
if (d <= -1.55e-286) {
tmp = (Math.pow((0.0 - d), 0.5) / Math.sqrt((0.0 - l))) * (Math.sqrt((d / h)) * t_0);
} else if (d <= 5.6e-226) {
tmp = (1.0 / h) * ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * Math.pow((h / l), 1.5))) + (d * Math.pow((h / l), 0.5)));
} else {
tmp = Math.sqrt((d / l)) * (t_0 * (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 = 1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / l) tmp = 0 if d <= -1.55e-286: tmp = (math.pow((0.0 - d), 0.5) / math.sqrt((0.0 - l))) * (math.sqrt((d / h)) * t_0) elif d <= 5.6e-226: tmp = (1.0 / h) * ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * math.pow((h / l), 1.5))) + (d * math.pow((h / l), 0.5))) else: tmp = math.sqrt((d / l)) * (t_0 * (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(1.0 + Float64(Float64(Float64(D_m / Float64(d / M_m)) * Float64(Float64(D_m / Float64(Float64(d * 4.0) / M_m)) * Float64(h * -0.5))) / l)) tmp = 0.0 if (d <= -1.55e-286) tmp = Float64(Float64((Float64(0.0 - d) ^ 0.5) / sqrt(Float64(0.0 - l))) * Float64(sqrt(Float64(d / h)) * t_0)); elseif (d <= 5.6e-226) tmp = Float64(Float64(1.0 / h) * Float64(Float64(D_m * Float64(Float64(Float64(Float64(M_m * Float64(D_m * M_m)) * -0.125) / d) * (Float64(h / l) ^ 1.5))) + Float64(d * (Float64(h / l) ^ 0.5)))); else tmp = Float64(sqrt(Float64(d / l)) * Float64(t_0 * 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 = 1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / l);
tmp = 0.0;
if (d <= -1.55e-286)
tmp = (((0.0 - d) ^ 0.5) / sqrt((0.0 - l))) * (sqrt((d / h)) * t_0);
elseif (d <= 5.6e-226)
tmp = (1.0 / h) * ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * ((h / l) ^ 1.5))) + (d * ((h / l) ^ 0.5)));
else
tmp = sqrt((d / l)) * (t_0 * (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[(1.0 + N[(N[(N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m / N[(N[(d * 4.0), $MachinePrecision] / M$95$m), $MachinePrecision]), $MachinePrecision] * N[(h * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -1.55e-286], N[(N[(N[Power[N[(0.0 - d), $MachinePrecision], 0.5], $MachinePrecision] / N[Sqrt[N[(0.0 - l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 5.6e-226], N[(N[(1.0 / h), $MachinePrecision] * N[(N[(D$95$m * N[(N[(N[(N[(M$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision] * N[Power[N[(h / l), $MachinePrecision], 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(d * N[Power[N[(h / l), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 1 + \frac{\frac{D\_m}{\frac{d}{M\_m}} \cdot \left(\frac{D\_m}{\frac{d \cdot 4}{M\_m}} \cdot \left(h \cdot -0.5\right)\right)}{\ell}\\
\mathbf{if}\;d \leq -1.55 \cdot 10^{-286}:\\
\;\;\;\;\frac{{\left(0 - d\right)}^{0.5}}{\sqrt{0 - \ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot t\_0\right)\\
\mathbf{elif}\;d \leq 5.6 \cdot 10^{-226}:\\
\;\;\;\;\frac{1}{h} \cdot \left(D\_m \cdot \left(\frac{\left(M\_m \cdot \left(D\_m \cdot M\_m\right)\right) \cdot -0.125}{d} \cdot {\left(\frac{h}{\ell}\right)}^{1.5}\right) + d \cdot {\left(\frac{h}{\ell}\right)}^{0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(t\_0 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right)\\
\end{array}
\end{array}
if d < -1.54999999999999991e-286Initial program 68.8%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified57.5%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6468.8%
Applied egg-rr68.8%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr69.8%
div-invN/A
clear-numN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.9%
Applied egg-rr69.9%
frac-2negN/A
sqrt-divN/A
/-lowering-/.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
sub0-negN/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f6478.7%
Applied egg-rr78.7%
if -1.54999999999999991e-286 < d < 5.60000000000000016e-226Initial program 36.8%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified9.3%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified22.9%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
Applied egg-rr59.8%
if 5.60000000000000016e-226 < d Initial program 71.7%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified57.6%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6471.7%
Applied egg-rr71.7%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr74.5%
div-invN/A
clear-numN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6476.0%
Applied egg-rr76.0%
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6483.8%
Applied egg-rr83.8%
Final simplification79.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 4.0) M_m)))
(if (<= d -3.2e-211)
(*
(/ (sqrt (- 0.0 d)) (pow (- 0.0 l) 0.5))
(*
(sqrt (/ d h))
(+ 1.0 (/ (* (* h -0.5) (/ (* D_m (/ M_m d)) (/ t_0 D_m))) l))))
(if (<= d 4.2e-224)
(/
(+
(* D_m (* (/ (* (* M_m (* D_m M_m)) -0.125) d) (pow (/ h l) 1.5)))
(* d (sqrt (/ h l))))
h)
(*
(sqrt (/ d l))
(*
(+ 1.0 (/ (* (/ D_m (/ d M_m)) (* (/ D_m t_0) (* h -0.5))) 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 * 4.0) / M_m;
double tmp;
if (d <= -3.2e-211) {
tmp = (sqrt((0.0 - d)) / pow((0.0 - l), 0.5)) * (sqrt((d / h)) * (1.0 + (((h * -0.5) * ((D_m * (M_m / d)) / (t_0 / D_m))) / l)));
} else if (d <= 4.2e-224) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * pow((h / l), 1.5))) + (d * sqrt((h / l)))) / h;
} else {
tmp = sqrt((d / l)) * ((1.0 + (((D_m / (d / M_m)) * ((D_m / t_0) * (h * -0.5))) / 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) :: tmp
t_0 = (d * 4.0d0) / m_m
if (d <= (-3.2d-211)) then
tmp = (sqrt((0.0d0 - d)) / ((0.0d0 - l) ** 0.5d0)) * (sqrt((d / h)) * (1.0d0 + (((h * (-0.5d0)) * ((d_m * (m_m / d)) / (t_0 / d_m))) / l)))
else if (d <= 4.2d-224) then
tmp = ((d_m * ((((m_m * (d_m * m_m)) * (-0.125d0)) / d) * ((h / l) ** 1.5d0))) + (d * sqrt((h / l)))) / h
else
tmp = sqrt((d / l)) * ((1.0d0 + (((d_m / (d / m_m)) * ((d_m / t_0) * (h * (-0.5d0)))) / 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 * 4.0) / M_m;
double tmp;
if (d <= -3.2e-211) {
tmp = (Math.sqrt((0.0 - d)) / Math.pow((0.0 - l), 0.5)) * (Math.sqrt((d / h)) * (1.0 + (((h * -0.5) * ((D_m * (M_m / d)) / (t_0 / D_m))) / l)));
} else if (d <= 4.2e-224) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * Math.pow((h / l), 1.5))) + (d * Math.sqrt((h / l)))) / h;
} else {
tmp = Math.sqrt((d / l)) * ((1.0 + (((D_m / (d / M_m)) * ((D_m / t_0) * (h * -0.5))) / 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 * 4.0) / M_m tmp = 0 if d <= -3.2e-211: tmp = (math.sqrt((0.0 - d)) / math.pow((0.0 - l), 0.5)) * (math.sqrt((d / h)) * (1.0 + (((h * -0.5) * ((D_m * (M_m / d)) / (t_0 / D_m))) / l))) elif d <= 4.2e-224: tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * math.pow((h / l), 1.5))) + (d * math.sqrt((h / l)))) / h else: tmp = math.sqrt((d / l)) * ((1.0 + (((D_m / (d / M_m)) * ((D_m / t_0) * (h * -0.5))) / 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(Float64(d * 4.0) / M_m) tmp = 0.0 if (d <= -3.2e-211) tmp = Float64(Float64(sqrt(Float64(0.0 - d)) / (Float64(0.0 - l) ^ 0.5)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(Float64(h * -0.5) * Float64(Float64(D_m * Float64(M_m / d)) / Float64(t_0 / D_m))) / l)))); elseif (d <= 4.2e-224) tmp = Float64(Float64(Float64(D_m * Float64(Float64(Float64(Float64(M_m * Float64(D_m * M_m)) * -0.125) / d) * (Float64(h / l) ^ 1.5))) + Float64(d * sqrt(Float64(h / l)))) / h); else tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(1.0 + Float64(Float64(Float64(D_m / Float64(d / M_m)) * Float64(Float64(D_m / t_0) * Float64(h * -0.5))) / 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 * 4.0) / M_m;
tmp = 0.0;
if (d <= -3.2e-211)
tmp = (sqrt((0.0 - d)) / ((0.0 - l) ^ 0.5)) * (sqrt((d / h)) * (1.0 + (((h * -0.5) * ((D_m * (M_m / d)) / (t_0 / D_m))) / l)));
elseif (d <= 4.2e-224)
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * ((h / l) ^ 1.5))) + (d * sqrt((h / l)))) / h;
else
tmp = sqrt((d / l)) * ((1.0 + (((D_m / (d / M_m)) * ((D_m / t_0) * (h * -0.5))) / 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[(N[(d * 4.0), $MachinePrecision] / M$95$m), $MachinePrecision]}, If[LessEqual[d, -3.2e-211], N[(N[(N[Sqrt[N[(0.0 - d), $MachinePrecision]], $MachinePrecision] / N[Power[N[(0.0 - l), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(N[(h * -0.5), $MachinePrecision] * N[(N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 / D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 4.2e-224], N[(N[(N[(D$95$m * N[(N[(N[(N[(M$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision] * N[Power[N[(h / l), $MachinePrecision], 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(d * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / h), $MachinePrecision], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 + N[(N[(N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m / t$95$0), $MachinePrecision] * N[(h * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{d \cdot 4}{M\_m}\\
\mathbf{if}\;d \leq -3.2 \cdot 10^{-211}:\\
\;\;\;\;\frac{\sqrt{0 - d}}{{\left(0 - \ell\right)}^{0.5}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{\left(h \cdot -0.5\right) \cdot \frac{D\_m \cdot \frac{M\_m}{d}}{\frac{t\_0}{D\_m}}}{\ell}\right)\right)\\
\mathbf{elif}\;d \leq 4.2 \cdot 10^{-224}:\\
\;\;\;\;\frac{D\_m \cdot \left(\frac{\left(M\_m \cdot \left(D\_m \cdot M\_m\right)\right) \cdot -0.125}{d} \cdot {\left(\frac{h}{\ell}\right)}^{1.5}\right) + d \cdot \sqrt{\frac{h}{\ell}}}{h}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\left(1 + \frac{\frac{D\_m}{\frac{d}{M\_m}} \cdot \left(\frac{D\_m}{t\_0} \cdot \left(h \cdot -0.5\right)\right)}{\ell}\right) \cdot \frac{\sqrt{d}}{\sqrt{h}}\right)\\
\end{array}
\end{array}
if d < -3.19999999999999985e-211Initial program 74.9%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified62.4%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6474.9%
Applied egg-rr74.9%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr75.2%
frac-2negN/A
sqrt-divN/A
pow1/2N/A
/-lowering-/.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
neg-sub0N/A
--lowering--.f6482.6%
Applied egg-rr82.6%
if -3.19999999999999985e-211 < d < 4.20000000000000013e-224Initial program 31.0%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified13.8%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified17.0%
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
times-fracN/A
sqrt-prodN/A
times-fracN/A
Applied egg-rr57.6%
if 4.20000000000000013e-224 < d Initial program 71.7%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified57.6%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6471.7%
Applied egg-rr71.7%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr74.5%
div-invN/A
clear-numN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6476.0%
Applied egg-rr76.0%
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6483.8%
Applied egg-rr83.8%
Final simplification79.5%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= d -1.3e-124)
(*
t_0
(*
(sqrt (/ d h))
(+
1.0
(/ (/ (* (* h -0.5) (/ (* D_m M_m) (* d 4.0))) (/ d (* D_m M_m))) l))))
(if (<= d 1.1e-225)
(/
(+
(* D_m (* (/ (* (* M_m (* D_m M_m)) -0.125) d) (pow (/ h l) 1.5)))
(* d (sqrt (/ h l))))
h)
(*
t_0
(*
(+
1.0
(/ (* (/ D_m (/ d M_m)) (* (/ D_m (/ (* d 4.0) M_m)) (* h -0.5))) 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 = sqrt((d / l));
double tmp;
if (d <= -1.3e-124) {
tmp = t_0 * (sqrt((d / h)) * (1.0 + ((((h * -0.5) * ((D_m * M_m) / (d * 4.0))) / (d / (D_m * M_m))) / l)));
} else if (d <= 1.1e-225) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * pow((h / l), 1.5))) + (d * sqrt((h / l)))) / h;
} else {
tmp = t_0 * ((1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / 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) :: tmp
t_0 = sqrt((d / l))
if (d <= (-1.3d-124)) then
tmp = t_0 * (sqrt((d / h)) * (1.0d0 + ((((h * (-0.5d0)) * ((d_m * m_m) / (d * 4.0d0))) / (d / (d_m * m_m))) / l)))
else if (d <= 1.1d-225) then
tmp = ((d_m * ((((m_m * (d_m * m_m)) * (-0.125d0)) / d) * ((h / l) ** 1.5d0))) + (d * sqrt((h / l)))) / h
else
tmp = t_0 * ((1.0d0 + (((d_m / (d / m_m)) * ((d_m / ((d * 4.0d0) / m_m)) * (h * (-0.5d0)))) / 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 = Math.sqrt((d / l));
double tmp;
if (d <= -1.3e-124) {
tmp = t_0 * (Math.sqrt((d / h)) * (1.0 + ((((h * -0.5) * ((D_m * M_m) / (d * 4.0))) / (d / (D_m * M_m))) / l)));
} else if (d <= 1.1e-225) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * Math.pow((h / l), 1.5))) + (d * Math.sqrt((h / l)))) / h;
} else {
tmp = t_0 * ((1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / 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 = math.sqrt((d / l)) tmp = 0 if d <= -1.3e-124: tmp = t_0 * (math.sqrt((d / h)) * (1.0 + ((((h * -0.5) * ((D_m * M_m) / (d * 4.0))) / (d / (D_m * M_m))) / l))) elif d <= 1.1e-225: tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * math.pow((h / l), 1.5))) + (d * math.sqrt((h / l)))) / h else: tmp = t_0 * ((1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / 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 = sqrt(Float64(d / l)) tmp = 0.0 if (d <= -1.3e-124) tmp = Float64(t_0 * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(Float64(Float64(h * -0.5) * Float64(Float64(D_m * M_m) / Float64(d * 4.0))) / Float64(d / Float64(D_m * M_m))) / l)))); elseif (d <= 1.1e-225) tmp = Float64(Float64(Float64(D_m * Float64(Float64(Float64(Float64(M_m * Float64(D_m * M_m)) * -0.125) / d) * (Float64(h / l) ^ 1.5))) + Float64(d * sqrt(Float64(h / l)))) / h); else tmp = Float64(t_0 * Float64(Float64(1.0 + Float64(Float64(Float64(D_m / Float64(d / M_m)) * Float64(Float64(D_m / Float64(Float64(d * 4.0) / M_m)) * Float64(h * -0.5))) / 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 = sqrt((d / l));
tmp = 0.0;
if (d <= -1.3e-124)
tmp = t_0 * (sqrt((d / h)) * (1.0 + ((((h * -0.5) * ((D_m * M_m) / (d * 4.0))) / (d / (D_m * M_m))) / l)));
elseif (d <= 1.1e-225)
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * ((h / l) ^ 1.5))) + (d * sqrt((h / l)))) / h;
else
tmp = t_0 * ((1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / 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[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -1.3e-124], N[(t$95$0 * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(N[(N[(h * -0.5), $MachinePrecision] * N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.1e-225], N[(N[(N[(D$95$m * N[(N[(N[(N[(M$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision] * N[Power[N[(h / l), $MachinePrecision], 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(d * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / h), $MachinePrecision], N[(t$95$0 * N[(N[(1.0 + N[(N[(N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m / N[(N[(d * 4.0), $MachinePrecision] / M$95$m), $MachinePrecision]), $MachinePrecision] * N[(h * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;d \leq -1.3 \cdot 10^{-124}:\\
\;\;\;\;t\_0 \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{\frac{\left(h \cdot -0.5\right) \cdot \frac{D\_m \cdot M\_m}{d \cdot 4}}{\frac{d}{D\_m \cdot M\_m}}}{\ell}\right)\right)\\
\mathbf{elif}\;d \leq 1.1 \cdot 10^{-225}:\\
\;\;\;\;\frac{D\_m \cdot \left(\frac{\left(M\_m \cdot \left(D\_m \cdot M\_m\right)\right) \cdot -0.125}{d} \cdot {\left(\frac{h}{\ell}\right)}^{1.5}\right) + d \cdot \sqrt{\frac{h}{\ell}}}{h}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(\left(1 + \frac{\frac{D\_m}{\frac{d}{M\_m}} \cdot \left(\frac{D\_m}{\frac{d \cdot 4}{M\_m}} \cdot \left(h \cdot -0.5\right)\right)}{\ell}\right) \cdot \frac{\sqrt{d}}{\sqrt{h}}\right)\\
\end{array}
\end{array}
if d < -1.3e-124Initial program 79.6%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified68.1%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6479.6%
Applied egg-rr79.6%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr80.0%
div-invN/A
clear-numN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6480.1%
Applied egg-rr80.1%
/-lowering-/.f64N/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/r/N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6481.2%
Applied egg-rr81.2%
if -1.3e-124 < d < 1.1e-225Initial program 36.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified18.9%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified19.5%
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
times-fracN/A
sqrt-prodN/A
times-fracN/A
Applied egg-rr54.8%
if 1.1e-225 < d Initial program 71.7%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified57.6%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6471.7%
Applied egg-rr71.7%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr74.5%
div-invN/A
clear-numN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6476.0%
Applied egg-rr76.0%
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6483.8%
Applied egg-rr83.8%
Final simplification76.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))) (t_1 (sqrt (/ d h))))
(if (<= d -9.5e-125)
(*
t_0
(*
t_1
(+
1.0
(* (* (/ (* D_m M_m) (* d 4.0)) (/ (* D_m M_m) d)) (* -0.5 (/ h l))))))
(if (<= d 1.2e-222)
(/
(+
(* D_m (* (/ (* (* M_m (* D_m M_m)) -0.125) d) (pow (/ h l) 1.5)))
(* d (sqrt (/ h l))))
h)
(if (<= d 7.3e+78)
(*
t_0
(*
t_1
(+
1.0
(/ (* (/ D_m (/ d M_m)) (* (* D_m -0.125) (* M_m (/ h d)))) l))))
(*
(/ d (pow (* l h) 0.5))
(-
1.0
(/
(* (* (* (* M_m M_m) 0.25) (* (/ D_m d) (/ D_m d))) (* 0.5 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 t_0 = sqrt((d / l));
double t_1 = sqrt((d / h));
double tmp;
if (d <= -9.5e-125) {
tmp = t_0 * (t_1 * (1.0 + ((((D_m * M_m) / (d * 4.0)) * ((D_m * M_m) / d)) * (-0.5 * (h / l)))));
} else if (d <= 1.2e-222) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * pow((h / l), 1.5))) + (d * sqrt((h / l)))) / h;
} else if (d <= 7.3e+78) {
tmp = t_0 * (t_1 * (1.0 + (((D_m / (d / M_m)) * ((D_m * -0.125) * (M_m * (h / d)))) / l)));
} else {
tmp = (d / pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * 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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sqrt((d / l))
t_1 = sqrt((d / h))
if (d <= (-9.5d-125)) then
tmp = t_0 * (t_1 * (1.0d0 + ((((d_m * m_m) / (d * 4.0d0)) * ((d_m * m_m) / d)) * ((-0.5d0) * (h / l)))))
else if (d <= 1.2d-222) then
tmp = ((d_m * ((((m_m * (d_m * m_m)) * (-0.125d0)) / d) * ((h / l) ** 1.5d0))) + (d * sqrt((h / l)))) / h
else if (d <= 7.3d+78) then
tmp = t_0 * (t_1 * (1.0d0 + (((d_m / (d / m_m)) * ((d_m * (-0.125d0)) * (m_m * (h / d)))) / l)))
else
tmp = (d / ((l * h) ** 0.5d0)) * (1.0d0 - (((((m_m * m_m) * 0.25d0) * ((d_m / d) * (d_m / d))) * (0.5d0 * 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 t_0 = Math.sqrt((d / l));
double t_1 = Math.sqrt((d / h));
double tmp;
if (d <= -9.5e-125) {
tmp = t_0 * (t_1 * (1.0 + ((((D_m * M_m) / (d * 4.0)) * ((D_m * M_m) / d)) * (-0.5 * (h / l)))));
} else if (d <= 1.2e-222) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * Math.pow((h / l), 1.5))) + (d * Math.sqrt((h / l)))) / h;
} else if (d <= 7.3e+78) {
tmp = t_0 * (t_1 * (1.0 + (((D_m / (d / M_m)) * ((D_m * -0.125) * (M_m * (h / d)))) / l)));
} else {
tmp = (d / Math.pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * 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): t_0 = math.sqrt((d / l)) t_1 = math.sqrt((d / h)) tmp = 0 if d <= -9.5e-125: tmp = t_0 * (t_1 * (1.0 + ((((D_m * M_m) / (d * 4.0)) * ((D_m * M_m) / d)) * (-0.5 * (h / l))))) elif d <= 1.2e-222: tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * math.pow((h / l), 1.5))) + (d * math.sqrt((h / l)))) / h elif d <= 7.3e+78: tmp = t_0 * (t_1 * (1.0 + (((D_m / (d / M_m)) * ((D_m * -0.125) * (M_m * (h / d)))) / l))) else: tmp = (d / math.pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * 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) t_0 = sqrt(Float64(d / l)) t_1 = sqrt(Float64(d / h)) tmp = 0.0 if (d <= -9.5e-125) tmp = Float64(t_0 * Float64(t_1 * Float64(1.0 + Float64(Float64(Float64(Float64(D_m * M_m) / Float64(d * 4.0)) * Float64(Float64(D_m * M_m) / d)) * Float64(-0.5 * Float64(h / l)))))); elseif (d <= 1.2e-222) tmp = Float64(Float64(Float64(D_m * Float64(Float64(Float64(Float64(M_m * Float64(D_m * M_m)) * -0.125) / d) * (Float64(h / l) ^ 1.5))) + Float64(d * sqrt(Float64(h / l)))) / h); elseif (d <= 7.3e+78) tmp = Float64(t_0 * Float64(t_1 * Float64(1.0 + Float64(Float64(Float64(D_m / Float64(d / M_m)) * Float64(Float64(D_m * -0.125) * Float64(M_m * Float64(h / d)))) / l)))); else tmp = Float64(Float64(d / (Float64(l * h) ^ 0.5)) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(M_m * M_m) * 0.25) * Float64(Float64(D_m / d) * Float64(D_m / d))) * Float64(0.5 * 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)
t_0 = sqrt((d / l));
t_1 = sqrt((d / h));
tmp = 0.0;
if (d <= -9.5e-125)
tmp = t_0 * (t_1 * (1.0 + ((((D_m * M_m) / (d * 4.0)) * ((D_m * M_m) / d)) * (-0.5 * (h / l)))));
elseif (d <= 1.2e-222)
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * ((h / l) ^ 1.5))) + (d * sqrt((h / l)))) / h;
elseif (d <= 7.3e+78)
tmp = t_0 * (t_1 * (1.0 + (((D_m / (d / M_m)) * ((D_m * -0.125) * (M_m * (h / d)))) / l)));
else
tmp = (d / ((l * h) ^ 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * 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_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -9.5e-125], N[(t$95$0 * N[(t$95$1 * N[(1.0 + N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 4.0), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] * N[(-0.5 * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.2e-222], N[(N[(N[(D$95$m * N[(N[(N[(N[(M$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision] * N[Power[N[(h / l), $MachinePrecision], 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(d * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / h), $MachinePrecision], If[LessEqual[d, 7.3e+78], N[(t$95$0 * N[(t$95$1 * N[(1.0 + N[(N[(N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m * -0.125), $MachinePrecision] * N[(M$95$m * N[(h / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Power[N[(l * h), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * 0.25), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 * h), $MachinePrecision]), $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}
t_0 := \sqrt{\frac{d}{\ell}}\\
t_1 := \sqrt{\frac{d}{h}}\\
\mathbf{if}\;d \leq -9.5 \cdot 10^{-125}:\\
\;\;\;\;t\_0 \cdot \left(t\_1 \cdot \left(1 + \left(\frac{D\_m \cdot M\_m}{d \cdot 4} \cdot \frac{D\_m \cdot M\_m}{d}\right) \cdot \left(-0.5 \cdot \frac{h}{\ell}\right)\right)\right)\\
\mathbf{elif}\;d \leq 1.2 \cdot 10^{-222}:\\
\;\;\;\;\frac{D\_m \cdot \left(\frac{\left(M\_m \cdot \left(D\_m \cdot M\_m\right)\right) \cdot -0.125}{d} \cdot {\left(\frac{h}{\ell}\right)}^{1.5}\right) + d \cdot \sqrt{\frac{h}{\ell}}}{h}\\
\mathbf{elif}\;d \leq 7.3 \cdot 10^{+78}:\\
\;\;\;\;t\_0 \cdot \left(t\_1 \cdot \left(1 + \frac{\frac{D\_m}{\frac{d}{M\_m}} \cdot \left(\left(D\_m \cdot -0.125\right) \cdot \left(M\_m \cdot \frac{h}{d}\right)\right)}{\ell}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{{\left(\ell \cdot h\right)}^{0.5}} \cdot \left(1 - \frac{\left(\left(\left(M\_m \cdot M\_m\right) \cdot 0.25\right) \cdot \left(\frac{D\_m}{d} \cdot \frac{D\_m}{d}\right)\right) \cdot \left(0.5 \cdot h\right)}{\ell}\right)\\
\end{array}
\end{array}
if d < -9.50000000000000031e-125Initial program 79.6%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified68.1%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6479.6%
Applied egg-rr79.6%
if -9.50000000000000031e-125 < d < 1.19999999999999997e-222Initial program 37.6%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified18.5%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified19.1%
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
times-fracN/A
sqrt-prodN/A
times-fracN/A
Applied egg-rr55.6%
if 1.19999999999999997e-222 < d < 7.3e78Initial program 72.3%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified67.1%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6472.3%
Applied egg-rr72.3%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr75.3%
div-invN/A
clear-numN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6476.6%
Applied egg-rr76.6%
Taylor expanded in D around 0
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6473.1%
Simplified73.1%
if 7.3e78 < d Initial program 70.3%
Applied egg-rr69.5%
Final simplification71.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 -3.05e+103)
(/
(+
(* D_m (* (/ (* (* M_m (* D_m M_m)) -0.125) d) (pow (/ h l) 1.5)))
(* d (sqrt (/ h l))))
h)
(if (<= l 6.6e+132)
(*
(*
(sqrt (/ d h))
(+
1.0
(/ (* (/ D_m (/ d M_m)) (* (/ D_m (/ (* d 4.0) M_m)) (* h -0.5))) l)))
(sqrt (/ d l)))
(* d (/ (pow h -0.5) (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 <= -3.05e+103) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * pow((h / l), 1.5))) + (d * sqrt((h / l)))) / h;
} else if (l <= 6.6e+132) {
tmp = (sqrt((d / h)) * (1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / l))) * sqrt((d / l));
} else {
tmp = d * (pow(h, -0.5) / 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 <= (-3.05d+103)) then
tmp = ((d_m * ((((m_m * (d_m * m_m)) * (-0.125d0)) / d) * ((h / l) ** 1.5d0))) + (d * sqrt((h / l)))) / h
else if (l <= 6.6d+132) then
tmp = (sqrt((d / h)) * (1.0d0 + (((d_m / (d / m_m)) * ((d_m / ((d * 4.0d0) / m_m)) * (h * (-0.5d0)))) / l))) * sqrt((d / l))
else
tmp = d * ((h ** (-0.5d0)) / 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 <= -3.05e+103) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * Math.pow((h / l), 1.5))) + (d * Math.sqrt((h / l)))) / h;
} else if (l <= 6.6e+132) {
tmp = (Math.sqrt((d / h)) * (1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / l))) * Math.sqrt((d / l));
} else {
tmp = d * (Math.pow(h, -0.5) / 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 <= -3.05e+103: tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * math.pow((h / l), 1.5))) + (d * math.sqrt((h / l)))) / h elif l <= 6.6e+132: tmp = (math.sqrt((d / h)) * (1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / l))) * math.sqrt((d / l)) else: tmp = d * (math.pow(h, -0.5) / 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 <= -3.05e+103) tmp = Float64(Float64(Float64(D_m * Float64(Float64(Float64(Float64(M_m * Float64(D_m * M_m)) * -0.125) / d) * (Float64(h / l) ^ 1.5))) + Float64(d * sqrt(Float64(h / l)))) / h); elseif (l <= 6.6e+132) tmp = Float64(Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(Float64(D_m / Float64(d / M_m)) * Float64(Float64(D_m / Float64(Float64(d * 4.0) / M_m)) * Float64(h * -0.5))) / l))) * sqrt(Float64(d / l))); else tmp = Float64(d * Float64((h ^ -0.5) / 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 <= -3.05e+103)
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * ((h / l) ^ 1.5))) + (d * sqrt((h / l)))) / h;
elseif (l <= 6.6e+132)
tmp = (sqrt((d / h)) * (1.0 + (((D_m / (d / M_m)) * ((D_m / ((d * 4.0) / M_m)) * (h * -0.5))) / l))) * sqrt((d / l));
else
tmp = d * ((h ^ -0.5) / 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, -3.05e+103], N[(N[(N[(D$95$m * N[(N[(N[(N[(M$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision] * N[Power[N[(h / l), $MachinePrecision], 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(d * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / h), $MachinePrecision], If[LessEqual[l, 6.6e+132], N[(N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m / N[(N[(d * 4.0), $MachinePrecision] / M$95$m), $MachinePrecision]), $MachinePrecision] * N[(h * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[h, -0.5], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -3.05 \cdot 10^{+103}:\\
\;\;\;\;\frac{D\_m \cdot \left(\frac{\left(M\_m \cdot \left(D\_m \cdot M\_m\right)\right) \cdot -0.125}{d} \cdot {\left(\frac{h}{\ell}\right)}^{1.5}\right) + d \cdot \sqrt{\frac{h}{\ell}}}{h}\\
\mathbf{elif}\;\ell \leq 6.6 \cdot 10^{+132}:\\
\;\;\;\;\left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{\frac{D\_m}{\frac{d}{M\_m}} \cdot \left(\frac{D\_m}{\frac{d \cdot 4}{M\_m}} \cdot \left(h \cdot -0.5\right)\right)}{\ell}\right)\right) \cdot \sqrt{\frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{{h}^{-0.5}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -3.0500000000000001e103Initial program 46.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified32.5%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified13.3%
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
times-fracN/A
sqrt-prodN/A
times-fracN/A
Applied egg-rr49.9%
if -3.0500000000000001e103 < l < 6.6000000000000006e132Initial program 75.6%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified62.7%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6475.6%
Applied egg-rr75.6%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr79.1%
div-invN/A
clear-numN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6479.4%
Applied egg-rr79.4%
if 6.6000000000000006e132 < l Initial program 53.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified35.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.6%
Simplified48.6%
associate-/r*N/A
sqrt-divN/A
pow1/2N/A
/-lowering-/.f64N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
sqrt-lowering-sqrt.f6474.8%
Applied egg-rr74.8%
Final simplification73.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -6.6e+72)
(/
(+
(* D_m (* (/ (* (* M_m (* D_m M_m)) -0.125) d) (pow (/ h l) 1.5)))
(* d (sqrt (/ h l))))
h)
(if (<= l 2.05e+130)
(*
(sqrt (/ d l))
(*
(sqrt (/ d h))
(+ 1.0 (/ (* (/ D_m (/ d M_m)) (* (* D_m -0.125) (* M_m (/ h d)))) l))))
(* d (/ (pow h -0.5) (sqrt l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -6.6e+72) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * pow((h / l), 1.5))) + (d * sqrt((h / l)))) / h;
} else if (l <= 2.05e+130) {
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + (((D_m / (d / M_m)) * ((D_m * -0.125) * (M_m * (h / d)))) / l)));
} else {
tmp = d * (pow(h, -0.5) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-6.6d+72)) then
tmp = ((d_m * ((((m_m * (d_m * m_m)) * (-0.125d0)) / d) * ((h / l) ** 1.5d0))) + (d * sqrt((h / l)))) / h
else if (l <= 2.05d+130) then
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0d0 + (((d_m / (d / m_m)) * ((d_m * (-0.125d0)) * (m_m * (h / d)))) / l)))
else
tmp = d * ((h ** (-0.5d0)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -6.6e+72) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * Math.pow((h / l), 1.5))) + (d * Math.sqrt((h / l)))) / h;
} else if (l <= 2.05e+130) {
tmp = Math.sqrt((d / l)) * (Math.sqrt((d / h)) * (1.0 + (((D_m / (d / M_m)) * ((D_m * -0.125) * (M_m * (h / d)))) / l)));
} else {
tmp = d * (Math.pow(h, -0.5) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -6.6e+72: tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * math.pow((h / l), 1.5))) + (d * math.sqrt((h / l)))) / h elif l <= 2.05e+130: tmp = math.sqrt((d / l)) * (math.sqrt((d / h)) * (1.0 + (((D_m / (d / M_m)) * ((D_m * -0.125) * (M_m * (h / d)))) / l))) else: tmp = d * (math.pow(h, -0.5) / math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -6.6e+72) tmp = Float64(Float64(Float64(D_m * Float64(Float64(Float64(Float64(M_m * Float64(D_m * M_m)) * -0.125) / d) * (Float64(h / l) ^ 1.5))) + Float64(d * sqrt(Float64(h / l)))) / h); elseif (l <= 2.05e+130) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(Float64(D_m / Float64(d / M_m)) * Float64(Float64(D_m * -0.125) * Float64(M_m * Float64(h / d)))) / l)))); else tmp = Float64(d * Float64((h ^ -0.5) / sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -6.6e+72)
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * ((h / l) ^ 1.5))) + (d * sqrt((h / l)))) / h;
elseif (l <= 2.05e+130)
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + (((D_m / (d / M_m)) * ((D_m * -0.125) * (M_m * (h / d)))) / l)));
else
tmp = d * ((h ^ -0.5) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -6.6e+72], N[(N[(N[(D$95$m * N[(N[(N[(N[(M$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision] * N[Power[N[(h / l), $MachinePrecision], 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(d * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / h), $MachinePrecision], If[LessEqual[l, 2.05e+130], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m * -0.125), $MachinePrecision] * N[(M$95$m * N[(h / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[h, -0.5], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -6.6 \cdot 10^{+72}:\\
\;\;\;\;\frac{D\_m \cdot \left(\frac{\left(M\_m \cdot \left(D\_m \cdot M\_m\right)\right) \cdot -0.125}{d} \cdot {\left(\frac{h}{\ell}\right)}^{1.5}\right) + d \cdot \sqrt{\frac{h}{\ell}}}{h}\\
\mathbf{elif}\;\ell \leq 2.05 \cdot 10^{+130}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{\frac{D\_m}{\frac{d}{M\_m}} \cdot \left(\left(D\_m \cdot -0.125\right) \cdot \left(M\_m \cdot \frac{h}{d}\right)\right)}{\ell}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{{h}^{-0.5}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -6.6e72Initial program 52.3%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified40.3%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified20.5%
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
times-fracN/A
sqrt-prodN/A
times-fracN/A
Applied egg-rr56.5%
if -6.6e72 < l < 2.04999999999999989e130Initial program 75.3%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified61.9%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6475.3%
Applied egg-rr75.3%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr79.0%
div-invN/A
clear-numN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6479.3%
Applied egg-rr79.3%
Taylor expanded in D around 0
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6475.7%
Simplified75.7%
if 2.04999999999999989e130 < l Initial program 53.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified35.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.6%
Simplified48.6%
associate-/r*N/A
sqrt-divN/A
pow1/2N/A
/-lowering-/.f64N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
sqrt-lowering-sqrt.f6474.8%
Applied egg-rr74.8%
Final simplification71.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 -2.45e-293)
(/
(+
(* D_m (* (/ (* (* M_m (* D_m M_m)) -0.125) d) (pow (/ h l) 1.5)))
(* d (sqrt (/ h l))))
h)
(if (<= l 2.25e+131)
(*
(/ d (pow (* l h) 0.5))
(-
1.0
(/ (* (* (* (* M_m M_m) 0.25) (* (/ D_m d) (/ D_m d))) (* 0.5 h)) l)))
(* d (/ (pow h -0.5) (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 <= -2.45e-293) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * pow((h / l), 1.5))) + (d * sqrt((h / l)))) / h;
} else if (l <= 2.25e+131) {
tmp = (d / pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l));
} else {
tmp = d * (pow(h, -0.5) / 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 <= (-2.45d-293)) then
tmp = ((d_m * ((((m_m * (d_m * m_m)) * (-0.125d0)) / d) * ((h / l) ** 1.5d0))) + (d * sqrt((h / l)))) / h
else if (l <= 2.25d+131) then
tmp = (d / ((l * h) ** 0.5d0)) * (1.0d0 - (((((m_m * m_m) * 0.25d0) * ((d_m / d) * (d_m / d))) * (0.5d0 * h)) / l))
else
tmp = d * ((h ** (-0.5d0)) / 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 <= -2.45e-293) {
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * Math.pow((h / l), 1.5))) + (d * Math.sqrt((h / l)))) / h;
} else if (l <= 2.25e+131) {
tmp = (d / Math.pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l));
} else {
tmp = d * (Math.pow(h, -0.5) / 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 <= -2.45e-293: tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * math.pow((h / l), 1.5))) + (d * math.sqrt((h / l)))) / h elif l <= 2.25e+131: tmp = (d / math.pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l)) else: tmp = d * (math.pow(h, -0.5) / 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 <= -2.45e-293) tmp = Float64(Float64(Float64(D_m * Float64(Float64(Float64(Float64(M_m * Float64(D_m * M_m)) * -0.125) / d) * (Float64(h / l) ^ 1.5))) + Float64(d * sqrt(Float64(h / l)))) / h); elseif (l <= 2.25e+131) tmp = Float64(Float64(d / (Float64(l * h) ^ 0.5)) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(M_m * M_m) * 0.25) * Float64(Float64(D_m / d) * Float64(D_m / d))) * Float64(0.5 * h)) / l))); else tmp = Float64(d * Float64((h ^ -0.5) / 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 <= -2.45e-293)
tmp = ((D_m * ((((M_m * (D_m * M_m)) * -0.125) / d) * ((h / l) ^ 1.5))) + (d * sqrt((h / l)))) / h;
elseif (l <= 2.25e+131)
tmp = (d / ((l * h) ^ 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l));
else
tmp = d * ((h ^ -0.5) / 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, -2.45e-293], N[(N[(N[(D$95$m * N[(N[(N[(N[(M$95$m * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision] * N[Power[N[(h / l), $MachinePrecision], 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(d * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / h), $MachinePrecision], If[LessEqual[l, 2.25e+131], N[(N[(d / N[Power[N[(l * h), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * 0.25), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 * h), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[h, -0.5], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -2.45 \cdot 10^{-293}:\\
\;\;\;\;\frac{D\_m \cdot \left(\frac{\left(M\_m \cdot \left(D\_m \cdot M\_m\right)\right) \cdot -0.125}{d} \cdot {\left(\frac{h}{\ell}\right)}^{1.5}\right) + d \cdot \sqrt{\frac{h}{\ell}}}{h}\\
\mathbf{elif}\;\ell \leq 2.25 \cdot 10^{+131}:\\
\;\;\;\;\frac{d}{{\left(\ell \cdot h\right)}^{0.5}} \cdot \left(1 - \frac{\left(\left(\left(M\_m \cdot M\_m\right) \cdot 0.25\right) \cdot \left(\frac{D\_m}{d} \cdot \frac{D\_m}{d}\right)\right) \cdot \left(0.5 \cdot h\right)}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{{h}^{-0.5}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -2.45e-293Initial program 67.7%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified55.3%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified24.2%
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
times-fracN/A
sqrt-prodN/A
times-fracN/A
Applied egg-rr61.0%
if -2.45e-293 < l < 2.2500000000000001e131Initial program 72.9%
Applied egg-rr72.0%
if 2.2500000000000001e131 < l Initial program 53.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified35.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.6%
Simplified48.6%
associate-/r*N/A
sqrt-divN/A
pow1/2N/A
/-lowering-/.f64N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
sqrt-lowering-sqrt.f6474.8%
Applied egg-rr74.8%
Final simplification66.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -1.38e-204)
(* (- 0.0 d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l -2.45e-293)
(/ d (pow (* (* l h) (* l h)) 0.25))
(if (<= l 3.7e+132)
(*
(/ d (pow (* l h) 0.5))
(-
1.0
(/ (* (* (* (* M_m M_m) 0.25) (* (/ D_m d) (/ D_m d))) (* 0.5 h)) l)))
(* d (/ (pow h -0.5) (sqrt l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.38e-204) {
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
} else if (l <= -2.45e-293) {
tmp = d / pow(((l * h) * (l * h)), 0.25);
} else if (l <= 3.7e+132) {
tmp = (d / pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l));
} else {
tmp = d * (pow(h, -0.5) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-1.38d-204)) then
tmp = (0.0d0 - d) * sqrt(((1.0d0 / h) / l))
else if (l <= (-2.45d-293)) then
tmp = d / (((l * h) * (l * h)) ** 0.25d0)
else if (l <= 3.7d+132) then
tmp = (d / ((l * h) ** 0.5d0)) * (1.0d0 - (((((m_m * m_m) * 0.25d0) * ((d_m / d) * (d_m / d))) * (0.5d0 * h)) / l))
else
tmp = d * ((h ** (-0.5d0)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.38e-204) {
tmp = (0.0 - d) * Math.sqrt(((1.0 / h) / l));
} else if (l <= -2.45e-293) {
tmp = d / Math.pow(((l * h) * (l * h)), 0.25);
} else if (l <= 3.7e+132) {
tmp = (d / Math.pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l));
} else {
tmp = d * (Math.pow(h, -0.5) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -1.38e-204: tmp = (0.0 - d) * math.sqrt(((1.0 / h) / l)) elif l <= -2.45e-293: tmp = d / math.pow(((l * h) * (l * h)), 0.25) elif l <= 3.7e+132: tmp = (d / math.pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l)) else: tmp = d * (math.pow(h, -0.5) / math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.38e-204) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= -2.45e-293) tmp = Float64(d / (Float64(Float64(l * h) * Float64(l * h)) ^ 0.25)); elseif (l <= 3.7e+132) tmp = Float64(Float64(d / (Float64(l * h) ^ 0.5)) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(M_m * M_m) * 0.25) * Float64(Float64(D_m / d) * Float64(D_m / d))) * Float64(0.5 * h)) / l))); else tmp = Float64(d * Float64((h ^ -0.5) / sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -1.38e-204)
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
elseif (l <= -2.45e-293)
tmp = d / (((l * h) * (l * h)) ^ 0.25);
elseif (l <= 3.7e+132)
tmp = (d / ((l * h) ^ 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l));
else
tmp = d * ((h ^ -0.5) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.38e-204], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -2.45e-293], N[(d / N[Power[N[(N[(l * h), $MachinePrecision] * N[(l * h), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.7e+132], N[(N[(d / N[Power[N[(l * h), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * 0.25), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 * h), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Power[h, -0.5], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.38 \cdot 10^{-204}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq -2.45 \cdot 10^{-293}:\\
\;\;\;\;\frac{d}{{\left(\left(\ell \cdot h\right) \cdot \left(\ell \cdot h\right)\right)}^{0.25}}\\
\mathbf{elif}\;\ell \leq 3.7 \cdot 10^{+132}:\\
\;\;\;\;\frac{d}{{\left(\ell \cdot h\right)}^{0.5}} \cdot \left(1 - \frac{\left(\left(\left(M\_m \cdot M\_m\right) \cdot 0.25\right) \cdot \left(\frac{D\_m}{d} \cdot \frac{D\_m}{d}\right)\right) \cdot \left(0.5 \cdot h\right)}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{{h}^{-0.5}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.3799999999999999e-204Initial program 63.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified51.4%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.2%
Applied egg-rr63.2%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6443.1%
Simplified43.1%
if -1.3799999999999999e-204 < l < -2.45e-293Initial program 94.7%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified78.9%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6443.8%
Simplified43.8%
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6443.8%
Applied egg-rr43.8%
pow1/2N/A
metadata-evalN/A
pow-prod-upN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.9%
Applied egg-rr63.9%
if -2.45e-293 < l < 3.70000000000000011e132Initial program 72.9%
Applied egg-rr72.0%
if 3.70000000000000011e132 < l Initial program 53.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified35.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.6%
Simplified48.6%
associate-/r*N/A
sqrt-divN/A
pow1/2N/A
/-lowering-/.f64N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
sqrt-lowering-sqrt.f6474.8%
Applied egg-rr74.8%
Final simplification59.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 (<= l -1.02e-206)
(* (- 0.0 d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l -2.45e-293)
(/ d (pow (* (* l h) (* l h)) 0.25))
(if (<= l 8.8e+124)
(*
(/ d (pow (* l h) 0.5))
(-
1.0
(/ (* (* (* (* M_m M_m) 0.25) (* (/ D_m d) (/ D_m d))) (* 0.5 h)) l)))
(/ (/ d (sqrt l)) (sqrt h))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.02e-206) {
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
} else if (l <= -2.45e-293) {
tmp = d / pow(((l * h) * (l * h)), 0.25);
} else if (l <= 8.8e+124) {
tmp = (d / pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l));
} else {
tmp = (d / sqrt(l)) / sqrt(h);
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-1.02d-206)) then
tmp = (0.0d0 - d) * sqrt(((1.0d0 / h) / l))
else if (l <= (-2.45d-293)) then
tmp = d / (((l * h) * (l * h)) ** 0.25d0)
else if (l <= 8.8d+124) then
tmp = (d / ((l * h) ** 0.5d0)) * (1.0d0 - (((((m_m * m_m) * 0.25d0) * ((d_m / d) * (d_m / d))) * (0.5d0 * h)) / l))
else
tmp = (d / sqrt(l)) / sqrt(h)
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.02e-206) {
tmp = (0.0 - d) * Math.sqrt(((1.0 / h) / l));
} else if (l <= -2.45e-293) {
tmp = d / Math.pow(((l * h) * (l * h)), 0.25);
} else if (l <= 8.8e+124) {
tmp = (d / Math.pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l));
} else {
tmp = (d / Math.sqrt(l)) / Math.sqrt(h);
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -1.02e-206: tmp = (0.0 - d) * math.sqrt(((1.0 / h) / l)) elif l <= -2.45e-293: tmp = d / math.pow(((l * h) * (l * h)), 0.25) elif l <= 8.8e+124: tmp = (d / math.pow((l * h), 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l)) else: tmp = (d / math.sqrt(l)) / math.sqrt(h) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.02e-206) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= -2.45e-293) tmp = Float64(d / (Float64(Float64(l * h) * Float64(l * h)) ^ 0.25)); elseif (l <= 8.8e+124) tmp = Float64(Float64(d / (Float64(l * h) ^ 0.5)) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(M_m * M_m) * 0.25) * Float64(Float64(D_m / d) * Float64(D_m / d))) * Float64(0.5 * h)) / l))); else tmp = Float64(Float64(d / sqrt(l)) / sqrt(h)); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -1.02e-206)
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
elseif (l <= -2.45e-293)
tmp = d / (((l * h) * (l * h)) ^ 0.25);
elseif (l <= 8.8e+124)
tmp = (d / ((l * h) ^ 0.5)) * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * h)) / l));
else
tmp = (d / sqrt(l)) / sqrt(h);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.02e-206], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -2.45e-293], N[(d / N[Power[N[(N[(l * h), $MachinePrecision] * N[(l * h), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 8.8e+124], N[(N[(d / N[Power[N[(l * h), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * 0.25), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 * h), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $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.02 \cdot 10^{-206}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq -2.45 \cdot 10^{-293}:\\
\;\;\;\;\frac{d}{{\left(\left(\ell \cdot h\right) \cdot \left(\ell \cdot h\right)\right)}^{0.25}}\\
\mathbf{elif}\;\ell \leq 8.8 \cdot 10^{+124}:\\
\;\;\;\;\frac{d}{{\left(\ell \cdot h\right)}^{0.5}} \cdot \left(1 - \frac{\left(\left(\left(M\_m \cdot M\_m\right) \cdot 0.25\right) \cdot \left(\frac{D\_m}{d} \cdot \frac{D\_m}{d}\right)\right) \cdot \left(0.5 \cdot h\right)}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -1.0200000000000001e-206Initial program 63.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified51.4%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.2%
Applied egg-rr63.2%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6443.1%
Simplified43.1%
if -1.0200000000000001e-206 < l < -2.45e-293Initial program 94.7%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified78.9%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6443.8%
Simplified43.8%
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6443.8%
Applied egg-rr43.8%
pow1/2N/A
metadata-evalN/A
pow-prod-upN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.9%
Applied egg-rr63.9%
if -2.45e-293 < l < 8.8000000000000004e124Initial program 72.9%
Applied egg-rr72.0%
if 8.8000000000000004e124 < l Initial program 53.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified35.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.6%
Simplified48.6%
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6448.6%
Applied egg-rr48.6%
sqrt-prodN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6474.6%
Applied egg-rr74.6%
Final simplification59.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ d (pow (* l h) 0.5))))
(if (<= d -1.4e-43)
(* (- 0.0 d) (sqrt (/ (/ 1.0 h) l)))
(if (<= d 1.55e-205)
(*
h
(*
(sqrt (/ 1.0 (* l (* h (* l l)))))
(* (* D_m (* D_m (* M_m M_m))) (/ -0.125 d))))
(if (<= d 5.5e+138)
(*
t_0
(+
1.0
(*
(/ (/ D_m (/ d M_m)) (/ (* d 4.0) (* D_m M_m)))
(/ (* h -0.5) l))))
(*
t_0
(-
1.0
(/
(* (* (* (* M_m M_m) 0.25) (* (/ D_m d) (/ D_m d))) (* 0.5 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 t_0 = d / pow((l * h), 0.5);
double tmp;
if (d <= -1.4e-43) {
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
} else if (d <= 1.55e-205) {
tmp = h * (sqrt((1.0 / (l * (h * (l * l))))) * ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d)));
} else if (d <= 5.5e+138) {
tmp = t_0 * (1.0 + (((D_m / (d / M_m)) / ((d * 4.0) / (D_m * M_m))) * ((h * -0.5) / l)));
} else {
tmp = t_0 * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * 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) :: t_0
real(8) :: tmp
t_0 = d / ((l * h) ** 0.5d0)
if (d <= (-1.4d-43)) then
tmp = (0.0d0 - d) * sqrt(((1.0d0 / h) / l))
else if (d <= 1.55d-205) then
tmp = h * (sqrt((1.0d0 / (l * (h * (l * l))))) * ((d_m * (d_m * (m_m * m_m))) * ((-0.125d0) / d)))
else if (d <= 5.5d+138) then
tmp = t_0 * (1.0d0 + (((d_m / (d / m_m)) / ((d * 4.0d0) / (d_m * m_m))) * ((h * (-0.5d0)) / l)))
else
tmp = t_0 * (1.0d0 - (((((m_m * m_m) * 0.25d0) * ((d_m / d) * (d_m / d))) * (0.5d0 * 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 t_0 = d / Math.pow((l * h), 0.5);
double tmp;
if (d <= -1.4e-43) {
tmp = (0.0 - d) * Math.sqrt(((1.0 / h) / l));
} else if (d <= 1.55e-205) {
tmp = h * (Math.sqrt((1.0 / (l * (h * (l * l))))) * ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d)));
} else if (d <= 5.5e+138) {
tmp = t_0 * (1.0 + (((D_m / (d / M_m)) / ((d * 4.0) / (D_m * M_m))) * ((h * -0.5) / l)));
} else {
tmp = t_0 * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * 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): t_0 = d / math.pow((l * h), 0.5) tmp = 0 if d <= -1.4e-43: tmp = (0.0 - d) * math.sqrt(((1.0 / h) / l)) elif d <= 1.55e-205: tmp = h * (math.sqrt((1.0 / (l * (h * (l * l))))) * ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d))) elif d <= 5.5e+138: tmp = t_0 * (1.0 + (((D_m / (d / M_m)) / ((d * 4.0) / (D_m * M_m))) * ((h * -0.5) / l))) else: tmp = t_0 * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * 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) t_0 = Float64(d / (Float64(l * h) ^ 0.5)) tmp = 0.0 if (d <= -1.4e-43) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (d <= 1.55e-205) tmp = Float64(h * Float64(sqrt(Float64(1.0 / Float64(l * Float64(h * Float64(l * l))))) * Float64(Float64(D_m * Float64(D_m * Float64(M_m * M_m))) * Float64(-0.125 / d)))); elseif (d <= 5.5e+138) tmp = Float64(t_0 * Float64(1.0 + Float64(Float64(Float64(D_m / Float64(d / M_m)) / Float64(Float64(d * 4.0) / Float64(D_m * M_m))) * Float64(Float64(h * -0.5) / l)))); else tmp = Float64(t_0 * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(M_m * M_m) * 0.25) * Float64(Float64(D_m / d) * Float64(D_m / d))) * Float64(0.5 * 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)
t_0 = d / ((l * h) ^ 0.5);
tmp = 0.0;
if (d <= -1.4e-43)
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
elseif (d <= 1.55e-205)
tmp = h * (sqrt((1.0 / (l * (h * (l * l))))) * ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d)));
elseif (d <= 5.5e+138)
tmp = t_0 * (1.0 + (((D_m / (d / M_m)) / ((d * 4.0) / (D_m * M_m))) * ((h * -0.5) / l)));
else
tmp = t_0 * (1.0 - (((((M_m * M_m) * 0.25) * ((D_m / d) * (D_m / d))) * (0.5 * 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_] := Block[{t$95$0 = N[(d / N[Power[N[(l * h), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -1.4e-43], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.55e-205], N[(h * N[(N[Sqrt[N[(1.0 / N[(l * N[(h * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(D$95$m * N[(D$95$m * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 5.5e+138], N[(t$95$0 * N[(1.0 + N[(N[(N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(d * 4.0), $MachinePrecision] / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(h * -0.5), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(1.0 - N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * 0.25), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 * h), $MachinePrecision]), $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}
t_0 := \frac{d}{{\left(\ell \cdot h\right)}^{0.5}}\\
\mathbf{if}\;d \leq -1.4 \cdot 10^{-43}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;d \leq 1.55 \cdot 10^{-205}:\\
\;\;\;\;h \cdot \left(\sqrt{\frac{1}{\ell \cdot \left(h \cdot \left(\ell \cdot \ell\right)\right)}} \cdot \left(\left(D\_m \cdot \left(D\_m \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \frac{-0.125}{d}\right)\right)\\
\mathbf{elif}\;d \leq 5.5 \cdot 10^{+138}:\\
\;\;\;\;t\_0 \cdot \left(1 + \frac{\frac{D\_m}{\frac{d}{M\_m}}}{\frac{d \cdot 4}{D\_m \cdot M\_m}} \cdot \frac{h \cdot -0.5}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(1 - \frac{\left(\left(\left(M\_m \cdot M\_m\right) \cdot 0.25\right) \cdot \left(\frac{D\_m}{d} \cdot \frac{D\_m}{d}\right)\right) \cdot \left(0.5 \cdot h\right)}{\ell}\right)\\
\end{array}
\end{array}
if d < -1.3999999999999999e-43Initial program 80.7%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified67.3%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6480.7%
Applied egg-rr80.7%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6451.8%
Simplified51.8%
if -1.3999999999999999e-43 < d < 1.54999999999999991e-205Initial program 44.9%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified30.2%
Taylor expanded in h around inf
Simplified33.4%
Taylor expanded in d around 0
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
unpow3N/A
unpow2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
Simplified49.6%
if 1.54999999999999991e-205 < d < 5.4999999999999999e138Initial program 74.7%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified68.8%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6474.7%
Applied egg-rr74.7%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr75.8%
associate-*r*N/A
*-lowering-*.f64N/A
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
sqrt-prodN/A
/-lowering-/.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
Applied egg-rr69.1%
if 5.4999999999999999e138 < d Initial program 66.9%
Applied egg-rr66.0%
Final simplification57.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -5.8e-201)
(* (- 0.0 d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l -2e-310)
(/ d (pow (* (* l h) (* l h)) 0.25))
(if (<= l 4e+172)
(*
(/ d (pow (* l h) 0.5))
(+
1.0
(* (/ (/ D_m (/ d M_m)) (/ (* d 4.0) (* D_m M_m))) (/ (* h -0.5) l))))
(/ (* d (sqrt (/ h 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-201) {
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
} else if (l <= -2e-310) {
tmp = d / pow(((l * h) * (l * h)), 0.25);
} else if (l <= 4e+172) {
tmp = (d / pow((l * h), 0.5)) * (1.0 + (((D_m / (d / M_m)) / ((d * 4.0) / (D_m * M_m))) * ((h * -0.5) / l)));
} else {
tmp = (d * sqrt((h / 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-201)) then
tmp = (0.0d0 - d) * sqrt(((1.0d0 / h) / l))
else if (l <= (-2d-310)) then
tmp = d / (((l * h) * (l * h)) ** 0.25d0)
else if (l <= 4d+172) then
tmp = (d / ((l * h) ** 0.5d0)) * (1.0d0 + (((d_m / (d / m_m)) / ((d * 4.0d0) / (d_m * m_m))) * ((h * (-0.5d0)) / l)))
else
tmp = (d * sqrt((h / 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-201) {
tmp = (0.0 - d) * Math.sqrt(((1.0 / h) / l));
} else if (l <= -2e-310) {
tmp = d / Math.pow(((l * h) * (l * h)), 0.25);
} else if (l <= 4e+172) {
tmp = (d / Math.pow((l * h), 0.5)) * (1.0 + (((D_m / (d / M_m)) / ((d * 4.0) / (D_m * M_m))) * ((h * -0.5) / l)));
} else {
tmp = (d * Math.sqrt((h / 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-201: tmp = (0.0 - d) * math.sqrt(((1.0 / h) / l)) elif l <= -2e-310: tmp = d / math.pow(((l * h) * (l * h)), 0.25) elif l <= 4e+172: tmp = (d / math.pow((l * h), 0.5)) * (1.0 + (((D_m / (d / M_m)) / ((d * 4.0) / (D_m * M_m))) * ((h * -0.5) / l))) else: tmp = (d * math.sqrt((h / 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-201) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= -2e-310) tmp = Float64(d / (Float64(Float64(l * h) * Float64(l * h)) ^ 0.25)); elseif (l <= 4e+172) tmp = Float64(Float64(d / (Float64(l * h) ^ 0.5)) * Float64(1.0 + Float64(Float64(Float64(D_m / Float64(d / M_m)) / Float64(Float64(d * 4.0) / Float64(D_m * M_m))) * Float64(Float64(h * -0.5) / l)))); else tmp = Float64(Float64(d * sqrt(Float64(h / 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-201)
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
elseif (l <= -2e-310)
tmp = d / (((l * h) * (l * h)) ^ 0.25);
elseif (l <= 4e+172)
tmp = (d / ((l * h) ^ 0.5)) * (1.0 + (((D_m / (d / M_m)) / ((d * 4.0) / (D_m * M_m))) * ((h * -0.5) / l)));
else
tmp = (d * sqrt((h / 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-201], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -2e-310], N[(d / N[Power[N[(N[(l * h), $MachinePrecision] * N[(l * h), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 4e+172], N[(N[(d / N[Power[N[(l * h), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(d * 4.0), $MachinePrecision] / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(h * -0.5), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / h), $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^{-201}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\frac{d}{{\left(\left(\ell \cdot h\right) \cdot \left(\ell \cdot h\right)\right)}^{0.25}}\\
\mathbf{elif}\;\ell \leq 4 \cdot 10^{+172}:\\
\;\;\;\;\frac{d}{{\left(\ell \cdot h\right)}^{0.5}} \cdot \left(1 + \frac{\frac{D\_m}{\frac{d}{M\_m}}}{\frac{d \cdot 4}{D\_m \cdot M\_m}} \cdot \frac{h \cdot -0.5}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d \cdot \sqrt{\frac{h}{\ell}}}{h}\\
\end{array}
\end{array}
if l < -5.8000000000000003e-201Initial program 63.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified51.4%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.2%
Applied egg-rr63.2%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6443.1%
Simplified43.1%
if -5.8000000000000003e-201 < l < -1.999999999999994e-310Initial program 85.6%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified71.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6439.9%
Simplified39.9%
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6439.9%
Applied egg-rr39.9%
pow1/2N/A
metadata-evalN/A
pow-prod-upN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.1%
Applied egg-rr58.1%
if -1.999999999999994e-310 < l < 4.0000000000000003e172Initial program 72.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified58.5%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6472.2%
Applied egg-rr72.2%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr76.5%
associate-*r*N/A
*-lowering-*.f64N/A
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
sqrt-prodN/A
/-lowering-/.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
Applied egg-rr79.0%
if 4.0000000000000003e172 < l Initial program 56.1%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified35.0%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified21.5%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6452.8%
Simplified52.8%
Final simplification57.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.25e-206)
(* (- 0.0 d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l -2e-310)
(/ d (pow (* (* l h) (* l h)) 0.25))
(if (<= l 3.1e-32)
(*
(* (* D_m (* D_m (* M_m M_m))) (/ -0.125 d))
(sqrt (/ h (* l (* l l)))))
(* d (sqrt (* (/ 1.0 h) (/ 1.0 l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.25e-206) {
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
} else if (l <= -2e-310) {
tmp = d / pow(((l * h) * (l * h)), 0.25);
} else if (l <= 3.1e-32) {
tmp = ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d)) * sqrt((h / (l * (l * l))));
} else {
tmp = d * sqrt(((1.0 / h) * (1.0 / l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-1.25d-206)) then
tmp = (0.0d0 - d) * sqrt(((1.0d0 / h) / l))
else if (l <= (-2d-310)) then
tmp = d / (((l * h) * (l * h)) ** 0.25d0)
else if (l <= 3.1d-32) then
tmp = ((d_m * (d_m * (m_m * m_m))) * ((-0.125d0) / d)) * sqrt((h / (l * (l * l))))
else
tmp = d * sqrt(((1.0d0 / h) * (1.0d0 / l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.25e-206) {
tmp = (0.0 - d) * Math.sqrt(((1.0 / h) / l));
} else if (l <= -2e-310) {
tmp = d / Math.pow(((l * h) * (l * h)), 0.25);
} else if (l <= 3.1e-32) {
tmp = ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d)) * Math.sqrt((h / (l * (l * l))));
} else {
tmp = d * Math.sqrt(((1.0 / h) * (1.0 / l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -1.25e-206: tmp = (0.0 - d) * math.sqrt(((1.0 / h) / l)) elif l <= -2e-310: tmp = d / math.pow(((l * h) * (l * h)), 0.25) elif l <= 3.1e-32: tmp = ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d)) * math.sqrt((h / (l * (l * l)))) else: tmp = d * math.sqrt(((1.0 / h) * (1.0 / l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.25e-206) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= -2e-310) tmp = Float64(d / (Float64(Float64(l * h) * Float64(l * h)) ^ 0.25)); elseif (l <= 3.1e-32) tmp = Float64(Float64(Float64(D_m * Float64(D_m * Float64(M_m * M_m))) * Float64(-0.125 / d)) * sqrt(Float64(h / Float64(l * Float64(l * l))))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) * Float64(1.0 / l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -1.25e-206)
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
elseif (l <= -2e-310)
tmp = d / (((l * h) * (l * h)) ^ 0.25);
elseif (l <= 3.1e-32)
tmp = ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d)) * sqrt((h / (l * (l * l))));
else
tmp = d * sqrt(((1.0 / h) * (1.0 / l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.25e-206], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -2e-310], N[(d / N[Power[N[(N[(l * h), $MachinePrecision] * N[(l * h), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.1e-32], N[(N[(N[(D$95$m * N[(D$95$m * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / N[(l * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] * N[(1.0 / 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 -1.25 \cdot 10^{-206}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\frac{d}{{\left(\left(\ell \cdot h\right) \cdot \left(\ell \cdot h\right)\right)}^{0.25}}\\
\mathbf{elif}\;\ell \leq 3.1 \cdot 10^{-32}:\\
\;\;\;\;\left(\left(D\_m \cdot \left(D\_m \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \frac{-0.125}{d}\right) \cdot \sqrt{\frac{h}{\ell \cdot \left(\ell \cdot \ell\right)}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{1}{h} \cdot \frac{1}{\ell}}\\
\end{array}
\end{array}
if l < -1.25e-206Initial program 63.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified51.4%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.2%
Applied egg-rr63.2%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6443.1%
Simplified43.1%
if -1.25e-206 < l < -1.999999999999994e-310Initial program 85.6%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified71.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6439.9%
Simplified39.9%
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6439.9%
Applied egg-rr39.9%
pow1/2N/A
metadata-evalN/A
pow-prod-upN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.1%
Applied egg-rr58.1%
if -1.999999999999994e-310 < l < 3.10000000000000011e-32Initial program 76.5%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified61.1%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.5%
Applied egg-rr76.5%
frac-timesN/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr82.5%
Taylor expanded in d around 0
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f6452.9%
Simplified52.9%
if 3.10000000000000011e-32 < l Initial program 62.5%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified46.6%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6450.9%
Simplified50.9%
inv-powN/A
*-commutativeN/A
unpow-prod-downN/A
inv-powN/A
inv-powN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6452.5%
Applied egg-rr52.5%
Final simplification48.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 (<= M_m 2.6e-118)
(/ (* d (sqrt (/ h l))) h)
(*
h
(*
(sqrt (/ 1.0 (* l (* h (* l l)))))
(* (* D_m (* D_m (* M_m M_m))) (/ -0.125 d))))))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 (M_m <= 2.6e-118) {
tmp = (d * sqrt((h / l))) / h;
} else {
tmp = h * (sqrt((1.0 / (l * (h * (l * l))))) * ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d)));
}
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 (m_m <= 2.6d-118) then
tmp = (d * sqrt((h / l))) / h
else
tmp = h * (sqrt((1.0d0 / (l * (h * (l * l))))) * ((d_m * (d_m * (m_m * m_m))) * ((-0.125d0) / d)))
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 (M_m <= 2.6e-118) {
tmp = (d * Math.sqrt((h / l))) / h;
} else {
tmp = h * (Math.sqrt((1.0 / (l * (h * (l * l))))) * ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d)));
}
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 M_m <= 2.6e-118: tmp = (d * math.sqrt((h / l))) / h else: tmp = h * (math.sqrt((1.0 / (l * (h * (l * l))))) * ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d))) 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 (M_m <= 2.6e-118) tmp = Float64(Float64(d * sqrt(Float64(h / l))) / h); else tmp = Float64(h * Float64(sqrt(Float64(1.0 / Float64(l * Float64(h * Float64(l * l))))) * Float64(Float64(D_m * Float64(D_m * Float64(M_m * M_m))) * Float64(-0.125 / d)))); 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 (M_m <= 2.6e-118)
tmp = (d * sqrt((h / l))) / h;
else
tmp = h * (sqrt((1.0 / (l * (h * (l * l))))) * ((D_m * (D_m * (M_m * M_m))) * (-0.125 / d)));
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[M$95$m, 2.6e-118], N[(N[(d * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / h), $MachinePrecision], N[(h * N[(N[Sqrt[N[(1.0 / N[(l * N[(h * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(D$95$m * N[(D$95$m * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $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}\;M\_m \leq 2.6 \cdot 10^{-118}:\\
\;\;\;\;\frac{d \cdot \sqrt{\frac{h}{\ell}}}{h}\\
\mathbf{else}:\\
\;\;\;\;h \cdot \left(\sqrt{\frac{1}{\ell \cdot \left(h \cdot \left(\ell \cdot \ell\right)\right)}} \cdot \left(\left(D\_m \cdot \left(D\_m \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \frac{-0.125}{d}\right)\right)\\
\end{array}
\end{array}
if M < 2.6e-118Initial program 64.6%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified52.7%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified24.9%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6444.5%
Simplified44.5%
if 2.6e-118 < M Initial program 73.3%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified55.1%
Taylor expanded in h around inf
Simplified35.1%
Taylor expanded in d around 0
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
unpow3N/A
unpow2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
Simplified43.4%
Final simplification44.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 (if (<= M_m 1.25e-51) (/ (* d (sqrt (/ h l))) h) (/ (* (- 0.0 d) (pow (* (/ h l) (/ h l)) 0.25)) 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 (M_m <= 1.25e-51) {
tmp = (d * sqrt((h / l))) / h;
} else {
tmp = ((0.0 - d) * pow(((h / l) * (h / l)), 0.25)) / 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 (m_m <= 1.25d-51) then
tmp = (d * sqrt((h / l))) / h
else
tmp = ((0.0d0 - d) * (((h / l) * (h / l)) ** 0.25d0)) / 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 (M_m <= 1.25e-51) {
tmp = (d * Math.sqrt((h / l))) / h;
} else {
tmp = ((0.0 - d) * Math.pow(((h / l) * (h / l)), 0.25)) / 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 M_m <= 1.25e-51: tmp = (d * math.sqrt((h / l))) / h else: tmp = ((0.0 - d) * math.pow(((h / l) * (h / l)), 0.25)) / 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 (M_m <= 1.25e-51) tmp = Float64(Float64(d * sqrt(Float64(h / l))) / h); else tmp = Float64(Float64(Float64(0.0 - d) * (Float64(Float64(h / l) * Float64(h / l)) ^ 0.25)) / 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 (M_m <= 1.25e-51)
tmp = (d * sqrt((h / l))) / h;
else
tmp = ((0.0 - d) * (((h / l) * (h / l)) ^ 0.25)) / 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[M$95$m, 1.25e-51], N[(N[(d * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / h), $MachinePrecision], N[(N[(N[(0.0 - d), $MachinePrecision] * N[Power[N[(N[(h / l), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]), $MachinePrecision] / h), $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}\;M\_m \leq 1.25 \cdot 10^{-51}:\\
\;\;\;\;\frac{d \cdot \sqrt{\frac{h}{\ell}}}{h}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(0 - d\right) \cdot {\left(\frac{h}{\ell} \cdot \frac{h}{\ell}\right)}^{0.25}}{h}\\
\end{array}
\end{array}
if M < 1.25000000000000001e-51Initial program 65.0%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified53.4%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified25.3%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6444.1%
Simplified44.1%
if 1.25000000000000001e-51 < M Initial program 73.9%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified53.4%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified32.1%
Taylor expanded in l around -inf
*-commutativeN/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6417.0%
Simplified17.0%
pow1/2N/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
metadata-eval26.3%
Applied egg-rr26.3%
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 (let* ((t_0 (sqrt (/ h l)))) (if (<= M_m 1.25e-51) (/ (* d t_0) h) (/ (/ (* t_0 (- 0.0 (* d d))) d) 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((h / l));
double tmp;
if (M_m <= 1.25e-51) {
tmp = (d * t_0) / h;
} else {
tmp = ((t_0 * (0.0 - (d * d))) / d) / h;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((h / l))
if (m_m <= 1.25d-51) then
tmp = (d * t_0) / h
else
tmp = ((t_0 * (0.0d0 - (d * d))) / d) / 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((h / l));
double tmp;
if (M_m <= 1.25e-51) {
tmp = (d * t_0) / h;
} else {
tmp = ((t_0 * (0.0 - (d * d))) / d) / 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((h / l)) tmp = 0 if M_m <= 1.25e-51: tmp = (d * t_0) / h else: tmp = ((t_0 * (0.0 - (d * d))) / d) / 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(h / l)) tmp = 0.0 if (M_m <= 1.25e-51) tmp = Float64(Float64(d * t_0) / h); else tmp = Float64(Float64(Float64(t_0 * Float64(0.0 - Float64(d * d))) / d) / 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((h / l));
tmp = 0.0;
if (M_m <= 1.25e-51)
tmp = (d * t_0) / h;
else
tmp = ((t_0 * (0.0 - (d * d))) / d) / 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[N[(h / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[M$95$m, 1.25e-51], N[(N[(d * t$95$0), $MachinePrecision] / h), $MachinePrecision], N[(N[(N[(t$95$0 * N[(0.0 - N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] / h), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{h}{\ell}}\\
\mathbf{if}\;M\_m \leq 1.25 \cdot 10^{-51}:\\
\;\;\;\;\frac{d \cdot t\_0}{h}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0 \cdot \left(0 - d \cdot d\right)}{d}}{h}\\
\end{array}
\end{array}
if M < 1.25000000000000001e-51Initial program 65.0%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified53.4%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified25.3%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6444.1%
Simplified44.1%
if 1.25000000000000001e-51 < M Initial program 73.9%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified53.4%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified32.1%
Taylor expanded in l around -inf
*-commutativeN/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6417.0%
Simplified17.0%
sub0-negN/A
*-commutativeN/A
sub0-negN/A
flip--N/A
+-lft-identityN/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr25.7%
Final simplification39.5%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= l -4.8e-210) (* (- 0.0 d) (sqrt (/ (/ 1.0 h) l))) (* d (sqrt (* (/ 1.0 h) (/ 1.0 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 <= -4.8e-210) {
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
} else {
tmp = d * sqrt(((1.0 / h) * (1.0 / 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 <= (-4.8d-210)) then
tmp = (0.0d0 - d) * sqrt(((1.0d0 / h) / l))
else
tmp = d * sqrt(((1.0d0 / h) * (1.0d0 / 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 <= -4.8e-210) {
tmp = (0.0 - d) * Math.sqrt(((1.0 / h) / l));
} else {
tmp = d * Math.sqrt(((1.0 / h) * (1.0 / 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 <= -4.8e-210: tmp = (0.0 - d) * math.sqrt(((1.0 / h) / l)) else: tmp = d * math.sqrt(((1.0 / h) * (1.0 / 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 <= -4.8e-210) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) * Float64(1.0 / 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 <= -4.8e-210)
tmp = (0.0 - d) * sqrt(((1.0 / h) / l));
else
tmp = d * sqrt(((1.0 / h) * (1.0 / 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, -4.8e-210], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] * N[(1.0 / 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 -4.8 \cdot 10^{-210}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{1}{h} \cdot \frac{1}{\ell}}\\
\end{array}
\end{array}
if l < -4.80000000000000008e-210Initial program 63.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified51.4%
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.2%
Applied egg-rr63.2%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6443.1%
Simplified43.1%
if -4.80000000000000008e-210 < l Initial program 70.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified55.0%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.8%
Simplified42.8%
inv-powN/A
*-commutativeN/A
unpow-prod-downN/A
inv-powN/A
inv-powN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6443.7%
Applied egg-rr43.7%
Final simplification43.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 (<= l -1.2e-200) (* (- 0.0 d) (sqrt (/ 1.0 (* l h)))) (* d (sqrt (* (/ 1.0 h) (/ 1.0 l))))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.2e-200) {
tmp = (0.0 - d) * sqrt((1.0 / (l * h)));
} else {
tmp = d * sqrt(((1.0 / h) * (1.0 / l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-1.2d-200)) then
tmp = (0.0d0 - d) * sqrt((1.0d0 / (l * h)))
else
tmp = d * sqrt(((1.0d0 / h) * (1.0d0 / l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.2e-200) {
tmp = (0.0 - d) * Math.sqrt((1.0 / (l * h)));
} else {
tmp = d * Math.sqrt(((1.0 / h) * (1.0 / l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -1.2e-200: tmp = (0.0 - d) * math.sqrt((1.0 / (l * h))) else: tmp = d * math.sqrt(((1.0 / h) * (1.0 / l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.2e-200) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(1.0 / Float64(l * h)))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) * Float64(1.0 / l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -1.2e-200)
tmp = (0.0 - d) * sqrt((1.0 / (l * h)));
else
tmp = d * sqrt(((1.0 / h) * (1.0 / l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.2e-200], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] * N[(1.0 / 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 -1.2 \cdot 10^{-200}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{1}{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{1}{h} \cdot \frac{1}{\ell}}\\
\end{array}
\end{array}
if l < -1.20000000000000001e-200Initial program 63.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified51.4%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*l*N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.3%
Simplified42.3%
if -1.20000000000000001e-200 < l Initial program 70.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified55.0%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.8%
Simplified42.8%
inv-powN/A
*-commutativeN/A
unpow-prod-downN/A
inv-powN/A
inv-powN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6443.7%
Applied egg-rr43.7%
Final simplification43.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 (<= l -6.2e-211) (* (- 0.0 d) (sqrt (/ 1.0 (* l h)))) (* 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 <= -6.2e-211) {
tmp = (0.0 - d) * sqrt((1.0 / (l * h)));
} 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 <= (-6.2d-211)) then
tmp = (0.0d0 - d) * sqrt((1.0d0 / (l * h)))
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 <= -6.2e-211) {
tmp = (0.0 - d) * Math.sqrt((1.0 / (l * h)));
} 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 <= -6.2e-211: tmp = (0.0 - d) * math.sqrt((1.0 / (l * h))) 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 <= -6.2e-211) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(1.0 / Float64(l * h)))); 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 <= -6.2e-211)
tmp = (0.0 - d) * sqrt((1.0 / (l * h)));
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, -6.2e-211], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -6.2 \cdot 10^{-211}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{1}{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\end{array}
\end{array}
if l < -6.1999999999999999e-211Initial program 63.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified51.4%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*l*N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.3%
Simplified42.3%
if -6.1999999999999999e-211 < l Initial program 70.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified55.0%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.8%
Simplified42.8%
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6443.7%
Applied egg-rr43.7%
Final simplification43.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 (<= l -5.3e-208) (/ (* d (sqrt (/ h l))) h) (* 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.3e-208) {
tmp = (d * sqrt((h / l))) / h;
} 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.3d-208)) then
tmp = (d * sqrt((h / l))) / h
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.3e-208) {
tmp = (d * Math.sqrt((h / l))) / h;
} 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.3e-208: tmp = (d * math.sqrt((h / l))) / h 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.3e-208) tmp = Float64(Float64(d * sqrt(Float64(h / l))) / h); 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.3e-208)
tmp = (d * sqrt((h / l))) / h;
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.3e-208], N[(N[(d * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / h), $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.3 \cdot 10^{-208}:\\
\;\;\;\;\frac{d \cdot \sqrt{\frac{h}{\ell}}}{h}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\end{array}
\end{array}
if l < -5.29999999999999983e-208Initial program 63.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified51.4%
Taylor expanded in h around 0
/-lowering-/.f64N/A
Simplified24.7%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6437.5%
Simplified37.5%
if -5.29999999999999983e-208 < l Initial program 70.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified55.0%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.8%
Simplified42.8%
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6443.7%
Applied egg-rr43.7%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= l -1.48e-201) (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 (l <= -1.48e-201) {
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 (l <= (-1.48d-201)) 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 (l <= -1.48e-201) {
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 l <= -1.48e-201: 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 (l <= -1.48e-201) tmp = sqrt(Float64(Float64(d / h) * Float64(d / l))); 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 <= -1.48e-201)
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[l, -1.48e-201], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_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.48 \cdot 10^{-201}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\end{array}
\end{array}
if l < -1.47999999999999996e-201Initial program 63.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified51.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f646.2%
Simplified6.2%
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
rem-square-sqrtN/A
*-commutativeN/A
sqrt-prodN/A
frac-timesN/A
sqrt-divN/A
sqrt-divN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6431.0%
Applied egg-rr31.0%
if -1.47999999999999996e-201 < l Initial program 70.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified55.0%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.8%
Simplified42.8%
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6443.7%
Applied egg-rr43.7%
Final simplification38.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 (<= l -6.5e-205) (sqrt (* (/ d h) (/ d l))) (* 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) {
double tmp;
if (l <= -6.5e-205) {
tmp = sqrt(((d / h) * (d / l)));
} else {
tmp = d * pow((l * 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 <= (-6.5d-205)) then
tmp = sqrt(((d / h) * (d / l)))
else
tmp = d * ((l * 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 <= -6.5e-205) {
tmp = Math.sqrt(((d / h) * (d / l)));
} else {
tmp = d * Math.pow((l * 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 <= -6.5e-205: tmp = math.sqrt(((d / h) * (d / l))) else: tmp = d * math.pow((l * 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 <= -6.5e-205) tmp = sqrt(Float64(Float64(d / h) * Float64(d / l))); else tmp = Float64(d * (Float64(l * 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 <= -6.5e-205)
tmp = sqrt(((d / h) * (d / l)));
else
tmp = d * ((l * 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, -6.5e-205], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 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])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -6.5 \cdot 10^{-205}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot {\left(\ell \cdot h\right)}^{-0.5}\\
\end{array}
\end{array}
if l < -6.49999999999999956e-205Initial program 63.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified51.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f646.2%
Simplified6.2%
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
rem-square-sqrtN/A
*-commutativeN/A
sqrt-prodN/A
frac-timesN/A
sqrt-divN/A
sqrt-divN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6431.0%
Applied egg-rr31.0%
if -6.49999999999999956e-205 < l Initial program 70.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified55.0%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.8%
Simplified42.8%
*-commutativeN/A
*-lowering-*.f64N/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
*-commutativeN/A
*-lowering-*.f6442.9%
Applied egg-rr42.9%
Final simplification37.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 (* 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 67.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified53.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6426.5%
Simplified26.5%
*-commutativeN/A
*-lowering-*.f64N/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
*-commutativeN/A
*-lowering-*.f6426.6%
Applied egg-rr26.6%
Final simplification26.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 (/ d (sqrt (* 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) {
return d / sqrt((l * h));
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
code = d / sqrt((l * h))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d / Math.sqrt((l * h));
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d / math.sqrt((l * h))
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d / sqrt(Float64(l * h))) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d / sqrt((l * h));
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d / N[Sqrt[N[(l * 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])\\
\\
\frac{d}{\sqrt{\ell \cdot h}}
\end{array}
Initial program 67.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
Simplified53.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6426.5%
Simplified26.5%
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6426.6%
Applied egg-rr26.6%
herbie shell --seed 2024145
(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)))))