
(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 20 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (d h l M D) :precision binary64 (* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))
double code(double d, double h, double l, double M, double D) {
return (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
real(8) function code(d, h, l, m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (/ (/ (* M_m D) (* d 2.0)) l))
(t_1 (- 1.0 (* t_0 (* h (* 0.25 (/ (* M_m D) d))))))
(t_2 (pow (/ d h) (/ 1.0 2.0))))
(if (<= d -1.5e-215)
(* (* t_2 (/ (sqrt (- d)) (sqrt (- l)))) t_1)
(if (<= d 4.8e-219)
(*
(* (* M_m M_m) (* (* D D) (/ 1.0 (* l (sqrt (/ l h))))))
(/ -0.125 d))
(if (<= d 3.4e-146)
(* t_1 (* t_2 (/ (sqrt d) (sqrt l))))
(*
(* (* (sqrt d) (/ 1.0 (sqrt h))) (sqrt (/ d l)))
(+ 1.0 (* t_0 (/ (/ (* (* M_m D) 0.5) (* d 2.0)) (/ -1.0 h))))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = ((M_m * D) / (d * 2.0)) / l;
double t_1 = 1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))));
double t_2 = pow((d / h), (1.0 / 2.0));
double tmp;
if (d <= -1.5e-215) {
tmp = (t_2 * (sqrt(-d) / sqrt(-l))) * t_1;
} else if (d <= 4.8e-219) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
} else if (d <= 3.4e-146) {
tmp = t_1 * (t_2 * (sqrt(d) / sqrt(l)));
} else {
tmp = ((sqrt(d) * (1.0 / sqrt(h))) * sqrt((d / l))) * (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h))));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = ((m_m * d_1) / (d * 2.0d0)) / l
t_1 = 1.0d0 - (t_0 * (h * (0.25d0 * ((m_m * d_1) / d))))
t_2 = (d / h) ** (1.0d0 / 2.0d0)
if (d <= (-1.5d-215)) then
tmp = (t_2 * (sqrt(-d) / sqrt(-l))) * t_1
else if (d <= 4.8d-219) then
tmp = ((m_m * m_m) * ((d_1 * d_1) * (1.0d0 / (l * sqrt((l / h)))))) * ((-0.125d0) / d)
else if (d <= 3.4d-146) then
tmp = t_1 * (t_2 * (sqrt(d) / sqrt(l)))
else
tmp = ((sqrt(d) * (1.0d0 / sqrt(h))) * sqrt((d / l))) * (1.0d0 + (t_0 * ((((m_m * d_1) * 0.5d0) / (d * 2.0d0)) / ((-1.0d0) / h))))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = ((M_m * D) / (d * 2.0)) / l;
double t_1 = 1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))));
double t_2 = Math.pow((d / h), (1.0 / 2.0));
double tmp;
if (d <= -1.5e-215) {
tmp = (t_2 * (Math.sqrt(-d) / Math.sqrt(-l))) * t_1;
} else if (d <= 4.8e-219) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * Math.sqrt((l / h)))))) * (-0.125 / d);
} else if (d <= 3.4e-146) {
tmp = t_1 * (t_2 * (Math.sqrt(d) / Math.sqrt(l)));
} else {
tmp = ((Math.sqrt(d) * (1.0 / Math.sqrt(h))) * Math.sqrt((d / l))) * (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = ((M_m * D) / (d * 2.0)) / l t_1 = 1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d)))) t_2 = math.pow((d / h), (1.0 / 2.0)) tmp = 0 if d <= -1.5e-215: tmp = (t_2 * (math.sqrt(-d) / math.sqrt(-l))) * t_1 elif d <= 4.8e-219: tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * math.sqrt((l / h)))))) * (-0.125 / d) elif d <= 3.4e-146: tmp = t_1 * (t_2 * (math.sqrt(d) / math.sqrt(l))) else: tmp = ((math.sqrt(d) * (1.0 / math.sqrt(h))) * math.sqrt((d / l))) * (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h)))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(Float64(Float64(M_m * D) / Float64(d * 2.0)) / l) t_1 = Float64(1.0 - Float64(t_0 * Float64(h * Float64(0.25 * Float64(Float64(M_m * D) / d))))) t_2 = Float64(d / h) ^ Float64(1.0 / 2.0) tmp = 0.0 if (d <= -1.5e-215) tmp = Float64(Float64(t_2 * Float64(sqrt(Float64(-d)) / sqrt(Float64(-l)))) * t_1); elseif (d <= 4.8e-219) tmp = Float64(Float64(Float64(M_m * M_m) * Float64(Float64(D * D) * Float64(1.0 / Float64(l * sqrt(Float64(l / h)))))) * Float64(-0.125 / d)); elseif (d <= 3.4e-146) tmp = Float64(t_1 * Float64(t_2 * Float64(sqrt(d) / sqrt(l)))); else tmp = Float64(Float64(Float64(sqrt(d) * Float64(1.0 / sqrt(h))) * sqrt(Float64(d / l))) * Float64(1.0 + Float64(t_0 * Float64(Float64(Float64(Float64(M_m * D) * 0.5) / Float64(d * 2.0)) / Float64(-1.0 / h))))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = ((M_m * D) / (d * 2.0)) / l;
t_1 = 1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))));
t_2 = (d / h) ^ (1.0 / 2.0);
tmp = 0.0;
if (d <= -1.5e-215)
tmp = (t_2 * (sqrt(-d) / sqrt(-l))) * t_1;
elseif (d <= 4.8e-219)
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
elseif (d <= 3.4e-146)
tmp = t_1 * (t_2 * (sqrt(d) / sqrt(l)));
else
tmp = ((sqrt(d) * (1.0 / sqrt(h))) * sqrt((d / l))) * (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[(N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 - N[(t$95$0 * N[(h * N[(0.25 * N[(N[(M$95$m * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -1.5e-215], N[(N[(t$95$2 * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[d, 4.8e-219], N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D * D), $MachinePrecision] * N[(1.0 / N[(l * N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 3.4e-146], N[(t$95$1 * N[(t$95$2 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[d], $MachinePrecision] * N[(1.0 / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(t$95$0 * N[(N[(N[(N[(M$95$m * D), $MachinePrecision] * 0.5), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{M\_m \cdot D}{d \cdot 2}}{\ell}\\
t_1 := 1 - t\_0 \cdot \left(h \cdot \left(0.25 \cdot \frac{M\_m \cdot D}{d}\right)\right)\\
t_2 := {\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)}\\
\mathbf{if}\;d \leq -1.5 \cdot 10^{-215}:\\
\;\;\;\;\left(t\_2 \cdot \frac{\sqrt{-d}}{\sqrt{-\ell}}\right) \cdot t\_1\\
\mathbf{elif}\;d \leq 4.8 \cdot 10^{-219}:\\
\;\;\;\;\left(\left(M\_m \cdot M\_m\right) \cdot \left(\left(D \cdot D\right) \cdot \frac{1}{\ell \cdot \sqrt{\frac{\ell}{h}}}\right)\right) \cdot \frac{-0.125}{d}\\
\mathbf{elif}\;d \leq 3.4 \cdot 10^{-146}:\\
\;\;\;\;t\_1 \cdot \left(t\_2 \cdot \frac{\sqrt{d}}{\sqrt{\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\sqrt{d} \cdot \frac{1}{\sqrt{h}}\right) \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(1 + t\_0 \cdot \frac{\frac{\left(M\_m \cdot D\right) \cdot 0.5}{d \cdot 2}}{\frac{-1}{h}}\right)\\
\end{array}
\end{array}
if d < -1.50000000000000013e-215Initial program 74.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites79.2%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6479.2
Applied rewrites79.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
lower-*.f6479.2
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f6479.2
Applied rewrites79.2%
frac-2negN/A
sqrt-divN/A
pow1/2N/A
metadata-evalN/A
lift-/.f64N/A
lower-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6489.4
Applied rewrites89.4%
if -1.50000000000000013e-215 < d < 4.80000000000000028e-219Initial program 33.5%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6426.9
Applied rewrites26.9%
Applied rewrites24.4%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites33.9%
lift-*.f64N/A
lift-*.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f6463.7
Applied rewrites63.7%
if 4.80000000000000028e-219 < d < 3.4000000000000001e-146Initial program 54.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites60.6%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6460.6
Applied rewrites60.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
lower-*.f6460.6
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f6460.6
Applied rewrites60.6%
sqrt-divN/A
lift-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6488.2
Applied rewrites88.2%
if 3.4000000000000001e-146 < d Initial program 73.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites79.1%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6479.1
Applied rewrites79.1%
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
unpow-prod-downN/A
pow1/2N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6490.1
Applied rewrites90.1%
Final simplification85.0%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(+
1.0
(* (/ h l) (* (pow (/ (* M_m D) (* d 2.0)) 2.0) (/ -1.0 2.0)))))))
(if (<= t_0 -2e-44)
(* (/ -0.125 d) (* (* M_m M_m) (* (* D D) (/ (sqrt (/ h l)) l))))
(if (<= t_0 INFINITY)
(/ (sqrt (/ d l)) (sqrt (/ h d)))
(*
(* (* M_m M_m) (* (* D D) (/ 1.0 (* l (sqrt (/ l h))))))
(/ -0.125 d))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0))));
double tmp;
if (t_0 <= -2e-44) {
tmp = (-0.125 / d) * ((M_m * M_m) * ((D * D) * (sqrt((h / l)) / l)));
} else if (t_0 <= ((double) INFINITY)) {
tmp = sqrt((d / l)) / sqrt((h / d));
} else {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
}
return tmp;
}
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (Math.pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0))));
double tmp;
if (t_0 <= -2e-44) {
tmp = (-0.125 / d) * ((M_m * M_m) * ((D * D) * (Math.sqrt((h / l)) / l)));
} else if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((d / l)) / Math.sqrt((h / d));
} else {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * Math.sqrt((l / h)))))) * (-0.125 / d);
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (math.pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0)))) tmp = 0 if t_0 <= -2e-44: tmp = (-0.125 / d) * ((M_m * M_m) * ((D * D) * (math.sqrt((h / l)) / l))) elif t_0 <= math.inf: tmp = math.sqrt((d / l)) / math.sqrt((h / d)) else: tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * math.sqrt((l / h)))))) * (-0.125 / d) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(Float64(M_m * D) / Float64(d * 2.0)) ^ 2.0) * Float64(-1.0 / 2.0))))) tmp = 0.0 if (t_0 <= -2e-44) tmp = Float64(Float64(-0.125 / d) * Float64(Float64(M_m * M_m) * Float64(Float64(D * D) * Float64(sqrt(Float64(h / l)) / l)))); elseif (t_0 <= Inf) tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); else tmp = Float64(Float64(Float64(M_m * M_m) * Float64(Float64(D * D) * Float64(1.0 / Float64(l * sqrt(Float64(l / h)))))) * Float64(-0.125 / d)); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 + ((h / l) * ((((M_m * D) / (d * 2.0)) ^ 2.0) * (-1.0 / 2.0))));
tmp = 0.0;
if (t_0 <= -2e-44)
tmp = (-0.125 / d) * ((M_m * M_m) * ((D * D) * (sqrt((h / l)) / l)));
elseif (t_0 <= Inf)
tmp = sqrt((d / l)) / sqrt((h / d));
else
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[(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[(h / l), $MachinePrecision] * N[(N[Power[N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-1.0 / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-44], N[(N[(-0.125 / d), $MachinePrecision] * N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D * D), $MachinePrecision] * N[(N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D * D), $MachinePrecision] * N[(1.0 / N[(l * N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \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 + \frac{h}{\ell} \cdot \left({\left(\frac{M\_m \cdot D}{d \cdot 2}\right)}^{2} \cdot \frac{-1}{2}\right)\right)\\
\mathbf{if}\;t\_0 \leq -2 \cdot 10^{-44}:\\
\;\;\;\;\frac{-0.125}{d} \cdot \left(\left(M\_m \cdot M\_m\right) \cdot \left(\left(D \cdot D\right) \cdot \frac{\sqrt{\frac{h}{\ell}}}{\ell}\right)\right)\\
\mathbf{elif}\;t\_0 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\frac{d}{\ell}}}{\sqrt{\frac{h}{d}}}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(M\_m \cdot M\_m\right) \cdot \left(\left(D \cdot D\right) \cdot \frac{1}{\ell \cdot \sqrt{\frac{\ell}{h}}}\right)\right) \cdot \frac{-0.125}{d}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < -1.99999999999999991e-44Initial program 81.0%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6458.5
Applied rewrites58.5%
Applied rewrites29.1%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites31.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6473.0
Applied rewrites73.0%
if -1.99999999999999991e-44 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < +inf.0Initial program 80.6%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6457.0
Applied rewrites57.0%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6441.3
Applied rewrites41.3%
lift-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f6441.6
Applied rewrites41.6%
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
*-commutativeN/A
frac-timesN/A
clear-numN/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-/.f64N/A
pow1/2N/A
metadata-evalN/A
lift-/.f64N/A
lift-pow.f64N/A
un-div-invN/A
lower-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites78.9%
if +inf.0 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) Initial program 0.0%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6413.4
Applied rewrites13.4%
Applied rewrites18.8%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites11.6%
lift-*.f64N/A
lift-*.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f6433.6
Applied rewrites33.6%
Final simplification68.4%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (* (/ -0.125 d) (* (* M_m M_m) (* (* D D) (/ (sqrt (/ h l)) l)))))
(t_1
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(+
1.0
(* (/ h l) (* (pow (/ (* M_m D) (* d 2.0)) 2.0) (/ -1.0 2.0)))))))
(if (<= t_1 -2e-44)
t_0
(if (<= t_1 INFINITY) (/ (sqrt (/ d l)) (sqrt (/ h d))) t_0))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = (-0.125 / d) * ((M_m * M_m) * ((D * D) * (sqrt((h / l)) / l)));
double t_1 = (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0))));
double tmp;
if (t_1 <= -2e-44) {
tmp = t_0;
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((d / l)) / sqrt((h / d));
} else {
tmp = t_0;
}
return tmp;
}
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = (-0.125 / d) * ((M_m * M_m) * ((D * D) * (Math.sqrt((h / l)) / l)));
double t_1 = (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (Math.pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0))));
double tmp;
if (t_1 <= -2e-44) {
tmp = t_0;
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((d / l)) / Math.sqrt((h / d));
} else {
tmp = t_0;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = (-0.125 / d) * ((M_m * M_m) * ((D * D) * (math.sqrt((h / l)) / l))) t_1 = (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (math.pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0)))) tmp = 0 if t_1 <= -2e-44: tmp = t_0 elif t_1 <= math.inf: tmp = math.sqrt((d / l)) / math.sqrt((h / d)) else: tmp = t_0 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(Float64(-0.125 / d) * Float64(Float64(M_m * M_m) * Float64(Float64(D * D) * Float64(sqrt(Float64(h / l)) / l)))) t_1 = Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(Float64(M_m * D) / Float64(d * 2.0)) ^ 2.0) * Float64(-1.0 / 2.0))))) tmp = 0.0 if (t_1 <= -2e-44) tmp = t_0; elseif (t_1 <= Inf) tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); else tmp = t_0; end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = (-0.125 / d) * ((M_m * M_m) * ((D * D) * (sqrt((h / l)) / l)));
t_1 = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 + ((h / l) * ((((M_m * D) / (d * 2.0)) ^ 2.0) * (-1.0 / 2.0))));
tmp = 0.0;
if (t_1 <= -2e-44)
tmp = t_0;
elseif (t_1 <= Inf)
tmp = sqrt((d / l)) / sqrt((h / d));
else
tmp = t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[(N[(-0.125 / d), $MachinePrecision] * N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D * D), $MachinePrecision] * N[(N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = 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[(h / l), $MachinePrecision] * N[(N[Power[N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-1.0 / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-44], t$95$0, If[LessEqual[t$95$1, Infinity], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \frac{-0.125}{d} \cdot \left(\left(M\_m \cdot M\_m\right) \cdot \left(\left(D \cdot D\right) \cdot \frac{\sqrt{\frac{h}{\ell}}}{\ell}\right)\right)\\
t_1 := \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 + \frac{h}{\ell} \cdot \left({\left(\frac{M\_m \cdot D}{d \cdot 2}\right)}^{2} \cdot \frac{-1}{2}\right)\right)\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-44}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\frac{d}{\ell}}}{\sqrt{\frac{h}{d}}}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < -1.99999999999999991e-44 or +inf.0 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) Initial program 50.2%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6441.4
Applied rewrites41.4%
Applied rewrites25.2%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites24.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6458.0
Applied rewrites58.0%
if -1.99999999999999991e-44 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < +inf.0Initial program 80.6%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6457.0
Applied rewrites57.0%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6441.3
Applied rewrites41.3%
lift-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f6441.6
Applied rewrites41.6%
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
*-commutativeN/A
frac-timesN/A
clear-numN/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-/.f64N/A
pow1/2N/A
metadata-evalN/A
lift-/.f64N/A
lift-pow.f64N/A
un-div-invN/A
lower-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites78.9%
Final simplification68.3%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<=
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(+ 1.0 (* (/ h l) (* (pow (/ (* M_m D) (* d 2.0)) 2.0) (/ -1.0 2.0)))))
-5e+24)
(* (* (/ -0.125 d) (* (* M_m D) (* M_m D))) (sqrt (/ h (* l (* l l)))))
(/ (sqrt (/ d l)) (sqrt (/ h d)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (((pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= -5e+24) {
tmp = ((-0.125 / d) * ((M_m * D) * (M_m * D))) * sqrt((h / (l * (l * l))));
} else {
tmp = sqrt((d / l)) / sqrt((h / d));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (((((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 + ((h / l) * ((((m_m * d_1) / (d * 2.0d0)) ** 2.0d0) * ((-1.0d0) / 2.0d0))))) <= (-5d+24)) then
tmp = (((-0.125d0) / d) * ((m_m * d_1) * (m_m * d_1))) * sqrt((h / (l * (l * l))))
else
tmp = sqrt((d / l)) / sqrt((h / d))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (((Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (Math.pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= -5e+24) {
tmp = ((-0.125 / d) * ((M_m * D) * (M_m * D))) * Math.sqrt((h / (l * (l * l))));
} else {
tmp = Math.sqrt((d / l)) / Math.sqrt((h / d));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if ((math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (math.pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= -5e+24: tmp = ((-0.125 / d) * ((M_m * D) * (M_m * D))) * math.sqrt((h / (l * (l * l)))) else: tmp = math.sqrt((d / l)) / math.sqrt((h / d)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(Float64(M_m * D) / Float64(d * 2.0)) ^ 2.0) * Float64(-1.0 / 2.0))))) <= -5e+24) tmp = Float64(Float64(Float64(-0.125 / d) * Float64(Float64(M_m * D) * Float64(M_m * D))) * sqrt(Float64(h / Float64(l * Float64(l * l))))); else tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (((((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 + ((h / l) * ((((M_m * D) / (d * 2.0)) ^ 2.0) * (-1.0 / 2.0))))) <= -5e+24)
tmp = ((-0.125 / d) * ((M_m * D) * (M_m * D))) * sqrt((h / (l * (l * l))));
else
tmp = sqrt((d / l)) / sqrt((h / d));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[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[(h / l), $MachinePrecision] * N[(N[Power[N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-1.0 / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e+24], N[(N[(N[(-0.125 / d), $MachinePrecision] * N[(N[(M$95$m * D), $MachinePrecision] * N[(M$95$m * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / N[(l * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\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 + \frac{h}{\ell} \cdot \left({\left(\frac{M\_m \cdot D}{d \cdot 2}\right)}^{2} \cdot \frac{-1}{2}\right)\right) \leq -5 \cdot 10^{+24}:\\
\;\;\;\;\left(\frac{-0.125}{d} \cdot \left(\left(M\_m \cdot D\right) \cdot \left(M\_m \cdot D\right)\right)\right) \cdot \sqrt{\frac{h}{\ell \cdot \left(\ell \cdot \ell\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\frac{d}{\ell}}}{\sqrt{\frac{h}{d}}}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < -5.00000000000000045e24Initial program 80.5%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6460.0
Applied rewrites60.0%
Applied rewrites29.8%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites32.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites38.8%
if -5.00000000000000045e24 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) Initial program 58.6%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6444.4
Applied rewrites44.4%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6432.8
Applied rewrites32.8%
lift-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f6433.1
Applied rewrites33.1%
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
*-commutativeN/A
frac-timesN/A
clear-numN/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-/.f64N/A
pow1/2N/A
metadata-evalN/A
lift-/.f64N/A
lift-pow.f64N/A
un-div-invN/A
lower-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites59.3%
Final simplification53.0%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<=
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(+ 1.0 (* (/ h l) (* (pow (/ (* M_m D) (* d 2.0)) 2.0) (/ -1.0 2.0)))))
-5e+24)
(* -0.125 (* (sqrt (/ h (* l (* l l)))) (/ (* M_m (* M_m (* D D))) d)))
(/ (sqrt (/ d l)) (sqrt (/ h d)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (((pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= -5e+24) {
tmp = -0.125 * (sqrt((h / (l * (l * l)))) * ((M_m * (M_m * (D * D))) / d));
} else {
tmp = sqrt((d / l)) / sqrt((h / d));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (((((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 + ((h / l) * ((((m_m * d_1) / (d * 2.0d0)) ** 2.0d0) * ((-1.0d0) / 2.0d0))))) <= (-5d+24)) then
tmp = (-0.125d0) * (sqrt((h / (l * (l * l)))) * ((m_m * (m_m * (d_1 * d_1))) / d))
else
tmp = sqrt((d / l)) / sqrt((h / d))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (((Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (Math.pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= -5e+24) {
tmp = -0.125 * (Math.sqrt((h / (l * (l * l)))) * ((M_m * (M_m * (D * D))) / d));
} else {
tmp = Math.sqrt((d / l)) / Math.sqrt((h / d));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if ((math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (math.pow(((M_m * D) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= -5e+24: tmp = -0.125 * (math.sqrt((h / (l * (l * l)))) * ((M_m * (M_m * (D * D))) / d)) else: tmp = math.sqrt((d / l)) / math.sqrt((h / d)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 + Float64(Float64(h / l) * Float64((Float64(Float64(M_m * D) / Float64(d * 2.0)) ^ 2.0) * Float64(-1.0 / 2.0))))) <= -5e+24) tmp = Float64(-0.125 * Float64(sqrt(Float64(h / Float64(l * Float64(l * l)))) * Float64(Float64(M_m * Float64(M_m * Float64(D * D))) / d))); else tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (((((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 + ((h / l) * ((((M_m * D) / (d * 2.0)) ^ 2.0) * (-1.0 / 2.0))))) <= -5e+24)
tmp = -0.125 * (sqrt((h / (l * (l * l)))) * ((M_m * (M_m * (D * D))) / d));
else
tmp = sqrt((d / l)) / sqrt((h / d));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[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[(h / l), $MachinePrecision] * N[(N[Power[N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-1.0 / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e+24], N[(-0.125 * N[(N[Sqrt[N[(h / N[(l * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(M$95$m * N[(M$95$m * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\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 + \frac{h}{\ell} \cdot \left({\left(\frac{M\_m \cdot D}{d \cdot 2}\right)}^{2} \cdot \frac{-1}{2}\right)\right) \leq -5 \cdot 10^{+24}:\\
\;\;\;\;-0.125 \cdot \left(\sqrt{\frac{h}{\ell \cdot \left(\ell \cdot \ell\right)}} \cdot \frac{M\_m \cdot \left(M\_m \cdot \left(D \cdot D\right)\right)}{d}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\frac{d}{\ell}}}{\sqrt{\frac{h}{d}}}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < -5.00000000000000045e24Initial program 80.5%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6460.0
Applied rewrites60.0%
Taylor expanded in d around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6434.1
Applied rewrites34.1%
if -5.00000000000000045e24 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) Initial program 58.6%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6444.4
Applied rewrites44.4%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6432.8
Applied rewrites32.8%
lift-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f6433.1
Applied rewrites33.1%
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
*-commutativeN/A
frac-timesN/A
clear-numN/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-/.f64N/A
pow1/2N/A
metadata-evalN/A
lift-/.f64N/A
lift-pow.f64N/A
un-div-invN/A
lower-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites59.3%
Final simplification51.6%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (/ (/ (* M_m D) (* d 2.0)) l)) (t_1 (sqrt (- d))))
(if (<= d -5.2e-180)
(*
(* (/ t_1 (sqrt (- l))) (/ t_1 (sqrt (- h))))
(- 1.0 (* (* (/ D d) (* 0.25 (* M_m M_m))) (* (/ D d) (/ (* h 0.5) l)))))
(if (<= d 4.8e-219)
(*
(* (* M_m M_m) (* (* D D) (/ 1.0 (* l (sqrt (/ l h))))))
(/ -0.125 d))
(if (<= d 3.4e-146)
(*
(- 1.0 (* t_0 (* h (* 0.25 (/ (* M_m D) d)))))
(* (pow (/ d h) (/ 1.0 2.0)) (/ (sqrt d) (sqrt l))))
(*
(* (* (sqrt d) (/ 1.0 (sqrt h))) (sqrt (/ d l)))
(+ 1.0 (* t_0 (/ (/ (* (* M_m D) 0.5) (* d 2.0)) (/ -1.0 h))))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = ((M_m * D) / (d * 2.0)) / l;
double t_1 = sqrt(-d);
double tmp;
if (d <= -5.2e-180) {
tmp = ((t_1 / sqrt(-l)) * (t_1 / sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l))));
} else if (d <= 4.8e-219) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
} else if (d <= 3.4e-146) {
tmp = (1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))))) * (pow((d / h), (1.0 / 2.0)) * (sqrt(d) / sqrt(l)));
} else {
tmp = ((sqrt(d) * (1.0 / sqrt(h))) * sqrt((d / l))) * (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h))));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = ((m_m * d_1) / (d * 2.0d0)) / l
t_1 = sqrt(-d)
if (d <= (-5.2d-180)) then
tmp = ((t_1 / sqrt(-l)) * (t_1 / sqrt(-h))) * (1.0d0 - (((d_1 / d) * (0.25d0 * (m_m * m_m))) * ((d_1 / d) * ((h * 0.5d0) / l))))
else if (d <= 4.8d-219) then
tmp = ((m_m * m_m) * ((d_1 * d_1) * (1.0d0 / (l * sqrt((l / h)))))) * ((-0.125d0) / d)
else if (d <= 3.4d-146) then
tmp = (1.0d0 - (t_0 * (h * (0.25d0 * ((m_m * d_1) / d))))) * (((d / h) ** (1.0d0 / 2.0d0)) * (sqrt(d) / sqrt(l)))
else
tmp = ((sqrt(d) * (1.0d0 / sqrt(h))) * sqrt((d / l))) * (1.0d0 + (t_0 * ((((m_m * d_1) * 0.5d0) / (d * 2.0d0)) / ((-1.0d0) / h))))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = ((M_m * D) / (d * 2.0)) / l;
double t_1 = Math.sqrt(-d);
double tmp;
if (d <= -5.2e-180) {
tmp = ((t_1 / Math.sqrt(-l)) * (t_1 / Math.sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l))));
} else if (d <= 4.8e-219) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * Math.sqrt((l / h)))))) * (-0.125 / d);
} else if (d <= 3.4e-146) {
tmp = (1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))))) * (Math.pow((d / h), (1.0 / 2.0)) * (Math.sqrt(d) / Math.sqrt(l)));
} else {
tmp = ((Math.sqrt(d) * (1.0 / Math.sqrt(h))) * Math.sqrt((d / l))) * (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = ((M_m * D) / (d * 2.0)) / l t_1 = math.sqrt(-d) tmp = 0 if d <= -5.2e-180: tmp = ((t_1 / math.sqrt(-l)) * (t_1 / math.sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) elif d <= 4.8e-219: tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * math.sqrt((l / h)))))) * (-0.125 / d) elif d <= 3.4e-146: tmp = (1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))))) * (math.pow((d / h), (1.0 / 2.0)) * (math.sqrt(d) / math.sqrt(l))) else: tmp = ((math.sqrt(d) * (1.0 / math.sqrt(h))) * math.sqrt((d / l))) * (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h)))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(Float64(Float64(M_m * D) / Float64(d * 2.0)) / l) t_1 = sqrt(Float64(-d)) tmp = 0.0 if (d <= -5.2e-180) tmp = Float64(Float64(Float64(t_1 / sqrt(Float64(-l))) * Float64(t_1 / sqrt(Float64(-h)))) * Float64(1.0 - Float64(Float64(Float64(D / d) * Float64(0.25 * Float64(M_m * M_m))) * Float64(Float64(D / d) * Float64(Float64(h * 0.5) / l))))); elseif (d <= 4.8e-219) tmp = Float64(Float64(Float64(M_m * M_m) * Float64(Float64(D * D) * Float64(1.0 / Float64(l * sqrt(Float64(l / h)))))) * Float64(-0.125 / d)); elseif (d <= 3.4e-146) tmp = Float64(Float64(1.0 - Float64(t_0 * Float64(h * Float64(0.25 * Float64(Float64(M_m * D) / d))))) * Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * Float64(sqrt(d) / sqrt(l)))); else tmp = Float64(Float64(Float64(sqrt(d) * Float64(1.0 / sqrt(h))) * sqrt(Float64(d / l))) * Float64(1.0 + Float64(t_0 * Float64(Float64(Float64(Float64(M_m * D) * 0.5) / Float64(d * 2.0)) / Float64(-1.0 / h))))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = ((M_m * D) / (d * 2.0)) / l;
t_1 = sqrt(-d);
tmp = 0.0;
if (d <= -5.2e-180)
tmp = ((t_1 / sqrt(-l)) * (t_1 / sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l))));
elseif (d <= 4.8e-219)
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
elseif (d <= 3.4e-146)
tmp = (1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))))) * (((d / h) ^ (1.0 / 2.0)) * (sqrt(d) / sqrt(l)));
else
tmp = ((sqrt(d) * (1.0 / sqrt(h))) * sqrt((d / l))) * (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[(N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[d, -5.2e-180], N[(N[(N[(t$95$1 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(t$95$1 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(D / d), $MachinePrecision] * N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(D / d), $MachinePrecision] * N[(N[(h * 0.5), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 4.8e-219], N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D * D), $MachinePrecision] * N[(1.0 / N[(l * N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 3.4e-146], N[(N[(1.0 - N[(t$95$0 * N[(h * N[(0.25 * N[(N[(M$95$m * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[d], $MachinePrecision] * N[(1.0 / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(t$95$0 * N[(N[(N[(N[(M$95$m * D), $MachinePrecision] * 0.5), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{M\_m \cdot D}{d \cdot 2}}{\ell}\\
t_1 := \sqrt{-d}\\
\mathbf{if}\;d \leq -5.2 \cdot 10^{-180}:\\
\;\;\;\;\left(\frac{t\_1}{\sqrt{-\ell}} \cdot \frac{t\_1}{\sqrt{-h}}\right) \cdot \left(1 - \left(\frac{D}{d} \cdot \left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \left(\frac{D}{d} \cdot \frac{h \cdot 0.5}{\ell}\right)\right)\\
\mathbf{elif}\;d \leq 4.8 \cdot 10^{-219}:\\
\;\;\;\;\left(\left(M\_m \cdot M\_m\right) \cdot \left(\left(D \cdot D\right) \cdot \frac{1}{\ell \cdot \sqrt{\frac{\ell}{h}}}\right)\right) \cdot \frac{-0.125}{d}\\
\mathbf{elif}\;d \leq 3.4 \cdot 10^{-146}:\\
\;\;\;\;\left(1 - t\_0 \cdot \left(h \cdot \left(0.25 \cdot \frac{M\_m \cdot D}{d}\right)\right)\right) \cdot \left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot \frac{\sqrt{d}}{\sqrt{\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\sqrt{d} \cdot \frac{1}{\sqrt{h}}\right) \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(1 + t\_0 \cdot \frac{\frac{\left(M\_m \cdot D\right) \cdot 0.5}{d \cdot 2}}{\frac{-1}{h}}\right)\\
\end{array}
\end{array}
if d < -5.1999999999999998e-180Initial program 75.6%
Applied rewrites69.2%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6471.9
Applied rewrites71.9%
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f6474.7
Applied rewrites74.7%
if -5.1999999999999998e-180 < d < 4.80000000000000028e-219Initial program 35.6%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6424.1
Applied rewrites24.1%
Applied rewrites21.6%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites32.1%
lift-*.f64N/A
lift-*.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f6458.5
Applied rewrites58.5%
if 4.80000000000000028e-219 < d < 3.4000000000000001e-146Initial program 54.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites60.6%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6460.6
Applied rewrites60.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
lower-*.f6460.6
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f6460.6
Applied rewrites60.6%
sqrt-divN/A
lift-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6488.2
Applied rewrites88.2%
if 3.4000000000000001e-146 < d Initial program 73.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites79.1%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6479.1
Applied rewrites79.1%
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
unpow-prod-downN/A
pow1/2N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6490.1
Applied rewrites90.1%
Final simplification77.8%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (- d))))
(if (<= h -1e-310)
(*
(* (/ t_0 (sqrt (- l))) (/ t_0 (sqrt (- h))))
(- 1.0 (* (* (/ D d) (* 0.25 (* M_m M_m))) (* (/ D d) (/ (* h 0.5) l)))))
(*
(* (* (sqrt d) (/ 1.0 (sqrt h))) (sqrt (/ d l)))
(+
1.0
(*
(/ (/ (* M_m D) (* d 2.0)) l)
(/ (/ (* (* M_m D) 0.5) (* d 2.0)) (/ -1.0 h))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt(-d);
double tmp;
if (h <= -1e-310) {
tmp = ((t_0 / sqrt(-l)) * (t_0 / sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l))));
} else {
tmp = ((sqrt(d) * (1.0 / sqrt(h))) * sqrt((d / l))) * (1.0 + ((((M_m * D) / (d * 2.0)) / l) * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h))));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(-d)
if (h <= (-1d-310)) then
tmp = ((t_0 / sqrt(-l)) * (t_0 / sqrt(-h))) * (1.0d0 - (((d_1 / d) * (0.25d0 * (m_m * m_m))) * ((d_1 / d) * ((h * 0.5d0) / l))))
else
tmp = ((sqrt(d) * (1.0d0 / sqrt(h))) * sqrt((d / l))) * (1.0d0 + ((((m_m * d_1) / (d * 2.0d0)) / l) * ((((m_m * d_1) * 0.5d0) / (d * 2.0d0)) / ((-1.0d0) / h))))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt(-d);
double tmp;
if (h <= -1e-310) {
tmp = ((t_0 / Math.sqrt(-l)) * (t_0 / Math.sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l))));
} else {
tmp = ((Math.sqrt(d) * (1.0 / Math.sqrt(h))) * Math.sqrt((d / l))) * (1.0 + ((((M_m * D) / (d * 2.0)) / l) * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt(-d) tmp = 0 if h <= -1e-310: tmp = ((t_0 / math.sqrt(-l)) * (t_0 / math.sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) else: tmp = ((math.sqrt(d) * (1.0 / math.sqrt(h))) * math.sqrt((d / l))) * (1.0 + ((((M_m * D) / (d * 2.0)) / l) * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h)))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(-d)) tmp = 0.0 if (h <= -1e-310) tmp = Float64(Float64(Float64(t_0 / sqrt(Float64(-l))) * Float64(t_0 / sqrt(Float64(-h)))) * Float64(1.0 - Float64(Float64(Float64(D / d) * Float64(0.25 * Float64(M_m * M_m))) * Float64(Float64(D / d) * Float64(Float64(h * 0.5) / l))))); else tmp = Float64(Float64(Float64(sqrt(d) * Float64(1.0 / sqrt(h))) * sqrt(Float64(d / l))) * Float64(1.0 + Float64(Float64(Float64(Float64(M_m * D) / Float64(d * 2.0)) / l) * Float64(Float64(Float64(Float64(M_m * D) * 0.5) / Float64(d * 2.0)) / Float64(-1.0 / h))))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt(-d);
tmp = 0.0;
if (h <= -1e-310)
tmp = ((t_0 / sqrt(-l)) * (t_0 / sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l))));
else
tmp = ((sqrt(d) * (1.0 / sqrt(h))) * sqrt((d / l))) * (1.0 + ((((M_m * D) / (d * 2.0)) / l) * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[h, -1e-310], N[(N[(N[(t$95$0 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(D / d), $MachinePrecision] * N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(D / d), $MachinePrecision] * N[(N[(h * 0.5), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[d], $MachinePrecision] * N[(1.0 / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(N[(N[(N[(M$95$m * D), $MachinePrecision] * 0.5), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{-d}\\
\mathbf{if}\;h \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\left(\frac{t\_0}{\sqrt{-\ell}} \cdot \frac{t\_0}{\sqrt{-h}}\right) \cdot \left(1 - \left(\frac{D}{d} \cdot \left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \left(\frac{D}{d} \cdot \frac{h \cdot 0.5}{\ell}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\sqrt{d} \cdot \frac{1}{\sqrt{h}}\right) \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(1 + \frac{\frac{M\_m \cdot D}{d \cdot 2}}{\ell} \cdot \frac{\frac{\left(M\_m \cdot D\right) \cdot 0.5}{d \cdot 2}}{\frac{-1}{h}}\right)\\
\end{array}
\end{array}
if h < -9.999999999999969e-311Initial program 64.6%
Applied rewrites59.8%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6467.8
Applied rewrites67.8%
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f6472.2
Applied rewrites72.2%
if -9.999999999999969e-311 < h Initial program 65.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites70.7%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6470.7
Applied rewrites70.7%
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
unpow-prod-downN/A
pow1/2N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6480.6
Applied rewrites80.6%
Final simplification76.5%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (/ (/ (* M_m D) (* d 2.0)) l))
(t_1 (sqrt (/ d l)))
(t_2 (* t_1 (sqrt (/ d h)))))
(if (<= d -1.3e+37)
(*
(- 1.0 (* (* (/ D d) (* 0.25 (* M_m M_m))) (* (/ D d) (/ (* h 0.5) l))))
(* t_1 (/ (sqrt (- d)) (sqrt (- h)))))
(if (<= d -1.5e-215)
(* (+ 1.0 (* t_0 (/ (/ (* (* M_m D) 0.5) (* d 2.0)) (/ -1.0 h)))) t_2)
(if (<= d 6.5e-219)
(*
(* (* M_m M_m) (* (* D D) (/ 1.0 (* l (sqrt (/ l h))))))
(/ -0.125 d))
(* (- 1.0 (* t_0 (* h (* 0.25 (/ (* M_m D) d))))) t_2))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = ((M_m * D) / (d * 2.0)) / l;
double t_1 = sqrt((d / l));
double t_2 = t_1 * sqrt((d / h));
double tmp;
if (d <= -1.3e+37) {
tmp = (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) * (t_1 * (sqrt(-d) / sqrt(-h)));
} else if (d <= -1.5e-215) {
tmp = (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h)))) * t_2;
} else if (d <= 6.5e-219) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
} else {
tmp = (1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))))) * t_2;
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = ((m_m * d_1) / (d * 2.0d0)) / l
t_1 = sqrt((d / l))
t_2 = t_1 * sqrt((d / h))
if (d <= (-1.3d+37)) then
tmp = (1.0d0 - (((d_1 / d) * (0.25d0 * (m_m * m_m))) * ((d_1 / d) * ((h * 0.5d0) / l)))) * (t_1 * (sqrt(-d) / sqrt(-h)))
else if (d <= (-1.5d-215)) then
tmp = (1.0d0 + (t_0 * ((((m_m * d_1) * 0.5d0) / (d * 2.0d0)) / ((-1.0d0) / h)))) * t_2
else if (d <= 6.5d-219) then
tmp = ((m_m * m_m) * ((d_1 * d_1) * (1.0d0 / (l * sqrt((l / h)))))) * ((-0.125d0) / d)
else
tmp = (1.0d0 - (t_0 * (h * (0.25d0 * ((m_m * d_1) / d))))) * t_2
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = ((M_m * D) / (d * 2.0)) / l;
double t_1 = Math.sqrt((d / l));
double t_2 = t_1 * Math.sqrt((d / h));
double tmp;
if (d <= -1.3e+37) {
tmp = (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) * (t_1 * (Math.sqrt(-d) / Math.sqrt(-h)));
} else if (d <= -1.5e-215) {
tmp = (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h)))) * t_2;
} else if (d <= 6.5e-219) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * Math.sqrt((l / h)))))) * (-0.125 / d);
} else {
tmp = (1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))))) * t_2;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = ((M_m * D) / (d * 2.0)) / l t_1 = math.sqrt((d / l)) t_2 = t_1 * math.sqrt((d / h)) tmp = 0 if d <= -1.3e+37: tmp = (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) * (t_1 * (math.sqrt(-d) / math.sqrt(-h))) elif d <= -1.5e-215: tmp = (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h)))) * t_2 elif d <= 6.5e-219: tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * math.sqrt((l / h)))))) * (-0.125 / d) else: tmp = (1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))))) * t_2 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(Float64(Float64(M_m * D) / Float64(d * 2.0)) / l) t_1 = sqrt(Float64(d / l)) t_2 = Float64(t_1 * sqrt(Float64(d / h))) tmp = 0.0 if (d <= -1.3e+37) tmp = Float64(Float64(1.0 - Float64(Float64(Float64(D / d) * Float64(0.25 * Float64(M_m * M_m))) * Float64(Float64(D / d) * Float64(Float64(h * 0.5) / l)))) * Float64(t_1 * Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))))); elseif (d <= -1.5e-215) tmp = Float64(Float64(1.0 + Float64(t_0 * Float64(Float64(Float64(Float64(M_m * D) * 0.5) / Float64(d * 2.0)) / Float64(-1.0 / h)))) * t_2); elseif (d <= 6.5e-219) tmp = Float64(Float64(Float64(M_m * M_m) * Float64(Float64(D * D) * Float64(1.0 / Float64(l * sqrt(Float64(l / h)))))) * Float64(-0.125 / d)); else tmp = Float64(Float64(1.0 - Float64(t_0 * Float64(h * Float64(0.25 * Float64(Float64(M_m * D) / d))))) * t_2); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = ((M_m * D) / (d * 2.0)) / l;
t_1 = sqrt((d / l));
t_2 = t_1 * sqrt((d / h));
tmp = 0.0;
if (d <= -1.3e+37)
tmp = (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) * (t_1 * (sqrt(-d) / sqrt(-h)));
elseif (d <= -1.5e-215)
tmp = (1.0 + (t_0 * ((((M_m * D) * 0.5) / (d * 2.0)) / (-1.0 / h)))) * t_2;
elseif (d <= 6.5e-219)
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
else
tmp = (1.0 - (t_0 * (h * (0.25 * ((M_m * D) / d))))) * t_2;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[(N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -1.3e+37], N[(N[(1.0 - N[(N[(N[(D / d), $MachinePrecision] * N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(D / d), $MachinePrecision] * N[(N[(h * 0.5), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -1.5e-215], N[(N[(1.0 + N[(t$95$0 * N[(N[(N[(N[(M$95$m * D), $MachinePrecision] * 0.5), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[d, 6.5e-219], N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D * D), $MachinePrecision] * N[(1.0 / N[(l * N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(t$95$0 * N[(h * N[(0.25 * N[(N[(M$95$m * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision]]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{M\_m \cdot D}{d \cdot 2}}{\ell}\\
t_1 := \sqrt{\frac{d}{\ell}}\\
t_2 := t\_1 \cdot \sqrt{\frac{d}{h}}\\
\mathbf{if}\;d \leq -1.3 \cdot 10^{+37}:\\
\;\;\;\;\left(1 - \left(\frac{D}{d} \cdot \left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \left(\frac{D}{d} \cdot \frac{h \cdot 0.5}{\ell}\right)\right) \cdot \left(t\_1 \cdot \frac{\sqrt{-d}}{\sqrt{-h}}\right)\\
\mathbf{elif}\;d \leq -1.5 \cdot 10^{-215}:\\
\;\;\;\;\left(1 + t\_0 \cdot \frac{\frac{\left(M\_m \cdot D\right) \cdot 0.5}{d \cdot 2}}{\frac{-1}{h}}\right) \cdot t\_2\\
\mathbf{elif}\;d \leq 6.5 \cdot 10^{-219}:\\
\;\;\;\;\left(\left(M\_m \cdot M\_m\right) \cdot \left(\left(D \cdot D\right) \cdot \frac{1}{\ell \cdot \sqrt{\frac{\ell}{h}}}\right)\right) \cdot \frac{-0.125}{d}\\
\mathbf{else}:\\
\;\;\;\;\left(1 - t\_0 \cdot \left(h \cdot \left(0.25 \cdot \frac{M\_m \cdot D}{d}\right)\right)\right) \cdot t\_2\\
\end{array}
\end{array}
if d < -1.3e37Initial program 80.3%
Applied rewrites75.9%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6481.2
Applied rewrites81.2%
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f6481.2
Applied rewrites81.2%
if -1.3e37 < d < -1.50000000000000013e-215Initial program 68.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites77.6%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6477.6
Applied rewrites77.6%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6477.6
Applied rewrites77.6%
if -1.50000000000000013e-215 < d < 6.49999999999999958e-219Initial program 33.5%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6426.9
Applied rewrites26.9%
Applied rewrites24.4%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites33.9%
lift-*.f64N/A
lift-*.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f6463.7
Applied rewrites63.7%
if 6.49999999999999958e-219 < d Initial program 70.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites76.2%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6476.2
Applied rewrites76.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
lower-*.f6476.2
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f6476.2
Applied rewrites76.2%
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f6476.2
Applied rewrites76.2%
Final simplification75.2%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (- d))))
(if (<= l -3.3e-106)
(*
(* (/ t_0 (sqrt (- l))) (/ t_0 (sqrt (- h))))
(- 1.0 (* (* (/ D d) (* 0.25 (* M_m M_m))) (* (/ D d) (/ (* h 0.5) l)))))
(if (<= l 9.6e+183)
(*
(-
1.0
(* (/ (/ (* M_m D) (* d 2.0)) l) (* h (* 0.25 (/ (* M_m D) d)))))
(* (sqrt (/ d l)) (sqrt (/ d h))))
(* d (/ (/ 1.0 (sqrt l)) (sqrt h)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt(-d);
double tmp;
if (l <= -3.3e-106) {
tmp = ((t_0 / sqrt(-l)) * (t_0 / sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l))));
} else if (l <= 9.6e+183) {
tmp = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (sqrt((d / l)) * sqrt((d / h)));
} else {
tmp = d * ((1.0 / sqrt(l)) / sqrt(h));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(-d)
if (l <= (-3.3d-106)) then
tmp = ((t_0 / sqrt(-l)) * (t_0 / sqrt(-h))) * (1.0d0 - (((d_1 / d) * (0.25d0 * (m_m * m_m))) * ((d_1 / d) * ((h * 0.5d0) / l))))
else if (l <= 9.6d+183) then
tmp = (1.0d0 - ((((m_m * d_1) / (d * 2.0d0)) / l) * (h * (0.25d0 * ((m_m * d_1) / d))))) * (sqrt((d / l)) * sqrt((d / h)))
else
tmp = d * ((1.0d0 / sqrt(l)) / sqrt(h))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt(-d);
double tmp;
if (l <= -3.3e-106) {
tmp = ((t_0 / Math.sqrt(-l)) * (t_0 / Math.sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l))));
} else if (l <= 9.6e+183) {
tmp = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (Math.sqrt((d / l)) * Math.sqrt((d / h)));
} else {
tmp = d * ((1.0 / Math.sqrt(l)) / Math.sqrt(h));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt(-d) tmp = 0 if l <= -3.3e-106: tmp = ((t_0 / math.sqrt(-l)) * (t_0 / math.sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) elif l <= 9.6e+183: tmp = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (math.sqrt((d / l)) * math.sqrt((d / h))) else: tmp = d * ((1.0 / math.sqrt(l)) / math.sqrt(h)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(-d)) tmp = 0.0 if (l <= -3.3e-106) tmp = Float64(Float64(Float64(t_0 / sqrt(Float64(-l))) * Float64(t_0 / sqrt(Float64(-h)))) * Float64(1.0 - Float64(Float64(Float64(D / d) * Float64(0.25 * Float64(M_m * M_m))) * Float64(Float64(D / d) * Float64(Float64(h * 0.5) / l))))); elseif (l <= 9.6e+183) tmp = Float64(Float64(1.0 - Float64(Float64(Float64(Float64(M_m * D) / Float64(d * 2.0)) / l) * Float64(h * Float64(0.25 * Float64(Float64(M_m * D) / d))))) * Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h)))); else tmp = Float64(d * Float64(Float64(1.0 / sqrt(l)) / sqrt(h))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt(-d);
tmp = 0.0;
if (l <= -3.3e-106)
tmp = ((t_0 / sqrt(-l)) * (t_0 / sqrt(-h))) * (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l))));
elseif (l <= 9.6e+183)
tmp = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (sqrt((d / l)) * sqrt((d / h)));
else
tmp = d * ((1.0 / sqrt(l)) / sqrt(h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[l, -3.3e-106], N[(N[(N[(t$95$0 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(D / d), $MachinePrecision] * N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(D / d), $MachinePrecision] * N[(N[(h * 0.5), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 9.6e+183], N[(N[(1.0 - N[(N[(N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(h * N[(0.25 * N[(N[(M$95$m * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(1.0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{-d}\\
\mathbf{if}\;\ell \leq -3.3 \cdot 10^{-106}:\\
\;\;\;\;\left(\frac{t\_0}{\sqrt{-\ell}} \cdot \frac{t\_0}{\sqrt{-h}}\right) \cdot \left(1 - \left(\frac{D}{d} \cdot \left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \left(\frac{D}{d} \cdot \frac{h \cdot 0.5}{\ell}\right)\right)\\
\mathbf{elif}\;\ell \leq 9.6 \cdot 10^{+183}:\\
\;\;\;\;\left(1 - \frac{\frac{M\_m \cdot D}{d \cdot 2}}{\ell} \cdot \left(h \cdot \left(0.25 \cdot \frac{M\_m \cdot D}{d}\right)\right)\right) \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\frac{1}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -3.30000000000000016e-106Initial program 63.3%
Applied rewrites60.0%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6466.9
Applied rewrites66.9%
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f6473.1
Applied rewrites73.1%
if -3.30000000000000016e-106 < l < 9.6000000000000006e183Initial program 70.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites77.1%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6477.1
Applied rewrites77.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
lower-*.f6477.1
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f6477.1
Applied rewrites77.1%
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f6477.1
Applied rewrites77.1%
if 9.6000000000000006e183 < l Initial program 48.4%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6431.1
Applied rewrites31.1%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6448.6
Applied rewrites48.6%
*-commutativeN/A
associate-/r*N/A
sqrt-divN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-/.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f6466.2
Applied rewrites66.2%
Final simplification74.3%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (/ d l)))
(t_1
(*
(-
1.0
(* (/ (/ (* M_m D) (* d 2.0)) l) (* h (* 0.25 (/ (* M_m D) d)))))
(* t_0 (sqrt (/ d h))))))
(if (<= d -1.3e+37)
(*
(- 1.0 (* (* (/ D d) (* 0.25 (* M_m M_m))) (* (/ D d) (/ (* h 0.5) l))))
(* t_0 (/ (sqrt (- d)) (sqrt (- h)))))
(if (<= d -1.5e-215)
t_1
(if (<= d 6.5e-219)
(*
(* (* M_m M_m) (* (* D D) (/ 1.0 (* l (sqrt (/ l h))))))
(/ -0.125 d))
t_1)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt((d / l));
double t_1 = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (t_0 * sqrt((d / h)));
double tmp;
if (d <= -1.3e+37) {
tmp = (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) * (t_0 * (sqrt(-d) / sqrt(-h)));
} else if (d <= -1.5e-215) {
tmp = t_1;
} else if (d <= 6.5e-219) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
} else {
tmp = t_1;
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sqrt((d / l))
t_1 = (1.0d0 - ((((m_m * d_1) / (d * 2.0d0)) / l) * (h * (0.25d0 * ((m_m * d_1) / d))))) * (t_0 * sqrt((d / h)))
if (d <= (-1.3d+37)) then
tmp = (1.0d0 - (((d_1 / d) * (0.25d0 * (m_m * m_m))) * ((d_1 / d) * ((h * 0.5d0) / l)))) * (t_0 * (sqrt(-d) / sqrt(-h)))
else if (d <= (-1.5d-215)) then
tmp = t_1
else if (d <= 6.5d-219) then
tmp = ((m_m * m_m) * ((d_1 * d_1) * (1.0d0 / (l * sqrt((l / h)))))) * ((-0.125d0) / d)
else
tmp = t_1
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt((d / l));
double t_1 = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (t_0 * Math.sqrt((d / h)));
double tmp;
if (d <= -1.3e+37) {
tmp = (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) * (t_0 * (Math.sqrt(-d) / Math.sqrt(-h)));
} else if (d <= -1.5e-215) {
tmp = t_1;
} else if (d <= 6.5e-219) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * Math.sqrt((l / h)))))) * (-0.125 / d);
} else {
tmp = t_1;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt((d / l)) t_1 = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (t_0 * math.sqrt((d / h))) tmp = 0 if d <= -1.3e+37: tmp = (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) * (t_0 * (math.sqrt(-d) / math.sqrt(-h))) elif d <= -1.5e-215: tmp = t_1 elif d <= 6.5e-219: tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * math.sqrt((l / h)))))) * (-0.125 / d) else: tmp = t_1 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(d / l)) t_1 = Float64(Float64(1.0 - Float64(Float64(Float64(Float64(M_m * D) / Float64(d * 2.0)) / l) * Float64(h * Float64(0.25 * Float64(Float64(M_m * D) / d))))) * Float64(t_0 * sqrt(Float64(d / h)))) tmp = 0.0 if (d <= -1.3e+37) tmp = Float64(Float64(1.0 - Float64(Float64(Float64(D / d) * Float64(0.25 * Float64(M_m * M_m))) * Float64(Float64(D / d) * Float64(Float64(h * 0.5) / l)))) * Float64(t_0 * Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))))); elseif (d <= -1.5e-215) tmp = t_1; elseif (d <= 6.5e-219) tmp = Float64(Float64(Float64(M_m * M_m) * Float64(Float64(D * D) * Float64(1.0 / Float64(l * sqrt(Float64(l / h)))))) * Float64(-0.125 / d)); else tmp = t_1; end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt((d / l));
t_1 = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (t_0 * sqrt((d / h)));
tmp = 0.0;
if (d <= -1.3e+37)
tmp = (1.0 - (((D / d) * (0.25 * (M_m * M_m))) * ((D / d) * ((h * 0.5) / l)))) * (t_0 * (sqrt(-d) / sqrt(-h)));
elseif (d <= -1.5e-215)
tmp = t_1;
elseif (d <= 6.5e-219)
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
else
tmp = t_1;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 - N[(N[(N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(h * N[(0.25 * N[(N[(M$95$m * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -1.3e+37], N[(N[(1.0 - N[(N[(N[(D / d), $MachinePrecision] * N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(D / d), $MachinePrecision] * N[(N[(h * 0.5), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -1.5e-215], t$95$1, If[LessEqual[d, 6.5e-219], N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D * D), $MachinePrecision] * N[(1.0 / N[(l * N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
t_1 := \left(1 - \frac{\frac{M\_m \cdot D}{d \cdot 2}}{\ell} \cdot \left(h \cdot \left(0.25 \cdot \frac{M\_m \cdot D}{d}\right)\right)\right) \cdot \left(t\_0 \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{if}\;d \leq -1.3 \cdot 10^{+37}:\\
\;\;\;\;\left(1 - \left(\frac{D}{d} \cdot \left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \left(\frac{D}{d} \cdot \frac{h \cdot 0.5}{\ell}\right)\right) \cdot \left(t\_0 \cdot \frac{\sqrt{-d}}{\sqrt{-h}}\right)\\
\mathbf{elif}\;d \leq -1.5 \cdot 10^{-215}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;d \leq 6.5 \cdot 10^{-219}:\\
\;\;\;\;\left(\left(M\_m \cdot M\_m\right) \cdot \left(\left(D \cdot D\right) \cdot \frac{1}{\ell \cdot \sqrt{\frac{\ell}{h}}}\right)\right) \cdot \frac{-0.125}{d}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if d < -1.3e37Initial program 80.3%
Applied rewrites75.9%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6481.2
Applied rewrites81.2%
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f6481.2
Applied rewrites81.2%
if -1.3e37 < d < -1.50000000000000013e-215 or 6.49999999999999958e-219 < d Initial program 69.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites76.7%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6476.7
Applied rewrites76.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
lower-*.f6476.7
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f6476.7
Applied rewrites76.7%
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f6476.7
Applied rewrites76.7%
if -1.50000000000000013e-215 < d < 6.49999999999999958e-219Initial program 33.5%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6426.9
Applied rewrites26.9%
Applied rewrites24.4%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites33.9%
lift-*.f64N/A
lift-*.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f6463.7
Applied rewrites63.7%
Final simplification75.2%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0
(*
(-
1.0
(* (/ (/ (* M_m D) (* d 2.0)) l) (* h (* 0.25 (/ (* M_m D) d)))))
(* (sqrt (/ d l)) (sqrt (/ d h))))))
(if (<= d -1.5e-215)
t_0
(if (<= d 6.5e-219)
(*
(* (* M_m M_m) (* (* D D) (/ 1.0 (* l (sqrt (/ l h))))))
(/ -0.125 d))
t_0))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (sqrt((d / l)) * sqrt((d / h)));
double tmp;
if (d <= -1.5e-215) {
tmp = t_0;
} else if (d <= 6.5e-219) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
} else {
tmp = t_0;
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: tmp
t_0 = (1.0d0 - ((((m_m * d_1) / (d * 2.0d0)) / l) * (h * (0.25d0 * ((m_m * d_1) / d))))) * (sqrt((d / l)) * sqrt((d / h)))
if (d <= (-1.5d-215)) then
tmp = t_0
else if (d <= 6.5d-219) then
tmp = ((m_m * m_m) * ((d_1 * d_1) * (1.0d0 / (l * sqrt((l / h)))))) * ((-0.125d0) / d)
else
tmp = t_0
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (Math.sqrt((d / l)) * Math.sqrt((d / h)));
double tmp;
if (d <= -1.5e-215) {
tmp = t_0;
} else if (d <= 6.5e-219) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * Math.sqrt((l / h)))))) * (-0.125 / d);
} else {
tmp = t_0;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (math.sqrt((d / l)) * math.sqrt((d / h))) tmp = 0 if d <= -1.5e-215: tmp = t_0 elif d <= 6.5e-219: tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * math.sqrt((l / h)))))) * (-0.125 / d) else: tmp = t_0 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(Float64(1.0 - Float64(Float64(Float64(Float64(M_m * D) / Float64(d * 2.0)) / l) * Float64(h * Float64(0.25 * Float64(Float64(M_m * D) / d))))) * Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h)))) tmp = 0.0 if (d <= -1.5e-215) tmp = t_0; elseif (d <= 6.5e-219) tmp = Float64(Float64(Float64(M_m * M_m) * Float64(Float64(D * D) * Float64(1.0 / Float64(l * sqrt(Float64(l / h)))))) * Float64(-0.125 / d)); else tmp = t_0; end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = (1.0 - ((((M_m * D) / (d * 2.0)) / l) * (h * (0.25 * ((M_m * D) / d))))) * (sqrt((d / l)) * sqrt((d / h)));
tmp = 0.0;
if (d <= -1.5e-215)
tmp = t_0;
elseif (d <= 6.5e-219)
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
else
tmp = t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[(N[(1.0 - N[(N[(N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(h * N[(0.25 * N[(N[(M$95$m * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -1.5e-215], t$95$0, If[LessEqual[d, 6.5e-219], N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D * D), $MachinePrecision] * N[(1.0 / N[(l * N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $MachinePrecision]), $MachinePrecision], t$95$0]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \left(1 - \frac{\frac{M\_m \cdot D}{d \cdot 2}}{\ell} \cdot \left(h \cdot \left(0.25 \cdot \frac{M\_m \cdot D}{d}\right)\right)\right) \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{if}\;d \leq -1.5 \cdot 10^{-215}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;d \leq 6.5 \cdot 10^{-219}:\\
\;\;\;\;\left(\left(M\_m \cdot M\_m\right) \cdot \left(\left(D \cdot D\right) \cdot \frac{1}{\ell \cdot \sqrt{\frac{\ell}{h}}}\right)\right) \cdot \frac{-0.125}{d}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if d < -1.50000000000000013e-215 or 6.49999999999999958e-219 < d Initial program 72.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
times-fracN/A
Applied rewrites77.6%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lower-sqrt.f6477.6
Applied rewrites77.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
lower-*.f6477.7
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f6477.7
Applied rewrites77.7%
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f6477.7
Applied rewrites77.7%
if -1.50000000000000013e-215 < d < 6.49999999999999958e-219Initial program 33.5%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6426.9
Applied rewrites26.9%
Applied rewrites24.4%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites33.9%
lift-*.f64N/A
lift-*.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f6463.7
Applied rewrites63.7%
Final simplification75.2%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (* h (* M_m M_m))))
(if (<= d -5.9e-180)
(*
(/ (sqrt (/ d h)) (sqrt (/ l d)))
(fma (/ D d) (/ (* D (* 0.125 (- t_0))) (* d l)) 1.0))
(if (<= d 1.2e-173)
(*
(* (* M_m M_m) (* (* D D) (/ 1.0 (* l (sqrt (/ l h))))))
(/ -0.125 d))
(/
(*
(sqrt d)
(*
(sqrt (/ d l))
(fma (/ D d) (/ (* 0.125 (* D t_0)) (* (- d) l)) 1.0)))
(sqrt h))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = h * (M_m * M_m);
double tmp;
if (d <= -5.9e-180) {
tmp = (sqrt((d / h)) / sqrt((l / d))) * fma((D / d), ((D * (0.125 * -t_0)) / (d * l)), 1.0);
} else if (d <= 1.2e-173) {
tmp = ((M_m * M_m) * ((D * D) * (1.0 / (l * sqrt((l / h)))))) * (-0.125 / d);
} else {
tmp = (sqrt(d) * (sqrt((d / l)) * fma((D / d), ((0.125 * (D * t_0)) / (-d * l)), 1.0))) / sqrt(h);
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(h * Float64(M_m * M_m)) tmp = 0.0 if (d <= -5.9e-180) tmp = Float64(Float64(sqrt(Float64(d / h)) / sqrt(Float64(l / d))) * fma(Float64(D / d), Float64(Float64(D * Float64(0.125 * Float64(-t_0))) / Float64(d * l)), 1.0)); elseif (d <= 1.2e-173) tmp = Float64(Float64(Float64(M_m * M_m) * Float64(Float64(D * D) * Float64(1.0 / Float64(l * sqrt(Float64(l / h)))))) * Float64(-0.125 / d)); else tmp = Float64(Float64(sqrt(d) * Float64(sqrt(Float64(d / l)) * fma(Float64(D / d), Float64(Float64(0.125 * Float64(D * t_0)) / Float64(Float64(-d) * l)), 1.0))) / sqrt(h)); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -5.9e-180], N[(N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(l / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(D / d), $MachinePrecision] * N[(N[(D * N[(0.125 * (-t$95$0)), $MachinePrecision]), $MachinePrecision] / N[(d * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.2e-173], N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D * D), $MachinePrecision] * N[(1.0 / N[(l * N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 / d), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[d], $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(D / d), $MachinePrecision] * N[(N[(0.125 * N[(D * t$95$0), $MachinePrecision]), $MachinePrecision] / N[((-d) * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := h \cdot \left(M\_m \cdot M\_m\right)\\
\mathbf{if}\;d \leq -5.9 \cdot 10^{-180}:\\
\;\;\;\;\frac{\sqrt{\frac{d}{h}}}{\sqrt{\frac{\ell}{d}}} \cdot \mathsf{fma}\left(\frac{D}{d}, \frac{D \cdot \left(0.125 \cdot \left(-t\_0\right)\right)}{d \cdot \ell}, 1\right)\\
\mathbf{elif}\;d \leq 1.2 \cdot 10^{-173}:\\
\;\;\;\;\left(\left(M\_m \cdot M\_m\right) \cdot \left(\left(D \cdot D\right) \cdot \frac{1}{\ell \cdot \sqrt{\frac{\ell}{h}}}\right)\right) \cdot \frac{-0.125}{d}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{d} \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \mathsf{fma}\left(\frac{D}{d}, \frac{0.125 \cdot \left(D \cdot t\_0\right)}{\left(-d\right) \cdot \ell}, 1\right)\right)}{\sqrt{h}}\\
\end{array}
\end{array}
if d < -5.9000000000000003e-180Initial program 75.6%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6462.3
Applied rewrites62.3%
lift-/.f64N/A
metadata-evalN/A
unpow1/2N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6461.5
Applied rewrites61.5%
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
metadata-evalN/A
lift-/.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
div-invN/A
lower-/.f6461.6
lift-/.f64N/A
metadata-eval61.6
lift-pow.f64N/A
unpow1/2N/A
lower-sqrt.f6461.6
Applied rewrites61.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied rewrites67.7%
if -5.9000000000000003e-180 < d < 1.20000000000000008e-173Initial program 38.4%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6424.5
Applied rewrites24.5%
Applied rewrites22.5%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites31.8%
lift-*.f64N/A
lift-*.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f6453.4
Applied rewrites53.4%
if 1.20000000000000008e-173 < d Initial program 73.0%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6452.4
Applied rewrites52.4%
Applied rewrites52.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sub-negN/A
+-commutativeN/A
Applied rewrites68.2%
Final simplification64.3%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (/ h (* l (* l l))))))
(if (<= d -6.5e-109)
(/ (sqrt (/ d l)) (sqrt (/ h d)))
(if (<= d -7.8e-292)
(* t_0 (* (* M_m (* M_m (* D D))) (/ 0.125 d)))
(if (<= d 1.55e-194)
(* (/ -0.125 d) (* (* M_m M_m) (* (* D D) t_0)))
(* d (/ (/ 1.0 (sqrt h)) (sqrt l))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt((h / (l * (l * l))));
double tmp;
if (d <= -6.5e-109) {
tmp = sqrt((d / l)) / sqrt((h / d));
} else if (d <= -7.8e-292) {
tmp = t_0 * ((M_m * (M_m * (D * D))) * (0.125 / d));
} else if (d <= 1.55e-194) {
tmp = (-0.125 / d) * ((M_m * M_m) * ((D * D) * t_0));
} else {
tmp = d * ((1.0 / sqrt(h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((h / (l * (l * l))))
if (d <= (-6.5d-109)) then
tmp = sqrt((d / l)) / sqrt((h / d))
else if (d <= (-7.8d-292)) then
tmp = t_0 * ((m_m * (m_m * (d_1 * d_1))) * (0.125d0 / d))
else if (d <= 1.55d-194) then
tmp = ((-0.125d0) / d) * ((m_m * m_m) * ((d_1 * d_1) * t_0))
else
tmp = d * ((1.0d0 / sqrt(h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt((h / (l * (l * l))));
double tmp;
if (d <= -6.5e-109) {
tmp = Math.sqrt((d / l)) / Math.sqrt((h / d));
} else if (d <= -7.8e-292) {
tmp = t_0 * ((M_m * (M_m * (D * D))) * (0.125 / d));
} else if (d <= 1.55e-194) {
tmp = (-0.125 / d) * ((M_m * M_m) * ((D * D) * t_0));
} else {
tmp = d * ((1.0 / Math.sqrt(h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt((h / (l * (l * l)))) tmp = 0 if d <= -6.5e-109: tmp = math.sqrt((d / l)) / math.sqrt((h / d)) elif d <= -7.8e-292: tmp = t_0 * ((M_m * (M_m * (D * D))) * (0.125 / d)) elif d <= 1.55e-194: tmp = (-0.125 / d) * ((M_m * M_m) * ((D * D) * t_0)) else: tmp = d * ((1.0 / math.sqrt(h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(h / Float64(l * Float64(l * l)))) tmp = 0.0 if (d <= -6.5e-109) tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); elseif (d <= -7.8e-292) tmp = Float64(t_0 * Float64(Float64(M_m * Float64(M_m * Float64(D * D))) * Float64(0.125 / d))); elseif (d <= 1.55e-194) tmp = Float64(Float64(-0.125 / d) * Float64(Float64(M_m * M_m) * Float64(Float64(D * D) * t_0))); else tmp = Float64(d * Float64(Float64(1.0 / sqrt(h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt((h / (l * (l * l))));
tmp = 0.0;
if (d <= -6.5e-109)
tmp = sqrt((d / l)) / sqrt((h / d));
elseif (d <= -7.8e-292)
tmp = t_0 * ((M_m * (M_m * (D * D))) * (0.125 / d));
elseif (d <= 1.55e-194)
tmp = (-0.125 / d) * ((M_m * M_m) * ((D * D) * t_0));
else
tmp = d * ((1.0 / sqrt(h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(h / N[(l * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -6.5e-109], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -7.8e-292], N[(t$95$0 * N[(N[(M$95$m * N[(M$95$m * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.125 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.55e-194], N[(N[(-0.125 / d), $MachinePrecision] * N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D * D), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(1.0 / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{h}{\ell \cdot \left(\ell \cdot \ell\right)}}\\
\mathbf{if}\;d \leq -6.5 \cdot 10^{-109}:\\
\;\;\;\;\frac{\sqrt{\frac{d}{\ell}}}{\sqrt{\frac{h}{d}}}\\
\mathbf{elif}\;d \leq -7.8 \cdot 10^{-292}:\\
\;\;\;\;t\_0 \cdot \left(\left(M\_m \cdot \left(M\_m \cdot \left(D \cdot D\right)\right)\right) \cdot \frac{0.125}{d}\right)\\
\mathbf{elif}\;d \leq 1.55 \cdot 10^{-194}:\\
\;\;\;\;\frac{-0.125}{d} \cdot \left(\left(M\_m \cdot M\_m\right) \cdot \left(\left(D \cdot D\right) \cdot t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\frac{1}{\sqrt{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if d < -6.49999999999999959e-109Initial program 78.0%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6461.6
Applied rewrites61.6%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f643.7
Applied rewrites3.7%
lift-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f642.5
Applied rewrites2.5%
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
*-commutativeN/A
frac-timesN/A
clear-numN/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-/.f64N/A
pow1/2N/A
metadata-evalN/A
lift-/.f64N/A
lift-pow.f64N/A
un-div-invN/A
lower-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites54.6%
if -6.49999999999999959e-109 < d < -7.8e-292Initial program 36.9%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6431.5
Applied rewrites31.5%
Taylor expanded in h around -inf
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-/l*N/A
mul-1-negN/A
distribute-rgt-neg-inN/A
associate-*r*N/A
associate-/l*N/A
Applied rewrites53.7%
if -7.8e-292 < d < 1.55000000000000005e-194Initial program 42.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6436.4
Applied rewrites36.4%
Applied rewrites42.2%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites45.8%
if 1.55000000000000005e-194 < d Initial program 72.6%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6449.4
Applied rewrites49.4%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6449.4
Applied rewrites49.4%
associate-/r*N/A
lift-/.f64N/A
sqrt-divN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-sqrt.f6460.7
Applied rewrites60.7%
Final simplification55.7%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (/ h (* l (* l l))))) (t_1 (* M_m (* M_m (* D D)))))
(if (<= d -6.5e-109)
(/ (sqrt (/ d l)) (sqrt (/ h d)))
(if (<= d -1.95e-298)
(* t_0 (* t_1 (/ 0.125 d)))
(if (<= d 4.9e-194)
(* -0.125 (* t_0 (/ t_1 d)))
(* d (/ (/ 1.0 (sqrt h)) (sqrt l))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt((h / (l * (l * l))));
double t_1 = M_m * (M_m * (D * D));
double tmp;
if (d <= -6.5e-109) {
tmp = sqrt((d / l)) / sqrt((h / d));
} else if (d <= -1.95e-298) {
tmp = t_0 * (t_1 * (0.125 / d));
} else if (d <= 4.9e-194) {
tmp = -0.125 * (t_0 * (t_1 / d));
} else {
tmp = d * ((1.0 / sqrt(h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sqrt((h / (l * (l * l))))
t_1 = m_m * (m_m * (d_1 * d_1))
if (d <= (-6.5d-109)) then
tmp = sqrt((d / l)) / sqrt((h / d))
else if (d <= (-1.95d-298)) then
tmp = t_0 * (t_1 * (0.125d0 / d))
else if (d <= 4.9d-194) then
tmp = (-0.125d0) * (t_0 * (t_1 / d))
else
tmp = d * ((1.0d0 / sqrt(h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.sqrt((h / (l * (l * l))));
double t_1 = M_m * (M_m * (D * D));
double tmp;
if (d <= -6.5e-109) {
tmp = Math.sqrt((d / l)) / Math.sqrt((h / d));
} else if (d <= -1.95e-298) {
tmp = t_0 * (t_1 * (0.125 / d));
} else if (d <= 4.9e-194) {
tmp = -0.125 * (t_0 * (t_1 / d));
} else {
tmp = d * ((1.0 / Math.sqrt(h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.sqrt((h / (l * (l * l)))) t_1 = M_m * (M_m * (D * D)) tmp = 0 if d <= -6.5e-109: tmp = math.sqrt((d / l)) / math.sqrt((h / d)) elif d <= -1.95e-298: tmp = t_0 * (t_1 * (0.125 / d)) elif d <= 4.9e-194: tmp = -0.125 * (t_0 * (t_1 / d)) else: tmp = d * ((1.0 / math.sqrt(h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(h / Float64(l * Float64(l * l)))) t_1 = Float64(M_m * Float64(M_m * Float64(D * D))) tmp = 0.0 if (d <= -6.5e-109) tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); elseif (d <= -1.95e-298) tmp = Float64(t_0 * Float64(t_1 * Float64(0.125 / d))); elseif (d <= 4.9e-194) tmp = Float64(-0.125 * Float64(t_0 * Float64(t_1 / d))); else tmp = Float64(d * Float64(Float64(1.0 / sqrt(h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = sqrt((h / (l * (l * l))));
t_1 = M_m * (M_m * (D * D));
tmp = 0.0;
if (d <= -6.5e-109)
tmp = sqrt((d / l)) / sqrt((h / d));
elseif (d <= -1.95e-298)
tmp = t_0 * (t_1 * (0.125 / d));
elseif (d <= 4.9e-194)
tmp = -0.125 * (t_0 * (t_1 / d));
else
tmp = d * ((1.0 / sqrt(h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(h / N[(l * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(M$95$m * N[(M$95$m * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -6.5e-109], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -1.95e-298], N[(t$95$0 * N[(t$95$1 * N[(0.125 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 4.9e-194], N[(-0.125 * N[(t$95$0 * N[(t$95$1 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(1.0 / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{h}{\ell \cdot \left(\ell \cdot \ell\right)}}\\
t_1 := M\_m \cdot \left(M\_m \cdot \left(D \cdot D\right)\right)\\
\mathbf{if}\;d \leq -6.5 \cdot 10^{-109}:\\
\;\;\;\;\frac{\sqrt{\frac{d}{\ell}}}{\sqrt{\frac{h}{d}}}\\
\mathbf{elif}\;d \leq -1.95 \cdot 10^{-298}:\\
\;\;\;\;t\_0 \cdot \left(t\_1 \cdot \frac{0.125}{d}\right)\\
\mathbf{elif}\;d \leq 4.9 \cdot 10^{-194}:\\
\;\;\;\;-0.125 \cdot \left(t\_0 \cdot \frac{t\_1}{d}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\frac{1}{\sqrt{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if d < -6.49999999999999959e-109Initial program 78.0%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6461.6
Applied rewrites61.6%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f643.7
Applied rewrites3.7%
lift-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f642.5
Applied rewrites2.5%
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
*-commutativeN/A
frac-timesN/A
clear-numN/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-/.f64N/A
pow1/2N/A
metadata-evalN/A
lift-/.f64N/A
lift-pow.f64N/A
un-div-invN/A
lower-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites54.6%
if -6.49999999999999959e-109 < d < -1.95000000000000014e-298Initial program 39.0%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6431.6
Applied rewrites31.6%
Taylor expanded in h around -inf
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-/l*N/A
mul-1-negN/A
distribute-rgt-neg-inN/A
associate-*r*N/A
associate-/l*N/A
Applied rewrites52.2%
if -1.95000000000000014e-298 < d < 4.90000000000000004e-194Initial program 40.2%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6436.7
Applied rewrites36.7%
Taylor expanded in d around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6448.4
Applied rewrites48.4%
if 4.90000000000000004e-194 < d Initial program 72.6%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6449.4
Applied rewrites49.4%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6449.4
Applied rewrites49.4%
associate-/r*N/A
lift-/.f64N/A
sqrt-divN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-sqrt.f6460.7
Applied rewrites60.7%
Final simplification55.9%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -5.6e+227)
(/ (sqrt (/ d l)) (sqrt (/ h d)))
(if (<= l 2.8e-244)
(* (- d) (sqrt (/ 1.0 (* h l))))
(* d (/ (/ 1.0 (sqrt h)) (sqrt l))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -5.6e+227) {
tmp = sqrt((d / l)) / sqrt((h / d));
} else if (l <= 2.8e-244) {
tmp = -d * sqrt((1.0 / (h * l)));
} else {
tmp = d * ((1.0 / sqrt(h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (l <= (-5.6d+227)) then
tmp = sqrt((d / l)) / sqrt((h / d))
else if (l <= 2.8d-244) then
tmp = -d * sqrt((1.0d0 / (h * l)))
else
tmp = d * ((1.0d0 / sqrt(h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -5.6e+227) {
tmp = Math.sqrt((d / l)) / Math.sqrt((h / d));
} else if (l <= 2.8e-244) {
tmp = -d * Math.sqrt((1.0 / (h * l)));
} else {
tmp = d * ((1.0 / Math.sqrt(h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -5.6e+227: tmp = math.sqrt((d / l)) / math.sqrt((h / d)) elif l <= 2.8e-244: tmp = -d * math.sqrt((1.0 / (h * l))) else: tmp = d * ((1.0 / math.sqrt(h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -5.6e+227) tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); elseif (l <= 2.8e-244) tmp = Float64(Float64(-d) * sqrt(Float64(1.0 / Float64(h * l)))); else tmp = Float64(d * Float64(Float64(1.0 / sqrt(h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -5.6e+227)
tmp = sqrt((d / l)) / sqrt((h / d));
elseif (l <= 2.8e-244)
tmp = -d * sqrt((1.0 / (h * l)));
else
tmp = d * ((1.0 / sqrt(h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -5.6e+227], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 2.8e-244], N[((-d) * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(1.0 / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -5.6 \cdot 10^{+227}:\\
\;\;\;\;\frac{\sqrt{\frac{d}{\ell}}}{\sqrt{\frac{h}{d}}}\\
\mathbf{elif}\;\ell \leq 2.8 \cdot 10^{-244}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\frac{1}{\sqrt{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -5.59999999999999968e227Initial program 54.8%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6431.8
Applied rewrites31.8%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6426.6
Applied rewrites26.6%
lift-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f6426.6
Applied rewrites26.6%
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
*-commutativeN/A
frac-timesN/A
clear-numN/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-/.f64N/A
pow1/2N/A
metadata-evalN/A
lift-/.f64N/A
lift-pow.f64N/A
un-div-invN/A
lower-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites50.0%
if -5.59999999999999968e227 < l < 2.80000000000000013e-244Initial program 66.9%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6454.9
Applied rewrites54.9%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*l*N/A
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6448.0
Applied rewrites48.0%
if 2.80000000000000013e-244 < l Initial program 65.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6446.1
Applied rewrites46.1%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6442.9
Applied rewrites42.9%
associate-/r*N/A
lift-/.f64N/A
sqrt-divN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.1
Applied rewrites53.1%
Final simplification50.6%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (<= l 2.8e-244) (* (- d) (sqrt (/ 1.0 (* h l)))) (* d (/ (/ 1.0 (sqrt h)) (sqrt l)))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 2.8e-244) {
tmp = -d * sqrt((1.0 / (h * l)));
} else {
tmp = d * ((1.0 / sqrt(h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (l <= 2.8d-244) then
tmp = -d * sqrt((1.0d0 / (h * l)))
else
tmp = d * ((1.0d0 / sqrt(h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 2.8e-244) {
tmp = -d * Math.sqrt((1.0 / (h * l)));
} else {
tmp = d * ((1.0 / Math.sqrt(h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= 2.8e-244: tmp = -d * math.sqrt((1.0 / (h * l))) else: tmp = d * ((1.0 / math.sqrt(h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= 2.8e-244) tmp = Float64(Float64(-d) * sqrt(Float64(1.0 / Float64(h * l)))); else tmp = Float64(d * Float64(Float64(1.0 / sqrt(h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= 2.8e-244)
tmp = -d * sqrt((1.0 / (h * l)));
else
tmp = d * ((1.0 / sqrt(h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, 2.8e-244], N[((-d) * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(1.0 / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.8 \cdot 10^{-244}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\frac{1}{\sqrt{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < 2.80000000000000013e-244Initial program 65.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6452.0
Applied rewrites52.0%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*l*N/A
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6445.2
Applied rewrites45.2%
if 2.80000000000000013e-244 < l Initial program 65.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6446.1
Applied rewrites46.1%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6442.9
Applied rewrites42.9%
associate-/r*N/A
lift-/.f64N/A
sqrt-divN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.1
Applied rewrites53.1%
Final simplification49.0%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (<= l 2.8e-244) (* (- d) (sqrt (/ 1.0 (* h l)))) (/ d (* (sqrt l) (sqrt h)))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 2.8e-244) {
tmp = -d * sqrt((1.0 / (h * l)));
} else {
tmp = d / (sqrt(l) * sqrt(h));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (l <= 2.8d-244) then
tmp = -d * sqrt((1.0d0 / (h * l)))
else
tmp = d / (sqrt(l) * sqrt(h))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 2.8e-244) {
tmp = -d * Math.sqrt((1.0 / (h * l)));
} else {
tmp = d / (Math.sqrt(l) * Math.sqrt(h));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= 2.8e-244: tmp = -d * math.sqrt((1.0 / (h * l))) else: tmp = d / (math.sqrt(l) * math.sqrt(h)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= 2.8e-244) tmp = Float64(Float64(-d) * sqrt(Float64(1.0 / Float64(h * l)))); else tmp = Float64(d / Float64(sqrt(l) * sqrt(h))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= 2.8e-244)
tmp = -d * sqrt((1.0 / (h * l)));
else
tmp = d / (sqrt(l) * sqrt(h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, 2.8e-244], N[((-d) * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.8 \cdot 10^{-244}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < 2.80000000000000013e-244Initial program 65.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6452.0
Applied rewrites52.0%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*l*N/A
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6445.2
Applied rewrites45.2%
if 2.80000000000000013e-244 < l Initial program 65.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6446.1
Applied rewrites46.1%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6442.9
Applied rewrites42.9%
lift-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f6443.4
Applied rewrites43.4%
sqrt-prodN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6453.1
Applied rewrites53.1%
Final simplification49.0%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (if (<= l 3.8e-243) (* (- d) (sqrt (/ 1.0 (* h l)))) (/ d (sqrt (* h l)))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 3.8e-243) {
tmp = -d * sqrt((1.0 / (h * l)));
} else {
tmp = d / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
real(8) :: tmp
if (l <= 3.8d-243) then
tmp = -d * sqrt((1.0d0 / (h * l)))
else
tmp = d / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= 3.8e-243) {
tmp = -d * Math.sqrt((1.0 / (h * l)));
} else {
tmp = d / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= 3.8e-243: tmp = -d * math.sqrt((1.0 / (h * l))) else: tmp = d / math.sqrt((h * l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= 3.8e-243) tmp = Float64(Float64(-d) * sqrt(Float64(1.0 / Float64(h * l)))); else tmp = Float64(d / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= 3.8e-243)
tmp = -d * sqrt((1.0 / (h * l)));
else
tmp = d / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, 3.8e-243], N[((-d) * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3.8 \cdot 10^{-243}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < 3.7999999999999998e-243Initial program 65.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6452.0
Applied rewrites52.0%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*l*N/A
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6445.2
Applied rewrites45.2%
if 3.7999999999999998e-243 < l Initial program 65.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6446.1
Applied rewrites46.1%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6442.9
Applied rewrites42.9%
lift-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f6443.4
Applied rewrites43.4%
Final simplification44.3%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (* d (sqrt (/ 1.0 (* h l)))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
return d * sqrt((1.0 / (h * l)));
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
code = d * sqrt((1.0d0 / (h * l)))
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
return d * Math.sqrt((1.0 / (h * l)));
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): return d * math.sqrt((1.0 / (h * l)))
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) return Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp = code(d, h, l, M_m, D)
tmp = d * sqrt((1.0 / (h * l)));
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
d \cdot \sqrt{\frac{1}{h \cdot \ell}}
\end{array}
Initial program 65.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6449.2
Applied rewrites49.2%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6424.3
Applied rewrites24.3%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (/ d (sqrt (* h l))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
return d / sqrt((h * l));
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_1
code = d / sqrt((h * l))
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
return d / Math.sqrt((h * l));
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): return d / math.sqrt((h * l))
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) return Float64(d / sqrt(Float64(h * l))) end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp = code(d, h, l, M_m, D)
tmp = d / sqrt((h * l));
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\frac{d}{\sqrt{h \cdot \ell}}
\end{array}
Initial program 65.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6449.2
Applied rewrites49.2%
Taylor expanded in d around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6424.3
Applied rewrites24.3%
lift-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f6424.1
Applied rewrites24.1%
herbie shell --seed 2024219
(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)))))