共球有限点集的k号心及其性质

在n维欧氏空间中,建立了n维共球有限点集的k号心概念,并据此导出了一串有关的平行线、共线点、共点线及共球点定理.     

n维模糊集的截集及其表示

在已有的n维模糊集和n维模糊集截集的概念基础上,发展出一种新的n维模糊集截集定义及其表示方法,并研究了n维模糊集截集的基本性质;同时结合模糊集的分解定理和表现定理,建立了n维模糊集的分解定理和表现定理。最后,应用该理论对n维模糊集的凸性问题进行了初步的研究和讨论。     

关于有限向量集的一类三角不等式及应用

本文引入了Ｅⁿ中ｒ阶空间角的概念,建立了有限向量集的一类三角不等式．作为其应用,得到了ｎ维单形的两类三角不等式,推广和改进了一些已有文献中的主要结果．     

(∈, ∈ V q)—n-dimensional Convex Fuzzy Sets

利用n维模糊集截集理论和模糊点与n维模糊集的邻属关系,并利用n+1-值Lukasiewicz蕴涵,首先给出(α,β)-n维凸模糊集的定义,然后对(∈,∈)-n维凸模糊集和(∈,∈Vq)-n维凸模糊集这两种非常有意义的n维凸模糊集进行了讨论,最后得到了一些有意义的结果.这将为n维凸模糊分析理论研究打下基础.     

(∈,∈∨q)-n维凸模糊集

利用n维模糊集截集理论和模糊点与n维模糊集的邻属关系,并利用n+1-值Lukasiewicz蕴涵,首先给出(α,β)-n维凸模糊集的定义,然后对(∈,∈)-n维凸模糊集和(∈,∈∨q)-n维凸模糊集这两种非常有意义的n维凸模糊集进行了讨论,最后得到了一些有意义的结果。这将为n维凸模糊分析理论研究打下基础。     

N维超立方体的Merrifield-Simmons指标的界

利用超立方体与有限集的幂集的Hasse图之间的同构关系,继续研究n维超立方体的Merrifield-Simmons指标的上下界.当k(?)5时,得到了n维超立方体中k-独立集数的上下界.     

度量空间中有限点集的费马点

本文首先对紧致的度量拓扑空间证明了有限点集的费马点是存在的，其次，运用度量几何的经典方法考察了度量空间（包括双曲空间和Ｂａｎａｃｈ空间）中有限点集的费马点的唯一性，此外，还对ｎ维欧氏空间Ｅ＾ｎ中有限点集的费马作了进一步研究。     

球面型空间有限点集的两个不等式

运用距离几何的理论与方法，给出了涉及球面型空间有限点集的两个不等式．     

n维有限射影空间上d~e——析取矩阵的新构作

利用n维有限射影空间上的一些性质,构作了组合群验的数学模型de-析取矩阵,并研究了它的参数和Hamming距离.     

n维单形的棱切超球

本文先给出n维单形存在棱切超球的一个充分必要条件,然后建立n维单形的棱切超球半径的计算公式,最后,我们还给出两个重要推论。     

集值映射多目标规划问题的解集的连通性

本文研究了无限维空间里集值映射的多目标规划问题。主要结果是：当目标函数为类凸的集值映射时，其目标空间里的有效点集是连通的；若目标函数为Ｃ－凸的集值映射时，其有效解集也连通。     

Contraction behaviour of iteration–discretization based on gradient type projections

There is a wide range of iterative methods in infinite dimensional spaces to treat variational equations or variational inequalities. As a rule, computational handling of problems in infinite dimensional spaces requires some discretization. Any useful discretization of the original problem leads to families of problems over finite dimensional spaces. Thus, two infinite techniques, namely discretization and iteration are embedded into each other. In the present paper, the behaviour of truncated iterative methods is studied, where at each discretization level only a finite number of steps is performed. In our study no accuracy dependent a posteriori stopping criterion is used. From an algorithmic point of view, the considered methods are of iteration–discretization type. The major aim here is to provide the convergence analysis for the introduced abstract iteration–discretization methods. A special emphasis is given on algorithms for the treatment of variational inequalities with strongly monotone operators over fixed point sets of quasi-nonexpansive mappings.     

推广的Q空间

Q空间(或Qp,或Qα空间)的研究受到许多研究者的关注.最近,Wu和Xie将Q空间推广到Qpα,q空间.本文对一般的Q空间进行研究.首先,表明某些实变量刻画和小波刻画的等价性,主要想法是用2n维小波分析属于n维空间Rn的Qpα,q中的元素.其次,也构造出了空间Qpα,q的预对偶空间Ppα,q,其中Ppα,q是由小波定义的原子生成.     

n重积分换元公式的证明

在建立微分线性空间基础上、引入向量外积和有向体积,找到了微分线性变换与有向体积之间的关系,由此给出了n重积分换元公式的一个简单证法.     

Numerical methods and error analysis for one dimensional elliptic problems containing singularities

The method of auxiliary mapping (MAM), introduced by Babu?ka and Oh, was proven to be very successful in dealing with monotone singularities arising in two‐dimensional problems. In this article, in the framework of the p‐version of FEM, MAM is presented for one‐dimensional elliptic boundary value problems containing singularities. Moreover, in order to show the effectiveness of MAM, a detailed proof of an error estimate is also presented, which gives a sharp error bound of MAM. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 399–420, 2003.     

具非双曲型奇点高维自治系统周期轨道的存在性

本文利用非线性泛函分析拓扑度理论与常微分方程定性分析相结合的方法讨论了奇点为非双曲型时高维自治系统周期轨道的存在性,得到了系统存在非常数周期轨道的充分条件．     

Randomized algorithms for the separation of point sets and for solving quadratic programs

A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space ^d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia.     

球面空间中的Pedoe不等式与张-杨不等式及应用

本文应用距离几何的理论与方法,研究了n维球面空间中n维单形与有限点集的几何不等式问题,建立了球面空间中n维单形一种形式的Pedoe不等式与有限点集一种形式的张-杨不等式,并应用它获得n维球面空间中Veljan-Korchmaros型不等式与Finsler-Hadwinger型不等式.