Equalities and inequalities for inertias of hermitian matrices with applications

The inertia of a Hermitian matrix is defined to be a triplet composed of the numbers of the positive, negative and zero eigenvalues of the matrix counted with multiplicities, respectively. In this paper, we show some basic formulas for inertias of 2×2 block Hermitian matrices. From these formulas, we derive various equalities and inequalities for inertias of sums, parallel sums, products of Hermitian matrices, submatrices in block Hermitian matrices, differences of outer inverses of Hermitian matrices. As applications, we derive the extremal inertias of the linear matrix expression A-BXB^∗ with respect to a variable Hermitian matrix X. In addition, we give some results on the extremal inertias of Hermitian solutions to the matrix equation AX=B, as well as the extremal inertias of a partial block Hermitian matrix.     

Singularity, Wielandt’s lemma and singular values

In this study, some upper and lower bounds for singular values of a general complex matrix are investigated, according to singularity and Wielandt’s lemma of matrices. Especially, some relationships between the singular values of the matrix A and its block norm matrix are established. Based on these relationships, one may obtain the effective estimates for the singular values of large matrices by using the lower dimension norm matrices. In addition, a small error in Piazza (2002) [G. Piazza, T. Politi, An upper bound for the condition number of a matrix in spectral norm, J. Comput. Appl. Math. 143 (1) (2002) 141-144] is also corrected. Some numerical experiments on saddle point problems show that these results are simple and sharp under suitable conditions.     

The α-scalar diagonal stability of block matrices

We generalize two results: Kraaijevanger’s 1991 characterization of diagonal stability via Hadamard products and the block matrix version of the closure of the positive definite matrices under Hadamard multiplication. We restate our generalizations in terms of P^α-matrices and α-scalar diagonally stable matrices.     

Similarity of block diagonal and block triangular matrices

It is shown that if a block triangular matrix is similar to its block diagonal part, then the similarity matrix can be chosen of the block triangular form. An analogous statement is proved for equivalent matrices. For the simplest case of 2×2 block matrices these results were obtained by W.Roth [1]. It is shown that all these results do not admit a generalization for the infinite dimensional case.     

On block partial linearizations of the pfaffian

Amitsur’s formula, which expresses det(A + B) as a polynomial in coefficients of the characteristic polynomial of a matrix, is generalized for partial linearizations of the pfaffian of block matrices. As applications, in upcoming papers we determine generators for the SO(n)-invariants of several matrices and relations for the O(n)-invariants of several matrices over a field of arbitrary characteristic.     

On rank invariance of generalized Schwarz-Pick-Potapov block matrices of matrix-valued Carathéodory functions

In view of a multiple Nevanlinna-Pick interpolation problem, we study the rank of generalized Schwarz-Pick-Potapov block matrices of matrix-valued Carathéodory functions. Those matrices are determined by the values of a Carathéodory function and the values of its derivatives up to a certain order. We derive statements on rank invariance of such generalized Schwarz-Pick-Potapov block matrices. These results are applied to describe the case of exactly one solution for the finite multiple Nevanlinna-Pick interpolation problem and to discuss matrix-valued Carathéodory functions with the highest degree of degeneracy.     

Identities for minors of the Laplacian, resistance and distance matrices

It is shown that if L and D are the Laplacian and the distance matrix of a tree respectively, then any minor of the Laplacian equals the sum of the cofactors of the complementary submatrix of D, up to sign and a power of 2. An analogous, more general result is proved for the Laplacian and the resistance matrix of any graph. A similar identity is proved for graphs in which each block is a complete graph on r vertices, and for q-analogues of such matrices of a tree. Our main tool is an identity for the minors of a matrix and its inverse.     

Nonnegative determinant of a rectangular matrix: Its definition and applications to multivariate analysis

It is well known that the determinant of a matrix can only be defined for a square matrix. In this paper, we propose a new definition of the determinant of a rectangular matrix and examine its properties. We apply these properties to squared canonical correlation coefficients, and to squared partial canonical correlation coefficients. The proposed definition of the determinant of a rectangular matrix allows an easy and straightforward decomposition of the likelihood ratio when given sets of variables are partitioned into row block matrices. The last section describes a general theorem on redundancies among variables measured in terms of the likelihood ratio of a partitioned matrix.     

Tensor properties of multilevel Toeplitz and related matrices

A general proposal is presented for fast algorithms for multilevel structured matrices. It is based on investigation of their tensor properties and develops the idea recently introduced by Kamm and Nagy in the block Toeplitz case. We show that tensor properties of multilevel Toeplitz matrices are related to separation of variables in the corresponding symbol, present analytical tools to study the latter, expose truncation algorithms preserving the structure, and report on some numerical results confirming advantages of the proposal.     

Additive results for the Drazin inverse of block matrices and applications

