dc.creator | Soto Montero, Ricardo Lorenzo | |
dc.date | 2017-04-20 | |
dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1477 | |
dc.identifier | 10.4067/S0716-09172005000100006 | |
dc.description | Let ? = {?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.format | application/pdf | |
dc.language | spa | |
dc.publisher | Universidad Católica del Norte. | en-US |
dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1477/1256 | |
dc.rights | Copyright (c) 2005 Proyecciones. Journal of Mathematics | en-US |
dc.source | Proyecciones (Antofagasta, On line); Vol. 24 No. 1 (2005); 65-78 | en-US |
dc.source | Proyecciones. Revista de Matemática; Vol. 24 Núm. 1 (2005); 65-78 | es-ES |
dc.source | 0717-6279 | |
dc.subject | Symmetric nonnegative inverse eigenvalue problem. | es-ES |
dc.title | Realizability by symmetric nonnegative matrices | es-ES |
dc.type | info:eu-repo/semantics/article | |
dc.type | info:eu-repo/semantics/publishedVersion | |
dc.type | Peer-reviewed Article | en-US |