
(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 16 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
(let* ((t_0 (* M_m (/ 0.5 d))))
(if (<= (* D_m M_m) 2e+186)
(* (sqrt (fma (/ (* (/ (* (* D_m M_m) -0.5) d) h) l) (* D_m t_0) 1.0)) w0)
(*
(sqrt (fma t_0 (* (* (/ D_m d) (* (/ -0.5 l) M_m)) (* h 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 t_0 = M_m * (0.5 / d);
double tmp;
if ((D_m * M_m) <= 2e+186) {
tmp = sqrt(fma((((((D_m * M_m) * -0.5) / d) * h) / l), (D_m * t_0), 1.0)) * w0;
} else {
tmp = sqrt(fma(t_0, (((D_m / d) * ((-0.5 / l) * M_m)) * (h * 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) t_0 = Float64(M_m * Float64(0.5 / d)) tmp = 0.0 if (Float64(D_m * M_m) <= 2e+186) tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(Float64(D_m * M_m) * -0.5) / d) * h) / l), Float64(D_m * t_0), 1.0)) * w0); else tmp = Float64(sqrt(fma(t_0, Float64(Float64(Float64(D_m / d) * Float64(Float64(-0.5 / l) * M_m)) * Float64(h * 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_] := Block[{t$95$0 = N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(D$95$m * M$95$m), $MachinePrecision], 2e+186], N[(N[Sqrt[N[(N[(N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * -0.5), $MachinePrecision] / d), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision] * N[(D$95$m * t$95$0), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(t$95$0 * N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(-0.5 / l), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(h * D$95$m), $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}
t_0 := M\_m \cdot \frac{0.5}{d}\\
\mathbf{if}\;D\_m \cdot M\_m \leq 2 \cdot 10^{+186}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\frac{\left(D\_m \cdot M\_m\right) \cdot -0.5}{d} \cdot h}{\ell}, D\_m \cdot t\_0, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(t\_0, \left(\frac{D\_m}{d} \cdot \left(\frac{-0.5}{\ell} \cdot M\_m\right)\right) \cdot \left(h \cdot D\_m\right), 1\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 M D) < 1.99999999999999996e186Initial program 84.7%
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 rewrites85.2%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6491.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.5
Applied rewrites91.5%
if 1.99999999999999996e186 < (*.f64 M D) Initial program 41.8%
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 rewrites41.8%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6443.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6443.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6443.1
Applied rewrites43.1%
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
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
lower-*.f6452.5
Applied rewrites52.5%
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6452.5
Applied rewrites57.1%
Final simplification88.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 (* M_m (/ 0.5 d))))
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) 1e-59)
(* (sqrt (fma (* (/ h l) (/ (* (* D_m M_m) -0.5) d)) (* D_m t_0) 1.0)) w0)
(*
(sqrt (fma t_0 (* (* (/ D_m d) (* (/ -0.5 l) M_m)) (* h 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 t_0 = M_m * (0.5 / d);
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= 1e-59) {
tmp = sqrt(fma(((h / l) * (((D_m * M_m) * -0.5) / d)), (D_m * t_0), 1.0)) * w0;
} else {
tmp = sqrt(fma(t_0, (((D_m / d) * ((-0.5 / l) * M_m)) * (h * 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) t_0 = Float64(M_m * Float64(0.5 / d)) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= 1e-59) tmp = Float64(sqrt(fma(Float64(Float64(h / l) * Float64(Float64(Float64(D_m * M_m) * -0.5) / d)), Float64(D_m * t_0), 1.0)) * w0); else tmp = Float64(sqrt(fma(t_0, Float64(Float64(Float64(D_m / d) * Float64(Float64(-0.5 / l) * M_m)) * Float64(h * 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_] := Block[{t$95$0 = N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]}, 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-59], N[(N[Sqrt[N[(N[(N[(h / l), $MachinePrecision] * N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * -0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * t$95$0), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(t$95$0 * N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(-0.5 / l), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(h * D$95$m), $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}
t_0 := M\_m \cdot \frac{0.5}{d}\\
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq 10^{-59}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{h}{\ell} \cdot \frac{\left(D\_m \cdot M\_m\right) \cdot -0.5}{d}, D\_m \cdot t\_0, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(t\_0, \left(\frac{D\_m}{d} \cdot \left(\frac{-0.5}{\ell} \cdot M\_m\right)\right) \cdot \left(h \cdot D\_m\right), 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)) < 1e-59Initial program 89.6%
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.7%
if 1e-59 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 14.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 rewrites25.7%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6479.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6479.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6479.3
Applied rewrites79.3%
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
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
lower-*.f6479.3
Applied rewrites79.3%
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6479.3
Applied rewrites85.9%
Final simplification88.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
(let* ((t_0 (* M_m (/ 0.5 d))))
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) 1e-59)
(* (sqrt (fma (* (* (* (/ -0.5 d) D_m) M_m) (/ h l)) (* D_m t_0) 1.0)) w0)
(*
(sqrt (fma t_0 (* (* (/ D_m d) (* (/ -0.5 l) M_m)) (* h 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 t_0 = M_m * (0.5 / d);
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= 1e-59) {
tmp = sqrt(fma(((((-0.5 / d) * D_m) * M_m) * (h / l)), (D_m * t_0), 1.0)) * w0;
} else {
tmp = sqrt(fma(t_0, (((D_m / d) * ((-0.5 / l) * M_m)) * (h * 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) t_0 = Float64(M_m * Float64(0.5 / d)) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= 1e-59) tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(-0.5 / d) * D_m) * M_m) * Float64(h / l)), Float64(D_m * t_0), 1.0)) * w0); else tmp = Float64(sqrt(fma(t_0, Float64(Float64(Float64(D_m / d) * Float64(Float64(-0.5 / l) * M_m)) * Float64(h * 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_] := Block[{t$95$0 = N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]}, 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-59], N[(N[Sqrt[N[(N[(N[(N[(N[(-0.5 / d), $MachinePrecision] * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * t$95$0), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(t$95$0 * N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(-0.5 / l), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(h * D$95$m), $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}
t_0 := M\_m \cdot \frac{0.5}{d}\\
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq 10^{-59}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\left(\frac{-0.5}{d} \cdot D\_m\right) \cdot M\_m\right) \cdot \frac{h}{\ell}, D\_m \cdot t\_0, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(t\_0, \left(\frac{D\_m}{d} \cdot \left(\frac{-0.5}{\ell} \cdot M\_m\right)\right) \cdot \left(h \cdot D\_m\right), 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)) < 1e-59Initial program 89.6%
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.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6489.5
Applied rewrites89.5%
if 1e-59 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 14.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 rewrites25.7%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6479.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6479.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6479.3
Applied rewrites79.3%
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
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
lower-*.f6479.3
Applied rewrites79.3%
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6479.3
Applied rewrites85.9%
Final simplification89.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)) 1e-59)
(*
(sqrt
(fma (* (* (* 0.25 M_m) (* (/ D_m d) M_m)) (/ (- h) l)) (/ D_m d) 1.0))
w0)
(*
(sqrt
(fma
(* M_m (/ 0.5 d))
(* (* (/ D_m d) (* (/ -0.5 l) M_m)) (* h 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-59) {
tmp = sqrt(fma((((0.25 * M_m) * ((D_m / d) * M_m)) * (-h / l)), (D_m / d), 1.0)) * w0;
} else {
tmp = sqrt(fma((M_m * (0.5 / d)), (((D_m / d) * ((-0.5 / l) * M_m)) * (h * 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-59) tmp = Float64(sqrt(fma(Float64(Float64(Float64(0.25 * M_m) * Float64(Float64(D_m / d) * M_m)) * Float64(Float64(-h) / l)), Float64(D_m / d), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(M_m * Float64(0.5 / d)), Float64(Float64(Float64(D_m / d) * Float64(Float64(-0.5 / l) * M_m)) * Float64(h * 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-59], N[(N[Sqrt[N[(N[(N[(N[(0.25 * M$95$m), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * N[((-h) / l), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(-0.5 / l), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(h * D$95$m), $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}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq 10^{-59}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\left(0.25 \cdot M\_m\right) \cdot \left(\frac{D\_m}{d} \cdot M\_m\right)\right) \cdot \frac{-h}{\ell}, \frac{D\_m}{d}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(M\_m \cdot \frac{0.5}{d}, \left(\frac{D\_m}{d} \cdot \left(\frac{-0.5}{\ell} \cdot M\_m\right)\right) \cdot \left(h \cdot D\_m\right), 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)) < 1e-59Initial program 89.6%
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.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6489.5
Applied rewrites89.5%
if 1e-59 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 14.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 rewrites25.7%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6479.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6479.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6479.3
Applied rewrites79.3%
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
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
lower-*.f6479.3
Applied rewrites79.3%
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6479.3
Applied rewrites85.9%
Final simplification89.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 (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0))) 1.2)
(* 1.0 w0)
(*
(sqrt
(fma
(* D_m (* M_m (/ 0.5 d)))
(* (/ (* (* D_m M_m) -0.5) (* l d)) h)
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 ((1.0 - ((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0))) <= 1.2) {
tmp = 1.0 * w0;
} else {
tmp = sqrt(fma((D_m * (M_m * (0.5 / d))), ((((D_m * M_m) * -0.5) / (l * d)) * h), 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(1.0 - Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0))) <= 1.2) tmp = Float64(1.0 * w0); else tmp = Float64(sqrt(fma(Float64(D_m * Float64(M_m * Float64(0.5 / d))), Float64(Float64(Float64(Float64(D_m * M_m) * -0.5) / Float64(l * d)) * h), 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[(1.0 - 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]), $MachinePrecision], 1.2], N[(1.0 * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * -0.5), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * h), $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}\;1 - \frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq 1.2:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right), \frac{\left(D\_m \cdot M\_m\right) \cdot -0.5}{\ell \cdot d} \cdot h, 1\right)} \cdot w0\\
\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))) < 1.19999999999999996Initial program 99.4%
Taylor expanded in M around 0
Applied rewrites99.4%
if 1.19999999999999996 < (-.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 47.9%
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.1%
lift-/.f64N/A
frac-2negN/A
Applied rewrites64.2%
Final simplification87.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 (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0))) 2.0)
(* 1.0 w0)
(*
(sqrt (fma (* -0.25 h) (* (/ (* (* M_m M_m) D_m) (* (* l d) d)) 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 ((1.0 - ((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0))) <= 2.0) {
tmp = 1.0 * w0;
} else {
tmp = sqrt(fma((-0.25 * h), ((((M_m * M_m) * D_m) / ((l * d) * d)) * 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(1.0 - Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0))) <= 2.0) tmp = Float64(1.0 * w0); else tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(M_m * M_m) * D_m) / Float64(Float64(l * d) * d)) * 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[(1.0 - 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]), $MachinePrecision], 2.0], N[(1.0 * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;1 - \frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq 2:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{\left(M\_m \cdot M\_m\right) \cdot D\_m}{\left(\ell \cdot d\right) \cdot d} \cdot D\_m, 1\right)} \cdot w0\\
\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))) < 2Initial program 99.4%
Taylor expanded in M around 0
Applied rewrites99.0%
if 2 < (-.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 47.3%
Taylor expanded in M around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites50.1%
Applied rewrites54.2%
Applied rewrites55.5%
Final simplification83.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 (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) -5000000000.0)
(*
(sqrt (fma (* -0.25 h) (/ (* (* (* D_m M_m) M_m) D_m) (* (* l d) d)) 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)) <= -5000000000.0) {
tmp = sqrt(fma((-0.25 * h), ((((D_m * M_m) * M_m) * D_m) / ((l * d) * d)), 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)) <= -5000000000.0) tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(D_m * M_m) * M_m) * D_m) / Float64(Float64(l * d) * d)), 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], -5000000000.0], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -5000000000:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{\left(\left(D\_m \cdot M\_m\right) \cdot M\_m\right) \cdot D\_m}{\left(\ell \cdot d\right) \cdot d}, 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)) < -5e9Initial program 64.8%
Taylor expanded in M around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites45.1%
Applied rewrites49.2%
Applied rewrites53.8%
if -5e9 < (*.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
Applied rewrites95.1%
Final simplification84.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)) -5e+166) (fma (* (* D_m D_m) -0.125) (/ (* (* (* h M_m) M_m) (/ w0 d)) (* l d)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -5e+166) {
tmp = fma(((D_m * D_m) * -0.125), ((((h * M_m) * M_m) * (w0 / d)) / (l * d)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -5e+166) tmp = fma(Float64(Float64(D_m * D_m) * -0.125), Float64(Float64(Float64(Float64(h * M_m) * M_m) * Float64(w0 / d)) / Float64(l * d)), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+166], N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(N[(N[(N[(h * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(w0 / d), $MachinePrecision]), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -5 \cdot 10^{+166}:\\
\;\;\;\;\mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, \frac{\left(\left(h \cdot M\_m\right) \cdot M\_m\right) \cdot \frac{w0}{d}}{\ell \cdot d}, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -5.0000000000000002e166Initial program 55.4%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites47.3%
Taylor expanded in M around 0
+-commutativeN/A
associate-/l*N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites36.7%
Applied rewrites43.2%
if -5.0000000000000002e166 < (*.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
Applied rewrites89.2%
Final simplification80.0%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d)) 2.0)) -2e+139) (fma (* -0.125 w0) (* (/ (* D_m D_m) l) (* (* (/ h (* d d)) M_m) M_m)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -2e+139) {
tmp = fma((-0.125 * w0), (((D_m * D_m) / l) * (((h / (d * d)) * M_m) * M_m)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -2e+139) tmp = fma(Float64(-0.125 * w0), Float64(Float64(Float64(D_m * D_m) / l) * Float64(Float64(Float64(h / Float64(d * d)) * M_m) * M_m)), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -2e+139], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] / l), $MachinePrecision] * N[(N[(N[(h / N[(d * d), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -2 \cdot 10^{+139}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{D\_m \cdot D\_m}{\ell} \cdot \left(\left(\frac{h}{d \cdot d} \cdot M\_m\right) \cdot M\_m\right), w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000007e139Initial program 57.8%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites48.4%
Taylor expanded in M around 0
+-commutativeN/A
associate-/l*N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites34.8%
Taylor expanded in w0 around 0
Applied rewrites40.5%
Applied rewrites39.0%
if -2.00000000000000007e139 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 87.6%
Taylor expanded in M around 0
Applied rewrites90.4%
Final simplification79.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 (* -0.125 w0) (/ (* (* (* (* h M_m) M_m) D_m) D_m) (* (* d d) l)) 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((-0.125 * w0), (((((h * M_m) * M_m) * D_m) * D_m) / ((d * d) * l)), 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 = fma(Float64(-0.125 * w0), Float64(Float64(Float64(Float64(Float64(h * M_m) * M_m) * D_m) * D_m) / Float64(Float64(d * d) * l)), 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[(-0.125 * w0), $MachinePrecision] * N[(N[(N[(N[(N[(h * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{\left(\left(\left(h \cdot M\_m\right) \cdot M\_m\right) \cdot D\_m\right) \cdot D\_m}{\left(d \cdot d\right) \cdot \ell}, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0Initial program 51.6%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites48.9%
Taylor expanded in M around 0
+-commutativeN/A
associate-/l*N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites39.7%
Taylor expanded in w0 around 0
Applied rewrites46.3%
Applied rewrites46.4%
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.0%
Taylor expanded in M around 0
Applied rewrites87.6%
Final simplification80.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)) -5e+166) (fma (* -0.125 w0) (/ (* (* (* (* M_m M_m) h) D_m) D_m) (* (* l d) d)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -5e+166) {
tmp = fma((-0.125 * w0), (((((M_m * M_m) * h) * D_m) * D_m) / ((l * d) * d)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= -5e+166) tmp = fma(Float64(-0.125 * w0), Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) * D_m) * D_m) / Float64(Float64(l * d) * d)), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+166], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * D$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d}\right)}^{2} \leq -5 \cdot 10^{+166}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{\left(\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot D\_m\right) \cdot D\_m}{\left(\ell \cdot d\right) \cdot d}, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -5.0000000000000002e166Initial program 55.4%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites47.3%
Taylor expanded in M around 0
+-commutativeN/A
associate-/l*N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites36.7%
Taylor expanded in w0 around 0
Applied rewrites42.8%
Applied rewrites44.8%
if -5.0000000000000002e166 < (*.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
Applied rewrites89.2%
Final simplification80.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)) (- INFINITY)) (fma (* -0.125 w0) (* (/ (* (* (* M_m M_m) h) D_m) (* (* d d) l)) D_m) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d)), 2.0)) <= -((double) INFINITY)) {
tmp = fma((-0.125 * w0), (((((M_m * M_m) * h) * D_m) / ((d * d) * l)) * D_m), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d)) ^ 2.0)) <= Float64(-Inf)) tmp = fma(Float64(-0.125 * w0), Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) * D_m) / Float64(Float64(d * d) * l)) * D_m), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * D$95$m), $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(-0.125 \cdot w0, \frac{\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot D\_m}{\left(d \cdot d\right) \cdot \ell} \cdot D\_m, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0Initial program 51.6%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites48.9%
Taylor expanded in M around 0
+-commutativeN/A
associate-/l*N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites39.7%
Taylor expanded in w0 around 0
Applied rewrites46.3%
Applied rewrites46.6%
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.0%
Taylor expanded in M around 0
Applied rewrites87.6%
Final simplification80.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 (<= (/ (* D_m M_m) (* 2.0 d)) 2e+30)
(*
(sqrt (fma (* -0.25 h) (/ (* (* (/ M_m l) (* (/ D_m d) M_m)) D_m) d) 1.0))
w0)
(*
(sqrt
(fma
(* D_m (* M_m (/ 0.5 d)))
(* (/ (* (* D_m M_m) -0.5) (* l d)) h)
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)) <= 2e+30) {
tmp = sqrt(fma((-0.25 * h), ((((M_m / l) * ((D_m / d) * M_m)) * D_m) / d), 1.0)) * w0;
} else {
tmp = sqrt(fma((D_m * (M_m * (0.5 / d))), ((((D_m * M_m) * -0.5) / (l * d)) * h), 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)) <= 2e+30) tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(M_m / l) * Float64(Float64(D_m / d) * M_m)) * D_m) / d), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(D_m * Float64(M_m * Float64(0.5 / d))), Float64(Float64(Float64(Float64(D_m * M_m) * -0.5) / Float64(l * d)) * h), 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], 2e+30], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] / d), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * -0.5), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * h), $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}\;\frac{D\_m \cdot M\_m}{2 \cdot d} \leq 2 \cdot 10^{+30}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{\left(\frac{M\_m}{\ell} \cdot \left(\frac{D\_m}{d} \cdot M\_m\right)\right) \cdot D\_m}{d}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right), \frac{\left(D\_m \cdot M\_m\right) \cdot -0.5}{\ell \cdot d} \cdot h, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 2e30Initial program 86.2%
Taylor expanded in M around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites72.6%
Applied rewrites75.8%
Applied rewrites89.6%
if 2e30 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 57.2%
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 rewrites64.5%
lift-/.f64N/A
frac-2negN/A
Applied rewrites64.3%
Final simplification85.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
(* 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.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 rewrites87.3%
Final simplification87.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 (/ (* (* (/ D_m d) M_m) (* -0.5 h)) l) (* D_m (* M_m (/ 0.5 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) {
return sqrt(fma(((((D_m / d) * M_m) * (-0.5 * h)) / l), (D_m * (M_m * (0.5 / d))), 1.0)) * w0;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) return Float64(sqrt(fma(Float64(Float64(Float64(Float64(D_m / d) * M_m) * Float64(-0.5 * h)) / l), Float64(D_m * Float64(M_m * Float64(0.5 / d))), 1.0)) * w0) end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(N[Sqrt[N[(N[(N[(N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(-0.5 * h), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(D$95$m * N[(M$95$m * N[(0.5 / 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])\\
\\
\sqrt{\mathsf{fma}\left(\frac{\left(\frac{D\_m}{d} \cdot M\_m\right) \cdot \left(-0.5 \cdot h\right)}{\ell}, D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right), 1\right)} \cdot w0
\end{array}
Initial program 81.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 rewrites81.8%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6487.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6487.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6487.7
Applied rewrites87.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
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
lower-*.f6488.4
Applied rewrites88.4%
Final simplification88.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 (* 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.3%
Taylor expanded in M around 0
Applied rewrites72.3%
Final simplification72.3%
herbie shell --seed 2024276
(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))))))