赋权矩阵及其性质

本文给出了以S为行权和向量的权矩阵类T_＋(S)中每个权矩阵都可逆的一个充要条件．     

On quasi-conformally flat weakly Ricci symmetric manifolds

The object of the present paper is to study quasi-conformally flat weakly Ricci symmetric manifolds.      

Augmented Spinor Space

In this paper, based on the Pauli matrices, a notion of augmented spinor space is introduced, and a uniqueness of such augmented spinor space of rank n is proved. It may be expected that this new notion of spaces can be used in mathematical physics and geometry.     

谱约束下对称正交对称矩阵束的最佳逼近

讨论了对称正交对称矩阵的广义逆特征值问题，得到了通解表达式和最佳解的表达式。     

局部对称共形平坦黎曼流形中具有平行平均曲率向量的子流形

本文把[1]的结论推广到了环绕空间是局部对称共形平坦的情形,即获得了:设M~是局部对称共形平坦黎曼流形N~+p(p>1)中具有平行平均曲率向量的紧致子流形,如果则M~位于N~+p的全测地子流形N~+1中。其中S,H分别是M~的第二基本形式长度的平方和M~的平均曲率,T_C、t_c分别是N~+p的Ricci曲率的上、下确界,K是N~+p的数量曲率。     

位置参数估计量的损失函数之估计

本文考虑损失函数的估计问题,分别对于球对称分布和均匀分布情形给出了其参数的J-S型估计量的损失之估计,它们满足[1]中提出的条件(Ⅰ)和(Ⅱ).     

A Complete Classification of Curvature Collineations of Cylindrically Symmetric Static Metrics

Curvature collineations are symmetry directions for the Riemann tensor, as isometries are for the metric tensor and Ricci collineations are for the Ricci tensor. Complete listings of many metrics possessing some minimal symmetry have been given for a number of symmetry groups for the latter two symmetries. It is shown that a claimed complete listing of cylindrically symmetric static metrics by their curvature collineations [1] was actually incomplete and is completed here. It turns out that in this complete list, unlike the previous claim, there are curvature collineations that are distinct from the set of isometries and of Ricci collineations. The physical interpretation of some of the metrics obtained is given.     

一类不可微规划的高阶对称对偶性

本文我们利用一个可微函数给出了一对高阶对称规划问题 ,其中目标函数包含了Rn 中一紧凸集的支撑函数 .在引入高阶F 凸性 (F 伪凸性 ,F 拟凸性 )后 ,证明了高阶弱、高阶强及高阶逆对称对偶性质 .     

A Comparative Study on Dynamic and Static Sparsity Patterns in Parallel Sparse Approximate Inverse Preconditioning

Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems. This revised version was published online in July 2006 with corrections to the Cover Date.