S.I.S.向量随机测度在弱拓扑及相容拓扑下的收敛性

本文主要研究ｓ．ｉ．ｓ．向量随机测度在弱拓扑及相容拓扑下的收敛性,给出了ｓ．ｉ．ｓ．向量随机测度在弱拓扑 容拓扑下的Ｖｉｔａｌｉ－Ｈａｌｍ－Ｓａｋｓ定理,作为应用,我们建立了Ｒ＾１－值有界可测函数关于Ｂａｎａｃｈ空间值ｓ．ｉ．ｓ．向量随机测度的随机积分的收敛定理,并得到了具ｔｙｐｅｐ的Ｂａｎａｃｈ空间中ｓ．ｉ．ｓ．向量随机测度的大数定律及中心极限定理。     

Equations of Pseudo-Spherical Type (After S.S. Chern and K. Tenenblat)

This paper surveys some recent developments around the notion of a scalar partial differential equation describing pseudo-spherical surfaces due to Chern and Tenenblat. It is shown how conservation laws, pseudo-potentials, and linear problems arise naturally from geometric considerations, and it is also explained how Darboux and B?cklund transformations can be constructed starting from geometric data. Classification results for equations in this class are stated, and hierarchies of equations of pseudo-spherical type are introduced, providing a connection between differential geometry and the study of hierarchies of equations which are the integrability condition of sl(2, R)-valued linear problems. Furthermore, the existence of correspondences between any two solutions to equations of pseudo-spherical type is reviewed, and a correspondence theorem for hierarchies is also mentioned. As applications, an elementary immersion result for pseudo-spherical metrics arising from the Chern?CTenenblat construction is proven, and non-local symmetries of the Kaup?CKupershmidt, Sawada?CKotera, fifth order Korteweg?Cde Vries and Camassa?CHolm (CH) equation with non-zero critical wave speed are considered. It is shown that the existence of a non-local symmetry of a particular type is enough to single the first three equations out from a whole family of equations describing pseudo-spherical surfaces while, in the CH case, it is shown that it admits an infinite-dimensional Lie algebra of non-local symmetries which includes the Virasoro algebra.     

Optimization of the Relaxation Parameter for S.S.O.R. and A.D.I. Preconditioning

We present and compare several approaches for the optimization of the relaxation parameter both for A.D.I. and S.S.O.R. basic iteration and preconditioning conjugate gradient method. For each kind of preconditioning a detailed link between estimates of the spectral radius of the iteration matrix and of the condition number resulting from preconditioning is proposed. It allows to choose the best approach in order to obtain the optimal relaxation parameter and the corresponding optimal estimates either of the spectral radius of the iteration matrix and of the resulting condition mumber of the S.S.O.R. and A.D.I. preconditioning.