
(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 (<= (pow (/ (* D_m M_m) (* d 2.0)) 2.0) 4e-88)
(*
(sqrt
(fma (/ (* D_m M_m) (* (* 4.0 d) (* (/ d (* D_m M_m)) l))) (- h) 1.0))
w0)
(* (sqrt (fma (* t_0 (/ (- h) l)) t_0 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) * D_m;
double tmp;
if (pow(((D_m * M_m) / (d * 2.0)), 2.0) <= 4e-88) {
tmp = sqrt(fma(((D_m * M_m) / ((4.0 * d) * ((d / (D_m * M_m)) * l))), -h, 1.0)) * w0;
} else {
tmp = sqrt(fma((t_0 * (-h / l)), t_0, 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(Float64(0.5 / d) * M_m) * D_m) tmp = 0.0 if ((Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0) <= 4e-88) tmp = Float64(sqrt(fma(Float64(Float64(D_m * M_m) / Float64(Float64(4.0 * d) * Float64(Float64(d / Float64(D_m * M_m)) * l))), Float64(-h), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(t_0 * Float64(Float64(-h) / l)), t_0, 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[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]}, If[LessEqual[N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision], 4e-88], N[(N[Sqrt[N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(N[(4.0 * d), $MachinePrecision] * N[(N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * (-h) + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(t$95$0 * N[((-h) / l), $MachinePrecision]), $MachinePrecision] * t$95$0 + 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 := \left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m\\
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq 4 \cdot 10^{-88}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{D\_m \cdot M\_m}{\left(4 \cdot d\right) \cdot \left(\frac{d}{D\_m \cdot M\_m} \cdot \ell\right)}, -h, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(t\_0 \cdot \frac{-h}{\ell}, t\_0, 1\right)} \cdot w0\\
\end{array}
\end{array}
if (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) < 3.99999999999999974e-88Initial program 91.3%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
associate-/r/N/A
neg-mul-1N/A
associate-*l/N/A
metadata-evalN/A
frac-2negN/A
Applied rewrites92.1%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6498.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6498.6
Applied rewrites98.6%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6499.3
lift-*.f64N/A
*-commutativeN/A
lift-*.f6499.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.3
Applied rewrites99.3%
if 3.99999999999999974e-88 < (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) Initial program 69.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 rewrites75.8%
Final simplification88.4%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) -4e-11)
(*
(sqrt
(fma (* (- h) (* D_m M_m)) (/ (* 0.25 (* D_m M_m)) (* (* l d) d)) 1.0))
w0)
(* 1.0 w0)))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -4e-11) {
tmp = sqrt(fma((-h * (D_m * M_m)), ((0.25 * (D_m * M_m)) / ((l * d) * d)), 1.0)) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -4e-11) tmp = Float64(sqrt(fma(Float64(Float64(-h) * Float64(D_m * M_m)), Float64(Float64(0.25 * Float64(D_m * M_m)) / Float64(Float64(l * d) * d)), 1.0)) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -4e-11], N[(N[Sqrt[N[(N[((-h) * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(0.25 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -4 \cdot 10^{-11}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(-h\right) \cdot \left(D\_m \cdot M\_m\right), \frac{0.25 \cdot \left(D\_m \cdot M\_m\right)}{\left(\ell \cdot d\right) \cdot d}, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -3.99999999999999976e-11Initial program 67.5%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
associate-/r/N/A
neg-mul-1N/A
associate-*l/N/A
metadata-evalN/A
frac-2negN/A
Applied rewrites56.7%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6456.7
Applied rewrites53.4%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f6459.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6459.6
Applied rewrites59.6%
if -3.99999999999999976e-11 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 88.9%
Taylor expanded in M around 0
Applied rewrites98.1%
Final simplification83.9%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (* (/ h l) (pow (/ (* D_m M_m) (* d 2.0)) 2.0)) -5e-8)
(*
(sqrt
(fma (* (- h) (* D_m M_m)) (/ (* 0.25 (* D_m M_m)) (* (* d d) l)) 1.0))
w0)
(* 1.0 w0)))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -5e-8) {
tmp = sqrt(fma((-h * (D_m * M_m)), ((0.25 * (D_m * M_m)) / ((d * d) * l)), 1.0)) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -5e-8) tmp = Float64(sqrt(fma(Float64(Float64(-h) * Float64(D_m * M_m)), Float64(Float64(0.25 * Float64(D_m * M_m)) / Float64(Float64(d * d) * l)), 1.0)) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e-8], N[(N[Sqrt[N[(N[((-h) * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(0.25 * N[(D$95$m * M$95$m), $MachinePrecision]), $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 -5 \cdot 10^{-8}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(-h\right) \cdot \left(D\_m \cdot M\_m\right), \frac{0.25 \cdot \left(D\_m \cdot M\_m\right)}{\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)) < -4.9999999999999998e-8Initial program 67.2%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
associate-/r/N/A
neg-mul-1N/A
associate-*l/N/A
metadata-evalN/A
frac-2negN/A
Applied rewrites56.6%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6456.6
Applied rewrites53.2%
if -4.9999999999999998e-8 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 89.0%
Taylor expanded in M around 0
Applied rewrites97.9%
Final simplification81.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)) -5e-8)
(*
(sqrt
(fma (* (/ (* 0.25 (* D_m M_m)) (* (* d d) l)) (* D_m M_m)) (- h) 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)) <= -5e-8) {
tmp = sqrt(fma((((0.25 * (D_m * M_m)) / ((d * d) * l)) * (D_m * M_m)), -h, 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)) <= -5e-8) tmp = Float64(sqrt(fma(Float64(Float64(Float64(0.25 * Float64(D_m * M_m)) / Float64(Float64(d * d) * l)) * Float64(D_m * M_m)), Float64(-h), 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], -5e-8], N[(N[Sqrt[N[(N[(N[(N[(0.25 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * (-h) + 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 \cdot 10^{-8}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{0.25 \cdot \left(D\_m \cdot M\_m\right)}{\left(d \cdot d\right) \cdot \ell} \cdot \left(D\_m \cdot M\_m\right), -h, 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)) < -4.9999999999999998e-8Initial program 67.2%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
associate-/r/N/A
neg-mul-1N/A
associate-*l/N/A
metadata-evalN/A
frac-2negN/A
Applied rewrites56.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
associate-/l/N/A
lift-*.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-eval52.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6452.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6452.5
Applied rewrites52.5%
if -4.9999999999999998e-8 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 89.0%
Taylor expanded in M around 0
Applied rewrites97.9%
Final simplification81.4%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= (pow (/ (* D_m M_m) (* d 2.0)) 2.0) 5e+85)
(*
(sqrt
(fma (/ (/ (* D_m M_m) (* (/ d (* D_m M_m)) (* 4.0 d))) l) (- h) 1.0))
w0)
(*
(sqrt
(fma
(* (* (/ -0.5 d) D_m) M_m)
(* (* (/ h l) D_m) (* (/ 0.5 d) 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 (pow(((D_m * M_m) / (d * 2.0)), 2.0) <= 5e+85) {
tmp = sqrt(fma((((D_m * M_m) / ((d / (D_m * M_m)) * (4.0 * d))) / l), -h, 1.0)) * w0;
} else {
tmp = sqrt(fma((((-0.5 / d) * D_m) * M_m), (((h / l) * D_m) * ((0.5 / d) * 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(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0) <= 5e+85) tmp = Float64(sqrt(fma(Float64(Float64(Float64(D_m * M_m) / Float64(Float64(d / Float64(D_m * M_m)) * Float64(4.0 * d))) / l), Float64(-h), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(-0.5 / d) * D_m) * M_m), Float64(Float64(Float64(h / l) * D_m) * Float64(Float64(0.5 / d) * 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[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision], 5e+85], N[(N[Sqrt[N[(N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(4.0 * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * (-h) + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(-0.5 / d), $MachinePrecision] * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(N[(N[(h / l), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;{\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq 5 \cdot 10^{+85}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\frac{D\_m \cdot M\_m}{\frac{d}{D\_m \cdot M\_m} \cdot \left(4 \cdot d\right)}}{\ell}, -h, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\frac{-0.5}{d} \cdot D\_m\right) \cdot M\_m, \left(\frac{h}{\ell} \cdot D\_m\right) \cdot \left(\frac{0.5}{d} \cdot M\_m\right), 1\right)} \cdot w0\\
\end{array}
\end{array}
if (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) < 5.0000000000000001e85Initial program 92.0%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
associate-/r/N/A
neg-mul-1N/A
associate-*l/N/A
metadata-evalN/A
frac-2negN/A
Applied rewrites88.4%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6497.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6497.7
Applied rewrites97.7%
if 5.0000000000000001e85 < (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) Initial program 62.2%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
lower-fma.f64N/A
Applied rewrites65.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6470.5
Applied rewrites70.5%
Final simplification87.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)) -1e+54) (* (sqrt (* (* (* -0.25 D_m) (* (* (/ h (* (* d d) l)) M_m) M_m)) D_m)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -1e+54) {
tmp = sqrt((((-0.25 * D_m) * (((h / ((d * d) * l)) * M_m) * M_m)) * D_m)) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (((h / l) * (((d_m * m_m) / (d * 2.0d0)) ** 2.0d0)) <= (-1d+54)) then
tmp = sqrt(((((-0.25d0) * d_m) * (((h / ((d * d) * l)) * m_m) * m_m)) * d_m)) * w0
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * Math.pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -1e+54) {
tmp = Math.sqrt((((-0.25 * D_m) * (((h / ((d * d) * l)) * M_m) * M_m)) * D_m)) * w0;
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if ((h / l) * math.pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -1e+54: tmp = math.sqrt((((-0.25 * D_m) * (((h / ((d * d) * l)) * M_m) * M_m)) * D_m)) * w0 else: tmp = 1.0 * w0 return tmp
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -1e+54) tmp = Float64(sqrt(Float64(Float64(Float64(-0.25 * D_m) * Float64(Float64(Float64(h / Float64(Float64(d * d) * l)) * M_m) * M_m)) * D_m)) * w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (((h / l) * (((D_m * M_m) / (d * 2.0)) ^ 2.0)) <= -1e+54)
tmp = sqrt((((-0.25 * D_m) * (((h / ((d * d) * l)) * M_m) * M_m)) * D_m)) * w0;
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -1e+54], N[(N[Sqrt[N[(N[(N[(-0.25 * D$95$m), $MachinePrecision] * N[(N[(N[(h / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -1 \cdot 10^{+54}:\\
\;\;\;\;\sqrt{\left(\left(-0.25 \cdot D\_m\right) \cdot \left(\left(\frac{h}{\left(d \cdot d\right) \cdot \ell} \cdot M\_m\right) \cdot M\_m\right)\right) \cdot D\_m} \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.0000000000000001e54Initial program 64.5%
Taylor expanded in M around inf
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6440.9
Applied rewrites40.9%
Applied rewrites49.7%
if -1.0000000000000001e54 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 89.4%
Taylor expanded in M around 0
Applied rewrites94.9%
Final simplification79.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)) -4e+188) (fma (* -0.125 (* D_m D_m)) (* (* (/ w0 (* (* d d) l)) M_m) (* h M_m)) w0) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -4e+188) {
tmp = fma((-0.125 * (D_m * D_m)), (((w0 / ((d * d) * l)) * M_m) * (h * M_m)), w0);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) tmp = 0.0 if (Float64(Float64(h / l) * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0)) <= -4e+188) tmp = fma(Float64(-0.125 * Float64(D_m * D_m)), Float64(Float64(Float64(w0 / Float64(Float64(d * d) * l)) * M_m) * Float64(h * M_m)), w0); else tmp = Float64(1.0 * w0); end return tmp end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -4e+188], N[(N[(-0.125 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(w0 / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(h * M$95$m), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -4 \cdot 10^{+188}:\\
\;\;\;\;\mathsf{fma}\left(-0.125 \cdot \left(D\_m \cdot D\_m\right), \left(\frac{w0}{\left(d \cdot d\right) \cdot \ell} \cdot M\_m\right) \cdot \left(h \cdot M\_m\right), w0\right)\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -4.0000000000000001e188Initial program 61.0%
Taylor expanded in M 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.5%
Applied rewrites46.4%
if -4.0000000000000001e188 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 89.8%
Taylor expanded in M around 0
Applied rewrites91.0%
Final simplification77.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)) -5e+238) (/ (* (* (* (* (* (* h M_m) M_m) D_m) D_m) w0) -0.125) (* (* d d) 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 (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -5e+238) {
tmp = ((((((h * M_m) * M_m) * D_m) * D_m) * w0) * -0.125) / ((d * d) * l);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (((h / l) * (((d_m * m_m) / (d * 2.0d0)) ** 2.0d0)) <= (-5d+238)) then
tmp = ((((((h * m_m) * m_m) * d_m) * d_m) * w0) * (-0.125d0)) / ((d * d) * l)
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * Math.pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -5e+238) {
tmp = ((((((h * M_m) * M_m) * D_m) * D_m) * w0) * -0.125) / ((d * d) * l);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if ((h / l) * math.pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -5e+238: tmp = ((((((h * M_m) * M_m) * D_m) * D_m) * w0) * -0.125) / ((d * d) * l) 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+238) tmp = Float64(Float64(Float64(Float64(Float64(Float64(Float64(h * M_m) * M_m) * D_m) * D_m) * w0) * -0.125) / Float64(Float64(d * d) * l)); else tmp = Float64(1.0 * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (((h / l) * (((D_m * M_m) / (d * 2.0)) ^ 2.0)) <= -5e+238)
tmp = ((((((h * M_m) * M_m) * D_m) * D_m) * w0) * -0.125) / ((d * d) * l);
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -5e+238], N[(N[(N[(N[(N[(N[(N[(h * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * w0), $MachinePrecision] * -0.125), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $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^{+238}:\\
\;\;\;\;\frac{\left(\left(\left(\left(\left(h \cdot M\_m\right) \cdot M\_m\right) \cdot D\_m\right) \cdot D\_m\right) \cdot w0\right) \cdot -0.125}{\left(d \cdot d\right) \cdot \ell}\\
\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.99999999999999995e238Initial program 60.0%
Taylor expanded in M 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 rewrites43.6%
Taylor expanded in D around inf
Applied rewrites46.3%
Applied rewrites47.6%
if -4.99999999999999995e238 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 89.9%
Taylor expanded in M around 0
Applied rewrites90.0%
Final simplification77.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)) -1.5e+297) (* (* (/ -0.125 (* (* d d) l)) (* w0 D_m)) (* (* (* M_m M_m) h) D_m)) (* 1.0 w0)))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -1.5e+297) {
tmp = ((-0.125 / ((d * d) * l)) * (w0 * D_m)) * (((M_m * M_m) * h) * D_m);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
real(8) :: tmp
if (((h / l) * (((d_m * m_m) / (d * 2.0d0)) ** 2.0d0)) <= (-1.5d+297)) then
tmp = (((-0.125d0) / ((d * d) * l)) * (w0 * d_m)) * (((m_m * m_m) * h) * d_m)
else
tmp = 1.0d0 * w0
end if
code = tmp
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (((h / l) * Math.pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -1.5e+297) {
tmp = ((-0.125 / ((d * d) * l)) * (w0 * D_m)) * (((M_m * M_m) * h) * D_m);
} else {
tmp = 1.0 * w0;
}
return tmp;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): tmp = 0 if ((h / l) * math.pow(((D_m * M_m) / (d * 2.0)), 2.0)) <= -1.5e+297: tmp = ((-0.125 / ((d * d) * l)) * (w0 * D_m)) * (((M_m * M_m) * h) * D_m) 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)) <= -1.5e+297) tmp = Float64(Float64(Float64(-0.125 / Float64(Float64(d * d) * l)) * Float64(w0 * D_m)) * Float64(Float64(Float64(M_m * M_m) * h) * D_m)); else tmp = Float64(1.0 * w0); end return tmp end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
tmp = 0.0;
if (((h / l) * (((D_m * M_m) / (d * 2.0)) ^ 2.0)) <= -1.5e+297)
tmp = ((-0.125 / ((d * d) * l)) * (w0 * D_m)) * (((M_m * M_m) * h) * D_m);
else
tmp = 1.0 * w0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], -1.5e+297], N[(N[(N[(-0.125 / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(w0 * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * D$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{h}{\ell} \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2} \leq -1.5 \cdot 10^{+297}:\\
\;\;\;\;\left(\frac{-0.125}{\left(d \cdot d\right) \cdot \ell} \cdot \left(w0 \cdot D\_m\right)\right) \cdot \left(\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot D\_m\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)) < -1.49999999999999988e297Initial program 58.9%
Taylor expanded in M 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.7%
Taylor expanded in D around inf
Applied rewrites46.2%
Applied rewrites46.1%
if -1.49999999999999988e297 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) Initial program 90.0%
Taylor expanded in M around 0
Applied rewrites89.1%
Final simplification76.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) -1e-310)
(*
(sqrt
(fma (* (/ D_m (* (* 4.0 d) (* (/ d (* D_m M_m)) l))) M_m) (- h) 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) <= -1e-310) {
tmp = sqrt(fma(((D_m / ((4.0 * d) * ((d / (D_m * M_m)) * l))) * M_m), -h, 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(h / l) <= -1e-310) tmp = Float64(sqrt(fma(Float64(Float64(D_m / Float64(Float64(4.0 * d) * Float64(Float64(d / Float64(D_m * M_m)) * l))) * M_m), Float64(-h), 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[(h / l), $MachinePrecision], -1e-310], N[(N[Sqrt[N[(N[(N[(D$95$m / N[(N[(4.0 * d), $MachinePrecision] * N[(N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * (-h) + 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} \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{D\_m}{\left(4 \cdot d\right) \cdot \left(\frac{d}{D\_m \cdot M\_m} \cdot \ell\right)} \cdot M\_m, -h, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;1 \cdot w0\\
\end{array}
\end{array}
if (/.f64 h l) < -9.999999999999969e-311Initial program 78.6%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
associate-/r/N/A
neg-mul-1N/A
associate-*l/N/A
metadata-evalN/A
frac-2negN/A
Applied rewrites69.4%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6476.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6476.9
Applied rewrites76.9%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6477.5
lift-*.f64N/A
*-commutativeN/A
lift-*.f6477.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.5
Applied rewrites77.5%
if -9.999999999999969e-311 < (/.f64 h l) Initial program 84.6%
Taylor expanded in M around 0
Applied rewrites97.9%
Final simplification85.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 -1.2e-280)
(*
(sqrt
(fma (/ (* (* (/ M_m (* 4.0 d)) D_m) (* (/ D_m d) M_m)) l) (- h) 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 (h <= -1.2e-280) {
tmp = sqrt(fma(((((M_m / (4.0 * d)) * D_m) * ((D_m / d) * M_m)) / l), -h, 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 (h <= -1.2e-280) tmp = Float64(sqrt(fma(Float64(Float64(Float64(Float64(M_m / Float64(4.0 * d)) * D_m) * Float64(Float64(D_m / d) * M_m)) / l), Float64(-h), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(0.5 * D_m), Float64(Float64(Float64(Float64(-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[h, -1.2e-280], N[(N[Sqrt[N[(N[(N[(N[(N[(M$95$m / N[(4.0 * d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * (-h) + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(0.5 * D$95$m), $MachinePrecision] * N[(N[(N[((-M$95$m) * h), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\begin{array}{l}
\mathbf{if}\;h \leq -1.2 \cdot 10^{-280}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(\frac{M\_m}{4 \cdot d} \cdot D\_m\right) \cdot \left(\frac{D\_m}{d} \cdot M\_m\right)}{\ell}, -h, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(0.5 \cdot D\_m, \frac{\left(-M\_m\right) \cdot h}{\ell \cdot d} \cdot \left(\left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m\right), 1\right)} \cdot w0\\
\end{array}
\end{array}
if h < -1.1999999999999999e-280Initial program 82.8%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
associate-/r/N/A
neg-mul-1N/A
associate-*l/N/A
metadata-evalN/A
frac-2negN/A
Applied rewrites74.5%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6484.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6484.8
Applied rewrites84.8%
lift-/.f64N/A
clear-numN/A
inv-powN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
unpow-prod-downN/A
inv-powN/A
lift-/.f64N/A
clear-numN/A
inv-powN/A
clear-numN/A
lower-*.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6487.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6487.1
Applied rewrites87.1%
if -1.1999999999999999e-280 < h Initial program 79.5%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites84.7%
lift-fma.f64N/A
*-commutativeN/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites84.1%
Final simplification85.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 (<= M_m 8e-84)
(*
(sqrt
(fma (/ (* D_m M_m) (* (* 4.0 d) (* (/ d (* D_m M_m)) l))) (- h) 1.0))
w0)
(*
(sqrt
(fma (* (* (* 0.25 (* M_m M_m)) (/ D_m d)) (/ (- h) l)) (/ D_m d) 1.0))
w0)))D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
double tmp;
if (M_m <= 8e-84) {
tmp = sqrt(fma(((D_m * M_m) / ((4.0 * d) * ((d / (D_m * M_m)) * l))), -h, 1.0)) * w0;
} else {
tmp = sqrt(fma((((0.25 * (M_m * M_m)) * (D_m / d)) * (-h / l)), (D_m / d), 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 (M_m <= 8e-84) tmp = Float64(sqrt(fma(Float64(Float64(D_m * M_m) / Float64(Float64(4.0 * d) * Float64(Float64(d / Float64(D_m * M_m)) * l))), Float64(-h), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(Float64(0.25 * Float64(M_m * M_m)) * Float64(D_m / d)) * Float64(Float64(-h) / l)), Float64(D_m / d), 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[M$95$m, 8e-84], N[(N[Sqrt[N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(N[(4.0 * d), $MachinePrecision] * N[(N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * (-h) + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[((-h) / l), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $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}\;M\_m \leq 8 \cdot 10^{-84}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{D\_m \cdot M\_m}{\left(4 \cdot d\right) \cdot \left(\frac{d}{D\_m \cdot M\_m} \cdot \ell\right)}, -h, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(\left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right) \cdot \frac{D\_m}{d}\right) \cdot \frac{-h}{\ell}, \frac{D\_m}{d}, 1\right)} \cdot w0\\
\end{array}
\end{array}
if M < 8.0000000000000003e-84Initial program 83.1%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
associate-/r/N/A
neg-mul-1N/A
associate-*l/N/A
metadata-evalN/A
frac-2negN/A
Applied rewrites78.4%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6486.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.6
Applied rewrites86.6%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6489.1
lift-*.f64N/A
*-commutativeN/A
lift-*.f6489.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6489.1
Applied rewrites89.1%
if 8.0000000000000003e-84 < M Initial program 75.6%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
Applied rewrites67.2%
Final simplification83.0%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(if (<= M_m 8e-84)
(*
(sqrt
(fma (/ (* D_m M_m) (* (* 4.0 d) (* (/ d (* D_m M_m)) l))) (- h) 1.0))
w0)
(*
(sqrt
(fma (* (* 0.25 (* M_m M_m)) (/ D_m d)) (* (/ (- D_m) d) (/ h 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 (M_m <= 8e-84) {
tmp = sqrt(fma(((D_m * M_m) / ((4.0 * d) * ((d / (D_m * M_m)) * l))), -h, 1.0)) * w0;
} else {
tmp = sqrt(fma(((0.25 * (M_m * M_m)) * (D_m / d)), ((-D_m / d) * (h / 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 (M_m <= 8e-84) tmp = Float64(sqrt(fma(Float64(Float64(D_m * M_m) / Float64(Float64(4.0 * d) * Float64(Float64(d / Float64(D_m * M_m)) * l))), Float64(-h), 1.0)) * w0); else tmp = Float64(sqrt(fma(Float64(Float64(0.25 * Float64(M_m * M_m)) * Float64(D_m / d)), Float64(Float64(Float64(-D_m) / d) * Float64(h / 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[M$95$m, 8e-84], N[(N[Sqrt[N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(N[(4.0 * d), $MachinePrecision] * N[(N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * (-h) + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(0.25 * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(N[((-D$95$m) / d), $MachinePrecision] * N[(h / l), $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}\;M\_m \leq 8 \cdot 10^{-84}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\frac{D\_m \cdot M\_m}{\left(4 \cdot d\right) \cdot \left(\frac{d}{D\_m \cdot M\_m} \cdot \ell\right)}, -h, 1\right)} \cdot w0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(\left(0.25 \cdot \left(M\_m \cdot M\_m\right)\right) \cdot \frac{D\_m}{d}, \frac{-D\_m}{d} \cdot \frac{h}{\ell}, 1\right)} \cdot w0\\
\end{array}
\end{array}
if M < 8.0000000000000003e-84Initial program 83.1%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
associate-/r/N/A
neg-mul-1N/A
associate-*l/N/A
metadata-evalN/A
frac-2negN/A
Applied rewrites78.4%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6486.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.6
Applied rewrites86.6%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6489.1
lift-*.f64N/A
*-commutativeN/A
lift-*.f6489.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6489.1
Applied rewrites89.1%
if 8.0000000000000003e-84 < M Initial program 75.6%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
associate-/l*N/A
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
Applied rewrites67.1%
Final simplification83.0%
D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
:precision binary64
(*
(sqrt
(fma
(* (* (/ 0.5 d) M_m) D_m)
(/ (* (* (/ M_m d) h) (* 0.5 D_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) {
return sqrt(fma((((0.5 / d) * M_m) * D_m), ((((M_m / d) * h) * (0.5 * D_m)) / -l), 1.0)) * w0;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) return Float64(sqrt(fma(Float64(Float64(Float64(0.5 / d) * M_m) * D_m), Float64(Float64(Float64(Float64(M_m / d) * h) * Float64(0.5 * D_m)) / Float64(-l)), 1.0)) * w0) end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(N[Sqrt[N[(N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(N[(N[(M$95$m / d), $MachinePrecision] * h), $MachinePrecision] * N[(0.5 * D$95$m), $MachinePrecision]), $MachinePrecision] / (-l)), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\sqrt{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, \frac{\left(\frac{M\_m}{d} \cdot h\right) \cdot \left(0.5 \cdot D\_m\right)}{-\ell}, 1\right)} \cdot w0
\end{array}
Initial program 81.0%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
distribute-neg-frac2N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites84.9%
Final simplification84.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 (* (sqrt (fma (/ (* D_m M_m) (* (* 4.0 d) (* (/ d (* D_m M_m)) l))) (- 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) {
return sqrt(fma(((D_m * M_m) / ((4.0 * d) * ((d / (D_m * M_m)) * l))), -h, 1.0)) * w0;
}
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) return Float64(sqrt(fma(Float64(Float64(D_m * M_m) / Float64(Float64(4.0 * d) * Float64(Float64(d / Float64(D_m * M_m)) * l))), Float64(-h), 1.0)) * w0) end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(N[Sqrt[N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(N[(4.0 * d), $MachinePrecision] * N[(N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * (-h) + 1.0), $MachinePrecision]], $MachinePrecision] * w0), $MachinePrecision]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
\sqrt{\mathsf{fma}\left(\frac{D\_m \cdot M\_m}{\left(4 \cdot d\right) \cdot \left(\frac{d}{D\_m \cdot M\_m} \cdot \ell\right)}, -h, 1\right)} \cdot w0
\end{array}
Initial program 81.0%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
frac-2negN/A
associate-/r/N/A
neg-mul-1N/A
associate-*l/N/A
metadata-evalN/A
frac-2negN/A
Applied rewrites76.5%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6483.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6483.6
Applied rewrites83.6%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6485.5
lift-*.f64N/A
*-commutativeN/A
lift-*.f6485.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.5
Applied rewrites85.5%
Final simplification85.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 (* 1.0 w0))
D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
return 1.0 * w0;
}
D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
real(8), intent (in) :: w0
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: d
code = 1.0d0 * w0
end function
D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
return 1.0 * w0;
}
D_m = math.fabs(D) M_m = math.fabs(M) [w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d]) def code(w0, M_m, D_m, h, l, d): return 1.0 * w0
D_m = abs(D) M_m = abs(M) w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d]) function code(w0, M_m, D_m, h, l, d) return Float64(1.0 * w0) end
D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp = code(w0, M_m, D_m, h, l, d)
tmp = 1.0 * w0;
end
D_m = N[Abs[D], $MachinePrecision] M_m = N[Abs[M], $MachinePrecision] NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function. code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(1.0 * w0), $MachinePrecision]
\begin{array}{l}
D_m = \left|D\right|
\\
M_m = \left|M\right|
\\
[w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\
\\
1 \cdot w0
\end{array}
Initial program 81.0%
Taylor expanded in M around 0
Applied rewrites64.6%
Final simplification64.6%
herbie shell --seed 2024235
(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))))))