The smallest eigenvalue of large Hankel matrices

作者:

Highlights:

摘要

We investigate the large N behavior of the smallest eigenvalue, λN, of an (N+1)×(N+1) Hankel (or moments) matrix HN, generated by the weight w(x)=xα(1−x)β,x∈[0,1],α>−1,β>−1. By applying the arguments of Szegö, Widom and Wilf, we establish the asymptotic formula for the orthonormal polynomials Pn(z),z∈C∖[0,1], associated with w(x), which are required in the determination of λN. Based on this formula, we produce the expressions for λN, for large N.Using the parallel algorithm presented by Emmart, Chen and Weems, we show that the theoretical results are in close proximity to the numerical results for sufficiently large N.

论文关键词:Asymptotics,Smallest eigenvalue,Hankel matrices,Orthogonal polynomials,Parallel algorithm

论文评审过程:Received 17 July 2017, Revised 2 February 2018, Accepted 8 April 2018, Available online 8 May 2018, Version of Record 8 May 2018.

论文官网地址:https://doi.org/10.1016/j.amc.2018.04.012