2007Operators and MatricesOpen access

Optimization of the spectral radius of nonnegative matrices

Michael Neumann, Nung-Sing Sze

Open full text 6 citations

Abstract

In a recent paper by Axtell, Han, Hershkowitz, and the present authors, one of the main questions that was considered was finding nn doubly stochastic matrices P and Q which solve the multiplicative extremal spectral radius problems min Sn (SA) and max Sn (SA) , respectively. Here A R n,n is an arbitrary, but fixed, n n nonnegative matrix, () is the spectral radius of a matrix, and n is the set of all n n doubly stochastic matrices. It was shown there that the solution to both problems is attained at some permutation matrix. In this paper we consider an additive version of these problems, namely, of solving the additive extremal spectral radius problems min Sn (S + A) and max Sn (S + A) . As a by product of, actually, solutions to more general spectral radius optimization problems, we obtain here that the solution to both additive spectral radius optimization problems is, once again, attained at some permutation matrix. One of the more general spectral radius optimization problems that we consider here is that of replacing the constrains that the optimization be done on the doubly stochastic matrices by the weaker constraint of optimizing just on the n n column or row stochastic matrices.

Open-access reader

About this research paper

What this paper is about

In a recent paper by Axtell, Han, Hershkowitz, and the present authors, one of the main questions that was considered was finding nn doubly stochastic matrices P and Q which solve the multiplicative extremal spectral radius problems min Sn (SA) and max Sn (SA) , respectively. Here A R n,n is an arbitrary, but fixed, n n nonnegative matrix, () is the spectral radius of a matrix, and n is the set of all n n doubly stochastic matrices. It was shown there that the solution to both problems is attained at some permutation matrix. In this paper we consider an additive version of these problems, namely, of solving the additive extremal spectral radius problems min Sn (S + A) and max Sn (S + A) . As a by product of, actually, solutions to more general spectral radius optimization problems, we obtain here that the solution to both additive spectral radius optimization problems is, once again, attained at some permutation matrix. One of the more general spectral radius optimization problems that we consider here is that of replacing the constrains that the optimization be done on the doubly stochastic matrices by the weaker constraint of optimizing just on the n n column or row stochastic matrices.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In a recent paper by Axtell, Han, Hershkowitz, and the present authors, one of the main questions that was considered was finding nn doubly stochastic matrices P and Q which solve the multiplicative extremal spectral radius problems min Sn (SA) and max Sn (SA) , respectively. Here A R n,n is an arbitrary, but fixed, n n nonnegative matrix, () is the spectral radius of a matrix, and n is the set of all n n doubly stochastic matrices. It was shown there that the solution to both problems is attained at some permutation matrix. In this paper we consider an additive version of these problems, namely, of solving the additive extremal spectral radius problems min Sn (S + A) and max Sn (S + A) . As a by product of, actually, solutions to more general spectral radius optimization problems, we obtain here that the solution to both additive spectral radius optimization problems is, once again, attained at some permutation matrix. One of the more general spectral radius optimization problems that we consider here is that of replacing the constrains that the optimization be done on the doubly stochastic matrices by the weaker constraint of optimizing just on the n n column or row stochastic matrices.

Key concepts: Mathematics, Spectral radius, RADIUS, Pure mathematics, Combinatorics, Eigenvalues and eigenvectors, Physics, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Optimization of the spectral radius of nonnegative matrices — Research Paper | ScholarLens