查询词典 linear relation

Driver system for the stability of nonlinear and non-use of the theory of linear quadratic control law studies, select the ball location, speed and rod angle, angular velocity of the four variables as state variables, output variables for the ball position and bar angle, the establishment of linear state space equation and after the designs of clubs based on LQR control law, the design process simple and easy to realize the control law, simulation results show that the linear quadratic regulator robustness and stability.

球杆系统翻译，求高人针对球杆系统的非线性和不稳定性运用最优二次型理论进行控制律的研究，选取小球位置、速度和横杆角度、角速度四个变量为状态变量，输出变量为小球的位置和横杆的角度，建立状态空间方程并进行线性化后设计了基于LQR的球杆系统控制律，设计过程简单，控制律的实现容易，仿真结果表明了最优二次型调节器的鲁棒性和稳定性。

Standard neural network model is the interconnection of a linear dynamic system and a bounded static nonlinear operator, which is depicted as a linear differential inclusion to be analyzed easily with linear matrix inequalities technique.

标准神经网络模型(SNNM-Standard Neural Network Model)由一个线性动力学系统和有界激励函数构成的静态非线性算子连接而成，被表示为线性微分包含的形式，便于利用线性矩阵不等式技术进行分析。

We first show some properties of such operators and give an explit description about the image of a linear bounded operator on a linear normed space. Then based on these results, we show the mean ergordic theorem on a C*-bial-gebra and get a sufficient and necessary condition for a linear functional to be Haar measure. Finally we discuss the sufficent conditions for the existence of Haar measure on C*-bialgebras.

本文首先通过考察这样算子的性质和刻画赋范线性空间中连续线性算子的像集的性质，证明了C*－双代数中的一个平均遮历定理，得到了C*－双代数中的线性泛函是 Haar 测度的充分必要条件；利用遍历定理和这个充分必要条件探讨了C*－双代数中 Haar 浏度存在的一些充分条件。

The content of this course is divided into four chapter, the normed linear space and bounded linear operator on the normed space; the character of finite dimensional linear space; the basic theorems on Banach space.

本课程主要分为四章，赋范线性空间与内积空间；赋范线性空间上的有界线性算子，有限维赋范线性空间的特征。Banach空间中的基本定理：泛函存在定理，一致有原理，开映象，闭图象、逆算子定理。

Linear space and linear transformation, as well as the associated matrix theory, linear algebra is a central element.

线性空间与线性变换，以及与此相联系的矩阵理论，是线性代数的中心内容。

By transforming the nonlinear saturation constraint into the special linear constraint, the problem of solving the feedback controller with saturated actuator is converted to the design of controller with linear constraint. The stochastic stability is ensured by using the intersection of ellipsoid invariant set of different modes existing in the attraction domain of the closed loop system. In this case, solving controllers can be equivalent to a solvability problem of linear matrix inequalities.

通过将非线性饱和约束转化为特殊的线性约束，使具有饱和执行器的控制器求解问题转化为线性约束控制器的求解问题，利用位于闭环系统吸引域内的不同模态下椭圆不变集的交集来保证系统的随机稳定性，此时控制器的求解可等效为线性矩阵不等式的可解性问题。

With the growing developments of the construction of SS/FH sequence in much wider fields, the well-known complexity measures—the linear complexity, the linear complexity profile and the k-error linear complexity—are widelyused but not sufficient to evaluate the complexities of the sequences available, for instance, the cryptographical sequence and the chaotic sequence families.

针对目前国内外普遍采用的LC、LCP和k-error LC(k-error Linear Complexity)序列复杂度检测理论存在的缺陷，将物理学和信息论中信息熵的概念引入到序列的复杂度检验中，提出了基于近似熵(ApEn：Approximate Entroy)的FH/SS(Frequnecy Hopping/Spread Spectrum)序列复杂度检验理论。

The property of the algorithms on linear problems is studied and the Broyden's methods have been proved that they are not descant. More precisely, the distances between the sequences obtained by solving the linear problems and the solutions of the linear problems do not decrease under any vector norm.

笔者研究了将该方法用于求解线性方程组时的内在性质，否定了一个自然的推测，指出它在解线性方程组时不是一个下降的算法，即所得到的点列与方程组的解之间的距离在任何向量范数意义下都不具有单调下降性。

According to the principle of the diameter of a circle corresponding to the right angle and the principle of short side for little angle in right triangle, projecting the initially-chosen point to the hyper-planes of the linear equation group in which every linear equation can be regarded as a hyper-plane and the projection points can be obtained. The initially-chosen point, and one arbitrary projection point, and the solution point are all on the surface of the relative hyper-geometry ball, therein-to, there is a projection point which is nearest to the solution point and it can be regarded as the next iterative initially-chosen point, so the solution problem of the linear equation group can be changed as an iterative problem of approaching the solution on the surface of a hyper-geometry ball.

根据直径对应的圆周角足直角以及直角三角形中短边对小角的原理进一步知道，当将初始点向线性方程组中各个方程所代表的超平面上投影得到投影点时，初始点和其任何一个投影点及方程组的解点都将位于一个相应的超球面上，其中必定存在一个投影点离问题解点的距离最短，即把该点作为下一次迭代的初始点，从而可将线性方程组求解的问题变成球面上逼近解点的迭代问题。

A parallel algorithm for certain real symmetric block-tridiagonal linear systems on distributed-memory multicomputers is proposed. This algorithm is based on the block factorization of the coefficient matrix. This algorithm is used to solving the block-tridiagonal linear systems resulted from the finite difference approximation to Poisson's equation with Dirichlet boundary conditions. Then we get a parallel algorithm which speedup tends to linear speedup.

7研究了一类实对称块三对角线性方程组的分布式并行求解，提出了一种基于块矩阵分解的高效分布式并行算法，将其应用于求解带Dirichlet边界条件的Poisson方程导出的块三对角线性方程组，得到加速比趋于线性加速比的分布式并行算法，理论上说，这也是并行算法的理想情况。

The dissecting of samples in group2 were difficult. The root of pulmonary artery and ascending aorta failed to be unfolded because fibrous tissue was tough, right and left fibrous trigone were too firm to be solved by hand. Cardiac muscle fibers couldn't be stripped along myofibrillar trajectory since they were prone to break because of their friability.

组2的心脏解剖困难，表现为纤维组织坚韧，游离肺动脉非常困难；徒手无法松解左、右纤维三角，肺动脉和主动脉根部的游离非常困难；心肌纤维坚硬、质脆，解剖时容易断离成碎块，无法沿纤维走行方向剥离。

We have battled against the odds in a province that has become increasingly violent.

我们对在一个争夺日益激烈省的可能性。