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

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

Riordan 矩阵在广义 Motzkin 路计数中的应用

用Riordan矩阵的方法研究了具有4种步型的加权格路(广义Motzkin路)的计数问题,引入了一类新的计数矩阵,即广义Motzkin矩阵.同时给出了这类矩阵的Riordan表示,也得到了广义Motzkin路的计数公式.Catalan矩阵,Schrder矩阵和Motzkin矩阵都是广义Motzkin矩阵的特殊情形.     

几类典型矩阵方程的梯度矩阵的计算

应用矩阵微分思想,计算了几类典型的矩阵方程的梯度矩阵并给予了证明.     

格矩阵的行列式与伴随矩阵

研究了格矩阵的行列式与伴随矩阵,给出了它们的一些代数性质,同时给出了由一个格矩阵构造一个传递矩阵的方法.     

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

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

关于《亚正定阵理论(Ⅱ)》一文的错误

设A∈R~n×n,如果R(A)(?)A A’/2为正定矩阵,则称A为亚正定矩阵.文[1]、[2]研究了亚正定矩阵,得出了一些新的结果.这里指出,文[2]中有些疏漏和错误.取(?),则A为亚正定矩阵,B为正定矩阵,容易验证文[2]中定理2和定理5的结论均不成立.其原因在于原文定理证明中错误地运用了Holder第二不等式.要使结论成立,两个定理均需附加条件“亚正定矩阵A的特征值都是实数”.     

可逆矩阵的高次伴随矩阵

用数学归纳法推出了可逆矩阵的高次伴随矩阵的公式,并结合可逆矩阵的基本公式得出了可逆矩阵的高次伴随矩阵的行列式和逆矩阵,给出了可逆矩阵的高次伴随矩阵的特征值和特征向量的表示公式,最后讨论了若干个可逆矩阵的乘积的高次伴随矩阵.     

幂等矩阵的性质及其推广

首先对幂等矩阵的简单性质进行了归纳总结,接着论证了幂等矩阵的等价条件及其特征值的取值范围,并讨论了幂等矩阵与实对称矩阵的关系、幂等矩阵与其伴随矩阵的特征值和特征向量的对应关系及幂等矩阵在群逆中的一个性质.最后讨论了幂等矩阵的两种分解形式.     

M-矩阵的性质与Hadamard-Fisher不等式的注记

主要研究了两个M-矩阵的比较性质与不等式,给出了M-矩阵与逆M-矩阵Hadamard-Fisher不等式等式成立的矩阵结构.     

两类下三角形Pascal矩阵的相似性

本文研究了Pascal矩阵与位移Pascal矩阵之间的关系.利用组合恒等式与矩阵分解的方法,得到了Pascal矩阵以及位移Pascal矩阵与若当标准型之间的过渡矩阵.同时也得到了这两类矩阵在域Zp上的最小多项式.     

关于矩阵多项式特征值界的注记

本文讨论矩阵多项式特征值定域问题.首先对Higham和Tisseur[Linear Algebra Appl.,358(2003),5-22]得到的结果给出较详细的比较.然后利用分块矩阵谱半径的估计给出了获取特征值界的一种新办法.利用这种新办法,不但可以简明地得出很多已有的界,且对椭圆及双曲矩阵多项式得出了特征值的新的界.     

Error bounds for linear complementarity problems of Nekrasov matrices

We present error bounds for the linear complementarity problem when the involved matrix is a Nekrasov matrix and also when it is a \(\Sigma \) -Nekrasov matrix. The new bounds can improve considerably other previous bounds.     

Some upper and lower bounds on PSD-rank

Positive semidefinite rank (PSD-rank) is a relatively new complexity measure on matrices, with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for showing lower bounds on the PSD-rank. All of these bounds are based on viewing a positive semidefinite factorization of a matrix M as a quantum communication protocol. These lower bounds depend on the entries of the matrix and not only on its support (the zero/nonzero pattern), overcoming a limitation of some previous techniques. We compare these new lower bounds with known bounds, and give examples where the new ones are better. As an application we determine the PSD-rank of (approximations of) some common matrices.     

Bounds and perturbation bounds for the matrix exponential

Some new types of bounds and perturbation bounds, based on the Jordan normal form, for the matrix exponential are derived. These bounds are compared to known bounds, both theoretically and by numerical examples. Some recent results on the matrix exponential and the logarithmic norm are also included.     

New upper solution bounds of the discrete algebraic Riccati matrix equation

In this note, we present upper matrix bounds for the solution of the discrete algebraic Riccati equation (DARE). Using the matrix bound of Theorem 2.2, we then give several eigenvalue upper bounds for the solution of the DARE and make comparisons with existing results. The advantage of our results over existing upper bounds is that the new upper bounds of Theorem 2.2 and Corollary 2.1 are always calculated if the stabilizing solution of the DARE exists, whilst all existing upper matrix bounds might not be calculated because they have been derived under stronger conditions. Finally, we give numerical examples to demonstrate the effectiveness of the derived results.     

A comparison of error bounds for linear complementarity problems of H-matrices

We give new error bounds for the linear complementarity problem when the involved matrix is an H-matrix with positive diagonals. We find classes of H-matrices for which the new bounds improve considerably other previous bounds. We also show advantages of these new bounds with respect the computational cost. A new perturbation bound of H-matrices linear complementarity problems is also presented.     

Estimates for the inverse of a matrix and bounds for eigenvalues

This paper gives new bounds for the relationship between the diagonal elements of a square matrix and the corresponding diagonal elements of the matrix inverse, as well as bounds for the eigenvalues of the matrix. The results given here generalize those of Ostrowski and Ky Fan, and have their origin in engineering application.     

New bounds for Perron root of a nonnegative matrix

In this paper, we obtain some new bounds for Perron root of a nonnegative matrix, which are expressed by easily calculated function in element of matrix. These new results generalize and improve the bounds of G. Frobenius [1] and H. Minc [2], and also extend the known results by Liu [6].     

Sharp bounds for spectral radius of nonnegative weakly irreducible tensors

We obtain the sharp upper and lower bounds for the spectral radius of a nonnegative weakly irreducible tensor. By using the technique of the representation associate matrix of a tensor and the associate directed graph of the matrix, the equality cases of the bounds are completely characterized by graph theory methods. Applying these bounds to a nonnegative irreducible matrix or a connected graph (digraph), we can improve the results of L. H. You, Y. J. Shu, and P. Z. Yuan [Linear Multilinear Algebra, 2017, 65(1): 113–128], and obtain some new or known results. Applying these bounds to a uniform hypergraph, we obtain some new results and improve some known results of X. Y. Yuan, M. Zhang, and M. Lu [Linear Algebra Appl., 2015, 484: 540–549]. Finally, we give a characterization of a strongly connected k-uniform directed hypergraph, and obtain some new results by applying these bounds to a uniform directed hypergraph.     

Improving Chistyakov’s bounds for the Perron root of a nonnegative matrix

The paper presents new two-sided bounds for the Perron root of a block-partitioned nonnegative matrix, improving Chistyakov’s bounds. The equality cases are analyzed. As an application, new conditions sufficient for a complex matrix to be a nonsingular H-matrix are obtained. Bibliography: 8 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 346, 2007, pp. 103–118.