Factorizations and representations of binary polynomial recurrences by matrix methods (Q635275)

From MaRDI portal
Revision as of 15:15, 27 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q114060145, #quickstatements; #temporary_batch_1706364719135)
scientific article
Language Label Description Also known as
English
Factorizations and representations of binary polynomial recurrences by matrix methods
scientific article

    Statements

    Factorizations and representations of binary polynomial recurrences by matrix methods (English)
    0 references
    0 references
    0 references
    19 August 2011
    0 references
    As a generalization of second order recurrence sequences, the authors define the polynomials \[ A_{n+1}(x)=p(x)A_n(x)+q(x)A_{n-1}(x), \] with initial conditions \(A_0(x)=a(x)\) and \(A_1(x)=b(x)\), where \(a,b,p,q\) are given real polynomials. Recurrences, tridiagonal determinantal matrix representations and factorizations are given.
    0 references
    0 references
    second order recurrences
    0 references
    tridiagonal matrices
    0 references
    factorization
    0 references
    Chebyshev polynomials
    0 references
    matrix methods
    0 references

    Identifiers