
(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)
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 d) (/ D_m 2.0))))
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) 5e-14)
(* (sqrt (- 1.0 (* (* t_0 (/ h l)) t_0))) w0)
(*
(sqrt
(-
1.0
(* (* (/ D_m d) 0.5) (/ (* (* 0.5 D_m) (* (* h M_m) (/ M_m d))) l))))
w0))))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double t_0 = (M_m / d) * (D_m / 2.0);
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= 5e-14) {
tmp = sqrt((1.0 - ((t_0 * (h / l)) * t_0))) * w0;
} else {
tmp = sqrt((1.0 - (((D_m / d) * 0.5) * (((0.5 * D_m) * ((h * M_m) * (M_m / d))) / l)))) * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: t_0
real(8) :: tmp
t_0 = (m_m / d) * (d_m / 2.0d0)
if (((h / l) * (((d_m * m_m) / (d * 2.0d0)) ** 2.0d0)) <= 5d-14) then
tmp = sqrt((1.0d0 - ((t_0 * (h / l)) * t_0))) * w0
else
tmp = sqrt((1.0d0 - (((d_m / d) * 0.5d0) * (((0.5d0 * d_m) * ((h * m_m) * (m_m / d))) / l)))) * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double t_0 = (M_m / d) * (D_m / 2.0);
double tmp;
if (((h / l) * Math.pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= 5e-14) {
tmp = Math.sqrt((1.0 - ((t_0 * (h / l)) * t_0))) * w0;
} else {
tmp = Math.sqrt((1.0 - (((D_m / d) * 0.5) * (((0.5 * D_m) * ((h * M_m) * (M_m / d))) / l)))) * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): t_0 = (M_m / d) * (D_m / 2.0) tmp = 0 if ((h / l) * math.pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= 5e-14: tmp = math.sqrt((1.0 - ((t_0 * (h / l)) * t_0))) * w0 else: tmp = math.sqrt((1.0 - (((D_m / d) * 0.5) * (((0.5 * D_m) * ((h * M_m) * (M_m / d))) / l)))) * w0 return tmp
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) t_0 = Float64(Float64(M_m / d) * Float64(D_m / 2.0)) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= 5e-14) tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(t_0 * Float64(h / l)) * t_0))) * w0); else tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(Float64(D_m / d) * 0.5) * Float64(Float64(Float64(0.5 * D_m) * Float64(Float64(h * M_m) * Float64(M_m / d))) / l)))) * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
t_0 = (M_m / d) * (D_m / 2.0);
tmp = 0.0;
if (((h / l) * (((D_m * M_m) / (d * 2.0)) ^ 2.0)) <= 5e-14)
tmp = sqrt((1.0 - ((t_0 * (h / l)) * t_0))) * w0;
else
tmp = sqrt((1.0 - (((D_m / d) * 0.5) * (((0.5 * D_m) * ((h * M_m) * (M_m / d))) / l)))) * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := Block[{t$95$0 = N[(N[(M$95$m / d), $MachinePrecision] * N[(D$95$m / 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], 5e-14], N[(N[Sqrt[N[(1.0 - N[(N[(t$95$0 * N[(h / l), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(1.0 - N[(N[(N[(D$95$m / d), $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[(N[(0.5 * D$95$m), $MachinePrecision] * N[(N[(h * M$95$m), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
t_0 := \frac{M\_m}{d} \cdot \frac{D\_m}{2}\\
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq 5 \cdot 10^{-14}:\\
\;\;\;\;\sqrt{1 - \left(t\_0 \cdot \frac{h}{\ell}\right) \cdot t\_0} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1 - \left(\frac{D\_m}{d} \cdot 0.5\right) \cdot \frac{\left(0.5 \cdot D\_m\right) \cdot \left(\left(h \cdot M\_m\right) \cdot \frac{M\_m}{d}\right)}{\ell}} \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.0000000000000002e-14Initial program 88.4%
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
unpow-prod-downN/A
associate-*l*N/A
lower-*.f64N/A
div-invN/A
metadata-evalN/A
unpow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
lower-*.f64N/A
pow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-pow.f64N/A
lower-/.f6470.3
Applied rewrites70.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
metadata-evalN/A
unpow-prod-downN/A
metadata-evalN/A
div-invN/A
lift-pow.f64N/A
unpow-prod-downN/A
lift-/.f64N/A
times-fracN/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites89.1%
if 5.0000000000000002e-14 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 4.0%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites13.2%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6473.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6473.7
Applied rewrites73.7%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6473.6
Applied rewrites73.6%
Final simplification87.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 (<= (- 1.0 (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0))) 1.000005)
(* 1.0 w0)
(*
(sqrt
(-
1.0
(* (/ (* (* (* (* D_m M_m) M_m) h) 0.5) (* l d)) (* (/ D_m d) 0.5))))
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) / (d * 2.0)), 2.0))) <= 1.000005) {
tmp = 1.0 * w0;
} else {
tmp = sqrt((1.0 - ((((((D_m * M_m) * M_m) * h) * 0.5) / (l * d)) * ((D_m / d) * 0.5)))) * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if ((1.0d0 - ((h / l) * (((d_m * m_m) / (d * 2.0d0)) ** 2.0d0))) <= 1.000005d0) then
tmp = 1.0d0 * w0
else
tmp = sqrt((1.0d0 - ((((((d_m * m_m) * m_m) * h) * 0.5d0) / (l * d)) * ((d_m / d) * 0.5d0)))) * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((1.0 - ((h / l) * Math.pow(((D_m * M_m) / (d * 2.0)), 2.0))) <= 1.000005) {
tmp = 1.0 * w0;
} else {
tmp = Math.sqrt((1.0 - ((((((D_m * M_m) * M_m) * h) * 0.5) / (l * d)) * ((D_m / d) * 0.5)))) * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if (1.0 - ((h / l) * math.pow(((D_m * M_m) / (d * 2.0)), 2.0))) <= 1.000005: tmp = 1.0 * w0 else: tmp = math.sqrt((1.0 - ((((((D_m * M_m) * M_m) * h) * 0.5) / (l * d)) * ((D_m / d) * 0.5)))) * 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(d * 2.0)) ^ 2.0))) <= 1.000005) tmp = Float64(1.0 * w0); else tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(Float64(Float64(D_m * M_m) * M_m) * h) * 0.5) / Float64(l * d)) * Float64(Float64(D_m / d) * 0.5)))) * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if ((1.0 - ((h / l) * (((D_m * M_m) / (d * 2.0)) ^ 2.0))) <= 1.000005)
tmp = 1.0 * w0;
else
tmp = sqrt((1.0 - ((((((D_m * M_m) * M_m) * h) * 0.5) / (l * d)) * ((D_m / d) * 0.5)))) * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.000005], N[(1.0 * w0), $MachinePrecision], N[(N[Sqrt[N[(1.0 - N[(N[(N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * h), $MachinePrecision] * 0.5), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;1 - \frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq 1.000005:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1 - \frac{\left(\left(\left(D\_m \cdot M\_m\right) \cdot M\_m\right) \cdot h\right) \cdot 0.5}{\ell \cdot d} \cdot \left(\frac{D\_m}{d} \cdot 0.5\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.00000500000000003Initial program 98.8%
Taylor expanded in M around 0
Applied rewrites98.7%
if 1.00000500000000003 < (-.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.5%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites48.8%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6455.3
Applied rewrites55.3%
Applied rewrites58.5%
Final simplification84.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) (* d 2.0)) 2.0)) -1e+114) (* (sqrt (- 1.0 (* (/ (* (* h D_m) M_m) l) (* (* (/ D_m d) 0.5) 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) / (d * 2.0)), 2.0)) <= -1e+114) {
tmp = sqrt((1.0 - ((((h * D_m) * M_m) / l) * (((D_m / d) * 0.5) * M_m)))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (((h / l) * (((d_m * m_m) / (d * 2.0d0)) ** 2.0d0)) <= (-1d+114)) then
tmp = sqrt((1.0d0 - ((((h * d_m) * m_m) / l) * (((d_m / d) * 0.5d0) * m_m)))) * w0
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * Math.pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -1e+114) {
tmp = Math.sqrt((1.0 - ((((h * D_m) * M_m) / l) * (((D_m / d) * 0.5) * M_m)))) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if ((h / l) * math.pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -1e+114: tmp = math.sqrt((1.0 - ((((h * D_m) * M_m) / l) * (((D_m / d) * 0.5) * 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(d * 2.0)) ^ 2.0)) <= -1e+114) tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(h * D_m) * M_m) / l) * Float64(Float64(Float64(D_m / d) * 0.5) * M_m)))) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (((h / l) * (((D_m * M_m) / (d * 2.0)) ^ 2.0)) <= -1e+114)
tmp = sqrt((1.0 - ((((h * D_m) * M_m) / l) * (((D_m / d) * 0.5) * M_m)))) * w0;
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -1e+114], N[(N[Sqrt[N[(1.0 - N[(N[(N[(N[(h * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] / l), $MachinePrecision] * N[(N[(N[(D$95$m / d), $MachinePrecision] * 0.5), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -1 \cdot 10^{+114}:\\
\;\;\;\;\sqrt{1 - \frac{\left(h \cdot D\_m\right) \cdot M\_m}{\ell} \cdot \left(\left(\frac{D\_m}{d} \cdot 0.5\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)) < -1e114Initial program 59.7%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-/.f64N/A
associate-/r*N/A
associate-*r/N/A
associate-*r/N/A
Applied rewrites19.2%
lift-/.f64N/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites19.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
div-invN/A
lift-/.f64N/A
times-fracN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites19.2%
if -1e114 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 87.0%
Taylor expanded in M around 0
Applied rewrites92.6%
Final simplification74.2%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (pow (/ (* D_m M_m) (* d 2.0)) 2.0) 5e-24)
(* 1.0 w0)
(*
(sqrt
(-
1.0
(* (/ (* (* (* (/ M_m d) M_m) 0.5) D_m) (* l d)) (* (* 0.5 D_m) h))))
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 (pow(((D_m * M_m) / (d * 2.0)), 2.0) <= 5e-24) {
tmp = 1.0 * w0;
} else {
tmp = sqrt((1.0 - ((((((M_m / d) * M_m) * 0.5) * D_m) / (l * d)) * ((0.5 * D_m) * h)))) * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if ((((d_m * m_m) / (d * 2.0d0)) ** 2.0d0) <= 5d-24) then
tmp = 1.0d0 * w0
else
tmp = sqrt((1.0d0 - ((((((m_m / d) * m_m) * 0.5d0) * d_m) / (l * d)) * ((0.5d0 * d_m) * h)))) * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (Math.pow(((D_m * M_m) / (d * 2.0)), 2.0) <= 5e-24) {
tmp = 1.0 * w0;
} else {
tmp = Math.sqrt((1.0 - ((((((M_m / d) * M_m) * 0.5) * D_m) / (l * d)) * ((0.5 * D_m) * h)))) * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if math.pow(((D_m * M_m) / (d * 2.0)), 2.0) <= 5e-24: tmp = 1.0 * w0 else: tmp = math.sqrt((1.0 - ((((((M_m / d) * M_m) * 0.5) * D_m) / (l * d)) * ((0.5 * D_m) * h)))) * 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(d * 2.0)) ^ 2.0) <= 5e-24) tmp = Float64(1.0 * w0); else tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(Float64(Float64(M_m / d) * M_m) * 0.5) * D_m) / Float64(l * d)) * Float64(Float64(0.5 * D_m) * h)))) * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if ((((D_m * M_m) / (d * 2.0)) ^ 2.0) <= 5e-24)
tmp = 1.0 * w0;
else
tmp = sqrt((1.0 - ((((((M_m / d) * M_m) * 0.5) * D_m) / (l * d)) * ((0.5 * D_m) * h)))) * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision], 5e-24], N[(1.0 * w0), $MachinePrecision], N[(N[Sqrt[N[(1.0 - N[(N[(N[(N[(N[(N[(M$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] * 0.5), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * D$95$m), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq 5 \cdot 10^{-24}:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1 - \frac{\left(\left(\frac{M\_m}{d} \cdot M\_m\right) \cdot 0.5\right) \cdot D\_m}{\ell \cdot d} \cdot \left(\left(0.5 \cdot D\_m\right) \cdot h\right)} \cdot w0\\
\end{array}
\end{array}
if (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) < 4.9999999999999998e-24Initial program 87.9%
Taylor expanded in M around 0
Applied rewrites94.8%
if 4.9999999999999998e-24 < (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) Initial program 68.1%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites65.1%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6465.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6465.4
Applied rewrites65.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6466.4
Applied rewrites66.4%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
Applied rewrites64.2%
Final simplification82.8%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) -1e-13) (* (fma -0.125 (* (/ (* (* h D_m) D_m) (* l d)) (* (/ M_m d) M_m)) 1.0) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -1e-13) {
tmp = fma(-0.125, ((((h * D_m) * D_m) / (l * d)) * ((M_m / d) * M_m)), 1.0) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -1e-13) tmp = Float64(fma(-0.125, Float64(Float64(Float64(Float64(h * D_m) * D_m) / Float64(l * d)) * Float64(Float64(M_m / d) * M_m)), 1.0) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -1e-13], N[(N[(-0.125 * N[(N[(N[(N[(h * D$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(N[(M$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -1 \cdot 10^{-13}:\\
\;\;\;\;\mathsf{fma}\left(-0.125, \frac{\left(h \cdot D\_m\right) \cdot D\_m}{\ell \cdot d} \cdot \left(\frac{M\_m}{d} \cdot M\_m\right), 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)) < -1e-13Initial program 63.6%
Taylor expanded in M around 0
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6433.5
Applied rewrites33.5%
Applied rewrites45.8%
if -1e-13 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 86.5%
Taylor expanded in M around 0
Applied rewrites95.1%
Final simplification81.4%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) -2e+144) (* (fma -0.125 (* (/ (* D_m D_m) (* l d)) (* (* (/ M_m d) h) M_m)) 1.0) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -2e+144) {
tmp = fma(-0.125, (((D_m * D_m) / (l * d)) * (((M_m / d) * h) * M_m)), 1.0) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -2e+144) tmp = Float64(fma(-0.125, Float64(Float64(Float64(D_m * D_m) / Float64(l * d)) * Float64(Float64(Float64(M_m / d) * h) * M_m)), 1.0) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -2e+144], N[(N[(-0.125 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m / d), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -2 \cdot 10^{+144}:\\
\;\;\;\;\mathsf{fma}\left(-0.125, \frac{D\_m \cdot D\_m}{\ell \cdot d} \cdot \left(\left(\frac{M\_m}{d} \cdot h\right) \cdot M\_m\right), 1\right) \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000005e144Initial program 57.8%
Taylor expanded in M around 0
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6437.7
Applied rewrites37.7%
Applied rewrites44.9%
if -2.00000000000000005e144 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 87.2%
Taylor expanded in M around 0
Applied rewrites91.2%
Final simplification80.2%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) -2e+144) (* (fma -0.125 (* (* (* (/ D_m l) (/ D_m (* d d))) (* h M_m)) M_m) 1.0) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -2e+144) {
tmp = fma(-0.125, ((((D_m / l) * (D_m / (d * d))) * (h * M_m)) * M_m), 1.0) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -2e+144) tmp = Float64(fma(-0.125, Float64(Float64(Float64(Float64(D_m / l) * Float64(D_m / Float64(d * d))) * Float64(h * M_m)) * M_m), 1.0) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -2e+144], N[(N[(-0.125 * N[(N[(N[(N[(D$95$m / l), $MachinePrecision] * N[(D$95$m / N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(h * M$95$m), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] + 1.0), $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -2 \cdot 10^{+144}:\\
\;\;\;\;\mathsf{fma}\left(-0.125, \left(\left(\frac{D\_m}{\ell} \cdot \frac{D\_m}{d \cdot d}\right) \cdot \left(h \cdot M\_m\right)\right) \cdot M\_m, 1\right) \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000005e144Initial program 57.8%
Taylor expanded in M around 0
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6437.7
Applied rewrites37.7%
Applied rewrites48.0%
if -2.00000000000000005e144 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 87.2%
Taylor expanded in M around 0
Applied rewrites91.2%
Final simplification80.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) (* d 2.0)) 2.0)) (- INFINITY)) (* (fma -0.125 (/ (* (* (* h M_m) (* D_m D_m)) M_m) (* (* d d) l)) 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) / (d * 2.0)), 2.0)) <= -((double) INFINITY)) {
tmp = fma(-0.125, ((((h * M_m) * (D_m * D_m)) * M_m) / ((d * d) * l)), 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(d * 2.0)) ^ 2.0)) <= Float64(-Inf)) tmp = Float64(fma(-0.125, Float64(Float64(Float64(Float64(h * M_m) * Float64(D_m * D_m)) * M_m) / Float64(Float64(d * d) * l)), 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[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(-0.125 * N[(N[(N[(N[(h * M$95$m), $MachinePrecision] * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-0.125, \frac{\left(\left(h \cdot M\_m\right) \cdot \left(D\_m \cdot D\_m\right)\right) \cdot M\_m}{\left(d \cdot d\right) \cdot \ell}, 1\right) \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0Initial program 54.1%
Taylor expanded in M around 0
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6441.0
Applied rewrites41.0%
Applied rewrites43.0%
if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 87.5%
Taylor expanded in M around 0
Applied rewrites89.1%
Final simplification79.0%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) (- INFINITY)) (* (fma -0.125 (/ (* (* (* (* h D_m) D_m) M_m) M_m) (* (* d d) l)) 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) / (d * 2.0)), 2.0)) <= -((double) INFINITY)) {
tmp = fma(-0.125, (((((h * D_m) * D_m) * M_m) * M_m) / ((d * d) * l)), 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(d * 2.0)) ^ 2.0)) <= Float64(-Inf)) tmp = Float64(fma(-0.125, Float64(Float64(Float64(Float64(Float64(h * D_m) * D_m) * M_m) * M_m) / Float64(Float64(d * d) * l)), 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[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(-0.125 * N[(N[(N[(N[(N[(h * D$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-0.125, \frac{\left(\left(\left(h \cdot D\_m\right) \cdot D\_m\right) \cdot M\_m\right) \cdot M\_m}{\left(d \cdot d\right) \cdot \ell}, 1\right) \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0Initial program 54.1%
Taylor expanded in M around 0
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6441.0
Applied rewrites41.0%
Applied rewrites48.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 87.5%
Taylor expanded in M around 0
Applied rewrites89.1%
Final simplification80.2%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) (- INFINITY)) (* (fma -0.125 (* (/ D_m (* (* d d) l)) (* (* (* M_m M_m) h) D_m)) 1.0) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -((double) INFINITY)) {
tmp = fma(-0.125, ((D_m / ((d * d) * l)) * (((M_m * M_m) * h) * D_m)), 1.0) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= Float64(-Inf)) tmp = Float64(fma(-0.125, Float64(Float64(D_m / Float64(Float64(d * d) * l)) * Float64(Float64(Float64(M_m * M_m) * h) * D_m)), 1.0) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(-0.125 * N[(N[(D$95$m / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * D$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-0.125, \frac{D\_m}{\left(d \cdot d\right) \cdot \ell} \cdot \left(\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot D\_m\right), 1\right) \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0Initial program 54.1%
Taylor expanded in M around 0
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6441.0
Applied rewrites41.0%
Applied rewrites48.3%
if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 87.5%
Taylor expanded in M around 0
Applied rewrites89.1%
Final simplification80.2%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) (- INFINITY)) (fma (/ (* (* (* (* M_m M_m) h) w0) (* D_m D_m)) (* (* d d) l)) -0.125 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) / (d * 2.0)), 2.0)) <= -((double) INFINITY)) {
tmp = fma((((((M_m * M_m) * h) * w0) * (D_m * D_m)) / ((d * d) * l)), -0.125, 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(d * 2.0)) ^ 2.0)) <= Float64(-Inf)) tmp = fma(Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) * w0) * Float64(D_m * D_m)) / Float64(Float64(d * d) * l)), -0.125, 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[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * w0), $MachinePrecision] * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * -0.125 + 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}{d \cdot 2}\right)}^{2} \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(\frac{\left(\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot w0\right) \cdot \left(D\_m \cdot D\_m\right)}{\left(d \cdot d\right) \cdot \ell}, -0.125, 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 54.1%
Taylor expanded in M around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6440.8
Applied rewrites40.8%
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 87.5%
Taylor expanded in M around 0
Applied rewrites89.1%
Final simplification78.5%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(let* ((t_0 (* (/ D_m d) M_m)))
(if (<= (/ (* D_m M_m) (* d 2.0)) 1e-37)
(* (sqrt (- 1.0 (/ (* (* (* 0.25 h) t_0) t_0) l))) w0)
(*
(sqrt
(-
1.0
(/ (* 0.5 D_m) (* (/ (/ l (/ M_m d)) (* (* (* h D_m) M_m) 0.5)) d))))
w0))))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double t_0 = (D_m / d) * M_m;
double tmp;
if (((D_m * M_m) / (d * 2.0)) <= 1e-37) {
tmp = sqrt((1.0 - ((((0.25 * h) * t_0) * t_0) / l))) * w0;
} else {
tmp = sqrt((1.0 - ((0.5 * D_m) / (((l / (M_m / d)) / (((h * D_m) * M_m) * 0.5)) * d)))) * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: t_0
real(8) :: tmp
t_0 = (d_m / d) * m_m
if (((d_m * m_m) / (d * 2.0d0)) <= 1d-37) then
tmp = sqrt((1.0d0 - ((((0.25d0 * h) * t_0) * t_0) / l))) * w0
else
tmp = sqrt((1.0d0 - ((0.5d0 * d_m) / (((l / (m_m / d)) / (((h * d_m) * m_m) * 0.5d0)) * d)))) * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double t_0 = (D_m / d) * M_m;
double tmp;
if (((D_m * M_m) / (d * 2.0)) <= 1e-37) {
tmp = Math.sqrt((1.0 - ((((0.25 * h) * t_0) * t_0) / l))) * w0;
} else {
tmp = Math.sqrt((1.0 - ((0.5 * D_m) / (((l / (M_m / d)) / (((h * D_m) * M_m) * 0.5)) * d)))) * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): t_0 = (D_m / d) * M_m tmp = 0 if ((D_m * M_m) / (d * 2.0)) <= 1e-37: tmp = math.sqrt((1.0 - ((((0.25 * h) * t_0) * t_0) / l))) * w0 else: tmp = math.sqrt((1.0 - ((0.5 * D_m) / (((l / (M_m / d)) / (((h * D_m) * M_m) * 0.5)) * d)))) * w0 return tmp
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) t_0 = Float64(Float64(D_m / d) * M_m) tmp = 0.0 if (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) <= 1e-37) tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(0.25 * h) * t_0) * t_0) / l))) * w0); else tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(0.5 * D_m) / Float64(Float64(Float64(l / Float64(M_m / d)) / Float64(Float64(Float64(h * D_m) * M_m) * 0.5)) * d)))) * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
t_0 = (D_m / d) * M_m;
tmp = 0.0;
if (((D_m * M_m) / (d * 2.0)) <= 1e-37)
tmp = sqrt((1.0 - ((((0.25 * h) * t_0) * t_0) / l))) * w0;
else
tmp = sqrt((1.0 - ((0.5 * D_m) / (((l / (M_m / d)) / (((h * D_m) * M_m) * 0.5)) * d)))) * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := Block[{t$95$0 = N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision]}, If[LessEqual[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 1e-37], N[(N[Sqrt[N[(1.0 - N[(N[(N[(N[(0.25 * h), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(1.0 - N[(N[(0.5 * D$95$m), $MachinePrecision] / N[(N[(N[(l / N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(h * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
t_0 := \frac{D\_m}{d} \cdot M\_m\\
\mathbf{if}\;\frac{D\_m \cdot M\_m}{d \cdot 2} \leq 10^{-37}:\\
\;\;\;\;\sqrt{1 - \frac{\left(\left(0.25 \cdot h\right) \cdot t\_0\right) \cdot t\_0}{\ell}} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1 - \frac{0.5 \cdot D\_m}{\frac{\frac{\ell}{\frac{M\_m}{d}}}{\left(\left(h \cdot D\_m\right) \cdot M\_m\right) \cdot 0.5} \cdot d}} \cdot w0\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 1.00000000000000007e-37Initial program 82.0%
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
unpow-prod-downN/A
associate-*l*N/A
lower-*.f64N/A
div-invN/A
metadata-evalN/A
unpow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
lower-*.f64N/A
pow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-pow.f64N/A
lower-/.f6467.3
Applied rewrites67.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
div-invN/A
unpow-1N/A
lift-pow.f64N/A
div-invN/A
frac-timesN/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites89.6%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6489.6
Applied rewrites89.6%
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6491.0
Applied rewrites91.0%
if 1.00000000000000007e-37 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 73.5%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites71.8%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6473.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6473.7
Applied rewrites73.7%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6475.4
Applied rewrites75.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
Applied rewrites77.2%
Final simplification88.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 (<= (* d 2.0) 5e-123)
(* (sqrt (- 1.0 (/ (* (/ (* (* D_m M_m) 0.5) d) (* (* h D_m) M_m)) l))) w0)
(*
(sqrt
(-
1.0
(* (/ (* (* (* (* M_m M_m) h) D_m) 0.5) (* l d)) (* (/ D_m d) 0.5))))
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 * 2.0) <= 5e-123) {
tmp = sqrt((1.0 - (((((D_m * M_m) * 0.5) / d) * ((h * D_m) * M_m)) / l))) * w0;
} else {
tmp = sqrt((1.0 - ((((((M_m * M_m) * h) * D_m) * 0.5) / (l * d)) * ((D_m / d) * 0.5)))) * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if ((d * 2.0d0) <= 5d-123) then
tmp = sqrt((1.0d0 - (((((d_m * m_m) * 0.5d0) / d) * ((h * d_m) * m_m)) / l))) * w0
else
tmp = sqrt((1.0d0 - ((((((m_m * m_m) * h) * d_m) * 0.5d0) / (l * d)) * ((d_m / d) * 0.5d0)))) * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((d * 2.0) <= 5e-123) {
tmp = Math.sqrt((1.0 - (((((D_m * M_m) * 0.5) / d) * ((h * D_m) * M_m)) / l))) * w0;
} else {
tmp = Math.sqrt((1.0 - ((((((M_m * M_m) * h) * D_m) * 0.5) / (l * d)) * ((D_m / d) * 0.5)))) * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if (d * 2.0) <= 5e-123: tmp = math.sqrt((1.0 - (((((D_m * M_m) * 0.5) / d) * ((h * D_m) * M_m)) / l))) * w0 else: tmp = math.sqrt((1.0 - ((((((M_m * M_m) * h) * D_m) * 0.5) / (l * d)) * ((D_m / d) * 0.5)))) * w0 return tmp
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(d * 2.0) <= 5e-123) tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(Float64(D_m * M_m) * 0.5) / d) * Float64(Float64(h * D_m) * M_m)) / l))) * w0); else tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) * D_m) * 0.5) / Float64(l * d)) * Float64(Float64(D_m / d) * 0.5)))) * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if ((d * 2.0) <= 5e-123)
tmp = sqrt((1.0 - (((((D_m * M_m) * 0.5) / d) * ((h * D_m) * M_m)) / l))) * w0;
else
tmp = sqrt((1.0 - ((((((M_m * M_m) * h) * D_m) * 0.5) / (l * d)) * ((D_m / d) * 0.5)))) * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(d * 2.0), $MachinePrecision], 5e-123], N[(N[Sqrt[N[(1.0 - N[(N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * 0.5), $MachinePrecision] / d), $MachinePrecision] * N[(N[(h * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(1.0 - N[(N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * D$95$m), $MachinePrecision] * 0.5), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;d \cdot 2 \leq 5 \cdot 10^{-123}:\\
\;\;\;\;\sqrt{1 - \frac{\frac{\left(D\_m \cdot M\_m\right) \cdot 0.5}{d} \cdot \left(\left(h \cdot D\_m\right) \cdot M\_m\right)}{\ell}} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1 - \frac{\left(\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot D\_m\right) \cdot 0.5}{\ell \cdot d} \cdot \left(\frac{D\_m}{d} \cdot 0.5\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 #s(literal 2 binary64) d) < 5.0000000000000003e-123Initial program 77.9%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-/.f64N/A
associate-/r*N/A
associate-*r/N/A
associate-*r/N/A
Applied rewrites59.1%
lift-/.f64N/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites62.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
div-invN/A
lift-/.f64N/A
times-fracN/A
associate-/r*N/A
lower-/.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6462.3
Applied rewrites62.3%
if 5.0000000000000003e-123 < (*.f64 #s(literal 2 binary64) d) Initial program 84.2%
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites78.9%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6481.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6481.3
Applied rewrites81.3%
Taylor expanded in M around 0
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6470.5
Applied rewrites70.5%
Final simplification65.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 (let* ((t_0 (* (/ D_m d) M_m))) (* (sqrt (- 1.0 (/ (* (* (* 0.25 h) t_0) t_0) l))) w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double t_0 = (D_m / d) * M_m;
return sqrt((1.0 - ((((0.25 * h) * t_0) * t_0) / l))) * 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
real(8) :: t_0
t_0 = (d_m / d) * m_m
code = sqrt((1.0d0 - ((((0.25d0 * h) * t_0) * t_0) / l))) * 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) {
double t_0 = (D_m / d) * M_m;
return Math.sqrt((1.0 - ((((0.25 * h) * t_0) * t_0) / l))) * 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): t_0 = (D_m / d) * M_m return math.sqrt((1.0 - ((((0.25 * h) * t_0) * t_0) / l))) * 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) t_0 = Float64(Float64(D_m / d) * M_m) return Float64(sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(0.25 * h) * t_0) * t_0) / l))) * 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)
t_0 = (D_m / d) * M_m;
tmp = sqrt((1.0 - ((((0.25 * h) * t_0) * t_0) / l))) * 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_] := Block[{t$95$0 = N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision]}, N[(N[Sqrt[N[(1.0 - N[(N[(N[(N[(0.25 * h), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
t_0 := \frac{D\_m}{d} \cdot M\_m\\
\sqrt{1 - \frac{\left(\left(0.25 \cdot h\right) \cdot t\_0\right) \cdot t\_0}{\ell}} \cdot w0
\end{array}
\end{array}
Initial program 80.2%
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
unpow-prod-downN/A
associate-*l*N/A
lower-*.f64N/A
div-invN/A
metadata-evalN/A
unpow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
lower-*.f64N/A
pow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-pow.f64N/A
lower-/.f6464.3
Applied rewrites64.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
div-invN/A
unpow-1N/A
lift-pow.f64N/A
div-invN/A
frac-timesN/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites85.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-*.f6485.5
Applied rewrites85.5%
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6488.8
Applied rewrites88.8%
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 (* 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 80.2%
Taylor expanded in M around 0
Applied rewrites70.5%
Final simplification70.5%
herbie shell --seed 2024312
(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))))))