I am hoping for explicit numerical estimates like the following sample (with made up numbers, though it might be true): for every $n \gt 10^6$ and every $b$ with $b^2 \lt n \lt b^3$, the number of somewhat smooth numbers in the interval $(n,n+b)$ is at least $b/4$ and at most $3b/7$. Here a number $m$ is somewhat smooth if each of its prime factors is at most the square root of $m$.
The literature on Dickman's function and recent surveys on smooth numbers by Moree and Granville say a lot for larger intervals than what is considered above, and in more generality, but the error terms are not explicit, and I have yet to construct a version with explicit terms from above based on my searches. The actual value approaches $b(1 - \log 2)$ as $n$ grows, but I do not know how fast. Also, somewhat smooth corresponds to $u=2$ in the literature, where $u=\log x / \log y$ is a common parameter in counting $y$-smooth positive integers less than $x$, but I may need to adapt somewhat smooth to $u$-smooth for $u$ some real between $2$ and $3$, so a good answer would address these other values of $u$. If smaller values of $b$ can be used, that would be great, but I think I may only need $n \lt b^3$, and doubt I will need $n \lt b^4$. Note that I am emphasizing explicit and reliable over asymptotic; I do not need tight estimates or small error terms especially if they are not explicit, and I do not want a set of exceptional $n$ or $b$ unless they are all less than a finite explicit and small bound.
Can someone point to or derive such explicit estimates of this type? Computations suggest that the sample above not only is true, but holds for $n$ much smaller than $10^6$.
Gerhard "Quite More Than Somewhat Unsure" Paseman, 2017.04.10.