Further bounds for waiting time distributions and their means in the case ρ<1

In the paper exponential bounds for the instationary and stationary waiting time d.f.'s in GI/GI/1/∞, derived by several authors partly using martingale theory arguments, are improved with the help of monotonicity properties. Further it is shown that Ne?eptjrenko's bound for the rate of convergence of the mean waiting time in single server queues Is also valid for many server queues with ρ < 1.     

On the finite termination of the Douglas-Rachford method for the convex feasibility problem

In this paper we apply the Douglas–Rachford (DR) method to solve the problem of finding a point in the intersection of the interior of a closed convex cone and a closed convex set in an infinite-dimensional Hilbert space. For this purpose, we propose two variants of the DR method which can find a point in the intersection in a finite number of iterations. In order to analyse the finite termination of the methods, we use some properties of the metric projection and a result regarding the rate of convergence of fixed point iterations. As applications of the results, we propose the methods for solving the conic and semidefinite feasibility problems, which terminate at a solution in a finite number of iterations.     

丢番图方程X~2-(a~2+1)Y~4=3-4a

设a≥2是正整数.本文证明了:当a=2时,方程X~2一(a~2+1)Y~4=3-4a仅有正整数解(X,Y)=(20,3);当a=3时,该方程仅有2组互素的正整数解(X,Y)=(1,1)和(79,5);当a≥4且4a+1非平方数时,该方程最多有4组互素的正整数解(X,Y);当a≥4且4a+1为平方数时,该方程最多有5组互素的正整数解(X,Y).     

图的k部划分的一个注记

设k≥2是一个整数。本文证明了任意有m条边的图都存在一个顶点的划分V_1,V_2…,V_k,使得e(V_1,V_2…,V_k)≥k-1/k m+k-1/2k((2m+1/4)~1/2-1/2)-(k-2)~2/8k,且max{e(V_i):1≤i≤k}≤m/k~2+(k-1)/2k~2((2m+1/4)~1/2-1/2+3/8-7k-4/8k~2.我们的结果改进了[Fan G.,Hou J.,Zeng Q.,A bound for judicious k-partitions of graphs,Discrete Appl.Math.,2014,179:86—99]的主要结论.     

A note on a priori error estimates for augmented mixed methods

In this note we describe a strategy that improves the a priori error bounds for augmented mixed methods under appropriate hypotheses. This means that we can derive a priori error estimates for each one of the involved unknowns. Usually, the standard a priori error estimate is for the total error. Finally, a numerical example is included, that illustrates the theoretical results proven in this paper.     

Packing into the smallest square: Worst-case analysis of lower bounds

We address the problem of packing a given set of rectangles into the minimum size square. We consider three versions of the problem, arising when the rectangles (i) are squares; (ii) have a fixed orientation; (iii) can be rotated by 90. For each case we study lower bounds, and analyze their worst-case performance ratio. In addition, we evaluate through computational experiments their average performance on instances from the literature.     

Extremally distant normed spaces with additional restrictions

We study the relationship between the Banach—Mazur distance and the modified Banach—Mazur distance. We sharpen the Szarek theorem on the construction of invariant norms with specific properties and construct extremally distant normed spaces with norms invariant under groups of automorphisms of small cardinality. We prove that the trivial upper bound for the Banach—Mazur distance obtained in terms of the modified Banach—Mazur distance is order-sharp.     

THE EIGENVALUE PERTURBATION BOUND FOR ARBITRARY MATRICES

In this paper we present some new absolute and relative perturbation bounds for theeigenvalue for arbitrary matrices, which improves some recent results. The eigenvalueinclusion region is also discussed.     

非线性约束优化问题的一个修正 Lagrangian 算法

基于一个含有控制参数的修正Lagrangian函数,该文建立了一个求解非线性约束优化问题的修正Lagrangian算法.在一些适当的条件下,证明了控制参数存在一个阀值,当控制参数小于这一阀值时,由这一算法产生的序列解局部收敛于问题的Kuhn-Tucker点,并且建立了解的误差上界.最后给出一些约束优化问题的数值结果.     

The logarithmic norm. History and modern theory

In his 1958 thesis Stability and Error Bounds, Germund Dahlquist introduced the logarithmic norm in order to derive error bounds in initial value problems, using differential inequalities that distinguished between forward and reverse time integration. Originally defined for matrices, the logarithmic norm can be extended to bounded linear operators, but the extensions to nonlinear maps and unbounded operators have required a functional analytic redefinition of the concept.This compact survey is intended as an elementary, but broad and largely self-contained, introduction to the versatile and powerful modern theory. Its wealth of applications range from the stability theory of IVPs and BVPs, to the solvability of algebraic, nonlinear, operator, and functional equations. In memory of Germund Dahlquist (1925–2005).AMS subject classification (2000) 65L05