Asymptotic Distribution of the Zeros of recursively defined Non-Orthogonal Polynomials
Abstract
We study the zero distribution of non-orthogonal polynomials attached to g(n)=s(n)=n2: equation* Qng(x)= x Σk=1n g(k) \, Qn-kg(x), Q0g(x):=1. equation* It is known that the case g=id involves Chebyshev polynomials of the second kind. The zeros of Qns(x) are real, simple, and are located in (-63,0]. Let Nn(a,b) be the number of zeros between -6 3 ≤ a < b ≤ 0. Then we determine a density function v(x), such that equation* n → ∞ Nn(a,b)n = ∫ab v(x) \,\, dx. equation* The polynomials Qns(x) satisfy a four-term recursion. We present in detail an analysis of the fundamental roots and give an answer to an open question on recent work by Adams and Tran--Zumba. We extend a method proposed by Freud for orthogonal polynomials to more general systems of polynomials. We determine the underlying moments and density function for the zero distribution.
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.