Existence and uniform decay for Euler–Bernoulli beam equation with memory term

In this article we prove the existence of the solution to the mixed problem for Euler–Bernoulli beam equation with memory term. The existence is proved by means of the Faedo–Galerkin method and the exponential decay is obtained by making use of the multiplier technique combined with integral inequalities due to Komornik. Copyright © 2004 John Wiley & Sons, Ltd.     

Diffusion in poro‐plastic media

A model is developed for the flow of a slightly compressible fluid through a saturated inelastic porous medium. The initial‐boundary‐value problem is a system that consists of the diffusion equation for the fluid coupled to the momentum equation for the porous solid together with a constitutive law which includes a possibly hysteretic relation of elasto‐visco‐plastic type. The variational form of this problem in Hilbert space is a non‐linear evolution equation for which the existence and uniqueness of a global strong solution is proved by means of monotonicity methods. Various degenerate situations are permitted, such as incompressible fluid, negligible porosity, or a quasi‐static momentum equation. The essential sufficient conditions for the well‐posedness of the system consist of an ellipticity condition on the term for diffusion of fluid and either a viscous or a hardening assumption in the constitutive relation for the porous solid. Copyright © 2004 John Wiley & Sons, Ltd.     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

Hyperspaces of Normed Linear Spaces with the Attouch–Wets Topology

Let Cld _AW (X) be the hyperspace of nonempty closed subsets of a normed linear space X with the Attouch–Wets topology. It is shown that the space Cld _AW (X) and its various subspaces are AR's. Moreover, if X is an infinite-dimensional Banach space with weight w(X) then Cld _AW (X) is homeomorphic to a Hilbert space with weight 2 ^w(X).     

Additive Maps Preserving Nilpotent Operators or Spectral Radius

Let X be a （real or complex） Banach space with dimension greater than 2 and let B0（X） be the subspace of B（X） spanned by all nilpotent operators on X. We get a complete classification of surjective additive maps Ф on B0（X） which preserve nilpotent operators in both directions. In particular, if X is infinite-dimensional, we prove that Ф has the form either Ф（T） = cATA^-1 or Ф（T） = cAT＇A^-1, where A is an invertible bounded linear or conjugate linear operator, c is a scalar, T＇ denotes the adjoint of T. As an application of these results, we show that every additive surjective map on B（X） preserving spectral radius has a similar form to the above with ｜c｜ = 1.     

The linear polarization constant of R n

Summary He present work deals with estimations of the n-th linear polarization constant c(H)_n of an n-dimensional real Hilbert space H. We provide some new lower bounds on the value of sup_║y║=1 │1,y> ... n,y>│, where x₁, ... ,x_n are unit vectors in H. In particular, the results improve an earlier estimate of Marcus. However, the intriguing conjecture c(H) _n= n^n/2 remains open.     

A Survey on Explicit Representation Formulae for Fundamental Solutions of Linear Partial Differential Operators

In the present article, we aim at treating the existence of fundamental solutions of linear partial differential operators with constant coefficients from the viewpoint of setting up explicit formulae yielding fundamental solutions.     

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

Balance constraints reduction of large-scale linear programming problems

This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation.     

Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints

In this paper, we extend the classical convergence and rate of convergence results for the method of multipliers for equality constrained problems to general inequality constrained problems, without assuming the strict complementarity hypothesis at the local optimal solution. Instead, we consider an alternative second-order sufficient condition for a strict local minimum, which coincides with the standard one in the case of strict complementary slackness. As a consequence, new stopping rules are derived in order to guarantee a local linear rate of convergence for the method, even if the current Lagrangian is only asymptotically minimized in this more general setting. These extended results allow us to broaden the scope of applicability of the method of multipliers, in order to cover all those problems admitting loosely binding constraints at some optimal solution. This fact is not meaningless, since in practice this kind of problem seems to be more the rule rather than the exception.In proving the different results, we follow the classical primaldual approach to the method of multipliers, considering the approximate minimizers for the original augmented Lagrangian as the exact solutions for some adequate approximate augmented Lagrangian. In particular, we prove a general uniform continuity property concerning both their primal and their dual optimal solution set maps, a property that could be useful beyond the scope of this paper. This approach leads to very simple proofs of the preliminary results and to a straight-forward proof of the main results.The author gratefully acknowledges the referees for their helpful comments and remarks. This research was supported by FONDECYT (Fondo Nacional de Desarrollo Científico y Technológico de Chile).