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