保持交换环上两类矩阵运算的映射

主要针对交换环上两类矩阵的保持问题进行展开:(1)刻画了交换环上全矩阵空间和上三角形矩阵空间的保持反对合矩阵映射的形式.(2)研究了交换环上n阶上三角形矩阵空间的保持伴随矩阵映射的形式.     

矩阵空间上保弱伴随矩阵的线性映射

为了刻画矩阵空间上保弱伴随矩阵的线性映射f,引入了保弱伴随矩阵的概念,以矩阵的弱伴随矩阵为不变量,得到了当n≥3时数域F上从线性矩阵空间Mn×n（F）到Mm×m（F）的保弱伴随矩阵的线性映射f的形式．     

整环上保持矩阵等价的映射

矩阵论是代数学的重要分支,而矩阵保持问题是矩阵论中的重要问题.交换环上的矩阵保持问题,主要研究保持交换环上矩阵的某种性质或关系的映射.在整环上的矩阵空间里,给出了映射保持矩阵等价的一个充分必要条件.     

时滞矩阵微分方程的等度稳定性

在矩阵值范数定义的广义赋范空间上利用矩阵Liapunov泛函研究了时滞矩阵微分方程的等度稳定性,得出了若干新结果.     

实对称矩阵基本定理的存在性证明

对于实对称矩阵A,通过考虑欧氏空间?~n中的连续函数f(X)=X~TAX在一些有界闭集上的最大值,构造相应子空间上的半正定矩阵,进而得到实对称矩阵A的实特征值和相应的特征向量.最终可得实对称矩阵A可以正交相似对角化.     

相容矩阵范数的延拓

利用构造性的方法证明了实方阵空间上的相容矩阵范数均可延拓到复方阵空间上。     

基于均值的Toeplitz矩阵填充的子空间算法

本文提出一种基于均值的Toeplitz矩阵填充的子空间算法.通过在左奇异向量空间中对已知元素的最小二乘逼近,形成了新的可行矩阵;并利用对角线上的均值化使得迭代后的矩阵保持Toeplitz结构,从而减少了奇异向量空间的分解时间.理论上,证明了在一定条件下该算法收敛于一个低秩的Toeplitz矩阵.通过不同已知率的矩阵填充数值实验展示了Toeplitz矩阵填充的新算法比阈值增广Lagrange乘子算法在时间上和精度上更有效.     

环上矩阵的广义Moore-Penrose逆

本文研究环上矩阵的广义Moore-Penros逆,利用矩阵行空间与列空间的包含关系,给出其存在的充要条件及表达式．推广了以往文献的相应结果。     

循环矩阵与矩阵对角化

循环矩阵与矩阵对角化赵继安（甘肃省碌曲县中学７４７２００）矩阵的相似关系具有反身性，对称性和传递性，所以相似关系也是一种等价关系．按相似关系将复数域Ｃ上的ｎ阶矩阵分类，凡属同一个类的矩阵彼此相似，属于异类的任意两个矩阵都不相似，这样的类称为相似类．本...     

关于Max-代数上矩阵的广义逆

探讨了一类Max-代数上矩阵的广义逆,得到了Max-代数上矩阵正则的基本性质及判定方法.同时,引入矩阵空间分解的概念,并证明一个矩阵是正则的当且仅当它是可空间分解的.     

循环矩阵的两种特性的判定

揭示几类矩阵之间的紧密联系.借助于群的子群的判定以及循环布尔矩阵是本原矩阵的判定方法,得到循环模糊矩阵成为幂等矩阵的充要条件,反循环布尔矩阵成为本原矩阵的充要条件.并给出了循环模糊矩阵成为幂等矩阵的判定方法,反循环布尔矩阵成为本原矩阵的判定方法.     

可换对合阵组合的可逆性

先讨论两个可换对合阵P,Q线性组合aP+bQ可逆的充分必要条件及可逆时逆矩阵计算公式,再利用矩阵分解,以两种形式讨论两个可换对合阵P,Q组合aI+bP+cQ+dPQ及三个两两可换对合阵P,Q,R组合aI+bP+cQ+dPQ+eR+fPR+gQR+hPQR可逆的充分必要条件及可逆时分别给出逆矩阵计算公式.     

Completely normal matrices

Normal matrices in which all submatrices are normal are said to be completely normal. We characterize this class of matrices, determine the possible inertias of a particular completely normal matrix, and show that real matrices in this class are closed under (general) Schur complementation. We provide explicit formulas for the Moore–Penrose inverse of a completely normal matrix of size at least four. A result on irreducible principally normal matrices is derived as well.     

Williamson matrices up to order 59

A recent result of Schmidt has brought Williamson matrices back into the spotlight. In this article, a new algorithm is introduced to search for hard to find Williamson matrices. We find all nonequivalent Williamson matrices of odd order n up to n = 59. It turns out that there are none for n = 35, 47, 53, 59 and it seems that the Turyn class may be the only infinite class of these matrices.      

等差-等比循环矩阵的逆矩阵求法

本文给出了等差-等此循环矩阵的逆矩阵求法,推广文[5]的结果.     

k-广义Hermite矩阵

本文给出了k-广义(反)Hermite矩阵的概念,研究了它的性质及其与k-广义酉矩阵之间的联系,推广了酉矩阵和(反)Hermite矩阵的相应结果.     

A Family of Asymmetrical Orthogonal Arrays with Run Sizes 4p^2

Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction of many mixed orthogonal arrays. But there are also many orthogonal arrays, especially mixed-level or asymmetrical which can not be obtained by the usual difference matrices. In order to construct these asymmetrical orthogonal arrays, a class of special matrices, so-called generalized difference matrices, were discovered by Zhang（1989, 1990, 1993） by the orthogonal decompositions of projective matrices. In this article, an interesting equivalent relationship between the orthogonal arrays and the generalized difference matrices is presented. As an application, a family of orthogonal arrays of run sizes 4p2, such as L36（6^13^42^10）, are constructed.     

Set inertia-preserving matrices∗ †

The inertia-preservers of several sets of matrices are identified. The sets include: all real matrices, all complex matrices, triangular matrices, real symmetric matrices and Hermitian matrices.     

Set inertia-preserving matrices

The inertia-preservers of several sets of matrices are identified. The sets include: all real matrices, all complex matrices, triangular matrices, real symmetric matrices and Hermitian matrices.     

A brief historical introduction to matrices and their applications

This paper deals with the ancient origin of matrices, and the system of linear equations. Included are algebraic properties of matrices, determinants, linear transformations, and Cramer’s Rule for solving the system of algebraic equations. Special attention is given to some special matrices, including matrices in graph theory and electrical networks. It contains a wide variety of important materials accessible to college and even high school students and teachers at all levels.