收敛性的

We study the relations among MS, QMDS, RBVS, AMDS, GBVS and NBVS. Finally. we improve some classic results in Fourier analysis such as uniform convergence, L~1 convergence, L~p-integrability, strong approximation of continuous functions et al., by applying this new condition.

我们研究了MS，QMDS，RBVS，AMDS，GBVS和NBVS等不同数列之间的关系，在此基础上，我们给出了NBV条件在研究三角级数的一致收敛性、L~1收敛性、L~p可积性、连续函数的强逼近等Fourier分析经典问题上的应用，对一些经典的结论作了推广。

Helling and Jorgensen established the algebraic convergence theorem,limit theorem and convergence theorem in plane,respectively.

Helling、Jorgensen分别建立了平面Mobius群列的极限定理、代数收敛性定理和收敛性定理等等。

In chapter 5,a new mixed algorithm suitable for feasible initial point is presented.

该方法是整体收敛性算法与局部超线性收敛性算法的组合。

On the base of the good convergence of FR, and in view of the descend property of the paper presents a new conjugate gradient method, and studies the global convergence with two kinds of Armijo-type linear search.

基于FR方法好的收敛性并考虑到d的下降性，提出了一类新的共轭梯度法，并在两种Armijo型搜索下，研究了新方法的全局收敛性。

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 reconstruction problem is ill-posed, so two optimal criterions, the least module and the smoothness criterion base on Tikhonov regularization technique, are introduced into reconstruction algorithm. Many regularization parameters choice strategies are investigated, and the TPA(Two—Parameter Algorithm) strategy which is based on the Morozov discrepancy principles, is implemented in two regularization reconstruction algorithms.Numerical experiment results show that the nonnegative and smoothness constraint condition can overcome the difficulty of iteration semiconvergent, preconditioned technique can improve convergence rate and reconstruction accuracy, smoothness regularization criterion can meliorate ill-posed problem of reconstruction and enhance iteration stability, and the TPA is an effective strategy of regularization parameters choice.

数值试验表明：在共轭梯度法中引入非负约束和光滑约束改善了迭代的"半收敛"性，非负约束保证了解的非负性，光滑约束抑制了重建解的振荡现象，约束算法的重建精度与无约束算法相比大幅度提高；在约束共轭梯度重建算法中引入预优技术，可以加快算法的收敛速度，提高迭代的稳定性和重建精度；引入光滑准则的正则化技术可以有效改善图像重建问题的不适定性，加快迭代的收敛速度，提高迭代的稳定性和图像重建质量，计算正则参数的TPA算法在闪光照相图像重建中是有效的。

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，建立了相应的哈代空间的基本理论。

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

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

Using the asymptotically compact theory of Anselone' and Stepleman' theorem, the existence, the unicity , the convergence and the error estimate with O(h3) of the discrete equations are shown....

并借助Anselone的渐近紧收敛理论和Stepleman定理，证明了离散方程组的解存在性、唯一性、收敛性和精度阶O(h~3)。使用Ostrowski的不动点定理，提供了三阶收敛的迭代法。

The reconstruction problem is ill-posed, so two optimal criterions, the least module and the smoothness criterion base on Tikhonov regularization technique, are introduced into reconstruction algorithm. Many regularization parameters choice strategies are investigated, and the TPA(Two—Parameter Algorithm) strategy which is based on the Morozov discrepancy principles, is implemented in two regularization reconstruction algorithms.Numerical experiment results show that the nonnegative and smoothness constraint condition can overcome the difficulty of iteration semiconvergent, preconditioned technique can improve convergence rate and reconstruction accuracy, smoothness regularization criterion can meliorate ill-posed problem of reconstruction and enhance iteration stability, and the TPA is an effective strategy of regularization parameters choice.

数值试验表明：在共轭梯度法中引入非负约束和光滑约束改善了迭代的&半收敛&性，非负约束保证了解的非负性，光滑约束抑制了重建解的振荡现象，约束算法的重建精度与无约束算法相比大幅度提高；在约束共轭梯度重建算法中引入预优技术，可以加快算法的收敛速度，提高迭代的稳定性和重建精度；引入光滑准则的正则化技术可以有效改善图像重建问题的不适定性，加快迭代的收敛速度，提高迭代的稳定性和图像重建质量，计算正则参数的TPA算法在闪光照相图像重建中是有效的。

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.

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