On zero-pattern invariant properties of structured matrices

It is interesting that inverse M-matrices are zero-pattern (power) invariant. The main contribution of the present work is that we characterize some structured matrices that are zero-pattern (power) invariant. Consequently, we provide necessary and sufficient conditions for these structured matrices to be inverse M-matrices. In particular, to check if a given circulant or symmetric Toeplitz matrix is an inverse M-matrix, we only need to consider its pattern structure and verify that one of its principal submatrices is an inverse M-matrix.     

Classes of general H-matrices

Let M(A) denote the comparison matrix of a square H-matrix A, that is, M(A) is an M-matrix. H-matrices such that their comparison matrices are nonsingular are well studied in the literature. In this paper, we study characterizations of H-matrices with either singular or nonsingular comparison matrices. The spectral radius of the Jacobi matrix of M(A) and the generalized diagonal dominance property are used in the characterizations. Finally, a classification of the set of general H-matrices is obtained.     

LU decomposition of M-matrices by elimination without pivoting

It is shown that if A or ?A is a singular M-matrix satisfying the generalized diagonal dominance condition y^TA?0 for some vector y? 0, then A can be factored into A = LU by a certain elimination algorithm, where L is a lower triangular M-matrix with unit diagonal and U is an upper triangular M-matrix. The existence of LU decomposition of symmetric permutations of A and for irreducible M-matrices and symmetric M-matrices follow as colollaries. This work is motivated by applications to the solution of homogeneous systems of linear equations Ax = 0, where A or ?A is an M-matrix. These applications arise, e.g., in the analysis of Markov chains, input-output economic models, and compartmental systems. A converse of the theorem metioned above can be established by considering the reduced normal form of A.     

Q-matrices and spherical geometry

A real n × n matrix M is a Q-matrix if the linear complementarity problem w ? Mz=q, w ? 0, z ? 0, w^tz=0 has a solution for all real n-vectors q. M is nondegenerate if all its principal minors are nonzero. Spherical geometry is applied to the problem of characterizing nondegenerate Q-matrices. The stability of 3 × 3 nondegenerate Q-matrices and a generalization of the partitioning property of P-matrices are rather easily proved using spherical geometry. It is also proved that the set of 4 × 4 nondegenerate Q-matrices is not open.     

A generalization of N-matrices

Ky Fan defines an N-matrix to be a matrix of the form A = tI ? B, B ? 0, λ < t < ?(B), where ?(B) is the spectral radius of B and λ is the maximum of the spectral radii of all principal submatrices of B of order n ? 1. In this paper, we define the closure (N₀-matrices) of N-matrices by letting λ ? t. It is shown that if A ∈ Z and A^-1 < 0, then A ∈ N. Certain inequalities of N-matrices are shown to hold for N₀-matrices, and a method for constructing an N-matrix from an M-matrix is given.     

Matrices with a transitive graph and inverse M-matrices

The relationship between inverse M-matrices and matrices whose graph is transitive is studied. The results are applied to obtain a new proof of the characterization, due to M. Lewin and M. Neumann, of (0,1) inverse M-matrices.     

Sign determinacy of M-matrix minors

We show that if A is an M-matrix for which the length of the longest simple cycle in its associated undirected graph G(A) is at most 3, then every minor of A has determined sign (nonnegative or nonpositive), independent of the magnitudes of the matrix entries. Consequently, if A and B are M-matrices such that G(A) and G(B) are subgraphs of an undirected graph with longest simple cycle at most 3, then all principal minors of AB are nonnegative.     

Bounds for the infinity norm of the inverse for certain M- and H-matrices

The paper presents new two-sided bounds for the infinity norm of the inverse for the so-called PM-matrices, which form a subclass of the class of nonsingular M-matrices and contain the class of strictly diagonally dominant matrices. These bounds are shown to be monotone with respect to the underlying partitioning of the index set, and the equality cases are analyzed. Also an upper bound for the infinity norm of the inverse of a PH-matrix (whose comparison matrix is a PM-matrix) is derived. The known Ostrowski, Ahlberg–Nilson–Varah, and Mora?a bounds are shown to be special cases of the upper bound obtained.     

Two properties of M-matrices

If A is an M-matrix with the property that some power of A is lower triangular, then A is lower triangular. An analogue of the Minkowski determinant theorem is proved for a subclass of the M-matrices.     

On a generalized Fan inequality

It is shown that the ω- and τ-matrices, the weakly sign symmetric matrices, the R- and V-matrices, and the matrices c-equivalent to an M-matrix or to a real matrix with nonpositive off-diagonal elements, can all be characterized by the same determinantal inequality, which we call a generalized Fan inequality.     

