Variable-precision recurrence coefficients for nonstandard orthogonal polynomials

Inequalities recently conjectured for all zeros of Jacobi polynomials of all degrees n are modified and conjectured to hold (in reverse direction) in considerably larger domains of the (α,β)-plane.      

Nonlinear equations for the recurrence coefficients of discrete orthogonal polynomials

We study polynomials orthogonal on a uniform grid. We show that each weight function gives two potentials and each potential leads to a structure relation (lowering operator). These results are applied to derive second order difference equations satisfied by the orthogonal polynomials and nonlinear difference equations satisfied by the recursion coefficients in the three-term recurrence relations.     

A semiclassical perspective on multivariate orthogonal polynomials

Differential properties for orthogonal polynomials in several variables are studied. We consider multivariate orthogonal polynomials whose gradients satisfy some quasi-orthogonality conditions. We obtain several characterizations for these polynomials including the analogues of the semiclassical Pearson differential equation, the structure relation and a differential-difference equation.     

Asymptotics for orthogonal polynomials defined by a recurrence relation

Asymptotic expansions are given for orthogonal polynomials when the coefficients in the three-term recursion formula generating the orthogonal polynomials form sequences of bounded variation.     

On the limit behavior of recurrence coefficients for multiple orthogonal polynomials

In this paper we investigate general properties of the coefficients in the recurrence relation satisfied by multiple orthogonal polynomials. The results include as particular cases Angelesco and Nikishin systems.     

Rodrigues formula and recurrence coefficients for non-symmetric Dunkl-classical orthogonal polynomials

The Ramanujan Journal - In this paper, we establish a distributional Rodrigues formula for non-symmetric Dunkl-classical orthogonal polynomial sequences. Then, we use this formula to determine,...     

Varying weights for orthogonal polynomials with monotonically varying recurrence coefficients

We consider orthogonal polynomials , where n is the degree of the polynomial and N is a discrete parameter. These polynomials are orthogonal with respect to a varying weight W_N which depends on the parameter N and they satisfy a recurrence relation with varying recurrence coefficients which we assume to be varying monotonically as N tends to infinity. We establish the existence of the limit and link this limit to an external field for an equilibrium problem in logarithmic potential theory.     

Amortized multi-point evaluation of multivariate polynomials

The evaluation of a polynomial at several points is called the problem of multi-point evaluation. Sometimes, the set of evaluation points is fixed and several polynomials need to be evaluated at this set of points. Several efficient algorithms for this kind of “amortized” multi-point evaluation have been developed recently for the special cases of bivariate polynomials or when the set of evaluation points is generic. In this paper, we extend these results to the evaluation of polynomials in an arbitrary number of variables at an arbitrary set of points. We prove a softly linear complexity bound when the number of variables is fixed. Our method relies on a novel quasi-reduction algorithm for multivariate polynomials, that operates simultaneously with respect to several orderings on the monomials.     

Formulas for recurrence coefficients of orthogonal polynomials related to Lorentzian-like weights

One considers the recurrence relation of orthogonal polynomials related to weights |t|^A(1+t^2r/c^2r)^-B on the whole real line, for various integer exponents 2r, and real A>-1, B>0.     

Toda-type differential equations for the recurrence coefficients of orthogonal polynomials and Freud transformation

Transformations of the measure of orthogonality for orthogonal polynomials, namely Freud transformations, are considered. Jacobi matrix of the recurrence coefficients of orthogonal polynomials possesses an isospectral deformation under these transformations. Dynamics of the coefficients are described by generalized Toda equations. The classical Toda lattice equations are the simplest special case of dynamics of the coefficients under the Freud transformation of the measure of orthogonality. Also dynamics of Hankel determinants, its minors and other notions corresponding to the orthogonal polynomials are studied.     

Absolutely continuous measures for systems of orthogonal polynomials with unbounded recurrence coefficients

This paper considers systems of orthogonal polynomials which satisfy a three-term recurrence relation in which the recursion coefficients are unbounded. Conditions are imposed on the coefficient sequences to establish that the corresponding measure of orthogonality is absolutely continuous.     

Orthogonality measures for orthogonal matrix polynomials with periodic coefficients of recurrence relations

Mathematical Notes -     

A unified approach to evaluation algorithms for multivariate polynomials

We present a unified framework for most of the known and a few new evaluation algorithms for multivariate polynomials expressed in a wide variety of bases including the Bernstein-Bézier, multinomial (or Taylor), Lagrange and Newton bases. This unification is achieved by considering evaluation algorithms for multivariate polynomials expressed in terms of L-bases, a class of bases that include the Bernstein-Bézier, multinomial, and a rich subclass of Lagrange and Newton bases. All of the known evaluation algorithms can be generated either by considering up recursive evaluation algorithms for L-bases or by examining change of basis algorithms for L-bases. For polynomials of degree in variables, the class of up recursive evaluation algorithms includes a parallel up recurrence algorithm with computational complexity , a nested multiplication algorithm with computational complexity and a ladder recurrence algorithm with computational complexity . These algorithms also generate a new generalization of the Aitken-Neville algorithm for evaluation of multivariate polynomials expressed in terms of Lagrange L-bases. The second class of algorithms, based on certain change of basis algorithms between L-bases, include a nested multiplication algorithm with computational complexity , a divided difference algorithm, a forward difference algorithm, and a Lagrange evaluation algorithm with computational complexities , and per point respectively for the evaluation of multivariate polynomials at several points.

     

Spectral measures corresponding to orthogonal polynomials with unbounded recurrence coefficients

Sufficient conditions are presented for the existence of an absolutely continuous part for the measure of orthogonality for a system of polynomials with unbounded recurrence coefficients. Results are obtained by analyzing the spectral measure of a related self-adjoint operator.Communicated by Paul Nevai.     

On the evaluation of multivariate polynomials and their derivatives

LetH be a polynomial inn>1 variables over the fields of real or complex numbers. An algorithm is presented here for the simultaneous evaluation ofH and its first and second (F-) derivativesH andH, or of any combination ofH,H,H. The evaluations ofH alone or ofH andH together are of the same order inn andd whered is the degree ofH, while the computation ofH,H, andH isd times this order. The process takes account of the sparsity pattern ofH by using a tree structure induced by the nonzero coefficients. It also allows for simultaneous operation with several polynomials with the same sparsity pattern. The data structure for the method is rather simple in nature and can be adapted easily to specific types of polynomials. Several possible implementations and their complexity are discussed.     

The asymptotic behaviour of recurrence coefficients for orthogonal polynomials with varying exponential weights

We consider orthogonal polynomials on the real line with respect to a weight and in particular the asymptotic behaviour of the coefficients a_n,N and b_n,N in the three-term recurrence xπ_n,N(x)=π_n+1,N(x)+b_n,Nπ_n,N(x)+a_n,Nπ_n−1,N(x). For one-cut regular V we show, using the Deift-Zhou method of steepest descent for Riemann-Hilbert problems, that the diagonal recurrence coefficients a_n,n and b_n,n have asymptotic expansions as n→∞ in powers of 1/n² and powers of 1/n, respectively.