14 research outputs found

    Eigenvalues of even very nice Toeplitz matrices can be unexpectedly erratic

    Full text link
    It was shown in a series of recent publications that the eigenvalues of n×nn\times n Toeplitz matrices generated by so-called simple-loop symbols admit certain regular asymptotic expansions into negative powers of n+1n+1. On the other hand, recently two of the authors considered the pentadiagonal Toeplitz matrices generated by the symbol g(x)=(2sin(x/2))4g(x)=(2\sin(x/2))^4, which does not satisfy the simple-loop conditions, and derived asymptotic expansions of a more complicated form. We here use these results to show that the eigenvalues of the pentadiagonal Toeplitz matrices do not admit the expected regular asymptotic expansion. This also delivers a counter-example to a conjecture by Ekstr\"{o}m, Garoni, and Serra-Capizzano and reveals that the simple-loop condition is essential for the existence of the regular asymptotic expansion.Comment: 28 pages, 7 figure

    Eigenvalues of the laplacian matrices of the cycles with one weighted edge

    Full text link
    In this paper we study the eigenvalues of the laplacian matrices of the cyclic graphs with one edge of weight α\alpha and the others of weight 11. We denote by nn the order of the graph and suppose that nn tends to infinity. We notice that the characteristic polynomial and the eigenvalues depend only on Re(α)\operatorname{Re}(\alpha). After that, through the rest of the paper we suppose that 0<α<10<\alpha<1. It is easy to see that the eigenvalues belong to [0,4][0,4] and are asymptotically distributed as the function g(x)=4sin2(x/2)g(x)=4\sin^2(x/2) on [0,π][0,\pi]. We obtain a series of results about the individual behavior of the eigenvalues. First, we describe more precisely their localization in subintervals of [0,4][0,4]. Second, we transform the characteristic equation to a form convenient to solve by numerical methods. In particular, we prove that Newton's method converges for every n3n\ge3. Third, we derive asymptotic formulas for all eigenvalues, where the errors are uniformly bounded with respect to the number of the eigenvalue.Comment: 29 pages, 5 figure
    corecore