渗流耦合系统动边值问题特征分数步差分方法

对多层渗流方程耦合系统动边值问题,提出适合并行计算的一类特征分数步差分格式,利用区域变换、变分形式、粗细网格配套、乘积型叁二次插值、差分算子乘积交换性、高阶差分算子的分解、先验估计的理论和技巧,得到收敛性的最佳阶l2误差估计．该方法已成功地应用到多层油资源运移聚集的资源评估生产实际中,得到了很好的数值模拟结果．     

A new branch and bound algorithm for cell formation problem

Cell formation (CF) is the first and the most important problem in designing cellular manufacturing systems. Due to its non-polynomial nature, various heuristic and metaheuristic algorithms have been proposed to solve CF problem. Despite the popularity of heuristic algorithms, few studies have attempted to develop exact algorithms, such as branch and bound (B&B) algorithms, for this problem. We develop three types of branch and bound algorithms to deal with the cell formation problem. The first algorithm uses a binary branching scheme based on the definitions provided for the decision variables. Unlike the first algorithm, which relies on the mathematical model, the second one is designed based on the structure of the cell formation problem. The last algorithm has a similar structure to the second one, except that it has the ability to eliminate duplicated nodes in branching trees. The proposed branch and bound algorithms and a hybrid genetic algorithm are compared through some numerical examples. The results demonstrate the effectiveness of the modified problem-oriented branch and bound algorithm in solving relatively large size cell formation problems.     

Tail Bounds for the Supremums of Empirical Processes over Unbounded Classes of Functions

So far the study of exponential bounds of an empirical process has been restricted to a bounded index class of functions. The case of an unbounded index class of functions is now studied on the basis of a new symmetrization idea and a new method of truncating the original probability space; the exponential bounds of the tail probabilities for the supremum of the empirical process over an unbounded class of functions are obtained. The exponential bounds can be used to establish laws of the logarithm for the empirical processes over unbounded classes of functions.     

Bound states of a system of two fermions on a one-dimensional lattice

We consider the Hamiltonian of a system of two fermions on a one-dimensional integer lattice. We prove that the number of bound states N(k) is a nondecreasing function of the total quasimomentum of the system k ∈ [0, π]. We describe the set of discontinuity points of N(k) and evaluate the jump N(k +0) − N(k) at the discontinuity points. We establish that the bound-state energy z _n (k) increases as the total quasimomentum k ∈ [0, π] increases. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 147, No. 1, pp. 47–57, April, 2006.     

Global Optimization using a Dynamical Systems Approach

We develop new algorithms for global optimization by combining well known branch and bound methods with multilevel subdivision techniques for the computation of invariant sets of dynamical systems. The basic idea is to view iteration schemes for local optimization problems – e.g. Newton’s method or conjugate gradient methods – as dynamical systems and to compute set coverings of their fixed points. The combination with bounding techniques allow for the computation of coverings of the global optima only. We show convergence of the new algorithms and present a particular implementation. Michael Dellnitz - Research of the authors is partially supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 376     

一类带反凸约束的非线性比式和问题的全局优化算法

本文针对一类带有反凸约束的非线性比式和分式规划问题,提出一种求其全局最优解的单纯形分支和对偶定界算法.该算法利用Lagrange对偶理论将其中关键的定界问题转化为一系列易于求解的线性规划问题.收敛性分析和数值算例均表明提出的算法是可行的.     

Computing the lower and upper bounds of Laplace eigenvalue problem: by combining conforming and nonconforming finite element methods

We introduce some ways to compute the lower and upper bounds of the Laplace eigenvalue problem.By using the special nonconforming finite elements,i.e.,enriched Crouzeix-Raviart element and extended Q1ro t,we get the lower bound of the eigenvalue.Additionally,we use conforming finite elements to do the postprocessing to get the upper bound of the eigenvalue,which only needs to solve the corresponding source problems and a small eigenvalue problem if higher order postprocessing method is implemented.Thus,we can obtain the lower and upper bounds of the eigenvalues simultaneously by solving eigenvalue problem only once.Some numerical results are also presented to demonstrate our theoretical analysis.     

有界变量线性规划的基线算法

本文对有界变量线性规划的算法进行了研究，得到了一种解此问题的新算法。文中根据基线算法的算法原理，通过对BL表的旋转，在各变量满足界约束的条件下，使目标函数值不断增大，直至得到有界硬上界，从而得到问题的最优解。文中给出了有界变量线性规划基线算法的计算步骤，并给出了一个例子。与单纯形法相比，采用基线算法解有界变量线性规划操作更简单。迭代次数少，解题速度更快。     

一类全局优化问题的线性化方法

本文对带有不定二次约束且目标函数为非凸二次函数的最优化问题提出了一类新的确定型全局优化算法,通过对目标函数和约束函数的线性下界估计,建立了原规划的松弛线性规划,通过对松弛线性规划可行域的细分以及一系列松弛线性规划的求解过程,得到原问题的全局最优解.我们从理论上证明了算法能收敛到原问题的全局最优解.     

关于Boltzmann方程的空间均匀的ES模型

在Prandtl数Pr∈[2/3,∞)的情况下,我们讨论了Boltzmann方程的空间均匀的椭圆统计模型.首先,我们建立了解的存在唯一性.其次,我们证明了该解收敛到平衡态并给出了其Maxwell分布型的下界估计.最后,我们给出了熵等式从而证明了该方程的熵是衰减的.