On the inverse of certain patterned sums of matrices with Kronecker product structures

In this article, we derive explicit expressions for the entries of the inverse of a patterned matrix that is a sum of Kronecker products. This matrix keeps the Kronecker structure under matrix inversion, and it is used, for example, in statistics, in particular in the linear mixed model analysis. The obtained results present new and extended existing algorithms for the inversion of the considered patterned matrices. We also obtain a closed-form inverse in terms of block matrices.     

Bounds on the inverses of nonnegative triangular matrices with monotonicity properties

Some bounds on the entries and on the norm of the inverse of triangular matrices with nonnegative and monotone entries are found. All the results are obtained by exploiting the properties of the fundamental matrix of the recurrence relation which generates the sequence of the entries of the inverse matrix. One of the results generalizes a theorem contained in a recent article of one of the authors about Toeplitz matrices.     

局部环上矩阵广义逆半群的子集及其性质

设R是一个局部环,A是一个可相似对角化的n阶矩阵.利用矩阵方法研究了环R上矩阵A的广义逆半群的子集,得到了其做成正规子群的条件和其中元素可逆的条件,也得到了矩阵广义逆半群的一些性质.     

环Z/p~kZ上矩阵广义逆的拓展

设R=Z/pkZ(其中k>1,p是一个奇素数),A是R上一个给定的可相似对角化的n阶矩阵.利用组合方法和有限局部环上的矩阵方法,讨论了矩阵A的拓展广义逆,得到了矩阵A的拓展广义逆存在的充要条件和一些的计数定理.     

Vertex degrees and doubly stochastic graph matrices

In this article, the relationship between vertex degrees and entries of the doubly stochastic graph matrix has been investigated. In particular, we present an upper bound for the main diagonal entries of a doubly stochastic graph matrix and investigate the relations between a kind of distance for graph vertices and the vertex degrees. These results are used to answer in negative Merris' question on doubly stochastic graph matrices. These results may also be used to establish relations between graph structure and entries of doubly stochastic graph matrices. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:104‐114, 2011     

On the closed representation for the inverses of Hessenberg matrices

The general representation for the elements of the inverse of any Hessenberg matrix of finite order is here extended to the reduced case with a new proof. Those entries are given with proper Hessenbergians from the original matrix. It justifies both the use of linear recurrences of unbounded order for such computations on matrices of intermediate order, and some elementary properties of the inverse. These results are applied on the resolvent matrix associated to a finite Hessenberg matrix in standard form. Two examples on the unit disk are given.     

On the magic square and inverse

In this note, we give a method for finding the inverse of a three by three magic square matrix without using the usual methods for finding the inverse of a matrix. Also we give a method for finding the inverse of a three by three magic square matrix whose entries are also matrices. By using these ideas, we can construct large matrices whose inverses can be calculated easily.     

Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs

In this paper, we use graph theoretic properties of generalized Johnson graphs to compute the entries of the group inverse of Laplacian matrices for generalized Johnson graphs. We then use these entries to compute the Zenger function for the group inverse of Laplacian matrices of generalized Johnson graphs.     

Stanley's zrank conjecture on skew partitions

We present an affirmative answer to Stanley's zrank conjecture, namely, the zrank and the rank are equal for any skew partition. We show that certain classes of restricted Cauchy matrices are nonsingular and furthermore, the signs are determined by the number of zero entries. We also give a characterization of the rank in terms of the Giambelli-type matrices of the corresponding skew Schur functions. Our approach also applies to the factorial Cauchy matrices and the inverse binomial coefficient matrices.

     

Positive definite completions of partial Hermitian matrices

The question of which partial Hermitian matrices (some entries specified, some free) may be completed to positive definite matrices is addressed. It is shown that if the diagonal entries are specified and principal minors, composed of specified entries, are positive, then, if the undirected graph of the specified entries is chordal, a positive definite completion necessarily exists. Furthermore, if this graph is not chordal, then examples exist without positive definite completions. In case a positive definite completion exists, there is a unique matrix, in the class of all positive definite completions, whose determinant is maximal, and this matrix is the unique one whose inverse has zeros in those positions corresponding to unspecified entries in the original partial Hermitian matrix. Additional observations regarding positive definite completions are made.     

