Sum rules for zeros of polynomials and generalized Lucas polynomials

1993 ◽  
Vol 34 (10) ◽  
pp. 4884-4891 ◽  
Author(s):  
Paolo Emilio Ricci
1980 ◽  
Vol 21 (4) ◽  
pp. 702-708 ◽  
Author(s):  
K. M. Case

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Mahmoud M. Mokhtar ◽  
Amany S. Mohamed

AbstractHerein, we use the generalized Lucas polynomials to find an approximate numerical solution for fractional initial value problems (FIVPs). The method depends on the operational matrices for fractional differentiation and integration of generalized Lucas polynomials in the Caputo sense. We obtain these solutions using tau and collocation methods. We apply these methods by transforming the FIVP into systems of algebraic equations. The convergence and error analyses are discussed in detail. The applicability and efficiency of the method are tested and verified through numerical examples.


2010 ◽  
Vol 11 (2) ◽  
pp. 163
Author(s):  
Ayşe Nalli ◽  
Tianping Zhang

2016 ◽  
Vol 49 (3) ◽  
Author(s):  
Alexandre Laugier ◽  
Manjil P. Saikia

AbstractWe give a combinatorial proof of an elementary property of generalized Lucas polynomials, inspired by [1]. These polynomials in s and t are defined by the recurrence relation 〈n〉 = s〈n-1〉+t〈n-2〉 for n ≥ 2. The initial values are 〈0〉 = 2; 〈1〉= s, respectively.


Sign in / Sign up

Export Citation Format

Share Document