Nonnegative realization of spectra having negative real parts

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 matrix. In this paper the problem is completely solved in the case when all numbers in the given list σ except for one (the Perron eigenvalue) have real parts smaller than or equal to zero.     

Isospectral flow method for nonnegative inverse eigenvalue problem with prescribed structure

The nonnegative inverse eigenvalue problem is that given a family of complex numbers λ={λ₁,…,λ_n}, find a nonnegative matrix of order n with spectrum λ. This problem is difficult and remains unsolved partially. In this paper, we focus on its generalization that the reconstructed nonnegative matrices should have some prescribed entries. It is easy to see that this new problem will come back to the common nonnegative inverse eigenvalue problem if there is no constraint of the locations of entries. A numerical isospectral flow method which is developed by hybridizing the optimization theory and steepest descent method is used to study the reconstruction. Moreover, an error estimate of the numerical iteration for ordinary differential equations on the matrix manifold is presented. After that, a numerical method for the nonnegative symmetric inverse eigenvalue problem with prescribed entries and its error estimate are considered. Finally, the approaches are verified by the numerical test results.     

矩阵与其友矩阵相似的一个充要条件及其证明

得到一个矩阵A与其特征多项式的友矩阵C相似的充要条件是对应于A的每个不同的特征值λi,Jordan标准形中只含有一个Jordan子矩阵,并给出证明.     

A note on characterizations of irreducibility of nonnegative matrices

Three sufficient conditions for the irreducibility of a matrix A are given, which for nonnegative A are also necessary.     

Drazin-monotonicity characterizations for property-n matrices

A square matrix A is said to have property n if there exists a nonnegative power of A. In this paper, necessary and sufficient conditions for such matrices to have a nonnegative Drazin inverse are presented.     

Sign patterns for eigenmatrices of nonnegative matrices

For a square (0,?1,??1) sign pattern matrix S, denote the qualitative class of S by Q(S). In this article, we investigate the relationship between sign patterns and matrices that diagonalize an irreducible nonnegative matrix. We explicitly describe the sign patterns S such that every matrix in Q(S) diagonalizes some irreducible nonnegative matrix. Further, we characterize the sign patterns S such that some member of Q(S) diagonalizes an irreducible nonnegative matrix. Finally, we provide necessary and sufficient conditions for a multiset of real numbers to be realized as the spectrum of an irreducible nonnegative matrix M that is diagonalized by a matrix in the qualitative class of some S ² NS sign pattern.     

Robustness of F-tests in singular linear models

F-test is the most popular test in the general linear model. However, there is few discussions on the robustness of F-test under the singular linear model. In this paper, the necessary and sufficient conditions of robust F-test statistic are given under the general linear models or their partition models, which allows that the design matrix has deficient rank and the covariance matrix of error is a nonnegative definite matrix with parameters. The main results obtained in this paper include the existing findings of the general linear model under the definite covariance matrix. The usage of the theorems is illustrated by an example.     

Imbedding conditions for λ-matrices

We say that A(λ) is λ-imbeddable in B(λ) whenever B(λ) is equivalent to a λ-matrix having A(λ) as a submatrix. In this paper we solve the problem of finding a necessary and sufficient condition for A(λ) to be λ-imbeddable in B(λ). The solution is given in terms of the invariant polynomials of A(λ) and B(λ). We also solve an analogous problem when A(λ) and B(λ) are required to be equivalent to regular λ-matrices. As a consequence we give a necessary and sufficient condition for the existence of a matrix B, over a field F, with prescribed similarity invariant polynomials and a prescribed principal submatrix A.     

Factorization of nonnegative matrices—II

Suppose A is an n×n nonnegative matrix. Necessary and sufficient conditions are given for A to be factored as LU, where L is a lower triangular nonnegative matrix, and U is an upper triangular nonnegative matrix with u_ii = 1.     

Convolution operators on Lebesgue spaces of an n-dimensional cube

This paper is concerned with the problem of diagonally scaling a given nonnegative matrix a to one with prescribed row and column sums. The approach is to represent one of the two scaling matrices as the solution of a variational problem. This leads in a natural way to necessary and sufficient conditions on the zero pattern of a so that such a scaling exists. In addition the convergence of the successive prescribed row and column sum normalizations is established. Certain invariants under diagonal scaling are used to actually compute the desired scaled matrix, and examples are provided. Finally, at the end of the paper, a discussion of infinite systems is presented.     

Perturbing non-real eigenvalues of non-negative real matrices

