An Improvement Theorem for Descartes Systems

DOI10.2307/2042578zbMATH Open0404.41002OpenAlexW4243336160MaRDI QIDQ4189601FDOQ4189601

Authors: 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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Best uniform approximation from a collection of subspaces

Cited In (13)

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

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)