Complexity analysis of hypergeometric orthogonal polynomials

作者:

Highlights:

摘要

The complexity measures of the Crámer–Rao, Fisher–Shannon and LMC (López-Ruiz, Mancini and Calvet) types of the Rakhmanov probability density ρn(x)=ω(x)pn2(x) of the polynomials pn(x) orthogonal with respect to the weight function ω(x), x∈(a,b), are used to quantify various two-fold facets of the spreading of the Hermite, Laguerre and Jacobi systems all over their corresponding orthogonality intervals in both analytical and computational ways. Their explicit (Crámer–Rao) and asymptotical (Fisher–Shannon, LMC) values are given for the three systems of orthogonal polynomials. Then, these complexity-type mathematical quantities are numerically examined in terms of the polynomial’s degree n and the parameters which characterize the weight function. Finally, several open problems about the generalized hypergeometric functions of Lauricella and Srivastava-Daoust types, as well as on the asymptotics of weighted Lq-norms of Laguerre and Jacobi polynomials are pointed out.

论文关键词:Information theory of orthogonal polynomials,Hypergeometric orthogonal polynomials,Measures of complexity of orthogonal polynomials,Lp-norms of classical orthogonal polynomials,Fisher–Shannon complexity measure,Lauricella and Srivastava-Daoust hypergeometric functions

论文评审过程:Received 21 February 2014, Revised 11 August 2014, Available online 6 September 2014.

论文官网地址:https://doi.org/10.1016/j.cam.2014.08.013