Let σ=(ρ,b+ic,b-ic,λ₄,…,λ_n) be the spectrum of an entry non-negative matrix and t?0. Laffey [T. J. Laffey, Perturbing non-real eigenvalues of nonnegative real matrices, Electron. J. Linear Algebra 12 (2005) 73-76] has shown that σ=(ρ+2t,b-t+ic,b-t-ic,λ₄,…,λ_n) is also the spectrum of some nonnegative matrix. Laffey (2005) has used a rank one perturbation for small t and then used a compactness argument to extend the result to all nonnegative t. In this paper, a rank two perturbation is used to deduce an explicit and constructive proof for all t?0.     

An alternating direction algorithm for matrix completion with nonnegative factors

This paper introduces an algorithm for the nonnegative matrix factorization-and-completion problem, which aims to find nonnegative low-rank matrices X and Y so that the product XY approximates a nonnegative data matrix M whose elements are partially known (to a certain accuracy). This problem aggregates two existing problems: (i) nonnegative matrix factorization where all entries of M are given, and (ii) low-rank matrix completion where nonnegativity is not required. By taking the advantages of both nonnegativity and low-rankness, one can generally obtain superior results than those of just using one of the two properties. We propose to solve the non-convex constrained least-squares problem using an algorithm based on the classical alternating direction augmented Lagrangian method. Preliminary convergence properties of the algorithm and numerical simulation results are presented. Compared to a recent algorithm for nonnegative matrix factorization, the proposed algorithm produces factorizations of similar quality using only about half of the matrix entries. On tasks of recovering incomplete grayscale and hyperspectral images, the proposed algorithm yields overall better qualities than those produced by two recent matrix-completion algorithms that do not exploit nonnegativity.     

On linear integral operators with nonnegative kernels

Let K be an eventually compact linear integral operator on $\text{L}{}^{\mathrm{p}}\text{(Ω, μ), 1 ? p < ∞}$, with nonnegative kernel k(x, y), where the underlying measure μ is totally σ-finite on the domain set Ω when p = 1. In considering the equation λf = Kf + g for given nonnegative $\text{g ? L}{}^{\mathrm{p}}\text{(Ω, μ), λ > 0}$, P. Nelson, Jr. provided necessary and sufficient conditions, in terms of the support of g, such that a nonnegative solution $\text{f ? L}{}^{\mathrm{p}}\text{(Ω, μ)}$ was attained. Such conditions led to generalizing some of the graph-theoretic ideas associated with the normal form of a nonnegative reducible matrix. The purpose of this paper is to show that the analysis by Nelson can be enlarged to provide a more complete generalization of the normal form of a nonnegative matrix which can be used to characterize the distinguished eigenvalues of K and K¹, and to describe sets of support for the eigenfunctions and generalized eigenfunctions of both K and K¹ belonging to the spectral radius of K.     

Products of irreducible matrices

In this paper we characterize the subsemigroup of B_n (B_n is the multiplicative semigroup of n × n Boolean matrices) generated by all the irreducible matrices, and hence give a necessary and sufficient condition for a Boolean matrix A to be a product of irreducible Boolean matrices. We also give a necessary and sufficient condition for an n × n nonnegative matrix to be a product of nonnegative irreducible matrices.     

On some solutions of Ak = dI + λj

In this paper, a necessary and sufficient condition for a (0, 1) g-circulant A to satisfy the matrix equation A^k = dI + λJ is given. Explicit solutions are given for several equations. Some nonexistence theorems are also proved.     

On inverse spectrum problems for normal nonnegative matrices

For a set σ with n complex numbers, some sufficient conditions are found for σ to be the spectrum of an n ×n normal (entrywise) nonnegative (positive) matrix. After proving a fundamental theorem and introducing the companion set σ′ of σ which consists of real numbers, we prove that if σ′ satisfies any known sufficient conditions for a real set to be the spectrum of a nonnegative matrix introduced by Suleimanova, Perfect, Salzmann and Kellogg respectively, then σ is the spectrum of an n×n normal nonnegative matrix.     

关于与给定矩阵可交换的矩阵的多项式表示

文[1]得到:若矩阵A的Jordan标准形中没有纯量矩阵的Jordan块,那么AB=BA的充要条件为B可以化为A的n-1次多项式.本文指出这个结论是错误的.在已有相关文献的基础上,得到了与给定矩阵A可交换的矩阵B是A的多项式的十个等价刻划.     

Sums of values represented by a quadratic form

Let q be a quadratic form over a field K of characteristic different from 2. We investigate the properties of the smallest positive integer n such that ?1 is a sum of n values represented by q in several situations. We relate this invariant (which is called the q-level of K) to other invariants of K such as the level, the u-invariant and the Pythagoras number of K. The problem of determining the numbers which can be realized as a q-level for particular q or K is studied. We also observe that the q-level naturally emerges when one tries to obtain a lower bound for the index of the subgroup of non-zero values represented by a Pfister form q. We highlight necessary and/or sufficient conditions for the q-level to be finite. Throughout the paper, special emphasis is given to the case where q is a Pfister form.