The Nonnegative Inverse Eigenvalue Problem

Similar documents
On characterizing the spectra of nonnegative matrices

A Note on the Symmetric Nonnegative Inverse Eigenvalue Problem 1

On nonnegative realization of partitioned spectra

A map of sufficient conditions for the real nonnegative inverse eigenvalue problem

REALIZABILITY BY SYMMETRIC NONNEGATIVE MATRICES

THE REAL AND THE SYMMETRIC NONNEGATIVE INVERSE EIGENVALUE PROBLEMS ARE DIFFERENT

arxiv: v2 [math.sp] 5 Aug 2017

Symmetric nonnegative realization of spectra

An Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem

A Family of Nonnegative Matrices with Prescribed Spectrum and Elementary Divisors 1

Nonnegative Matrix Theory: Generalizations and Applications

On the spectra of striped sign patterns

Methods for Constructing Distance Matrices and the Inverse Eigenvalue Problem

Given an n n matrix A, the spectrum of A is denoted by σ(a) and its spectral radius by

Z-Pencils. November 20, Abstract

Geometric Mapping Properties of Semipositive Matrices

On The Inverse Mean First Passage Matrix Problem And The Inverse M Matrix Problem

Invertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices

Abed Elhashash and Daniel B. Szyld. Report August 2007

Linear algebra and applications to graphs Part 1

Iowa State University and American Institute of Mathematics

Positive entries of stable matrices

Matrix functions that preserve the strong Perron- Frobenius property

CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES

Double Soules pairs and matching Soules bases

Some bounds for the spectral radius of the Hadamard product of matrices

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

Two Characterizations of Matrices with the Perron-Frobenius Property

Generalizations of M-matrices which may not have a nonnegative inverse

This manuscript has been accepted for publication in Linear Algebra and Its Applications. The manuscript will undergo copyediting, typesetting, and

Lecture 8 : Eigenvalues and Eigenvectors

Properties of Matrices and Operations on Matrices

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background

Spectrally arbitrary star sign patterns

ACM 104. Homework Set 4 Solutions February 14, 2001

Problem Set 9 Due: In class Tuesday, Nov. 27 Late papers will be accepted until 12:00 on Thursday (at the beginning of class).

A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo

ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS

A LINEAR PROGRAMMING BASED ANALYSIS OF THE CP-RANK OF COMPLETELY POSITIVE MATRICES

Eigenvalues and Eigenvectors

Minimizing the Laplacian eigenvalues for trees with given domination number

ELA

Eventual Cone Invariance

On the second Laplacian eigenvalues of trees of odd order

OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY

Quadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.

Math 291-2: Final Exam Solutions Northwestern University, Winter 2016

There are two things that are particularly nice about the first basis

Linear Algebra. Hoffman & Kunze. 2nd edition. Answers and Solutions to Problems and Exercises Typos, comments and etc...

SIGN PATTERNS THAT REQUIRE OR ALLOW POWER-POSITIVITY. February 16, 2010

Abed Elhashash, Uriel G. Rothblum, and Daniel B. Szyld. Report August 2009

Two applications of the theory of primary matrix functions

Integral Similarity and Commutators of Integral Matrices Thomas J. Laffey and Robert Reams (University College Dublin, Ireland) Abstract

Last Time. Social Network Graphs Betweenness. Graph Laplacian. Girvan-Newman Algorithm. Spectral Bisection

Scaling of Symmetric Matrices by Positive Diagonal Congruence

NOTES ON THE PERRON-FROBENIUS THEORY OF NONNEGATIVE MATRICES

Math 408 Advanced Linear Algebra

Functional Analysis Review

Computational Methods. Eigenvalues and Singular Values

In Memoriam Michael (Miki) Neumann ( )

Generic maximum nullity of a graph

ELA

Computing the Norm A,1 is NP-Hard

Math 108b: Notes on the Spectral Theorem

A Note on Eigenvalues of Perturbed Hermitian Matrices

Ann. Funct. Anal. 5 (2014), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:

SECTIONS 5.2/5.4 BASIC PROPERTIES OF EIGENVALUES AND EIGENVECTORS / SIMILARITY TRANSFORMATIONS

A Method for Constructing Diagonally Dominant Preconditioners based on Jacobi Rotations

arxiv: v1 [math.ra] 11 Aug 2014

Matrices and Linear Algebra

Systems of Algebraic Equations and Systems of Differential Equations

