Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case
DOI10.1016/S0377-0427(97)00137-4zbMath0909.65008OpenAlexW4206159550MaRDI QIDQ1372090
A. Zarzo, André Ronveaux, Eduardo Paciência Godoy, IvÁn Area
Publication date: 22 March 1999
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(97)00137-4
algorithmorthogonal polynomialslinearizationconnection coefficientsconnection problemminimal recurrence relations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (41)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Bessel polynomials
- Prolégomènes à l'étude des polynômes orthogonaux semi- classiques. (Preliminary remarks for the study of semi-classical orthogonal polynomials)
- Corrigendum: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
- Quick construction of recurrence relations for the Jacobi coefficients
- Classical orthogonal polynomials: A functional approach
- Spectral properties of solutions of hypergeometric-type differential equations
- The three-term recurrence relation and the differentiation formulas for hypergeometric-type functions
- Problems in algebraic combinatorics
- Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
- Fourth-order differential equations satisfied by the generalized co- recursive of all classical orthogonal polynomials. A study of their distribution of zeros
- Recurrence relations for connection coefficients between two families of orthogonal polynomials
- The special functions and their approximations. Vol. I, II
- Generalized linearization problems
- Connection Coefficients of Orthogonal Polynomials
- Recurrence relations for connection coefficients betweenQ-orthogonal polynomials of discrete variables in the non-uniform lattice
- ON A CHARACTERIZATION OF MEIXNER'S POLYNOMIALS
This page was built for publication: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case