pith. sign in

arxiv: 1002.2060 · v1 · submitted 2010-02-10 · 🧮 math.CA · math.CV

On Complex (non analytic) Chebyshev Polynomials in bbC²

classification 🧮 math.CA math.CV
keywords polynomialsproblemapproximationbestcomplexdeviationminimaluniform
0
0 comments X
read the original abstract

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.