收敛性的

It investigates mainly the dualinvariant of λ- multiplier convergent series, the full invariant ofλ-multiplier convergent series, the λ- multiplier convergent series in spaceswith a basis, the compact sets in the infinite matrix topological algebras, thecharacteristics of have the same compact sets in different topologies,the weak sequentially completeness of , the characteristics ofSchur-matrices, the characteristics of p- uniform Toeplitz matrices and theEberlein-Smulian theorem in the locally convex spaces, etc.

主要研究了〓数乘收敛级数的对偶不变性，〓数乘收敛级数的全程不变性，有基空间中的〓数乘收敛级数，无穷矩阵拓扑代数〓中的紧集，〓在不同拓扑下具有相同紧集的刻划，〓的弱序列完备性，Schur—矩阵的刻划，p-一致Toeplitz矩阵的刻划以及局部凸空间上的Eberlein—Smulian定理等。

The paper contains four parts. In the first chapter, the application back ground and the main algorithms of the complementarity problems is introduced. In Chapter 2, some basic definitions and theories of complementarity problems are introduced. The 3rd chapter is the most important part of this paper, in which a modified smoothing Newton method is detailed; also the global convergence is established for the method.

全文共分为四章，各部分内容安排如下：第一章是绪论部分，介绍了互补问题的应用背景和近年来有关互补问题求解方法的研究成果；第二章是预备知识，介绍了与求解互补问题有关的一些定义以及相关的定理和推论；第三章是本文的重点，提出了求解互补问题的一种修正的光滑Newton算法，从理论上对算法的全局收敛性了证明；第四章是这种修正的光滑Newton法用于求解广义非线性互补问题中，同样证明了算法的全局收敛性。

Since the concept of NA have a lot of applications in multivariate statistical analysis, reliability theory and percolation theory, various aspects of NA are significant and have been investigated by a host of scholars Fist, we give some Fuk-Nagaev type probability inequalities, moment inequalities of maximal partial sum for sequence of NA random variables, and some strong law of large numbers and complete convergence for sequence of NA random variables are obtained.

在本论文中我们对不要求强平稳或同分布的NA随机变量列进行了多方面的研究：首先对NA列建立了一组具有NA特点的关于最大部分和的Fuk-Nagaev型概率不等式及其关于某一类特定函数的矩不等式，它们在后续给出的极限定理的证明中发挥着重要作用；研究了具有不同分布的NA列的强收敛性，如对NA列建立了更一般条件下的Wittmann型强大数律及完全收敛性，同时也进一步改进了R。

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阶）收敛性。

According to disadvantage of AS that the speed low of convergentiss and easily entering the stagnation,improving the AS in some aspect by the way that importing pheromone windows that the value of pheromone cannot exceed the window,only deposit the pheromone on the edge that belongs to the iteration shortest solution path,releasing additional pheromone to the edge belongs to the so-far shortest solution path,judging the situation of convergent and to reinitialize pheromone,optimizing the solutions by local search procedure at the end of every iteration,modifying the transition probability by add some problem specific parameters and so on.

本文主要运用蚁群优化算法(Ant Colony Optimization，ACO)来求解VRP。针对蚁群算法收敛性比较差，易于停滞的缺陷，通过使用信息素窗口限制、信息素的最大最小值，只更新信息素迭代中最好解，增加了精英的蚂蚁，信息素重新初始化之前先判断出汇聚情况，在每次迭代过程中加入局部的搜索进行优化，在对蚁群算法进行了优化时考虑选择概率当中加入与问题的相关参数等措施，从而使蚁群算法的收敛性得到大大提高，避免了算法的停滞现象。

On this basis, according to historical data, apply ANN and differential simulation method to get the quantitatively correlative relations between each production and its own influence factors, and introduce the new methods of prediction for dynamic indexes with gas-field development (The combinatorial prediction method based on fuzzy comprehensive evaluation, the method of ANN to select optimally combinatorial prediction models and the ANN prediction method based on genetic algorithm).(2) Base on mathematical programming, combine with quantitative economics and techno-economics, introduce economical indexes to establish production"s distribution optimal model, production"s constitution optimal model and measured production"s constitution optimal model, including multi-objective models and five-years models. Upon this, the optimal project for all gas field and each gas-collected factory can be got. Also, introduce the time value of capitals to improve on these models.(3) Base on the optimal solution theory and algorithm theory for the nonlinear programming problem, introduce the SUMT algorithm and genetic algorithm to study how to solve the models, and on the basis of normal genetic algorithm, make use of auto-adaptively modulating method to improve on normal genetic algorithm; Base on algorithm"s convergence theory and calculation"s complexity theory to analyze seriatim SUMT algorithm"s convergence and genetic algorithms convergence, and compare performance with each other.

