Characterizations of inverse M-matrices with special zero patterns

In this paper, we provide some characterizations of inverse M-matrices with special zero patterns. In particular, we give necessary and sufficient conditions for k-diagonal matrices and symmetric k-diagonal matrices to be inverse M-matrices. In addition, results for triadic matrices, tridiagonal matrices and symmetric 5-diagonal matrices are presented as corollaries.     

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.     

Lower bounds for the minimum eigenvalue of Hadamard product of an M-matrix and its inverse

For the Hadamard product A ° A⁻¹ of an M-matrix A and its inverse A⁻¹, we give new lower bounds for the minimum eigenvalue of A ° A⁻¹. These bounds are strong enough to prove the conjecture of Fiedler and Markham [An inequality for the Hadamard product of an M-matrix and inverse M-matrix, Linear Algebra Appl. 101 (1988) 1-8].     

On the inverses of general tridiagonal matrices

In this work, the sign distribution for all inverse elements of general tridiagonal H-matrices is presented. In addition, some computable upper and lower bounds for the entries of the inverses of diagonally dominant tridiagonal matrices are obtained. Based on the sign distribution, these bounds greatly improve some well-known results due to Ostrowski (1952) 23, Shivakumar and Ji (1996) 26, Nabben (1999) [21] and [22] and recently given by Peluso and Politi (2001) 24, Peluso and Popolizio (2008) 25 and so forth. It is also stated that the inverse of a general tridiagonal matrix may be described by 2n-2 parameters ( and ) instead of 2n+2 ones as given by El-Mikkawy (2004) 3, El-Mikkawy and Karawia (2006) 4 and Huang and McColl (1997) 10. According to these results, a new symbolic algorithm for finding the inverse of a tridiagonal matrix without imposing any restrictive conditions is presented, which improves some recent results. Finally, several applications to the preconditioning technology, the numerical solution of differential equations and the birth-death processes together with numerical tests are given.     

New lower bounds on eigenvalue of the Hadamard product of an M-matrix and its inverse

Some new lower bounds for the minimum eigenvalue of the Hadamard product of an M-matrix and its inverse are given. These bounds improve the results of [H.B. Li, T.Z. Huang, S.Q. Shen, H. Li, Lower bounds for the minimum eigenvalue of Hadamard product of an M-matrix and its inverse, Linear Algebra Appl. 420 (2007) 235-247].     

Some new bounds on the spectral radius of matrices

A new lower bound on the smallest eigenvalue τ(AB) for the Fan product of two nonsingular M-matrices A and B is given. Meanwhile, we also obtain a new upper bound on the spectral radius ρ(A°B) for nonnegative matrices A and B. These bounds improve some results of Huang (2008) [R. Huang, Some inequalities for the Hadamard product and the Fan product of matrices, Linear Algebra Appl. 428 (2008) 1551-1559].     

Monotone positive stable matrices

The class of real matrices which are both monotone (inverse positive) and positive stable is investigated. Such matrices, called N-matrices, have the well-known class of nonsingular M-matrices as a proper subset. Relationships between the classes of N-matrices, M-matrices, nonsingular totally nonnegative matrices, and oscillatory matrices are developed. Conditions are given for some classes of matrices, including tridiagonal and some Toeplitz matrices, to be N-matrices.     

Inverse M-matrices, II

This is an update of the 1981 survey by the first author. In the meantime, a considerable amount has been learned about the very special structure of the important class of inverse M-matrices. Developments since the earlier survey are emphasized, but we have tried to be somewhat complete; and, some results have not previously been published. Some proofs are given where appropriate and references are given for others. After some elementary preliminaries, results are grouped by certain natural categories.     

On the inverse mean first passage matrix problem and the inverse M-matrix problem

The inverse mean first passage time problem is given a positive matrix M∈R^n,n, then when does there exist an n-state discrete-time homogeneous ergodic Markov chain C, whose mean first passage matrix is M? The inverse M-matrix problem is given a nonnegative matrix A, then when is A an inverse of an M-matrix. The main thrust of this paper is to show that the existence of a solution to one of the problems can be characterized by the existence of a solution to the other. In so doing we extend earlier results of Tetali and Fiedler.     

A Hadamard product involving N-matrices

We show that for any pair M,N of n by n M-matrices, the Hadamard (entry-wise) product M°N _-1 is again an M-matrix. For a single M-matrix M, the matrix M°M ^-1 is also considered.     

Some inequalities for the Hadamard product and the Fan product of matrices

