Show simple item record

dc.creatorSoto Montero, Ricardo Lorenzo
dc.date2017-04-20
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1477
dc.identifier10.4067/S0716-09172005000100006
dc.descriptionLet ? = {?1, ?2,...,?n} be a set of complex numbers. The nonnegative inverse eigenvalue problem (NIEP) is the problem of determining necessary and sufficient conditions in order that ? may be the spectrum of an entrywise nonnegative n × n matrix. If there exists a nonnegative matrix A with spectrum ? we say that ? is realized by A. If the matrix A must be symmetric we have the symmetric nonnegative inverse eigenvalue problem (SNIEP). This paper presents a simple realizability criterion by symmetric nonnegative matrices. The proof is constructive in the sense that one can explicitly construct symmetric nonnegative matrices realizing ?.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1477/1256
dc.rightsCopyright (c) 2005 Proyecciones. Journal of Mathematicsen-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 24 No. 1 (2005); 65-78en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 24 Núm. 1 (2005); 65-78es-ES
dc.source0717-6279
dc.subjectSymmetric nonnegative inverse eigenvalue problem.es-ES
dc.titleRealizability by symmetric nonnegative matriceses-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US


This item appears in the following Collection(s)

Show simple item record