模糊数序列的收敛性

探讨L-R型模糊数序列的S-和问题，定义关于模糊数的模糊小于的概念，在此基础上探讨模糊数的有序性，模糊数的截集函数的连续性，模糊数的格结构以及模糊数序列的收敛性等重要性质。     

红黑排序混合算法收敛速度分析

The algorithm of applying the block Gauss elimination to the Red-Black or-dering matrix to reduce the order of the system then solve the reduced system byiterative methods is called Hybrid Red-Black Ordering algorithm.In this paper,we discuss the convergence rate of the hybrid methods combined with JACOBI,CG,GMRES(m).Theoretical analysis shows that without preconditioner thesethree hybrid methods converge about 2 times as fast as the corresponding natural ordering methods.For the case that all the eigenvalues is near the real axis, the GMRES(m) algorithm converges about 3 times faster than the natural ordering GMRES(m).Various numerical experiments are presented.For large scale prob-lem with preconditioners, numerical experiments show that the GMRES(m) hybrid methods converge from about 3 times to even 5 times as fast as the natural order-ing methods and the computing time is reduced to about 1/3 even 1/6 of that of the natural ordering methods.     

模糊值Choquet积分(Ⅱ)--函数关于模糊值模糊测度的Choquet积分

研究一种取值于模糊数集的Choquet积分，该积分的被积函数是单值函数，所用的测度是模糊值模糊测度。给出其定义、性质和收敛定理。     

Convergence analysis of time-point relaxation iterates for linear systems of differential equations

We study convergence properties of time-point relaxation (TR) Runge-Kutta methods for linear systems of ordinary differential equations. TR methods are implemented by decoupling systems in Gauss-Jacobi, Gauss-Seidel and successive overrelaxation modes (continuous-time iterations) and then solving the resulting subsystems by means of continuous extensions of Runge-Kutta (CRK) methods (discretized iterations). By iterating to convergence, these methods tend to the same limit called diagonally split Runge-Kutta (DSRK) method. We prove that TR methods are equivalent to decouple in the same modes the linear algebraic system obtained by applying DSRK limit method. This issue allows us to study the convergence of TR methods by using standard principles of convergence of iterative methods for linear algebraic systems. For a particular problem regions of convergence are plotted.     

On a new system of nonlinear A-monotone multivalued variational inclusions

In this paper, we introduce and study a new system of nonlinear A-monotone multivalued variational inclusions in Hilbert spaces. By using the concept and properties of A-monotone mappings, and the resolvent operator technique associated with A-monotone mappings due to Verma, we construct a new iterative algorithm for solving this system of nonlinear multivalued variational inclusions associated with A-monotone mappings in Hilbert spaces. We also prove the existence of solutions for the nonlinear multivalued variational inclusions and the convergence of iterative sequences generated by the algorithm. Our results improve and generalize many known corresponding results.     

ON THE CONVERGENCE OF THE RELAXATION METHODS FOR POSITIVE DEFINITE LINEAR SYSTEMS

1.IntroductionTheclassicaliterativemethods,suchastheJacobimethod,theGauss-SeidelmethodandtheSORmethod,aswellastheirsymmetrizedvariants,playanimportantroleforsolvingthelargesparsesystemoflinearequationsInaccordancewiththebasicextrapolationprincipleofthelineariterativemethod,Hadjidimos[1]furtherproposedaclassofacceleratedoverrelaxation(AOR)methodforsolyingthelinearsystem(1.1)in1978.Thismethodincludestwoarbitraryparameters,andtheirsuitablechoicesnotonlycannaturallyrecovertheJacobi,theGauss-S…     

Products of compact filters and applications to classical product theorems

Two results on product of compact filters are shown to be the common principle behind a surprisingly large number of theorems.     

The convergence properties of direct methods of energy minimization with respect to linear coefficients in the LCAO-MO-SCF approach

It is shown that in the LCAO-MO-SCF problem, if the molecular orbital orthonormality constraints are introduced in the manner first suggested by Fletcher, then the Hessian of the problem is singular. It is suggested that this singularity may well account for the slow convergence observed using direct energy minimization methods to solve the SCF problem. Ways of avoiding the consequences of this singularity are discussed.     

Convergence in Conformal Field Theory

Convergence and analytic extension are of fundamental importance in the mathematical construction and study of conformal field theory. The author reviews some main convergence results, conjectures and problems in the construction and study of conformal field theories using the representation theory of vertex operator algebras. He also reviews the related analytic extension results, conjectures and problems. He discusses the convergence and analytic extensions of products of intertwining operators (chiral conformal fields) and of q-traces and pseudo-q-traces of products of intertwining operators. He also discusses the convergence results related to the sewing operation and the determinant line bundle and a higher-genus convergence result. He then explains conjectures and problems on the convergence and analytic extensions in orbifold conformal field theory and in the cohomology theory of vertex operator algebras.     

非自治刚性随机微分方程正则EM分裂方法的收敛性和稳定性

本文研究了数值求解非自治随机微分方程的正则Euler-Maruyama分裂（CEMS）方法,该方程的漂移项系数带有刚性且允许超线性增长,扩散项系数满足全局Lipschitz条件.首先,证明了CEMS方法的强收敛性及收敛速度.其次,证明了在适当条件下CEMS方法是均方稳定的.进一步,利用离散半鞅收敛定理,研究了CEMS方法的几乎必然指数稳定性.结果表明,CEMS方法在漂移系数的刚性部分满足单边Lipschitz条件下可保持几乎必然指数稳定性.最后通过数值实验,检验了CEMS方法的有效性并证实了我们的理论结果.