
(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)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(let* ((t_0 (* (* (/ 0.5 d_m) M_m) D_m)))
(if (<= (/ (* M_m D_m) (* 2.0 d_m)) 4e-26)
(* (sqrt (fma (/ (/ (* -0.5 (* M_m D_m)) d_m) l) (* t_0 h) 1.0)) w0)
(* (sqrt (fma (* (* (/ (* -0.5 M_m) d_m) D_m) (/ h l)) t_0 1.0)) w0))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = ((0.5 / d_m) * M_m) * D_m;
double tmp;
if (((M_m * D_m) / (2.0 * d_m)) <= 4e-26) {
tmp = sqrt(fma((((-0.5 * (M_m * D_m)) / d_m) / l), (t_0 * h), 1.0)) * w0;
} else {
tmp = sqrt(fma(((((-0.5 * M_m) / d_m) * D_m) * (h / l)), t_0, 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(Float64(Float64(0.5 / d_m) * M_m) * D_m) tmp = 0.0 if (Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) <= 4e-26) tmp = Float64(sqrt(fma(Float64(Float64(Float64(-0.5 * Float64(M_m * D_m)) / d_m) / l), Float64(t_0 * h), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(-0.5 * M_m) / d_m) * D_m) * Float64(h / l)), t_0, 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(N[(N[(0.5 / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]}, If[LessEqual[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 4e-26], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / d$95$m), $MachinePrecision] / l), $MachinePrecision] * N[(t$95$0 * h), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(N[(-0.5 * M$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision] * t$95$0 + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := \left(\frac{0.5}{d\_m} \cdot M\_m\right) \cdot D\_m\\
\mathbf{if}\;\frac{M\_m \cdot D\_m}{2 \cdot d\_m} \leq 4 \cdot 10^{-26}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\frac{-0.5 \cdot \left(M\_m \cdot D\_m\right)}{d\_m}}{\ell}, t\_0 \cdot h, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\frac{-0.5 \cdot M\_m}{d\_m} \cdot D\_m\right) \cdot \frac{h}{\ell}, t\_0, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) < 4.0000000000000002e-26Initial program 75.4%
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 rewrites89.8%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
Applied rewrites88.4%
if 4.0000000000000002e-26 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 68.5%
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 rewrites70.3%
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-*.f6472.3
Applied rewrites72.3%
Final simplification85.3%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l))) INFINITY)
(*
(sqrt
(fma
(* (* (/ (* -0.5 M_m) d_m) D_m) (/ h l))
(* (* (/ 0.5 d_m) M_m) D_m)
1.0))
w0)
(*
(sqrt
(fma (* -0.25 h) (* (/ D_m d_m) (* (* (/ (/ M_m d_m) l) M_m) D_m)) 1.0))
w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((1.0 - (pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l))) <= ((double) INFINITY)) {
tmp = sqrt(fma(((((-0.5 * M_m) / d_m) * D_m) * (h / l)), (((0.5 / d_m) * M_m) * D_m), 1.0)) * w0;
} else {
tmp = sqrt(fma((-0.25 * h), ((D_m / d_m) * ((((M_m / d_m) / l) * M_m) * D_m)), 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l))) <= Inf) tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(-0.5 * M_m) / d_m) * D_m) * Float64(h / l)), Float64(Float64(Float64(0.5 / d_m) * M_m) * D_m), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(D_m / d_m) * Float64(Float64(Float64(Float64(M_m / d_m) / l) * M_m) * D_m)), 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[Sqrt[N[(N[(N[(N[(N[(-0.5 * M$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(0.5 / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(D$95$m / d$95$m), $MachinePrecision] * N[(N[(N[(N[(M$95$m / d$95$m), $MachinePrecision] / l), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq \infty:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\frac{-0.5 \cdot M\_m}{d\_m} \cdot D\_m\right) \cdot \frac{h}{\ell}, \left(\frac{0.5}{d\_m} \cdot M\_m\right) \cdot D\_m, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{D\_m}{d\_m} \cdot \left(\left(\frac{\frac{M\_m}{d\_m}}{\ell} \cdot M\_m\right) \cdot D\_m\right), 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))) < +inf.0Initial program 83.2%
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 rewrites82.7%
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-*.f6484.8
Applied rewrites84.8%
if +inf.0 < (-.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 0.0%
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 rewrites68.4%
Applied rewrites64.6%
Applied rewrites82.5%
Final simplification84.6%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) -1e-5)
(*
(sqrt
(fma (* -0.25 h) (/ (* (* (* D_m D_m) M_m) M_m) (* (* d_m d_m) l)) 1.0))
w0)
(* 1.0 w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -1e-5) {
tmp = sqrt(fma((-0.25 * h), ((((D_m * D_m) * M_m) * M_m) / ((d_m * d_m) * l)), 1.0)) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= -1e-5) tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(D_m * D_m) * M_m) * M_m) / Float64(Float64(d_m * d_m) * l)), 1.0)) * w0); else tmp = Float64(1.0 * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -1e-5], 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$95$m * d$95$m), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -1 \cdot 10^{-5}:\\
\;\;\;\;\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\_m \cdot d\_m\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.00000000000000008e-5Initial program 55.5%
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 rewrites35.9%
Taylor expanded in h around inf
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
distribute-lft-inN/A
associate-*r*N/A
rgt-mult-inverseN/A
lower-fma.f64N/A
Applied rewrites35.8%
if -1.00000000000000008e-5 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 83.5%
Taylor expanded in h around 0
Applied rewrites97.0%
Final simplification76.5%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) (- INFINITY))
(fma
(* (* (* M_m h) (* (/ w0 (* (* l d_m) d_m)) M_m)) (* -0.125 D_m))
D_m
w0)
(* 1.0 w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -((double) INFINITY)) {
tmp = fma((((M_m * h) * ((w0 / ((l * d_m) * d_m)) * M_m)) * (-0.125 * D_m)), D_m, w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= Float64(-Inf)) tmp = fma(Float64(Float64(Float64(M_m * h) * Float64(Float64(w0 / Float64(Float64(l * d_m) * d_m)) * M_m)) * Float64(-0.125 * D_m)), D_m, w0); else tmp = Float64(1.0 * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(N[(N[(M$95$m * h), $MachinePrecision] * N[(N[(w0 / N[(N[(l * d$95$m), $MachinePrecision] * d$95$m), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision]), $MachinePrecision] * D$95$m + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(\left(\left(M\_m \cdot h\right) \cdot \left(\frac{w0}{\left(\ell \cdot d\_m\right) \cdot d\_m} \cdot M\_m\right)\right) \cdot \left(-0.125 \cdot D\_m\right), D\_m, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0Initial program 43.0%
Taylor expanded in h around 0
Applied rewrites6.1%
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 rewrites36.0%
Applied rewrites36.0%
Applied rewrites42.9%
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 85.1%
Taylor expanded in h around 0
Applied rewrites88.3%
Final simplification76.4%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* (pow (/ (* M_m D_m) (* 2.0 d_m)) 2.0) (/ h l)) (- INFINITY))
(fma
(* -0.125 (* D_m D_m))
(* (* (* (/ w0 (* (* l d_m) d_m)) h) M_m) M_m)
w0)
(* 1.0 w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((pow(((M_m * D_m) / (2.0 * d_m)), 2.0) * (h / l)) <= -((double) INFINITY)) {
tmp = fma((-0.125 * (D_m * D_m)), ((((w0 / ((l * d_m) * d_m)) * h) * M_m) * M_m), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) ^ 2.0) * Float64(h / l)) <= Float64(-Inf)) tmp = fma(Float64(-0.125 * Float64(D_m * D_m)), Float64(Float64(Float64(Float64(w0 / Float64(Float64(l * d_m) * d_m)) * h) * M_m) * M_m), w0); else tmp = Float64(1.0 * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(-0.125 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(w0 / N[(N[(l * d$95$m), $MachinePrecision] * d$95$m), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d\_m}\right)}^{2} \cdot \frac{h}{\ell} \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot \left(D\_m \cdot D\_m\right), \left(\left(\frac{w0}{\left(\ell \cdot d\_m\right) \cdot d\_m} \cdot h\right) \cdot M\_m\right) \cdot M\_m, w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0Initial program 43.0%
Taylor expanded in h around 0
Applied rewrites6.1%
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 rewrites36.0%
Applied rewrites36.0%
Applied rewrites40.9%
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 85.1%
Taylor expanded in h around 0
Applied rewrites88.3%
Final simplification75.9%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (/ (* M_m D_m) (* 2.0 d_m)) 2e-184)
(* 1.0 w0)
(*
(sqrt
(fma
(/ (* (* -0.5 (* M_m D_m)) h) (* l d_m))
(* (* (/ 0.5 d_m) M_m) D_m)
1.0))
w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (((M_m * D_m) / (2.0 * d_m)) <= 2e-184) {
tmp = 1.0 * w0;
} else {
tmp = sqrt(fma((((-0.5 * (M_m * D_m)) * h) / (l * d_m)), (((0.5 / d_m) * M_m) * D_m), 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(Float64(M_m * D_m) / Float64(2.0 * d_m)) <= 2e-184) tmp = Float64(1.0 * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(-0.5 * Float64(M_m * D_m)) * h) / Float64(l * d_m)), Float64(Float64(Float64(0.5 / d_m) * M_m) * D_m), 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d$95$m), $MachinePrecision]), $MachinePrecision], 2e-184], N[(1.0 * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(0.5 / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{M\_m \cdot D\_m}{2 \cdot d\_m} \leq 2 \cdot 10^{-184}:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(-0.5 \cdot \left(M\_m \cdot D\_m\right)\right) \cdot h}{\ell \cdot d\_m}, \left(\frac{0.5}{d\_m} \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)) < 2.0000000000000001e-184Initial program 75.3%
Taylor expanded in h around 0
Applied rewrites78.2%
if 2.0000000000000001e-184 < (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) Initial program 71.0%
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 rewrites72.3%
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-*.f6469.8
Applied rewrites69.8%
Final simplification75.9%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* M_m D_m) 2e-103)
(fma
(* -0.125 (* D_m D_m))
(/ (/ (* (/ (* (* M_m M_m) h) l) w0) d_m) d_m)
w0)
(if (<= (* M_m D_m) 5e+130)
(*
(sqrt
(fma (* -0.25 h) (/ (* (* (* M_m D_m) M_m) D_m) (* (* d_m d_m) l)) 1.0))
w0)
(*
(sqrt
(-
1.0
(* (/ (* D_m h) (* l d_m)) (* (* 0.25 (* M_m M_m)) (/ D_m d_m)))))
w0))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((M_m * D_m) <= 2e-103) {
tmp = fma((-0.125 * (D_m * D_m)), ((((((M_m * M_m) * h) / l) * w0) / d_m) / d_m), w0);
} else if ((M_m * D_m) <= 5e+130) {
tmp = sqrt(fma((-0.25 * h), ((((M_m * D_m) * M_m) * D_m) / ((d_m * d_m) * l)), 1.0)) * w0;
} else {
tmp = sqrt((1.0 - (((D_m * h) / (l * d_m)) * ((0.25 * (M_m * M_m)) * (D_m / d_m))))) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(M_m * D_m) <= 2e-103) tmp = fma(Float64(-0.125 * Float64(D_m * D_m)), Float64(Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) / l) * w0) / d_m) / d_m), w0); elseif (Float64(M_m * D_m) <= 5e+130) tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(M_m * D_m) * M_m) * D_m) / Float64(Float64(d_m * d_m) * l)), 1.0)) * w0); else tmp = Float64(sqrt(Float64(1.0 - Float64(Float64(Float64(D_m * h) / Float64(l * d_m)) * Float64(Float64(0.25 * Float64(M_m * M_m)) * Float64(D_m / d_m))))) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 2e-103], N[(N[(-0.125 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision] * w0), $MachinePrecision] / d$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] + w0), $MachinePrecision], If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 5e+130], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(d$95$m * d$95$m), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(1.0 - N[(N[(N[(D$95$m * h), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \cdot D\_m \leq 2 \cdot 10^{-103}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot \left(D\_m \cdot D\_m\right), \frac{\frac{\frac{\left(M\_m \cdot M\_m\right) \cdot h}{\ell} \cdot w0}{d\_m}}{d\_m}, w0\right)\\
\mathbf{elif}\;M\_m \cdot D\_m \leq 5 \cdot 10^{+130}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{\left(\left(M\_m \cdot D\_m\right) \cdot M\_m\right) \cdot D\_m}{\left(d\_m \cdot d\_m\right) \cdot \ell}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{1 - \frac{D\_m \cdot h}{\ell \cdot d\_m} \cdot \left(\left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right) \cdot \frac{D\_m}{d\_m}\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 M D) < 1.99999999999999992e-103Initial program 77.3%
Taylor expanded in h around 0
Applied rewrites73.5%
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 rewrites53.1%
Applied rewrites67.6%
if 1.99999999999999992e-103 < (*.f64 M D) < 4.9999999999999996e130Initial program 68.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 rewrites45.8%
Applied rewrites74.0%
if 4.9999999999999996e130 < (*.f64 M D) Initial program 60.6%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lift-pow.f64N/A
unpow2N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites63.4%
lift-/.f64N/A
div-invN/A
lift-/.f64N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
remove-double-divN/A
unpow-1N/A
lift-pow.f64N/A
div-invN/A
*-commutativeN/A
lower-/.f64N/A
div-invN/A
lift-pow.f64N/A
unpow-1N/A
remove-double-divN/A
lower-*.f64N/A
lower-*.f6459.7
Applied rewrites59.7%
Final simplification67.6%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* M_m D_m) 2e-103)
(fma
(* -0.125 (* D_m D_m))
(/ (/ (* (/ (* (* M_m M_m) h) l) w0) d_m) d_m)
w0)
(if (<= (* M_m D_m) 2e+139)
(*
(sqrt
(fma (* -0.25 h) (/ (* (* (* M_m D_m) M_m) D_m) (* (* d_m d_m) l)) 1.0))
w0)
(*
(sqrt
(fma (* -0.25 h) (* (* (/ D_m d_m) D_m) (/ (* M_m M_m) (* l d_m))) 1.0))
w0))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((M_m * D_m) <= 2e-103) {
tmp = fma((-0.125 * (D_m * D_m)), ((((((M_m * M_m) * h) / l) * w0) / d_m) / d_m), w0);
} else if ((M_m * D_m) <= 2e+139) {
tmp = sqrt(fma((-0.25 * h), ((((M_m * D_m) * M_m) * D_m) / ((d_m * d_m) * l)), 1.0)) * w0;
} else {
tmp = sqrt(fma((-0.25 * h), (((D_m / d_m) * D_m) * ((M_m * M_m) / (l * d_m))), 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(M_m * D_m) <= 2e-103) tmp = fma(Float64(-0.125 * Float64(D_m * D_m)), Float64(Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) / l) * w0) / d_m) / d_m), w0); elseif (Float64(M_m * D_m) <= 2e+139) tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(M_m * D_m) * M_m) * D_m) / Float64(Float64(d_m * d_m) * l)), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(D_m / d_m) * D_m) * Float64(Float64(M_m * M_m) / Float64(l * d_m))), 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 2e-103], N[(N[(-0.125 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision] * w0), $MachinePrecision] / d$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] + w0), $MachinePrecision], If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 2e+139], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(d$95$m * d$95$m), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(D$95$m / d$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(M$95$m * M$95$m), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \cdot D\_m \leq 2 \cdot 10^{-103}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot \left(D\_m \cdot D\_m\right), \frac{\frac{\frac{\left(M\_m \cdot M\_m\right) \cdot h}{\ell} \cdot w0}{d\_m}}{d\_m}, w0\right)\\
\mathbf{elif}\;M\_m \cdot D\_m \leq 2 \cdot 10^{+139}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{\left(\left(M\_m \cdot D\_m\right) \cdot M\_m\right) \cdot D\_m}{\left(d\_m \cdot d\_m\right) \cdot \ell}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \left(\frac{D\_m}{d\_m} \cdot D\_m\right) \cdot \frac{M\_m \cdot M\_m}{\ell \cdot d\_m}, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (*.f64 M D) < 1.99999999999999992e-103Initial program 77.3%
Taylor expanded in h around 0
Applied rewrites73.5%
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 rewrites53.1%
Applied rewrites67.6%
if 1.99999999999999992e-103 < (*.f64 M D) < 2.00000000000000007e139Initial program 69.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 rewrites44.7%
Applied rewrites72.1%
if 2.00000000000000007e139 < (*.f64 M D) Initial program 59.2%
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 rewrites40.3%
Applied rewrites51.9%
Applied rewrites52.3%
Final simplification66.6%
d_m = (fabs.f64 d) D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (let* ((t_0 (* (* (/ 0.5 d_m) M_m) D_m))) (* (sqrt (- 1.0 (/ (* t_0 h) (/ l t_0)))) w0)))
d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = ((0.5 / d_m) * M_m) * D_m;
return sqrt((1.0 - ((t_0 * h) / (l / t_0)))) * w0;
}
d_m = abs(d)
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
real(8) :: t_0
t_0 = ((0.5d0 / d_m_1) * m_m) * d_m
code = sqrt((1.0d0 - ((t_0 * h) / (l / t_0)))) * w0
end function
d_m = Math.abs(d);
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = ((0.5 / d_m) * M_m) * D_m;
return Math.sqrt((1.0 - ((t_0 * h) / (l / t_0)))) * w0;
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): t_0 = ((0.5 / d_m) * M_m) * D_m return math.sqrt((1.0 - ((t_0 * h) / (l / t_0)))) * w0
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(Float64(Float64(0.5 / d_m) * M_m) * D_m) return Float64(sqrt(Float64(1.0 - Float64(Float64(t_0 * h) / Float64(l / t_0)))) * w0) end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp = code(w0, M_m, D_m, h, l, d_m)
t_0 = ((0.5 / d_m) * M_m) * D_m;
tmp = sqrt((1.0 - ((t_0 * h) / (l / t_0)))) * w0;
end
d_m = N[Abs[d], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(N[(N[(0.5 / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]}, N[(N[Sqrt[N[(1.0 - N[(N[(t$95$0 * h), $MachinePrecision] / N[(l / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := \left(\frac{0.5}{d\_m} \cdot M\_m\right) \cdot D\_m\\
\sqrt{1 - \frac{t\_0 \cdot h}{\frac{\ell}{t\_0}}} \cdot w0
\end{array}
\end{array}
Initial program 74.1%
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 rewrites86.1%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-pow.f64N/A
unpow-1N/A
remove-double-divN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6486.2
Applied rewrites86.2%
Final simplification86.2%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* M_m D_m) 2e-103)
(fma
(* -0.125 (* D_m D_m))
(/ (/ (* (/ (* (* M_m M_m) h) l) w0) d_m) d_m)
w0)
(if (<= (* M_m D_m) 2e+134)
(*
(sqrt
(fma (* -0.25 h) (/ (* (* (* M_m D_m) M_m) D_m) (* (* d_m d_m) l)) 1.0))
w0)
(fma
(* (* (* (/ M_m l) M_m) (* (/ w0 (* d_m d_m)) h)) D_m)
(* -0.125 D_m)
w0))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((M_m * D_m) <= 2e-103) {
tmp = fma((-0.125 * (D_m * D_m)), ((((((M_m * M_m) * h) / l) * w0) / d_m) / d_m), w0);
} else if ((M_m * D_m) <= 2e+134) {
tmp = sqrt(fma((-0.25 * h), ((((M_m * D_m) * M_m) * D_m) / ((d_m * d_m) * l)), 1.0)) * w0;
} else {
tmp = fma(((((M_m / l) * M_m) * ((w0 / (d_m * d_m)) * h)) * D_m), (-0.125 * D_m), w0);
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(M_m * D_m) <= 2e-103) tmp = fma(Float64(-0.125 * Float64(D_m * D_m)), Float64(Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) / l) * w0) / d_m) / d_m), w0); elseif (Float64(M_m * D_m) <= 2e+134) tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(M_m * D_m) * M_m) * D_m) / Float64(Float64(d_m * d_m) * l)), 1.0)) * w0); else tmp = fma(Float64(Float64(Float64(Float64(M_m / l) * M_m) * Float64(Float64(w0 / Float64(d_m * d_m)) * h)) * D_m), Float64(-0.125 * D_m), w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 2e-103], N[(N[(-0.125 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision] * w0), $MachinePrecision] / d$95$m), $MachinePrecision] / d$95$m), $MachinePrecision] + w0), $MachinePrecision], If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 2e+134], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(d$95$m * d$95$m), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(N[(w0 / N[(d$95$m * d$95$m), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + w0), $MachinePrecision]]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \cdot D\_m \leq 2 \cdot 10^{-103}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot \left(D\_m \cdot D\_m\right), \frac{\frac{\frac{\left(M\_m \cdot M\_m\right) \cdot h}{\ell} \cdot w0}{d\_m}}{d\_m}, w0\right)\\
\mathbf{elif}\;M\_m \cdot D\_m \leq 2 \cdot 10^{+134}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{\left(\left(M\_m \cdot D\_m\right) \cdot M\_m\right) \cdot D\_m}{\left(d\_m \cdot d\_m\right) \cdot \ell}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\left(\left(\frac{M\_m}{\ell} \cdot M\_m\right) \cdot \left(\frac{w0}{d\_m \cdot d\_m} \cdot h\right)\right) \cdot D\_m, -0.125 \cdot D\_m, w0\right)\\
\end{array}
\end{array}
if (*.f64 M D) < 1.99999999999999992e-103Initial program 77.3%
Taylor expanded in h around 0
Applied rewrites73.5%
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 rewrites53.1%
Applied rewrites67.6%
if 1.99999999999999992e-103 < (*.f64 M D) < 1.99999999999999984e134Initial program 69.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 rewrites44.7%
Applied rewrites72.1%
if 1.99999999999999984e134 < (*.f64 M D) Initial program 59.2%
Taylor expanded in h around 0
Applied rewrites18.9%
Taylor expanded in h around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites48.4%
Applied rewrites52.8%
Final simplification66.7%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= (* M_m D_m) 2e-103)
(* 1.0 w0)
(if (<= (* M_m D_m) 2e+134)
(*
(sqrt
(fma (* -0.25 h) (/ (* (* (* M_m D_m) M_m) D_m) (* (* d_m d_m) l)) 1.0))
w0)
(fma
(* (* (* (/ M_m l) M_m) (* (/ w0 (* d_m d_m)) h)) D_m)
(* -0.125 D_m)
w0))))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if ((M_m * D_m) <= 2e-103) {
tmp = 1.0 * w0;
} else if ((M_m * D_m) <= 2e+134) {
tmp = sqrt(fma((-0.25 * h), ((((M_m * D_m) * M_m) * D_m) / ((d_m * d_m) * l)), 1.0)) * w0;
} else {
tmp = fma(((((M_m / l) * M_m) * ((w0 / (d_m * d_m)) * h)) * D_m), (-0.125 * D_m), w0);
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (Float64(M_m * D_m) <= 2e-103) tmp = Float64(1.0 * w0); elseif (Float64(M_m * D_m) <= 2e+134) tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(M_m * D_m) * M_m) * D_m) / Float64(Float64(d_m * d_m) * l)), 1.0)) * w0); else tmp = fma(Float64(Float64(Float64(Float64(M_m / l) * M_m) * Float64(Float64(w0 / Float64(d_m * d_m)) * h)) * D_m), Float64(-0.125 * D_m), w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 2e-103], N[(1.0 * w0), $MachinePrecision], If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 2e+134], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(d$95$m * d$95$m), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[(N[(N[(N[(M$95$m / l), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(N[(w0 / N[(d$95$m * d$95$m), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(-0.125 * D$95$m), $MachinePrecision] + w0), $MachinePrecision]]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \cdot D\_m \leq 2 \cdot 10^{-103}:\\
\;\;\;\;1 \cdot w0\\
\mathbf{elif}\;M\_m \cdot D\_m \leq 2 \cdot 10^{+134}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{\left(\left(M\_m \cdot D\_m\right) \cdot M\_m\right) \cdot D\_m}{\left(d\_m \cdot d\_m\right) \cdot \ell}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\left(\left(\frac{M\_m}{\ell} \cdot M\_m\right) \cdot \left(\frac{w0}{d\_m \cdot d\_m} \cdot h\right)\right) \cdot D\_m, -0.125 \cdot D\_m, w0\right)\\
\end{array}
\end{array}
if (*.f64 M D) < 1.99999999999999992e-103Initial program 77.3%
Taylor expanded in h around 0
Applied rewrites73.5%
if 1.99999999999999992e-103 < (*.f64 M D) < 1.99999999999999984e134Initial program 69.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 rewrites44.7%
Applied rewrites72.1%
if 1.99999999999999984e134 < (*.f64 M D) Initial program 59.2%
Taylor expanded in h around 0
Applied rewrites18.9%
Taylor expanded in h around 0
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites48.4%
Applied rewrites52.8%
Final simplification71.0%
d_m = (fabs.f64 d) D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (let* ((t_0 (* (* (/ 0.5 d_m) M_m) D_m))) (* (sqrt (fma (/ t_0 l) (* (- h) t_0) 1.0)) w0)))
d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double t_0 = ((0.5 / d_m) * M_m) * D_m;
return sqrt(fma((t_0 / l), (-h * t_0), 1.0)) * w0;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) t_0 = Float64(Float64(Float64(0.5 / d_m) * M_m) * D_m) return Float64(sqrt(fma(Float64(t_0 / l), Float64(Float64(-h) * t_0), 1.0)) * w0) end
d_m = N[Abs[d], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := Block[{t$95$0 = N[(N[(N[(0.5 / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]}, N[(N[Sqrt[N[(N[(t$95$0 / l), $MachinePrecision] * N[((-h) * t$95$0), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
t_0 := \left(\frac{0.5}{d\_m} \cdot M\_m\right) \cdot D\_m\\
\sqrt{\mathsf{fma}\left(\frac{t\_0}{\ell}, \left(-h\right) \cdot t\_0, 1\right)} \cdot w0
\end{array}
\end{array}
Initial program 74.1%
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 rewrites86.1%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
Applied rewrites86.1%
Final simplification86.1%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= l -9.6e-111)
(*
(sqrt
(fma
(/ (* (* -0.5 (* M_m D_m)) h) (* l d_m))
(* (* (/ 0.5 d_m) M_m) D_m)
1.0))
w0)
(*
(sqrt
(fma (* -0.25 h) (* (/ D_m d_m) (* (* (/ (/ M_m d_m) l) M_m) D_m)) 1.0))
w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (l <= -9.6e-111) {
tmp = sqrt(fma((((-0.5 * (M_m * D_m)) * h) / (l * d_m)), (((0.5 / d_m) * M_m) * D_m), 1.0)) * w0;
} else {
tmp = sqrt(fma((-0.25 * h), ((D_m / d_m) * ((((M_m / d_m) / l) * M_m) * D_m)), 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (l <= -9.6e-111) tmp = Float64(sqrt(fma(Float64(Float64(Float64(-0.5 * Float64(M_m * D_m)) * h) / Float64(l * d_m)), Float64(Float64(Float64(0.5 / d_m) * M_m) * D_m), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(D_m / d_m) * Float64(Float64(Float64(Float64(M_m / d_m) / l) * M_m) * D_m)), 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[l, -9.6e-111], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(0.5 / d$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(D$95$m / d$95$m), $MachinePrecision] * N[(N[(N[(N[(M$95$m / d$95$m), $MachinePrecision] / l), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -9.6 \cdot 10^{-111}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(-0.5 \cdot \left(M\_m \cdot D\_m\right)\right) \cdot h}{\ell \cdot d\_m}, \left(\frac{0.5}{d\_m} \cdot M\_m\right) \cdot D\_m, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{D\_m}{d\_m} \cdot \left(\left(\frac{\frac{M\_m}{d\_m}}{\ell} \cdot M\_m\right) \cdot D\_m\right), 1\right)} \cdot w0\\
\end{array}
\end{array}
if l < -9.6000000000000003e-111Initial program 83.8%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lift-pow.f64N/A
unpow2N/A
distribute-lft-neg-inN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites82.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-*.f6483.8
Applied rewrites83.8%
if -9.6000000000000003e-111 < l Initial program 68.8%
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 rewrites57.2%
Applied rewrites61.6%
Applied rewrites76.8%
Final simplification79.2%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= M_m 2.6e-169)
(* 1.0 w0)
(*
(sqrt
(fma (* -0.25 h) (* (/ (* (* M_m M_m) D_m) (* l d_m)) (/ D_m d_m)) 1.0))
w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 2.6e-169) {
tmp = 1.0 * w0;
} else {
tmp = sqrt(fma((-0.25 * h), ((((M_m * M_m) * D_m) / (l * d_m)) * (D_m / d_m)), 1.0)) * w0;
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (M_m <= 2.6e-169) tmp = Float64(1.0 * w0); else tmp = Float64(sqrt(fma(Float64(-0.25 * h), Float64(Float64(Float64(Float64(M_m * M_m) * D_m) / Float64(l * d_m)) * Float64(D_m / d_m)), 1.0)) * w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[M$95$m, 2.6e-169], N[(1.0 * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(-0.25 * h), $MachinePrecision] * N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(l * d$95$m), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 2.6 \cdot 10^{-169}:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-0.25 \cdot h, \frac{\left(M\_m \cdot M\_m\right) \cdot D\_m}{\ell \cdot d\_m} \cdot \frac{D\_m}{d\_m}, 1\right)} \cdot w0\\
\end{array}
\end{array}
if M < 2.60000000000000014e-169Initial program 79.3%
Taylor expanded in h around 0
Applied rewrites71.5%
if 2.60000000000000014e-169 < M Initial program 62.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 rewrites56.6%
Applied rewrites61.7%
Final simplification68.4%
d_m = (fabs.f64 d)
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d_m)
:precision binary64
(if (<= M_m 3.9e-88)
(* 1.0 w0)
(fma
D_m
(* (* (* (* (* M_m M_m) h) -0.125) (/ w0 (* (* l d_m) d_m))) D_m)
w0)))d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
double tmp;
if (M_m <= 3.9e-88) {
tmp = 1.0 * w0;
} else {
tmp = fma(D_m, (((((M_m * M_m) * h) * -0.125) * (w0 / ((l * d_m) * d_m))) * D_m), w0);
}
return tmp;
}
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) tmp = 0.0 if (M_m <= 3.9e-88) tmp = Float64(1.0 * w0); else tmp = fma(D_m, Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) * -0.125) * Float64(w0 / Float64(Float64(l * d_m) * d_m))) * D_m), w0); end return tmp end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := If[LessEqual[M$95$m, 3.9e-88], N[(1.0 * w0), $MachinePrecision], N[(D$95$m * N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * -0.125), $MachinePrecision] * N[(w0 / N[(N[(l * d$95$m), $MachinePrecision] * d$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] + w0), $MachinePrecision]]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
\begin{array}{l}
\mathbf{if}\;M\_m \leq 3.9 \cdot 10^{-88}:\\
\;\;\;\;1 \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(D\_m, \left(\left(\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot -0.125\right) \cdot \frac{w0}{\left(\ell \cdot d\_m\right) \cdot d\_m}\right) \cdot D\_m, w0\right)\\
\end{array}
\end{array}
if M < 3.89999999999999992e-88Initial program 79.6%
Taylor expanded in h around 0
Applied rewrites72.5%
if 3.89999999999999992e-88 < M Initial program 57.6%
Taylor expanded in h around 0
Applied rewrites49.5%
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 rewrites42.3%
Applied rewrites40.7%
Applied rewrites42.7%
Final simplification65.1%
d_m = (fabs.f64 d) D_m = (fabs.f64 D) M_m = (fabs.f64 M) NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. (FPCore (w0 M_m D_m h l d_m) :precision binary64 (* 1.0 w0))
d_m = fabs(d);
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m);
double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return 1.0 * w0;
}
d_m = abs(d)
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d_m_1)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d_m_1
code = 1.0d0 * w0
end function
d_m = Math.abs(d);
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d_m;
public static double code(double w0, double M_m, double D_m, double h, double l, double d_m) {
return 1.0 * w0;
}
d_m = math.fabs(d) D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d_m] = sort([w0, M_m, D_m, h, l, d_m]) def code(w0, M_m, D_m, h, l, d_m): return 1.0 * w0
d_m = abs(d) D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d_m = sort([w0, M_m, D_m, h, l, d_m]) function code(w0, M_m, D_m, h, l, d_m) return Float64(1.0 * w0) end
d_m = abs(d);
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d_m = num2cell(sort([w0, M_m, D_m, h, l, d_m])){:}
function tmp = code(w0, M_m, D_m, h, l, d_m)
tmp = 1.0 * w0;
end
d_m = N[Abs[d], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d_m should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d$95$m_] := N[(1.0 * w0), $MachinePrecision]
\begin{array}{l}
d_m = \left|d\right|
\\
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d_m] = \mathsf{sort}([w0, M_m, D_m, h, l, d_m])\\
\\
1 \cdot w0
\end{array}
Initial program 74.1%
Taylor expanded in h around 0
Applied rewrites66.8%
Final simplification66.8%
herbie shell --seed 2024268
(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))))))