# Functions Preserving Nonnegativity of Matrices

@article{Bharali2008FunctionsPN,
title={Functions Preserving Nonnegativity of Matrices},
author={Gautam Bharali and Olga Holtz},
journal={SIAM J. Matrix Anal. Appl.},
year={2008},
volume={30},
pages={84-101}
}
• Published 13 November 2005
• Computer Science, Mathematics
• SIAM J. Matrix Anal. Appl.
The main goal of this work is to determine which entire functions preserve nonnegativity of matrices of a fixed order $n$—i.e., to characterize entire functions $f$ with the property that $f(A)$ is entrywise nonnegative for every entrywise nonnegative matrix $A$ of size $n\times n$. Toward this goal, we present a complete characterization of functions preserving nonnegativity of (block) upper-triangular matrices and those preserving nonnegativity of circulant matrices. We also derive necessary…

## Topics from this paper

Preserving positivity for rank-constrained matrices
• Mathematics
• 2017
Entrywise functions preserving the cone of positive semidefinite matrices have been studied by many authors, most notably by Schoenberg [Duke Math. J. 9, 1942] and Rudin [Duke Math. J. 26, 1959].
Preserving positivity for matrices with sparsity constraints
• Mathematics
• 2014
Functions preserving Loewner positivity when applied entrywise to positive semidefinite matrices have been widely studied in the literature. Following the work of Schoenberg [Duke Math. J. 9], Rudin
Matrix functions preserving sets of generalized nonnegative matrices
• Mathematics
• 2010
Matrix functions preserving several sets of generalized nonnegative matrices are characterized. These sets include PFn, the set of n × n real eventually positive matrices; and WPFn, the set of
Polynomials that preserve nonnegative matrices of order two
• Mathematics
• 2021
A known characterization for entire functions that preserve all nonnegative matrices of order two is shown to characterize polynomials that preserve nonnegative matrices of order two. Equivalent
A family of realizability criteria for the real and symmetric nonnegative inverse eigenvalue problem
• R. Soto
• Mathematics, Computer Science
Numer. Linear Algebra Appl.
• 2013
It is proved that this new realizability criterion for the real nonnegative inverse eigenvalue problem is easily adaptable to be sufficient for the construction of a symmetric nonnegative matrix with given spectrum.
On nonnegative realization of partitioned spectra
• Mathematics
• 2011
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
ELA ON NONNEGATIVE REALIZATION OF PARTITIONED SPECTRA
• 2011
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
A Note on the Symmetric Nonnegative Inverse Eigenvalue Problem 1
• Mathematics
• 2011
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
The NIEP
• Mathematics
• 2017
The nonnegative inverse eigenvalue problem (NIEP) asks which lists of n complex numbers (counting multiplicity) occur as the eigenvalues of some n-by-n entry-wise nonnegative matrix. The NIEP has a
Roots of Stochastic Matrices and Fractional Matrix Powers
In Markov chain models in finance and healthcare a transition matrix over a certain time interval is needed but only a transition matrix over a longer time interval may be available. The problem

## References

SHOWING 1-10 OF 57 REFERENCES
On computing minimal realizable spectral radii of non-negative matrices
• Mathematics, Computer Science
Numer. Linear Algebra Appl.
• 2005
A simple bisection procedure to approximate the location of ℛ(ℒ) is proposed, which offers a quick numerical way to check whether a given n-tuple could be the spectrum of a certain non-negative matrix.
Existence and construction of nonnegative matrices with prescribed spectrum
Abstract We consider the following inverse spectrum problem for nonnegative matrices: given a set of real numbers σ={λ1,λ2,…,λn}, find necessary and sufficient conditions for the existence of an n×n
On the comparison of some realizability criteria for the real nonnegative inverse eigenvalue problem
• Mathematics
• 2005
Abstract A result by Brauer shows how to modify one single eigenvalue of a matrix via a rank-one perturbation, without changing any of the remaining eigenvalues. This, together with the properties of
Construction of nonnegative matrices and the inverse eigenvalue problem
This article presents a technique for combining two matrices, an n × n matrix M and an m × m matrix B, with known spectra to create an (n + m − p) × (n + m − p) matrix N whose spectrum consists of
Row Stochastic Matrices Similar to Doubly Stochastic Matrices
The problem of determining which row stochastic n-by-n matrices are similar to doubly stochastic matrices is considered. That not all are is indicated by example, and an abstract characterization as
The inverse eigenvalue problem for nonnegative matrices
Abstract Let A be a nonnegative matrix with spectrum ( λ 1 , λ 2 ,…, λ m ) and B be a nonnegative matrix with spectrum ( μ 1 , μ 2 ,…, μ n ), where μ 1 is the Perron eigenvalue of B . Furthermore,
Nonnegative realization of spectra having negative real parts
• Mathematics
• 2006
Abstract The nonnegative inverse eigenvalue problem (NIEP) is the problem of determining necessary and sufficient conditions for a list of complex numbers σ to be the spectrum of a nonnegative
Resolution of the Symmetric Nonnegative Inverse Eigenvalue Problem for Matrices Subordinate to a Bipartite Graph
• Mathematics
• 2004
There is a symmetric nonnegative matrix A, subordinate to a given bipartite graph G on n vertices, with eigenvalues λ1≥λ2≥≥λn if and only if, λ1 + λn≥0, λ2 + λn-1≥0,...,λm + λn - m + 1≥0, λm +
The nonnegative inverse eigenvalue problem
• Mathematics
• 2004
Abstract Let σ =( λ 1 ,…, λ n ) be a list of complex numbers. The nonnegative inverse eigenvalue problem (NIEP) is the problem of determining necessary and sufficient conditions in order that σ be
On an inverse problem for nonnegative and eventually nonnegative matrices
Let σ= (λ1,···λn)⊂C. We discuss conditions for which σ is the spectrum of a nonnegative or eventually nonnegative matrix. This brings us to study rational functions with nonnegative Maclaurin