Dimension group of a non-negative integer irreducible matrix

In this paper we are concerned with a non-negative integer and irreducible matrix $A:{\mathbb{Z}}^d\to {\mathbb{Z}}^d$. The main contribution is to prove that if the matrix satisfies certain spectral and algebraic constraints, the cone:$C=\{v\in {\mathbb{Z}}^d/\exists n⩾0\mathrm{and}{A}^{n}v⩾0\}\subset {\mathbb{Z}}^d$is defined by linear maps ${\varphi }_0\text{,}\dots \text{,}{\varphi }_{k-1}:{\mathbb{Z}}^d\to \mathbb{R}$, in the sense that v ∈ C is equivalent to, ϕ_l(v) ⩾ 0 for all l = 0, … , k − 1 (where k is the index of cyclicity of the irreducible matrix). This result allows us to characterize the dimension group generated by the matrix, it is a subgroup of ${\mathbb{R}}^k$ endowed with an order induced by the positive cone of ${\mathbb{R}}^k$.     

An inequality for nonnegative matrices and the inverse eigenvalue problem

We present two versions of the same inequality, relating the maximal diagonal entry of a nonnegative matrix to its eigenvalues. We demonstrate a matrix factorization of a companion matrix, which leads to a solution of the nonnegative inverse eigenvalue problem (denoted the nniep) for 4×4 matrices of trace zero, and we give some sufficient conditions for a solution to the nniep for 5×5 matrices of trace zero. We also give a necessary condition on the eigenvalues of a 5×5 trace zero nonnegative matrix in lower Hessenberg form. Finally, we give a brief discussion of the nniep in restricted cases.     

A sufficient condition for a non-negative matrix to have non-negative determinant

It is shown that a matrix with non-negative entries has non-negative determinant if in each row the elements decrease, by steadily smaller amounts, as one proceeds (in either direction) away from the main diagonal. This condition suffices to establish non- negativity of the determinant for certain matrices to which the familiar Minkowski- Hadamard-Ostrowski dominance conditions do not apply. In the symmetric case it provides a sufficient condition for non-negative definiteness. This may be applied to establish the positive definiteness of certain real symmetric Toeplitz matrices.     

An inequality for complex matrices

It is shown that the inequality implies that the matrix $\text{(}\text{A}\text{=(a}{}_{\mathrm{ij}}\text{))}$ is invertible with 6A^-16 ? 6A6. The result extends to linear operators on a complex Hilbert space with conjugation.     

Decomposably non-negative matrices

Let A be an mn- by - mn symmetric matrix. Partition A into m²n - by - n blocks and suppose that each of these blocks is also symmetric. Suppose that for every decomposable (rank one) tensor ν ⊗ w, we have (ν ⊗ w)^t A(ν otimes; w) ≥ 0. Here, ν is a column m-tuple and w is a column n-tuple. We study the maximum number of negative eigenvalues such a matrix can have, as well as obtaining alternative characterizations of such matrices.     

An asymptotic representation for products of random matrices

Let {X_k} be a stationary ergodic sequence of nonnegative matrices. It is shown in this paper that, under mild additional conditions, the logarithm of the i, jth element of X_t···X₁ is well approximated by a sum of t random variables from a stationary ergodic sequence. This representation is very useful for the study of limit behaviour of products of random matrices. An iterated logarithm result and an estimation result of use in the theory of demographic population projections are derived as corollaries.     

Completely normal matrices

Normal matrices in which all submatrices are normal are said to be completely normal. We characterize this class of matrices, determine the possible inertias of a particular completely normal matrix, and show that real matrices in this class are closed under (general) Schur complementation. We provide explicit formulas for the Moore–Penrose inverse of a completely normal matrix of size at least four. A result on irreducible principally normal matrices is derived as well.     

由n次幂等矩阵确定的交换幺半群

设R是含幺结合环,n≥2为自然数.对所有的k≥1,本文给出了n次幂等矩阵集Pk^n（R）={P｜P^n=P∈Mk（R）}上的一种等价关系,证明了P^n（R）=∪k=1^∞Pk^n（R）中的等价类在给定的加法运算下构成一个交换幺半群.     

Standard triangularization of semigroups of non-negative operators

We show that, under mild conditions, a semigroup of non-negative operators on L^p(X,μ) (for 1?p<∞) of the form scalar plus compact is triangularizable via standard subspaces if and only if each operator in the semigroup is individually triangularizable via standard subspaces. Also, in the case of operators of the form identity plus trace class we show that triangularizability via standard subspaces is equivalent to the submultiplicativity of a certain function on the semigroup.     

Chains of dog-ears for completely positive matrices

A necessary and sufficient condition to determine the complete positivity of a matrixwith a particular graph, in dependence of complete positivity of smaller matrices, is given. Under some singularity assumptions, this condition furnishes a characterization for completely positive matrices with a “non-crossing cycle” as associated graph. In particular the characterization holds for singular pentadiagonal matrices.     

An algorithm to find formulae and values of minors for Hadamard matrices

We give an algorithm to obtain formulae and values for minors of Hadamard matrices. One step in our algorithm allows the (n−j)×(n−j) minors of a Hadamard matrix to be given in terms of the minors of a 2^j−1×2^j−1 matrix. In particular we illustrate our algorithm by finding explicitly all the (n−4)×(n−4) minors of a Hadamard matrix.     

广义对角占优阵的一个等价条件

给出了实方阵为广义对角占优阵的充要条件,同时给出了判断广义对角占优阵可靠,可行,较简单方法。     

Immanant positivity for Catalan-Stieltjes matrices

We give some sufficient conditions for the nonnegativity of immanants of square submatrices of Catalan-Stieltjes matrices and their corresponding Hankel matrices. To obtain these sufficient conditions, we construct new planar networks with a recursive nature for Catalan-Stieltjes matrices. As applications, we provide a unified way to produce inequalities for many combinatorial polynomials, such as the Eulerian polynomials, Schröder polynomials, and Narayana polynomials.     

Inversion of conjugate-Toeplitz matrices and conjugate-Hankel matrices

The inverses of conjugate-Toeplitz (CT) and conjugate-Hankel (CH) matrices can be expressed by the Gohberg–Heinig type formula. We obtain an explicit inverse formula of CT matrix. Similarly, the formula and the decomposition of the inverse of a CH matrix are provided. Also the stability of the inverse formulas of CT and CH matrices are discussed. Examples are provided to verify the feasibility of the algorithms.     

Approximation of high-dimensional kernel matrices by multilevel circulant matrices

Kernels are important in developing a variety of numerical methods, such as approximation, interpolation, neural networks, machine learning and meshless methods for solving engineering problems. A common problem of these kernel-based methods is to calculate inverses of kernel matrices generated by a kernel function and a set of points. Due to the denseness of these matrices, finding their inverses is computationally costly. To overcome this difficulty, we introduce in this paper an approximation of the kernel matrices by appropriate multilevel circulant matrices so that the fast Fourier transform can be applied to reduce the computational cost. Convergence analysis for the proposed approximation is established based on certain decay properties of the kernels.     

The question of equivalence for generalized Hausdorff matrices

In the present paper we investigate when Hausdorff matrices and generalized Hausdorff matrices, with the same mass function, are equivalent, as bounded operators on c and ?p.