查询词典 domain of convergence

So in order to improve the convergence of Ritz vectors, firstly, refining -strategy is applied to the Davidson method in this paper. The process restarts with the refined Ritz vectors as the initial vectors, and then we get the refined block Davidson method. By analyzing the convergence of the new method, we give the theorem of it.

为了改善Ritz向量的收敛性，本文首先在块Davidson方法的执行过程中，运用精化策略，求出相应的精化向量并将其作为初始向量进行重新开始过程，由此得到了精化块Davidson方法，并对精化块Davidson方法进行了收敛性分析；其次，本文将精化块Davidson方法结合收缩技术，提出了收缩的精化块Davidson方法。

In this thesis we propose an orthogonal polynomials adaptive filter and perform theoretical convergence analysis of residual echo power which proves its faster convergence rate owing to the reduced eigen spread of the input signal.

在传统上，多项式采用次方级数展开的形式；而在本篇论文中，为了提升非线性适应性滤波器的收敛速度我们使用正交多项式的非线性适应性滤波器。

If the pattern has a low rate of convergence, the time of the human and machines will be wasted and the answer are not surely attainable.So,we must look for the patterns with the high rate of convergence or try to settle some parameters of the iteration patterns (for instance the overrelaxation parameter of SOR iterative method).

本文第二章针对AOR迭代法考察了当线性方程组的系数矩阵A为(1，1)相容次序矩阵且其Jacobi特征值为纯虚数或零时的迭代收敛范围，最优参数(即最优松弛因子和最优加速因子)及与之相应的谱半径，并将此最优谱半径与相应的SOR的进行比较，定量的给出在不同条件下，AOR和SOR迭代法各有其优越性，从而圆满的解决了在这两种迭代法之间如何适当的选择最佳迭代法的问题。

From the point of macro level, media convergence will finally cause the industry convergence, which means the coming of "the Big Media Time".

从宏观层面看，媒介融合最终会促成产业大融合，即"大媒体时代"的来临。

To obtain quadratical convergence, however, strict complementarity condition at the Danskin point was used. The condition is too strict to be satisfied in many practical problems such as discrete semi-infinite minimax problem. Another kind of Newton method for finite minimax problems was presented by E. Polak and, without strict complementarity at the Danskin point, superlinear convergence (of order 3/2) was proven.

Polak等人提出了一种直接求解极大极小问题的二阶收敛的牛顿法，但是为获得二阶收敛速度要求在Danskin点处满足严格互补条件，这个条件太强，很多实际问题尤其是半无限极大极小问题的离散化不满足该条件；他们又给出另外一种牛顿法，在不假设严格互补条件成立的情况下，证明了它的超线性（3/2阶）收敛性。

The main results are:(1) the L1 boundedness of the Cesaro means operator of the harmonic expansions on the unit sphere with reflection-invariant measures is proved, and the characterization of the convergence index is given; for the points not in the planes with singularities, the pointwise convergence is also proved; these results are the generalizations of those both for the classical spherical harmonic expansions and for the Jacobi expansions;(2) Using the differential-reflection operators of Dunkl type, the uncertainty principle of a class of Sturm-Liouville operators is established, and as consequences, the uncertainty principles of some well-known classical orthogonal expansions such as Jacobi, Hermite and Laguerre expansions are obtained;(3) by introducing the Cauchy-Riemann equations in terms of the differential-reflection operators of two variables, the harmonic analysis of the extended Jacobi expansions is studied; the results include the Lp boundedness and the weak-L1 boundedness of the conjugate extended Jacobi expansions; specially, for some indexes p smaller than 1, the basic theory of the related Hardy spaces is established.

主要成果有：（1）证明了带有反射不变测度的球面调和展开蔡沙罗平均算子的L1有界性，给出了收敛指标的特征刻划，对不在奇性平面上的点，还证明了点态收敛性，这些成果同时推广了经典球面调和展开和雅可比展开的结果；（2）利用Dunkl型的微分-反射算子建立了一类斯特姆-刘威尔算子的测不准原理，并由此得到一些著名的经典正交展开如雅克比展开、赫米特展开和拉盖尔展开的测不准原理；（3）利用由两个变量的微分-反射算子定义的柯西-黎曼方程组来研究扩展雅克比展开的调和分析，证明了共轭扩展雅克比展开的Lp有界性和弱L1有界性，特别是对小于1的一些指标p，建立了相应的哈代空间的基本理论。

In this thesis, various conventional and ill-conditioned load flow calculation methods have been fully analyzed and evaluated in the aspect of convergence, and the relationship between the convergence and the Jacobian matrix of polar type load flow equation has been discussed and evaluated.

本文对常规潮流算法和常用病态潮流计算方法进行了全面的算法、收敛性分析、评价、比较。

Then it compares these operators' performance through its convergence quality,and it demonstrates that this over-flow dealing method is effective through a group of experiments,the mutation operators used in single-objective optimization have the respectable distribution to polynomial mutation and achieve better convergence quality.

通过一组实验表明这种越界处理方法是非常有效的，单目标优化中的这些变异算子具有与多项式变异算子相当的分布性，同时取得了更好的收敛性能。

Until recently, the convergence of the Rosen"s arithmetic has been proved. The projection gradient method is the generalization of Steepest decent method to constraint problem. So it does have a faster convergence speed that the fastest decent method . To solve the problem, many researchers have generalizat the well-developed optimization with unconstraint to the Rosen"s gradient method. The conjugate gradient method is one of success to solve the problem.

投影梯度法是最速下降法对约束问题的推广，因此没有较快的收敛速度，为了解决这个问题很多中外学者把发展得比较成熟的无约束最优化算法作类似的推广，其中共轭梯度方法是近年发展的很成熟的方法，它具有计算简单，算法结构好，计算量少，具有良好的收敛性等优点，而Rosen投影梯度法的提出使寻找下降方向变得简单。

And under suitable conditions,we establish the global convergence and locally superlinear/quadratic convergence of the method.

在适当条件下，建立了算法的全局和局部超线性/二阶收敛性

Methods Clinical data of 3 cases of bile duct injury during laparoscopic cholecystectomy were analyzed retrospectively.

回顾总结3例LC术中胆管损伤的临床资料，分析3例胆管损伤的原因及对策。

These techniques are applied to the gobang.

本文将这些技术用于五子棋中。