Spectral Theorem for Self-adjoint Linear Operators

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018

Quantum Computing Lecture 2. Review of Linear Algebra

Vector Space Examples Math 203 Spring 2014 Myers. Example: S = set of all doubly infinite sequences of real numbers = {{y k } : k Z, y k R}

E2 212: Matrix Theory (Fall 2010) Solutions to Test - 1

Lecture 7: Positive Semidefinite Matrices

Kernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman

An alternative proof of the Barker, Berman, Plemmons (BBP) result on diagonal stability and extensions - Corrected Version

Definition 1. A set V is a vector space over the scalar field F {R, C} iff. there are two operations defined on V, called vector addition

MTH5102 Spring 2017 HW Assignment 1: Prob. Set; Sec. 1.2, #7, 8, 12, 13, 20, 21 The due date for this assignment is 1/18/17.

you expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form

ELA MATRIX FUNCTIONS PRESERVING SETS OF GENERALIZED NONNEGATIVE MATRICES

Applied Mathematics Letters. Comparison theorems for a subclass of proper splittings of matrices

A PROOF OF BURNSIDE S p a q b THEOREM

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

1 Last time: least-squares problems

Homework For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable.

1 T 1 = where 1 is the all-ones vector. For the upper bound, let v 1 be the eigenvector corresponding. u:(u,v) E v 1(u)

Common-Knowledge / Cheat Sheet

AIMS Exercise Set # 1

Sparse spectrally arbitrary patterns

Tropical Polynomials

MP 472 Quantum Information and Computation

Linear Algebra Massoud Malek

On a quadratic matrix equation associated with an M-matrix

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show

M.A. Botchev. September 5, 2014

EE263: Introduction to Linear Dynamical Systems Review Session 5

Nilpotent matrices and spectrally arbitrary sign patterns

Transcription:

1 / 62 The Nonnegative Inverse Eigenvalue Problem Thomas Laffey, Helena Šmigoc December 2008

2 / 62 The Nonnegative Inverse Eigenvalue Problem (NIEP): Find necessary and sufficient conditions on a list of n complex numbers σ = (λ 1, λ 2,..., λ n ) for σ to be the spectrum of an n n entry-wise nonnegative matrix. If there exists an n n nonnegative matrix A with spectrum σ, we will say that σ is realizable and that A realizes σ.

3 / 62 The Symmetric Nonnegative Inverse Eigenvalue Problem (SNIEP): Find necessary and sufficient conditions on a list of n complex numbers σ = (λ 1, λ 2,..., λ n ) for σ to be the spectrum of an n n symmetric nonnegative matrix. If there exists an n n nonnegative matrix A with spectrum σ, we will say that σ is symmetrically realizable and that A is a symmetric realization of σ.

4 / 62 Detailed information on the general theory of nonnegative matrices, including NIEP can be found in Berman, Plemmons: Nonnegative matrices in the Mathematical Sciences, SIAM, 1994 Minc: Nonnegative matrices, John Wiley and Sons, 1998

5 / 62 Immediate Necessary Conditions Realizable list σ = (λ 1, λ 2,..., λ n ) satisfies the following conditions: 1. σ is closed under complex conjugation. 2. s k = n i=1 λk i 0 for k = 1, 2,... 3. The Perron eigenvalue lies in σ. λ 1 = max{ λ i ; λ i σ}

6 / 62 While Kolmogorov, 1937, had asked earlier whether every complex number can arise as an eigenvalue of a nonnegative matrix, the NIEP was first formulated by Suleimanova, 1949. Suleimanova: If λ 1 > 0 λ 2 λ 3... λ n, then the list σ = (λ 1, λ 2, λ 3,..., λ n ) is the spectrum of a nonnegative matrix if and only if λ 1 + λ 2 + λ 3 +... + λ n 0.

Operations that preserve realizability 7 / 62

8 / 62 Brauer σ 1 = (λ 1, λ 2,..., λ n ) realizable σ 2 = (λ 1 + t, λ 2,..., λ n ) realizable (t 0) σ 1 : A, Av = λ 1 v, v 0 σ 2 : B = A + tvu T for every u 0, u T v = 1.

9 / 62 Fiedler, 1974 σ 1 = (λ 1, λ 2,..., λ n ) and σ 2 = (µ 1, µ 2,..., µ m ) symmetrically realizable, λ 1 µ 1, t 0 σ 3 = (λ 1 +t, λ 2,..., λ m, µ 1 t, µ 2,..., µ n ) symmetrically realizable σ 1 : A, Au = λ 1 u, u = 1 σ 2 : B, Bv = µ 1 v, v = 1 [ ] A ρuv T σ 3 : C = ρvu T, ρ = t(λ B 1 β 1 + t)

