Efficient algorithms for construction of recurrence relations for the expansion and connection coefficients in series of quantum classical orthogonal polynomials

被引:2
|
作者
Doha, Eid H. [1 ]
Ahmed, Hany M. [2 ]
机构
[1] Cairo Univ, Dept Math, Fac Sci, Giza, Egypt
[2] Helwan Univ, Fac Ind Educ, Dept Math, Cairo, Egypt
关键词
q-classical orthogonal polynomials; Askey-Wilson polynomials; q-difference equations; Fourier coefficients; Recurrence relations; Connection problem;
D O I
10.1016/j.jare.2010.07.001
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Formulae expressing explicitly the q-difference derivatives and the moments of the polynomials P-n(x; q) is an element of Z (T={P-n(x; q) is an element of Askey-Wilson polynomials: Al-Salam-Carlitz I, Discrete q-Hermite I, Little (Big) q-Laguerre, Little (Big) q-Jacobi, q-Hahn, Alternative q-Charlier) of any degree and for any order in terms of Pi(x; q) themselves are proved. We will also provide two other interesting formulae to expand the coefficients of general-order q-difference derivatives D-q(P) f(x), and for the moments x(l) D-q(p) f(x), of an arbitrary function f(x) in terms of its original expansion coefficients. We used the underlying formulae to relate the coefficients of two different polynomial systems of basic hypergeometric orthogonal polynomials, belonging to the Askey-Wilson polynomials and Pn(x; q). T. These formulae are useful in setting up the algebraic systems in the unknown coefficients, when applying the spectral methods for solving q-difference equations of any order. (C) 2010 Cairo University. All rights reserved.
引用
收藏
页码:193 / 207
页数:15
相关论文
共 49 条