模糊有限自动机的kronecker积

在矩阵理论框架下,引入了模糊有限自动机转移矩阵,变换矩阵半群以及覆盖概念.定义了模糊有限自动机Kronecker积,讨论了其转移矩阵性质及变换矩阵半群间的覆盖关系.     

二类1错误矩阵方程增优置换变换求解及其在城市交通管理中的应用研究

消错学的错误矩阵可表达错误逻辑里所定义的分解、相似、增加、置换、毁灭、单位变换等转化词,针对其中的置换变换,构建了二类1错误矩阵方程增优置换变换错误矩阵方程,并讨论了该类错误矩阵方程的求解.用交通管理问题对错误矩阵进行了举例,并构建相应的错误矩阵方程,利用上述的求解方法,对二类1方程置换变换进行了求解.     

用矩阵的初等变换解矩阵方程A_(m×n)X_(n×s)=B_(m×s)

本文通过对一般的矩阵方程Ａｍ×ｎＸｎ×ｓ＝Ｂｍ×ｓ的矩阵Ａ和Ｂ作初等行变换及初等列变换，给出了一般矩阵方程的求解方法．     

椭球等高矩阵分布关于非奇异矩阵变换的不变性

本文首先将矩阵F分布和矩阵t分布的定义推广到左球分布类,其密度函数与产生它们的左球分布或球对称分布的密度均无关.然后讨论了椭球等高分布关于非奇异矩阵变换的不变性问题,包括矩阵Beta分布、逆矩阵Beta分布、矩阵Dirichlet分布、逆矩阵Dirichlet分布、矩阵F分布和矩阵t等分布.在非奇异变换下,这些分布的密度不但与产生它们的左球分布的密度函数无关,而且与非奇异变换矩阵无关.     

利用伸压变换矩阵解椭圆问题

随着新课程的推进,<矩阵与变换>作为一个专题已经进入中学课堂,伸压变换矩阵作为一类重要的变换矩阵与函数的伸缩变换有着本质的联系.将伸压变换矩阵应用到解题中,不但可以拓宽解题思路,而且可以简化解题过程.本文就谈谈利用伸压变换矩阵解椭圆问题.     

直角坐标系下黏弹性层状地基动力响应分析

基于直角坐标系下黏弹性力学的基本控制方程,运用Fourier-Laplace积分变换、解耦变换、微分方程组理论和矩阵理论,推导轴对称动荷载及非轴对称动荷载作用时黏弹性地基三维空间问题积分变换域内的解析单元刚度矩阵;根据边界条件和层间连续条件集成总刚度矩阵;求解含有总刚度矩阵方程的代数方程,得到积分变换域内相应问题的解;利用Fourier-Laplace积分逆变换得到真实物理域内的解.编制相应程序计算黏弹性层状地基动力响应与已有解答进行对比,验证了提出方法的正确性.     

特征值问题的预变换方法(I): 杨辉三角阵变换与二阶PDE 特征多项式

本文提出一类求解特征值问题的下三角预变换方法, 目标是通过相似变换后矩阵下三角元素平方和明显减少、且变换后的特征值及其特征向量较易求解, 使变换后的对角线可作为全体特征值很好的一组初值, 其作用如同对于解方程组找到好的预条件子, 加速迭代收敛. 以二阶PDE 数值计算为例,对于以Laplace 方程为代表的特征波向量组及正交多项式组有广泛的应用前景.
杨辉三角是我国古代数学家的一项重要成就. 本文引入杨辉三角矩阵作为预变换子, 给出一般矩阵用杨辉三角矩阵作为左、右预变换子时变为上三角矩阵的充要条件, 给出了元素为行指标二次多项式的两个矩阵类(三对角线阵与五对角线阵) 中特征值何时保持二次多项式的充要条件, 并应用于构造新的二元PDE 正交多项式.     

利用矩阵初等行变换直接求得矩阵方程的通解

