n阶矩阵的可交换空间的维数

本文通过研究矩阵的若当相似形矩阵的可交换空间 ,从而得到了矩阵的可交换空间的维数公式     

n阶矩阵的可交换空间的维数

本通过研究矩阵的若当相似形矩阵的可交换空间，从而得到了矩阵的可交换空间的维数公式。     

关于多个子空间的交空间与维数公式的推广

通过讨论,得到了关于多个子空间的交空间的进一步的结果.并利用这些结果,给出了维数公式的一个新的推广形式,从而完善了维数公式的理论.     

两类模糊数判断矩阵的转换关系及一致性研究

研究了三角模糊数互反和互补判断矩阵的相互转换和一致性问题.提出了三角模糊数互反判断矩阵完全一致性的定义以及三角模糊数互补判断矩阵加性一致性和乘性一致性的定义,给出了两类模糊数判断矩阵相互转化的公式,论证了转换公式对判断矩阵一致性的保持关系.最后,基于一致性模糊数判断矩阵元素和排序权值的关系,建立了两个方案排序的非线性规划模型.     

模糊数排序的可能度方法

由两个模糊数的隶属函数确定三个面积,据此建立一个对模糊数进行大小比较的可能度计算公式.公式表达式非常简洁,同时还具有传递性、互补性等诸多良好的性质,因而具有很强的实用性和可操作性.对给定的一组模糊数,先利用两两比较的结果建立一个可能度矩阵,同时给出基于可能度矩阵的模糊数排序算法.最后给出一个排序算法的实例.     

基于优势度分析的三角模糊数判断矩阵的排序方法

研究了三角模糊数判断矩阵的排序问题,在两个三角模糊数相互比较大小的可能度的基础上,综合分析直接和间接两个方面的比较因素,提出了两个三角模糊数比较的优势度概念.对三角模糊数判断矩阵的行元素信息进行集结并利用所定义的优势度概念作为度量对集结的结果两两进行比较,构造出相应的以实数表示的模糊互补优势度矩阵,进而利用模糊互补判断矩阵的排序公式得到方案的排序权值.最后通过一个算例说明了提出的排序方法.     

四元数半空间上模形式的维数公式 *

利用Selberg迹公式导出次数为 2的四元数半空间上尖点形式的一个维数公式 ,并计算出一些共轭类对维数公式的贡献 ,同时还得到模群共轭类划分的一些结果 .     

基于一致性逼近的三角模糊数互补判断矩阵的排序方法

研究了元素为三角模糊数形式的互补判断矩阵的一致性和排序问题.分析了三角模糊数互补判断矩阵和三角模糊数互反判断矩阵之间的相互转换关系,提出了这两类判断矩阵完全一致性的概念并得到了三角模糊数互补判断矩阵的元素和排序权值之间的关系,在此基础上建立了一个多目标优化模型,通过求解该模型得到三角模糊数互补判断矩阵的排序向量,利用已有的模糊数比较大小公式得到方案的排序,最后给出了一个算例.     

区间数互反矩阵几何加权集成多属性群决策方法

研究了属性值以区间数表示的群决策问题,提出了区间数决策向量转化为互反判断矩阵的公式,定义了区间数互反判断矩阵几何加权集成算子.在此基础上,提出了区间数多属性群决策的新方法.方法首先针对每一个属性,将各决策者、各方案对应此属性的区间数向量转换为互反判断矩阵,由新定义的集成算子进行集成.由集成区间数矩阵的上界、下界矩阵计算各方案关于此属性的排序向量.由属性权重、可能度和排序公式对方案进行排序.最后给出一个实例进行分析,结果表明了此方法的实用性和可行性.     

一类高阶矩阵差分方程的解及渐近稳定性

讨论了一类高阶矩阵差分方程的解及渐近稳定性问题.利用特征子空间的维数得到了特征方程存在可对角化解的一个充要条件;然后利用特征方程的相异解刻划出该矩阵差分方程的通解,并给出其解渐近稳定的两个充分条件.推广了相关文献的结果.     

矩阵逆半群

讨论矩阵逆半群的一些基本性质, 证明矩阵逆半群的幂等元集是有限布尔格的子半格, 从而证明等秩矩阵逆半群是群, 然后完全确定二级矩阵逆半群的结构：一个二级矩阵逆半群或者同构于二级线性群,或者同构于二级线性群添加一个零元素,或者是交换线性群的有限半格, 或者满足其他一些性质; 对于由某些二级矩阵构成的集合, 我们给出了它们成为矩阵逆半群的充分必要条件.     

