2019
DOI: 10.1016/j.laa.2019.06.017
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotics of eigenvalues of large symmetric Toeplitz matrices with smooth simple-loop symbols

Abstract: This paper is devoted to the asymptotic behavior of all eigenvalues of Symmetric (in general non Hermitian) Toeplitz matrices with moderately smooth symbols which trace out a simple loop on the complex plane line as the dimension of the matrices increases to infinity. The main result describes the asymptotic structure of all eigenvalues. The constructed expansion is uniform with respect to the number of eigenvalues.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 32 publications
0
9
0
Order By: Relevance
“…In [7, pp. 1329], [8], and then [18], an algorithm was proposed to approximate the functions c k (θ ), which was subsequently extended and studied, see [2][3][4][15][16][17], to cover also other types of Toeplitz-like matrices A n , possessing an asymptotic expansion such as (8). We call this type of methods matrix-less, since they do not need to construct the large matrix A n to approximate its eigenvalues; indeed, they approximate the functions c k (θ ) from α small matrices A n 1 , .…”
Section: Approximating the Expansion Functions C K In Grid Points θ J Nmentioning
confidence: 99%
“…In [7, pp. 1329], [8], and then [18], an algorithm was proposed to approximate the functions c k (θ ), which was subsequently extended and studied, see [2][3][4][15][16][17], to cover also other types of Toeplitz-like matrices A n , possessing an asymptotic expansion such as (8). We call this type of methods matrix-less, since they do not need to construct the large matrix A n to approximate its eigenvalues; indeed, they approximate the functions c k (θ ) from α small matrices A n 1 , .…”
Section: Approximating the Expansion Functions C K In Grid Points θ J Nmentioning
confidence: 99%
“…The class SLα$$ {\mathrm{SL}}^{\alpha } $$ was introduced for the first time in Reference 20 but the seminal paper is Reference 21. The so called simple‐loop (SL) method was then investigated further in a number of articles including References 21‐25. For a symbol aSLα$$ a\in {\mathrm{SL}}^{\alpha } $$, let λjfalse(Tnfalse(afalse)false)$$ {\lambda}_j\left({T}_n(a)\right) $$ false(j=1,,nfalse)$$ \left(j=1,\dots, n\right) $$ be the eigenvalues of Tnfalse(afalse)$$ {T}_n(a) $$.…”
Section: Introductionmentioning
confidence: 99%
“…The simple‐loop method is a tool for obtaining individual asymptotic expressions for λjfalse(Tnfalse(afalse)false)$$ {\lambda}_j\left({T}_n(a)\right) $$ and consists in employing certain techniques of operator theory, algebra, and asymptotic analysis to obtain a recursive equation for each λjfalse(Tnfalse(afalse)false)$$ {\lambda}_j\left({T}_n(a)\right) $$ (see for instance (6)), and then solve it by an iterative procedure. The method started with Laurent polynomials, 21 and then it was extended to real‐valued symbols 22‐25 …”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…It should be said that the symbol under consideration has specific properties: it is a real, symmetric function, and the first and second derivatives of the symbol vanish at the points t = ±1. The last condition, namely the vanishing of the second derivative, significantly complicates the problem of finding an asymptotic formula for the eigenvalues, since in this case the general research methods developed in the work [10] are inapplicable (see also works [11], [12], [13], [14], [15], which present general approaches to finding the asymptotics of the eigenvalues for various classes of Toeplitz matrices). In addition, the case we are considering is more complicated than that considered in the work [16].…”
Section: Introductionmentioning
confidence: 99%