查询词典 closure operator

In order to discuss the structure of operator algebras, in recent years, a lot of schol-ars both here and abroad have focused on linear mappings of operator algebras andhave introduced more and more new methods.

为了进一步探讨算子代数的结构，近年来，国内外许多学者对算子代数上的线性映射进行了深入研究，并不断提出新的思路。

By using matrix norm, matrix singular value, non-negative matrix theory, the regions of numaerical range and spectum of operator polynomial and the regularity of operator linear pencil are obtained.

8应用矩阵范数理论、矩阵的奇异值理论、非负矩阵的理论、友矩阵、算子的谱理论为工具，获得了算子多项式数值域具有的特性及其包含范围，算子多项式数值域与n-次数值域的关系，最后研究了算子线性束正则性的等价条件及谱分布情况。

This algorithm which computes the inversion of operator matrix is simple and fast based on the special structure of operator matrix.

该算法利用了算子矩阵的特殊结构，采用简单、快速的矩阵求逆算法，使算法的运算量和数据存储容量大幅度下降。

This method was mainly built on the operator matrix's singular value decomposition in the first class of operator equations, and then the best regularization parameters were selected in accordance with the characteristics of singular value so as to identify filter function, thereby removing noise of the function.

该方法主要建立在第一类算子方程的算子矩阵进行奇异值分解的基础上，然后根据奇异值的特征选取最佳正则化参数确定滤子函数，从而达到对该类函数的噪声去除效果。

The methods split the operator to the sum of two maximal monotone operator and in each iteration one has to compute the resolvent of one of the operators.

针对此问题，求解极大单调算子的零点的另一个常用算法-分裂算法，将原来的算子分裂为两个算子之和，在每一步迭代中，只需求出其中一个算子的预解式。

Also we try to establish the -type weighted inequality for the minimal operator, but unlike the maximal operator, the inequality holds trivially.

我们还给出极小算子的混合加权模不等式，即型不等式，但结论是平凡的，这与极大算子的情况完全不同。

In the meanwhile,we also establish the boundedness results of the higher order commutators generated by Hardy-Littlewood maximal operator with rough kernels and corresponding fractional maximal operator with rough kernels on MK_~.

同时还建立了Hardy-Littlewood极大粗糙算子和相应的分数次极大粗糙算子所生成的高阶交换子在MK_~上的有界性。

In the third chapter, based on the second chapter, we will study the boundedness of fractional intergral operator and maximal fractional operator with rough kernal on the weighted Herz-Morrey space.

在第三章中，我们研究了加权齐次Herz-Morrey空间MK_~(ω_1，ω_2)上另一类算子带粗糙核的分数次极大算子和分数次积分算子的有界性问题。

Pisier\'s results,under tree martingale valued space X is isomorphic toan a-uniformly convex space (2≤a＜∞),some quasi-normal or normal inequalitiesof a-variation maximal operator and a-conditional variation maximal operator of X-valued predictable tree martingales are identified.

同时，用G.Pisier's结果在树鞅取值空间X同构于a一致凸Banach空间条件下，证明了几个X-值树鞅α-方极大算子和a-条件方极大算子的拟范数不等式与范数不等式。

In this dissertation, we construct the Bariev model with nine kinds of boundary fields by the matrices K_± defining the boundaries. And then the Lax operator is given in the form ofmatrix, as well as the basic quantities, e.g., the R -matrix, the monodromy matrices and the transfer matrices are defined. By using the expression of the local Lax operator of the model,the action of the monodromy matrices T, T~(-1), U_ on the pseudo-vacuum state is given outin detail. Furthermore, the main fundamental commutation relations are obtained through the reflection equations, the recursive n-particle state as well as the one-particle exact solution is given and the Bethe ansatz equations are found accordingly. Finally, we list the nesting boundary K matrices, which play a crucial role for obtaining the n-particle solution and finding the Bethe ansatz equations, the eigenvalues of the transfer matrices and the energy spectrum of the system by means of the nested algebraic Bethe ansatz method.

在这篇文章中，我们利用边界K_±矩阵构造出了具有九种边界场的Bariev模型，同时给出了该模型L算子的具体矩阵表示形式，并定义了R矩阵，monodromy矩阵以及转移矩阵；接着利用L算子的矩阵形式，给出了其对应monodromy矩阵T、逆矩阵T~(-1)作用到真空态上的值，并利用Yang-Baxter关系及反射方程得到了双行monodromy矩阵U作用到真空态上的值；然后利用反射方程通过复杂的计算得到了一系列重要的基本对易关系式，并给出了模型的递推的多粒子波函数、单粒子解及Bethe ansat方程；最后给出了模型的嵌套的边界K矩阵的具体形式，从而为运用嵌套Bethe ansatz方法求解该模型的多粒子解、Bethe ansatz方程以及系统的能谱打下了很好的基础。

Yet, Edith says, there was always money in the bank.

但是Edith说，她的银行户口里面总是有钱。

We have created a series of files that resolve this problem--one for each day of the 40 days of purpose.

我们制作一系列的档案去解决这问题---一个为标竿40天中的每一天。