Among the various canonical forms which were proposed for constant linear systems, the one due to Brunovsky [1] certainly is the most profound. It characterizes a dynamics modulo the group of static state feedbacks by a finite set of pure integrators. Its proof, which is quite computational, has been improved in various ways, and can be found in several textbooks (see, e.g., [12, 13, 20, 21] an...

A proof of the Jordan canonical form, suitable for a first course in linear algebra, is given. The proof includes the uniqueness of the number and sizes of the Jordan blocks. The value of the customary procedure for finding the block generators is also questioned. 2000 MSC: 15A21. The Jordan form of linear transformations is an exceeding useful result in all theoretical considerations regarding...

The Rabi Hamiltonian, describing the coupling of a two-level system to a single quantized boson mode, is studied in the BargmannFock representation. The corresponding system of differential equations is transformed into a canonical form in which all regular singularities between zero and infinity have been removed. The canonical or Birkhoff-transformed equations give rise to a two-dimensional e...

We introduce RS-vector machines (RS-VMs) as a canonical form of vector machines. They are based on vector operations called repeat and stretch. Repeat enlarges a vector (a1 , a2 , ..., am) to (a1 , a2 , ..., am , a1 , a2, ..., am) and stretch enlarges (a1, a2, ..., am) to (a1, a1, a2, a2, ..., am, am), when the expansion factor d(m)=2. It is shown that we can change the power of RS-VMs dependin...

Jordan Canonical Form ( JCF) is one of the most important, and useful, concepts in linear algebra. In this book we develop JCF and show how to apply it to solving systems of differential equations. We first develop JCF, including the concepts involved in it–eigenvalues, eigenvectors, and chains of generalized eigenvectors.We begin with the diagonalizable case and then proceed to the general cas...

In this paper we discuss algorithmic aspects of the computation of the Jordan canonical form. Inspired by the Golub & Wilkinson paper 9] on the computation of the Jordan canonical form, an O(n 3) algorithm was developed by Beelen & Van Dooren 3] for computing the Kronecker structure of an arbitrary pencil B ? A. Here we show how the ideas of this algorithm lead to a special algorithm for recons...

The Kodaira dimension of a non-minimal manifold is defined to be that of any of its minimal models. It is shown in [12] that, if ω is a Kähler form on a complex surface (M,J), then κ(M,ω) agrees with the usual holomorphic Kodaira dimension of (M,J). It is also shown in [12] that minimal symplectic 4−manifolds with κ = 0 are exactly those with torsion canonical class, thus can be viewed as sympl...

A common problem in frequent graph mining is the size of the output, which can easily exceed the size of the database to analyze. In the application area of molecular fragment mining a promising approach to tackle this problem is to treat certain substructures as a unit. Among such structures, rings are most prominent, and by requiring that either a ring is present as a whole in a fragment, or ...

In frequent subgraph mining one tries to find all subgraphs that occur with a user-specified minimum frequency in a given graph database. The basic approach is to grow subgraphs, adding an edge and maybe a node in each step, to count the number of database graphs containing them, and to eliminate infrequent subgraphs. The predominant method to avoid redundant search (the same subgraph can be gr...