Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Askey scheme for hypergeometric orthogonal polynomials  





2 Askey scheme for basic hypergeometric orthogonal polynomials  





3 Completeness  





4 References  














Askey scheme






Català


 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


In mathematics, the Askey scheme is a way of organizing orthogonal polynomials of hypergeometric or basic hypergeometric type into a hierarchy. For the classical orthogonal polynomials discussed in Andrews & Askey (1985), the Askey scheme was first drawn by Labelle (1985) and by Askey and Wilson (1985), and has since been extended by Koekoek & Swarttouw (1998) and Koekoek, Lesky & Swarttouw (2010) to cover basic orthogonal polynomials.

Askey scheme for hypergeometric orthogonal polynomials[edit]

Koekoek, Lesky & Swarttouw (2010, p.183) give the following version of the Askey scheme:

Wilson | Racah
Continuous dual Hahn | Continuous Hahn | Hahn | dual Hahn
Meixner–Pollaczek | Jacobi | Pseudo Jacobi | Meixner | Krawtchouk
Laguerre | Bessel | Charlier
Hermite

Here indicates a hypergeometric series representation with parameters

Askey scheme for basic hypergeometric orthogonal polynomials[edit]

Koekoek, Lesky & Swarttouw (2010, p.413) give the following scheme for basic hypergeometric orthogonal polynomials:

43
Askey–Wilson | q-Racah
32
Continuous dual q-Hahn | Continuous q-Hahn | Big q-Jacobi | q-Hahn | dual q-Hahn
21
Al-Salam–Chihara | q-Meixner–Pollaczek | Continuous q-Jacobi | Big q-Laguerre | Little q-Jacobi | q-Meixner | Quantum q-Krawtchouk | q-Krawtchouk | Affine q-Krawtchouk | Dual q-Krawtchouk
20/11
Continuous big q-Hermite | Continuous q-Laguerre | Little q-Laguerre | q-Laguerre | q-Bessel | q-Charlier | Al-Salam–Carlitz I | Al-Salam–Carlitz II
10
Continuous q-Hermite | Stieltjes–Wigert | Discrete q-Hermite I | Discrete q-Hermite II

Completeness[edit]

While there are several approaches to constructing still more general families of orthogonal polynomials, it is usually not possible to extend the Askey scheme by reusing hypergeometric functions of the same form. For instance, one might naively hope to find new examples given by

above which corresponds to the Wilson polynomials. This was ruled out in Cheikh, Lamiri & Ouni (2009) under the assumption that the are degree 1 polynomials such that

for some polynomial .

References[edit]


Retrieved from "https://en.wikipedia.org/w/index.php?title=Askey_scheme&oldid=1130825951"

Categories: 
Orthogonal polynomials
Hypergeometric functions
Q-analogs
Hidden categories: 
Articles with short description
Short description matches Wikidata
Use mdy dates from September 2021
Use American English from March 2019
All Wikipedia articles written in American English
CS1: long volume value
 



This page was last edited on 1 January 2023, at 04:12 (UTC).

Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Mobile view



Wikimedia Foundation
Powered by MediaWiki