Abstract
The problem of finding conditions for a list of n complex numbers to be the eigenvalues of an n×n nonnegative matrix is called the nonnegative inverse eigenvalue problem (NIEP). The SNIEP (BNIEP) is the NIEP when the desired matrices are symmetric (bisymmetric). Recently, some sufficient conditions for the BNIEP are given by Julio and Soto in [6]. In this article, we study the BNIEP for n=4 and prove that the BNIEP and SNIEP are different for n=6. Then we give some sufficient conditions for the BNIEP and for the NIEP for normal centrosymmetric matrices related to the sufficient conditions of Julio and Soto and we also provide certain sufficient conditions for the BNIEP analogous to the sufficient conditions for the NIEP given by Borobia in [1]. Finally, we give sufficient conditions for the BNIEP when the prescribed diagonal entries are required.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
