矩阵A的陪同矩阵的有关性质

通过研究矩阵A与伴随矩阵A<'*>,陪同矩阵<'*>A之间的关系,给出陪同矩阵<'*>A的一些性质.     

三对角与五对角Toeplitz矩阵求逆的算法

提出了一种求三对角与五对角Toeplitz矩阵逆的快速算法,其思想为先将Toeplitz矩阵扩展为循环矩阵,再快速求循环矩阵的逆,进而运用恰当矩阵分块求原Toeplitz矩阵的逆的算法.算法稳定性较好且复杂度较低.数值例子显示了算法的有效性和稳定性,并指出了算法的适用范围.     

On the Additive D-Stability of Matrices on the Basis of the Kharitonov Criterion

On the basis of the Kharitonov theorem, sufficient conditions on an matrix A are presented for the matrix to be stable for arbitrary , .     

An improved method for the computation of the Moore-Penrose inverse matrix

In this article we provide a fast computational method in order to calculate the Moore-Penrose inverse of singular square matrices and of rectangular matrices. The proposed method proves to be much faster and has significantly better accuracy than the already proposed methods, while works for full and sparse matrices.     

关于Toeplitz矩阵的非奇异性

本讨论了Toeplitz矩阵的非奇异性，给出了Toeplitz矩阵非奇异的的一些判别条件。     

A Cost-Efficient Variant of the Incremental Newton Iteration for the Matrix $p$th Root

Incremental Newton (IN) iteration, proposed by Iannazzo, is stable for computing the matrix $p$th root, and its computational cost is $\Order (n^3p)$ flops per iteration. In this paper, a cost-efficient variant of IN iteration is presented. The computational cost of the variant well agrees with $\Order (n^3 \log p)$ flops per iteration, if $p$ is up to at least 100.     

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.     

Algorithms for Finding the Inverses of Factor Block Circulant Matrices

In this paper,algorithms for finding the inverse of a factor block circulant matrix, a factor block retrocirculant matrix and partitioned matrix with factor block circulant blocks over the complex field are presented respectively.In addition,two algorithms for the inverse of a factor block circulant matrix over the quaternion division algebra are proposed.     

一类特殊的分块反循环矩阵的特征值问题

利用r-循环矩阵的基本性质,探讨了一类特殊的分块反循环矩阵的特征值问题．     

On the Generalized Strongly Nil-Clean Property of Matrix Rings

Let R be an associative unital ring and not necessarily commutative.We analyze conditions under which every n × n matrix A over R is expressible as a sum A =E1 +…+ Es + N of (commuting) idempotent matrices Ei and a nilpotent matrix N.     

Entropy of orthogonal matrices and minimum distance orthostochastic matrices from the uniform van der Waerden matrices

In this article we formulate an optimization problem of minimizing the distance from the uniform van der Waerden matrices to orthostochastic matrices of different orders. We find a lower bound for the number of stationary points of the minimization problem, which is connected to the number of possible partitions of a natural number. The existence of Hadamard matrices ensures the existence of global minimum orthostochastic matrices for such problems. The local minimum orthostochastic matrices have been obtained for all other orders except for 11 and 19. We explore the properties of Hadamard, conference and weighing matrices to obtain such minimizing orthostochastic matrices.     

两个分块矩阵相似性的研究

给出两个分块矩阵相似的两个充分必要条件 .也就是说 ,如果两个方阵 A和 B在 A2 =0和 B2 =0的条件下 ,则两个分块矩阵 A C0 B 和 A 00 B 相似的充分必要条件是 :rank A C0 B =rank(A) +rank(B)和 AC +CB =0 .如果两个方阵 A和 B在 A2 =A和 B2 =B的条件下 ,则两个分块矩阵 A C0 B和 A 00 B 相似的充分必要条件是 :AC +CB =C.     

Inverse of the distance matrix of a block graph

A connected graph G, whose 2-connected blocks are all cliques (of possibly varying sizes) is called a block graph. Let D be its distance matrix. By a theorem of Graham, Hoffman and Hosoya, we have det(D)?≠?0. We give a formula for both the determinant and the inverse, D ^?1 of D.     

一类特殊的分块反循环矩阵的特征值问题(英文)

利用r-循环矩阵的基本性质,探讨了一类特殊的分块反循环矩阵的特征值问题.     

初等变换的关系及可逆矩阵的分解

给出三种初等变换之间的关系 ,指出可逆矩阵可以分解为两种类型的初等矩阵的乘积 .对于行列式为 1的可逆阵 ,我们得出有趣的结果 ,所有这些 ,对于学习线性代数的同学们来说 ,都是很有益的     

关于实对称矩阵的基本定理

重新证明了实对称矩阵的基本定理:对于任意一个实对称矩阵A,存在实正交矩阵T,使得T′AT成对角形.     

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

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

一类缺项算子矩阵的谱补问题

对于Hilbert空间上的2×2算子矩阵,其中A∈B（H）,C∈B（K,H）,D∈B（H,K）给定,当X取遍B（K）中算子时,我们给出所有Nx的谱之交集和并集的刻画．