
(FPCore (w0 M D h l d) :precision binary64 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))
double code(double w0, double M, double D, double h, double l, double d) {
return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
real(8) function code(w0, m, d, h, l, d_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_1
code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function
public static double code(double w0, double M, double D, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
def code(w0, M, D, h, l, d): return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))
function code(w0, M, D, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))))) end
function tmp = code(w0, M, D, h, l, d) tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l)))); end
code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (w0 M D h l d) :precision binary64 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))
double code(double w0, double M, double D, double h, double l, double d) {
return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
real(8) function code(w0, m, d, h, l, d_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_1
code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function
public static double code(double w0, double M, double D, double h, double l, double d) {
return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}
def code(w0, M, D, h, l, d): return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))
function code(w0, M, D, h, l, d) return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l))))) end
function tmp = code(w0, M, D, h, l, d) tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l)))); end
code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}
\end{array}
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(let* ((t_0 (* (* (/ 0.5 d) M_m) D_m)))
(if (<= (- 1.0 (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0))) 1e+289)
(*
(sqrt
(fma
(* (/ (* -0.5 (* D_m M_m)) d) (/ h l))
(/ (* (* 0.5 M_m) D_m) d)
1.0))
w0)
(* (sqrt (- 1.0 (* (/ t_0 (pow h -1.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 = ((0.5 / d) * M_m) * D_m;
double tmp;
if ((1.0 - ((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0))) <= 1e+289) {
tmp = sqrt(fma((((-0.5 * (D_m * M_m)) / d) * (h / l)), (((0.5 * M_m) * D_m) / d), 1.0)) * w0;
} else {
tmp = sqrt((1.0 - ((t_0 / pow(h, -1.0)) * (t_0 / 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(Float64(0.5 / d) * M_m) * D_m) tmp = 0.0 if (Float64(1.0 - Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0))) <= 1e+289) tmp = Float64(sqrt(fma(Float64(Float64(Float64(-0.5 * Float64(D_m * M_m)) / d) * Float64(h / l)), Float64(Float64(Float64(0.5 * M_m) * D_m) / d), 1.0)) * w0); else tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(t_0 / (h ^ -1.0)) * Float64(t_0 / l)))) * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := Block[{t$95$0 = N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]}, 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], 1e+289], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(0.5 * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / d), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(1.0 - N[(N[(t$95$0 / N[Power[h, -1.0], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / 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 := \left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m\\
\mathbf{if}\;1 - \frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq 10^{+289}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{-0.5 \cdot \left(D\_m \cdot M\_m\right)}{d} \cdot \frac{h}{\ell}, \frac{\left(0.5 \cdot M\_m\right) \cdot D\_m}{d}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1 - \frac{t\_0}{{h}^{-1}} \cdot \frac{t\_0}{\ell}} \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.0000000000000001e289Initial program 99.9%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lift-pow.f64N/A
unpow2N/A
distribute-lft-neg-inN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites98.2%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied rewrites99.9%
if 1.0000000000000001e289 < (-.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 45.3%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
div-invN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites78.8%
Final simplification92.4%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(let* ((t_0 (/ (* -0.5 (* D_m M_m)) d)))
(if (<= (- 1.0 (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0))) 1e+289)
(* (sqrt (fma (* t_0 (/ h l)) (/ (* (* 0.5 M_m) D_m) d) 1.0)) w0)
(* (sqrt (fma (/ t_0 l) (* (* (* (/ 0.5 d) M_m) D_m) h) 1.0)) w0))))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double t_0 = (-0.5 * (D_m * M_m)) / d;
double tmp;
if ((1.0 - ((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0))) <= 1e+289) {
tmp = sqrt(fma((t_0 * (h / l)), (((0.5 * M_m) * D_m) / d), 1.0)) * w0;
} else {
tmp = sqrt(fma((t_0 / l), ((((0.5 / d) * M_m) * D_m) * h), 1.0)) * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) t_0 = Float64(Float64(-0.5 * Float64(D_m * M_m)) / d) tmp = 0.0 if (Float64(1.0 - Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0))) <= 1e+289) tmp = Float64(sqrt(fma(Float64(t_0 * Float64(h / l)), Float64(Float64(Float64(0.5 * M_m) * D_m) / d), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(t_0 / l), Float64(Float64(Float64(Float64(0.5 / d) * M_m) * D_m) * h), 1.0)) * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := Block[{t$95$0 = N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]}, 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], 1e+289], N[(N[Sqrt[N[(N[(t$95$0 * N[(h / l), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(0.5 * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / d), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(t$95$0 / l), $MachinePrecision] * N[(N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * h), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
t_0 := \frac{-0.5 \cdot \left(D\_m \cdot M\_m\right)}{d}\\
\mathbf{if}\;1 - \frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq 10^{+289}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(t\_0 \cdot \frac{h}{\ell}, \frac{\left(0.5 \cdot M\_m\right) \cdot D\_m}{d}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{t\_0}{\ell}, \left(\left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m\right) \cdot h, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))) < 1.0000000000000001e289Initial program 99.9%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lift-pow.f64N/A
unpow2N/A
distribute-lft-neg-inN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites98.2%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied rewrites99.9%
if 1.0000000000000001e289 < (-.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 45.3%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lift-pow.f64N/A
unpow2N/A
distribute-lft-neg-inN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites53.0%
Applied rewrites76.7%
Final simplification91.7%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (- 1.0 (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0))) 1e+289)
(*
(sqrt
(fma
(* (/ (* -0.5 (* D_m M_m)) d) (/ h l))
(/ (* (* 0.5 M_m) D_m) d)
1.0))
w0)
(*
(sqrt
(fma
(* (/ (/ (* (* h M_m) D_m) d) l) -0.5)
(* (* (/ 0.5 d) M_m) D_m)
1.0))
w0)))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((1.0 - ((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0))) <= 1e+289) {
tmp = sqrt(fma((((-0.5 * (D_m * M_m)) / d) * (h / l)), (((0.5 * M_m) * D_m) / d), 1.0)) * w0;
} else {
tmp = sqrt(fma((((((h * M_m) * D_m) / d) / l) * -0.5), (((0.5 / d) * M_m) * D_m), 1.0)) * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(1.0 - Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0))) <= 1e+289) tmp = Float64(sqrt(fma(Float64(Float64(Float64(-0.5 * Float64(D_m * M_m)) / d) * Float64(h / l)), Float64(Float64(Float64(0.5 * M_m) * D_m) / d), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(Float64(h * M_m) * D_m) / d) / l) * -0.5), Float64(Float64(Float64(0.5 / d) * M_m) * D_m), 1.0)) * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+289], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(0.5 * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / d), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(N[(N[(h * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / d), $MachinePrecision] / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;1 - \frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq 10^{+289}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{-0.5 \cdot \left(D\_m \cdot M\_m\right)}{d} \cdot \frac{h}{\ell}, \frac{\left(0.5 \cdot M\_m\right) \cdot D\_m}{d}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\frac{\left(h \cdot M\_m\right) \cdot D\_m}{d}}{\ell} \cdot -0.5, \left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))) < 1.0000000000000001e289Initial program 99.9%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lift-pow.f64N/A
unpow2N/A
distribute-lft-neg-inN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites98.2%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied rewrites99.9%
if 1.0000000000000001e289 < (-.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 45.3%
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
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites54.8%
Taylor expanded in h around 0
*-commutativeN/A
lower-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6473.7
Applied rewrites73.7%
Final simplification90.6%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) -5.0)
(*
(sqrt (fma (* (* (* -0.25 h) D_m) M_m) (* (/ D_m (* (* d d) l)) 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)) <= -5.0) {
tmp = sqrt(fma((((-0.25 * h) * D_m) * M_m), ((D_m / ((d * d) * l)) * 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)) <= -5.0) tmp = Float64(sqrt(fma(Float64(Float64(Float64(-0.25 * h) * D_m) * M_m), Float64(Float64(D_m / Float64(Float64(d * d) * l)) * 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], -5.0], N[(N[Sqrt[N[(N[(N[(N[(-0.25 * h), $MachinePrecision] * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(N[(D$95$m / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -5:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\left(-0.25 \cdot h\right) \cdot D\_m\right) \cdot M\_m, \frac{D\_m}{\left(d \cdot d\right) \cdot \ell} \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)) < -5Initial program 70.6%
Taylor expanded in h around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites46.9%
Applied rewrites47.3%
Applied rewrites50.2%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6450.2
Applied rewrites60.6%
if -5 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 85.7%
Taylor expanded in h around 0
Applied rewrites95.7%
Final simplification83.7%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) -5.0)
(*
(sqrt (fma (* -0.25 h) (* (* (* (/ D_m (* (* d d) l)) M_m) M_m) 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)) <= -5.0) {
tmp = sqrt(fma((-0.25 * h), ((((D_m / ((d * d) * l)) * M_m) * M_m) * 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)) <= -5.0) tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(D_m / Float64(Float64(d * d) * l)) * M_m) * M_m) * 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], -5.0], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(D$95$m / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -5:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \left(\left(\frac{D\_m}{\left(d \cdot d\right) \cdot \ell} \cdot M\_m\right) \cdot M\_m\right) \cdot D\_m, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -5Initial program 70.6%
Taylor expanded in h around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites46.9%
Applied rewrites47.3%
Applied rewrites57.0%
if -5 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 85.7%
Taylor expanded in h around 0
Applied rewrites95.7%
Final simplification82.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+38)
(*
(sqrt (fma (* -0.25 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)) <= -2e+38) {
tmp = sqrt(fma((-0.25 * 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)) <= -2e+38) tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(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], -2e+38], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -2 \cdot 10^{+38}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{\left(\left(D\_m \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)) < -1.99999999999999995e38Initial program 68.9%
Taylor expanded in h around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites49.7%
Taylor expanded in M around 0
Applied rewrites51.1%
if -1.99999999999999995e38 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 86.1%
Taylor expanded in h around 0
Applied rewrites93.3%
Final simplification79.6%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) -5e+118) (fma (* -0.125 w0) (* (/ (* (* (* D_m D_m) h) M_m) (* l d)) (/ M_m d)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -5e+118) {
tmp = fma((-0.125 * w0), (((((D_m * D_m) * h) * M_m) / (l * d)) * (M_m / d)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -5e+118) tmp = fma(Float64(-0.125 * w0), Float64(Float64(Float64(Float64(Float64(D_m * D_m) * h) * M_m) / Float64(l * d)) * Float64(M_m / d)), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+118], 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), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -5 \cdot 10^{+118}:\\
\;\;\;\;\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} \cdot \frac{M\_m}{d}, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -4.99999999999999972e118Initial program 66.9%
Taylor expanded in h around 0
Applied rewrites5.0%
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 rewrites44.8%
Taylor expanded in w0 around 0
Applied rewrites42.5%
Applied rewrites49.4%
if -4.99999999999999972e118 < (*.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 h around 0
Applied rewrites90.9%
Final simplification78.3%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) -5e+118) (fma (* -0.125 w0) (/ (* (* (* (* D_m D_m) h) M_m) M_m) (* (* d d) l)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -5e+118) {
tmp = fma((-0.125 * w0), (((((D_m * D_m) * h) * M_m) * M_m) / ((d * d) * l)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -5e+118) tmp = fma(Float64(-0.125 * w0), Float64(Float64(Float64(Float64(Float64(D_m * D_m) * h) * M_m) * M_m) / Float64(Float64(d * d) * l)), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+118], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -5 \cdot 10^{+118}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{\left(\left(\left(D\_m \cdot D\_m\right) \cdot h\right) \cdot M\_m\right) \cdot M\_m}{\left(d \cdot d\right) \cdot \ell}, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -4.99999999999999972e118Initial program 66.9%
Taylor expanded in h around 0
Applied rewrites5.0%
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 rewrites44.8%
Taylor expanded in w0 around 0
Applied rewrites42.5%
Applied rewrites47.0%
if -4.99999999999999972e118 < (*.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 h around 0
Applied rewrites90.9%
Final simplification77.5%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) -5e+118) (fma (* -0.125 w0) (/ (* (* (* M_m M_m) (* h D_m)) D_m) (* (* d d) l)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -5e+118) {
tmp = fma((-0.125 * w0), ((((M_m * M_m) * (h * D_m)) * D_m) / ((d * d) * l)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -5e+118) tmp = fma(Float64(-0.125 * w0), Float64(Float64(Float64(Float64(M_m * M_m) * Float64(h * D_m)) * D_m) / Float64(Float64(d * d) * l)), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+118], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(h * D$95$m), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -5 \cdot 10^{+118}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{\left(\left(M\_m \cdot M\_m\right) \cdot \left(h \cdot D\_m\right)\right) \cdot D\_m}{\left(d \cdot d\right) \cdot \ell}, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -4.99999999999999972e118Initial program 66.9%
Taylor expanded in h around 0
Applied rewrites5.0%
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 rewrites44.8%
Taylor expanded in w0 around 0
Applied rewrites42.5%
Applied rewrites47.9%
if -4.99999999999999972e118 < (*.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 h around 0
Applied rewrites90.9%
Final simplification77.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)) -5e+118) (fma (* -0.125 w0) (/ (* (* M_m M_m) (* (* D_m D_m) h)) (* (* d d) l)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -5e+118) {
tmp = fma((-0.125 * w0), (((M_m * M_m) * ((D_m * D_m) * h)) / ((d * d) * l)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -5e+118) tmp = fma(Float64(-0.125 * w0), Float64(Float64(Float64(M_m * M_m) * Float64(Float64(D_m * D_m) * h)) / Float64(Float64(d * d) * l)), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+118], N[(N[(-0.125 * w0), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(D$95$m * D$95$m), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -5 \cdot 10^{+118}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot w0, \frac{\left(M\_m \cdot M\_m\right) \cdot \left(\left(D\_m \cdot D\_m\right) \cdot h\right)}{\left(d \cdot d\right) \cdot \ell}, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -4.99999999999999972e118Initial program 66.9%
Taylor expanded in h around 0
Applied rewrites5.0%
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 rewrites44.8%
Taylor expanded in w0 around 0
Applied rewrites42.5%
if -4.99999999999999972e118 < (*.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 h around 0
Applied rewrites90.9%
Final simplification76.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 (<= (/ (* D_m M_m) (* d 2.0)) 4e+79)
(*
(sqrt (fma (/ D_m d) (* (* -0.25 h) (* (* (/ D_m d) M_m) (/ M_m l))) 1.0))
w0)
(*
(sqrt
(fma
(/ (* (* -0.5 (* D_m M_m)) h) (* l d))
(* (* (/ 0.5 d) M_m) D_m)
1.0))
w0)))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((D_m * M_m) / (d * 2.0)) <= 4e+79) {
tmp = sqrt(fma((D_m / d), ((-0.25 * h) * (((D_m / d) * M_m) * (M_m / l))), 1.0)) * w0;
} else {
tmp = sqrt(fma((((-0.5 * (D_m * M_m)) * h) / (l * d)), (((0.5 / d) * M_m) * D_m), 1.0)) * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) <= 4e+79) tmp = Float64(sqrt(fma(Float64(D_m / d), Float64(Float64(-0.25 * h) * Float64(Float64(Float64(D_m / d) * M_m) * Float64(M_m / l))), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(-0.5 * Float64(D_m * M_m)) * h) / Float64(l * d)), Float64(Float64(Float64(0.5 / d) * M_m) * D_m), 1.0)) * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 4e+79], N[(N[Sqrt[N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{D\_m \cdot M\_m}{d \cdot 2} \leq 4 \cdot 10^{+79}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{D\_m}{d}, \left(-0.25 \cdot h\right) \cdot \left(\left(\frac{D\_m}{d} \cdot M\_m\right) \cdot \frac{M\_m}{\ell}\right), 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(-0.5 \cdot \left(D\_m \cdot M\_m\right)\right) \cdot h}{\ell \cdot d}, \left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 3.99999999999999987e79Initial program 83.3%
Taylor expanded in h around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites65.7%
Applied rewrites66.8%
Applied rewrites84.3%
if 3.99999999999999987e79 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 64.4%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lift-pow.f64N/A
unpow2N/A
distribute-lft-neg-inN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites74.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6474.7
Applied rewrites74.7%
Final simplification82.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 (<= (* d 2.0) 2e-69)
(*
(sqrt
(fma
(* (/ M_m d) (/ (* -0.5 D_m) l))
(* (* (* h D_m) M_m) (/ 0.5 d))
1.0))
w0)
(*
(sqrt (fma (/ D_m d) (* (* -0.25 h) (* (* (/ D_m d) M_m) (/ M_m l))) 1.0))
w0)))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((d * 2.0) <= 2e-69) {
tmp = sqrt(fma(((M_m / d) * ((-0.5 * D_m) / l)), (((h * D_m) * M_m) * (0.5 / d)), 1.0)) * w0;
} else {
tmp = sqrt(fma((D_m / d), ((-0.25 * h) * (((D_m / d) * M_m) * (M_m / l))), 1.0)) * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(d * 2.0) <= 2e-69) tmp = Float64(sqrt(fma(Float64(Float64(M_m / d) * Float64(Float64(-0.5 * D_m) / l)), Float64(Float64(Float64(h * D_m) * M_m) * Float64(0.5 / d)), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(D_m / d), Float64(Float64(-0.25 * h) * Float64(Float64(Float64(D_m / d) * M_m) * Float64(M_m / l))), 1.0)) * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(d * 2.0), $MachinePrecision], 2e-69], N[(N[Sqrt[N[(N[(N[(M$95$m / d), $MachinePrecision] * N[(N[(-0.5 * D$95$m), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(0.5 / d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;d \cdot 2 \leq 2 \cdot 10^{-69}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{M\_m}{d} \cdot \frac{-0.5 \cdot D\_m}{\ell}, \left(\left(h \cdot D\_m\right) \cdot M\_m\right) \cdot \frac{0.5}{d}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{D\_m}{d}, \left(-0.25 \cdot h\right) \cdot \left(\left(\frac{D\_m}{d} \cdot M\_m\right) \cdot \frac{M\_m}{\ell}\right), 1\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 #s(literal 2 binary64) d) < 1.9999999999999999e-69Initial program 80.7%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lift-pow.f64N/A
unpow2N/A
distribute-lft-neg-inN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites81.9%
Applied rewrites87.5%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6485.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6483.6
Applied rewrites83.6%
if 1.9999999999999999e-69 < (*.f64 #s(literal 2 binary64) d) Initial program 80.3%
Taylor expanded in h around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites64.7%
Applied rewrites66.1%
Applied rewrites81.4%
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 (<= (* D_m M_m) 4e-109)
(* 1.0 w0)
(if (<= (* D_m M_m) 2e+133)
(*
(sqrt
(fma (* -0.25 h) (/ (* (* (* D_m M_m) M_m) D_m) (* (* l d) d)) 1.0))
w0)
(*
(sqrt
(fma (* (* (* -0.25 h) D_m) M_m) (* (/ D_m (* (* d d) l)) M_m) 1.0))
w0))))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((D_m * M_m) <= 4e-109) {
tmp = 1.0 * w0;
} else if ((D_m * M_m) <= 2e+133) {
tmp = sqrt(fma((-0.25 * h), ((((D_m * M_m) * M_m) * D_m) / ((l * d) * d)), 1.0)) * w0;
} else {
tmp = sqrt(fma((((-0.25 * h) * D_m) * M_m), ((D_m / ((d * d) * l)) * M_m), 1.0)) * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(D_m * M_m) <= 4e-109) tmp = Float64(1.0 * w0); elseif (Float64(D_m * M_m) <= 2e+133) tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(D_m * M_m) * M_m) * D_m) / Float64(Float64(l * d) * d)), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(-0.25 * h) * D_m) * M_m), Float64(Float64(D_m / Float64(Float64(d * d) * l)) * M_m), 1.0)) * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(D$95$m * M$95$m), $MachinePrecision], 4e-109], N[(1.0 * w0), $MachinePrecision], If[LessEqual[N[(D$95$m * M$95$m), $MachinePrecision], 2e+133], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(-0.25 * h), $MachinePrecision] * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(N[(D$95$m / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;D\_m \cdot M\_m \leq 4 \cdot 10^{-109}:\\
\;\;\;\;1 \cdot w0\\
\mathbf{elif}\;D\_m \cdot M\_m \leq 2 \cdot 10^{+133}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{\left(\left(D\_m \cdot M\_m\right) \cdot M\_m\right) \cdot D\_m}{\left(\ell \cdot d\right) \cdot d}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\left(-0.25 \cdot h\right) \cdot D\_m\right) \cdot M\_m, \frac{D\_m}{\left(d \cdot d\right) \cdot \ell} \cdot M\_m, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 M D) < 4e-109Initial program 79.6%
Taylor expanded in h around 0
Applied rewrites69.4%
if 4e-109 < (*.f64 M D) < 2e133Initial program 80.4%
Taylor expanded in h around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites65.4%
Applied rewrites65.4%
Applied rewrites87.7%
if 2e133 < (*.f64 M D) Initial program 90.3%
Taylor expanded in h around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites55.5%
Applied rewrites56.0%
Applied rewrites70.1%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6470.1
Applied rewrites75.6%
Final simplification72.7%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* D_m M_m) 1e-160)
(* 1.0 w0)
(*
(sqrt
(fma
(* (/ (* -0.5 (* D_m M_m)) (* l d)) h)
(* (* (/ 0.5 d) M_m) D_m)
1.0))
w0)))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((D_m * M_m) <= 1e-160) {
tmp = 1.0 * w0;
} else {
tmp = sqrt(fma((((-0.5 * (D_m * M_m)) / (l * d)) * h), (((0.5 / d) * M_m) * D_m), 1.0)) * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(D_m * M_m) <= 1e-160) tmp = Float64(1.0 * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(-0.5 * Float64(D_m * M_m)) / Float64(l * d)) * h), Float64(Float64(Float64(0.5 / d) * M_m) * D_m), 1.0)) * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(D$95$m * M$95$m), $MachinePrecision], 1e-160], N[(1.0 * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] * N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;D\_m \cdot M\_m \leq 10^{-160}:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{-0.5 \cdot \left(D\_m \cdot M\_m\right)}{\ell \cdot d} \cdot h, \left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 M D) < 9.9999999999999999e-161Initial program 79.2%
Taylor expanded in h around 0
Applied rewrites68.1%
if 9.9999999999999999e-161 < (*.f64 M D) Initial program 84.1%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lift-pow.f64N/A
unpow2N/A
distribute-lft-neg-inN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites85.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6488.5
Applied rewrites88.5%
Final simplification73.5%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* D_m M_m) 1e-160)
(* 1.0 w0)
(*
(sqrt (fma (* -0.25 h) (* (* (/ (* D_m M_m) (* l d)) (/ M_m d)) D_m) 1.0))
w0)))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if ((D_m * M_m) <= 1e-160) {
tmp = 1.0 * w0;
} else {
tmp = sqrt(fma((-0.25 * h), ((((D_m * M_m) / (l * d)) * (M_m / d)) * D_m), 1.0)) * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(D_m * M_m) <= 1e-160) tmp = Float64(1.0 * w0); else tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(D_m * M_m) / Float64(l * d)) * Float64(M_m / d)) * D_m), 1.0)) * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(D$95$m * M$95$m), $MachinePrecision], 1e-160], N[(1.0 * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;D\_m \cdot M\_m \leq 10^{-160}:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \left(\frac{D\_m \cdot M\_m}{\ell \cdot d} \cdot \frac{M\_m}{d}\right) \cdot D\_m, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 M D) < 9.9999999999999999e-161Initial program 79.2%
Taylor expanded in h around 0
Applied rewrites68.1%
if 9.9999999999999999e-161 < (*.f64 M D) Initial program 84.1%
Taylor expanded in h around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lft-mult-inverseN/A
distribute-rgt-inN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites66.5%
Applied rewrites65.3%
Applied rewrites84.4%
Final simplification72.4%
D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d) :precision binary64 (* 1.0 w0))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
return 1.0 * w0;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
code = 1.0d0 * w0
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
return 1.0 * w0;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): return 1.0 * w0
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) return Float64(1.0 * w0) end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp = code(w0, M_m, D_m, h, l, d)
tmp = 1.0 * w0;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(1.0 * w0), $MachinePrecision]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
1 \cdot w0
\end{array}
Initial program 80.5%
Taylor expanded in h around 0
Applied rewrites64.7%
Final simplification64.7%
herbie shell --seed 2024270
(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))))))