Approximation by polynomials of given length

MaRDI QIDQ791072zbMATH OpenFDO

Authors Bogdan M. Baishanski

Publication date 1983

Published in Illinois Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

length of a polynomial

Mathematics Subject Classification ID

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

Review text

The number of non-zero coefficients of a polynomial P is denoted by \(\ell(P)\) and is called the length of P. It is shown here that given 1\(\leq p\leq \infty\), and \(f\in L_ p[a,b]\), in the class of all polynomials of length at most m, there exists a polynomial of best approximation to f in the p-norm.

Recommendations

• scientific article; zbMATH DE number 4038421
• scientific article; zbMATH DE number 1752678
• Polynomial approximation in \(L_ p(S)\) for \(p>0\)
• Best Approximations in L 1 are Near Best in L p , p < 1
• Polynomial approximation in \(L_ p (O<p<1)\)

Cited in

(7)

• On incomplete polynomials
• An estimate for the coefficients of polynomials of given length
• On the reduced length of a polynomial with real coefficients. II
• Sparse polynomial approximation of parametric elliptic PDEs. Part I: affine coefficients
• scientific article; zbMATH DE number 3847941 (Why is no real title available?)
• scientific article; zbMATH DE number 4038421 (Why is no real title available?)
• scientific article; zbMATH DE number 169600 (Why is no real title available?)

This page was built for publication: Approximation by polynomials of given length

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