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

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

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.     

一类非线性矩阵方程对称解的双迭代算法

利用逆矩阵的Neumann级数形式,将在Schur插值问题中遇到的含未知矩阵二次项之逆的非线性矩阵方程转化为高次多项式矩阵方程,然后采用牛顿算法求高次多项式矩阵方程的对称解,并采用修正共轭梯度法求由牛顿算法每一步迭代计算导出的线性矩阵方程的对称解或者对称最小二乘解,建立求非线性矩阵方程的对称解的双迭代算法.双迭代算法仅要求非线性矩阵方程有对称解,不要求它的对称解唯一,也不对它的系数矩阵做附加限定.数值算例表明,双迭代算法是有效的.     

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.     

广义酉矩阵与广义Hermite矩阵

给出了广义酉矩阵与广义(斜)Hermite矩阵的概念，研究了它们的性质及其与酉阵、共轭辛阵、Hermite阵、Hamilton及广义逆矩阵之间的联系；取得了许多新的结果；推广了酉矩阵、Hermite阵与斜Hermite阵间的相应结果，特别将正交阵的广义Cayley分解推广到了广义酉矩阵上；将各类酉矩阵、Hermite矩阵及广义逆矩阵统一了起来．     

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

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

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

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

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.     

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.     

确定概率条件下风险型多属性消错决策方法

以确定概率条件下风险型多属性决策问题为研究对象.根据消错理论提出了错误值、极限损失值等概念,以效益矩阵为基础建立起正负理想矩阵和错误值矩阵,以正负理想矩阵为基础构建极限损失矩阵,以错误值矩阵、属性权重和极限损失矩阵为基础构建综合错误损失矩阵.接着根据期望理论,利用综合错误损失矩阵求取期望错误损失向量,并以此作为策略选择的根据.最后通过实例证明了研究的有效性和可行性.     

拟酉矩阵与拟Hermite矩阵

利用次Hermite矩阵给出了拟酉矩阵与（反）拟Hermite矩阵的概念,研究了它们的基础本性质及其之间的关系,将各类酉矩阵与Hermite矩阵一了起来。     

关于次酉矩阵与次镜象矩阵

提出了共轭次转置矩阵、次酉矩阵与次镜象矩阵的概念，对它们的基本性质及其与（反）次Kermite阵的关系进行了深入的研究，获得了一些新的结果，将正交阵的广义Gayley分解推广到了次酉阵上。     

Inverting linear combinations of identity and generalized Catalan matrices

We introduce the notion of the generalized Catalan matrix as a kind of lower triangular Toeplitz matrix whose nonzero elements involve the generalized Catalan numbers. Inverse of the linear combination of the Pascal matrix with the identity matrix is computed in Aggarwala and Lamoureux (2002) [1]. In this paper, continuing this idea, we invert various linear combinations of the generalized Catalan matrix with the identity matrix. A simple and efficient approach to invert the Pascal matrix plus one in terms of the Hadamard product of the Pascal matrix and appropriate lower triangular Toeplitz matrices is considered in Yang and Liu (2006) [14]. We derive representations for inverses of linear combinations of the generalized Catalan matrix and the identity matrix, in terms of the Hadamard product which includes the Generalized Catalan matrix and appropriate lower triangular Toeplitz matrix.     

矩阵的正规化

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

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数相关的组合恒等式。     

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.     

关于合成矩阵的正定性

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