Asymptotics of eigenvalues for Toeplitz matrices with rational symbols that have a minimum of the 4th order

Author(s):  
Mauricio Barrera ◽  
Sergei M. Grudsky
2017 ◽  
Vol 208 (11) ◽  
pp. 1578-1601 ◽  
Author(s):  
A. Böttcher ◽  
J. M. Bogoya ◽  
S. M. Grudsky ◽  
E. A. Maximenko

2019 ◽  
Vol 580 ◽  
pp. 292-335
Author(s):  
A.A. Batalshchikov ◽  
S.M. Grudsky ◽  
I.S. Malisheva ◽  
S.S. Mihalkovich ◽  
E. Ramírez de Arellano ◽  
...  

2019 ◽  
Vol 7 (1) ◽  
pp. 230-245
Author(s):  
Macarena Collao ◽  
Mario Salas ◽  
Ricardo L. Soto

Abstract The nonnegative inverse eigenvalue problem (NIEP) is the problem of finding conditions for the existence of an n × n entrywise nonnegative matrix A with prescribed spectrum Λ = {λ1, . . ., λn}. If the problem has a solution, we say that Λ is realizable and that A is a realizing matrix. In this paper we consider the NIEP for a Toeplitz realizing matrix A, and as far as we know, this is the first work which addresses the Toeplitz nonnegative realization of spectra. We show that nonnegative companion matrices are similar to nonnegative Toeplitz ones. We note that, as a consequence, a realizable list Λ= {λ1, . . ., λn} of complex numbers in the left-half plane, that is, with Re λi≤ 0, i = 2, . . ., n, is in particular realizable by a Toeplitz matrix. Moreover, we show how to construct symmetric nonnegative block Toeplitz matrices with prescribed spectrum and we explore the universal realizability of lists, which are realizable by this kind of matrices. We also propose a Matlab Toeplitz routine to compute a Toeplitz solution matrix.


Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 870
Author(s):  
Diego Caratelli ◽  
Paolo Emilio Ricci

We show that using Dunford-Taylor’s integral, a classical tool of functional analysis, it is possible to derive an expression for the inverse of a general non-singular complex-valued tridiagonal matrix. The special cases of Jacobi’s symmetric and Toeplitz (in particular symmetric Toeplitz) matrices are included. The proposed method does not require the knowledge of the matrix eigenvalues and relies only on the relevant invariants which are determined, in a computationally effective way, by means of a dedicated recursive procedure. The considered technique has been validated through several test cases with the aid of the computer algebra program Mathematica©.


Sign in / Sign up

Export Citation Format

Share Document