Approximation of discrete functions and Chebyshev polynomials orthogonal on the uniform grid

Let _N+2m ={−m, −m+1, …, −1, 0, 1, …,N−1,N, …,N−1+m}. The present paper is devoted to the approximation of discrete functions of the formf : _N+2m → ℝ by algebraic polynomials on the grid Ω _N ={0, 1, …,N−1}. On the basis of two systems of Chebyshev polynomials orthogonal on the sets Ω _N+m and Ω _N , respectively, we construct a linear operatorY _{n+2m, N} =Y _{n+2m, N} (f), acting in the space of discrete functions as an algebraic polynomial of degree at mostn+2m for which the following estimate holds (x ε Ω _N ):

Ratio Asymptotics for Orthogonal Matrix Polynomials

Ratio asymptotic results give the asymptotic behaviour of the ratio between two consecutive orthogonal polynomials with respect to a positive measure. In this paper, we obtain ratio asymptotic results for orthogonal matrix polynomials and introduce the matrix analogs of the scalar Chebyshev polynomials of the second kind.     

Modified Moments and Matrix Orthogonal Polynomials

In the scalar case, computation of recurrence coefficients of polynomials orthogonal with respect to a nonnegative measure is done via the modified Chebyshev algorithm. Using the concept of matrix biorthogonality, we extend this algorithm to the vector case.     

Restricted 132-Alternating Permutations and Chebyshev Polynomials

A permutation is said to be alternating if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on n letters that avoid or contain exactly once 132 and also avoid or contain exactly once an arbitrary pattern on k letters. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.AMS Subject Classification: 05A05, 05A15, 30B70, 42C05.     

Discrete Entropies of Orthogonal Polynomials

Given a nontrivial Borel measure on ℝ, let p _n be the corresponding orthonormal polynomial of degree n whose zeros are λ _j ⁽ⁿ⁾, j=1,…,n. Then for each j=1,…,n,

The Christoffel Function for Orthogonal Polynomials on a Circular Arc

For the special type of weight functions on circular arc we study the asymptotic behavior of the Christoffel kernel off the arc and of the Christoffel function inside the arc. We prove Totik's conjecture for the Christoffel function corresponding to such weight functions.     

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

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

The Minimality Properties of Chebyshev Polynomials and Their Lacunary Series

By considering four kinds of Chebyshev polynomials, an extended set of (real) results are given for Chebyshev polynomial minimality in suitably weighted Hölder norms on [–1,1], as well as (L ) minimax properties, and best L ₁ sufficiency requirements based on Chebyshev interpolation. Finally we establish best L _p , L and L ₁ approximation by partial sums of lacunary Chebyshev series of the form _i=0 a ⁱ _b ⁱ(x) where _n (x) is a Chebyshev polynomial and b is an odd integer 3. A complete set of proofs is provided.     

一类多元加权最小乖正交多项式

This paper introduces a new notion of weighted least-square orthogonal polynomials in multivariables from the triangular form. Their existence and uniqueness is studied and some methods for their recursive computation are given. As an application, this paper constructs a new family of Pade-type approximates in multi-variables from the triangular form.     

三对角行列式与Chebyshev多项式

给出了三对角行列式的几种算法,利用三对角行列式证明了两类Chebyshev多项式的几种显式.     

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.     

Continuous and Discrete Tight Frames of Orthogonal Polynomials for a Radially Symmetric Weight

This paper considers tight frame decompositions of the Hilbert space ℘ _n of orthogonal polynomials of degree n for a radially symmetric weight on ℝ ^d , e.g., the multivariate Gegenbauer and Hermite polynomials. We explicitly construct a single zonal polynomial p∈℘ _n with the property that each f∈℘ _n can be reconstructed as a sum of its projections onto the orbit of p under SO(d) (symmetries of the weight), and hence of its projections onto the zonal polynomials p _ξ obtained from p by moving its pole to ξ∈S:={ξ∈ℝ ^d :|ξ|=1}. Furthermore, discrete versions of these integral decompositions also hold where SO(d) is replaced by a suitable finite subgroup, and S by a suitable finite subset. One consequence of our decomposition is a simple closed form for the reproducing kernel for ℘ _n .      

