不可解
- 与 不可解 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
Let f be a solution of the higher order differential equation, a sufficient condition for f belonging to the weighted Dirichlet space D or to the Bergman space L, respectively, is obtained.
设f是高阶微分方程的解,得到了f分别属于加权Dirichlet空间D和Bergman空间L的一个充分条件,并得到了f是不可容许解的一个充分条件。
-
Firstly, it's proved that the base of free monoid is unique, and that the equation of a base, a generating set and a irreducible generating set in the semigroup with length; Secondly, it's given the relation of a primitive word and a word of indecomposable--Let and is indecomposable, then is primitive ;And by using the length's method and chart,some properties of primitive word have been proved and the solutions of the equation , are discussed; Lastly, on the base of some proposition in Free monoids and Languages ,the proofs of some properties are improved by instruction. For example: Let be a primitive word over X, where .Then is a code. And let then if and only if {} is a code.
首先,讨论了含幺半群中基的基本性质及基与最小生成元集的联系,并给出了含幺半群中基、生成元集、不可约生成元集三者之间的关系;证明了在有唯一长度的半群S中,不可约生成元集、基、最小生成元集三者之间的等价关系;其次,讨论了字的组合与分解性,得出了字的本原性与不可分解性之间的关系---若为不可分解的,则一定是本原的,反之,不一定真;并运用图示法证明了字的可补性理论,讨论了方程,的可解性;在此基础上,用归纳法进一步证明了本原字与码的有关命题--若是X上的一个本原字,其中,则是一个码;若则当且仅当{}是一个码。
-
In conclusion, by consideration of viscosity effect of material at propagating crack-tip, it is established in the paper the unified continuous singular crack-tip field in linear-hardening material under the condition of incompressibility. The plastic shock is eliminated that exists in non-viscosity solutions. What's more, the dynamic and quasi-static solutions are united together when the Mach number approaches zero.
总之,通过考虑扩展裂纹尖端材料的粘性效应,本文建立了幂硬化材料在不可压缩条件下扩展裂纹尖端的统一的连续奇异性场,消除了无粘性解中存在的塑性激波,在马赫数趋于零时动态解和准静态解得到了统一。
-
The CTM is suitable for the case that all E-type influentially uncontrollable subnets are state graphs, and the outstanding virtue is that the designed controller is explicit. The EMM is suitable for the case that all F-type influentially uncontrollable subnets are normalized cascade Petri nets, and the advantage is that control patterns can be on-line computed within polynomial times.
约束变换法适用于所有E-型影响不可控子网为状态图这种特殊的场合,用该方法所综合的控制器最大的优点在于所获得的控制器是显式的;特征标识法适用于所有F-型影响不可控子网为规范化序状Petri网这种场合,用该方法设计的控制器在线运算工作量是多项式可解的。
-
The phenomenon of the polesemy in poetry which cannot be interpreted exactly is one development of its interpretability.
诗歌多义性的不可确解,是诗歌在多义性之可解基础上的又一次进步。
-
For the group representation, this paper improves the known method of determining the irreducibility. Instead of solving equations and checking every combination of the roots, we calculate the value of a polynomial.
对于自由群的表示,本文首先将不可约性的判别方法,由已有文献中解方程,并对方程的根作组合的方法,改进为直接计算某个多项式的值的方法,并进一步给出区分绝对不可约性和非绝对不可约性的判别准则。
-
For different polynomials g, if the characteristic polynomial of a n matrix A is irreducible, then we get some theorems to determine matrix equations g =A solvable; if it is reducible, then, to see n-dimension space vectors M over a field F as F-module, we use module theory to determine these equations solvable such that it is simpler and clearer to investigate these questions.
对于不同多项式g,当n阶矩阵A的特征多项式为不可约的,我们给出了矩阵方程g=A有解的判定定理;当A的特征多项式为可约的,把域F上的n维线性空间M作为由A导出的F -模,我们利用模论知识来决定矩阵方程g=A有解性,从而使这一问题变了简单,研究思路更加清晰。
-
Zeros of irreducible real quaternionic polynomial are the isolated point solutions of the original polynomial equation.
不可约四元数多项式的零点对应原多项式的孤立点解,一次实系数多项式的零点对应原多项式的实数解,二次实系数多项式(Δ<0)的零点对应原多项式的等价类解。
-
The steady-state solution is known to be the positive eigenfuction corresponding to the simple eigenvalue 0 of the system operator.
于是作为半群拟紧性和不可约性的直接结果,得到了系统的时间依赖解指数收敛到其静态解,并且该静态解即为系统算子简单特征值0对应的正的特征向量。
-
We first characterize the groups in which all m∈cdq〓 contain at most 4 prime divisors; and then show the following: if any m∈cdq〓 is nth-power-free then the derived length of solvable group G is bounded by a function f depended only on n; also if cdq〓 has k different p-parts then the p-length of solvable group G is bounded by a function g depended only on k.
首先研究了非线性不可约特征标对应的特征标次数的商至多含有4个素因子的有限群结构。其次,我们证明:若每m∈cdq〓是n次方自由的,则有限可解群G的的导长及p-长都被仅依赖于n的函数所界定;若cdq〓中共有k个两两不同的p-部分,则有限可解群G的p-长能被仅依赖于k的函数所界定。
- 推荐网络例句
-
We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.
索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称;三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起,称之为挽歌体诗人或者史诗诗人,他们被称为诗人,似乎只是因为遵守格律写作,而非他们作品的模仿本质。
-
The relationship between communicative competence and grammar teaching should be that of the ends and the means.
交际能力和语法的关系应该是目标与途径的关系。
-
This is not paper type of business,it's people business,with such huge money involved.
这不是纸上谈兵式的交易,这是人与人的业务,而且涉及金额巨大。