
(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 12 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}
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
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
(*
(sqrt
(fma
(* D_m (* M_m (/ 0.5 d)))
(/ (* (* h (/ M_m d)) (* D_m 0.5)) (- l))
1.0))
w0))D_m = fabs(D);
M_m = fabs(M);
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 sqrt(fma((D_m * (M_m * (0.5 / d))), (((h * (M_m / d)) * (D_m * 0.5)) / -l), 1.0)) * w0;
}
D_m = abs(D) M_m = abs(M) 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 Float64(sqrt(fma(Float64(D_m * Float64(M_m * Float64(0.5 / d))), Float64(Float64(Float64(h * Float64(M_m / d)) * Float64(D_m * 0.5)) / Float64(-l)), 1.0)) * w0) end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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_] := N[(N[Sqrt[N[(N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * 0.5), $MachinePrecision]), $MachinePrecision] / (-l)), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\sqrt{\mathsf{fma}\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right), \frac{\left(h \cdot \frac{M\_m}{d}\right) \cdot \left(D\_m \cdot 0.5\right)}{-\ell}, 1\right)} \cdot w0
\end{array}
Initial program 81.4%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites85.8%
Final simplification85.8%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) 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) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) -50000000.0) (* (sqrt (* (* -0.25 h) (* (* (/ M_m d) D_m) (/ (* D_m M_m) (* l d))))) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
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) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -50000000.0) {
tmp = sqrt(((-0.25 * h) * (((M_m / d) * D_m) * ((D_m * M_m) / (l * d))))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
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) * (((d_m * m_m) / (2.0d0 * d)) ** 2.0d0)) <= (-50000000.0d0)) then
tmp = sqrt((((-0.25d0) * h) * (((m_m / d) * d_m) * ((d_m * m_m) / (l * d))))) * w0
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
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) * Math.pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -50000000.0) {
tmp = Math.sqrt(((-0.25 * h) * (((M_m / d) * D_m) * ((D_m * M_m) / (l * d))))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [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.pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -50000000.0: tmp = math.sqrt(((-0.25 * h) * (((M_m / d) * D_m) * ((D_m * M_m) / (l * d))))) * w0 else: tmp = 1.0 * w0 return tmp
D_m = abs(D) M_m = abs(M) 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(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -50000000.0) tmp = Float64(sqrt(Float64(Float64(-0.25 * h) * Float64(Float64(Float64(M_m / d) * D_m) * Float64(Float64(D_m * M_m) / Float64(l * d))))) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
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) * (((D_m * M_m) / (2.0 * d)) ^ 2.0)) <= -50000000.0)
tmp = sqrt(((-0.25 * h) * (((M_m / d) * D_m) * ((D_m * M_m) / (l * d))))) * w0;
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -50000000.0], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(M$95$m / d), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\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} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -50000000:\\
\;\;\;\;\sqrt{\left(-0.25 \cdot h\right) \cdot \left(\left(\frac{M\_m}{d} \cdot D\_m\right) \cdot \frac{D\_m \cdot M\_m}{\ell \cdot d}\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\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)) < -5e7Initial program 61.9%
Taylor expanded in h around inf
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites45.3%
Applied rewrites48.0%
Applied rewrites50.4%
Applied rewrites62.0%
if -5e7 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.0%
Taylor expanded in h around 0
Applied rewrites94.7%
Final simplification84.7%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) 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) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) -50000000.0) (* (sqrt (* (* (* (/ D_m (* (* l d) d)) (* D_m M_m)) M_m) (* -0.25 h))) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
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) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -50000000.0) {
tmp = sqrt(((((D_m / ((l * d) * d)) * (D_m * M_m)) * M_m) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
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) * (((d_m * m_m) / (2.0d0 * d)) ** 2.0d0)) <= (-50000000.0d0)) then
tmp = sqrt(((((d_m / ((l * d) * d)) * (d_m * m_m)) * m_m) * ((-0.25d0) * h))) * w0
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
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) * Math.pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -50000000.0) {
tmp = Math.sqrt(((((D_m / ((l * d) * d)) * (D_m * M_m)) * M_m) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [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.pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -50000000.0: tmp = math.sqrt(((((D_m / ((l * d) * d)) * (D_m * M_m)) * M_m) * (-0.25 * h))) * w0 else: tmp = 1.0 * w0 return tmp
D_m = abs(D) M_m = abs(M) 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(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -50000000.0) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(D_m / Float64(Float64(l * d) * d)) * Float64(D_m * M_m)) * M_m) * Float64(-0.25 * h))) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
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) * (((D_m * M_m) / (2.0 * d)) ^ 2.0)) <= -50000000.0)
tmp = sqrt(((((D_m / ((l * d) * d)) * (D_m * M_m)) * M_m) * (-0.25 * h))) * w0;
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -50000000.0], N[(N[Sqrt[N[(N[(N[(N[(D$95$m / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(-0.25 * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\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} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -50000000:\\
\;\;\;\;\sqrt{\left(\left(\frac{D\_m}{\left(\ell \cdot d\right) \cdot d} \cdot \left(D\_m \cdot M\_m\right)\right) \cdot M\_m\right) \cdot \left(-0.25 \cdot h\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\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)) < -5e7Initial program 61.9%
Taylor expanded in h around inf
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites45.3%
Applied rewrites48.0%
Applied rewrites58.1%
if -5e7 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.0%
Taylor expanded in h around 0
Applied rewrites94.7%
Final simplification83.5%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) 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) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) -200000000.0) (* (sqrt (* (* (* (* M_m M_m) (/ D_m (* (* l d) d))) D_m) (* -0.25 h))) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
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) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -200000000.0) {
tmp = sqrt(((((M_m * M_m) * (D_m / ((l * d) * d))) * D_m) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
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) * (((d_m * m_m) / (2.0d0 * d)) ** 2.0d0)) <= (-200000000.0d0)) then
tmp = sqrt(((((m_m * m_m) * (d_m / ((l * d) * d))) * d_m) * ((-0.25d0) * h))) * w0
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
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) * Math.pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -200000000.0) {
tmp = Math.sqrt(((((M_m * M_m) * (D_m / ((l * d) * d))) * D_m) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [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.pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -200000000.0: tmp = math.sqrt(((((M_m * M_m) * (D_m / ((l * d) * d))) * D_m) * (-0.25 * h))) * w0 else: tmp = 1.0 * w0 return tmp
D_m = abs(D) M_m = abs(M) 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(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -200000000.0) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(M_m * M_m) * Float64(D_m / Float64(Float64(l * d) * d))) * D_m) * Float64(-0.25 * h))) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
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) * (((D_m * M_m) / (2.0 * d)) ^ 2.0)) <= -200000000.0)
tmp = sqrt(((((M_m * M_m) * (D_m / ((l * d) * d))) * D_m) * (-0.25 * h))) * w0;
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -200000000.0], N[(N[Sqrt[N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(D$95$m / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.25 * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\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} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -200000000:\\
\;\;\;\;\sqrt{\left(\left(\left(M\_m \cdot M\_m\right) \cdot \frac{D\_m}{\left(\ell \cdot d\right) \cdot d}\right) \cdot D\_m\right) \cdot \left(-0.25 \cdot h\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\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)) < -2e8Initial program 61.4%
Taylor expanded in h around inf
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites45.8%
Applied rewrites48.6%
Applied rewrites54.2%
if -2e8 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.0%
Taylor expanded in h around 0
Applied rewrites94.2%
Final simplification82.2%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) 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) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) -5e+62) (* (sqrt (* (/ (* (* (* D_m D_m) M_m) M_m) (* (* d d) l)) (* -0.25 h))) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
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) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -5e+62) {
tmp = sqrt((((((D_m * D_m) * M_m) * M_m) / ((d * d) * l)) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
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) * (((d_m * m_m) / (2.0d0 * d)) ** 2.0d0)) <= (-5d+62)) then
tmp = sqrt((((((d_m * d_m) * m_m) * m_m) / ((d * d) * l)) * ((-0.25d0) * h))) * w0
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
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) * Math.pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -5e+62) {
tmp = Math.sqrt((((((D_m * D_m) * M_m) * M_m) / ((d * d) * l)) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [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.pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -5e+62: tmp = math.sqrt((((((D_m * D_m) * M_m) * M_m) / ((d * d) * l)) * (-0.25 * h))) * w0 else: tmp = 1.0 * w0 return tmp
D_m = abs(D) M_m = abs(M) 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(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -5e+62) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(D_m * D_m) * M_m) * M_m) / Float64(Float64(d * d) * l)) * Float64(-0.25 * h))) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
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) * (((D_m * M_m) / (2.0 * d)) ^ 2.0)) <= -5e+62)
tmp = sqrt((((((D_m * D_m) * M_m) * M_m) / ((d * d) * l)) * (-0.25 * h))) * w0;
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+62], N[(N[Sqrt[N[(N[(N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(-0.25 * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\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} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -5 \cdot 10^{+62}:\\
\;\;\;\;\sqrt{\frac{\left(\left(D\_m \cdot D\_m\right) \cdot M\_m\right) \cdot M\_m}{\left(d \cdot d\right) \cdot \ell} \cdot \left(-0.25 \cdot h\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\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)) < -5.00000000000000029e62Initial program 58.8%
Taylor expanded in h around inf
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites48.8%
Taylor expanded in M around 0
Applied rewrites45.9%
if -5.00000000000000029e62 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.3%
Taylor expanded in h around 0
Applied rewrites92.0%
Final simplification79.0%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) 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) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) -2e+172) (fma (* -0.125 w0) (* (/ M_m (* l d)) (/ (* (* (* D_m D_m) h) M_m) d)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
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) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -2e+172) {
tmp = fma((-0.125 * w0), ((M_m / (l * d)) * ((((D_m * D_m) * h) * M_m) / d)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) 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(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -2e+172) tmp = fma(Float64(-0.125 * w0), Float64(Float64(M_m / Float64(l * d)) * Float64(Float64(Float64(Float64(D_m * D_m) * h) * M_m) / d)), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -2e+172], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(M$95$m / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\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} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -2 \cdot 10^{+172}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{M\_m}{\ell \cdot d} \cdot \frac{\left(\left(D\_m \cdot D\_m\right) \cdot h\right) \cdot M\_m}{d}, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\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)) < -2.0000000000000002e172Initial program 53.0%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
associate-/l/N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites52.7%
Taylor expanded in h around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites39.8%
Taylor expanded in w0 around 0
Applied rewrites38.4%
Applied rewrites45.5%
if -2.0000000000000002e172 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.7%
Taylor expanded in h around 0
Applied rewrites88.0%
Final simplification77.5%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) 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) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) -2e+172) (fma (* -0.125 w0) (* (/ M_m (* (* d d) l)) (* (* (* D_m D_m) h) M_m)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
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) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -2e+172) {
tmp = fma((-0.125 * w0), ((M_m / ((d * d) * l)) * (((D_m * D_m) * h) * M_m)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) 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(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -2e+172) tmp = fma(Float64(-0.125 * w0), Float64(Float64(M_m / Float64(Float64(d * d) * l)) * Float64(Float64(Float64(D_m * D_m) * h) * M_m)), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -2e+172], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(M$95$m / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\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} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -2 \cdot 10^{+172}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{M\_m}{\left(d \cdot d\right) \cdot \ell} \cdot \left(\left(\left(D\_m \cdot D\_m\right) \cdot h\right) \cdot M\_m\right), w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\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)) < -2.0000000000000002e172Initial program 53.0%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
associate-/l/N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites52.7%
Taylor expanded in h around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites39.8%
Taylor expanded in w0 around 0
Applied rewrites38.4%
Applied rewrites41.7%
if -2.0000000000000002e172 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.7%
Taylor expanded in h around 0
Applied rewrites88.0%
Final simplification76.6%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) 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 M_m) (* 2.0 d)) 1e+148) (* 1.0 w0) (fma (* -0.125 w0) (* (/ (* M_m M_m) d) (/ (* (* D_m D_m) h) (* l d))) w0)))
D_m = fabs(D);
M_m = fabs(M);
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 * M_m) / (2.0 * d)) <= 1e+148) {
tmp = 1.0 * w0;
} else {
tmp = fma((-0.125 * w0), (((M_m * M_m) / d) * (((D_m * D_m) * h) / (l * d))), w0);
}
return tmp;
}
D_m = abs(D) M_m = abs(M) 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(Float64(D_m * M_m) / Float64(2.0 * d)) <= 1e+148) tmp = Float64(1.0 * w0); else tmp = fma(Float64(-0.125 * w0), Float64(Float64(Float64(M_m * M_m) / d) * Float64(Float64(Float64(D_m * D_m) * h) / Float64(l * d))), w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 1e+148], N[(1.0 * w0), $MachinePrecision], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision] * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * h), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\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{D\_m \cdot M\_m}{2 \cdot d} \leq 10^{+148}:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{M\_m \cdot M\_m}{d} \cdot \frac{\left(D\_m \cdot D\_m\right) \cdot h}{\ell \cdot d}, w0\right)\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 1e148Initial program 86.8%
Taylor expanded in h around 0
Applied rewrites77.2%
if 1e148 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 46.0%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
associate-/l/N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites45.8%
Taylor expanded in h around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites36.5%
Taylor expanded in w0 around 0
Applied rewrites37.0%
Applied rewrites40.3%
Final simplification72.3%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
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 1e-59)
(*
(sqrt (fma (* (/ (* (* h M_m) M_m) l) (* (/ D_m d) -0.25)) (/ D_m d) 1.0))
w0)
(*
(sqrt
(fma (/ (* (* (* h (/ M_m d)) D_m) 0.25) (* (- l) d)) (* D_m M_m) 1.0))
w0)))D_m = fabs(D);
M_m = fabs(M);
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 <= 1e-59) {
tmp = sqrt(fma(((((h * M_m) * M_m) / l) * ((D_m / d) * -0.25)), (D_m / d), 1.0)) * w0;
} else {
tmp = sqrt(fma(((((h * (M_m / d)) * D_m) * 0.25) / (-l * d)), (D_m * M_m), 1.0)) * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) 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 <= 1e-59) tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(h * M_m) * M_m) / l) * Float64(Float64(D_m / d) * -0.25)), Float64(D_m / d), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(h * Float64(M_m / d)) * D_m) * 0.25) / Float64(Float64(-l) * d)), Float64(D_m * M_m), 1.0)) * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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, 1e-59], N[(N[Sqrt[N[(N[(N[(N[(N[(h * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] / l), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(N[(h * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * 0.25), $MachinePrecision] / N[((-l) * d), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * M$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\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 10^{-59}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(h \cdot M\_m\right) \cdot M\_m}{\ell} \cdot \left(\frac{D\_m}{d} \cdot -0.25\right), \frac{D\_m}{d}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(\left(h \cdot \frac{M\_m}{d}\right) \cdot D\_m\right) \cdot 0.25}{\left(-\ell\right) \cdot d}, D\_m \cdot M\_m, 1\right)} \cdot w0\\
\end{array}
\end{array}
if D < 1e-59Initial program 81.3%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
associate-/l*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites73.7%
Taylor expanded in h around 0
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6469.7
Applied rewrites69.7%
Applied rewrites72.2%
if 1e-59 < D Initial program 81.7%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites89.6%
lift-fma.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites86.5%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-*.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*l*N/A
metadata-evalN/A
lower-*.f6484.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6484.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6484.1
Applied rewrites84.1%
Final simplification75.2%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
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 1e-59)
(*
(sqrt (fma (* (* (/ M_m l) (* h M_m)) (* (/ D_m d) -0.25)) (/ D_m d) 1.0))
w0)
(*
(sqrt
(fma (/ (* (* (* h (/ M_m d)) D_m) 0.25) (* (- l) d)) (* D_m M_m) 1.0))
w0)))D_m = fabs(D);
M_m = fabs(M);
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 <= 1e-59) {
tmp = sqrt(fma((((M_m / l) * (h * M_m)) * ((D_m / d) * -0.25)), (D_m / d), 1.0)) * w0;
} else {
tmp = sqrt(fma(((((h * (M_m / d)) * D_m) * 0.25) / (-l * d)), (D_m * M_m), 1.0)) * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) 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 <= 1e-59) tmp = Float64(sqrt(fma(Float64(Float64(Float64(M_m / l) * Float64(h * M_m)) * Float64(Float64(D_m / d) * -0.25)), Float64(D_m / d), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(h * Float64(M_m / d)) * D_m) * 0.25) / Float64(Float64(-l) * d)), Float64(D_m * M_m), 1.0)) * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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, 1e-59], N[(N[Sqrt[N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * N[(h * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(N[(h * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * 0.25), $MachinePrecision] / N[((-l) * d), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * M$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\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 10^{-59}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\frac{M\_m}{\ell} \cdot \left(h \cdot M\_m\right)\right) \cdot \left(\frac{D\_m}{d} \cdot -0.25\right), \frac{D\_m}{d}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(\left(h \cdot \frac{M\_m}{d}\right) \cdot D\_m\right) \cdot 0.25}{\left(-\ell\right) \cdot d}, D\_m \cdot M\_m, 1\right)} \cdot w0\\
\end{array}
\end{array}
if D < 1e-59Initial program 81.3%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
associate-/l*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites73.7%
Taylor expanded in h around 0
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6469.7
Applied rewrites69.7%
Applied rewrites75.2%
if 1e-59 < D Initial program 81.7%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites89.6%
lift-fma.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites86.5%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-*.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*l*N/A
metadata-evalN/A
lower-*.f6484.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6484.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6484.1
Applied rewrites84.1%
Final simplification77.5%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) 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 (* (sqrt (fma (/ (* (* (* h (/ M_m d)) D_m) 0.25) (* (- l) d)) (* D_m M_m) 1.0)) w0))
D_m = fabs(D);
M_m = fabs(M);
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 sqrt(fma(((((h * (M_m / d)) * D_m) * 0.25) / (-l * d)), (D_m * M_m), 1.0)) * w0;
}
D_m = abs(D) M_m = abs(M) 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 Float64(sqrt(fma(Float64(Float64(Float64(Float64(h * Float64(M_m / d)) * D_m) * 0.25) / Float64(Float64(-l) * d)), Float64(D_m * M_m), 1.0)) * w0) end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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_] := N[(N[Sqrt[N[(N[(N[(N[(N[(h * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * 0.25), $MachinePrecision] / N[((-l) * d), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * M$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\sqrt{\mathsf{fma}\left(\frac{\left(\left(h \cdot \frac{M\_m}{d}\right) \cdot D\_m\right) \cdot 0.25}{\left(-\ell\right) \cdot d}, D\_m \cdot M\_m, 1\right)} \cdot w0
\end{array}
Initial program 81.4%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites85.8%
lift-fma.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites84.2%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-*.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*l*N/A
metadata-evalN/A
lower-*.f6482.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6482.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6482.5
Applied rewrites82.5%
Final simplification82.5%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) 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 (* 1.0 w0))
D_m = fabs(D);
M_m = fabs(M);
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 1.0 * w0;
}
D_m = abs(d)
M_m = abs(m)
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 = 1.0d0 * w0
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
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 1.0 * w0;
}
D_m = math.fabs(D) M_m = math.fabs(M) [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 1.0 * w0
D_m = abs(D) M_m = abs(M) 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 Float64(1.0 * w0) end
D_m = abs(D);
M_m = abs(M);
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 = 1.0 * w0;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $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_] := N[(1.0 * w0), $MachinePrecision]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
1 \cdot w0
\end{array}
Initial program 81.4%
Taylor expanded in h around 0
Applied rewrites67.5%
Final simplification67.5%
herbie shell --seed 2024284
(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))))))