在此基础上，利用神经网络方法和微分模拟方法根据历史数据得到各分项产量与其影响因素之间的定量关联关系，并引入气田开发动态指标新的预测方法(基于模糊综合评判的组合预测方法、神经网络优选组合预测模型预测方法以及基于遗传优化的神经网络预测方法)；(2)以数学规划为基础，结合数量经济学和技术经济学，引入经济指标建立产量分配优化模型、产量构成优化模型、措施产量构成优化模型、气田开发多目标规划模型以及五年规划模型，进而获得全气田及各采气厂的最优方案，并引入资金时间价值对五年规划模型进行改进；(3)以非线性规划问题的最优解及算法理论为基础，引入SUMT算法以及遗传算法对模型的求解进行研究，并在原有的遗传算法基础上，引入自适应调整方法对遗传算法进行改进；以算法的收敛性理论和计算复杂性理论为基础，逐一分析SUMT算法以及遗传算法的收敛性，并比较三种算法的优劣性。

After summarizing the waveform relaxation methods and domain decomposition, we finish some research on optimal Schwarz waveform relaxation algorithm as follows: In the first part, we apply Schwarz waveform relaxation methods on telegraph equation system to get optimal transmission conditions to speed up the algorithm.

在对波形松弛算法以及区域分解进行了综述性介绍后，本文对Schwarz波形松弛迭代算法具体进行了以下研究：首先，本文将在电报方程系统上应用Schwarz波形松弛迭代算法，通过强制加入新的局部传输条件分别给出了两种加速算法并通过定理保证了其优化后的收敛性，进而得到优化Schwarz波形松弛算法，然后通过数值试验对传统Schwarz波形松弛算法与优化Schwarz波形松弛算法进行了比较，研究了收敛率与优化系数的关系，找到了使算法最优的系数取值；最后得出优化后的Schwarz波形松弛算法优于常规Schwarz波形松弛算法的结论。

Inspired by these results, in this paper, we first give the definition of a new mapping ? uniformly Lipschitz asymptotically nonexpansive mapping on a compact subset of a uniform convex Banach space, then construct three-step iterative sequences of uniformly Lipschitz asymptotically nonexpansive mapping in this subset . We proved the convergence of this three-step iterative sequences for uniformly Lipschitz asymptoticallynonexpansive mapping, Further more, we proved this three-step iterative sequences with an error member converge to fixed points.

从中得到启发，在本文我们首先定义了一致凸Banach空间某非空紧子集上的一种新的映射——一致李普希兹渐进非扩张映射，在该紧子集上构造关于一致李普希兹渐进非扩张映射的三步迭代序列以及具误差的三步迭代序列，先来讨论三步迭代序列的收敛性，进而讨论具误差的三步迭代序列的收敛性。

It is proved that Newton iteration method is still quadratically convergent under a weak condition, and a new point is added to Newton s method , i.

本文讨论求解非线性方程的牛顿法，证明牛顿法在一个弱条件下仍保持局部二阶收敛性，给出牛顿法的一点改进，即一个不带导数的单参数的二阶收敛的迭代法，而且分别得到这两种迭代法的收敛因子，最后进行数值实验

Firstly, an empirical approximation model of stochastic programming is obtained by replacing the probability measure of original program with empirical probability measure. Sequentially, the constrained stochastic programming is transformed into an equivalent unconstrained stochastic programming. Finally, using the epi-convergence theory, the almost everywhere upper semiconvergence of optimal solution set of empirical approximations for stochastic programming is obtained.

首先通过经验概率测度替代初始规划的概率测度得到随机规划的经验逼近模型，然后将带有约束的随机规划问题转化成与其等价的无约束的随机规划问题，最后利用上图收敛性理论，给出了随机规划经验逼近最优解集的几乎处处上半收敛性。

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.

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