Zeros of Gegenbauer-Sobolev Orthogonal Polynomials: Beyond Coherent Pairs

Iserles et al. (J. Approx. Theory 65:151–175, 1991) introduced the concepts of coherent pairs and symmetrically coherent pairs of measures with the aim of obtaining Sobolev inner products with their respective orthogonal polynomials satisfying a particular type of recurrence relation. Groenevelt (J. Approx. Theory 114:115–140, 2002) considered the special Gegenbauer-Sobolev inner products, covering all possible types of coherent pairs, and proves certain interlacing properties of the zeros of the associated orthogonal polynomials. In this paper we extend the results of Groenevelt, when the pair of measures in the Gegenbauer-Sobolev inner product no longer form a coherent pair. This research is supported by grants from CNPq and FAPESP.     

WKB Approximation and Krall-Type Orthogonal Polynomials

We give a unified approach to the Krall-type polynomials orthogonal withrespect to a positive measure consisting of an absolutely continuous oneperturbed by the addition of one or more Dirac deltafunctions. Some examples studied by different authors are considered from aunique point of view. Also some properties of the Krall-type polynomials arestudied. The three-term recurrence relation is calculated explicitly, aswell as some asymptotic formulas. With special emphasis will be consideredthe second order differential equations that such polynomials satisfy. Theyallow us to obtain the central moments and the WKB approximation of thedistribution of zeros. Some examples coming from quadratic polynomialmappings and tridiagonal periodic matrices are also studied.     

Adaptive Bivariate Chebyshev Approximation

We propose an adaptive algorithm which extends Chebyshev series approximation to bivariate functions, on domains which are smooth transformations of a square. The method is tested on functions with different degrees of regularity and on domains with various geometries. We show also an application to the fast evaluation of linear and nonlinear bivariate integral transforms.     

Adaptive bivariate Chebyshev approximation

We propose an adaptive algorithm which extends Chebyshev series approximation to bivariate functions, on domains which are smooth transformations of a square. The method is tested on functions with different degrees of regularity and on domains with various geometries. We show also an application to the fast evaluation of linear and nonlinear bivariate integral transforms. Work supported by the research project CPDA028291 “Efficient approximation methods for nonlocal discrete transforms” of the University of Padova, and by the GNCS-INdAM.     

Recurrence Relations for the Coefficients in Series Expansions with Respect to Semi-Classical Orthogonal Polynomials

Let {P _k } be a sequence of the semi-classical orthogonal polynomials. Given a function f satisfying a linear second-order differential equation with polynomial coefficients, we describe an algorithm to construct a recurrence relation satisfied by the coefficients a _k [f] in f= _k a _k [f]P _k . A systematic use of basic properties (including some nonstandard ones) of the polynomials {P _k } results in obtaining a recurrence of possibly low order. Recurrences for connection or linearization coefficients related to the first associated generalized Gegenbauer, Bessel-type and Laguerre-type polynomials are given explicitly.     

基于两类切比雪夫多项式的循环矩阵行列式的计算

利用多项式因式分解的逆变换,结合循环矩阵和切比雪夫多项式的特殊结构,首先研究第三类和第四类切比雪夫多项式的通项公式,并给出第三类、第四类切比雪夫多项式的关于行首加r尾r右循环矩阵和行尾加r首r左循环矩阵的行列式的显式表达式,最后给出算法实施步骤.     

Asymptotics and Zeros of Sobolev Orthogonal Polynomials on Unbounded Supports

In this paper we present a survey about analytic properties of polynomials orthogonal with respect to a weighted Sobolev inner product such that the vector of measures has an unbounded support. In particular, we focus on the asymptotic behaviour of such polynomials as well as in the distribution of their zeros. Some open problems as well as some directions for future research are formulated.Research of Juan José Moreno Balcázar was partially supported by Ministerio de Educación y Ciencia of Spain under grant MTM2005-08648-C02-01 and Junta de Andalucía (FQM 229 and FQM 481).     

向量正交多项式的行列式表示

本文指出了代数Ｈｅｒｍｉｔｅ－Ｐａｄｅ逼近与向量正交多项式的关系，构造了计算向量正交多项式的行列式表示，并通过具体算例验证了它的正确性．