2020
DOI: 10.1063/1.5140079
|View full text |Cite
|
Sign up to set email alerts
|

The smallest eigenvalue of large Hankel matrices generated by a singularly perturbed Laguerre weight

Abstract: An asymptotic expression of the orthonormal polynomials P N (z) as N → ∞, associated with the singularly perturbed Laguerre weight w α (x; t) = x α e −x− t x , x ∈ [0, ∞), α > −1, t ≥ 0 is derived. Based on this, we establish the asymptotic behavior of the smallest eigenvalue, λ N , of the Hankel matrix generated by the weight w α (x; t).

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…A fast eigenvalue algorithm for Hankel matrices was proposed [3] based on the Lanczos-type tridiagonalization and QR-type diagonalization methods. Some studies [4][5][6][7] have focused specifically on the smallest eigenvalue of large scale Hankel matrices. The sensitivity of the nonlinear application [2] mapping the vector of Hankel entries to its generalized eigenvalues was studied.…”
Section: Introductionmentioning
confidence: 99%
“…A fast eigenvalue algorithm for Hankel matrices was proposed [3] based on the Lanczos-type tridiagonalization and QR-type diagonalization methods. Some studies [4][5][6][7] have focused specifically on the smallest eigenvalue of large scale Hankel matrices. The sensitivity of the nonlinear application [2] mapping the vector of Hankel entries to its generalized eigenvalues was studied.…”
Section: Introductionmentioning
confidence: 99%