The inverse and determinant of a 2 × 2 uniformly distributed random matrix

Formulae are derived for the density of the determinant and the elements of the inverse of a 2 × 2 matrix, with entries which are independent random variables uniformlly distributed on [0,1]. Graphs of the densities are presented, and the relevance of the results to interval matrices is discussed.     

A probing method for computing the diagonal of a matrix inverse

The computation of some entries of a matrix inverse arises in several important applications in practice. This paper presents a probing method for determining the diagonal of the inverse of a sparse matrix in the common situation when its inverse exhibits a decay property, i.e. when many of the entries of the inverse are small. A few simple properties of the inverse suggest a way to determine effective probing vectors based on standard graph theory results. An iterative method is then applied to solve the resulting sequence of linear systems, from which the diagonal of the matrix inverse is extracted. The results of numerical experiments are provided to demonstrate the effectiveness of the probing method. Copyright © 2011 John Wiley & Sons, Ltd.     

On the inertia sets of some symmetric sign patterns

A matrix whose entries consist of elements from the set {+, −, 0} is a sign pattern matrix. Using a linear algebra theoretical approach we generalize of some recent results due to Hall, Li and others involving the inertia of symmetric tridiagonal sign matrices.     

INERTIA SETS OF SYMMETRIC SIGN PATTERN MATRICES

1　IntroductionIn qualitative and combinatorial matrix theory,we study properties ofa matrix basedon combinatorial information,such as the signs of entries in the matrix.A matrix whoseentries are from the set{ + ,-,0 } is called a sign pattern matrix ( or sign pattern,or pat-tern) .We denote the setof all n× n sign pattern matrices by Qn.For a real matrix B,sgn( B) is the sign pattern matrix obtained by replacing each positive( respectively,negative,zero) entry of B by+ ( respectively,-,0 )…     

On properties of cell matrices

In this paper properties of cell matrices are studied. A determinant of such a matrix is given in a closed form. In the proof a general method for determining a determinant of a symbolic matrix with polynomial entries, based on multivariate polynomial Lagrange interpolation, is outlined. It is shown that a cell matrix of size n>1 has exactly one positive eigenvalue. Using this result it is proven that cell matrices are (Circum-)Euclidean Distance Matrices ((C)EDM), and their generalization, k-cell matrices, are CEDM under certain natural restrictions. A characterization of k-cell matrices is outlined.     

An efficient method for computing the inverse of arrowhead matrices

In this paper we propose a simple and effective method to find the inverse of arrowhead matrices which often appear in wide areas of applied science and engineering such as wireless communications systems, molecular physics, oscillators vibrationally coupled with Fermi liquid, and eigenvalue problems. A modified Sherman–Morrison inverse matrix method is proposed for computing the inverse of an arrowhead matrix. The effectiveness of the proposed method is illustrated and numerical results are presented along with comparative results.     

Moore–Penrose inverse of an invertible infinite matrix

In this article we show that, contrary to finite matrices (with real or complex entries) an invertible infinite matrix V could have a Moore–Penrose inverse that is not a classical inverse of V. This also answers a recent open problem on infinite matrices.     

Construction,properties and statistical applications of positive definite intraclass matrix

Given a positive definite (p.d.) matrix with real entries, it is possible to construct a p.d. intraclass matrix whose diagonal and off-diagonal elements are chosen as the averages of the diagonal elements and off-diagonal elements of the former matrix. Exploiting the very special structure of the latter matrix various interesting propositions are established. Statistical applications of such matrices are surveyed.     

On the point spectrum of periodic Jacobi matrices with matrix entries: elementary approach

This work consists of two parts. The first one contains a characterization (localization) of the point spectrum of one sided, infinite and periodic Jacobi matrices with scalar entries. The second one deals with the same questions about one sided, infinite periodic Jacobi matrices with matrix entries. In particular, an example illustrating the difference between the above localization property in scalar and matrix entries cases is given.