Tensor products of operator systems

The purpose of the present paper is to lay the foundations for a systematic study of tensor products of operator systems. After giving an axiomatic definition of tensor products in this category, we examine in detail several particular examples of tensor products, including a minimal, maximal, maximal commuting, maximal injective and some asymmetric tensor products. We characterize these tensor products in terms of their universal properties and give descriptions of their positive cones. We also characterize the corresponding tensor products of operator spaces induced by a certain canonical inclusion of an operator space into an operator system. We examine notions of nuclearity for our tensor products which, on the category of C*-algebras, reduce to the classical notion. We exhibit an operator system S which is not completely order isomorphic to a C*-algebra yet has the property that for every C*-algebra A, the minimal and maximal tensor product of S and A are equal.

On the simplicial cohomology of Banach operator algebras

We investigate the simplicial cohomology of certain Banach operator algebras. The two main examples considered are the Banach algebra of all bounded operators on a Banach space and its ideal of approximable operators. Sufficient conditions will be given forcing Banach algebras of this kind to be simplicially trivial.

A hypercyclic finite rank perturbation of a unitary operator

A unitary operator V and a rank 2 operator R acting on a Hilbert space H are constructed such that V + R is hypercyclic. This answers affirmatively a question of Salas whether a finite rank perturbation of a hyponormal operator can be supercyclic.

Operators, commuting with the Volterra operator, are not weakly supercyclic

We prove that any bounded linear operator on $L_p[0,1]$ for $1\leq p

FPGA montgomery modular multiplication architectures suitable for ECCs over GF(p)

New FPGA architectures for the ordinary Montgomery multiplication algorithm and the FIOS modular multiplication algorithm are presented. The embedded 18×18-bit multipliers and fast carry look-ahead logic located on the Xilinx Virtex2 Pro family of FPGAs are used to perform the ordinary multiplications and additions/subtractions required by these two algorithms. The architectures are developed for use in Elliptic Curve Cryptosystems over GF(p), which require modular field multiplication to perform elliptic curve point addition and doubling. Field sizes of 128-bits and 256-bits are chosen but other field sizes can easily be accommodated, by rapidly reprogramming the FPGA. Overall, the larger the word size of the multiplier, the more efficiently it performs in terms of area/time product. Also, the FIOS algorithm is flexible in that one can tailor the multiplier architecture is to be area efficient, time efficient or a mixture of both by choosing a particular word size. It is estimated that the computation of a 256-bit scalar point multiplication over GF(p) would take about 4.8 ms.

Transonic Aeroelastic Stability Analysis Using a Kriging-Based Schur Complement Formulation

A method is described to allow searches for transonic aeroelastic instability of realistically sized aircraft models in multidimensional parameter spaces when computational fluid dynamics are used to model the aerodynamics. Aeroelastic instability is predicted from a small nonlinear eigenvalue problem. The approximation of the computationally expensive interaction term modeling the fluid response is formulated to allow the automated and blind search for aeroelastic instability. The approximation uses a kriging interpolation of exact numerical samples covering the parameter space. The approach, demonstrated for the Goland wing and the multidisciplinary optimization transport wing, results in stability analyses over whole flight envelopes at an equivalent cost of several steady-state simulations.

Impact of operator experience on information feedback and reusability

Keeping a record of operator experience remains a challenge to operation management and a major source of inefficiency in information management. The objective is to develop a framework that enables an explicit presentation of experience based on information use. A purposive sampling method is used to select four small and medium-sized enterprises as case studies. The unit of analysis is the production process in the machine shop. Data collection is by structured interview, observation and documentation. A comparative case analysis is applied. The findings suggest experience is an accumulation of tacit information feedback, which can be made explicit in information use interoperatability matrix. The matrix is conditioned upon information use typology, which is strategic in waste reduction. The limitations include difficulty of participant anonymity where the organisation nominates a participant. Areas for further research include application of the concepts to knowledge management and shop floor resource management.

Ranges of bimodule projections and reflexivity

We develop a general framework for reflexivity in dual Banach
spaces, motivated by the question of when the weak* closed linear
span of two reflexive masa-bimodules is automatically reflexive. We
establish an affirmative answer to this question in a number of
cases by examining two new classes of masa-bimodules, defined in
terms of ranges of masa-bimodule projections. We give a number of
corollaries of our results concerning operator and spectral
synthesis, and show that the classes of masa-bimodules we study are
operator synthetic if and only if they are strong operator Ditkin.

Quotients, exactness, and nuclearity in the operator system category

We continue our study of tensor products in the operator system category. We define operator system quotients and exactness in this setting and refine the notion of nuclearity by studying operator systems that preserve various pairs of tensor products. One of our main goals is to relate these refinements of nuclearity to the Kirchberg conjecture. In particular, we prove that the Kirchberg conjecture is equivalent to the statement that every operator system that is (min,er)-nuclear is also (el,c)-nuclear. We show that operator system quotients are not always equal to the corresponding operator space quotients and then study exactness of various operator system tensor products for the operator system quotient. We prove that an operator system is exact for the min tensor product if and only if it is (min,el)-nuclear. We give many characterizations of operator systems that are (min,er)-nuclear, (el,c)-nuclear, (min,el)-nuclear and (el,max)-nuclear. These characterizations involve operator system analogues of various properties from the theory of C*-algebras and operator spaces, including the WEP and LLP.

Hypercyclic and mixing operator semigroups

We describe a class of topological vector spaces admitting a mixing uniformly continuous operator group $\{T_t\}_{t\in\C^n}$ with holomorphic dependence on the parameter $t$. This result covers those existing in the literature. We also
describe a class of topological vector spaces admitting no supercyclic strongly continuous operator semigroups $\{T_t\}_{t\geq 0}$.

Algorithms and architectures for high performance recursive filtering

Recently, a number of most significant digit (msd) first bit parallel multipliers for recursive filtering have been reported. However, the design approach which has been used has, in general, been heuristic and consequently, optimality has not always been assured. In this paper, msd first multiply accumulate algorithms are described and important relationships governing the dependencies between latency, number representations, etc are derived. A more systematic approach to designing recursive filters is illustrated by applying the algorithms and associated relationships to the design of cascadable modules for high sample rate IIR filtering and wave digital filtering.