查询词典 polynomial

In the computational methods of TPBVP, in order to reduce some difficulties involved in solving a TPBVP via adjoint variables, we discuss a direct method in which state and control variables are indirectly parameterized, The method employs a recently developed direct optimization technique that uses a piecewise polynomial representation for the state and control variables, thus converting the optimal control problem into a nonlinear programming problem, which can be solved numerically.

在数值解法中，为了减少解决两点边值问题共轭变量带来的困难，主要讨论了将状态变量和控制变量进行参数化的一种直接方法，这种方法采用了近段发展起来的使用分段的多项式来代替状态和控制变量的直接优化方法，然后最优控制问题就转化成可以用数值方法解决的非线性规划问题，使得迭代初值更加容易选取。

Finally, we generalize the p-adic expansion of an integer to the J-adic expansionof a polynomial in the ring Z.

最后，我们将整数环Z 上的p-adic 展开式推广到了整系数多项式环Z上的J-adic 展开式。

NTRU, is based on the hard problem of lattice,in the whole flow of which it just involves with addition ,multiplication and inverse in the truncated polynomial ring.

对NTRU来说，除了安全性和速率，要处理的一个主要问题就是解密失败的问题，这个问题可以通过合理的参数选择把解密失败的概率控制在一个较小的值以内。

There are many results of Gr〓bner bases over polynomial ring K , where K is a field or principal ideal domain.

之后，特别是近年来，关于Gr〓bner基的推广及其应用方面的工作十分活跃〓。

Inchapt 3,we study construction of the invariant polynomial ring oftrace map associated with substitution.We solve this problem whensubstitution is invertible,give a basic theorem.

第三章研究结合代换的迹映射的不变多项式所形成的环，解决了代换为可逆的情形的环的结构问题，并给出了有关的基本定理。

In chapter 1, one type of maximal subgroups in symplectic groups overpolynomial rings are obtained. Let F be a field, R = F be a ring of polynomial in one variable over F, m be a positive integer, f eF and S be the ideal of R generated by -f, We define:, then G is a maximalsubgroups of Sp(2m,R).

在第一章中，得到了多项式环上辛群的一类极大子群：设F是一个域，R=F是域F上关于λ的一元多项式环，m是一个正整数，f∈F，S是R的由λ-f生成的理想，则是Sp(2m，R)的一个极大子群。

Meanwhile we denote that some problems doesn't possess polynomial solution.

同时指出了在一些情况下弹性力学平面问题是不具有多项式的解答。

Numerical solution for polynomial positivity validation is explored.

研究了多项式正定性验证的数值求解方法。

It has been proved that the grid job scheduling is a NP-complete problem, and it is hard to find an optimal solution in polynomial time by using traditional searching method.

已有文献证明，由于网格的复杂多变和任务的层出不穷，网格中的任务调度属于NP完全问题，很难用传统的搜索办法在多项式时间内找到最优解。

Almost all of these problems are NP-hard, it is very difficult to find a polynomial optimal solution. Hence, many people try to solve such problems through various methods to find suboptimal solutions instead.

分布式计算系统的任务调度是确定性调度问题中的一个重要专题，这类问题基本上都是NP难题，因此很难找到多项式时间最优算法。

I didn't watch TV last night, because it .

昨晚我没有看电视，因为电视机坏了。

Since this year, in a lot of villages of Beijing, TV of elevator liquid crystal was removed.

今年以来，在北京的很多小区里，电梯液晶电视被撤了下来。