An Improvement Theorem for Descartes Systems

DOI10.2307/2042578MaRDI QIDQ4189601zbMATH OpenOpenAlexFDO

Authors Philip W. Smith

Publication date 1978

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

zbMATH Keywords

Best ApproximationDescartes SystemsPolynomial Approximation

Mathematics Subject Classification ID

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

Cites work

• Best uniform approximation from a collection of subspaces
• scientific article; zbMATH DE number 3504851 (Why is no real title available?)
• scientific article; zbMATH DE number 3246461 (Why is no real title available?)

Cited in

(13)

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

This page was built for publication: An Improvement Theorem for Descartes Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189601)