Generalizations of Chebyshev polynomials and polynomial mappings

In this paper we show how polynomial mappings of degree from a union of disjoint intervals onto generate a countable number of special cases of generalizations of Chebyshev polynomials. We also derive a new expression for these generalized Chebyshev polynomials for any genus , from which the coefficients of can be found explicitly in terms of the branch points and the recurrence coefficients. We find that this representation is useful for specializing to polynomial mapping cases for small where we will have explicit expressions for the recurrence coefficients in terms of the branch points. We study in detail certain special cases of the polynomials for small degree mappings and prove a theorem concerning the location of the zeroes of the polynomials. We also derive an explicit expression for the discriminant for the genus 1 case of our Chebyshev polynomials that is valid for any configuration of the branch point.

     

On real and complex-valued bivariate Chebyshev polynomials

In the real uniform approximation of the function x^myⁿ by the space of bivariate polynomials of total degree m + n − 1 on the unit square, the product of monic univariate Chebyshev polynomials yields an optimal error. We exploit the fundamental Noether's theorem of algebraic curves theory to give necessary and sufficient conditions for unicity and to describe the set of optimal errors in case of nonuniqueness. Then, we extend these results to the complex approximation on biellipses. It turns out that the product of Chebyshev polynomials also provides an optimal error and that the same kind of uniqueness conditions prevail in the complex case. Yet, when nonuniqueness occurs, the characterization of the set of optimal errors presents peculiarities, compared to the real problem.     

Topological complexity and real roots of polynomials

The topological complexity of an algorithm is the number of its branchings. In the paper we prove that the minimal topological complexity of an algorithm that approximately computes a root of a real polynomial of degreed equalsd/2 for evend, is greater than or equal to 1 for oddd>–3, and equals 1 ford=3 or 5.Translated fromMatematicheskie Zametki, Vol. 60, No. 5, pp. 670–680, November, 1996.This research was supported by the Russian Foundation for Basic Research under grant No. 95-01-00846a and by the INTAS under grant No. 4373.     

Nonlinear recurrences related to Chebyshev polynomials

We use two nonlinear recurrence relations to define the same sequence of polynomials, a sequence resembling the Chebyshev polynomials of the first kind. Among other properties, we obtain results on their irreducibility and zero distribution. We then study the \(2\times 2\) Hankel determinants of these polynomials, which have interesting zero distributions. Furthermore, if these polynomials are split into two halves, then the zeros of one half lie in the interval \((-1,1)\), while those of the other half lie on the unit circle. Some further extensions and generalizations of these results are indicated.     

Resultants and discriminants of Chebyshev and related polynomials

We show that the resultants with respect to of certain linear forms in Chebyshev polynomials with argument are again linear forms in Chebyshev polynomials. Their coefficients and arguments are certain rational functions of the coefficients of the original forms. We apply this to establish several related results involving resultants and discriminants of polynomials, including certain self-reciprocal quadrinomials.

     

Topological entropy of maps on the real line

The aim of this paper is to introduce a definition of topological entropy for continuous maps such that, at least for continuous real maps, it keeps the following general philosophy: positive topological entropy implies that the map has a complicated dynamical behaviour. Besides, we pursue that our definition keeps some properties which are hold by the classic definition of topological entropy introduced for compact sets.     

Bivariate identities related to Chebyshev and Dickson polynomials over Fq

Let ${\mathbb{F}}_q$ be a field of q elements, where q is a power of an odd prime p. The polynomial $f(y)\in {\mathbb{F}}_q[y]$ defined by$f(y):={(1+\sqrt{y})}^{(q+1)/2}+{(1-\sqrt{y})}^{(q+1)/2}$ has the property that$f(1-y)=\rho (2)f(y),$ where ρ is the quadratic character on ${\mathbb{F}}_q$. This univariate identity was applied to prove a recent theorem of N. Katz. We formulate and prove a bivariate extension, and give an application to quadratic residuacity.     

Invariants and Chebyshev polynomials

On different compact sets from ℝ ⁿ , new multidimensional analogs of algebraic polynomials least deviating from zero (Chebyshev polynomials) are constructed. A brief review of the analogs constructed earlier is given. Estimates of values of the best approximation obtained by using extremal signatures, lattices, and finite groups are presented.     

Invariants and Chebyshev polynomials

On different compact sets from ? ⁿ , new multidimensional analogs of algebraic polynomials least deviating from zero (Chebyshev polynomials) are constructed. A brief review of the analogs constructed earlier is given. Estimates of values of the best approximation obtained by using extremal signatures, lattices, and finite groups are presented.     

Symmetrized Chebyshev polynomials

We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves alternate) result that their coefficients are non-negative. As a corollary we find that and are positive definite functions. We further show that a Central Limit Theorem holds for the coefficients of our polynomials.

     

Topological entropy of quadratic polynomials and dimension of sections of the Mandelbrot set

A fundamental theme in holomorphic dynamics is that the local geometry of parameter space (e.g. the Mandelbrot set) near a parameter reflects the geometry of the Julia set, hence ultimately the dynamical properties, of the corresponding dynamical system. We establish a new instance of this phenomenon in terms of entropy.     

勒让德多项式的性质与契贝谢夫多项式间的关系

主要讨论了著名的勒让德多项式的一些性质,同时得到勒让德多项式与契贝谢夫多项式之间的一些关系     

关于勒让德多项式与契贝谢夫多项式间的关系

主要研究勒让德多项式与契贝谢夫多项式之间的关系的性质,利用生成函数和函数级数展开的方法,得出了勒让德多项式与契贝谢夫多项式之间的一个重要关系,这对勒让德多项式与契贝谢夫多项式的研究有一定的推动作用．     

Generalization of Chebyshev polynomials

Moscow. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 31, No. 1, pp. 217–218, January–February, 1990.     

On modified Chebyshev polynomials

In this paper some new properties and applications of modified Chebyshev polynomials and Morgan-Voyce polynomials will be presented. The aim of the paper is to complete the knowledge about all of these types of polynomials.     

Optimization via Chebyshev polynomials

This paper presents for the first time a robust exact line-search method based on a full pseudospectral (PS) numerical scheme employing orthogonal polynomials. The proposed method takes on an adaptive search procedure and combines the superior accuracy of Chebyshev PS approximations with the high-order approximations obtained through Chebyshev PS differentiation matrices. In addition, the method exhibits quadratic convergence rate by enforcing an adaptive Newton search iterative scheme. A rigorous error analysis of the proposed method is presented along with a detailed set of pseudocodes for the established computational algorithms. Several numerical experiments are conducted on one- and multi-dimensional optimization test problems to illustrate the advantages of the proposed strategy.