Selvaraj , Lacunary interpolation by cosine polynomials, Ann. Jakimovski , Reflections onWalsh equiconvergence and equisummability, Acta Univ. Lodziensis Folia Math. Lee and H.
Tan , Spline interpolation and wavelet construction, Appl. Szabados , Birkhoff type interpolation on perturbed roots of unity, in: N. Govil et al Eds. Varma Memorial Volume, Monogr. Textbooks Pure Appl. Jakimovski , Hermite interpolation on Chebyshev nodes and Walsh equiconvergence, in: N. Jakimovski , Hermite interpolation on Chebyshev nodes and Walsh equiconvergence, J.
Ivanov , A conjecture of Schoenberg, J. Ivanov , A conjecture of Schoenberg, Comm. Theory Contin. Fractions 6 — Law and R. Wong Eds.
- Narendra Kumar Govil.
- Scalable Fuzzy Algorithms for Data Management and Analysis: Methods and Design.
- Structural Engineering of Transmission Lines.
- List of Publications!
- Frontiers in Interpolation and Approximation - CRC Press Book.
Ziegler , Hermite interpolation on some perturbed roots of unity, Analysis Munich 19 1 1— Some simple properties of up x , in: Z. Ahmad, N.
Passar bra ihop
Govil and P. Jain Eds. India 11 83— Szabados , Quantitative results in some problems on Walsh equiconvergence, East J.
Jakimovski , Hermite interpolation on Chebyshev nodes and Walsh equiconvergence. II, J. Chui and Larry L. Singapore, , pp. Algorithms 23 1 — Algorithms 25 — Bokhari and H. Dikshit , Birkhoff interpolation on perturbed roots of unity: revisited, Numer. Algorithms 25 47— Jakimovski , Quantitative results on equiconvergence of certain sequences of rational interpolants, Math.
Cavaretta , Optimal recovery of interpolation operators in Hardy spaces, Adv. Numerous extensions of Markov inequality for various families of univariate and multivariate polynomials are known. For an overview of univariate inequalities see  or ; a survey of multivariate Markov-type inequalities can be found in . For the sharpness of this upper bound see  and . Thus, the rates of Markov Factors for homogeneous polynomials are substantially smaller than for ordinary polynomials.
It is also shown in  that for smooth 0-symmetric convex bodies the log n in 1. In all of the papers on homogeneous polynomials mentioned above the symmetry of the domain played an essential role. The consideration of nonsymmetric domains K will require a more delicate study of the geometry of K around the origin. Also we shall relax the assumption of convexity of the domain and replace it by the more general starlike property.
On the other hand the left inequality requires that r x does not vanish at 0 exponentially. Theorem 1. Note that condition 1. Now let us address the question of sharpness of estimate 1. Moreover, by 1. Then by 2. Lemma 2. Therefore, combining estimates 2. First, observe that condition 2. Markov-Type Inequalities 11 Thus, by 2. Using Lemma 2.
Note that property 2. K Moreover, by 2. Thus, in conditions 1.
Without loss of generality we can assume supporting line of K that l is a coordinate axis this can be achieved by a rotation ; i. This completes the proof of the Theorem 1. References  R.
Borwein, T. Louis, MO, , pp. Harris, A Bernstein-Markov theorem for normed spaces, J.
Markov-Type Inequalities 15  A. Chui, M. Neamtu, L. Schumaker, eds. Revesz, Y. Sarantopoulos, On Markov constants of homogeneous polynomials over real normed spaces, East J. The Remez inequality S and is clearly sharp, as has the same form as 1. Question 1. Videnski  and T.www.hiphopenation.com/mu-plugins/rockdale/metro-online-dating.php
Frontiers in interpolation and approximation. Dedicated to the memory of Sharma - PDF Free Download
Erdelyi, respectively; see the references in the book . The results discussed pose several problems for multivariate polynomials. Of course, it would be unlikely to establish such inequalities in a sharp form. So we are mostly looking for a sharp order of growth as the relative measure tends to zero. According to the one-dimensional results exhibited above Local Ineqalities for Multivariate Polynomials 19 we have the following groups of problems for multivariate polynomials. We begin with a Chebyshev type problem. Problem 2. The next is a Remez type problem formulated as follows. Conjecture 2.
Otherwise, the conjecture remains an open problem. The problems presented have had a lot of generalizations and variants. We mention only several of them. One-dimensional prototypes of this problem are those of Cartwright and of Plancherel-Polya. Therefore we will restrict our consideration to some results studied in the authors papers and results related to them. Based on a simple geometric fact proved in  it is established in  that the optimal constant of Problem 2. In some cases equality 3.
Formula 3. Strikingly, the optimal constant of Problem 2. Estimate 3. The very same proof gives inequality 3. To explain the relation of 3. We present here only two such results referring the interested reader to the papers -, , . Moreover, the proof in  gives some information on the size of N. Then the following is true: Theorem 3.