Connection coefficients for orthogonal polynomials: Symbolic computations, verifications and demonstrations in the Mathematica language
DOI10.1007/S11075-012-9634-2zbMATH Open1296.68201OpenAlexW2008987582MaRDI QIDQ2391883FDOQ2391883
Publication date: 5 August 2013
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-012-9634-2
Recommendations
- Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation
- scientific article; zbMATH DE number 1453130
- Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case
- scientific article; zbMATH DE number 953166
- scientific article; zbMATH DE number 1304200
orthogonal polynomialsconnection coefficientssymbolic computationsautomatic demonstrationsMathematica\(^{\circledR}\) Version 8
Symbolic computation and algebraic computation (68W30) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Basic orthogonal polynomials and functions (Askey-Wilson polynomials, etc.) (33D45) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)
Cites Work
- Title not available (Why is that?)
- Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case
- Representations of orthogonal polynomials
- Inversion problems in the \(q\)-Hahn tableau
- Variations around classical orthogonal polynomials. Connected problems
- Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation
- Quick construction of recurrence relations for the Jacobi coefficients
- Symmetric laguerre-hahn forms of classs=1
- Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable
- Recurrence relations for connection coefficients between two families of orthogonal polynomials
- On linearization and connection coefficients for generalized Hermite polynomials
- Corrigendum: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
- Expansion of multivariate polynomials in products of univariate orthogonal polynomials: Discrete case
- An example of nonsymmetric semi-classical form of class \(s=1\); generalization of a case of Jacobi sequence
Cited In (11)
- Symbolic approach to the general quadratic polynomial decomposition
- Recurrence relations for the connection coefficients of classical orthogonal polynomials
- Connection and inversion coefficients for basic hypergeometric polynomials
- The spectral connection matrix for any change of basis within the classical real orthogonal polynomials
- Basic theory of finite-type relations between orthogonal polynomial sequences
- A general theorem on inversion problems for polynomial sets
- The spectral connection matrix for classical orthogonal polynomials of a single parameter
- Fast structured Jacobi-Jacobi transforms
- Inverse connection formulae for generalised Bessel polynomials
- Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation
- On connection coefficients of some perturbed of arbitrary order of the Chebyshev polynomials of second kind
Uses Software
This page was built for publication: Connection coefficients for orthogonal polynomials: Symbolic computations, verifications and demonstrations in the Mathematica language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391883)