10 / 62 Idea of combining lists using realizable sublists was developed by several authors: Ciarlet Salzmann Xu Kellog and Stephens Rojo, Soto, Borobia, Moro. Marijuán, Pisonero.

11 / 62 Šmigoc, 2004: Introduced constructions that extend a nonnnegative matrix of the form [ ] A11 A A = 12 A 21 A 22 into a nonnnegative matrix of the form A 11 A 12 A 13 A = A 21 A 22 A 23. A 31 A 32 A 33 σ 1 = (λ 1, λ 2,..., λ n ) and σ 2 = (µ 1, µ 2,..., µ m ) realizable (λ 1 + µ 1, λ 2,..., λ n, µ 2,..., µ m ) realizable.

12 / 62 Guo Wuwen, 1997: σ 1 = (λ 1, λ 2,..., λ n ) realizable, λ 2 real σ 2 = (λ 1 +t, λ 2 ±t,..., λ n ) realizable, (t 0).

13 / 62 Laffey, 2005: σ 1 = (λ 1, a + ib, a ib,..., λ n ) realizable σ 2 = (λ 1 +2t, a t + ib, a t ib,..., λ n ) realizable, (t 0) Small perturbation case Global case Guo Wuwen, Guo Siwen, 2007: Different proof.

14 / 62 Guo Wuwen, Guo Siwen, 2007 σ 1 = (λ 1, a + ib, a ib,..., λ n ) realizable σ 2 = (λ 1 +4t, a+t + ib, a+t ib,..., λ n ) realizable, (t 0).

Open questions on operations that preserve realizability 15 / 62

16 / 62 Let σ 1 = (λ 1, λ 2,..., λ n ), λ 2 real, be the spectrum of a symmetric nonnegative matrix. Must then σ 2 = (λ 1 +t, λ 2 ±t,..., λ n ), t > 0, be the spectrum of a symmetric nonnegative matrix?

17 / 62 σ 1 = (λ 1, a + ib, a ib,..., λ n ) realizable. Must σ 2 = (λ 1 +2t, a+t + ib, a+t ib,..., λ n ), t > 0, be realizable? Find the "best function" g(t) for which (λ 1 +g(t), a+t + ib, a+t ib,..., λ n ), t > 0, is realizable.

18 / 62 Constructive Methods Given a class of nonnegative matrices, find large classes of spectra realized by these matrices.

19 / 62 Companion matrix f (x) = (x λ 1 )(x λ 2 )... (x λ n ) Companion matrix of f (x): = x n + B 1 x n 1 + B 2 x n 2 +... + B n. 0 1 0... 0. 0 0 1..... A =........ 0 0 0... 0 1 B n B n 1... B 2 B 1 A is nonnegative if and only if B i 0 for i = 1,..., n.

20 / 62 Friedland, 1978: Suleimanova-type spectra are realizable by a companion matrix. Loewy, London, 1978: (ρ, a + ib, a ib) is realizable if and only if it is realizable by αi + C, α 0, C a nonnegative companion matrix.

21 / 62 Laffey, Šmigoc, 2006 σ = (λ 1, λ 2, λ 3,..., λ n ), λ 1 > 0, Re(λ i ) 0, i = 2,..., n, is realizable if, and only if, it is realizable by a matrix of the form C + αi, where α 0 and C is a companion matrix with trace zero.

22 / 62 Rojo, Soto, 2001 Found sufficient conditions for the realizability of spectra by nonnegative circulant matrices.

23 / 62 Kim, Ormes, Roush, 2000 Realizability by nonnegative integer matrices. The authors obatined realizations of n j=1 (1 λ jt) as det(i ta(t)) where A(t) Z + [t], and these lead to realizations by block matrices, with the companion matrices as blocks on the diagonal.

24 / 62 Laffey, 1998 Considered the realization of spectra by matrices of the form: C(f ) u v w s 1 C(g)

25 / 62 Laffey, Šmigoc Matrices of the form 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 α 3 α 2 α 1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 β 2 β 1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 c b a f e γ 4 γ 3 γ 2 γ 1 yield realizations of real spectra with two positive entries. f (x) = f 1 (x)f 2 (x)f 3 (x) (ex + f )f 1 (x) (ax 2 + bx + c)

