
(FPCore (w0 M D h l d) :precision binary64 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))
double code(double w0, double M, double D, double h, double l, double d) {
return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
real(8) function code(w0, m, d, h, l, d_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_1
code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function
public static double code(double w0, double M, double D, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
def code(w0, M, D, h, l, d): return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))
function code(w0, M, D, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))))) end
function tmp = code(w0, M, D, h, l, d) tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l)))); end
code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (w0 M D h l d) :precision binary64 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))
double code(double w0, double M, double D, double h, double l, double d) {
return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
real(8) function code(w0, m, d, h, l, d_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_1
code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function
public static double code(double w0, double M, double D, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
def code(w0, M, D, h, l, d): return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))
function code(w0, M, D, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))))) end
function tmp = code(w0, M, D, h, l, d) tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l)))); end
code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}
\end{array}
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.5%
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 rewrites88.1%
Final simplification88.1%
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+28)
(*
(sqrt
(fma (* (* (* (/ D_m d) M_m) M_m) (* (/ (- D_m) d) (/ h l))) 0.25 1.0))
w0)
(*
(fma (* (/ (/ (* (* (/ M_m l) M_m) h) d) d) D_m) (* -0.125 D_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 (((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -2e+28) {
tmp = sqrt(fma(((((D_m / d) * M_m) * M_m) * ((-D_m / d) * (h / l))), 0.25, 1.0)) * w0;
} else {
tmp = fma(((((((M_m / l) * M_m) * h) / d) / d) * D_m), (-0.125 * D_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 (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -2e+28) tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(D_m / d) * M_m) * M_m) * Float64(Float64(Float64(-D_m) / d) * Float64(h / l))), 0.25, 1.0)) * w0); else tmp = Float64(fma(Float64(Float64(Float64(Float64(Float64(Float64(M_m / l) * M_m) * h) / d) / d) * D_m), Float64(-0.125 * D_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[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+28], N[(N[Sqrt[N[(N[(N[(N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(N[((-D$95$m) / d), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.25 + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[(N[(N[(N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * M$95$m), $MachinePrecision] * h), $MachinePrecision] / d), $MachinePrecision] / d), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $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{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -2 \cdot 10^{+28}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\left(\frac{D\_m}{d} \cdot M\_m\right) \cdot M\_m\right) \cdot \left(\frac{-D\_m}{d} \cdot \frac{h}{\ell}\right), 0.25, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{\frac{\left(\frac{M\_m}{\ell} \cdot M\_m\right) \cdot h}{d}}{d} \cdot D\_m, -0.125 \cdot D\_m, 1\right) \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)) < -1.99999999999999992e28Initial program 66.0%
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 rewrites68.3%
Applied rewrites61.0%
if -1.99999999999999992e28 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 87.8%
Taylor expanded in M 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 rewrites58.3%
Applied rewrites80.3%
Applied rewrites84.5%
Final simplification77.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 (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) -2e+28)
(* (sqrt (/ (/ (* (* (* (* h (/ M_m d)) M_m) D_m) (* -0.25 D_m)) l) d)) w0)
(*
(fma (* (/ (/ (* (* (/ M_m l) M_m) h) d) d) D_m) (* -0.125 D_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 (((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -2e+28) {
tmp = sqrt(((((((h * (M_m / d)) * M_m) * D_m) * (-0.25 * D_m)) / l) / d)) * w0;
} else {
tmp = fma(((((((M_m / l) * M_m) * h) / d) / d) * D_m), (-0.125 * D_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 (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -2e+28) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(Float64(h * Float64(M_m / d)) * M_m) * D_m) * Float64(-0.25 * D_m)) / l) / d)) * w0); else tmp = Float64(fma(Float64(Float64(Float64(Float64(Float64(Float64(M_m / l) * M_m) * h) / d) / d) * D_m), Float64(-0.125 * D_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[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+28], N[(N[Sqrt[N[(N[(N[(N[(N[(N[(h * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.25 * D$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] / d), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[(N[(N[(N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * M$95$m), $MachinePrecision] * h), $MachinePrecision] / d), $MachinePrecision] / d), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $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{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -2 \cdot 10^{+28}:\\
\;\;\;\;\sqrt{\frac{\frac{\left(\left(\left(h \cdot \frac{M\_m}{d}\right) \cdot M\_m\right) \cdot D\_m\right) \cdot \left(-0.25 \cdot D\_m\right)}{\ell}}{d}} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{\frac{\left(\frac{M\_m}{\ell} \cdot M\_m\right) \cdot h}{d}}{d} \cdot D\_m, -0.125 \cdot D\_m, 1\right) \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)) < -1.99999999999999992e28Initial program 66.0%
Taylor expanded in M around inf
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6444.2
Applied rewrites44.2%
Applied rewrites49.2%
Applied rewrites62.2%
if -1.99999999999999992e28 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 87.8%
Taylor expanded in M 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 rewrites58.3%
Applied rewrites80.3%
Applied rewrites84.5%
Final simplification78.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)) -1e+75)
(* (sqrt (* (* (* (* (/ h (* d d)) M_m) (/ M_m l)) (* -0.25 D_m)) D_m)) w0)
(*
(fma (* (/ (/ (* (* (/ M_m l) M_m) h) d) d) D_m) (* -0.125 D_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 (((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -1e+75) {
tmp = sqrt((((((h / (d * d)) * M_m) * (M_m / l)) * (-0.25 * D_m)) * D_m)) * w0;
} else {
tmp = fma(((((((M_m / l) * M_m) * h) / d) / d) * D_m), (-0.125 * D_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 (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -1e+75) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(h / Float64(d * d)) * M_m) * Float64(M_m / l)) * Float64(-0.25 * D_m)) * D_m)) * w0); else tmp = Float64(fma(Float64(Float64(Float64(Float64(Float64(Float64(M_m / l) * M_m) * h) / d) / d) * D_m), Float64(-0.125 * D_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[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], -1e+75], N[(N[Sqrt[N[(N[(N[(N[(N[(h / N[(d * d), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m / l), $MachinePrecision]), $MachinePrecision] * N[(-0.25 * D$95$m), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[(N[(N[(N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * M$95$m), $MachinePrecision] * h), $MachinePrecision] / d), $MachinePrecision] / d), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $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{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -1 \cdot 10^{+75}:\\
\;\;\;\;\sqrt{\left(\left(\left(\frac{h}{d \cdot d} \cdot M\_m\right) \cdot \frac{M\_m}{\ell}\right) \cdot \left(-0.25 \cdot D\_m\right)\right) \cdot D\_m} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{\frac{\left(\frac{M\_m}{\ell} \cdot M\_m\right) \cdot h}{d}}{d} \cdot D\_m, -0.125 \cdot D\_m, 1\right) \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)) < -9.99999999999999927e74Initial program 65.1%
Taylor expanded in M around inf
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6445.3
Applied rewrites45.3%
Applied rewrites55.5%
if -9.99999999999999927e74 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 88.0%
Taylor expanded in M 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 rewrites57.8%
Applied rewrites79.5%
Applied rewrites83.7%
Final simplification75.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 (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) (- INFINITY)) (* (fma (* (/ (* (* h M_m) M_m) (* (* d d) l)) D_m) (* -0.125 D_m) 1.0) 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)) <= -((double) INFINITY)) {
tmp = fma(((((h * M_m) * M_m) / ((d * d) * l)) * D_m), (-0.125 * D_m), 1.0) * 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)) <= Float64(-Inf)) tmp = Float64(fma(Float64(Float64(Float64(Float64(h * M_m) * M_m) / Float64(Float64(d * d) * l)) * D_m), Float64(-0.125 * D_m), 1.0) * 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], (-Infinity)], N[(N[(N[(N[(N[(N[(h * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $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 -\infty:\\
\;\;\;\;\mathsf{fma}\left(\frac{\left(h \cdot M\_m\right) \cdot M\_m}{\left(d \cdot d\right) \cdot \ell} \cdot D\_m, -0.125 \cdot D\_m, 1\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)) < -inf.0Initial program 59.7%
Taylor expanded in M 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 rewrites49.3%
Applied rewrites57.9%
Applied rewrites53.0%
if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 88.6%
Taylor expanded in M around 0
Applied rewrites90.7%
Final simplification81.4%
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+252) (* (fma (* (* D_m D_m) -0.125) (* (/ (* M_m M_m) (* (* l d) d)) h) 1.0) 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+252) {
tmp = fma(((D_m * D_m) * -0.125), (((M_m * M_m) / ((l * d) * d)) * h), 1.0) * 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+252) tmp = Float64(fma(Float64(Float64(D_m * D_m) * -0.125), Float64(Float64(Float64(M_m * M_m) / Float64(Float64(l * d) * d)) * h), 1.0) * 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+252], N[(N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] + 1.0), $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^{+252}:\\
\;\;\;\;\mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, \frac{M\_m \cdot M\_m}{\left(\ell \cdot d\right) \cdot d} \cdot h, 1\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)) < -2.0000000000000002e252Initial program 61.5%
Taylor expanded in M 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 rewrites47.0%
Applied rewrites47.1%
Applied rewrites50.3%
if -2.0000000000000002e252 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 88.4%
Taylor expanded in M around 0
Applied rewrites92.0%
Final simplification81.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 (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) (- INFINITY)) (* (fma (* (* D_m D_m) -0.125) (* (/ (* M_m M_m) (* (* d d) l)) h) 1.0) 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)) <= -((double) INFINITY)) {
tmp = fma(((D_m * D_m) * -0.125), (((M_m * M_m) / ((d * d) * l)) * h), 1.0) * 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)) <= Float64(-Inf)) tmp = Float64(fma(Float64(Float64(D_m * D_m) * -0.125), Float64(Float64(Float64(M_m * M_m) / Float64(Float64(d * d) * l)) * h), 1.0) * 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], (-Infinity)], N[(N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] + 1.0), $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 -\infty:\\
\;\;\;\;\mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, \frac{M\_m \cdot M\_m}{\left(d \cdot d\right) \cdot \ell} \cdot h, 1\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)) < -inf.0Initial program 59.7%
Taylor expanded in M 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 rewrites49.3%
Applied rewrites49.3%
if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 88.6%
Taylor expanded in M around 0
Applied rewrites90.7%
Final simplification80.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 (<= (/ (* D_m M_m) (* 2.0 d)) 4e+102)
(* (fma (* (/ (* (* (/ M_m l) M_m) h) d) (/ D_m d)) (* -0.125 D_m) 1.0) w0)
(*
(fma (* (/ (* (* (/ M_m d) M_m) (/ h d)) l) D_m) (* -0.125 D_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 * M_m) / (2.0 * d)) <= 4e+102) {
tmp = fma((((((M_m / l) * M_m) * h) / d) * (D_m / d)), (-0.125 * D_m), 1.0) * w0;
} else {
tmp = fma((((((M_m / d) * M_m) * (h / d)) / l) * D_m), (-0.125 * D_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 (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) <= 4e+102) tmp = Float64(fma(Float64(Float64(Float64(Float64(Float64(M_m / l) * M_m) * h) / d) * Float64(D_m / d)), Float64(-0.125 * D_m), 1.0) * w0); else tmp = Float64(fma(Float64(Float64(Float64(Float64(Float64(M_m / d) * M_m) * Float64(h / d)) / l) * D_m), Float64(-0.125 * D_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[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 4e+102], N[(N[(N[(N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * M$95$m), $MachinePrecision] * h), $MachinePrecision] / d), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision] * w0), $MachinePrecision], N[(N[(N[(N[(N[(N[(N[(M$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(h / d), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $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 4 \cdot 10^{+102}:\\
\;\;\;\;\mathsf{fma}\left(\frac{\left(\frac{M\_m}{\ell} \cdot M\_m\right) \cdot h}{d} \cdot \frac{D\_m}{d}, -0.125 \cdot D\_m, 1\right) \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{\left(\frac{M\_m}{d} \cdot M\_m\right) \cdot \frac{h}{d}}{\ell} \cdot D\_m, -0.125 \cdot D\_m, 1\right) \cdot w0\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 3.99999999999999991e102Initial program 84.3%
Taylor expanded in M 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 rewrites53.8%
Applied rewrites72.2%
Applied rewrites67.7%
Applied rewrites76.8%
if 3.99999999999999991e102 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 61.5%
Taylor expanded in M 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 rewrites51.5%
Applied rewrites64.6%
Applied rewrites64.6%
Final simplification75.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 (* (sqrt (fma (* (/ (* h M_m) l) (* (/ D_m d) -0.5)) (* (* D_m (/ 0.5 d)) 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) / l) * ((D_m / d) * -0.5)), ((D_m * (0.5 / d)) * 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(h * M_m) / l) * Float64(Float64(D_m / d) * -0.5)), Float64(Float64(D_m * Float64(0.5 / d)) * 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[(h * M$95$m), $MachinePrecision] / l), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision] * 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{h \cdot M\_m}{\ell} \cdot \left(\frac{D\_m}{d} \cdot -0.5\right), \left(D\_m \cdot \frac{0.5}{d}\right) \cdot M\_m, 1\right)} \cdot w0
\end{array}
Initial program 81.5%
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 rewrites88.1%
lift-fma.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-/.f64N/A
metadata-evalN/A
associate-/r*N/A
associate-/r/N/A
clear-numN/A
lower-fma.f64N/A
Applied rewrites87.4%
Taylor expanded in M around 0
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f6482.3
Applied rewrites82.3%
Final simplification82.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 (<= M_m 9e-142)
(* (fma (* (/ (/ (* (* (/ M_m l) M_m) h) d) d) D_m) (* -0.125 D_m) 1.0) w0)
(*
(sqrt
(fma (* (* (* M_m M_m) 0.25) (/ D_m d)) (* (- D_m) (/ h (* l d))) 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 (M_m <= 9e-142) {
tmp = fma(((((((M_m / l) * M_m) * h) / d) / d) * D_m), (-0.125 * D_m), 1.0) * w0;
} else {
tmp = sqrt(fma((((M_m * M_m) * 0.25) * (D_m / d)), (-D_m * (h / (l * d))), 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 (M_m <= 9e-142) tmp = Float64(fma(Float64(Float64(Float64(Float64(Float64(Float64(M_m / l) * M_m) * h) / d) / d) * D_m), Float64(-0.125 * D_m), 1.0) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(M_m * M_m) * 0.25) * Float64(D_m / d)), Float64(Float64(-D_m) * Float64(h / Float64(l * d))), 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[M$95$m, 9e-142], N[(N[(N[(N[(N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * M$95$m), $MachinePrecision] * h), $MachinePrecision] / d), $MachinePrecision] / d), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * 0.25), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[((-D$95$m) * N[(h / N[(l * d), $MachinePrecision]), $MachinePrecision]), $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}\;M\_m \leq 9 \cdot 10^{-142}:\\
\;\;\;\;\mathsf{fma}\left(\frac{\frac{\left(\frac{M\_m}{\ell} \cdot M\_m\right) \cdot h}{d}}{d} \cdot D\_m, -0.125 \cdot D\_m, 1\right) \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\left(M\_m \cdot M\_m\right) \cdot 0.25\right) \cdot \frac{D\_m}{d}, \left(-D\_m\right) \cdot \frac{h}{\ell \cdot d}, 1\right)} \cdot w0\\
\end{array}
\end{array}
if M < 9.00000000000000037e-142Initial program 87.9%
Taylor expanded in M 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 rewrites54.4%
Applied rewrites73.2%
Applied rewrites82.3%
if 9.00000000000000037e-142 < M Initial program 68.9%
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
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
associate-*l*N/A
Applied rewrites61.0%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6464.5
Applied rewrites64.5%
Final simplification76.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 M_m) 5e-82)
(* 1.0 w0)
(*
(fma (* (* (* (/ h (* d d)) M_m) (/ M_m l)) D_m) (* -0.125 D_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 * M_m) <= 5e-82) {
tmp = 1.0 * w0;
} else {
tmp = fma(((((h / (d * d)) * M_m) * (M_m / l)) * D_m), (-0.125 * D_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 (Float64(D_m * M_m) <= 5e-82) tmp = Float64(1.0 * w0); else tmp = Float64(fma(Float64(Float64(Float64(Float64(h / Float64(d * d)) * M_m) * Float64(M_m / l)) * D_m), Float64(-0.125 * D_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[N[(D$95$m * M$95$m), $MachinePrecision], 5e-82], N[(1.0 * w0), $MachinePrecision], N[(N[(N[(N[(N[(N[(h / N[(d * d), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m / l), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $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 \cdot M\_m \leq 5 \cdot 10^{-82}:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\left(\left(\frac{h}{d \cdot d} \cdot M\_m\right) \cdot \frac{M\_m}{\ell}\right) \cdot D\_m, -0.125 \cdot D\_m, 1\right) \cdot w0\\
\end{array}
\end{array}
if (*.f64 M D) < 4.9999999999999998e-82Initial program 85.5%
Taylor expanded in M around 0
Applied rewrites79.9%
if 4.9999999999999998e-82 < (*.f64 M D) Initial program 68.7%
Taylor expanded in M 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 rewrites46.2%
Applied rewrites64.9%
Final simplification76.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 (* (fma (* (/ (/ (* (* (/ M_m l) M_m) h) d) d) D_m) (* -0.125 D_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 fma(((((((M_m / l) * M_m) * h) / d) / d) * D_m), (-0.125 * D_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(fma(Float64(Float64(Float64(Float64(Float64(Float64(M_m / l) * M_m) * h) / d) / d) * D_m), Float64(-0.125 * D_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[(N[(N[(N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * M$95$m), $MachinePrecision] * h), $MachinePrecision] / d), $MachinePrecision] / d), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $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])\\
\\
\mathsf{fma}\left(\frac{\frac{\left(\frac{M\_m}{\ell} \cdot M\_m\right) \cdot h}{d}}{d} \cdot D\_m, -0.125 \cdot D\_m, 1\right) \cdot w0
\end{array}
Initial program 81.5%
Taylor expanded in M 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 rewrites53.5%
Applied rewrites71.2%
Applied rewrites74.3%
Final simplification74.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 (* (fma (* (/ (* (* (/ M_m l) M_m) h) d) (/ D_m d)) (* -0.125 D_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 fma((((((M_m / l) * M_m) * h) / d) * (D_m / d)), (-0.125 * D_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(fma(Float64(Float64(Float64(Float64(Float64(M_m / l) * M_m) * h) / d) * Float64(D_m / d)), Float64(-0.125 * D_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[(N[(N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * M$95$m), $MachinePrecision] * h), $MachinePrecision] / d), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $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])\\
\\
\mathsf{fma}\left(\frac{\left(\frac{M\_m}{\ell} \cdot M\_m\right) \cdot h}{d} \cdot \frac{D\_m}{d}, -0.125 \cdot D\_m, 1\right) \cdot w0
\end{array}
Initial program 81.5%
Taylor expanded in M 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 rewrites53.5%
Applied rewrites71.2%
Applied rewrites66.9%
Applied rewrites74.9%
Final simplification74.9%
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.5%
Taylor expanded in M around 0
Applied rewrites69.5%
Final simplification69.5%
herbie shell --seed 2024332
(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))))))