英语人>网络例句>matrix semigroup 相关的网络例句
matrix semigroup相关的网络例句

查询词典 matrix semigroup

与 matrix semigroup 相关的网络例句 [注:此内容来源于网络,仅供参考]

Lastly , from a primitive rpp semigroup with zero , we built up a type A blocked Rees matrix semigroup and showed a semigroup S is a primitive rpp semigroup if and only if S is isomorphic toa type A blocked Rees matrix semigroup.

该结果的一个特例就是可消幺半群上的Rees矩阵半群。

Therefore, in order to offer reference to readers, the paper systematically expound and prove the eigenvalue of special matrix that base on idempotent matrix, antiidempotent matrix, involutory matrix, anntiinvolutory matrix, nilpotent matrix, orthogonal matrix, polynomial matrix, the shape of , matrix, diagonal matrix, invertidle matrix, adjoint matrix, similar matrix, transposed matrix, numerical matrix, companion matrix, and practicality and superiority of the achievement was showed by some examples.

为此本文系统地阐述幂等矩阵,反幂等矩阵,对合矩阵,反对合矩阵,幂零矩阵,正交矩阵,多项式矩阵,形为:,矩阵,对角矩阵,可逆矩阵,伴随矩阵,相似矩阵,转置矩阵,友矩阵一系列特殊矩阵的特征值问题并加以证明,并通过一些具体例子展示所得成果的实用性和优越性。

In chapter 2, we prove that an abundant semigroup satisfying the regularity is a locally E-solid semigroup if and only if it is an E-local isomorphic image of some abundant Rees matrix semigroup AM over an E-solid abundant semigroup with entries of the sandwich matrix P being regular elements of T.

第二章,我们证明了满足正则性条件的富足半群是局部E-solid(quasi-adequate,R~*-unipotent)半群当且仅当它是某个富足Rees矩阵半群RM的E-local同构像,其中sandwich矩阵的P元素是T中的正则元。

By using properties of quasi-regular semigroups and left central idempotents, some statements are proved. Let S be a quasi-right semigroup, then (1) S is a quasi-completely regular semigroup;(2) RegS is a completely regular semigroup;(3) R(superscript *) is the smallest semilattice congruence on S;(4) Each R-class T(subscript α) on RegS is a right group;(5) T(subscript α)G(subscript α)×E(subscript α), where G(subscript α) is a group, E(subscript α) is a right zero semigroup.

利用拟正则半群和左中心幂等元的性质,证明了S为拟右半群时,(1) S为拟完全正则半群;(2) RegS为完全正则半群;(3) R为S上的最小半格同余;(4) RegS上的每个R-类T为右群;(5) TG×E,其中G为群,E为右零半群。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵,邻接矩阵,圈矩阵,割集矩阵以及图和它对应矩阵之间的关系;其次总结出了利用上述各类矩阵可以解决的图的若干问题:1、利用图的圈矩阵可以求其连枝集;2、利用图的割集矩阵可以求其生成树的树枝;3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树,而且可以判断两条边是否平行;4、利用图的邻接矩阵可以判断两个图是否同构;再次,针对特殊图(例如:二分图、正则图等等)的邻接矩阵作了详细介绍;最后,得到了利用图计算矩阵的N次幂的方法,指出度数定理的实际应用。

From [1], Every transition function is a positive strongly continuous semigroup of contractions on l\, but it isnt a strongly continuous semigroup on l_∞- In fact, the sufficient and necessary condition for a transition function to be a strongly continuous semigroup on l_∞ is that the q—matrix Q is an uniformly bounded q—matrix on l_∞- This is the trivial case.

由Anderson[1]知道转移函数P是l_1空间上正的强连续压缩半群,但P一般来说不是l_∞空间上的强连续半群,而P是l_∞上强连续半群的充要条件是q—矩阵Q是l_∞。

