
(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 11 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 (/ D_m (/ d M_m)))) (* w0 (sqrt (+ 1.0 (/ (/ t_0 (/ (/ -4.0 h) t_0)) 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 t_0 = D_m / (d / M_m);
return w0 * sqrt((1.0 + ((t_0 / ((-4.0 / h) / t_0)) / l)));
}
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
t_0 = d_m / (d / m_m)
code = w0 * sqrt((1.0d0 + ((t_0 / (((-4.0d0) / h) / t_0)) / l)))
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 / M_m);
return w0 * Math.sqrt((1.0 + ((t_0 / ((-4.0 / h) / t_0)) / l)));
}
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 / M_m) return w0 * math.sqrt((1.0 + ((t_0 / ((-4.0 / h) / t_0)) / l)))
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(D_m / Float64(d / M_m)) return Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(t_0 / Float64(Float64(-4.0 / h) / t_0)) / l)))) 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)
t_0 = D_m / (d / M_m);
tmp = w0 * sqrt((1.0 + ((t_0 / ((-4.0 / h) / t_0)) / l)));
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[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision]}, N[(w0 * N[Sqrt[N[(1.0 + N[(N[(t$95$0 / N[(N[(-4.0 / h), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / l), $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}{\frac{d}{M\_m}}\\
w0 \cdot \sqrt{1 + \frac{\frac{t\_0}{\frac{\frac{-4}{h}}{t\_0}}}{\ell}}
\end{array}
\end{array}
Initial program 78.7%
Simplified79.3%
associate-*r*N/A
associate-/l/N/A
times-fracN/A
associate-*r*N/A
*-lowering-*.f64N/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-/.f6482.0%
Applied egg-rr82.0%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
clear-numN/A
associate-*l/N/A
*-lft-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f6486.2%
Applied egg-rr86.2%
associate-/r/N/A
associate-/l*N/A
associate-*l/N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6488.5%
Applied egg-rr88.5%
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
clear-numN/A
clear-numN/A
frac-timesN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6489.2%
Applied egg-rr89.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 (let* ((t_0 (/ D_m (/ d M_m)))) (* w0 (sqrt (+ 1.0 (* (* t_0 (/ h -4.0)) (/ t_0 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 t_0 = D_m / (d / M_m);
return w0 * sqrt((1.0 + ((t_0 * (h / -4.0)) * (t_0 / l))));
}
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
t_0 = d_m / (d / m_m)
code = w0 * sqrt((1.0d0 + ((t_0 * (h / (-4.0d0))) * (t_0 / l))))
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 / M_m);
return w0 * Math.sqrt((1.0 + ((t_0 * (h / -4.0)) * (t_0 / l))));
}
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 / M_m) return w0 * math.sqrt((1.0 + ((t_0 * (h / -4.0)) * (t_0 / l))))
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(D_m / Float64(d / M_m)) return Float64(w0 * sqrt(Float64(1.0 + Float64(Float64(t_0 * Float64(h / -4.0)) * Float64(t_0 / l))))) 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)
t_0 = D_m / (d / M_m);
tmp = w0 * sqrt((1.0 + ((t_0 * (h / -4.0)) * (t_0 / l))));
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[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision]}, N[(w0 * N[Sqrt[N[(1.0 + N[(N[(t$95$0 * N[(h / -4.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / 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}
t_0 := \frac{D\_m}{\frac{d}{M\_m}}\\
w0 \cdot \sqrt{1 + \left(t\_0 \cdot \frac{h}{-4}\right) \cdot \frac{t\_0}{\ell}}
\end{array}
\end{array}
Initial program 78.7%
Simplified79.3%
associate-*r*N/A
associate-/l/N/A
times-fracN/A
associate-*r*N/A
*-lowering-*.f64N/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-/.f6482.0%
Applied egg-rr82.0%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/r/N/A
clear-numN/A
associate-*l/N/A
*-lft-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f6486.2%
Applied egg-rr86.2%
associate-/r/N/A
associate-/l*N/A
associate-*l/N/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6488.5%
Applied egg-rr88.5%
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 (<= d 2e-98)
(+ w0 (* (/ -0.125 l) (/ (/ (* h (* (* D_m D_m) (* M_m (* w0 M_m)))) d) d)))
(+
w0
(* (/ -0.125 l) (* (/ D_m d) (* (/ D_m d) (* w0 (* h (* M_m 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 tmp;
if (d <= 2e-98) {
tmp = w0 + ((-0.125 / l) * (((h * ((D_m * D_m) * (M_m * (w0 * M_m)))) / d) / d));
} else {
tmp = w0 + ((-0.125 / l) * ((D_m / d) * ((D_m / d) * (w0 * (h * (M_m * 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) :: tmp
if (d <= 2d-98) then
tmp = w0 + (((-0.125d0) / l) * (((h * ((d_m * d_m) * (m_m * (w0 * m_m)))) / d) / d))
else
tmp = w0 + (((-0.125d0) / l) * ((d_m / d) * ((d_m / d) * (w0 * (h * (m_m * 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 tmp;
if (d <= 2e-98) {
tmp = w0 + ((-0.125 / l) * (((h * ((D_m * D_m) * (M_m * (w0 * M_m)))) / d) / d));
} else {
tmp = w0 + ((-0.125 / l) * ((D_m / d) * ((D_m / d) * (w0 * (h * (M_m * 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): tmp = 0 if d <= 2e-98: tmp = w0 + ((-0.125 / l) * (((h * ((D_m * D_m) * (M_m * (w0 * M_m)))) / d) / d)) else: tmp = w0 + ((-0.125 / l) * ((D_m / d) * ((D_m / d) * (w0 * (h * (M_m * 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) tmp = 0.0 if (d <= 2e-98) tmp = Float64(w0 + Float64(Float64(-0.125 / l) * Float64(Float64(Float64(h * Float64(Float64(D_m * D_m) * Float64(M_m * Float64(w0 * M_m)))) / d) / d))); else tmp = Float64(w0 + Float64(Float64(-0.125 / l) * Float64(Float64(D_m / d) * Float64(Float64(D_m / d) * Float64(w0 * Float64(h * Float64(M_m * 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)
tmp = 0.0;
if (d <= 2e-98)
tmp = w0 + ((-0.125 / l) * (((h * ((D_m * D_m) * (M_m * (w0 * M_m)))) / d) / d));
else
tmp = w0 + ((-0.125 / l) * ((D_m / d) * ((D_m / d) * (w0 * (h * (M_m * 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_] := If[LessEqual[d, 2e-98], N[(w0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(N[(h * N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(M$95$m * N[(w0 * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(w0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * N[(w0 * N[(h * N[(M$95$m * M$95$m), $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}\;d \leq 2 \cdot 10^{-98}:\\
\;\;\;\;w0 + \frac{-0.125}{\ell} \cdot \frac{\frac{h \cdot \left(\left(D\_m \cdot D\_m\right) \cdot \left(M\_m \cdot \left(w0 \cdot M\_m\right)\right)\right)}{d}}{d}\\
\mathbf{else}:\\
\;\;\;\;w0 + \frac{-0.125}{\ell} \cdot \left(\frac{D\_m}{d} \cdot \left(\frac{D\_m}{d} \cdot \left(w0 \cdot \left(h \cdot \left(M\_m \cdot M\_m\right)\right)\right)\right)\right)\\
\end{array}
\end{array}
if d < 1.99999999999999988e-98Initial program 76.2%
Simplified79.0%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6441.2%
Simplified41.2%
associate-*r/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6457.6%
Applied egg-rr57.6%
if 1.99999999999999988e-98 < d Initial program 83.0%
Simplified80.0%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6462.5%
Simplified62.5%
associate-*r/N/A
times-fracN/A
clear-numN/A
un-div-invN/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
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6469.0%
Applied egg-rr69.0%
associate-/l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
clear-numN/A
/-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6471.7%
Applied egg-rr71.7%
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 (<= d 4e-79)
(+ w0 (* (/ -0.125 l) (* (* w0 D_m) (* D_m (/ (* M_m h) (/ d (/ M_m d)))))))
(+
w0
(* (/ -0.125 l) (* (/ D_m d) (* (/ D_m d) (* w0 (* h (* M_m 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 tmp;
if (d <= 4e-79) {
tmp = w0 + ((-0.125 / l) * ((w0 * D_m) * (D_m * ((M_m * h) / (d / (M_m / d))))));
} else {
tmp = w0 + ((-0.125 / l) * ((D_m / d) * ((D_m / d) * (w0 * (h * (M_m * 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) :: tmp
if (d <= 4d-79) then
tmp = w0 + (((-0.125d0) / l) * ((w0 * d_m) * (d_m * ((m_m * h) / (d / (m_m / d))))))
else
tmp = w0 + (((-0.125d0) / l) * ((d_m / d) * ((d_m / d) * (w0 * (h * (m_m * 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 tmp;
if (d <= 4e-79) {
tmp = w0 + ((-0.125 / l) * ((w0 * D_m) * (D_m * ((M_m * h) / (d / (M_m / d))))));
} else {
tmp = w0 + ((-0.125 / l) * ((D_m / d) * ((D_m / d) * (w0 * (h * (M_m * 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): tmp = 0 if d <= 4e-79: tmp = w0 + ((-0.125 / l) * ((w0 * D_m) * (D_m * ((M_m * h) / (d / (M_m / d)))))) else: tmp = w0 + ((-0.125 / l) * ((D_m / d) * ((D_m / d) * (w0 * (h * (M_m * 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) tmp = 0.0 if (d <= 4e-79) tmp = Float64(w0 + Float64(Float64(-0.125 / l) * Float64(Float64(w0 * D_m) * Float64(D_m * Float64(Float64(M_m * h) / Float64(d / Float64(M_m / d))))))); else tmp = Float64(w0 + Float64(Float64(-0.125 / l) * Float64(Float64(D_m / d) * Float64(Float64(D_m / d) * Float64(w0 * Float64(h * Float64(M_m * 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)
tmp = 0.0;
if (d <= 4e-79)
tmp = w0 + ((-0.125 / l) * ((w0 * D_m) * (D_m * ((M_m * h) / (d / (M_m / d))))));
else
tmp = w0 + ((-0.125 / l) * ((D_m / d) * ((D_m / d) * (w0 * (h * (M_m * 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_] := If[LessEqual[d, 4e-79], N[(w0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(w0 * D$95$m), $MachinePrecision] * N[(D$95$m * N[(N[(M$95$m * h), $MachinePrecision] / N[(d / N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(w0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * N[(w0 * N[(h * N[(M$95$m * M$95$m), $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}\;d \leq 4 \cdot 10^{-79}:\\
\;\;\;\;w0 + \frac{-0.125}{\ell} \cdot \left(\left(w0 \cdot D\_m\right) \cdot \left(D\_m \cdot \frac{M\_m \cdot h}{\frac{d}{\frac{M\_m}{d}}}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;w0 + \frac{-0.125}{\ell} \cdot \left(\frac{D\_m}{d} \cdot \left(\frac{D\_m}{d} \cdot \left(w0 \cdot \left(h \cdot \left(M\_m \cdot M\_m\right)\right)\right)\right)\right)\\
\end{array}
\end{array}
if d < 4e-79Initial program 76.4%
Simplified79.1%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6441.5%
Simplified41.5%
associate-*r/N/A
times-fracN/A
clear-numN/A
un-div-invN/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
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6458.0%
Applied egg-rr58.0%
associate-/l*N/A
associate-/l*N/A
div-invN/A
clear-numN/A
clear-numN/A
associate-/r*N/A
*-commutativeN/A
associate-/r*N/A
associate-/r*N/A
clear-numN/A
times-fracN/A
associate-/l*N/A
clear-numN/A
Applied egg-rr62.4%
if 4e-79 < d Initial program 82.8%
Simplified79.7%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6462.1%
Simplified62.1%
associate-*r/N/A
times-fracN/A
clear-numN/A
un-div-invN/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
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6468.7%
Applied egg-rr68.7%
associate-/l*N/A
div-invN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
div-invN/A
clear-numN/A
/-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6471.4%
Applied egg-rr71.4%
Final simplification65.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 (<= d 8.5e-28) (+ w0 (* (/ -0.125 l) (* (* w0 D_m) (* D_m (/ (* M_m h) (/ d (/ M_m 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 <= 8.5e-28) {
tmp = w0 + ((-0.125 / l) * ((w0 * D_m) * (D_m * ((M_m * h) / (d / (M_m / 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 <= 8.5d-28) then
tmp = w0 + (((-0.125d0) / l) * ((w0 * d_m) * (d_m * ((m_m * h) / (d / (m_m / 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 <= 8.5e-28) {
tmp = w0 + ((-0.125 / l) * ((w0 * D_m) * (D_m * ((M_m * h) / (d / (M_m / 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 <= 8.5e-28: tmp = w0 + ((-0.125 / l) * ((w0 * D_m) * (D_m * ((M_m * h) / (d / (M_m / 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 <= 8.5e-28) tmp = Float64(w0 + Float64(Float64(-0.125 / l) * Float64(Float64(w0 * D_m) * Float64(D_m * Float64(Float64(M_m * h) / Float64(d / Float64(M_m / 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 <= 8.5e-28)
tmp = w0 + ((-0.125 / l) * ((w0 * D_m) * (D_m * ((M_m * h) / (d / (M_m / 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, 8.5e-28], N[(w0 + N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(w0 * D$95$m), $MachinePrecision] * N[(D$95$m * N[(N[(M$95$m * h), $MachinePrecision] / N[(d / N[(M$95$m / d), $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}\;d \leq 8.5 \cdot 10^{-28}:\\
\;\;\;\;w0 + \frac{-0.125}{\ell} \cdot \left(\left(w0 \cdot D\_m\right) \cdot \left(D\_m \cdot \frac{M\_m \cdot h}{\frac{d}{\frac{M\_m}{d}}}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if d < 8.49999999999999925e-28Initial program 76.0%
Simplified78.7%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6441.4%
Simplified41.4%
associate-*r/N/A
times-fracN/A
clear-numN/A
un-div-invN/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
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6457.6%
Applied egg-rr57.6%
associate-/l*N/A
associate-/l*N/A
div-invN/A
clear-numN/A
clear-numN/A
associate-/r*N/A
*-commutativeN/A
associate-/r*N/A
associate-/r*N/A
clear-numN/A
times-fracN/A
associate-/l*N/A
clear-numN/A
Applied egg-rr62.4%
if 8.49999999999999925e-28 < d Initial program 84.3%
Simplified80.8%
Taylor expanded in h around 0
Simplified82.0%
Final simplification68.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 2.3e+49) w0 (/ (* M_m (/ (* M_m (* w0 (* D_m h))) (/ d (/ D_m -8.0)))) (* 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 <= 2.3e+49) {
tmp = w0;
} else {
tmp = (M_m * ((M_m * (w0 * (D_m * h))) / (d / (D_m / -8.0)))) / (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 <= 2.3d+49) then
tmp = w0
else
tmp = (m_m * ((m_m * (w0 * (d_m * h))) / (d / (d_m / (-8.0d0))))) / (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 <= 2.3e+49) {
tmp = w0;
} else {
tmp = (M_m * ((M_m * (w0 * (D_m * h))) / (d / (D_m / -8.0)))) / (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 <= 2.3e+49: tmp = w0 else: tmp = (M_m * ((M_m * (w0 * (D_m * h))) / (d / (D_m / -8.0)))) / (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 <= 2.3e+49) tmp = w0; else tmp = Float64(Float64(M_m * Float64(Float64(M_m * Float64(w0 * Float64(D_m * h))) / Float64(d / Float64(D_m / -8.0)))) / 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 <= 2.3e+49)
tmp = w0;
else
tmp = (M_m * ((M_m * (w0 * (D_m * h))) / (d / (D_m / -8.0)))) / (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, 2.3e+49], w0, N[(N[(M$95$m * N[(N[(M$95$m * N[(w0 * N[(D$95$m * h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d / N[(D$95$m / -8.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d * l), $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 2.3 \cdot 10^{+49}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\frac{M\_m \cdot \frac{M\_m \cdot \left(w0 \cdot \left(D\_m \cdot h\right)\right)}{\frac{d}{\frac{D\_m}{-8}}}}{d \cdot \ell}\\
\end{array}
\end{array}
if M < 2.30000000000000002e49Initial program 80.1%
Simplified82.8%
Taylor expanded in h around 0
Simplified74.7%
if 2.30000000000000002e49 < M Initial program 73.2%
Simplified66.5%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6429.0%
Simplified29.0%
Taylor expanded in l around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.6%
Simplified24.6%
associate-*l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr32.2%
associate-/l*N/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6425.6%
Applied egg-rr25.6%
Final simplification64.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 2.2e+52) 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 <= 2.2e+52) {
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 <= 2.2d+52) 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 <= 2.2e+52) {
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 <= 2.2e+52: 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 <= 2.2e+52) tmp = w0; else tmp = Float64(Float64(Float64(Float64(w0 * D_m) * Float64(-0.125 * Float64(h * Float64(M_m * 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 <= 2.2e+52)
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, 2.2e+52], w0, N[(N[(N[(N[(w0 * D$95$m), $MachinePrecision] * N[(-0.125 * N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * N[(D$95$m / N[(d * l), $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 2.2 \cdot 10^{+52}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(w0 \cdot D\_m\right) \cdot \left(-0.125 \cdot \left(h \cdot \left(M\_m \cdot M\_m\right)\right)\right)}{d} \cdot \frac{D\_m}{d \cdot \ell}\\
\end{array}
\end{array}
if M < 2.2e52Initial program 80.1%
Simplified82.8%
Taylor expanded in h around 0
Simplified74.7%
if 2.2e52 < M Initial program 73.2%
Simplified66.5%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6429.0%
Simplified29.0%
Taylor expanded in l around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.6%
Simplified24.6%
associate-*r*N/A
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr32.2%
Final simplification65.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 2.25e+49) w0 (* (/ -0.125 d) (/ (* (* h (* M_m M_m)) (* w0 (* D_m 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 <= 2.25e+49) {
tmp = w0;
} else {
tmp = (-0.125 / d) * (((h * (M_m * M_m)) * (w0 * (D_m * 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 <= 2.25d+49) then
tmp = w0
else
tmp = ((-0.125d0) / d) * (((h * (m_m * m_m)) * (w0 * (d_m * 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 <= 2.25e+49) {
tmp = w0;
} else {
tmp = (-0.125 / d) * (((h * (M_m * M_m)) * (w0 * (D_m * 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 <= 2.25e+49: tmp = w0 else: tmp = (-0.125 / d) * (((h * (M_m * M_m)) * (w0 * (D_m * 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 <= 2.25e+49) tmp = w0; else tmp = Float64(Float64(-0.125 / d) * Float64(Float64(Float64(h * Float64(M_m * M_m)) * Float64(w0 * Float64(D_m * 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 <= 2.25e+49)
tmp = w0;
else
tmp = (-0.125 / d) * (((h * (M_m * M_m)) * (w0 * (D_m * 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, 2.25e+49], w0, N[(N[(-0.125 / d), $MachinePrecision] * N[(N[(N[(h * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(w0 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d * l), $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 2.25 \cdot 10^{+49}:\\
\;\;\;\;w0\\
\mathbf{else}:\\
\;\;\;\;\frac{-0.125}{d} \cdot \frac{\left(h \cdot \left(M\_m \cdot M\_m\right)\right) \cdot \left(w0 \cdot \left(D\_m \cdot D\_m\right)\right)}{d \cdot \ell}\\
\end{array}
\end{array}
if M < 2.24999999999999991e49Initial program 80.1%
Simplified82.8%
Taylor expanded in h around 0
Simplified74.7%
if 2.24999999999999991e49 < M Initial program 73.2%
Simplified66.5%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6429.0%
Simplified29.0%
Taylor expanded in l around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.6%
Simplified24.6%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6422.4%
Applied egg-rr22.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 4.4e-209) (/ d (/ d w0)) 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 <= 4.4e-209) {
tmp = d / (d / w0);
} 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 <= 4.4d-209) then
tmp = d / (d / w0)
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 <= 4.4e-209) {
tmp = d / (d / w0);
} 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 <= 4.4e-209: tmp = d / (d / w0) 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 <= 4.4e-209) tmp = Float64(d / Float64(d / w0)); 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 <= 4.4e-209)
tmp = d / (d / w0);
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, 4.4e-209], N[(d / N[(d / w0), $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 4.4 \cdot 10^{-209}:\\
\;\;\;\;\frac{d}{\frac{d}{w0}}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if d < 4.40000000000000019e-209Initial program 76.4%
Simplified80.1%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6442.2%
Simplified42.2%
Taylor expanded in d around 0
/-lowering-/.f64N/A
Simplified29.8%
Taylor expanded in d around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6420.2%
Simplified20.2%
*-commutativeN/A
times-fracN/A
clear-numN/A
un-div-invN/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
/-lowering-/.f6457.4%
Applied egg-rr57.4%
if 4.40000000000000019e-209 < d Initial program 81.5%
Simplified78.3%
Taylor expanded in h around 0
Simplified76.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 (<= d 4.6e-199) (* d (/ w0 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 <= 4.6e-199) {
tmp = d * (w0 / 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 <= 4.6d-199) then
tmp = d * (w0 / 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 <= 4.6e-199) {
tmp = d * (w0 / 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 <= 4.6e-199: tmp = d * (w0 / 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 <= 4.6e-199) tmp = Float64(d * Float64(w0 / 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 <= 4.6e-199)
tmp = d * (w0 / 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, 4.6e-199], N[(d * N[(w0 / d), $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 4.6 \cdot 10^{-199}:\\
\;\;\;\;d \cdot \frac{w0}{d}\\
\mathbf{else}:\\
\;\;\;\;w0\\
\end{array}
\end{array}
if d < 4.6000000000000003e-199Initial program 76.3%
Simplified80.0%
Taylor expanded in h around 0
+-lowering-+.f64N/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6441.5%
Simplified41.5%
Taylor expanded in d around 0
/-lowering-/.f64N/A
Simplified29.3%
Taylor expanded in d around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6419.8%
Simplified19.8%
times-fracN/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f6458.7%
Applied egg-rr58.7%
if 4.6000000000000003e-199 < d Initial program 82.0%
Simplified78.5%
Taylor expanded in h around 0
Simplified76.9%
Final simplification66.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 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 78.7%
Simplified79.3%
Taylor expanded in h around 0
Simplified68.3%
herbie shell --seed 2024164
(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))))))