Design, parametrization, and pole placement of stabilizing output feedback compensators via injective cogenerator quotient signal modules

Control design belongs to the most important and difficult tasks of control engineering and has therefore been treated by many prominent researchers and in many textbooks, the systems being generally described by their transfer matrices or by Rosenbrock equations and more recently also as behaviors. Our approach to controller design uses, in addition to the ideas of our predecessors on coprime factorizations of transfer matrices and on the parametrization of stabilizing compensators, a new mathematical technique which enables simpler design and also new theorems in spite of the many outstanding results of the literature: (1) We use an injective cogenerator signal module ? over the polynomial algebra [Formula: see text] (F an infinite field), a saturated multiplicatively closed set T of stable polynomials and its quotient ring [Formula: see text] of stable rational functions. This enables the simultaneous treatment of continuous and discrete systems and of all notions of stability, called T-stability. We investigate stabilizing control design by output feedback of input/output (IO) behaviors and study the full feedback IO behavior, especially its autonomous part and not only its transfer matrix. (2) The new technique is characterized by the permanent application of the injective cogenerator quotient signal module [Formula: see text] and of quotient behaviors [Formula: see text] of [Formula: see text]-behaviors B. (3) For the control tasks of tracking, disturbance rejection, model matching, and decoupling and not necessarily proper plants we derive necessary and sufficient conditions for the existence of proper stabilizing compensators with proper and stable closed loop behaviors, parametrize all such compensators as IO behaviors and not only their transfer matrices and give new algorithms for their construction. Moreover we solve the problem of pole placement or spectral assignability for the complete feedback behavior. The properness of the full feedback behavior ensures the absence of impulsive solutions in the continuous case, and that of the compensator enables its realization by Kalman state space equations or elementary building blocks. We note that every behavior admits an IO decomposition with proper transfer matrix, but that most of these decompositions do not have this property, and therefore we do not assume the properness of the plant. (4) The new technique can also be applied to more general control interconnections according to Willems, in particular to two-parameter feedback compensators and to the recent tracking framework of Fiaz/Takaba/Trentelman. In contrast to these authors, however, we pay special attention to the properness of all constructed transfer matrices which requires more subtle algorithms.     

Time-resolved probing of the ground state coherence in rubidium

We demonstrate the preparation and probing of the coherence between the hyperfine ground states |S(1/2),F=1> and |5S(1/2),F=2> of the Rb87 isotope. The effects of various coherence control techniques, i.e., fractional stimulated Raman adiabatic passage and coherent population return, on the coherence are investigated. These techniques are implemented using nearly degenerate pump and Stokes lasers at 795 nm (Rb D1 transition), which couple the two hyperfine ground states via the excited state |5P(1/2),F=1> through a resonant two-photon process in which a coherent superposition of the two hyperfine ground states is established. The medium is probed by an additional weak laser, which generates a four-wave mixing signal proportional to the ground state coherence and allows us to monitor its evolution in time. The experimental data are compared with numerical simulations.     

Transfer Operators and State Spaces for Discrete Multidimensional Linear Systems

This paper treats multidimensional discrete input-output systems from the constructive point of view. We adapt and improve recursive algorithms, derived earlier by E. Zerz and the second author from standard Gröbner basis algorithms, for the solution of the canonical Cauchy problem for linear systems of partial difference equations with constant coefficients on the lattices N = ^r1 × ^r2. These recursive algorithms, in turn, furnish four other solution methods for the initial value problem, namely by transfer operators, by canonical Kalman global state equations, by parametrizations of controllable systems and, for systems with proper transfer matrix and left bounded input signals, by convolution with the transfer matrix. In the 2D-case N = ² the last method was studied by S. Zampieri. Minimally embedded systems are studied and give rise to especially simple Kalman equations. The latter also imply a useful characterization of the characteristic or polar variety of the system by eigenvalue spectra. For N = ^r we define reachability of a system and prove that controllability implies reachability, but not conversely. Moreover we solve, in full generality, the modelling problem which was introduced and partially solved by F. Pauer and S. Zampieri. Various algorithms have been implemented by the first author in axiom, and examples are demonstrated by means of computer generated pictures. Related work on state space representations has been done by the Padovian and Groningian system theory schools.     

Über Untergruppen Endlicher Algebraischer Gruppen

Let k be a commutative ring, GG finite affine algebraic k-groups, and HH the dual Hopfalgebras of the affine algebras of G resp. G. The main results of this paper are: (I) If k is semilocal (e.g. k a field) there is an H-linear, HH-colinear, unitary, augmented isomorphism HHH H, where HH is the coalgebra belonging to G/G. (II) If the k-submodule of the fixelements of (HH)^* is isomorphic to k (e.g. k principal or semilocal), then HH is a Frobeniusextension of the second kind.     

Linear Recurring Arrays, Linear Systems and Multidimensional Cyclic Codes over Quasi-Frobenius Rings

This paper generalizes the duality between polynomial modules and their inverse systems (Macaulay), behaviors (Willems) or zero sets of arrays or multi-sequences from the known case of base fields to that of commutative quasi-Frobenius (QF) base rings or even to QF-modules over arbitrary commutative Artinian rings. The latter generalization was inspired by the work of Nechaev et al. who studied linear recurring arrays over QF-rings and modules. Such a duality can be and has been suggestively interpreted as a Nullstellensatz for polynomial ideals or modules. We also give an algorithmic characterization of principal systems. We use these results to define and characterize n-dimensional cyclic codes and their dual codes over QF rings for n>1. If the base ring is an Artinian principal ideal ring and hence QF, we give a sufficient condition on the codeword lengths so that each such code is generated by just one codeword. Our result is the n-dimensional extension of the results by Calderbank and Sloane, Kanwar and Lopez-Permouth, Z. X. Wan, and Norton and Salagean for n=1.     

