Symmetric nonnegative realization of spectra

@article{Soto2007SymmetricNR,
  title={Symmetric nonnegative realization of spectra},
  author={Ricardo L. Soto and Oscar Rojo and Julio Moro and Alberto M. Borobia},
  journal={Electronic Journal of Linear Algebra},
  year={2007},
  volume={16},
  pages={1}
}
A perturbation result, due to R. Rado and presented by H. Perfect in 1955, shows how to modify r eigenvalues of a matrix of order n, r ≤ n, via a perturbation of rank r, without changing any of the n − r remaining eigenvalues. This result extended a previous one, due to Brauer, on perturbations of rank r = 1. Both results have been exploited in connection with the nonnegative inverse eigenvalue problem. In this paper a symmetric version of Rado’s extension is given, which allows us to obtain a… 

A family of nonnegative matrices with prescribed spectrum and elementary divisors

A perturbation result, due to Rado, shows how to modify r eigenvalues of a matrix of order n, via a perturbation of rank r ≤ n, without changing any of the n − r remaining eigenvalues. This result

ELA NONNEGATIVE REALIZATION OF COMPLEX SPECTRA

Abstract. We consider a list of complex numbers Λ = {λ1, λ2, . . . , λn} and give a simple and efficient sufficient condition for the existence of an n × n nonnegative matrix with spectrum Λ. Our

On nonnegative realization of partitioned spectra

We consider partitioned lists of real numbers � = {�1,�2,...,�n}, and give efficient and constructive sufficient conditions for the existence of nonnegative and symmetric nonnegative matrices with

A Note on the Symmetric Nonnegative Inverse Eigenvalue Problem 1

The symmetric nonnegative inverse eigenvalue problem is the problem of characterizing all possible spectra of n × n symmetric entrywise nonnegative matrices. The problem remains open for n ≥ 5. A

Nonnegative realization of complex spectra

We consider a list of complex numbers ¤ = {¸1, ¸2, . . . , ¸n} and give a simple and efficient sufficient condition for the existence of an n × n nonnegative matrix with spectrum ¤. Our result

Normal nonnegative realization of spectra

The nonnegative inverse eigenvalue problem is the problem of finding necessary and sufficient conditions for the existence of an entrywise nonnegative matrix A with prescribed spectrum. This problem

ELA ON NONNEGATIVE REALIZATION OF PARTITIONED SPECTRA

We consider partitioned lists of real numbers Λ = {λ1, λ2, . . . , λn}, and give efficient and constructive sufficient conditions for the existence of nonnegative and symmetric nonnegative matrices

References

SHOWING 1-10 OF 29 REFERENCES

Applications of a Brauer theorem in the nonnegative inverse eigenvalue problem

A note on the convexity of the realizable set of eigenvalues for nonnegative symmetric matrices

Geometric properties of the set Rn of n-tuples of realizable spectra of nonnegative symmetric matrices, and the Soules set Sn introduced by McDonald and Neumann, are examined. It is established that

On the nonnegative eigenvalue problem

REALIZABILITY BY SYMMETRIC NONNEGATIVE MATRICES

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

Realizability criterion for the symmetric nonnegative inverse eigenvalue problem

The real and the symmetric nonnegative inverse eigenvalue problems are different

We show that there exist real numbers Al, A2 ... A, that occur as the eigenvalues of an entry-wise nonnegative n-by-n matrix but do not occur as the eigenvalues of a symmetric nonnegative n-by-n

The symmetric nonnegative inverse eigenvalue problem for 5 × 5 matrices

An inequality for nonnegative matrices and the inverse eigenvalue problem

We present two versions of the same inequality, relating the maximal diagonal entry of a nonnegative matrix to its eigenvalues. We demonstrate a matrix factorization of a companion matrix, which

The nonnegative inverse eigenvalue problem