条件收敛的

The convergence condition can be used to design the time-varying, convergence factor, and ensure variable step-size adaptive digital filters to be stable.

利用该权值收敛条件，可设计确保变步长自适应数字滤波器的稳定的变收敛因子。

Under some reasonable conditions, it is proved that the algorithm is locally and globally convergent.

在合适的条件下，证明了算法的全局收敛性和局部二次收敛性。

The difference schema of the initial boundary value problem was converted to the step-by-step form,which was similar to the difference schema of the initial value problem.It is concluded that the difference schema satisfying the Von Neumann condition is a stable schema,and that,under the consistency condition,such stable schema is convergent.Moreover,with error estimate expression for the difference approximation to the classical solution,the linearity condition is unnecessary.

引入反投影算子将发展方程初边值问题的差分格式转化为与初值问题差分格式类似的逐步推进的形式，从而得出：满足Von Neumann条件的差分格式是稳定的格式；在相容条件下，差分格式若稳定(或满足VonNeumann条件)则格式收敛，且对古典解的差分逼近有误差估计式，不再需要线性的条件。

The result is generalized to a sequence of Banach spaces.

由此得出：Banach空间X上n次积分C-半群序列S强收敛于Banach空间X上n次积分C-半群S的充分条件是其生成元序列A强收敛于A，并将这一结论推广到一般的Banach空间序列上。

When we analyse rigid body with the theory of limit equilibrium, we do not obtain always reasonable maximal principle in physics, and the maximal value is the result of soil plasticity deformation.(2) Thoroughly commenting the typical method of slices from their satisfid equilibrium conditions, calculational parameter and their convergence, the thesis sortes the methods into four kinds. The first satisfies all kinds of equilibrium conditions, can obtain interslice force and the factor of safety.

2从满足的平衡条件、求解的参数及其解收敛性等，分析了各种常用极限平衡条分法，将其分为四类，第一类方法既满足力的平衡，也满足力矩平衡，能获得条间力和稳定系数的收敛解；第二类方法只满足一个方向力的平衡和力矩平衡，只能求得稳定系数；第三类方法既满足力的平衡，也满足力矩平衡，但不是严格的静定问题，解的收敛性差；第四类方法满足两个方向力的平衡，不满足力矩平衡，可求得稳定系数和条间力的大小，不能求得条间力方向。

The algorithm has following properties: Although the merit function has the form of least squares of a system of overdetermined equations, in the Newton equation of our algorithm, only the coefficient matrix of the system of overdetermined equations is used instead of its product as in Guass-Newton method for solving the least squares problems. That is, our Newton method is more like that for the system of nonlinear equations rather than that for LSPs. The global convergence is obtained for VLCP with vertical block P_0 + R_0 matrix; The local quadratic convergence rate is proved under the condition that the solution is BD-regular; Although there is only a Newton equation in our algorithm, the finite convergence property can be shown if matrix is vertical block P— matrix (without the hypotheses of strict complementarity).

该算法具有下列特点：所构造的价值函数虽然具有超定方程组的最小二乘问题的形式，但在基此建立的Newton算法中，其Newton方程的形式更象非线性方程组的Newton法中的Newton方程，仅利用了超定方程组的系数矩阵本身的信息，避免了一般最小二乘问题的Guass-Newton法中必须计算系数矩阵的乘积的工作量；对竖块P_0+R_0矩阵的垂直线性互补问题，算法具有全局收敛性；在解是BD-正则条件下，证明了算法的局部二次收敛性；虽然算法只含一个Newton方程，但对竖块P-矩阵垂直线性互补问题，算法具有有限步收敛性。

The classical overlapping Schwarz methods try to transport boundary information by exchanging message on the artificial boundaries. However because of taking Dirichlet conditions as the transmission conditions, which makes the solution reflect when across the artificial boundaries, classical overlapping Schwarz methods converge very slowly—suppose the overlapping domains take a little percentage.

人们很早就认识到，在Schwarz方法中可以采用其它的内边界条件—如Robin条件来代替Dirichlet内边界条件，而且也注意到如果参数选取合适，那么这些内边界条件可以大大加快Schwarz方法的收敛速度。

Under mild conditions, we establish the global and superlinear convergence results for the method.

在适当的假设条件下，我们证明了算法具有全局收敛性和超线性收敛性。

In Chapter 2, combining two types of the preconvex part of modified Broydens family with Armijo line search, we get two algorithms for solving unconstrained optimization problems, and prove these algorithms are global and superlinear convergence under some suitable conditions.

第二章，将两种修改Broyden非凸族与Armijo线搜索相结合，得到了求解无约束最优化问题两种算法，在适当的条件下，证明了这些算法具有全局收敛性和超线性收敛性。

We also introduce a control function, prove the global convergence, and prove the local superlinear convergence under some conditions. Then we propose another new algorithm by using an existed approximation functions, which has the same characters as the first algorithms does. Finally, the result of the numerical experiments indicates the efficiency of the first algorithm. The paper contains four parts.

本文还引入了新的控制函数，并证明了算法具有全局收敛性和在一定的条件下具有局部超线性收敛性；然后，在第一个算法的基础上，本文利用已有的光滑逼近函数提出了另外一个新的算法，通过适当参数选取，证明了新的算法具有与第一个算法同样良好的收敛性质；最后，通过数值计算说明了算法的高效性。

Finally, according to market conditions and market products this article paper analyzes the trends in the development of camera technology, and designs a color night vision camera.

最后根据市场情况和市面上产品的情况分析了摄像机技术的发展趋势，并设计了一款彩色夜视摄像机。

Only person height weeds and the fierce looks stone idles were there.

只有半人深的荒草和龇牙咧嘴的神像。