Related papers: Representations of orthogonal polynomials
In this paper we propose a way to construct classical type Sobolev orthogonal polynomials. We consider two families of hypergeometric polynomials: ${}_2 F_2(-n,1;q,r;x)$ and ${}_3 F_2(-n,n-1+a+b,1;a,c;x)$ ($a,b,c,q,r>0$, $n=0,1,...$), which…
The present paper introduces a method of basis transformation of a vector space that is specifically applicable to polynomials space and differential equations with certain polynomials solutions such as Hermite, Laguerre and Legendre…
We show how the continuous Almkvist-Zeilberger algorithm can be used to efficiently discover and prove differential equations satisfied by generating functions of sequences defined as integrals of powers of C-finite polynomial sequences…
A set of recursive relations satisfied by Selberg-type integrals involving monomial symmetric polynomials are derived, generalizing previously known results. These formulas provide a well-defined algorithm for computing Selberg-Schur…
We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…
We consider matrix orthogonal polynomials related to Jacobi type matrices of weights that can be defined in terms of a given matrix Pearson equation. Stating a Riemann-Hilbert problem we can derive first and second order differential…
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…
The Calogero model is a one-dimensional quantum integrable system with inverse-square long-range interactions confined in an external harmonic well. It shares the same algebraic structure with the Sutherland model, which is also a…
Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…
We list the so-called Askey-scheme of hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation and generating functions of all classes of orthogonal…
Sobolev orthogonal polynomials are polynomials orthogonal with respect to a Sobolev inner product, an inner product in which derivatives of the polynomials appear. They satisfy a long recurrence relation that can be represented by a…
A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a…
We consider biorthogonal polynomials that arise in the study of a generalization of two--matrix Hermitian models with two polynomial potentials V_1(x), V_2(y) of any degree, with arbitrary complex coefficients. Finite consecutive…
Recently there has been a renewed interest in an extension of the notion of orthogonal polynomials known as multiple orthogonal polynomials. This notion comes from simultaneous rational approximation (Hermite-Pade approximation) of a system…
We investigate the symmetric Dunkl-classical orthogonal polynomials by using a new approach applied in connection with the Dunkl operator. The main aim of this technique is to determine the recurrence coefficients first and foremost. We…
We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…
Using the technique of the elliptic Frobenius determinant, we construct new elliptic solutions of the $QD$-algorithm. These solutions can be interpreted as elliptic solutions of the discrete-time Toda chain as well. As a by-product, we…
We show that the Catalan-Schroeder convolution recurrences and their higher order generalizations can be solved using Riordan arrays and the Catalan numbers. We investigate the Hankel transforms of many of the recurrence solutions, and…
We present a new algorithm for computing hyperexponential solutions of ordinary linear differential equations with polynomial coefficients. The algorithm relies on interpreting formal series solutions at the singular points as analytic…
We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…