On the extreme eigenvalues of hermitian (block) toeplitz matrices
β Scribed by Stefano Serra
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 758 KB
- Volume
- 270
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
We are concerned with the behavior of the minimum (maximum) eigenvalue A~0 "~ (A~ "~) of an (n + 1) X (n + 1) Hermitian Toeplitz matrix T~(f) where f is an integrable real-valued function. Kac, Murdoch, and Szeg5, Widom, Patter, and R. H.
Chan obtained that A}~ 0 -rain f = O(1/n 2k) in the case where f ~ C zk, at least locally, and f -inff has a zero of order 2k. We obtain the same result under the second hypothesis alone. Moreover we develop a new tool in order to estimate the extreme eigenvalues of the mentioned matrices, proving that the rate of convergence of A~ ~ to inff depends only on the order p (not necessarily even or integer or finite) of the zero of f -inf f. With the help of this tool, we derive an absolute lower bound for the minimal eigenvalues of Toeplitz matrices generated by nonnegative L 1 functions and also an upper bound for the associated Euclidean condition numbers. Finally, these results are extended to the case of Hermitian block Toeplitz matrices with Toeplitz blocks generated by a bivariate integrable function f.
π SIMILAR VOLUMES
In contrast to the Hermitian case, the ``unfair behavior'' of non-Hermitian Toeplitz eigenvalues is still to be unravelled. We propose a general technique for this, which reveals the eigenvalue clusters for symbols from v I . Moreover, we study a thin structure of those clusters in the terms of prop
The paper deals with the entries of functions of large banded Hermitian block Toeplitz matrices and their perturbations. For general continuous functions, convergence results are established, and for analytic functions, these results are accompanied by estimates of the convergence speed. The applica
A new fast algorithm for calculating a few maximum (or minimum) eigenvalues and the corresponding eigenvectors of large N x N Hermitian matrices is presented. The method is based on a molecular dynamics algorithm for N coupled harmonic oscillators. The time step for iteration is chosen so that only