Search

An n-by-n real symmetric matrix $ H=[h_{i,j}] $ H = [ h i , j ] is said to be a Hankel matrix if $ h_{i,j}=h_{i-1,j+1} $ h i , j = h i − 1 , j + 1 , for each $ i=2,\ldots,n $ i = 2 , ... , n and $ j=1,\ldots,n-1 $ j = 1 , ... , n − 1. The symmetric nonnegative inverse eigenvalue problem (SNIEP) asks when a list $ \Lambda =\{\lambda _{1},\ldots,\lambda _{n}\} $ Λ = { λ 1 , ... , λ n } of real numbers is the spectrum of an n-by-n symmetric nonnegative matrix H. In this paper, we search for conditions on the list $ \Lambda =\{\lambda _{1},\ldots,\lambda _{n}\} $ Λ = { λ 1 , ... , λ n } for the matrix H to be Hankel. For n = 3, sufficient conditions are established. In particular, a necessary and sufficient condition is obtained if Λ is a list of three nonnegative numbers. Also, if $ \sum _{i=1}^{n}\lambda _{i}=0 $ ∑ i = 1 n λ i = 0 , we give conditions for realizability by a Hankel matrix. Finally, we present a special type of list that can serve as the spectrum of a Hankel nonnegative matrix with positive trace. Several of our results are constructive and provide a Hankel realizing matrix. [ABSTRACT FROM AUTHOR]

An n × n matrix C is said to be centrosymmetric if it satisfies the relation JCJ = C, where J is the n × n counteridentity matrix. Centrosymmetric matrices have a rich eigenstructure that has been studied extensively in the literature. Many results for centrosymmetric matrices have been generalized to wider classes of matrices that arise in a wide variety of disciplines. In this paper, we obtain interesting spectral properties for nonnegative centrosymmetric matrices. We show how to change one single eigenvalue, two or three eigenvalues of an n × n nonnegative centrosymmetric matrix without changing any of the remaining eigenvalues, the nonnegativity, or the centrosymmetric structure. Moreover, our results allow partially answer some known questions given by [Guo W. Eigenvalues of nonnegative matrices. Linear Algebra Appl. 266;1997:261–270] and by [Guo S, Guo W. Perturbing non-real eigenvalues of non-negative real matrices. Linear Algebra Appl. 426;2007:199–203]. Our proofs generate algorithmic procedures that allow one to compute a solution matrix. [ABSTRACT FROM AUTHOR]

A list Λ = { λ 1 , ... , λ n } of complex numbers is said to be realizable if there exists an n × n nonnegative matrix A whose spectrum is Λ. In this case A is called a realizing matrix for Λ. The problem of characterizing all realizable lists Λ is known as the Nonnegative Inverse Eigenvalue Problem (NIEP). If A is required to be persymmetric , the Persymmetric Nonnegative Inverse Eigenvalue Problem (PNIEP) arises. In this paper, we show that the NIEP and the PNIEP are equivalent for any realizable list of three complex numbers. Furthermore, we give a new sufficient condition for a list of three complex numbers to be the spectrum of a persymmetric nonnegative matrix with prescribed diagonal entries. For some realizable lists of four complex numbers, we show that the NIEP and the PNIEP are equivalent. In general, we show that these problems are different. Finally, we found a sufficient condition for a trace zero list of five complex numbers to be the spectrum of a persymmetric nonnegative matrix. [ABSTRACT FROM AUTHOR]

We give a necessary and sufficient condition for the nonnegative inverse elementary divisors problem to have a solution, in the case of listssatisfyingFor the casewe give new sufficient conditions. Our results improve previous results and generate an algorithmic procedure to compute a solution matrix. [ABSTRACT FROM AUTHOR]

Abstract: In this paper we give new sufficient conditions for the existence and construction of nonnegative matrices with prescribed elementary divisors, which drastically improve and contain some of the previous known conditions. We also show how to perturb complex eigenvalues of a nonnegative matrix while keeping its nonnegativity. These results allow us, under certain conditions, to easily decide if a given list is realizable with prescribed elementary divisors. [Copyright &y& Elsevier]