Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
Given two families of orthogonal polynomials \(\{P_n\}\) and \(\{Q_m\}\), the connection coefficients between these families are defined as the numbers \(\{C_m(n)\}\) in the relation \[ P_n(x)= \sum^n_{m= 0} C_m(n)Q_m(x). \] For certain families of classical discrete orthogonal polynomials (Charlier, Meixner, Kravchuk, Hahn), the authors present (minimal) recurrence relations for the computation of these connection coefficients. Several examples are considered in some detail, and possible extensions of the method are pointed out.
- Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case
- scientific article; zbMATH DE number 953166
- Corrigendum: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
- Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable
- Recurrence relations for the connection coefficients of classical orthogonal polynomials
- Recurrence relation approach for expansion and connection coefficients in series of classical discrete orthogonal polynomials
- Recurrences and explicit formulae for the expansion and connection coefficients in series of classical discrete orthogonal polynomials
- Recurrence relations for the coefficients of expansions in classical orthogonal polynomials of a discrete variable
- Recurrence relations for connection coefficients between two families of orthogonal polynomials
- scientific article; zbMATH DE number 757839
- A distributional study of discrete classical orthogonal polynomials
- Discrete semi-classical orthogonal polynominals
- Fourth-order differential equations satisfied by the generalized co- recursive of all classical orthogonal polynomials. A study of their distribution of zeros
- scientific article; zbMATH DE number 3942163 (Why is no real title available?)
- scientific article; zbMATH DE number 48956 (Why is no real title available?)
- scientific article; zbMATH DE number 3482903 (Why is no real title available?)
- scientific article; zbMATH DE number 3605240 (Why is no real title available?)
- Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case
- Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
- Prolégomènes à l'étude des polynômes orthogonaux semi- classiques. (Preliminary remarks for the study of semi-classical orthogonal polynomials)
- Recurrence relations for connection coefficients between two families of orthogonal polynomials
- Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable
- Results for some inversion problems for classical continuous and discrete orthogonal polynomials
- Corrigendum: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
- On the limit relations between classical continuous and discrete orthogonal polynomials
- Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable on the lattice \(x(s)=q^{2s}\)
- Transverse limits in the Askey tableau
- Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case
- Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
- Modified Clebsch-Gordan-type expansions for products of discrete hypergeometric polynomials
- Classical orthogonal polynomials: Dependence of parameters
- A combinatorial interpretation of the connection constants for persistent sequences of polynomials
- On the extended connection coefficients between two orthogonal polynomial sequences
- Recurrence relations for connection coefficients betweenQ-orthogonal polynomials of discrete variables in the non-uniform lattice
- Recurrence relations for the connection coefficients of classical orthogonal polynomials
- scientific article; zbMATH DE number 953166 (Why is no real title available?)
- On the connection and linearization problem for discrete hypergeometric \(q\)-polynomials
- Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable
- On linearization and connection coefficients for generalized Hermite polynomials
- A recurrence relation for generalised connection coefficients
This page was built for publication: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379701)