线性互补问题的异步并行多分裂松弛迭代算法

将求解线性方程组的异步并行多分裂松弛迭代算法推广到线性互补问题.当问题的系数矩阵为H-矩阵类时,证明了算法的全局收敛性.     

拓扑系统的紧性和分离性

考察拓扑系统的两种紧性——空间式紧和locale式紧,给出紧性的若干刻画,讨论了两种紧性的相互关系,证明了拓扑系统的两种紧性都是拓扑空间紧性的良好推广,说明了紧拓扑系统的闭子拓扑系统、有限和系统以及积系统仍是紧拓扑系统。最后在拓扑系统中考察了紧性加强分离性的问题,得到了紧,(强)T2拓扑系统为(强)T3,(强)T4拓扑系统等结论,并用理想收敛刻画了拓扑系统的强T2分离性。     

On the approximation of convex functions by Bernstein-type operators

As a consequence of Jensen's inequality, centered operators of probabilistic type (also called Bernstein-type operators) approximate convex functions from above. Starting from this fact, we consider several pairs of classical operators and determine, in each case, which one is better to approximate convex functions. In almost all the discussed examples, the conclusion follows from a simple argument concerning composition of operators. However, when comparing Szász-Mirakyan operators with Bernstein operators over the positive semi-axis, the result is derived from the convex ordering of the involved probability distributions. Analogous results for non-centered operators are also considered.     

����Լ���������������MinimaxԤ��

本文研究了独立随机变量之和的绝对矩的几个性质, 其中包括$\ep|X+Y|-\ep|X-Y|$的表达式, 这里$X$和$Y$是相互独立的随机变量.     

一类多元Gauss-Weierstrass 算子线性组合的加权Lp-逼近

本文研究一类多元Gauss-Weierstrass算子的线性组合加Jacobi型权逼近的性质,利用加权矩量不等式及加权K-泛函、光滑模等工具,建立了这类算子在Lp(1≤p≤∞)空间的正、逆定理和逼近阶的特征刻划.     

解强刚性块线代数方程组的两类L-收敛迭代法

对解强刚性块线代数方程组X=(A(?)J)X φ,本文提出了L-收敛的最佳单参数迭代法(L-OOPI)和L-收敛的多参数迭代直接法(L-MPID),并给出了数值例子．数例表明,对于强刚性块线代数方程组,该二迭代法是有效的．     

相关系数与相关性度量

研究了度量相关性的两个主要工具:线性相关系数和尾部相关系数.线性相关系数反映了变量间的线性相关性,这对于一般的椭圆型分布是合适的.但如果随机变量具有不对称的尾部变化特征时,要用尾部相关系数描述它们之间的相关性.通过相关函数C opu la,对沪深股市的尾部相关系数进行了定量分析.结果表明:沪深股市具有较强的相关性.     

Linear least squares problems with data over incomplete grids

The paper addresses bivariate surface fitting problems, where data points lie on the vertices of a rectangular grid. Efficient and stable algorithms can be found in the literature to solve such problems. If data values are missing at some grid points, there exists a computational method for finding a least squares spline by fixing appropriate values for the missing data. We extended this technique to arbitrary least squares problems as well as to linear least squares problems with linear equality constraints. Numerical examples are given to show the effectiveness of the technique presented. AMS subject classification (2000)  65D05, 65D07, 65D10, 65F05, 65F20     

An improved algorithm for computing topological entropy

A new algorithm is presented for computing the topological entropy of a unimodal map of the interval. The accuracy of the algorithm is discussed and some graphs of the topological entropy which are obtained using the algorithm are displayed.     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.