Generalizations of M-matrices which may not have a nonnegative inverse

Generalizations of M-matrices are studied, including the new class of GM-matrices. The matrices studied are of the form sI-B with B having the Perron-Frobenius property, but not necessarily being nonnegative. Results for these classes of matrices are shown, which are analogous to those known for M-matrices. Also, various splittings of a GM-matrix are studied along with conditions for their convergence.     

The inverse positivity of perturbed tridiagonal M-matrices

A well-known property of an M-matrix M is that the inverse is element-wise non-negative, which we write as M^-1?0. In this paper, we consider element-wise perturbations of non-symmetric tridiagonal M-matrices and obtain sufficient bounds on the perturbations so that the non-negative inverse persists. These bounds improve the bounds recently given by Kennedy and Haynes [Inverse positivity of perturbed tridiagonal M-matrices, Linear Algebra Appl. 430 (2009) 2312-2323]. In particular, when perturbing the second diagonals (elements (l,l+2) and (l,l-2)) of M, these sufficient bounds are shown to be the actual maximum allowable perturbations. Numerical examples are given to demonstrate the effectiveness of our estimates.     

M-matrix characterizations.I—nonsingular M-matrices

The purpose of this survey is to classify systematically a widely ranging list of characterizations of nonsingular M-matrices from the economics and mathematics literatures. These characterizations are grouped together in terms of their relations to the properties of (1) positivity of principal minors, (2) inverse-positivity and splittings, (3) stability and (4) semipositivity and diagonal dominance. A list of forty equivalent conditions is given for a square matrix A with nonpositive off-diagonal entries to be a nonsingular M-matrix. These conditions are grouped into classes in order to identify those that are equivalent for arbitrary real matrices A. In addition, other remarks relating nonsingular M-matrices to certain complex matrices are made, and the recent literature on these general topics is surveyed.     

A trace inequality for M-matrices and the symmetrizability of a real matrix by a positive diagonal matrix

The question of whether a real matrix is symmetrizable via multiplication by a diagonal matrix with positive diagonal entries is reduced to the corresponding question for M-matrices and related to Hadamard products. In the process, for a nonsingular M-matrix A, it is shown that tr(A^-1A^T) ? n, with equality if and only if A is symmetric, and that the minimum eigenvalue of A^-1 ° A is ? 1 with equality in the irreducible case if and only if A is positive diagonally symmetrizable.     

A sensitivity analysis for linear systems involving M-matrices and its application to the Leontif model

A sensitivity analysis is made for solutions to linear equation systems involving M-matrices. We present a theorem which tells about relative changes of elements of the solution vector when the coefficients of a given M-matrix shift. The Metzler theorem and the Morishima theorem are generalized, and applied to the Leontief model.     

Completely mixed games and M-matrices

Any non-singular M-matrix is a completely mixed matrix game with positive value. We exploit this property to give game-theoretic proofs of several well-known characterizations of such matrices. The same methods yield also many theorems on S₀-irreducible matrices that are closely related to M-matrices.     

Nonnegative matrices with power invariant zero patterns

If A is a nonsingular M-matrix, the elements of the sequence {A^?k} all have the same zero pattern. Using the Drazin inverse, we show that a similar zero pattern invariance property holds for a class of matrices which is larger than the generalized M-matrices.     

Error bounds for linear complementarity problems of DB-matrices

Doubly B-matrices (DB-matrices), which properly contain B-matrices, are introduced by Peña (2003) [2]. In this paper we present error bounds for the linear complementarity problem when the matrix involved is a DB-matrix and a new bound for linear complementarity problem of a B-matrix. The numerical examples show that the bounds are sharp.     

On convertible nonnegative matrices * †

An n× nmatrix Ais called convertible if there is an n× n(1, -1)-matrix Hsuch that per A= det(H°A) where H ° Adenotes the Hadamard product of Hand A. A convertible (0,l)-matrix is called extremal if replacing any zero entry with a 1 breaks the convertibility. In this paper some properties of

nonnegative convertible matrices are investigated and some classes of extremal convertible (0,1)-matrices are obtained.     

Nonnegativity of principal minors of generalized inverses of P0-matrices

We derive a necessary and sufficient condition under which a reflexive generalized inverse of a singular P₀-matrix is again a P₀-matrix. Simpler conditions are obtained when the rank of the matrix is n?1, where n is the order of the matrix. We then consider the application of these results to singular M-matrices of order n and rank n?1. In particular, for this case we prove that the Moore-Penrose inverse is a P₀-matrix.