On Complex (non analytic) Chebyshev Polynomials in 2

Abstract

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in 2 by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization problem on an interval. In a sense, the corresponding extremal polynomials are uniform counterparts of the classical orthogonal Jacobi polynomials. They can be represented by means of special conformal mappings on the so-called comb-like domains. In these terms, the value of the minimal deviation and the representation for a polynomial of best approximation for the original problem are given. Furthermore, we derive asymptotics for the minimal deviation.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…