Some Properties of Quasi-keep-range Operators and Their Applications

ＳｏｍｅＰｒｏｐｅｒｔｉｅｓｏｆＱｕａｓｉ┐ｋｅｅｐ┐ｒａｎｇｅＯｐｅｒａｔｏｒｓａｎｄＴｈｅｉｒＡｐｐｌｉｃａｔｉｏｎｓＬａｉＣｈｕｎｈｕｉ（赖春晖）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＺｈａｎｇｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｅｇｅ，...     

On a Question of Phillips

In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case.     

Volumetric path following algorithms for linear programming

We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers. We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain an O(n ^1/4 m ^1/4 L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition, we show that the same iteration complexity can be attained while holding the work per iteration to O(n ² m), as opposed to O(nm ²), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii. This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University of Iowa Center for Advanced Studies.     

The multiple-scale wave equation

An analytic and numerical study of the behavior of the linear nonhomogeneous wave equation of the form ε²u_tt = Δu + tf with high wave speed (ε 1) is carried out. This study was initially motivated by meteorological observations which have indicated the presence of large spatial scale gravity waves in the neighborhood of a number of summer and winter storms, mainly from visible images of ripples in clouds in satellite photos. There is a question as to whether the presence of these waves is caused by the nearby storms. Since the linear wave equation is an approximation to the full system describing pressure waves in the atmosphere, yet is considerably more tractable, we have chosen to analyze the behavior of the linear nonhomogeneous wave equation with high wave speed. The analysis is shown to be valid in one, two, and three space dimensions. Partly because of the high wave speed, the solution is known to consist of behavior which changes on two different time scales, one rapid and one slow. Additionally, because of the presence of the nonhomogeneous forcing term tf, we show that there is a component of the solution which will vary only on a very large spatial scale. Since even the linearized wave equation can give rise to persistent large spatial scale waves under the right conditions, the implication is that certain storms could be responsible for the generation of large-scale waves. Numerical simulations in one and two dimensions confirm analytic results.     

模糊数学,随机数学与精确数学的逻辑比较

本文揭示模糊数学，随机数学与精确数学有相似的形式公理化描述，它们的区别只在语义上。     

无偏的岭回归迭代算法

本文探讨线性模型的无偏的岭回归迭代算法,这种算法保持最小二乘法的性质,当存在较为严重的共线性时,它能给出较为精确的参数及其协差阵的估计值;当存在严格的共线性时,给出参数及其协差阵的无穷多解中的一个,这个解由初值决定。文章还给出了算法的收敛性及一些其它性质的证明。     

一类求解线性约束非线性规划问题的可行方向法

Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

Semigroups of matrices of intermediate growth

Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied.     

Little higgs models and T parity

Little Higgs models are an interesting extension of the Standard Model at the TeV scale. They provide a simple and attractive mechanism of electroweak symmetry breaking. We review one of the simplest models of this class, the Littlest Higgs model, and its extension with T parity. The model with T parity satisfies precision electroweak constraints without fine-tuning, contains an attractive dark matter candidate, and leads to interesting phenomenology at the Large Hadron Collider (LHC).