Minkowski-type and Alexandrov-Type Theorems for Polyhedral Herissons

Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image.     

A unifying local-semilocal convergence analysis and applications for two-point Newton-like methods in Banach space

We provide a local as well as a semilocal convergence analysis for two-point Newton-like methods in a Banach space setting under very general Lipschitz type conditions. Our equation contains a Fréchet differentiable operator F and another operator G whose differentiability is not assumed. Using more precise majorizing sequences than before we provide sufficient convergence conditions for Newton-like methods to a locally unique solution of equation F(x)+G(x)=0. In the semilocal case we show under weaker conditions that our error estimates on the distances involved are finer and the information on the location of the solution at least as precise as in earlier results. In the local case a larger radius of convergence is obtained. Several numerical examples are provided to show that our results compare favorably with earlier ones. As a special case we show that the famous Newton-Kantorovich hypothesis is weakened under the same hypotheses as the ones contained in the Newton-Kantorovich theorem.     

ContributionsSign-balanced covering matrices

A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]^t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C₁, C₂,…, C_t of t columns and for each choice = (₁,…,_t) Δ of signs, the linear combination ∑_j=1^t _jC_j contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (₁, …, _t) of signs in δ, the linear combination ∑_j=1^t _jC_j contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described.     

Single-server queues with spatially distributed arrivals

Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time.     

拓扑线性空间中的Drop定理和Phelps引理以及Ekeland变分原理

将Phelps引理, Ekeland变分原理, Pareto有效性定理推广到拓扑线性空间,同时证明了这三个定理与郑喜印证明的拓扑线性空间中的Drop定理彼此等价．     

Reachable and controllable sets for two-dimensional,linear, discrete-time systems

We consider two-dimensional discrete-time linear systems with constrained controls. We propose a simple polynomial time procedure to give an exact external representation of theN-step reachable set and controllable set. The bounding hyperplanes are explicitly derived in terms of the data of the problem. By using a result in computational geometry, all the calculations are made in polynomial time in contrast to classical methods. The limit case asN is also investigated.     

带阻尼的弹性碰撞问题的周期解

运用延拓引理与逼近框架,对于一类带阻尼的二阶碰撞方程,证明了2π 周期碰撞允许(admissible)解的存在性.     

变分不等式的加性广义Schwarz算法

将加性广义Ｓｃｈｗａｒｚ算法推广到求解变不等式，并在适当条件下证明了其收敛性。     

一类差分方程解的收敛速度及其应用

给出在φ满足Kantorovich引理的条件下,差分方程tk 1=φ(tk)迭代序列{tk}收敛于不动点t*的四种收敛速度.作为应用,给出文[1]中Rheinbold W定理的一个更为明显的结果.     

一条强大数律的注记

本文主要结果为鞅差序列{X_i,J_i,i≥1}服从强大数律的充分条件为(1) sum from i=1 to ∞(E[|X_i|~p/a~p_i+|X_i|~p|J_(i-1)]<∞,0相似文献