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 matrices A ∈ R such that A and its transpose have the Perron-Frobenius property. Necessary conditions and sufficient conditions for a matrix function to preserve the set of n× n real eventually nonnegative ...

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 matrices A ∈ R such that A and its transpose have the Perron-Frobenius property. Necessary conditions and sufficient conditions for a matrix function to preserve the set of n× n real eventually nonnegative ...

This paper presents a nonnegative subspace approach for packet loss concealment problem. The magnitude spectrogram of speech signal is projected onto nonnegative subspace using nonnegative matrix factorization algorithm. Consequently, packet loss concealment problem is transformed to linear interpolation of the projective coefficients in nonnegative subspace. Simulation examples, objective test...

in this paper we study the almost universal convergence of weighted sums for sequence {x ,n } of negatively dependent (nd) uniformly bounded random variables, where a, k21 is an may of nonnegative real numbers such that 0(k ) for every ?> 0 and e|x | f | =0 , f = ?(x ,…, x ) for every n>l.

We consider the problem of constructing nonnegative matrices with prescribed extremal singular values. In particular, given 2n−1 real numbers σ ( j) 1 and σ ( j) j , j = 1, . . . , n, we construct an n×n nonnegative bidiagonal matrix B and an n×n nonnegative semi-bordered diagonal matrix C , such that σ ( j) 1 and σ ( j) j are, respectively, the minimal and the maximal singular values of certai...

A matrix is binary if each of its entries is either 0 or 1. The binary rank of a nonnegative integer matrix A is the smallest integer b such that A = BC, where B and C are binary matrices, and B has b columns. In this paper, bounds for the binary rank are given, and nonnegative integer matrices that attain the lower bound are characterized. Moreover, binary ranks of nonnegative integer matrices...

We consider the nonnegative inverse eigenvalue problem with partial eigendata, which aims to find a nonnegative matrix such that it is nearest to a pre-estimated nonnegative matrix and satisfies the prescribed eigendata. In this paper, we propose several iterative schemes based on the alternating direction method of multipliers for solving the nonnegative inverse problem. We also extend our sch...

The purpose of this paper is to present a unified Perron-Frobenius Theory for nonnegative, for real not necessarily nonnegative and for general complex matrices. The sign-real spectral radius was introduced for general real matrices. This quantity was shown to share certain properties with the Perron root of nonnegative matrices. In this paper we introduce the sign-complex spectral radius. Agai...

Given a nonnegative matrix M , the orthogonal nonnegative matrix factorization (ONMF) problem consists in finding a nonnegative matrix U and an orthogonal nonnegative matrix V such that the product UV is as close as possible to M . The importance of ONMF comes from its tight connection with data clustering. In this paper, we propose a new ONMF method, called ONP-MF, and we show that it performs...

In this paper, we derive the necessary and sufficient conditions for the quaternion matrix equation XA=B to have the least-square bisymmetric solution and give the expression of such solution when the solvability conditions are met. Futhermore, we consider the maximal and minimal inertias of the least-square bisymmetric solution to this equation. As applications, we derive sufficient and necess...