Necessary and sufficient conditions for a matrix to be causative in a nonstationary Markov chain

Given a sequence of transition matrices for a nonstationary Markov chain, a matrix whose product on the right of a transition matrix yields the next transition matrix is called a causative matrix. A causative matrix is strongly causative if successive products continue to yield stochastic matrices. This paper presents necessary and sufficient conditions for a matrix to be causative and strongly causative with respect to an invertible transition matrix, by considering the causative matrix as a linear transformation on the rows of the transition matrix.     

关于正定矩阵的子式阵的正定性

研究正定矩阵的子矩阵,利用合同标准形分别给出了复正定矩阵的子式阵为复正定矩阵和实正定矩阵的子式阵为实正定矩阵的充分必要条件,其结果简单而实用.     

广义循环矩阵的一个性质

可表为非奇异对角矩阵和循环矩阵乘积的矩阵,我们称其为广义循环矩阵.本文给出了单位矩阵与广义循环矩阵的和矩阵的非奇异的充要条件,得到了这样和矩阵的相对增益阵列的显示表达式.     

Partitioning of invariant imbedding systems

The choice of partitioning the system matrix for a system of N linear ordinary differential equations may determine the ease or difficulty of obtaining a solution by the invariant imbedding method of Scott. This paper shows how the configuration and partitioning of the system matrix is reflected in the fundamental matrix. The partitioning of the fundamental matrix is the key to the ease or difficulty of obtaining a solution. If the fundamental matrix is known for a given system matrix configuration and partitioning, then the fundamental matrix associated with a new system matrix configuration may be derived by the same row and column interchanges that transformed the old system matrix into the new system matrix. The fundamental matrix for the new system matrix does not have to be recalculated anew from the Kronecker delta initial conditions.     

基于部分基变量的LP问题矩阵算法

基于部分基变量提出了LP问题的矩阵算法. 该算法以最优基矩阵的一个充分必要条件为基础,首先将一个初始矩阵转化为右端项和检验数均满足要求的矩阵,再转为检验数满足要求的基矩阵,最后转化为最优基矩阵.该算法具有使用范围广、计算规模小、计算过程简化、计算机易于实现的优势.矩阵算法的核心运算是求逆矩阵的运算,提出了矩阵算法的求逆问题,讨论并给出了求逆快速算法,该算法充分利用了矩阵算法迭代过程中提供的原来的逆矩阵的信息经过简单的变换得到新的逆矩阵,该算法比直接求逆法计算效率更高.     

An internal characterisation of structural matrix rings

It is known that structural matrix rings pro-vide a natural passage from complete matrix rings to upper and lower triangular matrix rings, and they often explain the peculiarities regarding certain properties of complete matrix rings on the one hand and of triangular matrix rings on the other hand. In this paper the concept of a set of matrix units in a ring associated with a quasi-order relation is introduced and used to provide an internal char-acterisation of structural matrix rings.     

加速修改AHP中的判断矩阵的贪婪算法

通过分析判断矩阵 ,一致性矩阵 ,导出矩阵及度量矩阵的关系 ,提出一种修改判断矩阵的预测加速修正的贪婪算法 .贪婪法不追求最优解 ,不要回溯 ,只希望得到较为满意的解 .当判断矩阵的一致性较差时 ,基于度量矩阵中偏离大的元素对判断矩阵一致性的影响较大 ,通过导出矩阵和度量矩阵得出加速修正的步长 .每次只修改判断矩阵的一对元素 .实例分析表明 ,修改 AHP中的判断矩阵的贪婪算法是可行的 .     

矩阵的正规化

本文考虑ｎ阶复矩阵可嵌入到ｎ＋１阶的正规矩阵的条件．证明了ｎ＞２阶的复矩阵不一定可嵌入到ｎ＋１阶的正规矩阵,而２阶复矩阵总可嵌入到３阶正规矩阵中．本文还证明了任意ｎ阶复方阵可嵌入到２ｎ阶正规矩阵中     

Sharp bounds on the spectral radius of a nonnegative matrix

We give upper and lower bounds for the spectral radius of a nonnegative matrix using its row sums and characterize the equality cases if the matrix is irreducible. Then we apply these bounds to various matrices associated with a graph, including the adjacency matrix, the signless Laplacian matrix, the distance matrix, the distance signless Laplacian matrix, and the reciprocal distance matrix. Some known results in the literature are generalized and improved.     

Fuzzy标准矩阵及Fuzzy强标准矩阵

本文在格L=[0,1]上定义了Fuzzy标准矩阵及Fuzzy强标准矩阵,得出了他们的一些基本性质。证明了Fuzzy标准矩阵是幂收敛阵;给出了Fuzzy强标准矩阵的判别条件及Fuzzy强标准矩阵是幂等的充要条件。最后对Fuzzy强标准矩阵的秩进行了讨论。     

On the best approximation matrix problem and matrix Fourier series

