Analysis of Decomposition Algorithms with Benders Cuts for p-Median Problem

In this paper the algorithms for solving the p-median problem based on the Benders decomposition are investigated. A family of problems hard for solving with such algorithms is constructed and then generalized to a special NP-hard case of the p-median problem. It is shown that the effectiveness of the considered algorithms depends on the choice of the optimal values of the dual variables used in Benders cuts. In particular, the depth of the cuts can be equal to one.     

一致Lipschitz映射的遍历定理及其遍历分解

设(X,d)是一个可分的度量空间,Cu(X,d)是由全体一致连续函数所组成的C(X,d)的子空间,T是定义在X上的一致Lipschitz映射,那么对f∈Cu(X),1/n n∑k=1 Uk If在Cu(X)上收敛.从这个基本结果出发,利用Cu(X,d)的共扼空间的表示定理,得到了相空间的Yosida型遍历分解;利用空间的嵌入技术证明了非一致Lipschitz映射的大数法则.     

D-N交替法与Schwartz交替法的收敛关系分析

This paper has demonstrated that the Schwartz alternating process must converge if D-N alternating process has converged. Its technique is that the overlapping regions in Schwartz alternating process are considered as independent domains, then Schwartz alternating process could be transformed into D-N alter-nating process. Finally the convergence estimation of Schwartz alternating process could be obtained. The results show that its convergence rate is same as that of D-N alternating process.     

Optimally Stable Multivariate Bases

We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel.     

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K_n, is a 3‐factorization of K_n in which the components of each factor are cubes. We show that there exists a cube factorization of K_n if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Maximum norms of random sums and transient pattern formation

Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.

In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.

     

The Chaotic Mixmaster and the Suppression of Chaos in Scalar–Tensor Cosmologies

We show that there is a threshold in energy for the onset of chaos in cosmology for the Universe described as a dynamical system derived from the Einstein equations of General Relativity (GR). In the case of the mixmaster model (homogeneous and anisotropic cosmology with a Bianchi IX metric), the chaos occurs precisely at the prescribed necessary value H _vac=0 of the GR for the energy of the Universe while the system is found to be regular for H<0 and chaotic for H>0 with respect to its pure vacuum part. In the case of generalized scalar tensor theories within the Bianchi IX model, we show using the ADM formalism and a conformal transformation that the energy of the dynamical system as compared to vacuum lies below the zero energy threshold. The system is thus not exhibiting chaos and the conclusion still holds in the presence of ordinary matter as well. The suppression of chaos occurs in a similar way for stiff matter alone.     

Letter: Note on Invariants of the Weyl Tensor

Algebraically special gravitational fields are described using algebraic and differential invariants of the Weyl tensor. A type III invariant is also given and calculated for Robinson-Trautman spaces.     

Bicircular projections and characterization of Hilbert spaces

We prove that every JB* triple with rank one bicircular projection is a direct sum of two ideals, one of which is isometrically isomorphic to a Hilbert space.