2014年E题综述

针对学生做E题的方法给出总结,并对学生出现的问题给出点评,同时对竞赛中研究生较少或没有考虑过的最优解证明问题和启发式方法给出论述.     

对一个不等式问题的另证与研究

文[1]、[2]给出了其证明,总体感觉证明过程较长且有一定的运算量,下面给出以上问题另外两种证明方法,且从中我们可以得到一些类似而有意思的问题．     

Crammer规则的几种证明方法

本文给出Crammer规则的几种证明方法,基于不同的证明思路,提升学生对该规则的理解与全方位多层面的分析问题的能力.     

不等式的证明

不等式的证明方法很多 ,本文给出了几种常用方法 ,通过这些方法 ,可以比较简洁 ,快速的解决一些不等式证明问题     

如何利用导数证明不等式

利用导数证明不等式是近几年高考的重点和热点.由于导数是高等数学的基础知识,对中学生来说思维能力要求高、解题方法灵活、难度大等特点,于是成为每年高考题的压轴题.如何利用导数证明不等式是导数应用的一个重要问题,本文给出常见的几种证明方法.1.利用给定函数的单调性证明不等式利用函数本身的单调性来证明不等式,从形式上来说,可能是从形式上直接利用给出函数的性质,     

概率方法在等式与不等式证明中的应用

应用概率方法证明数学分析中的一些问题不但能为数学分析问题提供概率背景、沟通学科之间的联系,而且还能简化证明。本文试对一些等式、不等式以及级数求和等问题给出概率证法及解法。     

两个极限的注记

利用数值积分方法给出了波利亚的名著中两个极问题的证明,并给出了两个结论更强的结果.     

一个具有线性约束的Goldfarb方法的改进算法

本文对具有线性约束的非线性规划问题给出一个Goldfarb方法的改进算法,并且在与[1]同样的条件下,给出了算法之超线性收敛性证明.     

妙用示性函数 巧解概率问题

通过构造示性函数,利用示性函数与概率的关系对Chebyshev不等式、期望等几个问题给出新的证明方法.     

一道三角问题的推广与思考

本文先呈现教辅资料及三篇期刊文章对一道三角问题的分析与求解,剖析解题过程的不足之处,并尝试将问题进行推广,给出了三种证明方法并揭示其几何背景,结合教学实践给出教学思考.     

线性分式运输问题的一个解法

线性分式运输问题是线性分式规划问题的一种特殊情况，通常可以用线性分式规划问题的一般解法来解这类问题，本文针对分式运输问题的特点给出了一种简便的解法．     

Inverse problems of reconstructing parameters of the Navier-Stokes system

An inverse problem of reconstructing parameters not known a priori of the dynamical system described by the boundary-value problem for the Navier-Stokes system is considered. The reconstruction is based on one piece of admissible information or another about the motion of the dynamical system (solution of the corresponding boundary-value problem). In particular, one of the problems considered is the inverse problem consisting of reconstruction of the a priori unknown right-hand side of the Navier-Stokes system. The right-hand side characterizes the density of exterior mass forces acting on the system. This problem, as well as many other similar problems, is ill-posed. Two methods are proposed for its solution: the statistical method and the dynamical method. These methods use different initial information. In solving the problem by using the statistical method, initial information for the solution is the results of approximate measurement (in one sense or another) of the motion of the dynamical system on a given interval of time. Here, the reconstruction is performed after the corresponding interval of time. For solution of the problem by this method, the concepts and constructions of open-loop control theory are used. In solving the problem by using the dynamical method, initial information for its solution is the results of approximate (in one sense or another) measurements of the current states of the system, which are dynamically obtained by the observer. Here, the reconstruction is dynamically performed during the process. For solution of the problem by the dynamical method, the concepts and constructions of the dynamical regularization method based on positional control theory are used. Also, the author considers various modifications and regularizations of the methods for solution of problems proposed that are based on one piece of a priori information or another about the desired solution and solvability conditions of the problem. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 26, Nonlinear Dynamics, 2005.     

Lp-based combinatorial problem solving

