2004
DOI: 10.1016/j.jmaa.2004.01.032
|View full text |Cite
|
Sign up to set email alerts
|

Smallest eigenvalues of Hankel matrices for exponential weights

Abstract: We obtain the rate of decay of the smallest eigenvalue of the Hankel matricesfor a general class of even exponential weights W 2 = exp(−2Q) on an interval I . More precise asymptotics for more special weights have been obtained by many authors.  2004 Elsevier Inc. All rights reserved.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
16
0

Year Published

2006
2006
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 19 publications
(16 citation statements)
references
References 10 publications
(16 reference statements)
0
16
0
Order By: Relevance
“…Let λ N denote the smallest eigenvalue of HN. The asymptotic behavior of λ N for large N has been investigated . Also see Beckermann and Lubinsky,in which the authors have studied the behavior of the condition number κ()HN:=ΛNλN, where Λ N denotes the largest eigenvalue of HN.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations
“…Let λ N denote the smallest eigenvalue of HN. The asymptotic behavior of λ N for large N has been investigated . Also see Beckermann and Lubinsky,in which the authors have studied the behavior of the condition number κ()HN:=ΛNλN, where Λ N denotes the largest eigenvalue of HN.…”
Section: Introductionmentioning
confidence: 99%
“…Also, in the same paper, they obtained a lower bound of λ N for large N . Chen and Lubinsky obtained the behavior of λ N when wfalse(xfalse)=normalefalse|x|α,3.0235ptxdouble-struckR,3.0235ptα>1. Berg and Szwarc proved that λ N has exponential decay to zero for any measure that has compact support.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Our focus here is to provide matching upper and lower bounds for κ(H n ) when W 2 = e −2Q is an exponential weight. In an earlier paper, the author and Y. Chen [4] obtained upper and lower bounds for λ n . Our main task here is then to obtain matching upper and lower bounds for Λ n .…”
mentioning
confidence: 99%