Chebyshev constants for the unit circle

نویسندگان

  • Gergely Ambrus
  • Keith M. Ball
  • Tamás Erdélyi
چکیده

It is proven that for any system of n points z1, . . . , zn on the (complex) unit circle, there exists another point z of norm 1, such that ∑ 1 |zk − z|2 6 n 4 . Two proofs are presented: one uses a characterisation of equioscillating rational functions, while the other is based on Bernstein’s inequality.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Near-Circularity of the Error Curve In Complex Chebyshev Approximation

Let f(z) be analytic on the unit disk, and let p*(z) be the best (Chebyshev) polynomial approximation to f(z) on the disk of degree at most n. It is observed that in typical problems the “error curve,” the image of the unit circle under (f p*)(z), often approximates to a startling degree a perfect circle with winding number n + 1. This phenomenon is approached by consideration of related proble...

متن کامل

Riesz polarization inequalities in higher dimensions

We derive bounds and asymptotics for the maximum Riesz polarization quantity M n(A) := max x1,x2,... ,xn∈A min x∈A n ∑ j=1 1 |x− xj |p (which is n times the Chebyshev constant ) for quite general sets A ⊂ R with special focus on the unit sphere and unit ball. We combine elementary averaging arguments with potential theoretic tools to formulate and prove our results. We also give a discrete vers...

متن کامل

Circularity of the Error Curve and Sharpness of the Cf Method in Complex Chebyshev Approximation *

Let f(z) be analytic at the origin, and for e >0, let f(ez) be best approximated in the Chebyshev sense on the unit disk by a rational function of type (m, n). It has been shown previously by the CF method that the error curve for this approximation deviates from a circle by at most O(e 2m+2n+3) as e 0. We prove here that this bound is sharp in two senses: the error curve for a given function c...

متن کامل

The computation of line spectral frequencies using Chebyshev polynomials

Line spectral frequencies provide an alternate parameterization of the analysis and synthesis filters used in linear predictive coding (LPC) of speech. In this paper, a new method of converting between the direct form predictor coefficients and line spectral frequencies is presented. ,The system polynomial for the analysis filter is converted to two even-order symmetric polynomials with interla...

متن کامل

On a Sequence of Fast Decreasing Polynomial Operators

Let f be a piecewise analytic function on the unit interval (respectively, the unit circle of the complex plane). Starting from the Chebyshev (respectively, Fourier) coefficients of f , we construct a sequence of fast decreasing polynomials (respectively, trigonometric polynomials) which “detect” the points where f fails to be analytic, provided f is not infinitely differentiable at these points.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011