intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE

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

Chia sẻ: Thamoioii Thamoioii | Ngày: | Loại File: PDF | Số trang:15

15
lượt xem
0
download
 
  Download Vui lòng tải xuống để xem tài liệu đầy đủ

Formulae expressing explicitly the q-difference derivatives and the moments of the polynomials Pn(x ; q) ∈ T (T ={Pn(x ; q) ∈ 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 Dp q f (x), and for the moments xDp q 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.

Chủ đề:
Lưu

Nội dung Text: Efficient algorithms for construction of recurrence relations for the expansion and connection coefficients in series of quantum classical orthogonal polynomials

ADSENSE

CÓ THỂ BẠN MUỐN DOWNLOAD

 

Đồng bộ tài khoản
2=>2