关于幂等矩阵一个秩等式的推广

利用分块矩阵技巧对关于幂等矩阵A的等式rank(A)+rank(A-E)=n进行推广,得Am+1=λA当且仅当rank(Ak)+rank(Am-λE)l=n.     

两矩阵和的Drazin逆新的表示及其应用

正1引言设C~(m×n)表示m×n复矩阵的集合,rank(A)表示矩阵A的秩,对于A∈C~(m×n),使得rank(A~k)=rank(A~(k+1))成立的最小正整数k称为A的指标,记作ind(A).设ind(A)=k,满足A~(k+1)X=A~k,XAX=X,AX=XA的矩阵X称为矩阵A的Drazin逆,记为A~D.若ind(A)=1,则A~D称为A的群逆,记作A~#.记A~π=I-AA~D.矩阵的Drazin逆在奇异微分方程,迭代法,控制论中都有广泛的应用~([1,2]).     

复矩阵和的Drazin逆

1引 言设Cn×n为n×n复矩阵的集合,对A∈Cn×n,满足rank(Ak+1 )=rank( Ak)的最小非负整数k称为A的指标,记为Ind(A)=κ,则存在唯一矩阵AD∈Cn×n,满足下列矩阵方程组[1]:Ak=Ak+1AD AD=ADAAD AAD=ADAAD称为A的Drazin逆.若Ind(A)=1,则AD称为A的群逆,记为A#.显然Ind(A)=0当且仅当A非奇异,此时AD =A-1.     

整环上广义幂级数环的分解性质

设A■B是整环的扩张, (S,≤)是满足一定条件的严格偏序幺半群, [[BS,≤]]是整环B上的广义幂级数环.本文研究整环[[BS,≤]]和{f∈[[BS,≤]]|f(0)∈A}的ACCP条件和BFD性质. 结果表明,整环{f∈[[BS,≤]]|f(0)∈A}的分解性质不仅依赖于A和B的分解性质以及U(A)和U(B),而且还依赖于幺半群S的分解性质.该结果能够构造出具有某种分解性质的整环的新例子.     

整环上广义幂级数环的分解性质

设A(て)B是整环的扩张,(S,≤)是满足一定条件的严格偏序幺半群,[[BS,≤]]是整环B上的广义幂级数环.本文研究整环[Bs,≤]]和{f∈[[Bs,≤]]|f(0)∈A}的ACCP条件和BFD性质.结果表明,整环{f∈[[BS,≤]]|f(0)∈A}的分解性质不仅依赖于A和B的分解性质以及U(A)和U(B),而且还依赖于幺半群S的分解性质.该结果能够构造出具有某种分解性质的整环的新例子.     

加权Moore-Penrose逆的一些进展

1引言 本文中,Cm×n代表复数域C上的所有m×n阶矩阵的集合.对A∈Cm×n,A*、R(A)、N(A)、rank(A)分别代表A的共轭转置、列空间、零空间、秩.使得rank(Ak)=rank(Ak+1)成立的最小正整数k称为A的指标,记作ind(A).     

两个分块矩阵相似性的研究

给出两个分块矩阵相似的两个充分必要条件 .也就是说 ,如果两个方阵 A和 B在 A2 =0和 B2 =0的条件下 ,则两个分块矩阵 A C0 B 和 A 00 B 相似的充分必要条件是 :rank A C0 B =rank(A) +rank(B)和 AC +CB =0 .如果两个方阵 A和 B在 A2 =A和 B2 =B的条件下 ,则两个分块矩阵 A C0 B和 A 00 B 相似的充分必要条件是 :AC +CB =C.     

整环上保持矩阵等价的映射

矩阵论是代数学的重要分支,而矩阵保持问题是矩阵论中的重要问题.交换环上的矩阵保持问题,主要研究保持交换环上矩阵的某种性质或关系的映射.在整环上的矩阵空间里,给出了映射保持矩阵等价的一个充分必要条件.     

主理想整环上的线性方程组的通解

