G-函数与分块阵的特征值分布

利用由Nowosad和Hoffman提出的G-函数概念来刻划分块阵的特征值分布，对块对角占代性进行了G-函数推广，并研究它们的本质联系，获得了分块阵特征值若干包含域，以及M矩阵的充分条件．所得结果较已有结果，明显具有一般性．     

一类分块反循环矩阵及其对角化问题

1引言分块反循环矩阵在数值分析、优化理论、泛函微分方程、工程力学等学科领域有十分重要的应用,当今电子计算机及计算技术的迅速发展为分块反循环矩阵的应用开辟了更为广阔的前景．本文讨论了分块反循环矩阵的交换性、特征根及对角化问题,得到任一分块反循环矩阵可用一个正交矩阵组线性表示和基本分块反循环矩阵在复数域上可以对角化且相似于对角阵的结论．     

分块矩阵的初等变换

本文将矩阵的初等变换的概念推广到分块矩阵上并建立了计算分块矩阵的逆矩阵和分块方阵的行列式的若干简易方法．     

关于分块反循环矩阵及其对角化的讨论

本文给出了分块反循环矩阵的概念，讨论了含分块反循环矩阵的相似类，并且得知分块反循环矩阵一定与分块循环矩阵相似．     

分块矩阵的初等变换

本将矩阵的初等变换的概念推广到分块矩阵上并建立了计算分块矩阵的逆矩阵和分块方阵的行列式的若干简易方法。     

一类特殊分块矩阵为循环矩阵的循环分块矩阵的几个性质

本文给出一类特殊分块矩阵为循环矩阵的循环分块矩阵的几个性质。     

分块带状矩阵的逆

1引言如果分块矩阵A=(A_(ij))_(n×n)满足A_(ij)=O(j-i＞p且i-j＞q),其中A_(ij)为m阶矩阵,则称A为(p,q)-分块带状矩阵．分块带状矩阵在一些实际问题中经常出现,例如在量子场论中用途很广的非线性Schr(?)dinger方程的差分离散问题,解热传导问题等,都会遇到分块带状矩阵．常见的分块三对角矩阵,分块五对角矩阵都是特殊的分块带状矩阵．采用通常的方法求解分块带状矩阵的逆矩阵时,需要进行O(n~3)次m阶矩阵的运算．本文首先将分块带状矩阵扩充成可逆的分块上(下)三角矩阵,利用其逆矩阵导出了分块带状矩阵的逆矩阵表达式；进而利用所得到的公式分别推导了分块三对角矩阵及分块五对角矩阵的逆矩阵的快速算法,所需运算量为O(n~2)次m阶矩阵的运算．本文的结果扩充了文[1]等关于分块三对角阵求逆的相关结果．     

矩阵分块方法的应用

矩阵的分块方法是矩阵论的一种重要方法,选择合适的分块方法可使一些证明变得简单明了.利用矩阵的分块方法给出关于矩阵的秩、特征多项式、行列式的若干等式、不等式及相关命题的简洁证明,有利于初学者理解和掌握.     

首尾差分块循环矩阵的性质及非奇异性

本文提出了首尾差分块循环矩阵的概念,包括(n,m)型首尾差分块循环矩阵和(n,m)型二重首尾差分块循环矩阵,讨论了它们的性质,并给出了判定其非奇异性的充要条件.     

对角因子分块循环矩阵的对角化和谱分解

导出了对角因子分块循环矩阵的概念，把循环矩阵的对角化和谱分解推广到具有对角因子循环结构的分块矩阵中去．     

Partition and composition matrices

This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A partition matrix is a composition matrix in which an order is placed on where entries may appear relative to one-another.We show that partition matrices are in one-to-one correspondence with inversion tables. Non-decreasing inversion tables are shown to correspond to partition matrices with a row ordering relation. Partition matrices which are s-diagonal are classified in terms of inversion tables. Bidiagonal partition matrices are enumerated using the transfer-matrix method and are equinumerous with permutations which are sortable by two pop-stacks in parallel.We show that composition matrices on X are in one-to-one correspondence with (2+2)-free posets on X. Also, composition matrices whose rows satisfy a column-ordering relation are shown to be in one-to-one correspondence with parking functions. Finally, we show that pairs of ascent sequences and permutations are in one-to-one correspondence with (2+2)-free posets whose elements are the cycles of a permutation, and use this relation to give an expression for the number of (2+2)-free posets on {1,…,n}.     

The rank of the endomorphism monoid of a uniform partition

The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a finite set that leave a non-trivial uniform partition invariant. That involves proving that the rank of a wreath product of two symmetric groups is two and then use the fact that the endomorphism monoid of a partition is isomorphic to a wreath product of two full transformation semigroups. The calculation of the rank of these semigroups solves an open question.     

Convex decompositions of fuzzy partitions

In this paper we investigate some algebraic and geometric properties of fuzzy partition spaces (convex hulls of hard or conventional partition spaces). In particular, we obtain their dimensions, and describe a number of algorithms for effecting convex decompositions. Two of these are easily programmable, and each affords a different insight about data structures suggested by the fuzzy partition decomposed. We also show how the sequence of partitions in any convex decomposition leads to a matrix for which the norm of the corresponding coefficient vector equals a scalar measure of partition fuzziness used with certain fuzzy clustering algorithms.     

Decomposing a Matrix into two Submatrices with Extremally Small (2,1)-Norm

Mathematical Notes - We consider conditions on a matrix A with unit operator (2,1)-norm ensuring the existence of a partition of this matrix into two submatrices with (2,1)-norms close to 1/2.     

二类1错误矩阵方程增优置换变换求解及其在城市交通管理中的应用研究

消错学的错误矩阵可表达错误逻辑里所定义的分解、相似、增加、置换、毁灭、单位变换等转化词,针对其中的置换变换,构建了二类1错误矩阵方程增优置换变换错误矩阵方程,并讨论了该类错误矩阵方程的求解.用交通管理问题对错误矩阵进行了举例,并构建相应的错误矩阵方程,利用上述的求解方法,对二类1方程置换变换进行了求解.     

A probabilistic analysis of a discrete-time evolution in recombination

We study the discrete-time evolution of a recombination transformation in population genetics. The transformation acts on a product probability space, and its evolution can be described by a Markov chain on a set of partitions that converges to the finest partition. We describe the geometric decay rate to this limit and the quasi-stationary behavior of the Markov chain when conditioned on the event that the chain does not hit the limit.     

Variants of classical q-hypergeometric identities and partition implications

Utilizing a six-variable extension of Heine’s q-hypergeometric transformation that we previously obtained, we now derive variants of Heine’s transformation formula and the Lebesgue identity. The variant of Cauchy’s identity also obtained by us earlier is crucial in these derivations. We then establish some new partition identities which are variants of, and shed new light on, some fundamental classical partition identities.     

输入采用标准模糊分划的模糊控制系统性质及稳定性分析

具体定义模糊控制系统输入变量的标准模糊分划，研究和证明输入采用标准模糊分划的模糊控制系统的有关性质。在此基础上，采用Lyapunov直接法研究该类模糊控制系统的稳定性，提出一个判定模糊控制系统稳定性的充分条件。该条件将以往方法要在所有的子系统中寻找一个公共的正定矩阵满足Lyapunov不等式，放宽为在各最大交叠规则组内分别寻找公共的正定矩阵，从而减小稳定性判定的保守性和难度。