广义分解定理与两个不等式

本文给出了Banach空间广义分解定理的一个初等证明,并利用它来证明两个对称不等式.这是首次在Banach空间获得这样的不等式.     

Modeling of radiative heat transfer in an axisymmetric cylindrical enclosure with participating medium

Radiative heat transfer in an axisymmetric enclosure with absorbing, emitting, and scattering medium is studied here by using the different methods such as MDOM, FVM, and MFVM with emphasis on the treatment of angular derivative term, which appears in curvilinear coordinates due to angular redistribution. After final discretization equation for MFVM is introduced by using the step scheme and directional weights, the present approach is validated by applying it to three different benchmarking problems with absorbing, emitting, and scattering medium. All of the results presented here support its accuracy as well as moderate efficiency. Finally, the present approaches are applied to a truncated cone-shaped enclosure as a body-fitted geometry case.     

Necessary conditions for multistationarity in discrete dynamical systems

R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation.     

An approximate proximal-extragradient type method for monotone variational inequalities

Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method.     

On Covariant Phase Space and the Variational Bicomplex

The notion of a phase space in classical mechanics is well known. The extension of this concept to field theory however, is a challenging endeavor, and over the years numerous proposals for such a generalization have appeared in the literature. In this paper We review a Hamiltonian formulation of Lagrangian field theory based on an extension to infinite dimensions of J.-M. Souriau's symplectic approach to mechanics. Following G. Zuckerman, we state our results in terms of the modern geometric theory of differential equations and the variational bicomplex. As an elementary example, we construct a phase space for the Monge–Ampere equation.     

带有单模糊映射的一般变分不等式解的存在性

众所周知，在各种变分不等式问题中，解的存在性是最基础也是最重要的问题之一．本文的目的是在Hilbert空间中研究带有单模糊映射的一般变分不等式解的存在性．此外，还讨论了几种特殊情况．     

厚高阶光学非线性介质Z扫描的变分法分析

利用变分法对具有五阶光学非线性介质的Z扫描特性进行了研究。通过比较，发现当介质在具有较大的五阶非线性系数或较大光强的情况下，五阶非线性项的作用是不可忽略的。这对光限制器的设计和Z扫描实验都具有一定的指导意义。     

Discrete global descent method for discrete global optimization and nonlinear integer programming

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10¹⁰⁴ feasible points have demonstrated the applicability and efficiency of the proposed method.     

Rn上的非初等变换群及其极限集

该文对高维非初等Mò'bius变换群进行了研究,得到了一些重要性质,给出了几个关于离散准则和代数收敛性的定理.     

A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search

Decisions concerning a project’s expedition, traditionally involved considerations regarding time and cost tradeoff. It was recently suggested that the quality of a project should also be taken into considerations. In this paper, we propose a meta-heuristic solution procedure for the discrete time, cost and quality tradeoff problem. This problem involves the scheduling of project activities in order to minimize the total cost of the project while maximizing the quality of the project and also meeting a given deadline. We apply a so called electromagnetic scatter search to solve this problem. In this process, we initially generate a population of feasible solutions. In so doing, we use frequency memory to well sample the feasible region. A number of these solutions are then selected and improved locally. The improved solutions are then combined to generate new set of solutions. The combination process utilizes attraction–repulsion mechanisms borrowed from the electromagnetism theory. The whole process is stopped when no significant improvement in the set of solutions are observed. The validity of the proposed solution procedure is demonstrated, and its applicability is tested on a randomly generated large and complex problem having 19,900 activities.