On a discrete norm for polynomials

DOI10.1016/j.jmaa.2012.06.034zbMath1257.42002OpenAlexW1976493799MaRDI QIDQ714051

L. Salinas C., Stephan Ruscheweyh, Richard Fournier

Publication date: 19 October 2012

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2012.06.034

zbMATH Keywords

interpolationdiscrete normsdiscrete type Bernstein and Markov inequalities

Mathematics Subject Classification ID

Moment problems and interpolation problems in the complex plane (30E05) Trigonometric polynomials, inequalities, extremal problems (42A05)

Related Items (2)

On Two Interpolation Formulas for Complex Polynomials ⋮ An interpolation formula in relation to a polynomial inequality of Schur

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on multivariate Chebyshev polynomials
• Lower bound for the discrete norm of a polynomial on the circle
• Bounds for polynomials with a unit discrete norm
• On discrete norms of polynomials
• Some extensions of the Markov inequality for polynomials
• A note on Bernstein and Markov type inequalities
• Inequalities concerning polynomials and trigonometric polynomials
• An inequality for the modulus of a polynomial evaluated at the roots of unity
• A Refinement of an Inequality of the Brothers Markoff

This page was built for publication: On a discrete norm for polynomials