Abstract
By applying well-known techniques such as the Gershgorin Circle Theorem and the Euler-Rayleigh method (the latter assisted by some computer algebra), we obtain new bounds for the extreme zeroes of the n-th Laguerre polynomial. It turns out that these bounds are competitive to some of the known best bounds.
Author supplied keywords
Cite
CITATION STYLE
APA
Nikolov, G., & Uluchev, R. (2019). Bounds for the extreme zeros of laguerre polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11189 LNCS, pp. 243–250). Springer Verlag. https://doi.org/10.1007/978-3-030-10692-8_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free