If A and B are nonsingular M-matrices, a sharp lower bound on the smallest eigenvalue τ(A★B) for the Fan product of A and B is given, and a sharp lower bound on τ(A°B^-1) for the Hadamard product of A and B^-1 is derived. In addition, we also give a sharp upper bound on the spectral radius ρ(A°B) for nonnegative matrices A and B.     

Lipschitz stability of controlled invariant subspaces

Let (A,B)∈C^n×n×C^n×m and M be an (A, B)-invariant subspace. In this paper the following results are presented: (i) If M∩ImB={0}, necessary and sufficient conditions for the Lipschitz stability of M are given. (ii) If M contains the controllability subspace of the pair (A, B), sufficient conditions for the Lipschitz stability of the subspace M are given.     

Tridiagonal and upper triangular inverse M-matrices

In this paper we characterize the nonnegative nonsingular tridiagonal matrices belonging to the class of inverse M-matrices. We give a geometric equivalence for a nonnegative nonsingular upper triangular matrix to be in this class. This equivalence is extended to include some reducible matrices.     

The period and base of a reducible sign pattern matrix

A square sign pattern matrix A (whose entries are ) is said to be powerful if all the powers A,A²,A³,…, are unambiguously defined. For a powerful pattern A, if A^l=A^l+p with l and p minimal, then l is called the base of A and p is called the period of Li et al. [On the period and base of a sign pattern matrix, Linear Algebra Appl. 212/213 (1994) 101-120] characterized irreducible powerful sign pattern matrices. In this paper, we characterize reducible, powerful sign pattern matrices and give some new results on the period and base of a powerful sign pattern matrix.     

Drazin inverse of partitioned matrices in terms of Banachiewicz-Schur forms

Let be a partitioned matrix, where A and D are square matrices. Denote the Drazin inverse of A by A^D. The purpose of this paper is twofold. Firstly, we develop conditions under which the Drazin inverse of M having generalized Schur complement, S=D-CA^DB, group invertible, can be expressed in terms of a matrix in the Banachiewicz-Schur form and its powers. Secondly, we deal with partitioned matrices satisfying rank(M)=rank(A^D)+rank(S^D), and give conditions under which the group inverse of M exists and a formula for its computation.     

A relationship between subpermanents and the arithmetic-geometric mean inequality

Using the arithmetic-geometric mean inequality, we give bounds for k-subpermanents of nonnegative n×n matrices F. In the case k=n, we exhibit an n²-set S whose arithmetic and geometric means constitute upper and lower bounds for per(F)/n!. We offer sharpened versions of these bounds when F has zero-valued entries.     

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.     

Length problems for automorphisms of modules over local rings

Let R be a local ring and M a free module of a finite rank over R. An element τ ∈ Aut_RM is said to be simple if τ ≠ 1 fixes a hyperplane of M.We shall show that for any σ ∈ Aut_RM there exist a basis X for M and ρ ∈ Aut_RM such that ρ acts as a permutation on X and ρ⁻¹σ is a product of m or less than m simple elements in Aut_RM, where m is the order of the invariant factors of σ modulo the maximal ideal of R.Also we shall investigate the problem treated by E.W. Ellers and H. Ishibashi [Factorizations of transformations over a valuation ring, Linear Algebra Appl. 85 (1987) 17-27], in which they showed that σ is a product of simple elements and gave an upper bound of the smallest number of such factors of σ, whereas in the present paper we will give lower bounds of σ in case that R is a local domain. Moreover we will factorize θσ as a product of symmetries and transvections for some θ the matrix of which is diagonal.     

On theLU factorization ofM-matrices

Summary In this paper, we give in Theorem 1 a characterization, based on graph theory, of when anM-matrixA admits anLU factorization intoM-matrices, whereL is a nonsingular lower triangularM-matrix andU is an upper triangularM-matrix. This result generalizes earlier factorization results of Fiedler and Pták (1962) and Kuo (1977). As a consequence of Theorem 1, we show in Theorem 3 that the conditionx ^T A0 ^T for somex>0, for anM-matrixA, is both necessary and sufficient forPAP ^T to admit such anLU factorization for everyn×n permutation matrixP. This latter result extends recent work of Funderlic and Plemmons (1981). Finally, Theorem 1 is extended in Theorem 5 to give a characterization, similarly based on graph theory, of when anM-matrixA admits anLU factorization intoM-matrices.Dedicated to Professor Ky Fan on his sixty-seventh birthday, September 19, 1981.Research supported in part by the Air Force Office of Scientific Research, and by the Department of Energy