Differential equation and recursive formulas of Sheffer polynomial sequences (Q410654): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58689461, #quickstatements; #temporary_batch_1707303357582
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.5402/2011/476462 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088650450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A selected survey of umbral calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential equation of Appell polynomials via the factorization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Pascal functional matrix and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5192503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Bernoulli Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239067 / rank
 
Normal rank

Latest revision as of 01:45, 5 July 2024

scientific article
Language Label Description Also known as
English
Differential equation and recursive formulas of Sheffer polynomial sequences
scientific article

    Statements

    Differential equation and recursive formulas of Sheffer polynomial sequences (English)
    0 references
    0 references
    0 references
    0 references
    3 April 2012
    0 references
    Summary: We derive a differential equation and recursive formulas of Sheffer polynomial sequences utilizing matrix algebra. These formulas provide the defining characteristics of, and the means to compute, the Sheffer polynomial sequences. The tools we use are the well-known Pascal functional and Wronskian matrices. The properties and the relationship between the two matrices simplify the complexity of the generating functions of Sheffer polynomial sequences. This work extends \textit{M. X. He} and \textit{P. E. Ricci}'s work [J. Comput. Appl. Math. 139, 231--237 (2002; Zbl 0994.33008)] to a broader class of polynomial sequences, from Appell to Sheffer, using a different method. The work is self-contained.
    0 references
    0 references
    recursive formulas of Sheffer polynomial sequences
    0 references
    Pascal functional
    0 references
    Wronskian matrices
    0 references
    0 references
    0 references