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.

     

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

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

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

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

Chebyshev polynomials for operators

The problem of uniqueness of the Chebyshev polynomials for bounded linear operators on normed linear spaces is investigated. Herrn Professor Dr. Dr. h.c. Heinz K?nig zu seinem achtzigsten Geburtstag gewidmet     

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.     

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 modified Chebyshev polynomials

Two elegant representations are derived for the modified Chebyshev polynomials discussed by Witula and Slota [R. Witula, D. Slota, On modified Chebyshev polynomials, J. Math. Anal. Appl. 324 (2006) 321-343].     

Generalization of Chebyshev polynomials

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

Restricted even permutations and Chebyshev polynomials

We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.     

Restricted colored permutations and Chebyshev polynomials

Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for colored permutations. First we define a distinguished set of length two and length three patterns, which contains only 312 when just one color is used. Then we give a recursive procedure for computing the generating function for the colored permutations which avoid this distinguished set and any set of additional patterns, which we use to find a new set of signed permutations counted by the Catalan numbers and a new set of signed permutations counted by the large Schröder numbers. We go on to use this result to compute the generating functions for colored permutations which avoid our distinguished set and any layered permutation with three or fewer layers. We express these generating functions in terms of Chebyshev polynomials of the second kind and we show that they are special cases of generating functions for involutions which avoid 3412 and a layered permutation.     

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 note on Chebyshev polynomials

New families of generating functions and identities concerning the Chebyshev polynomials are derived. It is shown that the proposed method allows the derivation of sum rules involving products of Chebyshev polynomials and addition theorems. The possiblity of extending the results to include gnerating functions involving products of Chebyshev and other polynomials is finally analyzed.

---

Sunto Si derivano nuove famiglie di funzioni generatrici e di identità relative ai polinomi di Chebyshev. Si dimostra che il metodo proposto permette la derivazione di regole di somma relative a prodotti di polinomi di Chebyshev e teoremi di addizione. La possibilità di estendere i risultati includendos funzioni generatrici di prodotti di polinomi di Chebyshev ed altri polinomi è infine analizzata.

     

Chebyshev polynomials on symmetric matrices

In this paper we evaluate Chebyshev polynomials of the second kind on a class of symmetric integer matrices, namely on adjacency matrices of simply laced Dynkin and extended Dynkin diagrams. As an application of these results we explicitly calculate minimal projective resolutions of simple modules of symmetric algebras with radical cube zero that are of finite and tame representation type.     

Computations with half-range Chebyshev polynomials

An efficient construction of two non-classical families of orthogonal polynomials is presented in the paper. The so-called half-range Chebyshev polynomials of the first and second kinds were first introduced by Huybrechs in Huybrechs (2010) [5]. Some properties of these polynomials are also shown. Every integrable function can be represented as an infinite series of sines and cosines of these polynomials, the so-called half-range Chebyshev-Fourier (HCF) series. The second part of the paper is devoted to the efficient computation of derivatives and multiplication of the truncated HCF series, where two matrices are constructed for this purpose: the differentiation and the multiplication matrix.     

Numerical constructions involving Chebyshev polynomials

We propose a new algorithm for the character expansion of tensor products of finite-dimensional irreducible representations of simple Lie algebras. The algorithm produces valid results for the algebras B ₃, C ₃, and D ₃. We use the direct correspondence between Weyl anti-invariant functions and multivariate second-kind Chebyshev polynomials. We construct the triangular trigonometric polynomials for the algebra D ₃.     

Gaussian quadrature of Chebyshev polynomials

We investigate the behaviour of the maximum error in applying Gaussian quadrature to the Chebyshev polynomials T_m. This quantity has applications in determining error bounds for Gaussian quadrature of analytic functions.