
(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 15 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)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(let* ((t_0 (* D_m (* M_m (/ 0.5 d_m)))))
(if (<= (/ (* D_m M_m) (* 2.0 d_m)) 4e+70)
(* (sqrt (fma (* (/ (/ (* -0.5 (* D_m M_m)) d_m) l) t_0) h 1.0)) w0)
(* (sqrt (fma t_0 (* (/ (* D_m 0.5) (- l)) (* h (/ M_m d_m))) 1.0)) w0))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = D_m * (M_m * (0.5 / d_m));
double tmp;
if (((D_m * M_m) / (2.0 * d_m)) <= 4e+70) {
tmp = sqrt(fma(((((-0.5 * (D_m * M_m)) / d_m) / l) * t_0), h, 1.0)) * w0;
} else {
tmp = sqrt(fma(t_0, (((D_m * 0.5) / -l) * (h * (M_m / d_m))), 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(D_m * Float64(M_m * Float64(0.5 / d_m))) tmp = 0.0 if (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) <= 4e+70) tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(-0.5 * Float64(D_m * M_m)) / d_m) / l) * t_0), h, 1.0)) * w0); else tmp = Float64(sqrt(fma(t_0, Float64(Float64(Float64(D_m * 0.5) / Float64(-l)) * Float64(h * Float64(M_m / d_m))), 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(D$95$m * N[(M$95$m * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 4e+70], N[(N[Sqrt[N[(N[(N[(N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] / l), $MachinePrecision] * t$95$0), $MachinePrecision] * h + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(t$95$0 * N[(N[(N[(D$95$m * 0.5), $MachinePrecision] / (-l)), $MachinePrecision] * N[(h * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := D\_m \cdot \left(M\_m \cdot \frac{0.5}{d\_m}\right)\\
\mathbf{if}\;\frac{D\_m \cdot M\_m}{2 \cdot d\_m} \leq 4 \cdot 10^{+70}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\frac{-0.5 \cdot \left(D\_m \cdot M\_m\right)}{d\_m}}{\ell} \cdot t\_0, h, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(t\_0, \frac{D\_m \cdot 0.5}{-\ell} \cdot \left(h \cdot \frac{M\_m}{d\_m}\right), 1\right)} \cdot w0\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 4.00000000000000029e70Initial program 83.7%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites88.1%
Applied rewrites89.9%
if 4.00000000000000029e70 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 50.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 rewrites52.5%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6452.4
Applied rewrites52.4%
Final simplification83.2%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<=
(* (sqrt (- 1.0 (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d_m)) 2.0)))) w0)
5e+222)
(*
(sqrt
(fma
(* (* (* 0.25 M_m) (* (/ D_m d_m) M_m)) (/ (- h) l))
(/ D_m d_m)
1.0))
w0)
(*
(sqrt
(fma
D_m
(* (* (* (/ (* -0.5 D_m) l) (/ M_m d_m)) (* M_m (/ 0.5 d_m))) h)
1.0))
w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((sqrt((1.0 - ((h / l) * pow(((D_m * M_m) / (2.0 * d_m)), 2.0)))) * w0) <= 5e+222) {
tmp = sqrt(fma((((0.25 * M_m) * ((D_m / d_m) * M_m)) * (-h / l)), (D_m / d_m), 1.0)) * w0;
} else {
tmp = sqrt(fma(D_m, (((((-0.5 * D_m) / l) * (M_m / d_m)) * (M_m * (0.5 / d_m))) * h), 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(sqrt(Float64(1.0 - Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) ^ 2.0)))) * w0) <= 5e+222) tmp = Float64(sqrt(fma(Float64(Float64(Float64(0.25 * M_m) * Float64(Float64(D_m / d_m) * M_m)) * Float64(Float64(-h) / l)), Float64(D_m / d_m), 1.0)) * w0); else tmp = Float64(sqrt(fma(D_m, Float64(Float64(Float64(Float64(Float64(-0.5 * D_m) / l) * Float64(M_m / d_m)) * Float64(M_m * Float64(0.5 / d_m))) * h), 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Sqrt[N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], 5e+222], N[(N[Sqrt[N[(N[(N[(N[(0.25 * M$95$m), $MachinePrecision] * N[(N[(D$95$m / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * N[((-h) / l), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(D$95$m * N[(N[(N[(N[(N[(-0.5 * D$95$m), $MachinePrecision] / l), $MachinePrecision] * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision] * N[(M$95$m * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\sqrt{1 - \frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d\_m}\right)}^{2}} \cdot w0 \leq 5 \cdot 10^{+222}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\left(0.25 \cdot M\_m\right) \cdot \left(\frac{D\_m}{d\_m} \cdot M\_m\right)\right) \cdot \frac{-h}{\ell}, \frac{D\_m}{d\_m}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(D\_m, \left(\left(\frac{-0.5 \cdot D\_m}{\ell} \cdot \frac{M\_m}{d\_m}\right) \cdot \left(M\_m \cdot \frac{0.5}{d\_m}\right)\right) \cdot h, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 w0 (sqrt.f64 (-.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))))) < 5.00000000000000023e222Initial program 88.7%
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 rewrites76.7%
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-*.f6485.1
Applied rewrites85.1%
if 5.00000000000000023e222 < (*.f64 w0 (sqrt.f64 (-.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 48.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 rewrites70.2%
Applied rewrites67.3%
lift-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites72.9%
Final simplification81.7%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<=
(* (sqrt (- 1.0 (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d_m)) 2.0)))) w0)
2e+202)
(*
(sqrt
(fma
(* (* (* 0.25 M_m) (* (/ D_m d_m) M_m)) (/ (- h) l))
(/ D_m d_m)
1.0))
w0)
(*
(sqrt
(fma
(* (* (/ M_m (* l d_m)) (* -0.5 D_m)) (* D_m (* M_m (/ 0.5 d_m))))
h
1.0))
w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((sqrt((1.0 - ((h / l) * pow(((D_m * M_m) / (2.0 * d_m)), 2.0)))) * w0) <= 2e+202) {
tmp = sqrt(fma((((0.25 * M_m) * ((D_m / d_m) * M_m)) * (-h / l)), (D_m / d_m), 1.0)) * w0;
} else {
tmp = sqrt(fma((((M_m / (l * d_m)) * (-0.5 * D_m)) * (D_m * (M_m * (0.5 / d_m)))), h, 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(sqrt(Float64(1.0 - Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) ^ 2.0)))) * w0) <= 2e+202) tmp = Float64(sqrt(fma(Float64(Float64(Float64(0.25 * M_m) * Float64(Float64(D_m / d_m) * M_m)) * Float64(Float64(-h) / l)), Float64(D_m / d_m), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(M_m / Float64(l * d_m)) * Float64(-0.5 * D_m)) * Float64(D_m * Float64(M_m * Float64(0.5 / d_m)))), h, 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Sqrt[N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], 2e+202], N[(N[Sqrt[N[(N[(N[(N[(0.25 * M$95$m), $MachinePrecision] * N[(N[(D$95$m / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * N[((-h) / l), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(M$95$m / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] * N[(-0.5 * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * N[(M$95$m * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * h + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\sqrt{1 - \frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d\_m}\right)}^{2}} \cdot w0 \leq 2 \cdot 10^{+202}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\left(0.25 \cdot M\_m\right) \cdot \left(\frac{D\_m}{d\_m} \cdot M\_m\right)\right) \cdot \frac{-h}{\ell}, \frac{D\_m}{d\_m}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\frac{M\_m}{\ell \cdot d\_m} \cdot \left(-0.5 \cdot D\_m\right)\right) \cdot \left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d\_m}\right)\right), h, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 w0 (sqrt.f64 (-.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.9999999999999998e202Initial program 88.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 rewrites76.5%
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-*.f6484.9
Applied rewrites84.9%
if 1.9999999999999998e202 < (*.f64 w0 (sqrt.f64 (-.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 49.8%
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 rewrites71.0%
Applied rewrites68.2%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6469.6
Applied rewrites69.6%
Final simplification80.6%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d_m)) 2.0)) -1e+27)
(*
(sqrt (* (* -0.25 h) (* (* (/ (/ (/ D_m d_m) d_m) l) (* D_m M_m)) M_m)))
w0)
(* 1.0 w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27) {
tmp = sqrt(((-0.25 * h) * (((((D_m / d_m) / d_m) / l) * (D_m * M_m)) * M_m))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = abs(d)
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
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_m_1
real(8) :: tmp
if (((h / l) * (((d_m * m_m) / (2.0d0 * d_m_1)) ** 2.0d0)) <= (-1d+27)) then
tmp = sqrt((((-0.25d0) * h) * (((((d_m / d_m_1) / d_m_1) / l) * (d_m * m_m)) * m_m))) * w0
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
d_m = Math.abs(d);
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_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * Math.pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27) {
tmp = Math.sqrt(((-0.25 * h) * (((((D_m / d_m) / d_m) / l) * (D_m * M_m)) * M_m))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if ((h / l) * math.pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27: tmp = math.sqrt(((-0.25 * h) * (((((D_m / d_m) / d_m) / l) * (D_m * M_m)) * M_m))) * w0 else: tmp = 1.0 * w0 return tmp
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) ^ 2.0)) <= -1e+27) tmp = Float64(sqrt(Float64(Float64(-0.25 * h) * Float64(Float64(Float64(Float64(Float64(D_m / d_m) / d_m) / l) * Float64(D_m * M_m)) * M_m))) * w0); else tmp = Float64(1.0 * w0); end return tmp end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (((h / l) * (((D_m * M_m) / (2.0 * d_m)) ^ 2.0)) <= -1e+27)
tmp = sqrt(((-0.25 * h) * (((((D_m / d_m) / d_m) / l) * (D_m * M_m)) * M_m))) * w0;
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -1e+27], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(N[(D$95$m / d$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] / l), $MachinePrecision] * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d\_m}\right)}^{2} \leq -1 \cdot 10^{+27}:\\
\;\;\;\;\sqrt{\left(-0.25 \cdot h\right) \cdot \left(\left(\frac{\frac{\frac{D\_m}{d\_m}}{d\_m}}{\ell} \cdot \left(D\_m \cdot M\_m\right)\right) \cdot M\_m\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)) < -1e27Initial program 60.5%
Taylor expanded in h around inf
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites34.8%
Applied rewrites49.0%
if -1e27 < (*.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 h around 0
Applied rewrites95.5%
Final simplification78.4%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d_m)) 2.0)) -1e+27)
(*
(sqrt (* (* (/ (/ (* (* D_m M_m) D_m) (* l d_m)) d_m) M_m) (* -0.25 h)))
w0)
(* 1.0 w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27) {
tmp = sqrt(((((((D_m * M_m) * D_m) / (l * d_m)) / d_m) * M_m) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = abs(d)
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
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_m_1
real(8) :: tmp
if (((h / l) * (((d_m * m_m) / (2.0d0 * d_m_1)) ** 2.0d0)) <= (-1d+27)) then
tmp = sqrt(((((((d_m * m_m) * d_m) / (l * d_m_1)) / d_m_1) * m_m) * ((-0.25d0) * h))) * w0
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
d_m = Math.abs(d);
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_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * Math.pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27) {
tmp = Math.sqrt(((((((D_m * M_m) * D_m) / (l * d_m)) / d_m) * M_m) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if ((h / l) * math.pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27: tmp = math.sqrt(((((((D_m * M_m) * D_m) / (l * d_m)) / d_m) * M_m) * (-0.25 * h))) * w0 else: tmp = 1.0 * w0 return tmp
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) ^ 2.0)) <= -1e+27) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(Float64(D_m * M_m) * D_m) / Float64(l * d_m)) / d_m) * M_m) * Float64(-0.25 * h))) * w0); else tmp = Float64(1.0 * w0); end return tmp end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (((h / l) * (((D_m * M_m) / (2.0 * d_m)) ^ 2.0)) <= -1e+27)
tmp = sqrt(((((((D_m * M_m) * D_m) / (l * d_m)) / d_m) * M_m) * (-0.25 * h))) * w0;
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -1e+27], N[(N[Sqrt[N[(N[(N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(-0.25 * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d\_m}\right)}^{2} \leq -1 \cdot 10^{+27}:\\
\;\;\;\;\sqrt{\left(\frac{\frac{\left(D\_m \cdot M\_m\right) \cdot D\_m}{\ell \cdot d\_m}}{d\_m} \cdot M\_m\right) \cdot \left(-0.25 \cdot h\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -1e27Initial program 60.5%
Taylor expanded in h around inf
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites34.8%
Applied rewrites40.4%
Applied rewrites49.2%
Applied rewrites52.2%
if -1e27 < (*.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 h around 0
Applied rewrites95.5%
Final simplification79.6%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d_m)) 2.0)) -1e+27)
(*
(sqrt (* (* (* (/ D_m (* (* l d_m) d_m)) M_m) (* D_m M_m)) (* -0.25 h)))
w0)
(* 1.0 w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27) {
tmp = sqrt(((((D_m / ((l * d_m) * d_m)) * M_m) * (D_m * M_m)) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = abs(d)
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
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_m_1
real(8) :: tmp
if (((h / l) * (((d_m * m_m) / (2.0d0 * d_m_1)) ** 2.0d0)) <= (-1d+27)) then
tmp = sqrt(((((d_m / ((l * d_m_1) * d_m_1)) * m_m) * (d_m * m_m)) * ((-0.25d0) * h))) * w0
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
d_m = Math.abs(d);
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_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * Math.pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27) {
tmp = Math.sqrt(((((D_m / ((l * d_m) * d_m)) * M_m) * (D_m * M_m)) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if ((h / l) * math.pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27: tmp = math.sqrt(((((D_m / ((l * d_m) * d_m)) * M_m) * (D_m * M_m)) * (-0.25 * h))) * w0 else: tmp = 1.0 * w0 return tmp
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) ^ 2.0)) <= -1e+27) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(D_m / Float64(Float64(l * d_m) * d_m)) * M_m) * Float64(D_m * M_m)) * Float64(-0.25 * h))) * w0); else tmp = Float64(1.0 * w0); end return tmp end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (((h / l) * (((D_m * M_m) / (2.0 * d_m)) ^ 2.0)) <= -1e+27)
tmp = sqrt(((((D_m / ((l * d_m) * d_m)) * M_m) * (D_m * M_m)) * (-0.25 * h))) * w0;
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -1e+27], N[(N[Sqrt[N[(N[(N[(N[(D$95$m / N[(N[(l * d$95$m), $MachinePrecision] * d$95$m), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(-0.25 * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d\_m}\right)}^{2} \leq -1 \cdot 10^{+27}:\\
\;\;\;\;\sqrt{\left(\left(\frac{D\_m}{\left(\ell \cdot d\_m\right) \cdot d\_m} \cdot M\_m\right) \cdot \left(D\_m \cdot M\_m\right)\right) \cdot \left(-0.25 \cdot h\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -1e27Initial program 60.5%
Taylor expanded in h around inf
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites34.8%
Applied rewrites40.4%
Applied rewrites49.3%
if -1e27 < (*.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 h around 0
Applied rewrites95.5%
Final simplification78.5%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d_m)) 2.0)) -1e+27)
(*
(sqrt (* (* (* (/ D_m (* (* l d_m) d_m)) (* D_m M_m)) M_m) (* -0.25 h)))
w0)
(* 1.0 w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27) {
tmp = sqrt(((((D_m / ((l * d_m) * d_m)) * (D_m * M_m)) * M_m) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = abs(d)
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
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_m_1
real(8) :: tmp
if (((h / l) * (((d_m * m_m) / (2.0d0 * d_m_1)) ** 2.0d0)) <= (-1d+27)) then
tmp = sqrt(((((d_m / ((l * d_m_1) * d_m_1)) * (d_m * m_m)) * m_m) * ((-0.25d0) * h))) * w0
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
d_m = Math.abs(d);
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_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * Math.pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27) {
tmp = Math.sqrt(((((D_m / ((l * d_m) * d_m)) * (D_m * M_m)) * M_m) * (-0.25 * h))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): tmp = 0 if ((h / l) * math.pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -1e+27: tmp = math.sqrt(((((D_m / ((l * d_m) * d_m)) * (D_m * M_m)) * M_m) * (-0.25 * h))) * w0 else: tmp = 1.0 * w0 return tmp
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) ^ 2.0)) <= -1e+27) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(D_m / Float64(Float64(l * d_m) * d_m)) * Float64(D_m * M_m)) * M_m) * Float64(-0.25 * h))) * w0); else tmp = Float64(1.0 * w0); end return tmp end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d_m)
tmp = 0.0;
if (((h / l) * (((D_m * M_m) / (2.0 * d_m)) ^ 2.0)) <= -1e+27)
tmp = sqrt(((((D_m / ((l * d_m) * d_m)) * (D_m * M_m)) * M_m) * (-0.25 * h))) * w0;
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -1e+27], N[(N[Sqrt[N[(N[(N[(N[(D$95$m / N[(N[(l * d$95$m), $MachinePrecision] * d$95$m), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(-0.25 * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d\_m}\right)}^{2} \leq -1 \cdot 10^{+27}:\\
\;\;\;\;\sqrt{\left(\left(\frac{D\_m}{\left(\ell \cdot d\_m\right) \cdot d\_m} \cdot \left(D\_m \cdot M\_m\right)\right) \cdot M\_m\right) \cdot \left(-0.25 \cdot h\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -1e27Initial program 60.5%
Taylor expanded in h around inf
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites34.8%
Applied rewrites40.4%
Applied rewrites49.2%
if -1e27 < (*.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 h around 0
Applied rewrites95.5%
Final simplification78.5%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d_m)) 2.0)) -5e+67)
(fma
(* -0.125 w0)
(* (/ (* (* (* D_m D_m) h) M_m) (* l d_m)) (/ M_m d_m))
w0)
(* 1.0 w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -5e+67) {
tmp = fma((-0.125 * w0), (((((D_m * D_m) * h) * M_m) / (l * d_m)) * (M_m / d_m)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) ^ 2.0)) <= -5e+67) tmp = fma(Float64(-0.125 * w0), Float64(Float64(Float64(Float64(Float64(D_m * D_m) * h) * M_m) / Float64(l * d_m)) * Float64(M_m / d_m)), w0); else tmp = Float64(1.0 * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+67], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d\_m}\right)}^{2} \leq -5 \cdot 10^{+67}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{\left(\left(D\_m \cdot D\_m\right) \cdot h\right) \cdot M\_m}{\ell \cdot d\_m} \cdot \frac{M\_m}{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)) < -4.99999999999999976e67Initial program 58.4%
Taylor expanded in h around 0
Applied rewrites4.8%
Taylor expanded in h around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites28.8%
Taylor expanded in w0 around 0
Applied rewrites30.7%
Applied rewrites41.8%
if -4.99999999999999976e67 < (*.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 h around 0
Applied rewrites92.9%
Final simplification75.1%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d_m)) 2.0)) -5e+58)
(fma
(* -0.125 w0)
(* (/ M_m l) (/ (* (* (* D_m D_m) h) M_m) (* d_m d_m)))
w0)
(* 1.0 w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -5e+58) {
tmp = fma((-0.125 * w0), ((M_m / l) * ((((D_m * D_m) * h) * M_m) / (d_m * d_m))), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) ^ 2.0)) <= -5e+58) tmp = fma(Float64(-0.125 * w0), Float64(Float64(M_m / l) * Float64(Float64(Float64(Float64(D_m * D_m) * h) * M_m) / Float64(d_m * d_m))), w0); else tmp = Float64(1.0 * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+58], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(M$95$m / l), $MachinePrecision] * N[(N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision] / N[(d$95$m * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d\_m}\right)}^{2} \leq -5 \cdot 10^{+58}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{M\_m}{\ell} \cdot \frac{\left(\left(D\_m \cdot D\_m\right) \cdot h\right) \cdot M\_m}{d\_m \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)) < -4.99999999999999986e58Initial program 59.3%
Taylor expanded in h around 0
Applied rewrites4.9%
Taylor expanded in h around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites28.3%
Taylor expanded in w0 around 0
Applied rewrites30.0%
Applied rewrites35.2%
if -4.99999999999999986e58 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 87.9%
Taylor expanded in h around 0
Applied rewrites93.9%
Final simplification73.1%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* 2.0 d_m)) 2.0)) -5e+67)
(fma
(* -0.125 w0)
(* (/ M_m (* (* d_m d_m) l)) (* (* (* D_m D_m) h) M_m))
w0)
(* 1.0 w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (2.0 * d_m)), 2.0)) <= -5e+67) {
tmp = fma((-0.125 * w0), ((M_m / ((d_m * d_m) * l)) * (((D_m * D_m) * h) * M_m)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) ^ 2.0)) <= -5e+67) tmp = fma(Float64(-0.125 * w0), Float64(Float64(M_m / Float64(Float64(d_m * d_m) * l)) * Float64(Float64(Float64(D_m * D_m) * h) * M_m)), w0); else tmp = Float64(1.0 * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+67], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(M$95$m / N[(N[(d$95$m * d$95$m), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{2 \cdot d\_m}\right)}^{2} \leq -5 \cdot 10^{+67}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{M\_m}{\left(d\_m \cdot d\_m\right) \cdot \ell} \cdot \left(\left(\left(D\_m \cdot D\_m\right) \cdot h\right) \cdot M\_m\right), w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -4.99999999999999976e67Initial program 58.4%
Taylor expanded in h around 0
Applied rewrites4.8%
Taylor expanded in h around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites28.8%
Taylor expanded in w0 around 0
Applied rewrites30.7%
Applied rewrites35.7%
if -4.99999999999999976e67 < (*.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 h around 0
Applied rewrites92.9%
Final simplification73.0%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(let* ((t_0 (* M_m (/ 0.5 d_m))))
(if (<= (/ (* D_m M_m) (* 2.0 d_m)) 2e+17)
(*
(sqrt (fma (* (/ (/ (* -0.5 (* D_m M_m)) d_m) l) (* D_m t_0)) h 1.0))
w0)
(*
(sqrt (fma D_m (* (* (* (/ (* -0.5 D_m) l) (/ M_m d_m)) t_0) h) 1.0))
w0))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = M_m * (0.5 / d_m);
double tmp;
if (((D_m * M_m) / (2.0 * d_m)) <= 2e+17) {
tmp = sqrt(fma(((((-0.5 * (D_m * M_m)) / d_m) / l) * (D_m * t_0)), h, 1.0)) * w0;
} else {
tmp = sqrt(fma(D_m, (((((-0.5 * D_m) / l) * (M_m / d_m)) * t_0) * h), 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(M_m * Float64(0.5 / d_m)) tmp = 0.0 if (Float64(Float64(D_m * M_m) / Float64(2.0 * d_m)) <= 2e+17) tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(-0.5 * Float64(D_m * M_m)) / d_m) / l) * Float64(D_m * t_0)), h, 1.0)) * w0); else tmp = Float64(sqrt(fma(D_m, Float64(Float64(Float64(Float64(Float64(-0.5 * D_m) / l) * Float64(M_m / d_m)) * t_0) * h), 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(M$95$m * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2e+17], N[(N[Sqrt[N[(N[(N[(N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] / l), $MachinePrecision] * N[(D$95$m * t$95$0), $MachinePrecision]), $MachinePrecision] * h + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(D$95$m * N[(N[(N[(N[(N[(-0.5 * D$95$m), $MachinePrecision] / l), $MachinePrecision] * N[(M$95$m / d$95$m), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision] * h), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := M\_m \cdot \frac{0.5}{d\_m}\\
\mathbf{if}\;\frac{D\_m \cdot M\_m}{2 \cdot d\_m} \leq 2 \cdot 10^{+17}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\frac{-0.5 \cdot \left(D\_m \cdot M\_m\right)}{d\_m}}{\ell} \cdot \left(D\_m \cdot t\_0\right), h, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(D\_m, \left(\left(\frac{-0.5 \cdot D\_m}{\ell} \cdot \frac{M\_m}{d\_m}\right) \cdot t\_0\right) \cdot h, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 2e17Initial program 83.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.6%
Applied rewrites90.5%
if 2e17 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 55.8%
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 rewrites56.0%
Applied rewrites52.4%
lift-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites54.1%
Final simplification82.8%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* 2.0 d_m) 5e+59)
(*
(sqrt
(fma
(* D_m (* M_m (/ 0.5 d_m)))
(/ (* (* -0.5 (* D_m M_m)) h) (* l d_m))
1.0))
w0)
(*
(sqrt
(fma (* (/ (* (* M_m M_m) h) l) (* -0.25 (/ D_m d_m))) (/ D_m d_m) 1.0))
w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((2.0 * d_m) <= 5e+59) {
tmp = sqrt(fma((D_m * (M_m * (0.5 / d_m))), (((-0.5 * (D_m * M_m)) * h) / (l * d_m)), 1.0)) * w0;
} else {
tmp = sqrt(fma(((((M_m * M_m) * h) / l) * (-0.25 * (D_m / d_m))), (D_m / d_m), 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(2.0 * d_m) <= 5e+59) tmp = Float64(sqrt(fma(Float64(D_m * Float64(M_m * Float64(0.5 / d_m))), Float64(Float64(Float64(-0.5 * Float64(D_m * M_m)) * h) / Float64(l * d_m)), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(M_m * M_m) * h) / l) * Float64(-0.25 * Float64(D_m / d_m))), Float64(D_m / d_m), 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(2.0 * d$95$m), $MachinePrecision], 5e+59], N[(N[Sqrt[N[(N[(D$95$m * N[(M$95$m * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision] * N[(-0.25 * N[(D$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;2 \cdot d\_m \leq 5 \cdot 10^{+59}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d\_m}\right), \frac{\left(-0.5 \cdot \left(D\_m \cdot M\_m\right)\right) \cdot h}{\ell \cdot d\_m}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(M\_m \cdot M\_m\right) \cdot h}{\ell} \cdot \left(-0.25 \cdot \frac{D\_m}{d\_m}\right), \frac{D\_m}{d\_m}, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 #s(literal 2 binary64) d) < 4.9999999999999997e59Initial program 78.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 rewrites78.9%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
Applied rewrites74.8%
if 4.9999999999999997e59 < (*.f64 #s(literal 2 binary64) d) Initial program 75.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 rewrites74.4%
Taylor expanded in h around 0
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6477.9
Applied rewrites77.9%
Final simplification75.5%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(*
(sqrt
(fma
(* D_m (* M_m (/ 0.5 d_m)))
(/ (* (* h (/ M_m d_m)) (* D_m 0.5)) (- l))
1.0))
w0))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return sqrt(fma((D_m * (M_m * (0.5 / d_m))), (((h * (M_m / d_m)) * (D_m * 0.5)) / -l), 1.0)) * w0;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) return Float64(sqrt(fma(Float64(D_m * Float64(M_m * Float64(0.5 / d_m))), Float64(Float64(Float64(h * Float64(M_m / d_m)) * Float64(D_m * 0.5)) / Float64(-l)), 1.0)) * w0) end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := N[(N[Sqrt[N[(N[(D$95$m * N[(M$95$m * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h * N[(M$95$m / d$95$m), $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|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\sqrt{\mathsf{fma}\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d\_m}\right), \frac{\left(h \cdot \frac{M\_m}{d\_m}\right) \cdot \left(D\_m \cdot 0.5\right)}{-\ell}, 1\right)} \cdot w0
\end{array}
Initial program 77.7%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites81.7%
Final simplification81.7%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(*
(sqrt
(fma
(* (* (/ M_m (* l d_m)) (* -0.5 D_m)) (* D_m (* M_m (/ 0.5 d_m))))
h
1.0))
w0))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return sqrt(fma((((M_m / (l * d_m)) * (-0.5 * D_m)) * (D_m * (M_m * (0.5 / d_m)))), h, 1.0)) * w0;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) return Float64(sqrt(fma(Float64(Float64(Float64(M_m / Float64(l * d_m)) * Float64(-0.5 * D_m)) * Float64(D_m * Float64(M_m * Float64(0.5 / d_m)))), h, 1.0)) * w0) end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := N[(N[Sqrt[N[(N[(N[(N[(M$95$m / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] * N[(-0.5 * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * N[(M$95$m * N[(0.5 / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * h + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\sqrt{\mathsf{fma}\left(\left(\frac{M\_m}{\ell \cdot d\_m} \cdot \left(-0.5 \cdot D\_m\right)\right) \cdot \left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d\_m}\right)\right), h, 1\right)} \cdot w0
\end{array}
Initial program 77.7%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites81.7%
Applied rewrites82.5%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6478.9
Applied rewrites78.9%
Final simplification78.9%
d_m = (fabs.f64 d) D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (* 1.0 w0))
d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return 1.0 * w0;
}
d_m = abs(d)
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
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_m_1
code = 1.0d0 * w0
end function
d_m = Math.abs(d);
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_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return 1.0 * w0;
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): return 1.0 * w0
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) return Float64(1.0 * w0) end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp = code(w0, M_m, D_m, h, l, d_m)
tmp = 1.0 * w0;
end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := N[(1.0 * w0), $MachinePrecision]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
1 \cdot w0
\end{array}
Initial program 77.7%
Taylor expanded in h around 0
Applied rewrites62.3%
Final simplification62.3%
herbie shell --seed 2024273
(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))))))