It consists of the next three aspects: firstly, we study Murthys' open problem whether the augmented matrix is a Q0-matrix for an arbitary square matrix A , provide an affirmable answer to this problem , obtain the augmented matrix of a sufficient matrix is a sufficient matrix and prove the Graves algorithm can be used to solve linear complementarity problem with bisymmetry Po-matrices; Secondly, we study Murthys' conjecture about positive semidefinite matrices and provide some sufficient conditions such that a matrix is a positive semidefinite matrix, we also study Pang's conjecture , obtain two conditions when R0-matrices and Q-matrices are equivelent and some properties about E0 ∩ Q-matrices; Lastly, we give a counterexample to prove Danao's conjecture that if A is a Po-matrix, A ∈ E' A ∈ P1* is false, point out some mistakes of Murthys in [20] , obtain when n = 2 or 3, A ∈ E' A ∈ P1*, i.e.

本文分为三个部分,主要研究了线性互补问题的几个相关的公开问题以及猜想:(1)研究了Murthy等在[2]中提出的公开问题,即对任意的矩阵A,其扩充矩阵是否为Q_0-矩阵,给出了肯定的回答,得到充分矩阵的扩充矩阵是充分矩阵,并讨论了Graves算法,证明了若A是双对称的P_0-矩阵时,LCP可由Graves算法给出;(2)研究了Murthy等在[6]中提出关于半正定矩阵的猜想,给出了半正定矩阵的一些充分条件,并研究了Pang~-猜想,得到了只R_0-矩阵与Q-矩阵的二个等价条件,以及E_0∩Q-矩阵的一些性质;(3)研究了Danao在[25]中提出的Danao猜想,即,若A为P_0-矩阵,则,我们给出了反例证明了此猜想当n≥4时不成立,指出了Murthy等在[20]中的一些错误,得到n=2,3时,即[25]中定理3.2中A∈P_0的条件可以去掉。

Summary: The concept of matrix and its determinant computing, matrix determinant, matrix sub-block with the elementary transformation, invertible matrix, rank of matrix; vector and its computation, the linear relationship between vector, vector group of rank; linear equations of the nature and structure of linear equations; matrix eigenvalue and eigenvector, similar to matrix and matrix diagonalization conditions, the standard quadratic form with the normal forms, quadratic and symmetric matrix There are qualitative.

内容提要:行列式矩阵的概念及其运算,方阵的行列式,矩阵的分块与初等变换,可逆矩阵,矩阵的秩;向量及其运算,向量间的线性关系,向量组的秩;线性方程组的性质与结构,线性方程组的求解;矩阵的特征值与特征向量,相似矩阵与矩阵可对角化条件,二次型的标准形与规范形,二次型和对称阵的有定性。

According to [2], we know that if X is a reflexive Banach space and T is a strongly continuous semigroup on X with the infinitesimal generator A, then the adjoint semigroup T~* is also a strongly continuous semigroup on X* and its infinitesimal generator is A~*, the ajoint operator of A.

由文献[2]我们知道,如果X是一自反Banach空间,那么X上强连续半群T的对偶半群T~*也是X~*上的强连续半群,并且其无穷小生成元为半群T的无穷小生成元的对偶。

On the basis, three equivalent statements are obtained. Let S be a semigroup with left central idempotents, then (1) S is a quasi-right semigroup;(2) S is a quasi-completely regular, and RegS is an ideal;(3) S is a nil-extension of strong semilattice of right semigroup.

在此基础上得到了3个等价命题:若S为具有左中心幂等元半群,则(1) S为拟右半群;(2) S为拟完全正则的,RegS为S的理想;(3) S为右群强半格的诣零理想扩张。

第1/100页 1 2 3 4 5 6 7 8 9 ... > 尾页
相关中文对照歌词
In the Matrix
Don't Want To
Matrix
Slow It Up
Cases
The Kids
Her Love
Bruise Pristine
HRSMN Talk
Microhard
推荐网络例句

Diabetes is a social disease that affects several million people worldwide.

糖尿病是一个社会性疾病,全世界有数百万人罹患此病。

I'll call you on Friday to see if we can reschedule our luncheon meeting at your convenience.

我星期五会给您打电话在您方便的时候我们重新安排我们的午餐约会。

Not only because there was a power off, but also because he cooked a muskrat.

不仅因为停电了,而且因为他做了麝鼠肉。