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

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

关于反循环矩阵的对角化问题

反循环矩阵是一种特殊类型的矩阵，它本身有许多重要的性质，而且与矩阵的对角化问题有联系．本文拟探讨反循环矩阵的对角化问题，以及任一ｎ阶方阵Ａ可对角化时，Ａ与反循环矩阵之间的关系．     

一类特殊的分块反循环矩阵的特征值问题

利用r-循环矩阵的基本性质,探讨了一类特殊的分块反循环矩阵的特征值问题．     

关于反循环矩阵的对角化问题

反循环矩阵是一种特殊类型的矩阵，它本身有许多重要的性质,而且与矩阵的对角化问题有联系,本文拟探讨反循环矩阵的对角化问题,以及任一n阶方阵A可对角化时，A与反循环矩阵之间的关系。     

关于K-分块循环矩阵及其对角化问题的讨论

给出了K-分块循环矩阵的概念,并探讨了K-分块循环矩阵的相似类及其对角化问题.     

一类特殊的分块反循环矩阵的特征值问题(英文)

利用r-循环矩阵的基本性质,探讨了一类特殊的分块反循环矩阵的特征值问题.     

反对称矩阵的一种计算方法

本文讨论反对称矩阵的数值计算问题．指出联立方程求解可以用分块矩阵ＬＤＬ^Ｔ算法．对于反对称阵的辛本征问题论述了辛雅可比算法，辛Ｈｏｕｓｅｈｏｌｄｅｒ变换．分块三对角化等．对最优控制、结构力学、波的传播等，是一种好的算法．     

关于r-分块循环矩阵及其对角化问题的探讨

本文给出了r-分块循环矩阵的概念,并利用矩阵的张量积探讨了r-分块循环矩阵的相似类及其对角化问题,得出了一些重要的结论.     

矩阵广义对角化的标准形

定义了标准循环分块对角矩阵的概念,给出了矩阵广义对角化的标准形及其算法.     

分块带状矩阵的逆

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]等关于分块三对角阵求逆的相关结果．     

矩阵的分块初等变换与分块初等阵及其应用

讨论了矩阵分块初等变换和分块初等阵的定义和性质,利用这一工具研究了行列式的分块运算,分块矩阵的求逆和对称阵的分块合同变换等问题.     

A direct bijection between descending plane partitions with no special parts and permutation matrices

We present a direct bijection between descending plane partitions with no special parts and permutation matrices. This bijection has the desirable property that the number of parts of the descending plane partition corresponds to the inversion number of the permutation. Additionally, the number of maximum parts in the descending plane partition corresponds to the position of the one in the last column of the permutation matrix. We also discuss the possible extension of this approach to finding a bijection between descending plane partitions and alternating sign matrices.     

Reflection positivity, rank connectivity, and homomorphism of graphs

It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and exponential rank connectivity. In terms of statistical physics, this can be viewed as a characterization of partition functions of vertex coloring models.

     

粗糙集理论在属性约简及知识分类中的应用

本针对不完备信息系统属性约简的两种定义，证明了两的等价性。在此基础上结合粗糙集理论提出了相似矩阵、相似区间的概念，并将其应用于不完备信息系统知识分类的问题中。     

Image partition regularity near zero

Many of the classical results of Ramsey Theory are naturally stated in terms of image partition regularity of matrices. Many characterizations are known of image partition regularity over N and other subsemigroups of (R,+). We study several notions of image partition regularity near zero for both finite and infinite matrices, and establish relationships which must hold among these notions.     

Completeness of the Description of an Equilibrium Canonical Ensemble by a Two-Particle Partition Function

We show that in the equilibrium classical canonical ensemble of particles with pair interaction, the full Gibbs partition function can be uniquely expressed in terms of the two-particle partition function. This implies that for a fixed number N of particles in the equilibrium system and a fixed volume V and temperature T, the two-particle partition function fully describes the Gibbs partition as well as the N-particle system in question. The Gibbs partition can be represented as a power series in the two-particle partition function. As an example, we give the linear term of this expansion. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 145, No. 1, pp. 123–132, October, 2005.     

Asymptotics of partition functions in a fermionic matrix model and of related q‐polynomials

In this paper, we study asymptotics of the thermal partition function of a model of quantum mechanical fermions with matrix‐like index structure and quartic interactions. This partition function is given explicitly by a Wronskian of the Stieltjes‐Wigert polynomials. Our asymptotic results involve the theta function and its derivatives. We also develop a new asymptotic method for general q‐polynomials.     

Feasible partition problem in reverse convex and convex mixed-integer programming

In this paper we consider the consistent partition problem in reverse convex and convex mixed-integer programming. In particular we will show that for the considered classes of convex functions, both integer and relaxed systems can be partitioned into two disjoint subsystems, each of which is consistent and defines an unbounded region. The polynomial time algorithm to generate the partition will be proposed and the algorithm for a maximal partition will also be provided.     

Large sample properties of estimates of a discrete grade of membership model

Increasingly, fuzzy partitions are being used in multivariate classification problems as an alternative to the crisp classification procedures commonly used. One such fuzzy partition, the grade of membership model, partitions individuals into fuzzy sets using multivariate categorical data. Although the statistical methods used to estimate fuzzy membership for this model are based on maximum likelihood methods, large sample properties of the estimation procedure are problematic for two reasons. First, the number of incidental parameters increases with the size of the sample. Second, estimated parameters fall on the boundary of the parameter space with non-zero probability. This paper examines the consistency of the likelihood approach when estimating the components of a particular probability model that gives rise to a fuzzy partition. The results of the consistency proof are used to determine the large sample distribution of the estimates. Common methods of classifying individuals based on multivariate observations attempt to place each individual into crisply defined sets. The fuzzy partition allows for individual to individual heterogeneity, beyond simply errors in measurement, by defining a set of pure type characteristics and determining each individual's distance from these pure types. Both the profiles of the pure types and the heterogeneity of the individuals must be estimated from data. These estimates empirically define the fuzzy partition. In the current paper, this data is assumed to be categorical data. Because of the large number of parameters to be estimated and the limitations of categorical data, one may be concerned about whether or not the fuzzy partition can be estimated consistently. This paper shows that if heterogeneity is measured with respect to a fixed number of moments of the grade of membership scores of each individual, the estimated fuzzy partition is consistent.