The Smallest Eigenvalue of Large Hankel Matrices
Abstract
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\"o, 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.