Spaces of real matrices of fixed small rank

In this paper we investigate the maximal dimension for k-spaces of real matrices for small values of k. We also give some bounds for the dimension of spaces of real matrices of high rank.     

Reduction of G-orthogonal matrices

The G-orthogonal matrices, defined in this paper, have, unlike orthogonal and Lorentz matrices, complex eigenvalues of modulus not equal to 1, and a corresponding invariant subspace of dimension four. They can be expressed as the exponential of some canonical matrix.     

Extremal plane stochastic matrices of dimension three

We examine combinatorial properties of extremal plane stochastic matrices of dimension three. Methods are given for the construction of such extremal matrices of any order. We obtain a lower bound for the number of connected extremal matrices of order n and conclude with some open problems.     

On a class of matrices generated by certain generalized permutation matrices and applications

ABSTRACT

In this paper, we study a particular class of matrices generated by generalized permutation matrices corresponding to a subgroup of some permutation group. As applications, we first present a technique from which we can get closed formulas for the roots of many families of polynomial equations with degree between 5 and 10, inclusive. Then, we describe a tool that shows how to find solutions to Fermat's last theorem and Beal's conjecture over the square integer matrices of any dimension. Finally, simple generalizations of some of the concepts in number theory to integer square matrices are presented.     

Clifford分析中k-正则函数的一些性质和高阶Cauchy型积分的边值特性

本文首先给出了定义于R~n取值于Clifford代数C(V_(n,0))中k-正则函数的若干性质,如唯一性定理,Cauchy-Pompeiu公式,高阶Cauchy积分公式,平均值定理等,然后在k-正则函数的高阶Cauchy积分公式的基础上,相应的定义了r次连续可微函数的高阶Cauchy型积分,并给出了它的Cauchy主值,Plemelj公式,边值的Ho|¨lder连续性及其Privalov定理.     

Complete controllability and contractibility in multimodal systems

The concept of a strictly positive definite set of Hermitian matrices is introduced. It is shown that a strictly positive definite set is always a positive definite set, and conditions are found under which a positive definite set is strictly positive definite. We also show that a set of Hermitian matrices is strictly positive definite if and only if some nonnegative linear combination of these matrices is a positive definite matrix. For state dimension two, we use this concept to find necessary and sufficient conditions for a two-mode completely controllable irreducible multimodal system to be contractible relative to an elliptic norm. For general state dimensions, we give necessary and sufficient conditions for a special-type two-mode completely controllable irreducible system to be contractible relative to a weakly monotone norm. Applying the above results, we show that, for state dimension two, there exists a completely controllable two-mode system which is not contractible relative to either an elliptic or a weakly monotone norm. We leave open the question whether or not complete controllability implies contractibility, relative to some norm, for multimodal systems of two or more modes.     

The shifted number system for fast linear algebra on integer matrices

The shifted number system is presented: a method for detecting and avoiding error producing carries during approximate computations with truncated expansions of rational numbers. Using the shifted number system the high-order lifting and integrality certification techniques of Storjohann 2003 for polynomial matrices are extended to the integer case. Las Vegas reductions to integer matrix multiplication are given for some problems involving integer matrices: the determinant and a solution of a linear system can be computed with about the same number of bit operations as required to multiply together two matrices having the same dimension and size of entries as the input matrix. The algorithms are space efficient.     

On the characterization of the dimension of a compact metric spaceK by the representing matrices ofC(K)

We state and prove some characterizations of the topological dimension of compact metric spacesK by the matrices representingC(K) as a predual ofL ₁(μ).     

Singularity, Wielandt’s lemma and singular values

In this study, some upper and lower bounds for singular values of a general complex matrix are investigated, according to singularity and Wielandt’s lemma of matrices. Especially, some relationships between the singular values of the matrix A and its block norm matrix are established. Based on these relationships, one may obtain the effective estimates for the singular values of large matrices by using the lower dimension norm matrices. In addition, a small error in Piazza (2002) [G. Piazza, T. Politi, An upper bound for the condition number of a matrix in spectral norm, J. Comput. Appl. Math. 143 (1) (2002) 141-144] is also corrected. Some numerical experiments on saddle point problems show that these results are simple and sharp under suitable conditions.