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).     

A note on the necessary conditions for the algebraic Riccati equation

We derive some useful and easily computable necessary conditionsfor the existence of a positive semi-definite solution to thealgebraic Ricatti equation (ARE). A motivating example is givento highlight the usefulness of the conditions for controllerand observer designs for nonlinear systems. Further, an upperbound on the trace of the solution to the ARE is also derived.     

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.     

Continuation of travelling‐wave solutions of the Navier–Stokes equations

An efficient way of obtaining travelling waves in a periodic fluid system is described and tested. We search for steady states in a reference frame travelling at the wave phase velocity using a first‐order pseudospectral semi‐implicit time scheme adapted to carry out the Newton's iterations. The method is compared to a standard Newton–Raphson solver and is shown to be highly efficient in performing this task, even when high‐resolution grids are used. This method is well suited to three‐dimensional calculations in cylindrical or spherical geometries. Copyright © 2006 John Wiley & Sons, Ltd.     

POSITIVE SOLUTIONS FOR NONHOMOGENEOUS ELLIPTIC EQUATIONSWITH CRITICAL GROWTH ON R~(2)

1IntroductionIntillspaper,weare(follccrlledwitlltileexistellccofPositly(tsollltiollsoftilefollowillgnonhonlogelleousellipticProblclll:whereg(x)EL'(R'),g(:v)Z0alldg(x)t0,f(x,t)=h(x,t).hi=withb>0,h(x,t)EC(R=xR,R)alldtilefollowing(CI)-(C3)11old:(CI)sliphillM0.linljfl- x,h(T,t)(t--if-=011llif'orllllyforxeR2.hill}t:l-:,t)(axle(~ltJ')= lx,11lliforllllyl'Ora:6RZ.ltl~la(C3)ThereexistM>0,aE(0,1]sucllthatFOllowing[1,5],wesaythatf(x,t)=h(x,f…     

The Modeling of Velocity Enhancement in Polymer Flooding

In single-phase polymer flooding experiments it has repeatedly been observed that the average velocity of the polymer molecules is higher than the average velocity of the water molecules. This effect is incorporated in many conventional Enhanced Oil Recovery (EOR) simulators by the introduction of a constant velocity enhancement factor. In this paper we show that, in absence of dispersion, a constant enhancement factor in the mathematical model for two-phase polymer flow (Buckley--Leverett displacement) leads to ill-posedness of the model equations. We propose a saturation dependent enhancement factor, derived from a model based on percolation concepts, for which this problem does not occur.     

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.