两个矩阵命题的统一证明与讨论

本文给出了两个矩阵命题的统一。     

单叶矩阵函数的一个充要条件(英文)

本文研究开单位圆盘D={|z|<1}内的n×n阶复矩阵函数F(z)=(f_(i k)(z))1≤i,k≤n,得到了矩阵函数F(z)在D内单叶的一个充分必要条件。     

n元一次不定方程的计算机解法

给出了用矩阵方法求解n元一次不定方程的算法与计算机程序。与其它方法相比,本方法具有算法简单、易于实现以及通用性好等优点。     

用广义特征矩阵寻找若当链的方法

定义了复数域上方阵的广义特征矩阵，它们可通过解线性方程组求出。利用它们可求出A的若当链，从而给出了一种求A的过渡矩阵的方法。     

矩阵与分式递推数列的结合点

以高等代数中矩阵为工具，解决分式递推数列问题，从而寻求到矩阵与分式递推数列的结合点。     

低相关性压缩感知表示基学习算法

压缩感知理论作为一种新的信息压缩与采样理论,广泛用于各种信号的压缩与采样.提出一种低相关压缩感知稀疏表示基学习算法,用于实现稀疏投影下的自适应稀疏表示基设计,从而有效提高在稀疏采样压缩情况下的压缩感知数据信号的恢复性能.实验结果表明本文提出的方法可以有效提高数据恢复性能.     

Rule Generation Based on Dominance Matrices and Functions

Rough set theory has proved to be a useful tool for rule induction. But, the theory based on indiscemibility relation or similarity relation cannot induce rules from decision tables with criteria. Greco et al have proposed a new rough set approach based on dominance relation to handle the problems. In this paper, the concept of dominance matrix is put forward and the dominance function is constructed to compute the minimal decision rules that are more general and applicable than the ones induced by the classical rough set theory. In addition,the methodology of simplification is presented to eliminate the redundancy in the rule set.