将文[1]中整数环上的线性方程组问题推广到主理想整环上,利用主理想整环上的矩阵的初等变换及等价标准形导出了主理想整环上的线性方程组有解的一个充分必要条件和求解方法.最后,通过实例说明了算法.     

环上伴随矩阵的若干性质探讨

本文探讨了交换环上伴随矩阵的若干性质,给出了整环上的两个主要结论.这些均推广了域上的情形.     

On the coincidence of the factor and Gondran–Minoux rank functions of matrices over a semiring

We consider the rank functions of matrices over semirings, functions that generalize the classical notion of the rank of a matrix over a field. We study semirings over which the factor and Gondran–Minoux ranks of any matrix coincide. It is shown that every semiring satisfying that condition is a subsemiring of a field. We provide an example of an integral domain over which the factor and Gondran–Minoux ranks are different.     

整循环图的秩（英文）

A graph is called an integral graph if it has an integral spectrum i.e.,all eigenvalues are integers.A graph is called circulant graph if it is Cayley graph on the circulant group,i.e.,its adjacency matrix is circulant.The rank of a graph is defined to be the rank of its adjacency matrix.This importance of the rank,due to applications in physics,chemistry and combinatorics.In this paper,using Ramanujan sums,we study the rank of integral circulant graphs and gave some simple computational formulas for the rank and provide an example which shows the formula is sharp.     

A wavelets method for plane elasticity problem

A Neumann boundary value problem of plane elasticity problem in the exterior circular domain is reduced into an equivalent natural boundary integral equation and a Poisson integral formula with the DtN method. Using the trigonometric wavelets and Galerkin method, we obtain a fast numerical method for the natural boundary integral equation which has an unique solution in the quotient space. We decompose the stiffness matrix in our numerical method into four circulant and symmetrical or antisymmetrical submatrices, and hence the solution of the associated linear algebraic system can be solved with the fast Fourier transform (FFT) and the inverse fast Fourier transform (IFFT) instead of the inverse matrix. Examples are given for demonstrating our method has good accuracy of our method even though the exact solution is almost singular.     

Integral closure of a cubic extension and applications

In this paper, we compute the integral closure of a cubic extension over a Noetherian unique factorization domain. We also present some applications to triple coverings and to rank two reflexive sheaves over an algebraic variety.

     

求矩阵广义逆的另一种初等变换方法

讨论了当矩阵A为满秩矩阵时求其广义逆的一种方法,并将此方法推广,给出当A为非满秩矩阵时求其广义逆的一般方法,同时给出算例.本文推广了文献[1]的结果.     

The minimal number of generators of a finite semigroup

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (not necessarily regular) Rees matrix semigroup over a group. The formula is expressed in terms of the dimensions of the structure matrix, and the relative rank of a certain subset of the structure group obtained from subgroups generated by entries in the structure matrix, which is assumed to be in Graham normal form. This formula is then applied to answer questions about minimal generating sets of certain natural families of transformation semigroups. In particular, the problem of determining the maximum rank of a subsemigroup of the full transformation monoid (and of the symmetric inverse semigroup) is considered.     

On generalized inverses of matrices over integral domains

It is proved that a matrix A over an integral domain admits a 1-inverse if and only if a linear combination of all the r × r minors of A is equal to one, where r is the rank of A. Some results on the existence of Moore-Penrose inverses are also obtained.     

Jordan superalgebras of vector type and projective modules

We study connection between the Jordan superalgebras of vector type and the finitely generated projective modules of rank 1 over an integral domain.     

2-Simple ore domains of stable rank 1

It is known that a simple Bézout domain is a domain of elementary divisors if and only if it is 2-simple. We prove that, over a 2-simple Ore domain of stable rank 1, an arbitrary matrix that is not a divisor of zero is equivalent to a canonical diagonal matrix.     

DFT calculation for the {2}-inverse of a polynomial matrix with prescribed image and kernel

In this paper, we first give the finite algorithm for generalized inverse of a matrix A over an integral domain, and, based on it and the discrete Fourier transform, present an algorithm for calculating {2}-inverses of a polynomial matrix with prescribed image and kernel. And the algorithm is implemented in the Mathematica programming language and expands the algorithms in [13].