
(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 17 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
(*
w0
(sqrt
(fma
(* (* (/ 0.5 d) M_m) D_m)
(/ (* (* D_m 0.5) (* (/ M_m d) h)) (- l))
1.0))))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 w0 * sqrt(fma((((0.5 / d) * M_m) * D_m), (((D_m * 0.5) * ((M_m / d) * h)) / -l), 1.0));
}
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(w0 * sqrt(fma(Float64(Float64(Float64(0.5 / d) * M_m) * D_m), Float64(Float64(Float64(D_m * 0.5) * Float64(Float64(M_m / d) * h)) / Float64(-l)), 1.0))) 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[(w0 * N[Sqrt[N[(N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(N[(D$95$m * 0.5), $MachinePrecision] * N[(N[(M$95$m / d), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] / (-l)), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $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])\\
\\
w0 \cdot \sqrt{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, \frac{\left(D\_m \cdot 0.5\right) \cdot \left(\frac{M\_m}{d} \cdot h\right)}{-\ell}, 1\right)}
\end{array}
Initial program 80.1%
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 rewrites87.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
(let* ((t_0 (pow (/ (* M_m D_m) (* 2.0 d)) 2.0)))
(if (<= t_0 0.0)
(*
w0
(sqrt
(fma (* (* -0.25 (/ D_m d)) (/ (* (* M_m M_m) h) l)) (/ D_m d) 1.0)))
(if (<= t_0 4e+125)
(*
w0
(sqrt
(fma
(/ D_m d)
(* (* (/ (- h) l) M_m) (* (* 0.25 M_m) (/ D_m d)))
1.0)))
(*
w0
(sqrt
(fma
(* (* (/ 0.5 d) M_m) D_m)
(/ (* (* (* D_m 0.5) h) M_m) (* (- d) l))
1.0)))))))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 t_0 = pow(((M_m * D_m) / (2.0 * d)), 2.0);
double tmp;
if (t_0 <= 0.0) {
tmp = w0 * sqrt(fma(((-0.25 * (D_m / d)) * (((M_m * M_m) * h) / l)), (D_m / d), 1.0));
} else if (t_0 <= 4e+125) {
tmp = w0 * sqrt(fma((D_m / d), (((-h / l) * M_m) * ((0.25 * M_m) * (D_m / d))), 1.0));
} else {
tmp = w0 * sqrt(fma((((0.5 / d) * M_m) * D_m), ((((D_m * 0.5) * h) * M_m) / (-d * l)), 1.0));
}
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) t_0 = Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0 tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(w0 * sqrt(fma(Float64(Float64(-0.25 * Float64(D_m / d)) * Float64(Float64(Float64(M_m * M_m) * h) / l)), Float64(D_m / d), 1.0))); elseif (t_0 <= 4e+125) tmp = Float64(w0 * sqrt(fma(Float64(D_m / d), Float64(Float64(Float64(Float64(-h) / l) * M_m) * Float64(Float64(0.25 * M_m) * Float64(D_m / d))), 1.0))); else tmp = Float64(w0 * sqrt(fma(Float64(Float64(Float64(0.5 / d) * M_m) * D_m), Float64(Float64(Float64(Float64(D_m * 0.5) * h) * M_m) / Float64(Float64(-d) * l)), 1.0))); 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_] := Block[{t$95$0 = N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(w0 * N[Sqrt[N[(N[(N[(-0.25 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 4e+125], N[(w0 * N[Sqrt[N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(N[((-h) / l), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(N[(0.25 * M$95$m), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(N[(N[(D$95$m * 0.5), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision] / N[((-d) * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $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}
t_0 := {\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\left(-0.25 \cdot \frac{D\_m}{d}\right) \cdot \frac{\left(M\_m \cdot M\_m\right) \cdot h}{\ell}, \frac{D\_m}{d}, 1\right)}\\
\mathbf{elif}\;t\_0 \leq 4 \cdot 10^{+125}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{D\_m}{d}, \left(\frac{-h}{\ell} \cdot M\_m\right) \cdot \left(\left(0.25 \cdot M\_m\right) \cdot \frac{D\_m}{d}\right), 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, \frac{\left(\left(D\_m \cdot 0.5\right) \cdot h\right) \cdot M\_m}{\left(-d\right) \cdot \ell}, 1\right)}\\
\end{array}
\end{array}
if (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) < 0.0Initial program 87.4%
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 rewrites82.9%
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-*.f64N/A
unpow2N/A
lower-*.f6489.3
Applied rewrites89.3%
if 0.0 < (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) < 3.9999999999999997e125Initial program 95.2%
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 rewrites77.4%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6491.5
Applied rewrites91.5%
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6490.3
Applied rewrites90.3%
if 3.9999999999999997e125 < (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) Initial program 55.6%
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 rewrites67.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6467.2
Applied rewrites67.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
frac-timesN/A
lift-neg.f64N/A
distribute-rgt-neg-inN/A
lift-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6465.8
Applied rewrites65.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
(let* ((t_0 (* (* (/ 0.5 d) M_m) D_m)))
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) 1e-22)
(* w0 (sqrt (fma (* (/ h l) (/ (* (* D_m M_m) -0.5) d)) t_0 1.0)))
(* w0 (sqrt (fma t_0 (/ (* (* h M_m) (* -0.5 D_m)) (* l d)) 1.0))))))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 t_0 = ((0.5 / d) * M_m) * D_m;
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= 1e-22) {
tmp = w0 * sqrt(fma(((h / l) * (((D_m * M_m) * -0.5) / d)), t_0, 1.0));
} else {
tmp = w0 * sqrt(fma(t_0, (((h * M_m) * (-0.5 * D_m)) / (l * d)), 1.0));
}
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) t_0 = Float64(Float64(Float64(0.5 / d) * M_m) * D_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= 1e-22) tmp = Float64(w0 * sqrt(fma(Float64(Float64(h / l) * Float64(Float64(Float64(D_m * M_m) * -0.5) / d)), t_0, 1.0))); else tmp = Float64(w0 * sqrt(fma(t_0, Float64(Float64(Float64(h * M_m) * Float64(-0.5 * D_m)) / Float64(l * d)), 1.0))); 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_] := Block[{t$95$0 = N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]}, If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], 1e-22], N[(w0 * N[Sqrt[N[(N[(N[(h / l), $MachinePrecision] * N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * -0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] * t$95$0 + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(t$95$0 * N[(N[(N[(h * M$95$m), $MachinePrecision] * N[(-0.5 * D$95$m), $MachinePrecision]), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $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}
t_0 := \left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m\\
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq 10^{-22}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{h}{\ell} \cdot \frac{\left(D\_m \cdot M\_m\right) \cdot -0.5}{d}, t\_0, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(t\_0, \frac{\left(h \cdot M\_m\right) \cdot \left(-0.5 \cdot D\_m\right)}{\ell \cdot d}, 1\right)}\\
\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)) < 1e-22Initial program 88.3%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lift-pow.f64N/A
unpow2N/A
distribute-lft-neg-inN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites88.3%
if 1e-22 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 0.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 rewrites91.9%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6483.4
Applied rewrites83.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
*-commutativeN/A
lower-*.f6475.4
Applied rewrites75.4%
Applied rewrites84.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 (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -5e+29)
(*
w0
(sqrt
(fma (/ D_m d) (* (* (* 0.25 M_m) D_m) (* (/ h (* (- d) l)) M_m)) 1.0)))
(*
w0
(fma (* (* (* h (/ (/ M_m d) l)) (/ M_m d)) D_m) (* -0.125 D_m) 1.0))))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 ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+29) {
tmp = w0 * sqrt(fma((D_m / d), (((0.25 * M_m) * D_m) * ((h / (-d * l)) * M_m)), 1.0));
} else {
tmp = w0 * fma((((h * ((M_m / d) / l)) * (M_m / d)) * D_m), (-0.125 * D_m), 1.0);
}
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(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -5e+29) tmp = Float64(w0 * sqrt(fma(Float64(D_m / d), Float64(Float64(Float64(0.25 * M_m) * D_m) * Float64(Float64(h / Float64(Float64(-d) * l)) * M_m)), 1.0))); else tmp = Float64(w0 * fma(Float64(Float64(Float64(h * Float64(Float64(M_m / d) / l)) * Float64(M_m / d)) * D_m), Float64(-0.125 * D_m), 1.0)); 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[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+29], N[(w0 * N[Sqrt[N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(N[(0.25 * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(h / N[((-d) * l), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[(N[(N[(N[(h * N[(N[(M$95$m / d), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $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}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+29}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{D\_m}{d}, \left(\left(0.25 \cdot M\_m\right) \cdot D\_m\right) \cdot \left(\frac{h}{\left(-d\right) \cdot \ell} \cdot M\_m\right), 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(\left(\left(h \cdot \frac{\frac{M\_m}{d}}{\ell}\right) \cdot \frac{M\_m}{d}\right) \cdot D\_m, -0.125 \cdot D\_m, 1\right)\\
\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.0000000000000001e29Initial program 63.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
*-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 rewrites54.7%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6465.3
Applied rewrites65.3%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6458.7
Applied rewrites58.7%
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6458.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6456.9
Applied rewrites56.9%
if -5.0000000000000001e29 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 86.6%
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 rewrites61.0%
Applied rewrites62.1%
Applied rewrites66.0%
Applied rewrites88.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 (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -5e+29)
(*
w0
(sqrt
(fma M_m (* (* (/ h (* (- d) l)) D_m) (* (* 0.25 M_m) (/ D_m d))) 1.0)))
(*
w0
(fma (* (* (* h (/ (/ M_m d) l)) (/ M_m d)) D_m) (* -0.125 D_m) 1.0))))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 ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+29) {
tmp = w0 * sqrt(fma(M_m, (((h / (-d * l)) * D_m) * ((0.25 * M_m) * (D_m / d))), 1.0));
} else {
tmp = w0 * fma((((h * ((M_m / d) / l)) * (M_m / d)) * D_m), (-0.125 * D_m), 1.0);
}
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(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -5e+29) tmp = Float64(w0 * sqrt(fma(M_m, Float64(Float64(Float64(h / Float64(Float64(-d) * l)) * D_m) * Float64(Float64(0.25 * M_m) * Float64(D_m / d))), 1.0))); else tmp = Float64(w0 * fma(Float64(Float64(Float64(h * Float64(Float64(M_m / d) / l)) * Float64(M_m / d)) * D_m), Float64(-0.125 * D_m), 1.0)); 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[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+29], N[(w0 * N[Sqrt[N[(M$95$m * N[(N[(N[(h / N[((-d) * l), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(0.25 * M$95$m), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[(N[(N[(N[(h * N[(N[(M$95$m / d), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $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}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+29}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(M\_m, \left(\frac{h}{\left(-d\right) \cdot \ell} \cdot D\_m\right) \cdot \left(\left(0.25 \cdot M\_m\right) \cdot \frac{D\_m}{d}\right), 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(\left(\left(h \cdot \frac{\frac{M\_m}{d}}{\ell}\right) \cdot \frac{M\_m}{d}\right) \cdot D\_m, -0.125 \cdot D\_m, 1\right)\\
\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.0000000000000001e29Initial program 63.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
*-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 rewrites54.7%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6465.3
Applied rewrites65.3%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6458.7
Applied rewrites58.7%
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6461.2
Applied rewrites61.2%
if -5.0000000000000001e29 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 86.6%
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 rewrites61.0%
Applied rewrites62.1%
Applied rewrites66.0%
Applied rewrites88.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 (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+77)
(* w0 (sqrt (* (* (* (* (/ h (* d d)) M_m) (/ M_m l)) (* -0.25 D_m)) D_m)))
(*
w0
(fma (* (* (* h (/ (/ M_m d) l)) (/ M_m d)) D_m) (* -0.125 D_m) 1.0))))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 ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+77) {
tmp = w0 * sqrt((((((h / (d * d)) * M_m) * (M_m / l)) * (-0.25 * D_m)) * D_m));
} else {
tmp = w0 * fma((((h * ((M_m / d) / l)) * (M_m / d)) * D_m), (-0.125 * D_m), 1.0);
}
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(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -2e+77) tmp = Float64(w0 * sqrt(Float64(Float64(Float64(Float64(Float64(h / Float64(d * d)) * M_m) * Float64(M_m / l)) * Float64(-0.25 * D_m)) * D_m))); else tmp = Float64(w0 * fma(Float64(Float64(Float64(h * Float64(Float64(M_m / d) / l)) * Float64(M_m / d)) * D_m), Float64(-0.125 * D_m), 1.0)); 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[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+77], N[(w0 * 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]), $MachinePrecision], N[(w0 * N[(N[(N[(N[(h * N[(N[(M$95$m / d), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $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}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+77}:\\
\;\;\;\;w0 \cdot \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}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(\left(\left(h \cdot \frac{\frac{M\_m}{d}}{\ell}\right) \cdot \frac{M\_m}{d}\right) \cdot D\_m, -0.125 \cdot D\_m, 1\right)\\
\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.99999999999999997e77Initial program 61.9%
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.3
Applied rewrites44.3%
Applied rewrites51.9%
if -1.99999999999999997e77 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 86.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 rewrites59.7%
Applied rewrites60.8%
Applied rewrites64.6%
Applied rewrites86.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
(let* ((t_0 (* (* (/ 0.5 d) M_m) D_m)))
(if (<= (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) 4e+125)
(* w0 (sqrt (fma t_0 (* (* -0.5 (/ D_m d)) (/ (* h M_m) l)) 1.0)))
(* w0 (sqrt (fma t_0 (/ (* (* (* D_m 0.5) h) M_m) (* (- d) l)) 1.0))))))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 t_0 = ((0.5 / d) * M_m) * D_m;
double tmp;
if (pow(((M_m * D_m) / (2.0 * d)), 2.0) <= 4e+125) {
tmp = w0 * sqrt(fma(t_0, ((-0.5 * (D_m / d)) * ((h * M_m) / l)), 1.0));
} else {
tmp = w0 * sqrt(fma(t_0, ((((D_m * 0.5) * h) * M_m) / (-d * l)), 1.0));
}
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) t_0 = Float64(Float64(Float64(0.5 / d) * M_m) * D_m) tmp = 0.0 if ((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) <= 4e+125) tmp = Float64(w0 * sqrt(fma(t_0, Float64(Float64(-0.5 * Float64(D_m / d)) * Float64(Float64(h * M_m) / l)), 1.0))); else tmp = Float64(w0 * sqrt(fma(t_0, Float64(Float64(Float64(Float64(D_m * 0.5) * h) * M_m) / Float64(Float64(-d) * l)), 1.0))); 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_] := Block[{t$95$0 = N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]}, If[LessEqual[N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision], 4e+125], N[(w0 * N[Sqrt[N[(t$95$0 * N[(N[(-0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(N[(h * M$95$m), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(t$95$0 * N[(N[(N[(N[(D$95$m * 0.5), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision] / N[((-d) * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $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}
t_0 := \left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m\\
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \leq 4 \cdot 10^{+125}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(t\_0, \left(-0.5 \cdot \frac{D\_m}{d}\right) \cdot \frac{h \cdot M\_m}{\ell}, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(t\_0, \frac{\left(\left(D\_m \cdot 0.5\right) \cdot h\right) \cdot M\_m}{\left(-d\right) \cdot \ell}, 1\right)}\\
\end{array}
\end{array}
if (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) < 3.9999999999999997e125Initial program 90.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 rewrites96.2%
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
*-commutativeN/A
lower-*.f6490.8
Applied rewrites90.8%
if 3.9999999999999997e125 < (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) Initial program 55.6%
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 rewrites67.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6467.2
Applied rewrites67.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
frac-timesN/A
lift-neg.f64N/A
distribute-rgt-neg-inN/A
lift-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6465.8
Applied rewrites65.8%
Final simplification83.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 (<= (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l))) 1e+269)
(* w0 1.0)
(*
w0
(fma (* h -0.125) (/ (/ (* (* (* D_m M_m) M_m) D_m) l) (* d d)) 1.0))))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 ((1.0 - (pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l))) <= 1e+269) {
tmp = w0 * 1.0;
} else {
tmp = w0 * fma((h * -0.125), (((((D_m * M_m) * M_m) * D_m) / l) / (d * d)), 1.0);
}
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(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))) <= 1e+269) tmp = Float64(w0 * 1.0); else tmp = Float64(w0 * fma(Float64(h * -0.125), Float64(Float64(Float64(Float64(Float64(D_m * M_m) * M_m) * D_m) / l) / Float64(d * d)), 1.0)); 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[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+269], N[(w0 * 1.0), $MachinePrecision], N[(w0 * N[(N[(h * -0.125), $MachinePrecision] * N[(N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / l), $MachinePrecision] / N[(d * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $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}\;1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq 10^{+269}:\\
\;\;\;\;w0 \cdot 1\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(h \cdot -0.125, \frac{\frac{\left(\left(D\_m \cdot M\_m\right) \cdot M\_m\right) \cdot D\_m}{\ell}}{d \cdot d}, 1\right)\\
\end{array}
\end{array}
if (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))) < 1e269Initial program 99.7%
Taylor expanded in M around 0
Applied rewrites90.4%
if 1e269 < (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))) Initial program 37.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 rewrites50.6%
Taylor expanded in D around inf
Applied rewrites59.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 (<= (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l))) 5e+228) (* w0 1.0) (fma (/ -0.125 l) (/ (* (* (* (* (* M_m M_m) h) w0) D_m) D_m) (* d 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 ((1.0 - (pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l))) <= 5e+228) {
tmp = w0 * 1.0;
} else {
tmp = fma((-0.125 / l), ((((((M_m * M_m) * h) * w0) * D_m) * D_m) / (d * 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(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))) <= 5e+228) tmp = Float64(w0 * 1.0); else tmp = fma(Float64(-0.125 / l), Float64(Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) * w0) * D_m) * D_m) / Float64(d * 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[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e+228], N[(w0 * 1.0), $MachinePrecision], N[(N[(-0.125 / l), $MachinePrecision] * N[(N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * w0), $MachinePrecision] * D$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(d * d), $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}\;1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq 5 \cdot 10^{+228}:\\
\;\;\;\;w0 \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{-0.125}{\ell}, \frac{\left(\left(\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot w0\right) \cdot D\_m\right) \cdot D\_m}{d \cdot d}, w0\right)\\
\end{array}
\end{array}
if (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))) < 5e228Initial program 99.7%
Taylor expanded in M around 0
Applied rewrites90.9%
if 5e228 < (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))) Initial program 38.3%
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 rewrites72.1%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6469.7
Applied rewrites69.7%
Taylor expanded in M around 0
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
Applied rewrites50.3%
Applied rewrites51.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 (<= (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) 1e+104)
(*
w0
(sqrt (fma (* (* -0.25 (/ D_m d)) (/ (* (* M_m M_m) h) l)) (/ D_m d) 1.0)))
(*
w0
(sqrt
(fma
(* (* (/ 0.5 d) M_m) D_m)
(/ (* (* (* D_m 0.5) h) M_m) (* (- d) l))
1.0)))))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 (pow(((M_m * D_m) / (2.0 * d)), 2.0) <= 1e+104) {
tmp = w0 * sqrt(fma(((-0.25 * (D_m / d)) * (((M_m * M_m) * h) / l)), (D_m / d), 1.0));
} else {
tmp = w0 * sqrt(fma((((0.5 / d) * M_m) * D_m), ((((D_m * 0.5) * h) * M_m) / (-d * l)), 1.0));
}
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(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) <= 1e+104) tmp = Float64(w0 * sqrt(fma(Float64(Float64(-0.25 * Float64(D_m / d)) * Float64(Float64(Float64(M_m * M_m) * h) / l)), Float64(D_m / d), 1.0))); else tmp = Float64(w0 * sqrt(fma(Float64(Float64(Float64(0.5 / d) * M_m) * D_m), Float64(Float64(Float64(Float64(D_m * 0.5) * h) * M_m) / Float64(Float64(-d) * l)), 1.0))); 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[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision], 1e+104], N[(w0 * N[Sqrt[N[(N[(N[(-0.25 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(N[(N[(D$95$m * 0.5), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision] / N[((-d) * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $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}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \leq 10^{+104}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\left(-0.25 \cdot \frac{D\_m}{d}\right) \cdot \frac{\left(M\_m \cdot M\_m\right) \cdot h}{\ell}, \frac{D\_m}{d}, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, \frac{\left(\left(D\_m \cdot 0.5\right) \cdot h\right) \cdot M\_m}{\left(-d\right) \cdot \ell}, 1\right)}\\
\end{array}
\end{array}
if (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) < 1e104Initial program 90.2%
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 rewrites81.6%
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-*.f64N/A
unpow2N/A
lower-*.f6483.9
Applied rewrites83.9%
if 1e104 < (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) Initial program 57.3%
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 rewrites66.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6467.2
Applied rewrites67.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
frac-timesN/A
lift-neg.f64N/A
distribute-rgt-neg-inN/A
lift-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6464.6
Applied rewrites64.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 (<= (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) 4e+125)
(*
w0
(sqrt (fma (* (* -0.25 (/ D_m d)) (/ (* (* M_m M_m) h) l)) (/ D_m d) 1.0)))
(*
w0
(sqrt
(fma
(* (* (/ 0.5 d) M_m) D_m)
(/ (* (* h M_m) (* -0.5 D_m)) (* l d))
1.0)))))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 (pow(((M_m * D_m) / (2.0 * d)), 2.0) <= 4e+125) {
tmp = w0 * sqrt(fma(((-0.25 * (D_m / d)) * (((M_m * M_m) * h) / l)), (D_m / d), 1.0));
} else {
tmp = w0 * sqrt(fma((((0.5 / d) * M_m) * D_m), (((h * M_m) * (-0.5 * D_m)) / (l * d)), 1.0));
}
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(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) <= 4e+125) tmp = Float64(w0 * sqrt(fma(Float64(Float64(-0.25 * Float64(D_m / d)) * Float64(Float64(Float64(M_m * M_m) * h) / l)), Float64(D_m / d), 1.0))); else tmp = Float64(w0 * sqrt(fma(Float64(Float64(Float64(0.5 / d) * M_m) * D_m), Float64(Float64(Float64(h * M_m) * Float64(-0.5 * D_m)) / Float64(l * d)), 1.0))); 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[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision], 4e+125], N[(w0 * N[Sqrt[N[(N[(N[(-0.25 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(N[(h * M$95$m), $MachinePrecision] * N[(-0.5 * D$95$m), $MachinePrecision]), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $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}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \leq 4 \cdot 10^{+125}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\left(-0.25 \cdot \frac{D\_m}{d}\right) \cdot \frac{\left(M\_m \cdot M\_m\right) \cdot h}{\ell}, \frac{D\_m}{d}, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, \frac{\left(h \cdot M\_m\right) \cdot \left(-0.5 \cdot D\_m\right)}{\ell \cdot d}, 1\right)}\\
\end{array}
\end{array}
if (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) < 3.9999999999999997e125Initial program 90.4%
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 rewrites80.8%
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-*.f64N/A
unpow2N/A
lower-*.f6482.6
Applied rewrites82.6%
if 3.9999999999999997e125 < (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) Initial program 55.6%
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 rewrites67.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6467.2
Applied rewrites67.2%
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
*-commutativeN/A
lower-*.f6462.1
Applied rewrites62.1%
Applied rewrites65.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
(if (<= (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l))) 5e+228)
(* w0 1.0)
(*
w0
(fma (* (* D_m D_m) -0.125) (* M_m (/ (* h M_m) (* (* l d) d))) 1.0))))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 ((1.0 - (pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l))) <= 5e+228) {
tmp = w0 * 1.0;
} else {
tmp = w0 * fma(((D_m * D_m) * -0.125), (M_m * ((h * M_m) / ((l * d) * d))), 1.0);
}
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(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))) <= 5e+228) tmp = Float64(w0 * 1.0); else tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(M_m * Float64(Float64(h * M_m) / Float64(Float64(l * d) * d))), 1.0)); 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[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e+228], N[(w0 * 1.0), $MachinePrecision], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(M$95$m * N[(N[(h * M$95$m), $MachinePrecision] / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $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}\;1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq 5 \cdot 10^{+228}:\\
\;\;\;\;w0 \cdot 1\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, M\_m \cdot \frac{h \cdot M\_m}{\left(\ell \cdot d\right) \cdot d}, 1\right)\\
\end{array}
\end{array}
if (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))) < 5e228Initial program 99.7%
Taylor expanded in M around 0
Applied rewrites90.9%
if 5e228 < (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))) Initial program 38.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 rewrites50.0%
Applied rewrites52.4%
Applied rewrites53.7%
Applied rewrites55.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 (<= M_m 1.8e-274)
(* w0 1.0)
(*
w0
(sqrt
(fma
(* (* (/ 0.5 d) M_m) D_m)
(/ (* (* h M_m) (* -0.5 D_m)) (* l d))
1.0)))))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 <= 1.8e-274) {
tmp = w0 * 1.0;
} else {
tmp = w0 * sqrt(fma((((0.5 / d) * M_m) * D_m), (((h * M_m) * (-0.5 * D_m)) / (l * d)), 1.0));
}
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 <= 1.8e-274) tmp = Float64(w0 * 1.0); else tmp = Float64(w0 * sqrt(fma(Float64(Float64(Float64(0.5 / d) * M_m) * D_m), Float64(Float64(Float64(h * M_m) * Float64(-0.5 * D_m)) / Float64(l * d)), 1.0))); 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, 1.8e-274], N[(w0 * 1.0), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(N[(h * M$95$m), $MachinePrecision] * N[(-0.5 * D$95$m), $MachinePrecision]), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $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 1.8 \cdot 10^{-274}:\\
\;\;\;\;w0 \cdot 1\\
\mathbf{else}:\\
\;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, \frac{\left(h \cdot M\_m\right) \cdot \left(-0.5 \cdot D\_m\right)}{\ell \cdot d}, 1\right)}\\
\end{array}
\end{array}
if M < 1.79999999999999991e-274Initial program 81.2%
Taylor expanded in M around 0
Applied rewrites67.1%
if 1.79999999999999991e-274 < M Initial program 78.6%
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.5%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6490.9
Applied rewrites90.9%
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
*-commutativeN/A
lower-*.f6484.2
Applied rewrites84.2%
Applied rewrites84.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 (<= M_m 2.3e-160) (* w0 1.0) (fma -0.125 (/ (* (* (/ (* (* (* M_m M_m) h) w0) d) D_m) (/ D_m d)) l) 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 <= 2.3e-160) {
tmp = w0 * 1.0;
} else {
tmp = fma(-0.125, (((((((M_m * M_m) * h) * w0) / d) * D_m) * (D_m / d)) / l), 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 <= 2.3e-160) tmp = Float64(w0 * 1.0); else tmp = fma(-0.125, Float64(Float64(Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) * w0) / d) * D_m) * Float64(D_m / d)) / l), 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, 2.3e-160], N[(w0 * 1.0), $MachinePrecision], N[(-0.125 * N[(N[(N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * w0), $MachinePrecision] / d), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] / l), $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 2.3 \cdot 10^{-160}:\\
\;\;\;\;w0 \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-0.125, \frac{\left(\frac{\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot w0}{d} \cdot D\_m\right) \cdot \frac{D\_m}{d}}{\ell}, w0\right)\\
\end{array}
\end{array}
if M < 2.29999999999999985e-160Initial program 82.5%
Taylor expanded in M around 0
Applied rewrites70.7%
if 2.29999999999999985e-160 < M Initial program 75.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 rewrites87.1%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6489.2
Applied rewrites89.2%
Taylor expanded in M around 0
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
Applied rewrites60.9%
Applied rewrites62.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 (* w0 (fma (* (* (* h (/ (/ M_m d) l)) (/ M_m d)) D_m) (* -0.125 D_m) 1.0)))
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 w0 * fma((((h * ((M_m / d) / l)) * (M_m / d)) * D_m), (-0.125 * D_m), 1.0);
}
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(w0 * fma(Float64(Float64(Float64(h * Float64(Float64(M_m / d) / l)) * Float64(M_m / d)) * D_m), Float64(-0.125 * D_m), 1.0)) 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[(w0 * N[(N[(N[(N[(h * N[(N[(M$95$m / d), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $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])\\
\\
w0 \cdot \mathsf{fma}\left(\left(\left(h \cdot \frac{\frac{M\_m}{d}}{\ell}\right) \cdot \frac{M\_m}{d}\right) \cdot D\_m, -0.125 \cdot D\_m, 1\right)
\end{array}
Initial program 80.1%
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 rewrites55.2%
Applied rewrites58.0%
Applied rewrites75.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 (fma (/ -0.125 l) (/ (* (* (/ (* (* (* M_m M_m) h) w0) d) D_m) D_m) 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) {
return fma((-0.125 / l), (((((((M_m * M_m) * h) * w0) / d) * D_m) * D_m) / d), 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 fma(Float64(-0.125 / l), Float64(Float64(Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) * w0) / d) * D_m) * D_m) / d), 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[(-0.125 / l), $MachinePrecision] * N[(N[(N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * w0), $MachinePrecision] / d), $MachinePrecision] * D$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / d), $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{-0.125}{\ell}, \frac{\left(\frac{\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot w0}{d} \cdot D\_m\right) \cdot D\_m}{d}, w0\right)
\end{array}
Initial program 80.1%
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 rewrites87.6%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6487.2
Applied rewrites87.2%
Taylor expanded in M around 0
+-commutativeN/A
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
Applied rewrites59.2%
Applied rewrites68.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 (* w0 1.0))
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 w0 * 1.0;
}
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 = w0 * 1.0d0
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 w0 * 1.0;
}
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 w0 * 1.0
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(w0 * 1.0) 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 = w0 * 1.0;
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[(w0 * 1.0), $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])\\
\\
w0 \cdot 1
\end{array}
Initial program 80.1%
Taylor expanded in M around 0
Applied rewrites68.7%
herbie shell --seed 2024322
(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))))))