
(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)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ (* 0.5 (* M_m D_m)) d)) (t_1 (* 0.5 t_0)) (t_2 (/ t_0 l)))
(if (<= d -3.1e-140)
(*
(* (/ (sqrt (- 0.0 d)) (sqrt (- 0.0 h))) (sqrt (/ d l)))
(- 1.0 (* (/ (* h t_0) l) t_1)))
(if (<= d -1.5e-287)
(* (* d (sqrt (/ 1.0 (* h l)))) (+ (* t_2 (/ t_1 (/ 1.0 h))) -1.0))
(if (<= d 3.6e-230)
(fma
(* D_m D_m)
(* (/ (sqrt (/ h l)) l) (/ (* (* M_m M_m) -0.125) d))
0.0)
(*
(+ 1.0 (* t_2 (/ t_1 (/ -1.0 h))))
(* (/ 1.0 (sqrt (/ h d))) (/ (sqrt d) (sqrt l)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (0.5 * (M_m * D_m)) / d;
double t_1 = 0.5 * t_0;
double t_2 = t_0 / l;
double tmp;
if (d <= -3.1e-140) {
tmp = ((sqrt((0.0 - d)) / sqrt((0.0 - h))) * sqrt((d / l))) * (1.0 - (((h * t_0) / l) * t_1));
} else if (d <= -1.5e-287) {
tmp = (d * sqrt((1.0 / (h * l)))) * ((t_2 * (t_1 / (1.0 / h))) + -1.0);
} else if (d <= 3.6e-230) {
tmp = fma((D_m * D_m), ((sqrt((h / l)) / l) * (((M_m * M_m) * -0.125) / d)), 0.0);
} else {
tmp = (1.0 + (t_2 * (t_1 / (-1.0 / h)))) * ((1.0 / sqrt((h / d))) * (sqrt(d) / sqrt(l)));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(Float64(0.5 * Float64(M_m * D_m)) / d) t_1 = Float64(0.5 * t_0) t_2 = Float64(t_0 / l) tmp = 0.0 if (d <= -3.1e-140) tmp = Float64(Float64(Float64(sqrt(Float64(0.0 - d)) / sqrt(Float64(0.0 - h))) * sqrt(Float64(d / l))) * Float64(1.0 - Float64(Float64(Float64(h * t_0) / l) * t_1))); elseif (d <= -1.5e-287) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(Float64(t_2 * Float64(t_1 / Float64(1.0 / h))) + -1.0)); elseif (d <= 3.6e-230) tmp = fma(Float64(D_m * D_m), Float64(Float64(sqrt(Float64(h / l)) / l) * Float64(Float64(Float64(M_m * M_m) * -0.125) / d)), 0.0); else tmp = Float64(Float64(1.0 + Float64(t_2 * Float64(t_1 / Float64(-1.0 / h)))) * Float64(Float64(1.0 / sqrt(Float64(h / d))) * Float64(sqrt(d) / sqrt(l)))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[(0.5 * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]}, Block[{t$95$1 = N[(0.5 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 / l), $MachinePrecision]}, If[LessEqual[d, -3.1e-140], N[(N[(N[(N[Sqrt[N[(0.0 - d), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(0.0 - h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(h * t$95$0), $MachinePrecision] / l), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -1.5e-287], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$2 * N[(t$95$1 / N[(1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 3.6e-230], N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision] / l), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision], N[(N[(1.0 + N[(t$95$2 * N[(t$95$1 / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{0.5 \cdot \left(M\_m \cdot D\_m\right)}{d}\\
t_1 := 0.5 \cdot t\_0\\
t_2 := \frac{t\_0}{\ell}\\
\mathbf{if}\;d \leq -3.1 \cdot 10^{-140}:\\
\;\;\;\;\left(\frac{\sqrt{0 - d}}{\sqrt{0 - h}} \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(1 - \frac{h \cdot t\_0}{\ell} \cdot t\_1\right)\\
\mathbf{elif}\;d \leq -1.5 \cdot 10^{-287}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(t\_2 \cdot \frac{t\_1}{\frac{1}{h}} + -1\right)\\
\mathbf{elif}\;d \leq 3.6 \cdot 10^{-230}:\\
\;\;\;\;\mathsf{fma}\left(D\_m \cdot D\_m, \frac{\sqrt{\frac{h}{\ell}}}{\ell} \cdot \frac{\left(M\_m \cdot M\_m\right) \cdot -0.125}{d}, 0\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + t\_2 \cdot \frac{t\_1}{\frac{-1}{h}}\right) \cdot \left(\frac{1}{\sqrt{\frac{h}{d}}} \cdot \frac{\sqrt{d}}{\sqrt{\ell}}\right)\\
\end{array}
\end{array}
if d < -3.0999999999999999e-140Initial program 82.9%
*-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr88.3%
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6488.3
Applied egg-rr88.3%
metadata-evalN/A
unpow1/2N/A
frac-2negN/A
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f6496.1
Applied egg-rr96.1%
if -3.0999999999999999e-140 < d < -1.49999999999999996e-287Initial program 55.5%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr58.5%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6458.5
Applied egg-rr58.5%
metadata-evalN/A
pow1/2N/A
frac-2negN/A
div-invN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f6477.4
Applied egg-rr77.4%
Taylor expanded in h around 0
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6491.7
Simplified91.7%
if -1.49999999999999996e-287 < d < 3.5999999999999998e-230Initial program 38.2%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr42.1%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6442.1
Applied egg-rr42.1%
Taylor expanded in h around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
Simplified30.5%
associate-/r*N/A
sqrt-divN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6460.2
Applied egg-rr60.2%
if 3.5999999999999998e-230 < d Initial program 71.3%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr79.2%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6479.6
Applied egg-rr79.6%
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6487.7
Applied egg-rr87.7%
Final simplification88.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ (* (* M_m M_m) -0.125) d))
(t_1
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(+
1.0
(* (/ h l) (* (pow (/ (* M_m D_m) (* d 2.0)) 2.0) (/ -1.0 2.0)))))))
(if (<= t_1 -1e-40)
(fma (* D_m D_m) (* (/ (sqrt (/ h l)) l) t_0) 0.0)
(if (<= t_1 INFINITY)
(/ (sqrt (/ d l)) (sqrt (/ h d)))
(fma (* D_m D_m) (* t_0 (/ 1.0 (* l (sqrt (/ l h))))) 0.0)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = ((M_m * M_m) * -0.125) / d;
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_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))));
double tmp;
if (t_1 <= -1e-40) {
tmp = fma((D_m * D_m), ((sqrt((h / l)) / l) * t_0), 0.0);
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((d / l)) / sqrt((h / d));
} else {
tmp = fma((D_m * D_m), (t_0 * (1.0 / (l * sqrt((l / h))))), 0.0);
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(Float64(Float64(M_m * M_m) * -0.125) / d) 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_m) / Float64(d * 2.0)) ^ 2.0) * Float64(-1.0 / 2.0))))) tmp = 0.0 if (t_1 <= -1e-40) tmp = fma(Float64(D_m * D_m), Float64(Float64(sqrt(Float64(h / l)) / l) * t_0), 0.0); elseif (t_1 <= Inf) tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); else tmp = fma(Float64(D_m * D_m), Float64(t_0 * Float64(1.0 / Float64(l * sqrt(Float64(l / h))))), 0.0); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision] / d), $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$95$m), $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, -1e-40], N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision] / l), $MachinePrecision] * t$95$0), $MachinePrecision] + 0.0), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(t$95$0 * N[(1.0 / N[(l * N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{\left(M\_m \cdot M\_m\right) \cdot -0.125}{d}\\
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\_m}{d \cdot 2}\right)}^{2} \cdot \frac{-1}{2}\right)\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-40}:\\
\;\;\;\;\mathsf{fma}\left(D\_m \cdot D\_m, \frac{\sqrt{\frac{h}{\ell}}}{\ell} \cdot t\_0, 0\right)\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\frac{d}{\ell}}}{\sqrt{\frac{h}{d}}}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(D\_m \cdot D\_m, t\_0 \cdot \frac{1}{\ell \cdot \sqrt{\frac{\ell}{h}}}, 0\right)\\
\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)))) < -9.9999999999999993e-41Initial program 89.0%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr92.8%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6491.8
Applied egg-rr91.8%
Taylor expanded in h around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
Simplified30.1%
associate-/r*N/A
sqrt-divN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6473.4
Applied egg-rr73.4%
if -9.9999999999999993e-41 < (*.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 82.7%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6456.9
Simplified56.9%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6443.4
Simplified43.4%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6443.3
Applied egg-rr43.3%
rem-square-sqrtN/A
sqrt-prodN/A
frac-timesN/A
sqrt-divN/A
sqrt-divN/A
frac-2negN/A
sub0-negN/A
div-invN/A
sqrt-prodN/A
sub0-negN/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr81.4%
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%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr22.9%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6422.9
Applied egg-rr22.9%
Taylor expanded in h around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
Simplified7.0%
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-/l*N/A
un-div-invN/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
un-div-invN/A
/-lowering-/.f6427.1
Applied egg-rr27.1%
Final simplification68.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0
(fma
(* D_m D_m)
(* (/ (sqrt (/ h l)) l) (/ (* (* M_m M_m) -0.125) d))
0.0))
(t_1
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(+
1.0
(* (/ h l) (* (pow (/ (* M_m D_m) (* d 2.0)) 2.0) (/ -1.0 2.0)))))))
(if (<= t_1 -1e-40)
t_0
(if (<= t_1 INFINITY) (/ (sqrt (/ d l)) (sqrt (/ h d))) t_0))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = fma((D_m * D_m), ((sqrt((h / l)) / l) * (((M_m * M_m) * -0.125) / d)), 0.0);
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_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))));
double tmp;
if (t_1 <= -1e-40) {
tmp = t_0;
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((d / l)) / sqrt((h / d));
} else {
tmp = t_0;
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = fma(Float64(D_m * D_m), Float64(Float64(sqrt(Float64(h / l)) / l) * Float64(Float64(Float64(M_m * M_m) * -0.125) / d)), 0.0) 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_m) / Float64(d * 2.0)) ^ 2.0) * Float64(-1.0 / 2.0))))) tmp = 0.0 if (t_1 <= -1e-40) 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 = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision] / l), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] + 0.0), $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$95$m), $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, -1e-40], 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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(D\_m \cdot D\_m, \frac{\sqrt{\frac{h}{\ell}}}{\ell} \cdot \frac{\left(M\_m \cdot M\_m\right) \cdot -0.125}{d}, 0\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\_m}{d \cdot 2}\right)}^{2} \cdot \frac{-1}{2}\right)\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-40}:\\
\;\;\;\;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)))) < -9.9999999999999993e-41 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 60.4%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr70.3%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6469.6
Applied egg-rr69.6%
Taylor expanded in h around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
Simplified22.6%
associate-/r*N/A
sqrt-divN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6458.5
Applied egg-rr58.5%
if -9.9999999999999993e-41 < (*.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 82.7%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6456.9
Simplified56.9%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6443.4
Simplified43.4%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6443.3
Applied egg-rr43.3%
rem-square-sqrtN/A
sqrt-prodN/A
frac-timesN/A
sqrt-divN/A
sqrt-divN/A
frac-2negN/A
sub0-negN/A
div-invN/A
sqrt-prodN/A
sub0-negN/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr81.4%
Final simplification68.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ (* M_m D_m) (* d 2.0))))
(if (<=
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(+ 1.0 (* (/ h l) (* (pow t_0 2.0) (/ -1.0 2.0)))))
INFINITY)
(*
(sqrt (/ d l))
(*
(sqrt (/ d h))
(- 1.0 (* t_0 (* (/ h l) (/ (* D_m (* M_m 0.25)) d))))))
(fma
(* D_m D_m)
(* (/ (* (* M_m M_m) -0.125) d) (/ 1.0 (* l (sqrt (/ l h)))))
0.0))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (M_m * D_m) / (d * 2.0);
double tmp;
if (((pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (pow(t_0, 2.0) * (-1.0 / 2.0))))) <= ((double) INFINITY)) {
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 - (t_0 * ((h / l) * ((D_m * (M_m * 0.25)) / d)))));
} else {
tmp = fma((D_m * D_m), ((((M_m * M_m) * -0.125) / d) * (1.0 / (l * sqrt((l / h))))), 0.0);
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(Float64(M_m * D_m) / Float64(d * 2.0)) 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((t_0 ^ 2.0) * Float64(-1.0 / 2.0))))) <= Inf) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 - Float64(t_0 * Float64(Float64(h / l) * Float64(Float64(D_m * Float64(M_m * 0.25)) / d)))))); else tmp = fma(Float64(D_m * D_m), Float64(Float64(Float64(Float64(M_m * M_m) * -0.125) / d) * Float64(1.0 / Float64(l * sqrt(Float64(l / h))))), 0.0); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]}, 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[t$95$0, 2.0], $MachinePrecision] * N[(-1.0 / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(t$95$0 * N[(N[(h / l), $MachinePrecision] * N[(N[(D$95$m * N[(M$95$m * 0.25), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision] * N[(1.0 / N[(l * N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{M\_m \cdot D\_m}{d \cdot 2}\\
\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({t\_0}^{2} \cdot \frac{-1}{2}\right)\right) \leq \infty:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 - t\_0 \cdot \left(\frac{h}{\ell} \cdot \frac{D\_m \cdot \left(M\_m \cdot 0.25\right)}{d}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(D\_m \cdot D\_m, \frac{\left(M\_m \cdot M\_m\right) \cdot -0.125}{d} \cdot \frac{1}{\ell \cdot \sqrt{\frac{\ell}{h}}}, 0\right)\\
\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)))) < +inf.0Initial program 85.6%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr87.3%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6487.1
Applied egg-rr87.1%
Applied egg-rr70.8%
associate-*l/N/A
associate-*r*N/A
times-fracN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
associate-*r*N/A
metadata-evalN/A
frac-timesN/A
associate-*r/N/A
metadata-evalN/A
*-commutativeN/A
Applied egg-rr87.4%
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%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr22.9%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6422.9
Applied egg-rr22.9%
Taylor expanded in h around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
Simplified7.0%
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-/l*N/A
un-div-invN/A
sqrt-prodN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
un-div-invN/A
/-lowering-/.f6427.1
Applied egg-rr27.1%
Final simplification76.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<=
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(+
1.0
(* (/ h l) (* (pow (/ (* M_m D_m) (* d 2.0)) 2.0) (/ -1.0 2.0)))))
-4e+47)
(* D_m (* D_m (/ (* (sqrt h) (* M_m (* M_m -0.125))) (* d (* l (sqrt l))))))
(/ (sqrt (/ d l)) (sqrt (/ h d)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (((pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (pow(((M_m * D_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= -4e+47) {
tmp = D_m * (D_m * ((sqrt(h) * (M_m * (M_m * -0.125))) / (d * (l * sqrt(l)))));
} else {
tmp = sqrt((d / l)) / sqrt((h / d));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (((((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 + ((h / l) * ((((m_m * d_m) / (d * 2.0d0)) ** 2.0d0) * ((-1.0d0) / 2.0d0))))) <= (-4d+47)) then
tmp = d_m * (d_m * ((sqrt(h) * (m_m * (m_m * (-0.125d0)))) / (d * (l * sqrt(l)))))
else
tmp = sqrt((d / l)) / sqrt((h / d))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (((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_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= -4e+47) {
tmp = D_m * (D_m * ((Math.sqrt(h) * (M_m * (M_m * -0.125))) / (d * (l * Math.sqrt(l)))));
} else {
tmp = Math.sqrt((d / l)) / Math.sqrt((h / d));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if ((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_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= -4e+47: tmp = D_m * (D_m * ((math.sqrt(h) * (M_m * (M_m * -0.125))) / (d * (l * math.sqrt(l))))) else: tmp = math.sqrt((d / l)) / math.sqrt((h / d)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (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_m) / Float64(d * 2.0)) ^ 2.0) * Float64(-1.0 / 2.0))))) <= -4e+47) tmp = Float64(D_m * Float64(D_m * Float64(Float64(sqrt(h) * Float64(M_m * Float64(M_m * -0.125))) / Float64(d * Float64(l * sqrt(l)))))); else tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (((((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 + ((h / l) * ((((M_m * D_m) / (d * 2.0)) ^ 2.0) * (-1.0 / 2.0))))) <= -4e+47)
tmp = D_m * (D_m * ((sqrt(h) * (M_m * (M_m * -0.125))) / (d * (l * sqrt(l)))));
else
tmp = sqrt((d / l)) / sqrt((h / d));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[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$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-1.0 / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -4e+47], N[(D$95$m * N[(D$95$m * N[(N[(N[Sqrt[h], $MachinePrecision] * N[(M$95$m * N[(M$95$m * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d * N[(l * N[Sqrt[l], $MachinePrecision]), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\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\_m}{d \cdot 2}\right)}^{2} \cdot \frac{-1}{2}\right)\right) \leq -4 \cdot 10^{+47}:\\
\;\;\;\;D\_m \cdot \left(D\_m \cdot \frac{\sqrt{h} \cdot \left(M\_m \cdot \left(M\_m \cdot -0.125\right)\right)}{d \cdot \left(\ell \cdot \sqrt{\ell}\right)}\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)))) < -4.0000000000000002e47Initial program 89.0%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr92.8%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6491.7
Applied egg-rr91.7%
Taylor expanded in h around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
Simplified30.4%
+-rgt-identityN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr35.7%
if -4.0000000000000002e47 < (*.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 59.0%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6444.8
Simplified44.8%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6433.8
Simplified33.8%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6433.7
Applied egg-rr33.7%
rem-square-sqrtN/A
sqrt-prodN/A
frac-timesN/A
sqrt-divN/A
sqrt-divN/A
frac-2negN/A
sub0-negN/A
div-invN/A
sqrt-prodN/A
sub0-negN/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr61.9%
Final simplification52.1%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<=
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(+
1.0
(* (/ h l) (* (pow (/ (* M_m D_m) (* d 2.0)) 2.0) (/ -1.0 2.0)))))
0.0)
(/ d (sqrt (* h l)))
(/ (sqrt (/ d l)) (sqrt (/ h d)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (((pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (pow(((M_m * D_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= 0.0) {
tmp = d / sqrt((h * l));
} else {
tmp = sqrt((d / l)) / sqrt((h / d));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (((((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 + ((h / l) * ((((m_m * d_m) / (d * 2.0d0)) ** 2.0d0) * ((-1.0d0) / 2.0d0))))) <= 0.0d0) then
tmp = d / sqrt((h * l))
else
tmp = sqrt((d / l)) / sqrt((h / d))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (((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_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= 0.0) {
tmp = d / Math.sqrt((h * l));
} else {
tmp = Math.sqrt((d / l)) / Math.sqrt((h / d));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if ((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_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= 0.0: tmp = d / math.sqrt((h * l)) else: tmp = math.sqrt((d / l)) / math.sqrt((h / d)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (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_m) / Float64(d * 2.0)) ^ 2.0) * Float64(-1.0 / 2.0))))) <= 0.0) tmp = Float64(d / sqrt(Float64(h * l))); else tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (((((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 + ((h / l) * ((((M_m * D_m) / (d * 2.0)) ^ 2.0) * (-1.0 / 2.0))))) <= 0.0)
tmp = d / sqrt((h * l));
else
tmp = sqrt((d / l)) / sqrt((h / d));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[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$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-1.0 / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0], N[(d / N[Sqrt[N[(h * l), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\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\_m}{d \cdot 2}\right)}^{2} \cdot \frac{-1}{2}\right)\right) \leq 0:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\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)))) < 0.0Initial program 84.2%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.3
Simplified58.3%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6419.1
Simplified19.1%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6418.3
Applied egg-rr18.3%
frac-2negN/A
distribute-frac-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6420.7
Applied egg-rr20.7%
if 0.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 58.6%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.7
Simplified46.7%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6429.9
Simplified29.9%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6429.8
Applied egg-rr29.8%
rem-square-sqrtN/A
sqrt-prodN/A
frac-timesN/A
sqrt-divN/A
sqrt-divN/A
frac-2negN/A
sub0-negN/A
div-invN/A
sqrt-prodN/A
sub0-negN/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr64.0%
Final simplification43.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<=
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(+
1.0
(* (/ h l) (* (pow (/ (* M_m D_m) (* d 2.0)) 2.0) (/ -1.0 2.0)))))
0.0)
(/ d (sqrt (* h l)))
(* (sqrt (/ d l)) (sqrt (/ d h)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (((pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 + ((h / l) * (pow(((M_m * D_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= 0.0) {
tmp = d / sqrt((h * l));
} else {
tmp = sqrt((d / l)) * sqrt((d / h));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (((((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 + ((h / l) * ((((m_m * d_m) / (d * 2.0d0)) ** 2.0d0) * ((-1.0d0) / 2.0d0))))) <= 0.0d0) then
tmp = d / sqrt((h * l))
else
tmp = sqrt((d / l)) * sqrt((d / h))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double 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_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= 0.0) {
tmp = d / Math.sqrt((h * l));
} else {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): 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_m) / (d * 2.0)), 2.0) * (-1.0 / 2.0))))) <= 0.0: tmp = d / math.sqrt((h * l)) else: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) 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_m) / Float64(d * 2.0)) ^ 2.0) * Float64(-1.0 / 2.0))))) <= 0.0) tmp = Float64(d / sqrt(Float64(h * l))); else tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (((((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 + ((h / l) * ((((M_m * D_m) / (d * 2.0)) ^ 2.0) * (-1.0 / 2.0))))) <= 0.0)
tmp = d / sqrt((h * l));
else
tmp = sqrt((d / l)) * sqrt((d / h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := 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$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-1.0 / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\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\_m}{d \cdot 2}\right)}^{2} \cdot \frac{-1}{2}\right)\right) \leq 0:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\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)))) < 0.0Initial program 84.2%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.3
Simplified58.3%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6419.1
Simplified19.1%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6418.3
Applied egg-rr18.3%
frac-2negN/A
distribute-frac-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6420.7
Applied egg-rr20.7%
if 0.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 58.6%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.7
Simplified46.7%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6429.9
Simplified29.9%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6429.8
Applied egg-rr29.8%
rem-square-sqrtN/A
sqrt-prodN/A
frac-timesN/A
sqrt-divN/A
sqrt-divN/A
frac-2negN/A
sub0-negN/A
div-invN/A
sqrt-prodN/A
sub0-negN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr63.5%
Final simplification43.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ (* 0.5 (* M_m D_m)) d))
(t_1 (/ (* h t_0) l))
(t_2 (sqrt (/ d l)))
(t_3 (* 0.5 t_0)))
(if (<= d -9.4e-108)
(*
(- 1.0 (* t_1 (* 0.5 (* (* M_m D_m) (/ 0.5 d)))))
(* t_2 (sqrt (/ d h))))
(if (<= d -3e-287)
(*
(* d (sqrt (/ 1.0 (* h l))))
(+ (* (/ t_0 l) (/ t_3 (/ 1.0 h))) -1.0))
(if (<= d 4.6e-220)
(fma
(* D_m D_m)
(* (/ (sqrt (/ h l)) l) (/ (* (* M_m M_m) -0.125) d))
0.0)
(* (- 1.0 (* t_1 t_3)) (* t_2 (/ (sqrt d) (sqrt h)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (0.5 * (M_m * D_m)) / d;
double t_1 = (h * t_0) / l;
double t_2 = sqrt((d / l));
double t_3 = 0.5 * t_0;
double tmp;
if (d <= -9.4e-108) {
tmp = (1.0 - (t_1 * (0.5 * ((M_m * D_m) * (0.5 / d))))) * (t_2 * sqrt((d / h)));
} else if (d <= -3e-287) {
tmp = (d * sqrt((1.0 / (h * l)))) * (((t_0 / l) * (t_3 / (1.0 / h))) + -1.0);
} else if (d <= 4.6e-220) {
tmp = fma((D_m * D_m), ((sqrt((h / l)) / l) * (((M_m * M_m) * -0.125) / d)), 0.0);
} else {
tmp = (1.0 - (t_1 * t_3)) * (t_2 * (sqrt(d) / sqrt(h)));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(Float64(0.5 * Float64(M_m * D_m)) / d) t_1 = Float64(Float64(h * t_0) / l) t_2 = sqrt(Float64(d / l)) t_3 = Float64(0.5 * t_0) tmp = 0.0 if (d <= -9.4e-108) tmp = Float64(Float64(1.0 - Float64(t_1 * Float64(0.5 * Float64(Float64(M_m * D_m) * Float64(0.5 / d))))) * Float64(t_2 * sqrt(Float64(d / h)))); elseif (d <= -3e-287) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(Float64(Float64(t_0 / l) * Float64(t_3 / Float64(1.0 / h))) + -1.0)); elseif (d <= 4.6e-220) tmp = fma(Float64(D_m * D_m), Float64(Float64(sqrt(Float64(h / l)) / l) * Float64(Float64(Float64(M_m * M_m) * -0.125) / d)), 0.0); else tmp = Float64(Float64(1.0 - Float64(t_1 * t_3)) * Float64(t_2 * Float64(sqrt(d) / sqrt(h)))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[(0.5 * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]}, Block[{t$95$1 = N[(N[(h * t$95$0), $MachinePrecision] / l), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(0.5 * t$95$0), $MachinePrecision]}, If[LessEqual[d, -9.4e-108], N[(N[(1.0 - N[(t$95$1 * N[(0.5 * N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$2 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -3e-287], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(t$95$0 / l), $MachinePrecision] * N[(t$95$3 / N[(1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 4.6e-220], N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision] / l), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision], N[(N[(1.0 - N[(t$95$1 * t$95$3), $MachinePrecision]), $MachinePrecision] * N[(t$95$2 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{0.5 \cdot \left(M\_m \cdot D\_m\right)}{d}\\
t_1 := \frac{h \cdot t\_0}{\ell}\\
t_2 := \sqrt{\frac{d}{\ell}}\\
t_3 := 0.5 \cdot t\_0\\
\mathbf{if}\;d \leq -9.4 \cdot 10^{-108}:\\
\;\;\;\;\left(1 - t\_1 \cdot \left(0.5 \cdot \left(\left(M\_m \cdot D\_m\right) \cdot \frac{0.5}{d}\right)\right)\right) \cdot \left(t\_2 \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{elif}\;d \leq -3 \cdot 10^{-287}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(\frac{t\_0}{\ell} \cdot \frac{t\_3}{\frac{1}{h}} + -1\right)\\
\mathbf{elif}\;d \leq 4.6 \cdot 10^{-220}:\\
\;\;\;\;\mathsf{fma}\left(D\_m \cdot D\_m, \frac{\sqrt{\frac{h}{\ell}}}{\ell} \cdot \frac{\left(M\_m \cdot M\_m\right) \cdot -0.125}{d}, 0\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - t\_1 \cdot t\_3\right) \cdot \left(t\_2 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right)\\
\end{array}
\end{array}
if d < -9.40000000000000026e-108Initial program 83.5%
*-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr89.2%
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6489.2
Applied egg-rr89.2%
metadata-evalN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
metadata-eval89.2
Applied egg-rr89.2%
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6489.2
Applied egg-rr89.2%
if -9.40000000000000026e-108 < d < -2.99999999999999992e-287Initial program 57.4%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr57.9%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6457.8
Applied egg-rr57.8%
metadata-evalN/A
pow1/2N/A
frac-2negN/A
div-invN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f6475.5
Applied egg-rr75.5%
Taylor expanded in h around 0
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6490.4
Simplified90.4%
if -2.99999999999999992e-287 < d < 4.59999999999999961e-220Initial program 37.6%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr41.2%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6441.1
Applied egg-rr41.1%
Taylor expanded in h around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
Simplified30.8%
associate-/r*N/A
sqrt-divN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6460.9
Applied egg-rr60.9%
if 4.59999999999999961e-220 < d Initial program 72.5%
*-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr80.5%
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6480.5
Applied egg-rr80.5%
metadata-evalN/A
unpow1/2N/A
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6486.2
Applied egg-rr86.2%
Final simplification85.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l)))
(t_1 (/ (* 0.5 (* M_m D_m)) d))
(t_2 (* 0.5 t_1))
(t_3 (- 1.0 (* (/ (* h t_1) l) t_2))))
(if (<= h -2e-311)
(* (* (/ (sqrt (- 0.0 d)) (sqrt (- 0.0 h))) t_0) t_3)
(if (<= h 1.35e+114)
(* (+ 1.0 (* (/ t_1 l) (/ t_2 (/ -1.0 h)))) (/ d (sqrt (* h l))))
(* t_3 (* t_0 (/ (sqrt d) (sqrt h))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double t_1 = (0.5 * (M_m * D_m)) / d;
double t_2 = 0.5 * t_1;
double t_3 = 1.0 - (((h * t_1) / l) * t_2);
double tmp;
if (h <= -2e-311) {
tmp = ((sqrt((0.0 - d)) / sqrt((0.0 - h))) * t_0) * t_3;
} else if (h <= 1.35e+114) {
tmp = (1.0 + ((t_1 / l) * (t_2 / (-1.0 / h)))) * (d / sqrt((h * l)));
} else {
tmp = t_3 * (t_0 * (sqrt(d) / sqrt(h)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_0 = sqrt((d / l))
t_1 = (0.5d0 * (m_m * d_m)) / d
t_2 = 0.5d0 * t_1
t_3 = 1.0d0 - (((h * t_1) / l) * t_2)
if (h <= (-2d-311)) then
tmp = ((sqrt((0.0d0 - d)) / sqrt((0.0d0 - h))) * t_0) * t_3
else if (h <= 1.35d+114) then
tmp = (1.0d0 + ((t_1 / l) * (t_2 / ((-1.0d0) / h)))) * (d / sqrt((h * l)))
else
tmp = t_3 * (t_0 * (sqrt(d) / sqrt(h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((d / l));
double t_1 = (0.5 * (M_m * D_m)) / d;
double t_2 = 0.5 * t_1;
double t_3 = 1.0 - (((h * t_1) / l) * t_2);
double tmp;
if (h <= -2e-311) {
tmp = ((Math.sqrt((0.0 - d)) / Math.sqrt((0.0 - h))) * t_0) * t_3;
} else if (h <= 1.35e+114) {
tmp = (1.0 + ((t_1 / l) * (t_2 / (-1.0 / h)))) * (d / Math.sqrt((h * l)));
} else {
tmp = t_3 * (t_0 * (Math.sqrt(d) / Math.sqrt(h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((d / l)) t_1 = (0.5 * (M_m * D_m)) / d t_2 = 0.5 * t_1 t_3 = 1.0 - (((h * t_1) / l) * t_2) tmp = 0 if h <= -2e-311: tmp = ((math.sqrt((0.0 - d)) / math.sqrt((0.0 - h))) * t_0) * t_3 elif h <= 1.35e+114: tmp = (1.0 + ((t_1 / l) * (t_2 / (-1.0 / h)))) * (d / math.sqrt((h * l))) else: tmp = t_3 * (t_0 * (math.sqrt(d) / math.sqrt(h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) t_1 = Float64(Float64(0.5 * Float64(M_m * D_m)) / d) t_2 = Float64(0.5 * t_1) t_3 = Float64(1.0 - Float64(Float64(Float64(h * t_1) / l) * t_2)) tmp = 0.0 if (h <= -2e-311) tmp = Float64(Float64(Float64(sqrt(Float64(0.0 - d)) / sqrt(Float64(0.0 - h))) * t_0) * t_3); elseif (h <= 1.35e+114) tmp = Float64(Float64(1.0 + Float64(Float64(t_1 / l) * Float64(t_2 / Float64(-1.0 / h)))) * Float64(d / sqrt(Float64(h * l)))); else tmp = Float64(t_3 * Float64(t_0 * Float64(sqrt(d) / sqrt(h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((d / l));
t_1 = (0.5 * (M_m * D_m)) / d;
t_2 = 0.5 * t_1;
t_3 = 1.0 - (((h * t_1) / l) * t_2);
tmp = 0.0;
if (h <= -2e-311)
tmp = ((sqrt((0.0 - d)) / sqrt((0.0 - h))) * t_0) * t_3;
elseif (h <= 1.35e+114)
tmp = (1.0 + ((t_1 / l) * (t_2 / (-1.0 / h)))) * (d / sqrt((h * l)));
else
tmp = t_3 * (t_0 * (sqrt(d) / sqrt(h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(0.5 * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]}, Block[{t$95$2 = N[(0.5 * t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(1.0 - N[(N[(N[(h * t$95$1), $MachinePrecision] / l), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -2e-311], N[(N[(N[(N[Sqrt[N[(0.0 - d), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(0.0 - h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$3), $MachinePrecision], If[LessEqual[h, 1.35e+114], N[(N[(1.0 + N[(N[(t$95$1 / l), $MachinePrecision] * N[(t$95$2 / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$3 * N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
t_1 := \frac{0.5 \cdot \left(M\_m \cdot D\_m\right)}{d}\\
t_2 := 0.5 \cdot t\_1\\
t_3 := 1 - \frac{h \cdot t\_1}{\ell} \cdot t\_2\\
\mathbf{if}\;h \leq -2 \cdot 10^{-311}:\\
\;\;\;\;\left(\frac{\sqrt{0 - d}}{\sqrt{0 - h}} \cdot t\_0\right) \cdot t\_3\\
\mathbf{elif}\;h \leq 1.35 \cdot 10^{+114}:\\
\;\;\;\;\left(1 + \frac{t\_1}{\ell} \cdot \frac{t\_2}{\frac{-1}{h}}\right) \cdot \frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;t\_3 \cdot \left(t\_0 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right)\\
\end{array}
\end{array}
if h < -1.9999999999999e-311Initial program 73.6%
*-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr78.2%
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6478.2
Applied egg-rr78.2%
metadata-evalN/A
unpow1/2N/A
frac-2negN/A
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f6487.9
Applied egg-rr87.9%
if -1.9999999999999e-311 < h < 1.35e114Initial program 73.1%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr81.2%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6481.7
Applied egg-rr81.7%
metadata-evalN/A
pow1/2N/A
frac-2negN/A
div-invN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f640.0
Applied egg-rr0.0%
metadata-evalN/A
sqrt-divN/A
clear-numN/A
sqrt-unprodN/A
sub0-negN/A
div-invN/A
sub0-negN/A
frac-2negN/A
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
sqrt-prodN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6493.3
Applied egg-rr93.3%
if 1.35e114 < h Initial program 47.7%
*-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr50.6%
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6450.6
Applied egg-rr50.6%
metadata-evalN/A
unpow1/2N/A
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6469.3
Applied egg-rr69.3%
Final simplification87.4%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))) (t_1 (* 0.5 (* M_m D_m))) (t_2 (/ t_1 d)))
(if (<= l -2.25e+263)
(* (- 0.0 d) (sqrt (/ 1.0 (* h l))))
(if (<= l -5.6e-129)
(*
t_0
(*
(sqrt (/ d h))
(-
1.0
(*
(/ (* M_m D_m) (* d 2.0))
(* (/ h l) (/ (* D_m (* M_m 0.25)) d))))))
(if (<= l -2e-310)
(*
t_0
(*
(/ (sqrt (- 0.0 d)) (sqrt (- 0.0 h)))
(- 1.0 (* h (/ (* t_1 (* (* M_m D_m) 0.25)) (* d (* d l)))))))
(*
(+ 1.0 (* (/ t_2 l) (/ (* 0.5 t_2) (/ -1.0 h))))
(/ d (sqrt (* h l)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double t_1 = 0.5 * (M_m * D_m);
double t_2 = t_1 / d;
double tmp;
if (l <= -2.25e+263) {
tmp = (0.0 - d) * sqrt((1.0 / (h * l)));
} else if (l <= -5.6e-129) {
tmp = t_0 * (sqrt((d / h)) * (1.0 - (((M_m * D_m) / (d * 2.0)) * ((h / l) * ((D_m * (M_m * 0.25)) / d)))));
} else if (l <= -2e-310) {
tmp = t_0 * ((sqrt((0.0 - d)) / sqrt((0.0 - h))) * (1.0 - (h * ((t_1 * ((M_m * D_m) * 0.25)) / (d * (d * l))))));
} else {
tmp = (1.0 + ((t_2 / l) * ((0.5 * t_2) / (-1.0 / h)))) * (d / sqrt((h * l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = sqrt((d / l))
t_1 = 0.5d0 * (m_m * d_m)
t_2 = t_1 / d
if (l <= (-2.25d+263)) then
tmp = (0.0d0 - d) * sqrt((1.0d0 / (h * l)))
else if (l <= (-5.6d-129)) then
tmp = t_0 * (sqrt((d / h)) * (1.0d0 - (((m_m * d_m) / (d * 2.0d0)) * ((h / l) * ((d_m * (m_m * 0.25d0)) / d)))))
else if (l <= (-2d-310)) then
tmp = t_0 * ((sqrt((0.0d0 - d)) / sqrt((0.0d0 - h))) * (1.0d0 - (h * ((t_1 * ((m_m * d_m) * 0.25d0)) / (d * (d * l))))))
else
tmp = (1.0d0 + ((t_2 / l) * ((0.5d0 * t_2) / ((-1.0d0) / h)))) * (d / sqrt((h * l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((d / l));
double t_1 = 0.5 * (M_m * D_m);
double t_2 = t_1 / d;
double tmp;
if (l <= -2.25e+263) {
tmp = (0.0 - d) * Math.sqrt((1.0 / (h * l)));
} else if (l <= -5.6e-129) {
tmp = t_0 * (Math.sqrt((d / h)) * (1.0 - (((M_m * D_m) / (d * 2.0)) * ((h / l) * ((D_m * (M_m * 0.25)) / d)))));
} else if (l <= -2e-310) {
tmp = t_0 * ((Math.sqrt((0.0 - d)) / Math.sqrt((0.0 - h))) * (1.0 - (h * ((t_1 * ((M_m * D_m) * 0.25)) / (d * (d * l))))));
} else {
tmp = (1.0 + ((t_2 / l) * ((0.5 * t_2) / (-1.0 / h)))) * (d / Math.sqrt((h * l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((d / l)) t_1 = 0.5 * (M_m * D_m) t_2 = t_1 / d tmp = 0 if l <= -2.25e+263: tmp = (0.0 - d) * math.sqrt((1.0 / (h * l))) elif l <= -5.6e-129: tmp = t_0 * (math.sqrt((d / h)) * (1.0 - (((M_m * D_m) / (d * 2.0)) * ((h / l) * ((D_m * (M_m * 0.25)) / d))))) elif l <= -2e-310: tmp = t_0 * ((math.sqrt((0.0 - d)) / math.sqrt((0.0 - h))) * (1.0 - (h * ((t_1 * ((M_m * D_m) * 0.25)) / (d * (d * l)))))) else: tmp = (1.0 + ((t_2 / l) * ((0.5 * t_2) / (-1.0 / h)))) * (d / math.sqrt((h * l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) t_1 = Float64(0.5 * Float64(M_m * D_m)) t_2 = Float64(t_1 / d) tmp = 0.0 if (l <= -2.25e+263) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(1.0 / Float64(h * l)))); elseif (l <= -5.6e-129) tmp = Float64(t_0 * Float64(sqrt(Float64(d / h)) * Float64(1.0 - Float64(Float64(Float64(M_m * D_m) / Float64(d * 2.0)) * Float64(Float64(h / l) * Float64(Float64(D_m * Float64(M_m * 0.25)) / d)))))); elseif (l <= -2e-310) tmp = Float64(t_0 * Float64(Float64(sqrt(Float64(0.0 - d)) / sqrt(Float64(0.0 - h))) * Float64(1.0 - Float64(h * Float64(Float64(t_1 * Float64(Float64(M_m * D_m) * 0.25)) / Float64(d * Float64(d * l))))))); else tmp = Float64(Float64(1.0 + Float64(Float64(t_2 / l) * Float64(Float64(0.5 * t_2) / Float64(-1.0 / h)))) * Float64(d / sqrt(Float64(h * l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((d / l));
t_1 = 0.5 * (M_m * D_m);
t_2 = t_1 / d;
tmp = 0.0;
if (l <= -2.25e+263)
tmp = (0.0 - d) * sqrt((1.0 / (h * l)));
elseif (l <= -5.6e-129)
tmp = t_0 * (sqrt((d / h)) * (1.0 - (((M_m * D_m) / (d * 2.0)) * ((h / l) * ((D_m * (M_m * 0.25)) / d)))));
elseif (l <= -2e-310)
tmp = t_0 * ((sqrt((0.0 - d)) / sqrt((0.0 - h))) * (1.0 - (h * ((t_1 * ((M_m * D_m) * 0.25)) / (d * (d * l))))));
else
tmp = (1.0 + ((t_2 / l) * ((0.5 * t_2) / (-1.0 / h)))) * (d / sqrt((h * l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(0.5 * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 / d), $MachinePrecision]}, If[LessEqual[l, -2.25e+263], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5.6e-129], N[(t$95$0 * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(h / l), $MachinePrecision] * N[(N[(D$95$m * N[(M$95$m * 0.25), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -2e-310], N[(t$95$0 * N[(N[(N[Sqrt[N[(0.0 - d), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(0.0 - h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(h * N[(N[(t$95$1 * N[(N[(M$95$m * D$95$m), $MachinePrecision] * 0.25), $MachinePrecision]), $MachinePrecision] / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(t$95$2 / l), $MachinePrecision] * N[(N[(0.5 * t$95$2), $MachinePrecision] / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
t_1 := 0.5 \cdot \left(M\_m \cdot D\_m\right)\\
t_2 := \frac{t\_1}{d}\\
\mathbf{if}\;\ell \leq -2.25 \cdot 10^{+263}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{elif}\;\ell \leq -5.6 \cdot 10^{-129}:\\
\;\;\;\;t\_0 \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 - \frac{M\_m \cdot D\_m}{d \cdot 2} \cdot \left(\frac{h}{\ell} \cdot \frac{D\_m \cdot \left(M\_m \cdot 0.25\right)}{d}\right)\right)\right)\\
\mathbf{elif}\;\ell \leq -2 \cdot 10^{-310}:\\
\;\;\;\;t\_0 \cdot \left(\frac{\sqrt{0 - d}}{\sqrt{0 - h}} \cdot \left(1 - h \cdot \frac{t\_1 \cdot \left(\left(M\_m \cdot D\_m\right) \cdot 0.25\right)}{d \cdot \left(d \cdot \ell\right)}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \frac{t\_2}{\ell} \cdot \frac{0.5 \cdot t\_2}{\frac{-1}{h}}\right) \cdot \frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < -2.25000000000000007e263Initial program 33.8%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr34.9%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6434.9
Applied egg-rr34.9%
Applied egg-rr34.9%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6483.3
Simplified83.3%
if -2.25000000000000007e263 < l < -5.5999999999999998e-129Initial program 79.3%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr83.3%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6481.8
Applied egg-rr81.8%
Applied egg-rr63.1%
associate-*l/N/A
associate-*r*N/A
times-fracN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
associate-*r*N/A
metadata-evalN/A
frac-timesN/A
associate-*r/N/A
metadata-evalN/A
*-commutativeN/A
Applied egg-rr83.3%
if -5.5999999999999998e-129 < l < -1.999999999999994e-310Initial program 74.8%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr80.8%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6481.4
Applied egg-rr81.4%
Applied egg-rr75.0%
frac-2negN/A
sqrt-divN/A
sub0-negN/A
/-lowering-/.f64N/A
sub0-negN/A
sqrt-lowering-sqrt.f64N/A
sub0-negN/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f6488.5
Applied egg-rr88.5%
if -1.999999999999994e-310 < l Initial program 66.3%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr73.0%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6473.3
Applied egg-rr73.3%
metadata-evalN/A
pow1/2N/A
frac-2negN/A
div-invN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f640.0
Applied egg-rr0.0%
metadata-evalN/A
sqrt-divN/A
clear-numN/A
sqrt-unprodN/A
sub0-negN/A
div-invN/A
sub0-negN/A
frac-2negN/A
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
sqrt-prodN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6481.1
Applied egg-rr81.1%
Final simplification83.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ (* 0.5 (* M_m D_m)) d)) (t_1 (/ t_0 l)) (t_2 (* 0.5 t_0)))
(if (<= d -5.9e-102)
(*
(- 1.0 (* (/ (* h t_0) l) (* 0.5 (* (* M_m D_m) (/ 0.5 d)))))
(* (sqrt (/ d l)) (sqrt (/ d h))))
(if (<= d -5e-299)
(* (* d (sqrt (/ 1.0 (* h l)))) (+ (* t_1 (/ t_2 (/ 1.0 h))) -1.0))
(* (+ 1.0 (* t_1 (/ t_2 (/ -1.0 h)))) (/ d (sqrt (* h l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (0.5 * (M_m * D_m)) / d;
double t_1 = t_0 / l;
double t_2 = 0.5 * t_0;
double tmp;
if (d <= -5.9e-102) {
tmp = (1.0 - (((h * t_0) / l) * (0.5 * ((M_m * D_m) * (0.5 / d))))) * (sqrt((d / l)) * sqrt((d / h)));
} else if (d <= -5e-299) {
tmp = (d * sqrt((1.0 / (h * l)))) * ((t_1 * (t_2 / (1.0 / h))) + -1.0);
} else {
tmp = (1.0 + (t_1 * (t_2 / (-1.0 / h)))) * (d / sqrt((h * l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = (0.5d0 * (m_m * d_m)) / d
t_1 = t_0 / l
t_2 = 0.5d0 * t_0
if (d <= (-5.9d-102)) then
tmp = (1.0d0 - (((h * t_0) / l) * (0.5d0 * ((m_m * d_m) * (0.5d0 / d))))) * (sqrt((d / l)) * sqrt((d / h)))
else if (d <= (-5d-299)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((t_1 * (t_2 / (1.0d0 / h))) + (-1.0d0))
else
tmp = (1.0d0 + (t_1 * (t_2 / ((-1.0d0) / h)))) * (d / sqrt((h * l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (0.5 * (M_m * D_m)) / d;
double t_1 = t_0 / l;
double t_2 = 0.5 * t_0;
double tmp;
if (d <= -5.9e-102) {
tmp = (1.0 - (((h * t_0) / l) * (0.5 * ((M_m * D_m) * (0.5 / d))))) * (Math.sqrt((d / l)) * Math.sqrt((d / h)));
} else if (d <= -5e-299) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * ((t_1 * (t_2 / (1.0 / h))) + -1.0);
} else {
tmp = (1.0 + (t_1 * (t_2 / (-1.0 / h)))) * (d / Math.sqrt((h * l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = (0.5 * (M_m * D_m)) / d t_1 = t_0 / l t_2 = 0.5 * t_0 tmp = 0 if d <= -5.9e-102: tmp = (1.0 - (((h * t_0) / l) * (0.5 * ((M_m * D_m) * (0.5 / d))))) * (math.sqrt((d / l)) * math.sqrt((d / h))) elif d <= -5e-299: tmp = (d * math.sqrt((1.0 / (h * l)))) * ((t_1 * (t_2 / (1.0 / h))) + -1.0) else: tmp = (1.0 + (t_1 * (t_2 / (-1.0 / h)))) * (d / math.sqrt((h * l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(Float64(0.5 * Float64(M_m * D_m)) / d) t_1 = Float64(t_0 / l) t_2 = Float64(0.5 * t_0) tmp = 0.0 if (d <= -5.9e-102) tmp = Float64(Float64(1.0 - Float64(Float64(Float64(h * t_0) / l) * Float64(0.5 * Float64(Float64(M_m * D_m) * Float64(0.5 / d))))) * Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h)))); elseif (d <= -5e-299) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(Float64(t_1 * Float64(t_2 / Float64(1.0 / h))) + -1.0)); else tmp = Float64(Float64(1.0 + Float64(t_1 * Float64(t_2 / Float64(-1.0 / h)))) * Float64(d / sqrt(Float64(h * l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = (0.5 * (M_m * D_m)) / d;
t_1 = t_0 / l;
t_2 = 0.5 * t_0;
tmp = 0.0;
if (d <= -5.9e-102)
tmp = (1.0 - (((h * t_0) / l) * (0.5 * ((M_m * D_m) * (0.5 / d))))) * (sqrt((d / l)) * sqrt((d / h)));
elseif (d <= -5e-299)
tmp = (d * sqrt((1.0 / (h * l)))) * ((t_1 * (t_2 / (1.0 / h))) + -1.0);
else
tmp = (1.0 + (t_1 * (t_2 / (-1.0 / h)))) * (d / sqrt((h * l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[(0.5 * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 / l), $MachinePrecision]}, Block[{t$95$2 = N[(0.5 * t$95$0), $MachinePrecision]}, If[LessEqual[d, -5.9e-102], N[(N[(1.0 - N[(N[(N[(h * t$95$0), $MachinePrecision] / l), $MachinePrecision] * N[(0.5 * N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(0.5 / 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, -5e-299], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$1 * N[(t$95$2 / N[(1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(t$95$1 * N[(t$95$2 / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{0.5 \cdot \left(M\_m \cdot D\_m\right)}{d}\\
t_1 := \frac{t\_0}{\ell}\\
t_2 := 0.5 \cdot t\_0\\
\mathbf{if}\;d \leq -5.9 \cdot 10^{-102}:\\
\;\;\;\;\left(1 - \frac{h \cdot t\_0}{\ell} \cdot \left(0.5 \cdot \left(\left(M\_m \cdot D\_m\right) \cdot \frac{0.5}{d}\right)\right)\right) \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{elif}\;d \leq -5 \cdot 10^{-299}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(t\_1 \cdot \frac{t\_2}{\frac{1}{h}} + -1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + t\_1 \cdot \frac{t\_2}{\frac{-1}{h}}\right) \cdot \frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if d < -5.9000000000000003e-102Initial program 83.5%
*-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr89.2%
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6489.2
Applied egg-rr89.2%
metadata-evalN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
metadata-eval89.2
Applied egg-rr89.2%
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6489.2
Applied egg-rr89.2%
if -5.9000000000000003e-102 < d < -4.99999999999999956e-299Initial program 58.1%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr60.7%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6460.6
Applied egg-rr60.6%
metadata-evalN/A
pow1/2N/A
frac-2negN/A
div-invN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f6477.1
Applied egg-rr77.1%
Taylor expanded in h around 0
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6488.8
Simplified88.8%
if -4.99999999999999956e-299 < d Initial program 64.9%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr71.5%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6471.8
Applied egg-rr71.8%
metadata-evalN/A
pow1/2N/A
frac-2negN/A
div-invN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f640.8
Applied egg-rr0.8%
metadata-evalN/A
sqrt-divN/A
clear-numN/A
sqrt-unprodN/A
sub0-negN/A
div-invN/A
sub0-negN/A
frac-2negN/A
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
sqrt-prodN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6479.2
Applied egg-rr79.2%
Final simplification84.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ (* 0.5 (* M_m D_m)) d)))
(if (<= l -4.3e+262)
(* (- 0.0 d) (sqrt (/ 1.0 (* h l))))
(if (<= l 8e-259)
(*
(- 1.0 (* (/ (* h t_0) l) (* 0.5 (* (* M_m D_m) (/ 0.5 d)))))
(* (sqrt (/ d l)) (sqrt (/ d h))))
(*
(+ 1.0 (* (/ t_0 l) (/ (* 0.5 t_0) (/ -1.0 h))))
(/ d (sqrt (* h l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (0.5 * (M_m * D_m)) / d;
double tmp;
if (l <= -4.3e+262) {
tmp = (0.0 - d) * sqrt((1.0 / (h * l)));
} else if (l <= 8e-259) {
tmp = (1.0 - (((h * t_0) / l) * (0.5 * ((M_m * D_m) * (0.5 / d))))) * (sqrt((d / l)) * sqrt((d / h)));
} else {
tmp = (1.0 + ((t_0 / l) * ((0.5 * t_0) / (-1.0 / h)))) * (d / sqrt((h * l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = (0.5d0 * (m_m * d_m)) / d
if (l <= (-4.3d+262)) then
tmp = (0.0d0 - d) * sqrt((1.0d0 / (h * l)))
else if (l <= 8d-259) then
tmp = (1.0d0 - (((h * t_0) / l) * (0.5d0 * ((m_m * d_m) * (0.5d0 / d))))) * (sqrt((d / l)) * sqrt((d / h)))
else
tmp = (1.0d0 + ((t_0 / l) * ((0.5d0 * t_0) / ((-1.0d0) / h)))) * (d / sqrt((h * l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (0.5 * (M_m * D_m)) / d;
double tmp;
if (l <= -4.3e+262) {
tmp = (0.0 - d) * Math.sqrt((1.0 / (h * l)));
} else if (l <= 8e-259) {
tmp = (1.0 - (((h * t_0) / l) * (0.5 * ((M_m * D_m) * (0.5 / d))))) * (Math.sqrt((d / l)) * Math.sqrt((d / h)));
} else {
tmp = (1.0 + ((t_0 / l) * ((0.5 * t_0) / (-1.0 / h)))) * (d / Math.sqrt((h * l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = (0.5 * (M_m * D_m)) / d tmp = 0 if l <= -4.3e+262: tmp = (0.0 - d) * math.sqrt((1.0 / (h * l))) elif l <= 8e-259: tmp = (1.0 - (((h * t_0) / l) * (0.5 * ((M_m * D_m) * (0.5 / d))))) * (math.sqrt((d / l)) * math.sqrt((d / h))) else: tmp = (1.0 + ((t_0 / l) * ((0.5 * t_0) / (-1.0 / h)))) * (d / math.sqrt((h * l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(Float64(0.5 * Float64(M_m * D_m)) / d) tmp = 0.0 if (l <= -4.3e+262) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(1.0 / Float64(h * l)))); elseif (l <= 8e-259) tmp = Float64(Float64(1.0 - Float64(Float64(Float64(h * t_0) / l) * Float64(0.5 * Float64(Float64(M_m * D_m) * Float64(0.5 / d))))) * Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h)))); else tmp = Float64(Float64(1.0 + Float64(Float64(t_0 / l) * Float64(Float64(0.5 * t_0) / Float64(-1.0 / h)))) * Float64(d / sqrt(Float64(h * l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = (0.5 * (M_m * D_m)) / d;
tmp = 0.0;
if (l <= -4.3e+262)
tmp = (0.0 - d) * sqrt((1.0 / (h * l)));
elseif (l <= 8e-259)
tmp = (1.0 - (((h * t_0) / l) * (0.5 * ((M_m * D_m) * (0.5 / d))))) * (sqrt((d / l)) * sqrt((d / h)));
else
tmp = (1.0 + ((t_0 / l) * ((0.5 * t_0) / (-1.0 / h)))) * (d / sqrt((h * l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[(0.5 * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]}, If[LessEqual[l, -4.3e+262], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 8e-259], N[(N[(1.0 - N[(N[(N[(h * t$95$0), $MachinePrecision] / l), $MachinePrecision] * N[(0.5 * N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(t$95$0 / l), $MachinePrecision] * N[(N[(0.5 * t$95$0), $MachinePrecision] / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{0.5 \cdot \left(M\_m \cdot D\_m\right)}{d}\\
\mathbf{if}\;\ell \leq -4.3 \cdot 10^{+262}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{elif}\;\ell \leq 8 \cdot 10^{-259}:\\
\;\;\;\;\left(1 - \frac{h \cdot t\_0}{\ell} \cdot \left(0.5 \cdot \left(\left(M\_m \cdot D\_m\right) \cdot \frac{0.5}{d}\right)\right)\right) \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \frac{t\_0}{\ell} \cdot \frac{0.5 \cdot t\_0}{\frac{-1}{h}}\right) \cdot \frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < -4.3e262Initial program 33.8%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr34.9%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6434.9
Applied egg-rr34.9%
Applied egg-rr34.9%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6483.3
Simplified83.3%
if -4.3e262 < l < 8.0000000000000006e-259Initial program 77.9%
*-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr83.8%
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6483.8
Applied egg-rr83.8%
metadata-evalN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
metadata-eval83.8
Applied egg-rr83.8%
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6483.8
Applied egg-rr83.8%
if 8.0000000000000006e-259 < l Initial program 64.6%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr70.3%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6470.6
Applied egg-rr70.6%
metadata-evalN/A
pow1/2N/A
frac-2negN/A
div-invN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f640.0
Applied egg-rr0.0%
metadata-evalN/A
sqrt-divN/A
clear-numN/A
sqrt-unprodN/A
sub0-negN/A
div-invN/A
sub0-negN/A
frac-2negN/A
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
sqrt-prodN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6480.0
Applied egg-rr80.0%
Final simplification82.2%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ (* 0.5 (* M_m D_m)) d)))
(if (<= l -6.2e+260)
(* (- 0.0 d) (sqrt (/ 1.0 (* h l))))
(if (<= l 1.25e-261)
(*
(sqrt (/ d l))
(*
(sqrt (/ d h))
(-
1.0
(/
(/ (* h (* D_m (* M_m 0.25))) d)
(* l (/ (* d 2.0) (* M_m D_m)))))))
(*
(+ 1.0 (* (/ t_0 l) (/ (* 0.5 t_0) (/ -1.0 h))))
(/ d (sqrt (* h l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (0.5 * (M_m * D_m)) / d;
double tmp;
if (l <= -6.2e+260) {
tmp = (0.0 - d) * sqrt((1.0 / (h * l)));
} else if (l <= 1.25e-261) {
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 - (((h * (D_m * (M_m * 0.25))) / d) / (l * ((d * 2.0) / (M_m * D_m))))));
} else {
tmp = (1.0 + ((t_0 / l) * ((0.5 * t_0) / (-1.0 / h)))) * (d / sqrt((h * l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = (0.5d0 * (m_m * d_m)) / d
if (l <= (-6.2d+260)) then
tmp = (0.0d0 - d) * sqrt((1.0d0 / (h * l)))
else if (l <= 1.25d-261) then
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0d0 - (((h * (d_m * (m_m * 0.25d0))) / d) / (l * ((d * 2.0d0) / (m_m * d_m))))))
else
tmp = (1.0d0 + ((t_0 / l) * ((0.5d0 * t_0) / ((-1.0d0) / h)))) * (d / sqrt((h * l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (0.5 * (M_m * D_m)) / d;
double tmp;
if (l <= -6.2e+260) {
tmp = (0.0 - d) * Math.sqrt((1.0 / (h * l)));
} else if (l <= 1.25e-261) {
tmp = Math.sqrt((d / l)) * (Math.sqrt((d / h)) * (1.0 - (((h * (D_m * (M_m * 0.25))) / d) / (l * ((d * 2.0) / (M_m * D_m))))));
} else {
tmp = (1.0 + ((t_0 / l) * ((0.5 * t_0) / (-1.0 / h)))) * (d / Math.sqrt((h * l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = (0.5 * (M_m * D_m)) / d tmp = 0 if l <= -6.2e+260: tmp = (0.0 - d) * math.sqrt((1.0 / (h * l))) elif l <= 1.25e-261: tmp = math.sqrt((d / l)) * (math.sqrt((d / h)) * (1.0 - (((h * (D_m * (M_m * 0.25))) / d) / (l * ((d * 2.0) / (M_m * D_m)))))) else: tmp = (1.0 + ((t_0 / l) * ((0.5 * t_0) / (-1.0 / h)))) * (d / math.sqrt((h * l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(Float64(0.5 * Float64(M_m * D_m)) / d) tmp = 0.0 if (l <= -6.2e+260) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(1.0 / Float64(h * l)))); elseif (l <= 1.25e-261) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 - Float64(Float64(Float64(h * Float64(D_m * Float64(M_m * 0.25))) / d) / Float64(l * Float64(Float64(d * 2.0) / Float64(M_m * D_m))))))); else tmp = Float64(Float64(1.0 + Float64(Float64(t_0 / l) * Float64(Float64(0.5 * t_0) / Float64(-1.0 / h)))) * Float64(d / sqrt(Float64(h * l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = (0.5 * (M_m * D_m)) / d;
tmp = 0.0;
if (l <= -6.2e+260)
tmp = (0.0 - d) * sqrt((1.0 / (h * l)));
elseif (l <= 1.25e-261)
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 - (((h * (D_m * (M_m * 0.25))) / d) / (l * ((d * 2.0) / (M_m * D_m))))));
else
tmp = (1.0 + ((t_0 / l) * ((0.5 * t_0) / (-1.0 / h)))) * (d / sqrt((h * l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[(0.5 * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]}, If[LessEqual[l, -6.2e+260], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.25e-261], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(N[(N[(h * N[(D$95$m * N[(M$95$m * 0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] / N[(l * N[(N[(d * 2.0), $MachinePrecision] / N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(t$95$0 / l), $MachinePrecision] * N[(N[(0.5 * t$95$0), $MachinePrecision] / N[(-1.0 / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{0.5 \cdot \left(M\_m \cdot D\_m\right)}{d}\\
\mathbf{if}\;\ell \leq -6.2 \cdot 10^{+260}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{elif}\;\ell \leq 1.25 \cdot 10^{-261}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 - \frac{\frac{h \cdot \left(D\_m \cdot \left(M\_m \cdot 0.25\right)\right)}{d}}{\ell \cdot \frac{d \cdot 2}{M\_m \cdot D\_m}}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \frac{t\_0}{\ell} \cdot \frac{0.5 \cdot t\_0}{\frac{-1}{h}}\right) \cdot \frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < -6.1999999999999996e260Initial program 33.8%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr34.9%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6434.9
Applied egg-rr34.9%
Applied egg-rr34.9%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6483.3
Simplified83.3%
if -6.1999999999999996e260 < l < 1.24999999999999995e-261Initial program 77.9%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr83.7%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6483.1
Applied egg-rr83.1%
Applied egg-rr70.6%
Applied egg-rr80.9%
if 1.24999999999999995e-261 < l Initial program 64.6%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr70.3%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6470.6
Applied egg-rr70.6%
metadata-evalN/A
pow1/2N/A
frac-2negN/A
div-invN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f640.0
Applied egg-rr0.0%
metadata-evalN/A
sqrt-divN/A
clear-numN/A
sqrt-unprodN/A
sub0-negN/A
div-invN/A
sub0-negN/A
frac-2negN/A
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
sqrt-prodN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6480.0
Applied egg-rr80.0%
Final simplification80.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= (* M_m D_m) 1e-216)
(/ t_0 (sqrt (/ h d)))
(if (<= (* M_m D_m) 5e+129)
(*
t_0
(*
(sqrt (/ d h))
(-
1.0
(* h (/ (* (* M_m D_m) (* (* M_m D_m) 0.125)) (* d (* d l)))))))
(fma
(* D_m D_m)
(* (/ (sqrt (/ h l)) l) (/ (* (* M_m M_m) -0.125) d))
0.0)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double tmp;
if ((M_m * D_m) <= 1e-216) {
tmp = t_0 / sqrt((h / d));
} else if ((M_m * D_m) <= 5e+129) {
tmp = t_0 * (sqrt((d / h)) * (1.0 - (h * (((M_m * D_m) * ((M_m * D_m) * 0.125)) / (d * (d * l))))));
} else {
tmp = fma((D_m * D_m), ((sqrt((h / l)) / l) * (((M_m * M_m) * -0.125) / d)), 0.0);
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (Float64(M_m * D_m) <= 1e-216) tmp = Float64(t_0 / sqrt(Float64(h / d))); elseif (Float64(M_m * D_m) <= 5e+129) tmp = Float64(t_0 * Float64(sqrt(Float64(d / h)) * Float64(1.0 - Float64(h * Float64(Float64(Float64(M_m * D_m) * Float64(Float64(M_m * D_m) * 0.125)) / Float64(d * Float64(d * l))))))); else tmp = fma(Float64(D_m * D_m), Float64(Float64(sqrt(Float64(h / l)) / l) * Float64(Float64(Float64(M_m * M_m) * -0.125) / d)), 0.0); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 1e-216], N[(t$95$0 / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 5e+129], N[(t$95$0 * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(h * N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(N[(M$95$m * D$95$m), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision] / l), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;M\_m \cdot D\_m \leq 10^{-216}:\\
\;\;\;\;\frac{t\_0}{\sqrt{\frac{h}{d}}}\\
\mathbf{elif}\;M\_m \cdot D\_m \leq 5 \cdot 10^{+129}:\\
\;\;\;\;t\_0 \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 - h \cdot \frac{\left(M\_m \cdot D\_m\right) \cdot \left(\left(M\_m \cdot D\_m\right) \cdot 0.125\right)}{d \cdot \left(d \cdot \ell\right)}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(D\_m \cdot D\_m, \frac{\sqrt{\frac{h}{\ell}}}{\ell} \cdot \frac{\left(M\_m \cdot M\_m\right) \cdot -0.125}{d}, 0\right)\\
\end{array}
\end{array}
if (*.f64 M D) < 1e-216Initial program 70.9%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6453.4
Simplified53.4%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6431.4
Simplified31.4%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6430.7
Applied egg-rr30.7%
rem-square-sqrtN/A
sqrt-prodN/A
frac-timesN/A
sqrt-divN/A
sqrt-divN/A
frac-2negN/A
sub0-negN/A
div-invN/A
sqrt-prodN/A
sub0-negN/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr46.4%
if 1e-216 < (*.f64 M D) < 5.0000000000000003e129Initial program 67.3%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr67.9%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6468.3
Applied egg-rr68.3%
Applied egg-rr69.4%
associate-*r*N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6469.4
Applied egg-rr69.4%
if 5.0000000000000003e129 < (*.f64 M D) Initial program 71.8%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr79.2%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6477.3
Applied egg-rr77.3%
Taylor expanded in h around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
Simplified34.1%
associate-/r*N/A
sqrt-divN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6473.8
Applied egg-rr73.8%
Final simplification57.5%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0
(*
(sqrt (/ d l))
(*
(sqrt (/ d h))
(-
1.0
(* h (* (/ (* (* M_m D_m) 0.125) (* d l)) (/ (* M_m D_m) d))))))))
(if (<= d -2.6e-240)
t_0
(if (<= d 6.5e-170)
(fma
(* D_m D_m)
(* (/ (sqrt (/ h l)) l) (/ (* (* M_m M_m) -0.125) d))
0.0)
t_0))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l)) * (sqrt((d / h)) * (1.0 - (h * ((((M_m * D_m) * 0.125) / (d * l)) * ((M_m * D_m) / d)))));
double tmp;
if (d <= -2.6e-240) {
tmp = t_0;
} else if (d <= 6.5e-170) {
tmp = fma((D_m * D_m), ((sqrt((h / l)) / l) * (((M_m * M_m) * -0.125) / d)), 0.0);
} else {
tmp = t_0;
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 - Float64(h * Float64(Float64(Float64(Float64(M_m * D_m) * 0.125) / Float64(d * l)) * Float64(Float64(M_m * D_m) / d)))))) tmp = 0.0 if (d <= -2.6e-240) tmp = t_0; elseif (d <= 6.5e-170) tmp = fma(Float64(D_m * D_m), Float64(Float64(sqrt(Float64(h / l)) / l) * Float64(Float64(Float64(M_m * M_m) * -0.125) / d)), 0.0); else tmp = t_0; end return tmp end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(h * N[(N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * 0.125), $MachinePrecision] / N[(d * l), $MachinePrecision]), $MachinePrecision] * N[(N[(M$95$m * D$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -2.6e-240], t$95$0, If[LessEqual[d, 6.5e-170], N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision] / l), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision], t$95$0]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 - h \cdot \left(\frac{\left(M\_m \cdot D\_m\right) \cdot 0.125}{d \cdot \ell} \cdot \frac{M\_m \cdot D\_m}{d}\right)\right)\right)\\
\mathbf{if}\;d \leq -2.6 \cdot 10^{-240}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;d \leq 6.5 \cdot 10^{-170}:\\
\;\;\;\;\mathsf{fma}\left(D\_m \cdot D\_m, \frac{\sqrt{\frac{h}{\ell}}}{\ell} \cdot \frac{\left(M\_m \cdot M\_m\right) \cdot -0.125}{d}, 0\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if d < -2.59999999999999992e-240 or 6.50000000000000035e-170 < d Initial program 75.2%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr81.1%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6480.9
Applied egg-rr80.9%
Applied egg-rr66.6%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6477.3
Applied egg-rr77.3%
if -2.59999999999999992e-240 < d < 6.50000000000000035e-170Initial program 49.4%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr53.4%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6453.3
Applied egg-rr53.3%
Taylor expanded in h around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
Simplified35.3%
associate-/r*N/A
sqrt-divN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6460.2
Applied egg-rr60.2%
Final simplification74.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -1.45e+264)
(* (- 0.0 d) (sqrt (/ 1.0 (* h l))))
(if (<= l 3.6e-302)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(if (<= l 3.9e-149)
(/ d (sqrt (* h l)))
(fma d (/ (/ 1.0 (sqrt l)) (sqrt h)) 0.0)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.45e+264) {
tmp = (0.0 - d) * sqrt((1.0 / (h * l)));
} else if (l <= 3.6e-302) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else if (l <= 3.9e-149) {
tmp = d / sqrt((h * l));
} else {
tmp = fma(d, ((1.0 / sqrt(l)) / sqrt(h)), 0.0);
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.45e+264) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(1.0 / Float64(h * l)))); elseif (l <= 3.6e-302) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); elseif (l <= 3.9e-149) tmp = Float64(d / sqrt(Float64(h * l))); else tmp = fma(d, Float64(Float64(1.0 / sqrt(l)) / sqrt(h)), 0.0); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.45e+264], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.6e-302], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.9e-149], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(1.0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.45 \cdot 10^{+264}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{elif}\;\ell \leq 3.6 \cdot 10^{-302}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;\ell \leq 3.9 \cdot 10^{-149}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(d, \frac{\frac{1}{\sqrt{\ell}}}{\sqrt{h}}, 0\right)\\
\end{array}
\end{array}
if l < -1.4499999999999999e264Initial program 33.8%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr34.9%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6434.9
Applied egg-rr34.9%
Applied egg-rr34.9%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6483.3
Simplified83.3%
if -1.4499999999999999e264 < l < 3.6000000000000001e-302Initial program 77.4%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6456.6
Simplified56.6%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6413.9
Simplified13.9%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6413.1
Applied egg-rr13.1%
rem-square-sqrtN/A
sqrt-prodN/A
frac-timesN/A
sqrt-divN/A
sqrt-divN/A
frac-2negN/A
sub0-negN/A
div-invN/A
sqrt-prodN/A
sub0-negN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr43.7%
if 3.6000000000000001e-302 < l < 3.9000000000000002e-149Initial program 76.6%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6462.6
Simplified62.6%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6424.2
Simplified24.2%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6424.1
Applied egg-rr24.1%
frac-2negN/A
distribute-frac-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6447.3
Applied egg-rr47.3%
if 3.9000000000000002e-149 < l Initial program 61.5%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6444.0
Simplified44.0%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6441.7
Simplified41.7%
*-commutativeN/A
associate-/r*N/A
sqrt-divN/A
pow1/2N/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6447.4
Applied egg-rr47.4%
Final simplification44.1%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (* d (sqrt (/ 1.0 (* h l))))) (t_1 (/ d (sqrt (* h l)))))
(if (<= d -1.02e+24)
t_1
(if (<= d 2.2e-293) t_0 (if (<= d 1.82e+186) t_1 t_0)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = d * sqrt((1.0 / (h * l)));
double t_1 = d / sqrt((h * l));
double tmp;
if (d <= -1.02e+24) {
tmp = t_1;
} else if (d <= 2.2e-293) {
tmp = t_0;
} else if (d <= 1.82e+186) {
tmp = t_1;
} else {
tmp = t_0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = d * sqrt((1.0d0 / (h * l)))
t_1 = d / sqrt((h * l))
if (d <= (-1.02d+24)) then
tmp = t_1
else if (d <= 2.2d-293) then
tmp = t_0
else if (d <= 1.82d+186) then
tmp = t_1
else
tmp = t_0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = d * Math.sqrt((1.0 / (h * l)));
double t_1 = d / Math.sqrt((h * l));
double tmp;
if (d <= -1.02e+24) {
tmp = t_1;
} else if (d <= 2.2e-293) {
tmp = t_0;
} else if (d <= 1.82e+186) {
tmp = t_1;
} else {
tmp = t_0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = d * math.sqrt((1.0 / (h * l))) t_1 = d / math.sqrt((h * l)) tmp = 0 if d <= -1.02e+24: tmp = t_1 elif d <= 2.2e-293: tmp = t_0 elif d <= 1.82e+186: tmp = t_1 else: tmp = t_0 return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) t_1 = Float64(d / sqrt(Float64(h * l))) tmp = 0.0 if (d <= -1.02e+24) tmp = t_1; elseif (d <= 2.2e-293) tmp = t_0; elseif (d <= 1.82e+186) tmp = t_1; else tmp = t_0; end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = d * sqrt((1.0 / (h * l)));
t_1 = d / sqrt((h * l));
tmp = 0.0;
if (d <= -1.02e+24)
tmp = t_1;
elseif (d <= 2.2e-293)
tmp = t_0;
elseif (d <= 1.82e+186)
tmp = t_1;
else
tmp = t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -1.02e+24], t$95$1, If[LessEqual[d, 2.2e-293], t$95$0, If[LessEqual[d, 1.82e+186], t$95$1, t$95$0]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := d \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
t_1 := \frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{if}\;d \leq -1.02 \cdot 10^{+24}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;d \leq 2.2 \cdot 10^{-293}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;d \leq 1.82 \cdot 10^{+186}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if d < -1.02000000000000004e24 or 2.2e-293 < d < 1.8200000000000001e186Initial program 71.1%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.7
Simplified57.7%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6417.6
Simplified17.6%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6417.6
Applied egg-rr17.6%
frac-2negN/A
distribute-frac-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6428.9
Applied egg-rr28.9%
if -1.02000000000000004e24 < d < 2.2e-293 or 1.8200000000000001e186 < d Initial program 69.2%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6444.8
Simplified44.8%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6434.1
Simplified34.1%
+-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6434.1
Applied egg-rr34.1%
Final simplification25.0%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= d -6.6e-249) (* (- 0.0 d) (sqrt (/ 1.0 (* h l)))) (if (<= d 1.08e+186) (/ d (sqrt (* h l))) (/ d (* (sqrt l) (sqrt h))))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -6.6e-249) {
tmp = (0.0 - d) * sqrt((1.0 / (h * l)));
} else if (d <= 1.08e+186) {
tmp = d / sqrt((h * l));
} else {
tmp = d / (sqrt(l) * sqrt(h));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= (-6.6d-249)) then
tmp = (0.0d0 - d) * sqrt((1.0d0 / (h * l)))
else if (d <= 1.08d+186) then
tmp = d / sqrt((h * l))
else
tmp = d / (sqrt(l) * sqrt(h))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -6.6e-249) {
tmp = (0.0 - d) * Math.sqrt((1.0 / (h * l)));
} else if (d <= 1.08e+186) {
tmp = d / Math.sqrt((h * l));
} else {
tmp = d / (Math.sqrt(l) * Math.sqrt(h));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= -6.6e-249: tmp = (0.0 - d) * math.sqrt((1.0 / (h * l))) elif d <= 1.08e+186: tmp = d / math.sqrt((h * l)) else: tmp = d / (math.sqrt(l) * math.sqrt(h)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -6.6e-249) tmp = Float64(Float64(0.0 - d) * sqrt(Float64(1.0 / Float64(h * l)))); elseif (d <= 1.08e+186) tmp = Float64(d / sqrt(Float64(h * l))); else tmp = Float64(d / Float64(sqrt(l) * sqrt(h))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= -6.6e-249)
tmp = (0.0 - d) * sqrt((1.0 / (h * l)));
elseif (d <= 1.08e+186)
tmp = d / sqrt((h * l));
else
tmp = d / (sqrt(l) * sqrt(h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -6.6e-249], N[(N[(0.0 - d), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.08e+186], N[(d / N[Sqrt[N[(h * l), $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_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -6.6 \cdot 10^{-249}:\\
\;\;\;\;\left(0 - d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{elif}\;d \leq 1.08 \cdot 10^{+186}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if d < -6.6e-249Initial program 76.9%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr81.2%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6480.5
Applied egg-rr80.5%
Applied egg-rr69.0%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6445.1
Simplified45.1%
if -6.6e-249 < d < 1.08000000000000003e186Initial program 61.7%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6449.7
Simplified49.7%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6427.9
Simplified27.9%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6427.9
Applied egg-rr27.9%
frac-2negN/A
distribute-frac-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6436.1
Applied egg-rr36.1%
if 1.08000000000000003e186 < d Initial program 74.1%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6443.3
Simplified43.3%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6473.4
Simplified73.4%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6473.2
Applied egg-rr73.2%
*-commutativeN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6484.4
Applied egg-rr84.4%
Final simplification41.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ 1.0 (* h l)))))
(if (<= d -6.6e-249)
(* (- 0.0 d) t_0)
(if (<= d 1.56e+186) (/ d (sqrt (* h l))) (* d t_0)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((1.0 / (h * l)));
double tmp;
if (d <= -6.6e-249) {
tmp = (0.0 - d) * t_0;
} else if (d <= 1.56e+186) {
tmp = d / sqrt((h * l));
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((1.0d0 / (h * l)))
if (d <= (-6.6d-249)) then
tmp = (0.0d0 - d) * t_0
else if (d <= 1.56d+186) then
tmp = d / sqrt((h * l))
else
tmp = d * t_0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((1.0 / (h * l)));
double tmp;
if (d <= -6.6e-249) {
tmp = (0.0 - d) * t_0;
} else if (d <= 1.56e+186) {
tmp = d / Math.sqrt((h * l));
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((1.0 / (h * l))) tmp = 0 if d <= -6.6e-249: tmp = (0.0 - d) * t_0 elif d <= 1.56e+186: tmp = d / math.sqrt((h * l)) else: tmp = d * t_0 return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(1.0 / Float64(h * l))) tmp = 0.0 if (d <= -6.6e-249) tmp = Float64(Float64(0.0 - d) * t_0); elseif (d <= 1.56e+186) tmp = Float64(d / sqrt(Float64(h * l))); else tmp = Float64(d * t_0); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((1.0 / (h * l)));
tmp = 0.0;
if (d <= -6.6e-249)
tmp = (0.0 - d) * t_0;
elseif (d <= 1.56e+186)
tmp = d / sqrt((h * l));
else
tmp = d * t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -6.6e-249], N[(N[(0.0 - d), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[d, 1.56e+186], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * t$95$0), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{if}\;d \leq -6.6 \cdot 10^{-249}:\\
\;\;\;\;\left(0 - d\right) \cdot t\_0\\
\mathbf{elif}\;d \leq 1.56 \cdot 10^{+186}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if d < -6.6e-249Initial program 76.9%
clear-numN/A
un-div-invN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr81.2%
metadata-evalN/A
unpow1/2N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6480.5
Applied egg-rr80.5%
Applied egg-rr69.0%
Taylor expanded in l around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6445.1
Simplified45.1%
if -6.6e-249 < d < 1.5599999999999999e186Initial program 61.7%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6449.7
Simplified49.7%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6427.9
Simplified27.9%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6427.9
Applied egg-rr27.9%
frac-2negN/A
distribute-frac-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6436.1
Applied egg-rr36.1%
if 1.5599999999999999e186 < d Initial program 74.1%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6443.3
Simplified43.3%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6473.4
Simplified73.4%
+-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6473.4
Applied egg-rr73.4%
Final simplification40.7%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (/ d (sqrt (* h l))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
return d / sqrt((h * l));
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
code = d / sqrt((h * l))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d / Math.sqrt((h * l));
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d / math.sqrt((h * l))
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d / sqrt(Float64(h * l))) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d / sqrt((h * l));
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\frac{d}{\sqrt{h \cdot \ell}}
\end{array}
Initial program 70.2%
Taylor expanded in M around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6452.0
Simplified52.0%
Taylor expanded in d around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6425.0
Simplified25.0%
+-rgt-identityN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6424.6
Applied egg-rr24.6%
frac-2negN/A
distribute-frac-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6426.5
Applied egg-rr26.5%
Final simplification24.6%
herbie shell --seed 2024199
(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)))))