One-dimensional focusing of an atomic beam by a flat reflector

One-dimensional focusing of an atomic beam from a flat reflector is experimentally demonstrated. Focusing occurs because gravity changes the momentum transfer perpendicular to the surface depending on the height of the reflecting point. Theoretical analysis shows that, for a certain parametric range, diffraction-limited focusing of an atomic beam is possible. PACS 03.75.Be; 03.75.-b; 34.50.Dy; 32.80.Pj     

Multidimensional constant linear systems

A continuous resp. discrete r-dimensional (r1) system is the solution space of a system of linear partial differential resp. difference equations with constant coefficients for a vector of functions or distributions in r variables resp. of r-fold indexed sequences. Although such linear systems, both multidimensional and multivariable, have been used and studied in analysis and algebra for a long time, for instance by Ehrenpreis et al. thirty years ago, these systems have only recently been recognized as objects of special significance for system theory and for technical applications. Their introduction in this context in the discrete one-dimensional (r=1) case is due to J. C. Willems. The main duality theorem of this paper establishes a categorical duality between these multidimensional systems and finitely generated modules over the polynomial algebra in r indeterminates by making use of deep results in the areas of partial differential equations, several complex variables and algebra. This duality theorem makes many notions and theorems from algebra available for system theoretic considerations. This strategy is pursued here in several directions and is similar to the use of polynomial algebra in the standard one-dimensional theory, but mathematically more difficult. The following subjects are treated: input-output structures of systems and their transfer matrix, signal flow spaces and graphs of systems and block diagrams, transfer equivalence and (minimal) realizations, controllability and observability, rank singularities and their connection with the integral respresentation theorem, invertible systems, the constructive solution of the Cauchy problem and convolutional transfer operators for discrete systems. Several constructions on the basis of the Gröbner basis algorithms are executed. The connections with other approaches to multidimensional systems are established as far as possible (to the author).Partially supported by US Air Force Grant AFOSR-87-0249 and by Office of Naval Research Grant N 00014-86-K-0538 through the Center for Mathematical System Theory, University of Florida, Gainesville, Florida, U.S.A.     

Über das dynamisch-elastische Verhalten von Polyamiden und Polyurethanen in Abhängigkeit von Frequenz,Temperatur und Wassergehalt

Zusammenfassung Die Abh?ngigkeit des dynamisch-elastischen Verhaltens verschiedener Polyamide und Polyurethane von der Frequenz, der Temperatur und insbesondere vom Wassergehalt wurde untersucht. Gemessen wurden zu diesem Zweck der dynamische Elastizit?tsmodul und der zugeh?rige Verlustfaktor im Bereich 10 ... 1000 Hz und −30...+90 °C. Es wurde auf molekularen Relaxationsprozessen beruhende mechanische Dispersion mit der zugeh?rigen maximalen Absorption in Abh?ngigkeit von allen drei Ver?nderlichen beobachtet. Das Wasser erh?ht die Beweglichkeit der relaxierenden Molekülkettensegmente. Wenn man die Stoffe bei gleichen relativen Wassergehalten (bezogen auf die S?ttigungswerte) vergleicht, sind die Unterschiede ihres Verhaltens gering; dies gilt sowohl für die Lage der Dispersionsgebiete als auch für die H?he der Dispersionsstufen und die Betr?ge der Verlustfaktormaxima. Das molekulare Verhalten, insbesondere dessen Abh?ngigkeit vom aufgenommenen Wasser, das zu Anomalien im Verlauf des Elastizit?tsmoduls führt, wird an Hand der vorliegenden Me?resultate und der Ergebnisse anderer Autoren diskutiert. Vorgetragen auf der Arbeitssitzung des Faehausschusses „Physik der IIoehpolymeren“ im Verband der Deutschen Physikalisehen Gesellschaften zur Physikertagung Münehen am 7. September 1956. Die Verfasser der vorliegenden Arbeit sind den Farbenfabriken Bayer AG, Werk Uerdingen, zu Dank verpflichtet für die Genehmigung, die mit den yon ihnen hergestellten Me?proben erzielten Ergebnisse zu ver?ffentlichen. Zu danken haben sie ferner Herrn Dipl.-Ing. W. Weidmann (Farbenfabriken Bayer) ftir anregende Diskussionen und weftvolle Hinweise und den technischen Assistentinnen Fraulein M. L. Angelroth und Frau R. Schmitt für ihre Mitwirkung bei den Messungen und deren Auswertung.     

The canonical Cauchy problem for linear systems of partial difference equations with constant coefficients over the completer-dimensional integral lattice ℕ2r

We canonically define and algorithmically solve the problem of the title. Such algorithms are of great significance for the method of finite differences for the solution of partial differential equations and for many technical applications such as image processing. In contrast to the wide (system theoretic) literature for ordinary difference equations and in spite of the great theoretical and practical significance of this problem, until now, there was no systematic theory of these systems and in particular of the corresponding Cauchy problem, let alone an algorithm. In this paper, we give both. The method consists in a transformation of this problem into a naturally associated problem which is defined over the 2r-dimensional natural number lattice ^2r (the upper quadrant in ^2r ) and for which the canonical initial value or Cauchy problem was defined and constructively solved by the second author.