In this paper, we consider the Drazin inverse of a sum of two matrices and derive additive formulas under conditions weaker than those used in some recent papers on the subject. As a corollary we get the main results from the paper of Yang and Liu [H. Yang, X. Liu, The Drazin inverse of the sum of two matrices and its applications, J. Comput. Appl. Math. 235 (2011) 1412-1417]. As an application we give some new representations for the Drazin inverse of a block matrix.     

Canonical forms for normal matrices that commute with their complex conjugate

We consider the class of normal complex matrices that commute with their complex conjugate. We show that such matrices are real orthogonally similar to a canonical direct sum of 1-by-1 and certain 2-by-2 matrices. A canonical form for quasi-real normal matrices is obtained as a special case. We also exhibit a special form of the spectral theorem for normal matrices that commute with their conjugate.     

Dominant matrices and max algebra

We study the class of so-called totally dominant matrices in the usual algebra and in the max algebra in which the sum is the maximum and the multiplication is usual. It turns out that this class coincides with the well known class of positive matrices having positive the determinants of all 2×2 submatrices. The closure of this class is closed not only with respect to the usual but also with respect to the max multiplication. Further properties analogous to those of totally positive matrices are proved and some connections to Monge matrices are mentioned.     

On some properties of the determinants of tensors

We use the Hilbert?s Nullstellensatz (Hilbert?s Zero Point Theorem) to give a direct proof of the formula for the determinants of the products of tensors. By using this determinant formula and using tensor product to represent the transformations of the slices of tensors, we prove some basic properties of the determinants of tensors which are the generalizations of the corresponding properties of the determinants for matrices. We also study the determinants of tensors after two types of transposes. We use the permutational similarity of tensors to discuss the relation between weakly reducible tensors and the triangular block tensors, and give a canonical form of the weakly reducible tensors.     

Rank one preservers between spaces of Boolean matrices

In this paper, we characterize (i) linear transformations from one space of Boolean matrices to another that send pairs of distinct rank one elements to pairs of distinct rank one elements and (ii) surjective mappings from one space of Boolean matrices to another that send rank one matrices to rank one matrices and preserve order relation in both directions. Both results are proved in a more general setting of tensor products of two Boolean vector spaces of arbitrary dimension.     

Permanents of doubly stochastic matrices with fixed zero pattern

The doubly stochastic matrices with a given zero pattern which are closest in Euclidean norm to J_nn, the matrix with each entry equal to 1/n, are identified. If the permanent is restricted to matrices having a given zero pattern confined to one row or to one column, the permanent achieves a local minimum at those matrices with that zero pattern which are closest to J_nn. This need no longer be true if the zeros lie in more than one row or column.     

Some algebraic identities for the α-permanent

The permanent of a matrix is a linear combination of determinants of block diagonal matrices which are simple functions of the original matrix. To prove this, we first show a more general identity involving α-permanents: for arbitrary complex numbers α and β, we show that the α-permanent of any matrix can be expressed as a linear combination of β-permanents of related matrices. Some other identities for the α-permanent of sums and products of matrices are shown, as well as a relationship between the α-permanent and general immanants. We conclude with some discussion and a conjecture for the computational complexity of the α-permanent, and provide some numerical illustrations.     

Revisiting the core EP inverse and its extension to rectangular matrices

In this paper, we revise the core EP inverse of a square matrix introduced by Prasad and Mohana in [12], Core EP inverse, Linear and Multilinear Algebra 62(3) (2014), 792–802. Firstly, we give a new representation and a new characterization of the core EP inverse. Then, we study some properties of the core EP inverse by using a representation by block matrices. Secondly, we extend the notion of core EP inverse to rectangular matrices by means of a weighted core EP decomposition. Finally, we study some properties of weighted core EP inverses.     

Theorems on partitioned matrices revisited and their applications to graph spectra

Some old results about spectra of partitioned matrices due to Goddard and Schneider or Haynsworth are re-proved. A new result is given for the spectrum of a block-stochastic matrix with the property that each off-diagonal block has equal entries and each diagonal block has equal diagonal entries and equal off-diagonal entries. The result is applied to the study of the spectra of the usual graph matrices by partitioning the vertex set of the graph according to the neighborhood equivalence relation. The concept of a reduced graph matrix is introduced. The question of when n-2 is the second largest signless Laplacian eigenvalue of a connected graph of order n is treated. A recent conjecture posed by Tam, Fan and Zhou on graphs that maximize the signless Laplacian spectral radius over all (not necessarily connected) graphs with given numbers of vertices and edges is refuted. The Laplacian spectrum of a (degree) maximal graph is reconsidered.     

Intrinsic products and factorizations of matrices

We say that the product of a row vector and a column vector is intrinsic if there is at most one nonzero product of corresponding coordinates. Analogously we speak about intrinsic product of two or more matrices, as well as about intrinsic factorizations of matrices. Since all entries of the intrinsic product are products of entries of the multiplied matrices, there is no addition. We present several examples, together with important applications. These applications include companion matrices and sign-nonsingular matrices.