Abstract
AbstractMüntz’s theorem asserts, for example, that the linear span of the even powers$$1, x^2, x^4,\dots $$1,x2,x4,⋯is dense in$$C([0,1])$$C([0,1]). We show that the associated expansions are so inefficient as to have no conceivable relevance to any actual computation. For example, approximating$$f(x)=x$$f(x)=xto accuracy$$\varepsilon = 10^{-6}$$ε=10-6in this basis requires powers larger than$$x^{280{,}000}$$x280,000and coefficients larger than$$10^{107{,}000}$$10107,000. We present a theorem establishing exponential growth of coefficients with respect to$$1/\varepsilon $$1/ε.
Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. Adcock, B., Huybrechs, D.: Frames and numerical approximation. SIAM Rev. 61, 443–473 (2019)
2. Almira, J.M.: Müntz type theorems. I. Surv. Approx. Theory 3, 152–194 (2007)
3. Beckermann, B.: The condition number of real Vandermonde, Krylov and positive definite Hankel matrices. Numer. Math. 85, 553–577 (2000)
4. Bernstein S.N.: Sur les recherches récentes relatives à la meilleure approximation des fonctions continues par les polynômes. In: Proceedings of the 5th International Mathematical Congress, vol. 1 , pp. 256–266 (1912)
5. Bernstein, S.: Sur la meilleure approximation de $$|x|$$ par des polynômes de degrés donnés. Acta Math. 37, 1–57 (1914)