给出利用矩阵初等行变换直接求得矩阵方程通解的方法 .其表达、证明及解法均较文 [1 ]直接简捷     

相似变换矩阵的简单求法

在研究矩阵相似问题时,如果知道矩阵A及相似变换矩阵P,则可求出与A相似的矩阵B=P~(-1)AP 反过来,如果知道A及其相似矩阵B,如何求相似变换矩阵P的问题,一般线性代数教材都很少提及它。即使个别教材中提到这个问题,也只是针对B是A的Jordan标准形的简单情形,应用解非齐次线性方程组AX=XB的方法求出相似变换矩阵P的,因B是特殊情形,所以这种方法不具有普遍意义。     

线性代数变换与仿射几何变换

本文介绍线性代数中的二维代数变换与解析几何中的平面仿射变换的关系,代数变换及其变换矩阵的几何意义,各种仿射变换的矩阵表示及其矩阵性质,梳理仿射变换下的不变性质与不变量.     

On the finiteness property for rational matrices

We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product. It was conjectured a decade ago that all finite sets of real matrices have the finiteness property. This “finiteness conjecture” is now known to be false but no explicit counterexample is available and in particular it is unclear if a counterexample is possible whose matrices have rational or binary entries. In this paper, we prove that all finite sets of nonnegative rational matrices have the finiteness property if and only if pairs of binary matrices do and we state a similar result when negative entries are allowed. We also show that all pairs of 2×2 binary matrices have the finiteness property. These results have direct implications for the stability problem for sets of matrices. Stability is algorithmically decidable for sets of matrices that have the finiteness property and so it follows from our results that if all pairs of binary matrices have the finiteness property then stability is decidable for nonnegative rational matrices. This would be in sharp contrast with the fact that the related problem of boundedness is known to be undecidable for sets of nonnegative rational matrices.     

紧致交换矩阵半群

通过将矩阵同时对角化或同时上三角化的方法,给出有关紧致Abel矩阵半群以及紧致Hermite矩阵半群中矩阵的特征值的一些很好的刻画,证明了由可逆的Hermite矩阵构成的紧致矩阵半群中每个矩阵的特征值都是±1,Hermite矩阵单半群相似于对角矩阵半群,紧致交换矩阵半群的谱半径不超过1,等等.     

Hyponormal and strongly hyponormal matrices in inner product spaces

Complex matrices that are structured with respect to a possibly degenerate indefinite inner product are studied. Based on earlier works on normal matrices, the notions of hyponormal and strongly hyponormal matrices are introduced. A full characterization of such matrices is given and it is shown how those matrices are related to different concepts of normal matrices in degenerate inner product spaces. Finally, the existence of invariant semidefinite subspaces for strongly hyponormal matrices is discussed.     

The class of m-EP and m-normal matrices

The well-known classes of EP matrices and normal matrices are defined by the matrices that commute with their Moore–Penrose inverse and with their conjugate transpose, respectively. This paper investigates the class of m-EP matrices and m-normal matrices that provide a generalization of EP matrices and normal matrices, respectively, and analyses both of them for their properties and characterizations.     

幂幺矩阵的充要条件

研究幂幺矩阵的充要条件,利用矩阵的秩和齐次线性方程组解空间的维数.将m=2时幂幺矩阵的充要条件推广到一般幂幺矩阵的充要条件,得出了幂幺矩阵可对角化的结果,并将幂幺矩阵的充要条件平行地推广到幂幺线性变换.     

On the classification of Hadamard matrices of order 32

All equivalence classes of Hadamard matrices of order at most 28 have been found by 1994. Order 32 is where a combinatorial explosion occurs on the number of Hadamard matrices. We find all equivalence classes of Hadamard matrices of order 32 which are of certain types. It turns out that there are exactly 13, 680, 757 Hadamard matrices of one type and 26, 369 such matrices of another type. Based on experience with the classification of Hadamard matrices of smaller order, it is expected that the number of the remaining two types of these matrices, relative to the total number of Hadamard matrices of order 32, to be insignificant. © 2009 Wiley Periodicals, Inc. J Combin Designs 18:328–336, 2010     