26 / 62 Laffey, Šmigoc, 2008: σ N (t) = (3 + t, 3 t, 2, 2, 2, 0,..., 0). }{{} N If t 3 N/4 2, σ N (t) can be realized by a matrix 0 1 0 0 0 0 0... 0 0 0 1 0 0 0 0... 0 9 6 0 0 0 0 0... 0 0 0 0 0 1 0 0... 0 A N (t) = 0 0 0 3 0 1 0... 0 0 0 0 0 0..... C(v N ) 0 0 0 0 0 c N b N a N f N e N

27 / 62 Butcher, Chartier, 1999: Doubly companion matrix. f (x) = x n + p 1 x n 1 +... + p n and g(x) = x n + q 1 x n 1 +... + q n q 1 1 0... 0. q 2 0 1..... C(f, g) =........ 0 q n 1 0... 0 1 p n q n p n 1...... p 1 has characteristic polynomial Trunc n (f (x)g(x))/x n, where Trunc n (h(x)) means the polynomial obtained from h(x) by deleting terms of degree smaller than n.

28 / 62 Let C = C(f ) be the companion matrix of a given monic polynomial f (x). Reams (1994) observed that one can write the Newton identities in the form CS 1 = S 2 where S 1 and S 2 are nonnegative and S 1 is unitriangular. Then the matrix R = S 1 1 S 2 is similar to C and under certain conditions R is nonnegative.

29 / 62 Laffey, Meehan, 1998 Solution of the NIEP for n = 4 uses matrices of the form a 1 0 0 αi + b 0 1 0 0 0 0 1 u v w q Torre-Mayo, Abril-Raymundo, Alarcia-Estevez, Marijuan,Pisonero, 2007: Another constructive solution to NIEP for n = 4.

30 / 62 Leal-Duarte, Johnson, 2004 Solved the NIEP for the case where the realizing matrix is an arbitrary nonnegative diagonal matrix added to a nonnegative matrix whose graph is a tree.

31 / 62 Holtz, 2005 Solved the NIEP for symmetric nonnegative matrices of the form 0...... 0 a 1.... a 2 b 1.......... 0. 0 a 2......... a 1 b 1 0... 0

32 / 62 Soules, 1983: Constructed real orthogonal matrices U with the property that if D = diag(d 1, d 2,..., d m ) with d 1 d 2... d n, then U T DU has all its off-diagonal entries nonnegative. 6 2 2 2 3 1 2 6 2 2 2 3 6 6 2 4 0 6 3 2 0 0

33 / 62 Further development and application of Soules matrices: Elsner, Nabben, Neumann, 1998 McDonald, Neumann, 2000 Shaked-Monderer, 2004 Loewy, McDonald, 2004 Nabben, 2007 Chen, Neumann, Shaked-Monderer, 2008

34 / 62 Open Problem Find other good classes of matrices.

Existence Results 35 / 62

36 / 62 Boyle, Handelman, 1991 A list of complex numbers σ = (λ 1,..., λ n ) is the nonzero spectrum of some nonnegative matrix if: 1. λ 1 > λ j for j = 2, 3,..., n. 2. σ is closed under complex conjugation. 3. For all positive integers k and m: and s k > 0 implies s mk > 0. s k = λ k 1 +... + λk n 0,

37 / 62 Square nonnegative matrices A and B are equivalent if there exists N and nonnegative matrices P i and Q i with sizes so that P i Q i, Q i P i exists and A = P 1 Q 1, Q 1 P 1 = P 2 Q 2..., Q N 1 P N 1 = P N Q N, Q N P N = B.

38 / 62 Open Problem Finding a constructive proof of Boyle- Handelman result with a "good" bound on the number of zeros required for the realization.

39 / 62 Johnson, Laffey, Loewy, 1996 Suppose that σ = (λ 1, λ 2,..., λ n ) with N zeros added is the spectrum of a symmetric nonnegative matrix. Then σ with ( ) n+1 2 zeros added is the spectrum of a symmetric nonnegative matrix.

40 / 62 Laffey, Meehan: Adding zeros the the spectrum can help to realize it by a symmetric nonnegative matrix. Example: Loewy and Hartwig, McDonald and Neumann: (3 + t, 3 t, 2, 2, 2) is realizable by a symmetric nonnegative matrix only for t 1. Laffey, Šmigoc: (3 + t, 3 t, 2, 2, 2, 0) is realizable by a symmetric nonnegative matrix for t 1 3.

Necessary Conditions 41 / 62

42 / 62 Immediate Necessary Conditions Realizable list σ = (λ 1, λ 2,..., λ n ) satisfies the following conditions: 1. σ is closed under complex conjugation. 2. s k = n i=1 λk i 0 for k = 1, 2,... 3. The Perron eigenvalue lies in σ. λ 1 = max{ λ i ; λ i σ}

43 / 62 Dmitriev, Dynkin, 1946 If λ 1 is the Perron eigenvalue of a nonnegative matrix with spectrum (λ 1,..., λ n ), then for j = 2,..., n : Re(λ j ) + Im(λ j ) λ 1.

44 / 62 Johnson (1980), Loewy and London (1978) for all positive integers k, m. n k 1 s km s k m

45 / 62 Goldberger, Neumann, 2008 Proved the following necessary condition conjectured by Boyle and Handelman. If σ = (λ 1,..., λ k, 0,..., 0) is realizable, then: k (x λ j ) x k λ k 1, j=1 for all x λ 1, where λ 1 is the Perron root.

46 / 62 Let B be an M matrix or inverse M matrix with characteristic polynomial Holtz (2005) proved that if then Newton s inequalities hold. f (x) = x n + p 1 x n 1 +... + p n. q 0 = 1, q i = ( 1)i p i ( ni ), i 1 q 2 i q i 1 q i+1, 1 = 1, 2, 3,...

47 / 62 If A is a nonnegative matrix with Perron root ρ, then taking B = ρi A yields a set of inequalities on the coefficients of the polynomial Π n j=1 (x λ j) which are necessary for the realizability of σ = (λ 1,..., λ n ). Holtz shows that these inequalities are not in general consequences of the other known necessary conditions.

48 / 62 Guo, 1997 If (λ 2,..., λ 3 ) is a list of complex numbers closed under complex conjugation, then there is a least real number λ 1 0 such that (h, λ 2,..., λ n ) is realizable for all h λ 1.

49 / 62 Laffey, 1998 Let σ = (λ 1,..., λ n ) be realizable. σ is extreme if for all ɛ > 0 is not realizable. (λ 1 ɛ, λ 2 ɛ..., λ n ɛ) σ is Perron extreme if for all ɛ > 0 is not realizable. (λ 1 ɛ, λ 2,..., λ n )

50 / 62 Laffey, 1998 Suppose σ is an extreme spectrum and A is a realizing matrix for A. Then there exists a nonzero nonnegative matrix Y with AY = YA and trace(ay ) = 0. Result also hold for symmetric realizations and for Perron extreme spectra. Used by Laffey, Meehan to solve NIEP for n = 4 and by Loewy, McDonald to study SNIEP for n = 5.

51 / 62 Open Problem In the case that s 1 = 0, Y = I satisfies the above conditions, so finding a more restrictive concept of extremality with some similar commuting result in the trace 0 case would be welcome.

Open Questions 52 / 62

53 / 62 Guo for symmetric matrices. Suppose that σ = (λ 1, λ 2,..., λ n ) is the spectrum of a nonnegative symmetric matrix with Perron root λ 1, and let t > 0. Must σ = (λ 1 + t, λ 2 t,..., λ n ) be the spectrum of a nonnegative symmetric matrix.

54 / 62 Suppose that (λ 1, λ 2, λ 2,..., λ n ) is realizable with Perron root λ 1 and t > 0. Must (λ 1 + 2t, λ 2 + t, λ 2, +t,..., λ n ) be realizable.

Find a good definition of extremality with an associated commutation result in the trace 0 case. 55 / 62

Find a constructive proof of the Boyle- Handelman theorem with a good bound on the number N of zeros that need to be appended to a given list for realizability. 56 / 62

Get better understanding of the influence of adding zeros to the spectrum in the case of the SNIEP. 57 / 62

Make further progress on complete solutions of the NIEP and SNIEP for n = 5, 6,... 58 / 62

The NIEP for real spectra. 59 / 62

Find matrix patterns which accommodate every realizable spectrum and have nice properties (For example, their characteristic polynomials are easy to compute, as for matrices close to companion matrices, they are sparse,...). 60 / 62

Obtain better bounds on spectral gap 61 / 62

Distinguish between realizable spectra and those realizable by positive matrices. Borobia-Moro, 1998 62 / 62