CHEBYSHEV POLYNOMIALS ON REGULAR POLYGONS IN THE COMPLEX PLANE
Abstract
The Chebyshev problem is studied for a regular \(m\)-gon \(G_m\), \(m\geq 3\), in the complex plane \(\mathbb{C}\). Let \(\mathscr{P}_n^1\) be the set of algebraic polynomials of a given degree \(n\) with unit leading coefficient. The problem is to find the smallest value \(\tau_n(G_m)\) of the uniform norm \(\|p_n\|_{C(G_m)}\) on the polygon \(G_m\) for polynomials \(p_n\in\mathscr{P}_n^1\), and a polynomial with the smallest norm, called the Chebyshev polynomial (for the polygon). We restrict the class of polynomials in the problem and reduce the domain on which an equivalent problem is studied for polynomials of a substantially lower degree. An exact solution of the problem is given for polynomials of degrees \(n=1,2,\ldots,m\).
Keywords
Full Text:
PDFReferences
- Arestov V.V., Mendelev A.S. On trigonometric polynomials least deviating from zero. Dokl. Math., 2009. Vol. 79, No. 2. P. 280–283. DOI: 10.1134/S1064562409020343
- Arestov V.V., Mendelev A.S. Trigonometric polynomials of least deviation from zero in measure and related problems. J. Approx. Theory, 2010. Vol. 162, No. 10. P. 1852–1878.  DOI: 10.1016/j.jat.2010.07.007
- Bayramov E.B. Polynomials least deviating from zero on a square of the complex plane. Trudy Inst. Mat. Mekh. UrO RAN, 2018. Vol. 24, No. 3. P. 5–15. DOI: 10.21538/0134-4889-2018-24-3-5-15 (in Russian)
- Bernstein S.N. Ekstremal’nye svoistva polinomov i nailuchshee priblizhenie nepreryvnykh funktsii odnoi veshchestvennoi peremennoi [Extremal Properties of Polynomials and the Best Approximation of Continuous Functions of One Real Variable]. Moscow, Leningrad: ONTI NKTP SSSR Publ., 1937. 203 p. (in Russian)
- Borodin P.A. On a condition for a polynomial that is sufficient for its norm to be minimal on a given compactum. Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2006. No. 4. P. 14–18. (in Russian)
- Chebyshev P.L. Theory of the mechanisms known as parallelograms. In: Chebyshev P.L. Collected works. Vol. II. Mathematical analysis. Moscow, Leningrad: Acad. Sci. USSR, 1947. P. 23–51. (in Russian)
- Daugavet I.K. Introduction to the classical theory of approximation of functions. Saint-Petersburg: Saint Petersburg St. Univ. Publ., 2011. 232 p. (in Russian)
- Korneychuk N.P., Babenko V.F., Ligun A.A. Extremal Properties of Polynomials and Splines. Kyiv: Naukova Dumka, 1992. 304 p. (in Russian)
- Lukashov A.L. Inequalities for derivatives of rational functions on several intervals. Izv. Math., 2004. Vol. 68, No. 3. P. 543–565. DOI: 10.1070/IM2004v068n03ABEH000488
- Lukashov A.L., Tyshkevich S.V. Extremal polynomials on arcs of the circle with zeros on these arcs. J. Contemp. Math. Anal., 2009. Vol. 44, No. 3. P. 172–179. DOI: 10.3103/S1068362309030030
- Maergoiz L.S., Rybakova N.N. Chebyshev polynomials with zeros lying on a circular arc. Dokl. Math., 2009. Vol. 79, No. 3. P. 319–321. DOI: 10.1134/S1064562409030053
- Milovanović G.V., Mitrinović D.S., Rassias Th.M. Topics in Polynomials: Extremal Problems, Inequalities, Zeros. Singapore: World Sci. Publ. Co., 1994. 836 p. DOI: 10.1142/9789814360463
- Smirnov V.I., Lebedev N.A. Konstruktivnaya teoriya funktsii kompleksnogo peremennogo [Constructive theory of functions of a complex variable]. Moscow, Leningrad: Nauka Publ., 1964. 327 p. (in Russian)
- Thiran J.-P., Detaille C. Chebyshev Polynomials on Circular Arcs in the Complex Plane. In: Progress in Approximation Theory. P. Nevai, A. Pinkus (eds.). Boston, MA: Academic Press, 1991. P. 771–786.
- Trubnikov Yu.V., Chernyavsky M.M. On a numerical-analytical method for constructing extremal polynomials of a complex argument. Proc. Natl. Acad. Sci. Belarus, Phys. Math. Ser., 2023. Vol. 59, No 1. P. 18–36. DOI: 10.29235/1561-2430-2023-59-1-18-36 (in Russian)
- Tyshkevich S.V. On Chebyshev polynomials on arcs of a circle. Math. Notes, 2007. Vol. 81, No. 6. P. 851–853. DOI: 10.1134/S0001434607050331Â
Article Metrics
Refbacks
- There are currently no refbacks.