A tutorial outline of the polyhedral theory that underlies linear programming (LP)-based combinatorial problem solving is given. Design aspects of a combinatorial problem solver are discussed in general terms. Three computational studies in combinatorial problem solving using the polyhedral theory developed in the past fifteen years are surveyed: one addresses the symmetric traveling salesman problem, another the optimal triangulation of input/output matrices, and the third the optimization of large-scale zero-one linear programming problems.     

具有边界对应的拟共形扩张的伸缩商估计

本文研究了拟共形映射的极值问题.利用Beurling-Ahlfors扩张函数,获得了一类新的拟共形映射,推广了文献[1]的结果.     

A global optimization approach for the linear two-level program

Linear two-level programming deals with optimization problems in which the constraint region is implicity determined by another optimization problem. Mathematical programs of this type arise in connection with policy problems to which the Stackelberg leader-follower game is applicable. In this paper, the linear two-level programming problem is restated as a global optimization problem and a new solution method based on this approach is developed. The most important feature of this new method is that it attempts to take full advantage of the structure in the constraints using some recent global optimization techniques. A small example is solved in order to illustrate the approach.The paper was completed while this author was visiting the Department of Mathematics of Linköping University.     

Tackling the jump number of interval orders

Although the jump number problem for partially ordered sets in NP-complete in general, there are some special classes of posets for which polynomial time algorithms are known.Here we prove that for the class of interval orders the problem remains NP-complete. Moreover we describe another 3/2-approximation algrithm (two others have been developed already by Felsner and Syslo, respectively) by using a polynomial time subgraph packing algorithm.     

Parallel bundle-based decomposition for large-scale structured mathematical programming problems

In this paper, we present parallel bundle-based decomposition algorithms to solve a class of structured large-scale convex optimization problems. An example in this class of problems is the block-angular linear programming problem. By dualizing, we transform the original problem to an unconstrained nonsmooth concave optimization problem which is in turn solved by using a modified bundle method. Further, this dual problem consists of a collection of smaller independent subproblems which give rise to the parallel algorithms. We discuss the implementation on the CRYSTAL multi-computer. Finally, we present computational experience with block-angular linear programming problems and observe that more than 70% efficiency can be obtained using up to eleven processors for one group of test problems, and more than 60% efficiency can be obtained for relatively smaller problems using up to five processors for another group of problems.     

An approach for calculating correlation functions in the six-vertex model with domain wall boundary conditions

We address the problem of calculating correlation functions in the six-vertex model with domain wall boundary conditions by considering a particular nonlocal correlation function, called the row configuration probability. This correlation function can be used as a building block for computing various (both local and nonlocal) correlation functions in the model. We calculate the row configuration probability using the quantum inverse scattering method, giving the final result in terms of multiple integrals. We also discuss the relation to the emptiness formation probability, another nonlocal correlation function, which was previously computed using similar methods.     

The split common fixed point problem for generalized demimetric mappings in two Banach spaces

ABSTRACT

In this paper, we consider the split common fixed point problem for new demimetric mappings in two Banach spaces. Using the hybrid method, we prove a strong convergence theorem for finding a solution of the split common fixed point problem in two Banach spaces. Furthermore, using the shrinking projection method, we obtain another strong convergence theorem for finding a solution of the problem in two Banach spaces. Using these results, we obtain well-known and new strong convergence theorems in Hilbert spaces and Banach spaces.     

Solvability via viscosity solutions for a model of phase transitions driven by configurational forces

This article is concerned with an initial-boundary value problem for an elliptic-parabolic coupled system arising in martensitic phase transition theory of elastically deformable solid materials, e.g., steel. This model was proposed in Alber and Zhu (2007) [4], and investigated in Alber and Zhu (2006) [3] the existence of weak solutions which are defined in a standard way, however the key technique used in Alber and Zhu (2006) [3] is not applicable to multi-dimensional problem. One of the motivations of this study is to solve this multi-dimensional problem, and another is to investigate the sharp interface limits. Thus we define weak solutions in a way, which is different from Alber and Zhu (2006) [3], by using the notion of viscosity solution. We do prove successfully the existence of weak solutions in this sense for one-dimensional problem, yet the multi-dimensional problem is still open.