A note on inversion of Toeplitz matrices

It is shown that the invertibility of a Toeplitz matrix can be determined through the solvability of two standard equations. The inverse matrix can be denoted as a sum of products of circulant matrices and upper triangular Toeplitz matrices. The stability of the inversion formula for a Toeplitz matrix is also considered.     

矩阵的分块Kronecker积

为了构造适应于复杂的矩阵计算的程序,在分块矩阵与Kronecker积的基础上提出一类新的矩阵运算方式,称之为矩阵的分块Kronecker积.首先研究了这种运算的性质及计算机实现的过程,进一步讨论了的这类运算在实际中的应用,最后提出进一步可研究的问题.     

中心对称矩阵的一类问题

利用矩阵的Kronecker积给出了中心对称矩阵的若干特征,并讨论了由特征值和特征向量反构中心对称矩阵的问题.     

Structured mixed and componentwise condition numbers of some structured matrices

Structured matrices, such as Cauchy, Vandermonde, Toeplitz, Hankel, and circulant matrices, are considered in this paper. We apply a Kronecker product-based technique to deduce the structured mixed and componentwise condition numbers for the matrix inversion and for the corresponding linear systems.     

Real linear Kronecker product operations

The Kronecker product in the real linear matrix analytic setting is studied. More versatile operations are proposed. Such generalizations are of interest for the same reasons the standard Kronecker product is. To give an example, new preconditioning ideas are suggested. In connection with this, several formulae for the inverse are devised. Orthogonal decompositions of real-entried matrices are derived through introducing new Kronecker product SVDs. Matrix equations are given to illustrate how the Kronecker product structures introduced can arise.     

Polynomial numerical hulls of matrix polynomials,II

In this article, we study some algebraic and geometrical properties of polynomial numerical hulls of matrix polynomials and joint polynomial numerical hulls of a finite family of matrices (possibly the coefficients of a matrix polynomial). Also, we study polynomial numerical hulls of basic A-factor block circulant matrices. These are block companion matrices of particular simple monic matrix polynomials. By studying the polynomial numerical hulls of the Kronecker product of two matrices, we characterize the polynomial numerical hulls of unitary basic A-factor block circulant matrices.     

（m，n）型二重（r1,r2）-循环矩阵的逆和广义逆

利用矩阵的Kronecker积给出了非奇异的（m,n）型二重（r1,r2）－循环矩阵求逆矩阵的一个计算公式,同时该方法还可以推广到求奇异的（m,n）型二重（r1,r2）－循环矩阵的反射g逆。     

关于r-分块循环矩阵及其对角化问题的探讨

本文给出了r-分块循环矩阵的概念,并利用矩阵的张量积探讨了r-分块循环矩阵的相似类及其对角化问题,得出了一些重要的结论.     

关于随机矩阵Kronecker积的谱半径的不等式

研究了随机矩阵的Kronecker积的数学期望的性质,得到了随机矩阵的Kronecker积的谱半径的几个不等式.     

The Nearest Bisymmetric Solutions of Linear Matrix Equations

The necessary and sufficient conditions for the existence of and the expressions for the bisymmetric solutions of the matrix equations (Ⅰ)A1X1B1 A2X2B2 ^… AkXkBk=D,(Ⅱ)A1XB1 A2XB2 … AkXBk=D and (Ⅲ) (A1XB1,A2XB2,…,AkXBk)=(D1,D2,…,Dk) are derived by using Kronecker product and Moore-Penrose generalized inverse of matrices. In addition, in corresponding solution set of the matrix equations, the explicit expression of the nearest matrix to a given matrix in the Frobenius norm is given. Numerical methods and numerical experiments of finding the neaxest solutions axe also provided.     

Inversion of polynomial and rational matrices

The inversion of polynomial and rational matrices is considered. For regular matrices, three algorithms for computing the inverse matrix in a factored form are proposed. For singular matrices, algorithms of constructing pseudoinverse matrices are considered. The algorithms of inversion of rational matrices are based on the minimal factorization which reduces the problem to the inversion of polynomial matrices. A class of special polynomial matrices is regarded whose inverse matrices are also polynomial matrices. Inversion algorithms are applied to the solution of systems with polynomial and rational matrices. Bibliography: 3 titles. Translated by V. N. Kublanovskaya. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 202, 1992, pp. 97–109.     

幂等和幂零阵的伴随阵的反问题

解决了幂等和幂零阵的伴随阵的反问题,把Sherman-Morrison公式[1]推广到求伴随阵的情形,并给出了一类伴随还原阵的简单求法.     

非线性矩阵微分系统的h稳定性

讨论了一类非线性矩阵微分系统,运用Lyapunov函数法和Kronecker积给出了非线性矩阵微分系统h稳定性的若干判断准则.     

几种矩阵逆的连续性

非奇异矩阵的逆是矩阵元素的连续函数．学者们也对矩阵广义逆的连续性有所研究．本文应用矩阵分裂和两个矩阵之和的逆的展开式,给出了一般非奇异矩阵,M-矩阵和H-矩阵的逆的连续性．当一些合理的条件满足时,这几种矩阵的逆是连续的．     

Cayley transform and the Kronecker product of Hermitian matrices

We consider the conditions under which the Cayley transform of the Kronecker product of two Hermitian matrices can be again presented as a Kronecker product of two matrices and, if so, if it is a product of the Cayley transforms of the two Hermitian matrices. We also study the related question: given two matrices, which matrix under the Cayley transform yields the Kronecker product of their Cayley transforms.     

Analytical inversion of general periodic tridiagonal matrices

In this paper we present an analytical forms for the inversion of general periodic tridiagonal matrices, and provide some very simple analytical forms which immediately lead to closed formulae for some special cases such as symmetric or perturbed Toeplitz for both periodic and non-periodic tridiagonal matrices. An efficient computational algorithm for finding the inverse of any general periodic tridiagonal matrices from the analytical form is given, it is suited for implementation using Computer Algebra systems such as MAPLE, MATLAB, MACSYMA, and MATHEMATICA. An example is also given to illustrate the algorithm.     

对角占优矩阵直积的注记

将对角占优矩阵的性质与矩阵的直积结合起来,给出了两矩阵的直积是对角占优矩阵的一些充分和必要条件,推广了近期的一些结果.最后用相应的数值例子说明了所得结果的有效性.     

亚正定矩阵的Kronecker积

研究亚正定矩阵kronecker积的亚正定性,得到了一个充要条件,同时得到Hadamard积亚正定性的一个充要条件.     

Properties of Hadamard product of inverse M‐matrices

This paper concerns with the properties of Hadamard product of inverse M‐matrices. Structures of tridiagonal inverse M‐matrices and Hessenberg inverse M‐matrices are analysed. It is proved that the product A ○ A^T satisfies Willoughby's necessary conditions for being an inverse M‐matrix when A is an irreducible inverse M‐matrix. It is also proved that when A is either a Hessenberg inverse M‐matrix or a tridiagonal inverse M‐matrix then A ○ A^T is an inverse M‐matrix. Based on these results, the conjecture that A ○ A^T is an inverse M‐matrix when A is an inverse M‐matrix is made. Unfortunately, the conjecture is not true. Copyright © 2004 John Wiley Sons, Ltd.