Factorizations and representations of binary polynomial recurrences by matrix methods (Q635275): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 01:49, 5 March 2024

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
    0 references
    0 references
    0 references
    second order recurrences
    0 references
    tridiagonal matrices
    0 references
    factorization
    0 references
    Chebyshev polynomials
    0 references
    matrix methods
    0 references
    0 references
    0 references