
(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))
double code(double c0, double A, double V, double l) {
return c0 * sqrt((A / (V * l)));
}
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = c0 * sqrt((a / (v * l)))
end function
public static double code(double c0, double A, double V, double l) {
return c0 * Math.sqrt((A / (V * l)));
}
def code(c0, A, V, l): return c0 * math.sqrt((A / (V * l)))
function code(c0, A, V, l) return Float64(c0 * sqrt(Float64(A / Float64(V * l)))) end
function tmp = code(c0, A, V, l) tmp = c0 * sqrt((A / (V * l))); end
code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))
double code(double c0, double A, double V, double l) {
return c0 * sqrt((A / (V * l)));
}
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = c0 * sqrt((a / (v * l)))
end function
public static double code(double c0, double A, double V, double l) {
return c0 * Math.sqrt((A / (V * l)));
}
def code(c0, A, V, l): return c0 * math.sqrt((A / (V * l)))
function code(c0, A, V, l) return Float64(c0 * sqrt(Float64(A / Float64(V * l)))) end
function tmp = code(c0, A, V, l) tmp = c0 * sqrt((A / (V * l))); end
code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}
\end{array}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (sqrt (* V (/ l A)))))
(if (<= (* V l) -1e-315)
(/ (* (sqrt (- A)) c0) (* (sqrt (- V)) (sqrt l)))
(if (<= (* V l) 0.0)
(* c0 (/ 1.0 t_0))
(if (<= (* V l) 1e+305)
(* c0 (/ (sqrt A) (sqrt (* V l))))
(/ c0 t_0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt((V * (l / A)));
double tmp;
if ((V * l) <= -1e-315) {
tmp = (sqrt(-A) * c0) / (sqrt(-V) * sqrt(l));
} else if ((V * l) <= 0.0) {
tmp = c0 * (1.0 / t_0);
} else if ((V * l) <= 1e+305) {
tmp = c0 * (sqrt(A) / sqrt((V * l)));
} else {
tmp = c0 / t_0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((v * (l / a)))
if ((v * l) <= (-1d-315)) then
tmp = (sqrt(-a) * c0) / (sqrt(-v) * sqrt(l))
else if ((v * l) <= 0.0d0) then
tmp = c0 * (1.0d0 / t_0)
else if ((v * l) <= 1d+305) then
tmp = c0 * (sqrt(a) / sqrt((v * l)))
else
tmp = c0 / t_0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt((V * (l / A)));
double tmp;
if ((V * l) <= -1e-315) {
tmp = (Math.sqrt(-A) * c0) / (Math.sqrt(-V) * Math.sqrt(l));
} else if ((V * l) <= 0.0) {
tmp = c0 * (1.0 / t_0);
} else if ((V * l) <= 1e+305) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
} else {
tmp = c0 / t_0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt((V * (l / A))) tmp = 0 if (V * l) <= -1e-315: tmp = (math.sqrt(-A) * c0) / (math.sqrt(-V) * math.sqrt(l)) elif (V * l) <= 0.0: tmp = c0 * (1.0 / t_0) elif (V * l) <= 1e+305: tmp = c0 * (math.sqrt(A) / math.sqrt((V * l))) else: tmp = c0 / t_0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = sqrt(Float64(V * Float64(l / A))) tmp = 0.0 if (Float64(V * l) <= -1e-315) tmp = Float64(Float64(sqrt(Float64(-A)) * c0) / Float64(sqrt(Float64(-V)) * sqrt(l))); elseif (Float64(V * l) <= 0.0) tmp = Float64(c0 * Float64(1.0 / t_0)); elseif (Float64(V * l) <= 1e+305) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l)))); else tmp = Float64(c0 / t_0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt((V * (l / A)));
tmp = 0.0;
if ((V * l) <= -1e-315)
tmp = (sqrt(-A) * c0) / (sqrt(-V) * sqrt(l));
elseif ((V * l) <= 0.0)
tmp = c0 * (1.0 / t_0);
elseif ((V * l) <= 1e+305)
tmp = c0 * (sqrt(A) / sqrt((V * l)));
else
tmp = c0 / t_0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[Sqrt[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(V * l), $MachinePrecision], -1e-315], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[(N[Sqrt[(-V)], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], N[(c0 * N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+305], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c0 / t$95$0), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{V \cdot \frac{\ell}{A}}\\
\mathbf{if}\;V \cdot \ell \leq -1 \cdot 10^{-315}:\\
\;\;\;\;\frac{\sqrt{-A} \cdot c0}{\sqrt{-V} \cdot \sqrt{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq 0:\\
\;\;\;\;c0 \cdot \frac{1}{t\_0}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{+305}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{t\_0}\\
\end{array}
\end{array}
if (*.f64 V l) < -9.999999985e-316Initial program 79.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6478.2
Applied rewrites78.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
times-fracN/A
*-commutativeN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-divN/A
frac-2negN/A
sqrt-divN/A
frac-2negN/A
frac-timesN/A
lower-/.f64N/A
Applied rewrites96.6%
if -9.999999985e-316 < (*.f64 V l) < -0.0Initial program 34.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6464.4
Applied rewrites64.4%
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-/r/N/A
associate-*l/N/A
lift-*.f64N/A
lower-/.f6434.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6434.5
Applied rewrites34.5%
lift-/.f64N/A
div-invN/A
inv-powN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-prod-upN/A
pow-prod-downN/A
remove-double-negN/A
lift-neg.f64N/A
remove-double-negN/A
lift-neg.f64N/A
sqr-negN/A
pow-prod-downN/A
pow-prod-upN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
inv-powN/A
clear-numN/A
clear-numN/A
div-invN/A
lift-*.f64N/A
associate-*l/N/A
lift-/.f64N/A
Applied rewrites65.8%
if -0.0 < (*.f64 V l) < 9.9999999999999994e304Initial program 80.1%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6498.3
Applied rewrites98.3%
if 9.9999999999999994e304 < (*.f64 V l) Initial program 31.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6474.9
Applied rewrites74.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-/r/N/A
associate-*l/N/A
Applied rewrites31.9%
lift-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-*.f6475.0
Applied rewrites75.0%
Final simplification91.7%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* c0 (sqrt (/ A (* V l))))))
(if (<= t_0 0.0)
(* c0 (sqrt (/ (/ A l) V)))
(if (<= t_0 2e+272)
(* c0 (sqrt (* A (/ 1.0 (* V l)))))
(/ c0 (sqrt (* l (/ V A))))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = c0 * sqrt((A / (V * l)));
double tmp;
if (t_0 <= 0.0) {
tmp = c0 * sqrt(((A / l) / V));
} else if (t_0 <= 2e+272) {
tmp = c0 * sqrt((A * (1.0 / (V * l))));
} else {
tmp = c0 / sqrt((l * (V / A)));
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = c0 * sqrt((a / (v * l)))
if (t_0 <= 0.0d0) then
tmp = c0 * sqrt(((a / l) / v))
else if (t_0 <= 2d+272) then
tmp = c0 * sqrt((a * (1.0d0 / (v * l))))
else
tmp = c0 / sqrt((l * (v / a)))
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = c0 * Math.sqrt((A / (V * l)));
double tmp;
if (t_0 <= 0.0) {
tmp = c0 * Math.sqrt(((A / l) / V));
} else if (t_0 <= 2e+272) {
tmp = c0 * Math.sqrt((A * (1.0 / (V * l))));
} else {
tmp = c0 / Math.sqrt((l * (V / A)));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 * math.sqrt((A / (V * l))) tmp = 0 if t_0 <= 0.0: tmp = c0 * math.sqrt(((A / l) / V)) elif t_0 <= 2e+272: tmp = c0 * math.sqrt((A * (1.0 / (V * l)))) else: tmp = c0 / math.sqrt((l * (V / A))) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 * sqrt(Float64(A / Float64(V * l)))) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V))); elseif (t_0 <= 2e+272) tmp = Float64(c0 * sqrt(Float64(A * Float64(1.0 / Float64(V * l))))); else tmp = Float64(c0 / sqrt(Float64(l * Float64(V / A)))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = c0 * sqrt((A / (V * l)));
tmp = 0.0;
if (t_0 <= 0.0)
tmp = c0 * sqrt(((A / l) / V));
elseif (t_0 <= 2e+272)
tmp = c0 * sqrt((A * (1.0 / (V * l))));
else
tmp = c0 / sqrt((l * (V / A)));
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+272], N[(c0 * N[Sqrt[N[(A * N[(1.0 / N[(V * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(c0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+272}:\\
\;\;\;\;c0 \cdot \sqrt{A \cdot \frac{1}{V \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot \frac{V}{A}}}\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 0.0Initial program 69.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6471.4
Applied rewrites71.4%
if 0.0 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 2.0000000000000001e272Initial program 98.8%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6498.3
Applied rewrites98.3%
if 2.0000000000000001e272 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 48.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6457.3
Applied rewrites57.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-/r/N/A
associate-*l/N/A
Applied rewrites50.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6459.6
Applied rewrites59.6%
Final simplification76.9%
herbie shell --seed 2024222
(FPCore (c0 A V l)
:name "Henrywood and Agarwal, Equation (3)"
:precision binary64
(* c0 (sqrt (/ A (* V l)))))