Markov and Bernstein type inequalities for polynomials (Q1304737): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Ram N. Mohapatra / rank | |||
Property / author | |||
Property / author: Ram N. Mohapatra / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2086448991 / rank | |||
Normal rank |
Latest revision as of 10:14, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Markov and Bernstein type inequalities for polynomials |
scientific article |
Statements
Markov and Bernstein type inequalities for polynomials (English)
0 references
29 March 2000
0 references
For a real polynomial \(p(z)= \sum^n_{\nu =0} a_\nu z^\nu\) of degree \(n\) we have the inequality \[ \max_{-1\leq x\leq 1}|p'(x)|\leq n^2\max_{-1\leq x\leq 1}|p(x)| \] which is known as Markov's inequality. For a complex polynomial \(p(z)= \sum^n_{\nu= 0}c_\nu z^\nu\) of degree \(n\) we have \[ \max_{|z|= 1} |p'(z)|\leq n\max_{|z|=1} |p'(z)| \] which is known as Bernstein inequality. Both inequalities are the best possible and are attained for \(T_n(x)= \cos n\cos^{-1}x\) and \(p_n(z)= \lambda z^n\). These two inequalities have been the starting points for many considerations. In this paper, the authors present some of the research centered around these inequalities. The references include more then hundred papers.
0 references
Bernstein inequality
0 references