
(FPCore (w0 M D h l d) :precision binary64 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))
double code(double w0, double M, double D, double h, double l, double d) {
return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
real(8) function code(w0, m, d, h, l, d_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_1
code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function
public static double code(double w0, double M, double D, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
def code(w0, M, D, h, l, d): return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))
function code(w0, M, D, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))))) end
function tmp = code(w0, M, D, h, l, d) tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l)))); end
code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (w0 M D h l d) :precision binary64 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))
double code(double w0, double M, double D, double h, double l, double d) {
return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
real(8) function code(w0, m, d, h, l, d_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_1
code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function
public static double code(double w0, double M, double D, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
def code(w0, M, D, h, l, d): return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))
function code(w0, M, D, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))))) end
function tmp = code(w0, M, D, h, l, d) tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l)))); end
code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}
\end{array}
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(let* ((t_0 (/ (/ (* 2.0 d) M_m) D_m)))
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) 0.01)
(* w0 (sqrt (- 1.0 (/ (/ (/ h l) t_0) t_0))))
(*
w0
(sqrt
(+
1.0
(/ (* D_m (* -0.25 (/ (/ (* D_m (* h (* M_m M_m))) d) l))) d)))))))M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double t_0 = ((2.0 * d) / M_m) / D_m;
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= 0.01) {
tmp = w0 * sqrt((1.0 - (((h / l) / t_0) / t_0)));
} else {
tmp = w0 * sqrt((1.0 + ((D_m * (-0.25 * (((D_m * (h * (M_m * M_m))) / d) / l))) / d)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: t_0
real(8) :: tmp
t_0 = ((2.0d0 * d) / m_m) / d_m
if (((((m_m * d_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= 0.01d0) then
tmp = w0 * sqrt((1.0d0 - (((h / l) / t_0) / t_0)))
else
tmp = w0 * sqrt((1.0d0 + ((d_m * ((-0.25d0) * (((d_m * (h * (m_m * m_m))) / d) / l))) / d)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double t_0 = ((2.0 * d) / M_m) / D_m;
double tmp;
if ((Math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= 0.01) {
tmp = w0 * Math.sqrt((1.0 - (((h / l) / t_0) / t_0)));
} else {
tmp = w0 * Math.sqrt((1.0 + ((D_m * (-0.25 * (((D_m * (h * (M_m * M_m))) / d) / l))) / d)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): t_0 = ((2.0 * d) / M_m) / D_m tmp = 0 if (math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= 0.01: tmp = w0 * math.sqrt((1.0 - (((h / l) / t_0) / t_0))) else: tmp = w0 * math.sqrt((1.0 + ((D_m * (-0.25 * (((D_m * (h * (M_m * M_m))) / d) / l))) / d))) return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) t_0 = Float64(Float64(Float64(2.0 * d) / M_m) / D_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= 0.01) tmp = Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(Float64(h / l) / t_0) / t_0)))); else tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(D_m * Float64(-0.25 * Float64(Float64(Float64(D_m * Float64(h * Float64(M_m * M_m))) / d) / l))) / d)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
t_0 = ((2.0 * d) / M_m) / D_m;
tmp = 0.0;
if (((((M_m * D_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= 0.01)
tmp = w0 * sqrt((1.0 - (((h / l) / t_0) / t_0)));
else
tmp = w0 * sqrt((1.0 + ((D_m * (-0.25 * (((D_m * (h * (M_m * M_m))) / d) / l))) / d)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := Block[{t$95$0 = N[(N[(N[(2.0 * d), $MachinePrecision] / M$95$m), $MachinePrecision] / D$95$m), $MachinePrecision]}, If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], 0.01], N[(w0 * N[Sqrt[N[(1.0 - N[(N[(N[(h / l), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(D$95$m * N[(-0.25 * N[(N[(N[(D$95$m * N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{2 \cdot d}{M\_m}}{D\_m}\\
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq 0.01:\\
\;\;\;\;w0 \cdot \sqrt{1 - \frac{\frac{\frac{h}{\ell}}{t\_0}}{t\_0}}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{D\_m \cdot \left(-0.25 \cdot \frac{\frac{D\_m \cdot \left(h \cdot \left(M\_m \cdot M\_m\right)\right)}{d}}{\ell}\right)}{d}}\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < 0.0100000000000000002Initial program 89.7%
*-commutativeN/A
unpow2N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6491.3%
Applied egg-rr91.3%
if 0.0100000000000000002 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 0.0%
Simplified0.4%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f644.1%
Applied egg-rr4.1%
Taylor expanded in h around 0
*-lowering-*.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6464.6%
Simplified64.6%
Final simplification88.5%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (/ h l) -5e+300)
(*
w0
(sqrt
(+ 1.0 (* (/ (/ h (/ -4.0 (/ M_m (/ d (* M_m D_m))))) d) (/ D_m l)))))
(if (<= (/ h l) -1e-209)
(*
w0
(sqrt
(+ 1.0 (* (/ D_m d) (* (* M_m (/ (/ h l) -4.0)) (/ M_m (/ d D_m)))))))
(*
w0
(sqrt
(+
1.0
(/ (* D_m (* -0.25 (/ (/ (* D_m (* h (* M_m M_m))) d) l))) d)))))))M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((h / l) <= -5e+300) {
tmp = w0 * sqrt((1.0 + (((h / (-4.0 / (M_m / (d / (M_m * D_m))))) / d) * (D_m / l))));
} else if ((h / l) <= -1e-209) {
tmp = w0 * sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m))))));
} else {
tmp = w0 * sqrt((1.0 + ((D_m * (-0.25 * (((D_m * (h * (M_m * M_m))) / d) / l))) / d)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if ((h / l) <= (-5d+300)) then
tmp = w0 * sqrt((1.0d0 + (((h / ((-4.0d0) / (m_m / (d / (m_m * d_m))))) / d) * (d_m / l))))
else if ((h / l) <= (-1d-209)) then
tmp = w0 * sqrt((1.0d0 + ((d_m / d) * ((m_m * ((h / l) / (-4.0d0))) * (m_m / (d / d_m))))))
else
tmp = w0 * sqrt((1.0d0 + ((d_m * ((-0.25d0) * (((d_m * (h * (m_m * m_m))) / d) / l))) / d)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((h / l) <= -5e+300) {
tmp = w0 * Math.sqrt((1.0 + (((h / (-4.0 / (M_m / (d / (M_m * D_m))))) / d) * (D_m / l))));
} else if ((h / l) <= -1e-209) {
tmp = w0 * Math.sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m))))));
} else {
tmp = w0 * Math.sqrt((1.0 + ((D_m * (-0.25 * (((D_m * (h * (M_m * M_m))) / d) / l))) / d)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if (h / l) <= -5e+300: tmp = w0 * math.sqrt((1.0 + (((h / (-4.0 / (M_m / (d / (M_m * D_m))))) / d) * (D_m / l)))) elif (h / l) <= -1e-209: tmp = w0 * math.sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m)))))) else: tmp = w0 * math.sqrt((1.0 + ((D_m * (-0.25 * (((D_m * (h * (M_m * M_m))) / d) / l))) / d))) return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(h / l) <= -5e+300) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(Float64(h / Float64(-4.0 / Float64(M_m / Float64(d / Float64(M_m * D_m))))) / d) * Float64(D_m / l))))); elseif (Float64(h / l) <= -1e-209) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(D_m / d) * Float64(Float64(M_m * Float64(Float64(h / l) / -4.0)) * Float64(M_m / Float64(d / D_m))))))); else tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(D_m * Float64(-0.25 * Float64(Float64(Float64(D_m * Float64(h * Float64(M_m * M_m))) / d) / l))) / d)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if ((h / l) <= -5e+300)
tmp = w0 * sqrt((1.0 + (((h / (-4.0 / (M_m / (d / (M_m * D_m))))) / d) * (D_m / l))));
elseif ((h / l) <= -1e-209)
tmp = w0 * sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m))))));
else
tmp = w0 * sqrt((1.0 + ((D_m * (-0.25 * (((D_m * (h * (M_m * M_m))) / d) / l))) / d)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(h / l), $MachinePrecision], -5e+300], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(N[(h / N[(-4.0 / N[(M$95$m / N[(d / N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * N[(D$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(h / l), $MachinePrecision], -1e-209], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(M$95$m * N[(N[(h / l), $MachinePrecision] / -4.0), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / N[(d / D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(D$95$m * N[(-0.25 * N[(N[(N[(D$95$m * N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \leq -5 \cdot 10^{+300}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{\frac{h}{\frac{-4}{\frac{M\_m}{\frac{d}{M\_m \cdot D\_m}}}}}{d} \cdot \frac{D\_m}{\ell}}\\
\mathbf{elif}\;\frac{h}{\ell} \leq -1 \cdot 10^{-209}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{D\_m}{d} \cdot \left(\left(M\_m \cdot \frac{\frac{h}{\ell}}{-4}\right) \cdot \frac{M\_m}{\frac{d}{D\_m}}\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{D\_m \cdot \left(-0.25 \cdot \frac{\frac{D\_m \cdot \left(h \cdot \left(M\_m \cdot M\_m\right)\right)}{d}}{\ell}\right)}{d}}\\
\end{array}
\end{array}
if (/.f64 h l) < -5.00000000000000026e300Initial program 32.8%
Simplified32.8%
associate-*l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr84.9%
if -5.00000000000000026e300 < (/.f64 h l) < -1e-209Initial program 81.8%
Simplified71.3%
associate-*l/N/A
associate-/l/N/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6467.5%
Applied egg-rr67.5%
clear-numN/A
un-div-invN/A
associate-/l*N/A
div-invN/A
clear-numN/A
*-commutativeN/A
frac-timesN/A
associate-/r/N/A
*-commutativeN/A
associate-*l/N/A
associate-/l/N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
div-invN/A
associate-/r*N/A
clear-numN/A
Applied egg-rr80.8%
if -1e-209 < (/.f64 h l) Initial program 88.5%
Simplified83.7%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6488.6%
Applied egg-rr88.6%
Taylor expanded in h around 0
*-lowering-*.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6478.7%
Simplified78.7%
Final simplification80.2%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (/ h l) -5e+300)
(*
w0
(sqrt
(+ 1.0 (* (/ (/ h (/ -4.0 (/ M_m (/ d (* M_m D_m))))) d) (/ D_m l)))))
(if (<= (/ h l) -1e-275)
(*
w0
(sqrt
(+ 1.0 (* (/ D_m d) (* (* M_m (/ (/ h l) -4.0)) (/ M_m (/ d D_m)))))))
w0)))M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((h / l) <= -5e+300) {
tmp = w0 * sqrt((1.0 + (((h / (-4.0 / (M_m / (d / (M_m * D_m))))) / d) * (D_m / l))));
} else if ((h / l) <= -1e-275) {
tmp = w0 * sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m))))));
} else {
tmp = w0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if ((h / l) <= (-5d+300)) then
tmp = w0 * sqrt((1.0d0 + (((h / ((-4.0d0) / (m_m / (d / (m_m * d_m))))) / d) * (d_m / l))))
else if ((h / l) <= (-1d-275)) then
tmp = w0 * sqrt((1.0d0 + ((d_m / d) * ((m_m * ((h / l) / (-4.0d0))) * (m_m / (d / d_m))))))
else
tmp = w0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((h / l) <= -5e+300) {
tmp = w0 * Math.sqrt((1.0 + (((h / (-4.0 / (M_m / (d / (M_m * D_m))))) / d) * (D_m / l))));
} else if ((h / l) <= -1e-275) {
tmp = w0 * Math.sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m))))));
} else {
tmp = w0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if (h / l) <= -5e+300: tmp = w0 * math.sqrt((1.0 + (((h / (-4.0 / (M_m / (d / (M_m * D_m))))) / d) * (D_m / l)))) elif (h / l) <= -1e-275: tmp = w0 * math.sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m)))))) else: tmp = w0 return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(h / l) <= -5e+300) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(Float64(h / Float64(-4.0 / Float64(M_m / Float64(d / Float64(M_m * D_m))))) / d) * Float64(D_m / l))))); elseif (Float64(h / l) <= -1e-275) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(D_m / d) * Float64(Float64(M_m * Float64(Float64(h / l) / -4.0)) * Float64(M_m / Float64(d / D_m))))))); else tmp = w0; end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if ((h / l) <= -5e+300)
tmp = w0 * sqrt((1.0 + (((h / (-4.0 / (M_m / (d / (M_m * D_m))))) / d) * (D_m / l))));
elseif ((h / l) <= -1e-275)
tmp = w0 * sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m))))));
else
tmp = w0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(h / l), $MachinePrecision], -5e+300], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(N[(h / N[(-4.0 / N[(M$95$m / N[(d / N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * N[(D$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(h / l), $MachinePrecision], -1e-275], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(M$95$m * N[(N[(h / l), $MachinePrecision] / -4.0), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / N[(d / D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \leq -5 \cdot 10^{+300}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{\frac{h}{\frac{-4}{\frac{M\_m}{\frac{d}{M\_m \cdot D\_m}}}}}{d} \cdot \frac{D\_m}{\ell}}\\
\mathbf{elif}\;\frac{h}{\ell} \leq -1 \cdot 10^{-275}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{D\_m}{d} \cdot \left(\left(M\_m \cdot \frac{\frac{h}{\ell}}{-4}\right) \cdot \frac{M\_m}{\frac{d}{D\_m}}\right)}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -5.00000000000000026e300Initial program 32.8%
Simplified32.8%
associate-*l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr84.9%
if -5.00000000000000026e300 < (/.f64 h l) < -9.99999999999999934e-276Initial program 82.9%
Simplified72.2%
associate-*l/N/A
associate-/l/N/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Applied egg-rr68.6%
clear-numN/A
un-div-invN/A
associate-/l*N/A
div-invN/A
clear-numN/A
*-commutativeN/A
frac-timesN/A
associate-/r/N/A
*-commutativeN/A
associate-*l/N/A
associate-/l/N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
div-invN/A
associate-/r*N/A
clear-numN/A
Applied egg-rr82.0%
if -9.99999999999999934e-276 < (/.f64 h l) Initial program 87.8%
Simplified83.5%
Taylor expanded in h around 0
Simplified93.7%
Final simplification87.5%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (/ h l) (- INFINITY))
(*
w0
(+ 1.0 (/ (* D_m D_m) (/ (* l (* d d)) (* M_m (* M_m (* h -0.125)))))))
(if (<= (/ h l) -1e-275)
(*
w0
(sqrt
(+ 1.0 (* (/ D_m d) (* (* M_m (/ (/ h l) -4.0)) (/ M_m (/ d D_m)))))))
w0)))M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((h / l) <= -((double) INFINITY)) {
tmp = w0 * (1.0 + ((D_m * D_m) / ((l * (d * d)) / (M_m * (M_m * (h * -0.125))))));
} else if ((h / l) <= -1e-275) {
tmp = w0 * sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m))))));
} else {
tmp = w0;
}
return tmp;
}
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((h / l) <= -Double.POSITIVE_INFINITY) {
tmp = w0 * (1.0 + ((D_m * D_m) / ((l * (d * d)) / (M_m * (M_m * (h * -0.125))))));
} else if ((h / l) <= -1e-275) {
tmp = w0 * Math.sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m))))));
} else {
tmp = w0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if (h / l) <= -math.inf: tmp = w0 * (1.0 + ((D_m * D_m) / ((l * (d * d)) / (M_m * (M_m * (h * -0.125)))))) elif (h / l) <= -1e-275: tmp = w0 * math.sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m)))))) else: tmp = w0 return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(h / l) <= Float64(-Inf)) tmp = Float64(w0 * Float64(1.0 + Float64(Float64(D_m * D_m) / Float64(Float64(l * Float64(d * d)) / Float64(M_m * Float64(M_m * Float64(h * -0.125))))))); elseif (Float64(h / l) <= -1e-275) tmp = Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(D_m / d) * Float64(Float64(M_m * Float64(Float64(h / l) / -4.0)) * Float64(M_m / Float64(d / D_m))))))); else tmp = w0; end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if ((h / l) <= -Inf)
tmp = w0 * (1.0 + ((D_m * D_m) / ((l * (d * d)) / (M_m * (M_m * (h * -0.125))))));
elseif ((h / l) <= -1e-275)
tmp = w0 * sqrt((1.0 + ((D_m / d) * ((M_m * ((h / l) / -4.0)) * (M_m / (d / D_m))))));
else
tmp = w0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(h / l), $MachinePrecision], (-Infinity)], N[(w0 * N[(1.0 + N[(N[(D$95$m * D$95$m), $MachinePrecision] / N[(N[(l * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(M$95$m * N[(M$95$m * N[(h * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(h / l), $MachinePrecision], -1e-275], N[(w0 * N[Sqrt[N[(1.0 + N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(M$95$m * N[(N[(h / l), $MachinePrecision] / -4.0), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / N[(d / D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], w0]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \leq -\infty:\\
\;\;\;\;w0 \cdot \left(1 + \frac{D\_m \cdot D\_m}{\frac{\ell \cdot \left(d \cdot d\right)}{M\_m \cdot \left(M\_m \cdot \left(h \cdot -0.125\right)\right)}}\right)\\
\mathbf{elif}\;\frac{h}{\ell} \leq -1 \cdot 10^{-275}:\\
\;\;\;\;w0 \cdot \sqrt{1 + \frac{D\_m}{d} \cdot \left(\left(M\_m \cdot \frac{\frac{h}{\ell}}{-4}\right) \cdot \frac{M\_m}{\frac{d}{D\_m}}\right)}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if (/.f64 h l) < -inf.0Initial program 27.9%
Simplified27.8%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6467.5%
Simplified67.5%
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.3%
Applied egg-rr72.3%
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr67.5%
if -inf.0 < (/.f64 h l) < -9.99999999999999934e-276Initial program 82.5%
Simplified72.1%
associate-*l/N/A
associate-/l/N/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Applied egg-rr68.6%
clear-numN/A
un-div-invN/A
associate-/l*N/A
div-invN/A
clear-numN/A
*-commutativeN/A
frac-timesN/A
associate-/r/N/A
*-commutativeN/A
associate-*l/N/A
associate-/l/N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
div-invN/A
associate-/r*N/A
clear-numN/A
Applied egg-rr81.7%
if -9.99999999999999934e-276 < (/.f64 h l) Initial program 87.8%
Simplified83.5%
Taylor expanded in h around 0
Simplified93.7%
Final simplification85.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(let* ((t_0 (* (/ D_m d) (* h (/ D_m l)))))
(if (<= M_m 1.65e-85)
w0
(if (<= M_m 1.75e+42)
(* w0 (+ 1.0 (/ t_0 (/ d (* (* M_m M_m) -0.125)))))
(* w0 (sqrt (* t_0 (/ M_m (/ (* d -4.0) M_m)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double t_0 = (D_m / d) * (h * (D_m / l));
double tmp;
if (M_m <= 1.65e-85) {
tmp = w0;
} else if (M_m <= 1.75e+42) {
tmp = w0 * (1.0 + (t_0 / (d / ((M_m * M_m) * -0.125))));
} else {
tmp = w0 * sqrt((t_0 * (M_m / ((d * -4.0) / M_m))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: t_0
real(8) :: tmp
t_0 = (d_m / d) * (h * (d_m / l))
if (m_m <= 1.65d-85) then
tmp = w0
else if (m_m <= 1.75d+42) then
tmp = w0 * (1.0d0 + (t_0 / (d / ((m_m * m_m) * (-0.125d0)))))
else
tmp = w0 * sqrt((t_0 * (m_m / ((d * (-4.0d0)) / m_m))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double t_0 = (D_m / d) * (h * (D_m / l));
double tmp;
if (M_m <= 1.65e-85) {
tmp = w0;
} else if (M_m <= 1.75e+42) {
tmp = w0 * (1.0 + (t_0 / (d / ((M_m * M_m) * -0.125))));
} else {
tmp = w0 * Math.sqrt((t_0 * (M_m / ((d * -4.0) / M_m))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): t_0 = (D_m / d) * (h * (D_m / l)) tmp = 0 if M_m <= 1.65e-85: tmp = w0 elif M_m <= 1.75e+42: tmp = w0 * (1.0 + (t_0 / (d / ((M_m * M_m) * -0.125)))) else: tmp = w0 * math.sqrt((t_0 * (M_m / ((d * -4.0) / M_m)))) return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) t_0 = Float64(Float64(D_m / d) * Float64(h * Float64(D_m / l))) tmp = 0.0 if (M_m <= 1.65e-85) tmp = w0; elseif (M_m <= 1.75e+42) tmp = Float64(w0 * Float64(1.0 + Float64(t_0 / Float64(d / Float64(Float64(M_m * M_m) * -0.125))))); else tmp = Float64(w0 * sqrt(Float64(t_0 * Float64(M_m / Float64(Float64(d * -4.0) / M_m))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
t_0 = (D_m / d) * (h * (D_m / l));
tmp = 0.0;
if (M_m <= 1.65e-85)
tmp = w0;
elseif (M_m <= 1.75e+42)
tmp = w0 * (1.0 + (t_0 / (d / ((M_m * M_m) * -0.125))));
else
tmp = w0 * sqrt((t_0 * (M_m / ((d * -4.0) / M_m))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := Block[{t$95$0 = N[(N[(D$95$m / d), $MachinePrecision] * N[(h * N[(D$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[M$95$m, 1.65e-85], w0, If[LessEqual[M$95$m, 1.75e+42], N[(w0 * N[(1.0 + N[(t$95$0 / N[(d / N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(t$95$0 * N[(M$95$m / N[(N[(d * -4.0), $MachinePrecision] / M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
t_0 := \frac{D\_m}{d} \cdot \left(h \cdot \frac{D\_m}{\ell}\right)\\
\mathbf{if}\;M\_m \leq 1.65 \cdot 10^{-85}:\\
\;\;\;\;w0\\
\mathbf{elif}\;M\_m \leq 1.75 \cdot 10^{+42}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{t\_0}{\frac{d}{\left(M\_m \cdot M\_m\right) \cdot -0.125}}\right)\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{t\_0 \cdot \frac{M\_m}{\frac{d \cdot -4}{M\_m}}}\\
\end{array}
\end{array}
if M < 1.64999999999999986e-85Initial program 80.0%
Simplified74.6%
Taylor expanded in h around 0
Simplified71.4%
if 1.64999999999999986e-85 < M < 1.75000000000000012e42Initial program 86.3%
Simplified86.3%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.5%
Simplified75.5%
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.3%
Applied egg-rr86.3%
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
times-fracN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6482.9%
Applied egg-rr82.9%
if 1.75000000000000012e42 < M Initial program 77.6%
Simplified62.4%
Taylor expanded in h around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6421.9%
Simplified21.9%
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6421.6%
Applied egg-rr21.6%
associate-*l/N/A
times-fracN/A
associate-/l*N/A
*-commutativeN/A
associate-*l/N/A
associate-/r*N/A
*-lowering-*.f64N/A
associate-/l*N/A
metadata-evalN/A
associate-/r*N/A
*-commutativeN/A
associate-*r*N/A
div-invN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
times-fracN/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr32.2%
Final simplification64.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= M_m 8e-86)
w0
(*
w0
(+ 1.0 (/ (* (/ D_m d) (* h (/ D_m l))) (/ d (* (* M_m M_m) -0.125)))))))M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 8e-86) {
tmp = w0;
} else {
tmp = w0 * (1.0 + (((D_m / d) * (h * (D_m / l))) / (d / ((M_m * M_m) * -0.125))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (m_m <= 8d-86) then
tmp = w0
else
tmp = w0 * (1.0d0 + (((d_m / d) * (h * (d_m / l))) / (d / ((m_m * m_m) * (-0.125d0)))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 8e-86) {
tmp = w0;
} else {
tmp = w0 * (1.0 + (((D_m / d) * (h * (D_m / l))) / (d / ((M_m * M_m) * -0.125))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if M_m <= 8e-86: tmp = w0 else: tmp = w0 * (1.0 + (((D_m / d) * (h * (D_m / l))) / (d / ((M_m * M_m) * -0.125)))) return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (M_m <= 8e-86) tmp = w0; else tmp = Float64(w0 * Float64(1.0 + Float64(Float64(Float64(D_m / d) * Float64(h * Float64(D_m / l))) / Float64(d / Float64(Float64(M_m * M_m) * -0.125))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (M_m <= 8e-86)
tmp = w0;
else
tmp = w0 * (1.0 + (((D_m / d) * (h * (D_m / l))) / (d / ((M_m * M_m) * -0.125))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[M$95$m, 8e-86], w0, N[(w0 * N[(1.0 + N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(h * N[(D$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d / N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 8 \cdot 10^{-86}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{\frac{D\_m}{d} \cdot \left(h \cdot \frac{D\_m}{\ell}\right)}{\frac{d}{\left(M\_m \cdot M\_m\right) \cdot -0.125}}\right)\\
\end{array}
\end{array}
if M < 8.00000000000000068e-86Initial program 80.0%
Simplified74.6%
Taylor expanded in h around 0
Simplified71.4%
if 8.00000000000000068e-86 < M Initial program 80.6%
Simplified70.9%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6449.3%
Simplified49.3%
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6455.7%
Applied egg-rr55.7%
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
times-fracN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6458.5%
Applied egg-rr58.5%
Final simplification67.4%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= D_m 3.55)
w0
(*
w0
(+ 1.0 (* D_m (/ (* D_m (* h (* (* M_m M_m) -0.125))) (* d (* d l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (D_m <= 3.55) {
tmp = w0;
} else {
tmp = w0 * (1.0 + (D_m * ((D_m * (h * ((M_m * M_m) * -0.125))) / (d * (d * l)))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (d_m <= 3.55d0) then
tmp = w0
else
tmp = w0 * (1.0d0 + (d_m * ((d_m * (h * ((m_m * m_m) * (-0.125d0)))) / (d * (d * l)))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (D_m <= 3.55) {
tmp = w0;
} else {
tmp = w0 * (1.0 + (D_m * ((D_m * (h * ((M_m * M_m) * -0.125))) / (d * (d * l)))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if D_m <= 3.55: tmp = w0 else: tmp = w0 * (1.0 + (D_m * ((D_m * (h * ((M_m * M_m) * -0.125))) / (d * (d * l))))) return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (D_m <= 3.55) tmp = w0; else tmp = Float64(w0 * Float64(1.0 + Float64(D_m * Float64(Float64(D_m * Float64(h * Float64(Float64(M_m * M_m) * -0.125))) / Float64(d * Float64(d * l)))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (D_m <= 3.55)
tmp = w0;
else
tmp = w0 * (1.0 + (D_m * ((D_m * (h * ((M_m * M_m) * -0.125))) / (d * (d * l)))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[D$95$m, 3.55], w0, N[(w0 * N[(1.0 + N[(D$95$m * N[(N[(D$95$m * N[(h * N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;D\_m \leq 3.55:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(1 + D\_m \cdot \frac{D\_m \cdot \left(h \cdot \left(\left(M\_m \cdot M\_m\right) \cdot -0.125\right)\right)}{d \cdot \left(d \cdot \ell\right)}\right)\\
\end{array}
\end{array}
if D < 3.5499999999999998Initial program 82.5%
Simplified75.2%
Taylor expanded in h around 0
Simplified77.0%
if 3.5499999999999998 < D Initial program 72.7%
Simplified67.8%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6448.4%
Simplified48.4%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.7%
Applied egg-rr63.7%
Final simplification73.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= d 5.4e-49)
(*
w0
(+ 1.0 (* (/ (* D_m D_m) (* d l)) (* h (/ (* (* M_m M_m) -0.125) d)))))
w0))M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (d <= 5.4e-49) {
tmp = w0 * (1.0 + (((D_m * D_m) / (d * l)) * (h * (((M_m * M_m) * -0.125) / d))));
} else {
tmp = w0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (d <= 5.4d-49) then
tmp = w0 * (1.0d0 + (((d_m * d_m) / (d * l)) * (h * (((m_m * m_m) * (-0.125d0)) / d))))
else
tmp = w0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (d <= 5.4e-49) {
tmp = w0 * (1.0 + (((D_m * D_m) / (d * l)) * (h * (((M_m * M_m) * -0.125) / d))));
} else {
tmp = w0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if d <= 5.4e-49: tmp = w0 * (1.0 + (((D_m * D_m) / (d * l)) * (h * (((M_m * M_m) * -0.125) / d)))) else: tmp = w0 return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (d <= 5.4e-49) tmp = Float64(w0 * Float64(1.0 + Float64(Float64(Float64(D_m * D_m) / Float64(d * l)) * Float64(h * Float64(Float64(Float64(M_m * M_m) * -0.125) / d))))); else tmp = w0; end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (d <= 5.4e-49)
tmp = w0 * (1.0 + (((D_m * D_m) / (d * l)) * (h * (((M_m * M_m) * -0.125) / d))));
else
tmp = w0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[d, 5.4e-49], N[(w0 * N[(1.0 + N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] / N[(d * l), $MachinePrecision]), $MachinePrecision] * N[(h * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], w0]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq 5.4 \cdot 10^{-49}:\\
\;\;\;\;w0 \cdot \left(1 + \frac{D\_m \cdot D\_m}{d \cdot \ell} \cdot \left(h \cdot \frac{\left(M\_m \cdot M\_m\right) \cdot -0.125}{d}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if d < 5.3999999999999999e-49Initial program 77.1%
Simplified70.5%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6455.3%
Simplified55.3%
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6461.6%
Applied egg-rr61.6%
if 5.3999999999999999e-49 < d Initial program 86.9%
Simplified79.8%
Taylor expanded in h around 0
Simplified84.3%
Final simplification68.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= M_m 4e-96)
w0
(*
w0
(+ 1.0 (* (* D_m D_m) (* (* M_m -0.125) (* M_m (/ h (* d (* d l))))))))))M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 4e-96) {
tmp = w0;
} else {
tmp = w0 * (1.0 + ((D_m * D_m) * ((M_m * -0.125) * (M_m * (h / (d * (d * l)))))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (m_m <= 4d-96) then
tmp = w0
else
tmp = w0 * (1.0d0 + ((d_m * d_m) * ((m_m * (-0.125d0)) * (m_m * (h / (d * (d * l)))))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 4e-96) {
tmp = w0;
} else {
tmp = w0 * (1.0 + ((D_m * D_m) * ((M_m * -0.125) * (M_m * (h / (d * (d * l)))))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if M_m <= 4e-96: tmp = w0 else: tmp = w0 * (1.0 + ((D_m * D_m) * ((M_m * -0.125) * (M_m * (h / (d * (d * l))))))) return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (M_m <= 4e-96) tmp = w0; else tmp = Float64(w0 * Float64(1.0 + Float64(Float64(D_m * D_m) * Float64(Float64(M_m * -0.125) * Float64(M_m * Float64(h / Float64(d * Float64(d * l)))))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (M_m <= 4e-96)
tmp = w0;
else
tmp = w0 * (1.0 + ((D_m * D_m) * ((M_m * -0.125) * (M_m * (h / (d * (d * l)))))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[M$95$m, 4e-96], w0, N[(w0 * N[(1.0 + N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(M$95$m * -0.125), $MachinePrecision] * N[(M$95$m * N[(h / N[(d * N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 4 \cdot 10^{-96}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(1 + \left(D\_m \cdot D\_m\right) \cdot \left(\left(M\_m \cdot -0.125\right) \cdot \left(M\_m \cdot \frac{h}{d \cdot \left(d \cdot \ell\right)}\right)\right)\right)\\
\end{array}
\end{array}
if M < 3.9999999999999996e-96Initial program 79.8%
Simplified74.3%
Taylor expanded in h around 0
Simplified71.1%
if 3.9999999999999996e-96 < M Initial program 81.1%
Simplified71.6%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.6%
Simplified50.6%
associate-/l*N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6474.2%
Applied egg-rr74.2%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= M_m 4.7e+50) w0 (* (/ (* (* M_m M_m) -0.125) d) (* w0 (* (/ D_m d) (* h (/ D_m l)))))))
M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 4.7e+50) {
tmp = w0;
} else {
tmp = (((M_m * M_m) * -0.125) / d) * (w0 * ((D_m / d) * (h * (D_m / l))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (m_m <= 4.7d+50) then
tmp = w0
else
tmp = (((m_m * m_m) * (-0.125d0)) / d) * (w0 * ((d_m / d) * (h * (d_m / l))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 4.7e+50) {
tmp = w0;
} else {
tmp = (((M_m * M_m) * -0.125) / d) * (w0 * ((D_m / d) * (h * (D_m / l))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if M_m <= 4.7e+50: tmp = w0 else: tmp = (((M_m * M_m) * -0.125) / d) * (w0 * ((D_m / d) * (h * (D_m / l)))) return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (M_m <= 4.7e+50) tmp = w0; else tmp = Float64(Float64(Float64(Float64(M_m * M_m) * -0.125) / d) * Float64(w0 * Float64(Float64(D_m / d) * Float64(h * Float64(D_m / l))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (M_m <= 4.7e+50)
tmp = w0;
else
tmp = (((M_m * M_m) * -0.125) / d) * (w0 * ((D_m / d) * (h * (D_m / l))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[M$95$m, 4.7e+50], w0, N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * -0.125), $MachinePrecision] / d), $MachinePrecision] * N[(w0 * N[(N[(D$95$m / d), $MachinePrecision] * N[(h * N[(D$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 4.7 \cdot 10^{+50}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(M\_m \cdot M\_m\right) \cdot -0.125}{d} \cdot \left(w0 \cdot \left(\frac{D\_m}{d} \cdot \left(h \cdot \frac{D\_m}{\ell}\right)\right)\right)\\
\end{array}
\end{array}
if M < 4.69999999999999974e50Initial program 80.9%
Simplified76.2%
Taylor expanded in h around 0
Simplified72.5%
if 4.69999999999999974e50 < M Initial program 77.6%
Simplified62.4%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.0%
Simplified35.0%
Taylor expanded in D around inf
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6418.0%
Simplified18.0%
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
*-commutativeN/A
associate-/l*N/A
associate-*l/N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr22.6%
Final simplification62.6%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= M_m 5.7e+50) w0 (* w0 (* (/ D_m d) (* (/ D_m l) (* -0.125 (* h (* M_m (/ M_m d)))))))))
M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 5.7e+50) {
tmp = w0;
} else {
tmp = w0 * ((D_m / d) * ((D_m / l) * (-0.125 * (h * (M_m * (M_m / d))))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (m_m <= 5.7d+50) then
tmp = w0
else
tmp = w0 * ((d_m / d) * ((d_m / l) * ((-0.125d0) * (h * (m_m * (m_m / d))))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 5.7e+50) {
tmp = w0;
} else {
tmp = w0 * ((D_m / d) * ((D_m / l) * (-0.125 * (h * (M_m * (M_m / d))))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if M_m <= 5.7e+50: tmp = w0 else: tmp = w0 * ((D_m / d) * ((D_m / l) * (-0.125 * (h * (M_m * (M_m / d)))))) return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (M_m <= 5.7e+50) tmp = w0; else tmp = Float64(w0 * Float64(Float64(D_m / d) * Float64(Float64(D_m / l) * Float64(-0.125 * Float64(h * Float64(M_m * Float64(M_m / d))))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (M_m <= 5.7e+50)
tmp = w0;
else
tmp = w0 * ((D_m / d) * ((D_m / l) * (-0.125 * (h * (M_m * (M_m / d))))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[M$95$m, 5.7e+50], w0, N[(w0 * N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(D$95$m / l), $MachinePrecision] * N[(-0.125 * N[(h * N[(M$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 5.7 \cdot 10^{+50}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(\frac{D\_m}{d} \cdot \left(\frac{D\_m}{\ell} \cdot \left(-0.125 \cdot \left(h \cdot \left(M\_m \cdot \frac{M\_m}{d}\right)\right)\right)\right)\right)\\
\end{array}
\end{array}
if M < 5.7000000000000002e50Initial program 80.9%
Simplified76.2%
Taylor expanded in h around 0
Simplified72.5%
if 5.7000000000000002e50 < M Initial program 77.6%
Simplified62.4%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.0%
Simplified35.0%
Taylor expanded in D around inf
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6418.0%
Simplified18.0%
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
*-commutativeN/A
associate-/l*N/A
associate-*l/N/A
times-fracN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
Applied egg-rr23.2%
Final simplification62.7%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= M_m 3.5e+45) w0 (* w0 (* D_m (* (* -0.125 (* h (* M_m (/ M_m d)))) (/ D_m (* d l)))))))
M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 3.5e+45) {
tmp = w0;
} else {
tmp = w0 * (D_m * ((-0.125 * (h * (M_m * (M_m / d)))) * (D_m / (d * l))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (m_m <= 3.5d+45) then
tmp = w0
else
tmp = w0 * (d_m * (((-0.125d0) * (h * (m_m * (m_m / d)))) * (d_m / (d * l))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 3.5e+45) {
tmp = w0;
} else {
tmp = w0 * (D_m * ((-0.125 * (h * (M_m * (M_m / d)))) * (D_m / (d * l))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if M_m <= 3.5e+45: tmp = w0 else: tmp = w0 * (D_m * ((-0.125 * (h * (M_m * (M_m / d)))) * (D_m / (d * l)))) return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (M_m <= 3.5e+45) tmp = w0; else tmp = Float64(w0 * Float64(D_m * Float64(Float64(-0.125 * Float64(h * Float64(M_m * Float64(M_m / d)))) * Float64(D_m / Float64(d * l))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (M_m <= 3.5e+45)
tmp = w0;
else
tmp = w0 * (D_m * ((-0.125 * (h * (M_m * (M_m / d)))) * (D_m / (d * l))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[M$95$m, 3.5e+45], w0, N[(w0 * N[(D$95$m * N[(N[(-0.125 * N[(h * N[(M$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 3.5 \cdot 10^{+45}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \left(D\_m \cdot \left(\left(-0.125 \cdot \left(h \cdot \left(M\_m \cdot \frac{M\_m}{d}\right)\right)\right) \cdot \frac{D\_m}{d \cdot \ell}\right)\right)\\
\end{array}
\end{array}
if M < 3.50000000000000023e45Initial program 80.9%
Simplified76.2%
Taylor expanded in h around 0
Simplified72.5%
if 3.50000000000000023e45 < M Initial program 77.6%
Simplified62.4%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.0%
Simplified35.0%
Taylor expanded in D around inf
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6418.0%
Simplified18.0%
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
*-commutativeN/A
associate-/l*N/A
associate-*l/N/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr20.9%
Final simplification62.3%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= M_m 5.6e+45) w0 (* D_m (* w0 (/ D_m (/ (* l (* d d)) (* M_m (* M_m (* h -0.125)))))))))
M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 5.6e+45) {
tmp = w0;
} else {
tmp = D_m * (w0 * (D_m / ((l * (d * d)) / (M_m * (M_m * (h * -0.125))))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (m_m <= 5.6d+45) then
tmp = w0
else
tmp = d_m * (w0 * (d_m / ((l * (d * d)) / (m_m * (m_m * (h * (-0.125d0)))))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 5.6e+45) {
tmp = w0;
} else {
tmp = D_m * (w0 * (D_m / ((l * (d * d)) / (M_m * (M_m * (h * -0.125))))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if M_m <= 5.6e+45: tmp = w0 else: tmp = D_m * (w0 * (D_m / ((l * (d * d)) / (M_m * (M_m * (h * -0.125)))))) return tmp
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (M_m <= 5.6e+45) tmp = w0; else tmp = Float64(D_m * Float64(w0 * Float64(D_m / Float64(Float64(l * Float64(d * d)) / Float64(M_m * Float64(M_m * Float64(h * -0.125))))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (M_m <= 5.6e+45)
tmp = w0;
else
tmp = D_m * (w0 * (D_m / ((l * (d * d)) / (M_m * (M_m * (h * -0.125))))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[M$95$m, 5.6e+45], w0, N[(D$95$m * N[(w0 * N[(D$95$m / N[(N[(l * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(M$95$m * N[(M$95$m * N[(h * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 5.6 \cdot 10^{+45}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;D\_m \cdot \left(w0 \cdot \frac{D\_m}{\frac{\ell \cdot \left(d \cdot d\right)}{M\_m \cdot \left(M\_m \cdot \left(h \cdot -0.125\right)\right)}}\right)\\
\end{array}
\end{array}
if M < 5.5999999999999999e45Initial program 80.9%
Simplified76.2%
Taylor expanded in h around 0
Simplified72.5%
if 5.5999999999999999e45 < M Initial program 77.6%
Simplified62.4%
Taylor expanded in h around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.0%
Simplified35.0%
Taylor expanded in D around inf
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6418.0%
Simplified18.0%
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
Applied egg-rr20.4%
Final simplification62.1%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 w0)
M_m = fabs(M);
D_m = fabs(D);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
return w0;
}
M_m = abs(m)
D_m = abs(d)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
code = w0
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
return w0;
}
M_m = math.fabs(M) D_m = math.fabs(D) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): return w0
M_m = abs(M) D_m = abs(D) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) return w0 end
M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp = code(w0, M_m, D_m, h, l, d)
tmp = w0;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := w0
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
w0
\end{array}
Initial program 80.2%
Simplified73.4%
Taylor expanded in h around 0
Simplified69.8%
herbie shell --seed 2024163
(FPCore (w0 M D h l d)
:name "Henrywood and Agarwal, Equation (9a)"
:precision binary64
(* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))