An Improvement Theorem for Descartes Systems

DOI10.2307/2042578zbMath0404.41002OpenAlexW4243336160MaRDI QIDQ4189601

Philip W. Smith

Publication date: 1978

Full work available at URL: https://doi.org/10.2307/2042578

zbMATH Keywords

Best ApproximationPolynomial ApproximationDescartes Systems

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10)

Related Items

An extremal problem concerning differential operators and applications to optimal reconstruction, Markov-Nikolskii type inequalities for exponential sums on finite intervals, Lacunary Müntz systems, Interlacing properties of the zeros of the error functions in best \(L^p\)- approximations, Markov-Type Inequalities for Products of Müntz Polynomials Revisited, On lacunary incomplete polynomials, Generalizations of Müntz’s Theorem via a Remez-type inequality for Müntz spaces, Upper bound for the degree of an approximating monomial, Upper Bounds for the Derivative of Exponential Sums, Markov-type inequalities for products of Müntz polynomials, Structure of weak Descartes systems, An estimate for the coefficients of polynomials of given length, On incomplete polynomials

Cites Work

• Best uniform approximation from a collection of subspaces
• Unnamed Item
• Unnamed Item