Constructing self-orthogonal and Hermitian self-orthogonal codes via weighing matrices and orbit matrices

We define the notion of an orbit matrix with respect to standard weighing matrices, and with respect to types of weighing matrices with entries in a finite field. In the latter case we primarily restrict our attention the fields of order 2, 3 and 4. We construct self-orthogonal and Hermitian self-orthogonal linear codes over finite fields from these types of weighing matrices and their orbit matrices respectively. We demonstrate that this approach applies to several combinatorial structures such as Hadamard matrices and balanced generalized weighing matrices. As a case study we construct self-orthogonal codes from some weighing matrices belonging to some well known infinite families, such as the Paley conference matrices, and weighing matrices constructed from ternary periodic Golay pairs.     

Eigenvalue perturbation theory of symplectic,orthogonal, and unitary matrices under generic structured rank one perturbations

We study the perturbation theory of structured matrices under structured rank one perturbations, with emphasis on matrices that are unitary, orthogonal, or symplectic with respect to an indefinite inner product. The rank one perturbations are not necessarily of arbitrary small size (in the sense of norm). In the case of sesquilinear forms, results on selfadjoint matrices can be applied to unitary matrices by using the Cayley transformation, but in the case of real or complex symmetric or skew-symmetric bilinear forms additional considerations are necessary. For complex symplectic matrices, it turns out that generically (with respect to the perturbations) the behavior of the Jordan form of the perturbed matrix follows the pattern established earlier for unstructured matrices and their unstructured perturbations, provided the specific properties of the Jordan form of complex symplectic matrices are accounted for. For instance, the number of Jordan blocks of fixed odd size corresponding to the eigenvalue 1 or ?1 have to be even. For complex orthogonal matrices, it is shown that the behavior of the Jordan structures corresponding to the original eigenvalues that are not moved by perturbations follows again the pattern established earlier for unstructured matrices, taking into account the specifics of Jordan forms of complex orthogonal matrices. The proofs are based on general results developed in the paper concerning Jordan forms of structured matrices (which include in particular the classes of orthogonal and symplectic matrices) under structured rank one perturbations. These results are presented and proved in the framework of real as well as of complex matrices.     

On diagonal-Schur complements of block diagonally dominant matrices

It is known that the diagonal-Schur complements of strictly diagonally dominant matrices are strictly diagonally dominant matrices [J.Z. Liu, Y.Q. Huang, Some properties on Schur complements of H-matrices and diagonally dominant matrices, Linear Algebra Appl. 389 (2004) 365-380], and the same is true for nonsingular H-matrices [J.Z. Liu, J.C. Li, Z.T. Huang, X. Kong, Some properties of Schur complements and diagonal-Schur complements of diagonally dominant matrices, Linear Algebra Appl. 428 (2008) 1009-1030]. In this paper, we research the properties on diagonal-Schur complements of block diagonally dominant matrices and prove that the diagonal-Schur complements of block strictly diagonally dominant matrices are block strictly diagonally dominant matrices, and the same holds for generalized block strictly diagonally dominant matrices.     

The Koteljanskii inequalities for mixed matrices

Recently, a new class of matrices, called mixed matrices, that unifies the Z-matrices and symmetric matrices has been identified. They share the property that when the leading principal minors are positive, all principal minors are positive. It is natural to ask what other properties of M-matrices and positive definite matrices are enjoyed by mixed matrices as well. Here, we show that mixed P-matrices satisfy a broad family of determinantal inequalities, the Koteljanskii inequalities, previously known for those two classes. In the process, other properties of mixed matrices are developed, and consequences of the Koteljanskii inequalities are given.