Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation (Q2483053): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Corrigendum: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connection and linearization problems within the Askey scheme and its \(q\)-analogue via inversion formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bessel polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection problems via lowering operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection coefficients between Boas--Buck polynomial sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5330803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable on the lattice \(x(s)=q^{2s}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations for connection coefficients between two families of orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations around classical orthogonal polynomials. Connected problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some connection and linearization problems for polynomials in and beyond the Askey scheme / rank
 
Normal rank

Latest revision as of 21:36, 27 June 2024

scientific article
Language Label Description Also known as
English
Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation
scientific article

    Statements

    Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation (English)
    0 references
    0 references
    0 references
    5 May 2008
    0 references
    The authors consider the problem of obtaining closed-form expressions for the connection coefficients between orthogonal polynomials and the canonical sequence. Let \(\{P_n(x)\}_{n\geq 0}\) denote an orthogonal monic polynomial sequence of degree \(n\) that satisfies the following recurrence relation of order 2 \[ P_{n+2}(x)=(x-\beta_{n+1})P_{n+1}(x)-\gamma_{n+1}P_n(x),\quad n\geq 0, \] with \(P_0(x)=1\) and \(P_1(x)=x-\beta_0\); let \(\{{\widetilde P}_n(x)\}_{n\geq 0}\) denote a similar sequence with coefficients \(\widetilde{\beta}_n\) and \(\widetilde{\gamma}_{n+1}\). Then the coefficients \(\lambda_{n,m}\) in the relation \[ P_n(x)=\sum_{m=0}^n \lambda_{n,m}{\widetilde P}_m(x), \qquad n\geq 0 \] are called the connection coefficients \(\lambda_{n,m}=\lambda_{n,m}(P\leftarrow{\widetilde P})\). Using the orthogonality properties of the polynomial sequences, the authors obtain a recurrence relation satisfied by the \(\lambda_{n,m}\). The procedure employed then consists of generating the coefficients for \(n\leq n_0\), where \(n_0\) is a fixed integer, with the aid of the symbolic package Mathematica. Using some special commands in Mathematica, they simplify these expressions into a form that enables them conjecture the exact analytical expressions for the \(\lambda_{n,m}\). This conjectured form is subsequently inserted into the recurrence relation to verify its correctness. The authors carry out this procedure for the Gegenbauer and Jacobi polynomials. For the Jacobi polynomials \(P_n(\alpha,\beta;x)\), the connection coefficients are obtained for the cases \(P_n(\alpha,\beta;x)\leftarrow P_n({\widetilde \alpha},\beta;x)\) and \(P_n(\alpha,\beta;x)\leftarrow P_n(\alpha,{\widetilde\beta};x)\), and in the more complicated case of the change of two parameters \(P_n(\alpha,\beta;x)\leftarrow P_n({\widetilde \alpha},{\widetilde \beta};x)\).
    0 references
    connection coefficients
    0 references
    orthogonal polynomials
    0 references
    symbolic computation
    0 references

    Identifiers