Search results for "Bounded"

Robust H-Infinity Filter Design for Uncertain Linear Systems Over Network with Network-Induced Delays and Output Quantization

2009

This paper investigates a convex optimization approach to the problem of robust H-Infinity filtering for uncertain linear systems connected over a common digital communication network. We consider the case where quantizers are static and the parameter uncertainties are norm bounded. Firstly, we propose a new model to investigate the effect of both the output quantization levels and the network conditions. Secondly, by introducing a descriptor technique, using Lyapunov-Krasovskii functional and a suitable change of variables, new required sufficient conditions are established in terms of delay-dependent linear matrix inequalities (LMIs) for the existence of the desired network-based quantize…

A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY

2013

Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bound…

Representable and Continuous Functionals on Banach Quasi *-Algebras

2017

In the study of locally convex quasi *-algebras an important role is played by representable linear functionals; i.e., functionals which allow a GNS-construction. This paper is mainly devoted to the study of the continuity of representable functionals in Banach and Hilbert quasi *-algebras. Some other concepts related to representable functionals (full-representability, *-semisimplicity, etc) are revisited in these special cases. In particular, in the case of Hilbert quasi *-algebras, which are shown to be fully representable, the existence of a 1-1 correspondence between positive, bounded elements (defined in an appropriate way) and continuous representable functionals is proved.

MR2986428 Lebedev, Leonid P.(CL-UNC); Vorovich, Iosif I.; Cloud, Michael J. Functional analysis in mechanics. Second edition. Springer Monographs in …

2014

Absolutely summing operators on C[0,1] as a tree space and the bounded approximation property

AbstractLet X be a Banach space. For describing the space P(C[0,1],X) of absolutely summing operators from C[0,1] to X in terms of the space X itself, we construct a tree space ℓ1tree(X) on X. It consists of special trees in X which we call two-trunk trees. We prove that P(C[0,1],X) is isometrically isomorphic to ℓ1tree(X). As an application, we characterize the bounded approximation property (BAP) and the weak BAP in terms of X∗-valued sequence spaces.

Bergman and Bloch spaces of vector-valued functions

2003

We investigate Bergman and Bloch spaces of analytic vector-valued functions in the unit disc. We show how the Bergman projection from the Bochner-Lebesgue space Lp(, X) onto the Bergman space Bp(X) extends boundedly to the space of vector-valued measures of bounded p-variation Vp(X), using this fact to prove that the dual of Bp(X) is Bp(X*) for any complex Banach space X and 1 < p < ∞. As for p = 1 the dual is the Bloch space ℬ(X*). Furthermore we relate these spaces (via the Bergman kernel) with the classes of p-summing and positive p-summing operators, and we show in the same framework that Bp(X) is always complemented in p(X). (© 2003 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

Essential norm estimates for composition operators on BMOA

2013

Abstract We provide two function-theoretic estimates for the essential norm of a composition operator C φ acting on the space BMOA; one in terms of the n-th power φ n of the symbol φ and one which involves the Nevanlinna counting function. We also show that if the symbol φ is univalent, then the essential norm of C φ is comparable to its essential norm on the Bloch space.

Variational Aspects of the Physically-Based Approach to 3D Non-Local Continuum Mechanics

2010

This paper deals with the generalization to three-dimensional elasticity of the physically-based approach to non-local mechanics, recently proposed by the authors in one-dimensional case. The proposed model assumes that the equilibrium of a volume element is attained by contact forces between adjacent elements and by long-range central forces exerted by non-adjacent elements. Specifically, the long-range forces are modeled as central body forces depending on the relative displacements between the centroids of the volume elements, measured along the line connecting the centroids. Furthermore, the long-range forces are assumed to be proportional to a proper, material-dependent, distance-decay…

Robust Allocation Rules in Dynamical Cooperative TU Games

2011

Robust dynamic coalitional TU games are repeated TU games where the values of the coalitions are unknown but bounded variables. We set up the game supposing that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to re-adjust the allocations among the players. As main result, we provide a constructive method for designing allocation rules that converge to the core of the average game. Both the set up and the solution approach also provide an insight on commonalities between coalitional games and stability theory.

Exacus: Efficient and Exact Algorithms for Curves and Surfaces

2005

We present the first release of the Exacus C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.