2016
DOI: 10.1016/j.laa.2015.11.033
|View full text |Cite
|
Sign up to set email alerts
|

Perron spectratopes and the real nonnegative inverse eigenvalue problem

Abstract: Call an n-by-n invertible matrix S a Perron similarity if there is a real nonscalar diagonal matrix D such that SDS −1 is entrywise nonnegative. We give two characterizations of Perron similarities and study the polyhedra C (S) :which we call the Perron spectracone and Perron spectratope, respectively. The set of all normalized real spectra of diagonalizable nonnegative matrices may be covered by Perron spectratopes, so that enumerating them is of interest.The Perron spectracone and spectratope of Hadamard mat… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
7
1

Relationship

4
4

Authors

Journals

citations
Cited by 19 publications
(26 citation statements)
references
References 24 publications
0
26
0
Order By: Relevance
“…Detracting from both demonstrations is that they are not constructive, i.e., a realizing matrix is not explicitly given. Johnson and Paparella [8] give a constructive proof that every Suleimanova spectrum is symmetrically realizable via similarity by Hadamard matrices, which we will show gives a constructive proof for lists satisfying (6) and (7). A positive integer n is called a Hadamard order if there is a Hadamard matrix of order n. It is well-known, and otherwise easy to establish, that if n is a Hadamard order greater than one, then n can not be odd.…”
Section: Theorem 41 and The Sniepmentioning
confidence: 86%
See 1 more Smart Citation
“…Detracting from both demonstrations is that they are not constructive, i.e., a realizing matrix is not explicitly given. Johnson and Paparella [8] give a constructive proof that every Suleimanova spectrum is symmetrically realizable via similarity by Hadamard matrices, which we will show gives a constructive proof for lists satisfying (6) and (7). A positive integer n is called a Hadamard order if there is a Hadamard matrix of order n. It is well-known, and otherwise easy to establish, that if n is a Hadamard order greater than one, then n can not be odd.…”
Section: Theorem 41 and The Sniepmentioning
confidence: 86%
“…, λ n } is called normalized if λ 1 = 1 ≥ λ 2 ≥ · · · ≥ λ n . Johnson and Paparella [8] used Hadamard matrices to establish the following result (recall that a nonnegative matrix A is called doubly stochastic if every row and column sum to unity). Theorem 6.5 ([8, Theorem 6.3]).…”
Section: Theorem 41 and The Sniepmentioning
confidence: 99%
“…. Hence the two problems of D-RNIEP and SNIEP are di erent at least in this case (see also the recent work on the diagonalizable real nonnegative inverse eigenvalue problem in [10], [11], [12] and [22]). …”
Section: D-rniep ≠ Sniepmentioning
confidence: 99%
“…is called the spectracone of S [18,19]. It is known that the spectracones corresponding to Hadamard matrices comprise a large class of realizable real spectra [19].…”
Section: Differentiators and Complex Hadamard Matricesmentioning
confidence: 99%
“…is called the spectracone of S [18,19]. It is known that the spectracones corresponding to Hadamard matrices comprise a large class of realizable real spectra [19]. Furthermore, spectracones corresponding to DFT matrices comprise a large class of realizable nonreal spectra [18].…”
Section: Differentiators and Complex Hadamard Matricesmentioning
confidence: 99%