关于正定可对称化线性代数方程组的预对称正则化算法

1引言考虑线性代数方程组A_x=b,A∈R~(n×n)非奇异,x,b∈R~n(1)的求解．当系数矩阵是大型稀疏的正定可对称化矩阵,文[1,2]讨论了一类预对称共轭梯度算法(LRSCG算法是其中之一),这类算法的实质是利用非对称的系数矩阵可对称化的性质,并结合共轭梯度法而构造的一种预处理的共轭梯度法[12,16,17]．但非对称的系数     

Marcinkiewicz–Zygmund inequalities

We study a generalization of the classical Marcinkiewicz–Zygmund inequalities. We relate this problem to the sampling sequences in the Paley–Wiener space and by using this analogy we give sharp necessary and sufficient computable conditions for a family of points to satisfy the Marcinkiewicz–Zygmund inequalities.     

2-Dimension from the Topological Viewpoint

In this paper we study the 2-dimension of a finite poset from the topological point of view. We use homotopy theory of finite topological spaces and the concept of a beat point to improve the classical results on 2-dimension, giving a more complete answer to the problem of all possible 2-dimensions of an n-point poset.      

环形线电荷的电场分布

给出了圆环形线电荷电场分布的理论公式，并利用计算机计算出其具体分布规律。     

Designing a majorization scheme for the recourse function in two-stage stochastic linear programming

We discuss issues pertaining to the domination from above of the second-stage recourse function of a stochastic linear program and we present a scheme to majorize this function using a simpler sublinear function. This majorization is constructed using special geometrical attributes of the recourse function. The result is a proper, simplicial function with a simple characterization which is well-suited for calculations of its expectation as required in the computation of stochastic programs. Experiments indicate that the majorizing function is well-behaved and stable.     

非扩张映象的重合点与不动点

本文在凸度量空间中讨论了集什扩张映象对的重合和非扩张映象列的公共不动点的存在性，所得结论是单值非扩张映象数情形的推广和发展。．     

NFZ-10工业辐照电子直线加速器

研制的电子直线加速器ＮＦＺ－１０的辐照加工能力相当于３０ＰＢｑ的６０Ｃｏ源，电子束能量为４～１２ＭｅＶ，平均束功率为３ｋＷ，扫描宽度为１ｍ，能量不稳定度≤±０．５％，束流不稳定度≤±０．６％，扫描不均匀度≤±２．５％。ＮＦＺ－１０加速器已被用于辐照各种电力半导体器件，一年多来运行稳定可靠并获得较好的经济效益。     

On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program

In this paper an algorithm is developed to generate all nondominated extreme points and edges of the set of objective values of a multiple objective linear program. The approach uses simplex tableaux but avoids generating unnecessary extreme points or bases of extreme points. The procedure is based on, and improves, an algorithm Dauer and Liu developed for this problem. Essential to this approach is the work of Gal and Kruse on the neighborhood problem of determining all extreme points of a convex polytope that are adjacent to a given (degenerate) extreme point of the set. The algorithm will incorporate Gal's degeneracy graph approach to the neighborhood problem with Dauer's objective space analysis of multiple objective linear programs.     

Proof of the Mixing Theorem for Statistical Systems in Classical Physics

In a general measure-theoretic context, it is proved that the action of a stochastic map on a pair of probability distributions can be characterized by the criterion of decreasing mixing distance.     

线性时滞系统实用稳定性的一个简明判据

利用比较的方法，获得了线性时滞系统实用稳定性的一个简单判定定理．