In this paper the concept of positive definite bilinear matrix moment functional, acting on the space of all the matrix valued continuous functions defined on a bounded interval [a,b] is introduced. The best approximation matrix problem with respect to such a functional is solved in terms of matrix Fourier series. Basic properties of matrix Fourier series such as the Riemann—Lebesgue, matrix property and the bessel—parseval matrix inequality are proved. The concept of total set with respect to a positive definite matrix functional is introduced, and the totallity of an orthonormal sequence of matrix polynomials with respect to the functional is established.     

关于合成矩阵的正定性

利用标准形分别给出了复正定矩阵的合成矩阵为复正定矩阵和实正定矩阵的合成矩阵为实正定矩阵的充分必要条件,其结果简单而实用.     

New results about semi-positive matrices

Our purpose is to present a number of new facts about the structure of semipositive matrices, involving patterns, spectra and Jordon form, sums and products, and matrix equivalence, etc. Techniques used to obtain the results may be of independent interest. Examples include: any matrix with at least two columns is a sum, and any matrix with at least two rows, a product, of semipositive matrices. Any spectrum of a real matrix with at least 2 elements is the spectrum of a square semipositive matrix, and any real matrix, except for a negative scalar matrix, is similar to a semipositive matrix. M-matrices are generalized to the non-square case and sign patterns that require semipositivity are characterized.     

ON HERMITE MATRIX POLYNOMIALS AND HERMITE MATRIX FUNCTIONS

In this paper properties of Hermite matrix polynomials and Hermite matrix functions are studied. The concept ot total set with respect to a matrix functional is introduced and the total property of the Hermite matrix polynomials is proved. Asymptotic behaviour of Hermite matrix polynomials is studied and the relationship of Hermite matrix functions with certain matrix differential equations is developed. A new expression of the matrix exponential for a wide class of matrices in terms of Hermite matrix polynomials is proposed.     

On the Wright hypergeometric matrix functions and their fractional calculus

In this paper we focus on the Wright hypergeometric matrix functions and incomplete Wright Gauss hypergeometric matrix functions by using Pochhammer matrix symbol. We first introduce the Wright hypergeometric functions of a matrix argument and examine the convergence of these matrix functions in the unit circle, then we discuss the integral representations and differential formulas of the Wright hypergeometric matrix functions. We have also carried out a similar study process for incomplete Wright Gauss hypergeometric matrix functions. Finally, we obtain some results on the transform and fractional calculus of these Wright hypergeometric matrix functions.     

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO A CONJUGATE BILINEAR MATRIX MOMENT FUNCTIONAL: BASIC THEORY

In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.     

完全单的矩阵半群

引入矩阵型Rees矩阵半群的概念,证明完全单的矩阵半群等价于矩阵型Rees矩阵半群,进而给出矩阵拓扑半群的极小理想的刻画以及完全正则矩阵半群特别是一些重要类别的群带的刻画．     

Finite iterative method for solving coupled Sylvester-transpose matrix equations

This paper is concerned with solutions to the so-called coupled Sylvester-transpose matrix equations, which include the generalized Sylvester matrix equation and Lyapunov matrix equation as special cases. By extending the idea of conjugate gradient method, an iterative algorithm is constructed to solve this kind of coupled matrix equations. When the considered matrix equations are consistent, for any initial matrix group, a solution group can be obtained within finite iteration steps in the absence of roundoff errors. The least Frobenius norm solution group of the coupled Sylvester-transpose matrix equations can be derived when a suitable initial matrix group is chosen. By applying the proposed algorithm, the optimal approximation solution group to a given matrix group can be obtained by finding the least Frobenius norm solution group of new general coupled matrix equations. Finally, a numerical example is given to illustrate that the algorithm is effective.     

Pascal矩阵与Vandermonde矩阵的关系

EI-Mikkawy M证明了对称Pascal矩阵Q_n和Vlandermonde矩阵V_n之间满足矩阵方程Q_n=T_nV_n,这里T_n是一个随机矩阵。本文证明了随机矩阵T_n能够分解成第一类Stirling矩阵和对角矩阵的乘积,得到了矩阵T_n的元素之间的递推关系,从而回答了EI-Mikkawy M的一个公开问题。同时得到了一些与Stirling数相关的组合恒等式。     

Hermite-广义反Hamilton矩阵的一类反问题

给定矩阵X和B,利用矩阵的广义奇异值分解,得到了矩阵方程X~HAX=B有Hermite-广义反Hamiton解的充分必要条件及有解时解的—般表达式.用S_E表示此矩阵方程的解集合,证明了S_E中存在唯一的矩阵(?),使得(?)与给定矩阵A的差的Frobenius范数最小,并且给出了矩阵(?)的表达式;同时也证明了S_E中存在唯一的矩阵A_o,使得A_o是此矩阵方程的极小Frobenius范数Hermite-广义反Hamilton解,并且给出了矩阵A_o的表达式.