pith. sign in

arxiv: 1408.4698 · v1 · pith:E67CC4NPnew · submitted 2014-08-20 · 🧮 math-ph · math.MP

Complexity analysis of hypergeometric orthogonal polynomials

classification 🧮 math-ph math.MP
keywords polynomialsorthogonalamer-raocomplexityfisher-shannonfunctionhypergeometricjacobi
0
0 comments X
read the original abstract

The complexity measures of the Cr\'amer-Rao, Fisher-Shannon and LMC (L\'opez-Ruiz, Mancini and Calvet) types of the Rakhmanov probability density $\rho_n(x)=\omega(x) p_n^2(x)$ of the polynomials $p_n(x)$ orthogonal with respect to the weight function $\omega(x)$, $x\in (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\'amer-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 generalised hypergeometric functions of Lauricella and Srivastava-Daoust types, as well as on the asymptotics of weighted $L_q$-norms of Laguerre and Jacobi polynomials are pointed out.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.