Skip to main content
2 of 3
added that it would be still interesting to have B = poly(N)

Polynomial approximation for square root function with fast convergence and bounded coefficients

Let $\delta, \varepsilon \in (0,1)$. I am interested in a sequence $\{ \tilde{f}_N\}_N$ of polynomial approximations of the square root function $x \to x^{1/2}$ on $[\delta,1]$, of the form $$ \tilde{f}_{N}(x) = \sum_{i=0}^N \alpha_i x^i $$ which satisfies \begin{align*} \sup_{x \in [\delta,1]} \left|x^{1/2} - \tilde{f}_N(x)\right| & \leq \varepsilon, \\ N & = O\left(\frac{1}{\delta} \log\frac{1}{\varepsilon}\right),\\ \sum_{i=0}^N |\alpha_i| & \leq B, \\ \end{align*} where $B$ is a universal constant independent of $N$. (Obviously, I also want the sequence to satisfy $\tilde{f}_{N+1}(x) = \tilde{f}_{N}(x) + \alpha_{N+1} x^{N+1}$.)

Does such a sequence of approximations exist?

We can relax the requirement that B is a constant, and it would also be interesting if it could be taken as poly($N$).

More generally, I am interested in such a sequence of approximations, which satisfy the same properties, for the function $x \to x^{\alpha}$ where $\alpha \in (0,1)$.