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.     

On connection coefficients of some perturbed of arbitrary order of the Chebyshev polynomials of second kind

Orthogonal polynomials satisfy a recurrence relation of order two defined by two sequences of coefficients. If we modify one of these recurrence coefficients at a certain order, we obtain the so-called perturbed orthogonal sequence. In this work, we analyse perturbed Chebyshev polynomials of second kind and we deal with the problem of finding the connection coefficients that allow us to write the perturbed sequence in terms of the original one and in terms of the canonical basis. From the connection coefficients obtained, we derive some results about zeros at the origin. The analysis is valid for arbitrary order of perturbation.     

The number of certain integral polynomials and nonrecursive sets of integers, Part 1

Given 2$">, we establish a good upper bound for the number of multivariate polynomials (with as many variables and with as large degree as we wish) with integer coefficients mapping the ``cube' with real coordinates from into . This directly translates to a nice statement in logic (more specifically recursion theory) with a corresponding phase transition case of 2 being open. We think this situation will be of real interest to logicians. Other related questions are also considered. In most of these problems our main idea is to write the multivariate polynomials as a linear combination of products of scaled Chebyshev polynomials of one variable.

     

Multivariate Markov polynomial inequalities and Chebyshev nodes

This article considers the extension of V.A. Markov's theorem for polynomial derivatives to polynomials with unit bound on the closed unit ball of any real normed linear space. We show that this extension is equivalent to an inequality for certain directional derivatives of polynomials in two variables that have unit bound on the Chebyshev nodes. We obtain a sharpening of the Markov inequality for polynomials whose values at specific points have absolute value less than one. We also obtain an interpolation formula for polynomials in two variables where the interpolation points are Chebyshev nodes.     

Monic integer Chebyshev problem

We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let denote the monic polynomials of degree with integer coefficients. A monic integer Chebyshev polynomial satisfies

and the monic integer Chebyshev constant is then defined by

This is the obvious analogue of the more usual integer Chebyshev constant that has been much studied.

We compute for various sets, including all finite sets of rationals, and make the following conjecture, which we prove in many cases.

Conjecture. Suppose is an interval whose endpoints are consecutive Farey fractions. This is characterized by Then

This should be contrasted with the nonmonic integer Chebyshev constant case, where the only intervals for which the constant is exactly computed are intervals of length 4 or greater.

     

The Chebyshev Hyperplane Optimization Problem

We consider the following problem. Given a finite set of pointsy ^j in we want to determine a hyperplane H such that the maximum Euclidean distance betweenH and the pointsy ^j is minimized. This problem(CHOP) is a non-convex optimization problem with a special structure. Forexample, all local minima can be shown to be strongly unique. We present agenericity analysis of the problem. Two different global optimizationapproaches are considered for solving (CHOP). The first is a Lipschitzoptimization method; the other a cutting plane method for concaveoptimization. The local structure of the problem is elucidated by analysingthe relation between (CHOP) and certain associated linear optimizationproblems. We report on numerical experiments.     

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

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

Chebyshev rational interpolation

The Lanczos method and its variants can be used to solve efficiently the rational interpolation problem. In this paper we present a suitable fast modification of a general look-ahead version of the Lanczos process in order to deal with polynomials expressed in the Chebyshev orthogonal basis. The proposed approach is particularly suited for approximating analytic functions by means of rational interpolation at certain nodes located on the boundary of an elliptical region of the complex plane. In fact, in this case it overcomes some of the numerical difficulties which limited the applicability of the look-ahead Lanczos process for determining the coefficients both of the numerators and of the denominators with respect to the standard power basis. This revised version was published online in August 2006 with corrections to the Cover Date.     

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.

     

Some new Chebyshev spaces

In this note we see another circumstance where Chebyshev polynomials play a significant role. In particular, we present some new extended Chebyshev spaces that arise in the asymptotic stability of the zero solution of first order linear delay differential equations with m commensurate delays where a_j,j=0,…,m, are constants and τ>0 is constant.     

Algorithms for the integration and derivation of Chebyshev series

General formulas for the mth integral and derivative of a Chebyshev polynomial of the first or second kind are presented. The result is expressed as a finite series of the same kind of Chebyshev polynomials. These formulas permit to accelerate the determination of such integrals or derivatives. Besides, it is presented formulas for the mth integral and derivative of finite Chebyshev series and a numerical algorithm for the direct evaluation of the mth derivative of such a series.     

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.

     

Cardano's formula, square roots, Chebyshev polynomials and radicals

This paper is focused on the adaptation of Cardano's approach to generating the roots of rescaled Vieta-Lucas polynomials and Vieta-Fibonacci functions. The application of the derived equations to generating radical-type identities is also presented.     

Integer valued polynomials and Lubin-Tate formal groups

If R is an integral domain and K is its field of fractions, we let Int(R) stand for the subring of K[x] which maps R into itself. We show that if R is the ring of integers of a p-adic field, then Int(R) is generated, as an R-algebra, by the coefficients of the endomorphisms of any Lubin-Tate group attached to R.     

A Superconsistent Chebyshev Collocation Method for Second-Order Differential Operators

A standard way to approximate the model problem –u =f, with u(±1)=0, is to collocate the differential equation at the zeros of T _n : x _i , i=1,...,n–1, having denoted by T _n the nth Chebyshev polynomial. We introduce an alternative set of collocation nodes z _i , i=1,...,n–1, which will provide better numerical performances. The approximated solution is still computed at the nodes {x _i }, but the equation is required to be satisfied at the new nodes {z _i }, which are determined by asking an extra degree of consistency in the discretization of the differential operator.     

Numerical solution of time-varying delay systems by Chebyshev wavelets

The solution of time-varying delay systems is obtained by using Chebyshev wavelets. The properties of the Chebyshev wavelets consisting of wavelets and Chebyshev polynomials are presented. The method is based upon expanding various time functions in the system as their truncated Chebyshev wavelets. The operational matrix of delay is introduced. The operational matrices of integration and delay are utilized to reduce the solution of time-varying delay systems to the solution of algebraic equations. Illustrative examples are included to demonstrate the validity and applicability of the technique.     

一类含有切比雪夫多项式的行列式的计算

研究了一类由切比雪夫多项式组成的特殊行列式Dn(m,k,x)的计算问题,给出了一个有趣的计算公式。     

Matrix Chebyshev polynomials and continued fractions

In the first part we expose the notion of continued fractions in the matrix case. In this paper we are interested in their connection with matrix orthogonal polynomials.

In the second part matrix continued fractions are used to develop the notion of matrix Chebyshev polynomials. In the case of hermitian coefficients in the recurrence formula, we give the explicit formula for the Stieltjes transform, the support of the orthogonality measure and its density. As a corollary we get the extension of the matrix version of the Blumenthal theorem proved in [J. Approx. Theory 84 (1) (1996) 96].

The third part contains examples of matrix orthogonal polynomials.     

A new Chebyshev polynomial approximation for solving delay differential equations

The purpose of this study is to give a Chebyshev polynomial approximation for the solution of mth-order linear delay differential equations with variable coefficients under the mixed conditions. For this purpose, a new Chebyshev collocation method is introduced. This method is based on taking the truncated Chebyshev expansion of the function in the delay differential equations. Hence, the resulting matrix equation can be solved, and the unknown Chebyshev coefficients can be found approximately. In addition, examples that illustrate the pertinent features of the method are presented, and the results of this investigation are discussed.