收敛性的

Some small sam-ple and large sample superiority of this estimate such as the unbiasedness,convergence,asymptotic normality and the property of simulation,are obtained.

我们得到分块拟回归的小样本和大样本性质，如无偏性、均方收敛性、强收敛性和渐近正态性，并讨论了曲线拟合的性质。

In Chapter 3,we discuss theconvergence of Newton's method for nonlinear inclusion problems with values in aclosed convex cone,using the new theory developed by Wang Xinghua,we generalizeRobinson's Kantorovich theorem for this problem to a more widely function classes,inthe same time our results take Smale theorem as a special case.

在第三章，我们利用王兴华最近提出的理论框架研究在闭凸锥中取值的非线性包含问题的Newton方法，将Robinson在特殊Lipshitz条件下建立的Kantorovich型收敛性定理推广至满足中心Lipshitz条件的函数类，我们建立的一般的收敛性定理同时将Smale型收敛性定理包容其中。

A parallel split iteration algorithm for MIMD distributivity memory cluster on solving linear coefficient matrices is established in chapter three. Convergence is proved when the coefficient matrix is Hermite positive definite matrix or M-matrix. Discussing convergence range of parameter T . In the end, examples have been implemented on HPrx2600 cluster, and the data verify that the algorithm has favorable astringency and parallelism.

研究了一种适合于MIMD分布式存储并行机的交替方向法，理论上证明了在系数矩阵为Hermite正定矩阵和M-矩阵时算法的收敛性，讨论了参数τ的收敛范围，最后在HPrx2600集群上进行数值试验，结果表明此算法有良好的收敛性与并行性。

In conclusion that there is one and only one balance convergence point is proved and convergence error equation is given when convergence condition is satisfied.

对算法收敛性进行分析和证明，给出算法的收敛判据并证明当满足收敛条件时必存在唯一平衡收敛点，同时给出收敛误差方程。

The main contents of this course include: the construction, convergence, compatibility and stability of finite difference scheme of elliptic equation, parabolic equation and hyperbolic equation, the construction method and computation format of finite difference scheme of a system of partial differential equations.

本课程主要内容有：椭圆型方程的有限差分格式的构造，有限差分格式的收敛性，相容性及稳定性、抛物型方程的有限差分格式的构造，有限差分格式的收敛性，相容性及稳定性、双曲型方程的有限差分格式的构造，有限差分格式的收敛性，相容性及稳定性、偏微分方程组的有限差分格式的构造方法及有关的计算格式。

Integral of one variable functions, improper integral and its convergence properties.

本课程的主要内容包括：1 各种极限运算，其中包括数列极限、函数极限以及上、下极限；2 一元函数的微分学，包括微分和导数的运算法则、微分中值定理及其应用等；3 一元函数的积分和广义积分及其收敛性；4 级数及其收敛性，包括数值级数的收敛性和函数项级数的各种运算和性质；5 多元函数的微分学及其应用，其中很多方面与一元函数的微分学近似，需要注意它们之间的区别；6 多元函数的积分学，包括多重积分的性质与计算，多重积分的的应用等；7 曲线、曲面积分及其应用；8 含参变量积分的计算与性质；9 Fourier 级数及其应用，等等。

For the original infinite dimensional problem, if the inexact quasi-newton method with Broyden updating can not converge quickly , for example, it can not attain super linear convergence rate , then when the discretization is becoming finer and finer , we can not get fast convergence rate for the corresponding finite dimensional problem.

对于原来的无限维问题，如果使用不精确Broyden方法不能得到较快的收敛速度，比如超线性收敛性，那么当离散化逐渐加细的时候，对于所得的有限维问题使用不精确Broyden方法也不可能得到较快的收敛速度，所以有必要在无穷维空间上对收敛性问题加以分析，从而为不精确拟牛顿法结合投影法求解算子方程做好准备。

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-矩阵垂直线性互补问题，算法具有有限步收敛性。

To solve it, we turn it into nonsmooth equations, utilizing inexact theory we give an inexact generalized Newtons method and under some mild conditions we prove that it is global convergence and superlinear convergence .

首先将其约束问题的求解转化为非光滑方程组的求解，然后利用不完全求解理论给出了一个非精确的广义牛顿算法，在一定的条件下证明了算法的全局收敛性和局部超线性收敛性并给出了LC~1非线性约束问题的收敛性条件。

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.

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

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。