Computation of transfer function matrices of periodic systems

We present a numerical approach to evaluate the transfer function matrices of a periodic system corresponding to lifted state-space representations as constant systems. The proposed pole-zero method determines each entry of the transfer function matrix in a minimal zeros-poles- gain representation. A basic computational ingredient for this method is the extended periodic real Schur form of a periodic matrix, which underlies the computation of minimal realizations and system poles. To compute zeros and gains, fast algorithms are proposed, which are specially tailored to particular single-input single-output periodic systems. The new method relies exclusively on reliable numerical computations and is well suited for robust software implementations

On computing minimal realizations of periodic descriptor systems

Abstract: We propose computationally efficient and numerically reliable algorithms to compute minimal realizations of periodic descriptor systems. The main computational tool employed for the structural analysis of periodic descriptor systems (i.e., reachability and observability) is the orthogonal reduction of periodic matrix pairs to Kronecker-like forms. Specializations of a general reduction algortithm are employed for particular type of systems. One of the proposed minimal realization transformations for which the backward numerical stability can be proved

Computation of Kalman Decompositions of Periodic Systems

We consider the numerically reliable computation of reachability and observability Kalman decompositions of a periodic system with time-varying dimensions. These decompositons generalize the controllability/observability Kalman decompositions for standard state space systems and have immediate applications in the structural analysis of periodic systems. We propose a structure exploiting numerical algorithm to compute the periodic controllability form by employing exclusively orthogonal similarity transformations. The new algorithm is computationally efficient and strongly backward stable, thus fulfils all requirements for a satisfactory algorithm for periodic systems

A Periodic Systems Toolbox for MATLAB

The recently developed Periodic Systems Toolbox for MATLAB is described. The basic approach to develop this toolbox was to exploit the powerful object manipulation features of MATLAB via flexible andfunctionally rich high level m-functions, while simultaneously enforcing highly efficient and numerically sound computations via the mex-function technology of MATLAB to solve critical numerical problems.The m-functions based user interfaces ensure user-friendliness in operating with the functions of this toolbox via an object oriented approach to handle periodic system descriptions. The mex-functions are based on Fortran implementations of recently developed structure exploiting and structure preserving numerical algorithms for periodic systems which completely avoid forming of lifted representations

Balanced truncation model reduction of periodic systems

The balanced truncation approach to model reduction is considered for linear discrete-time periodic systems with time-varying dimensions. Stability of the reduced model is proved and a guaranteed additive bound is derived for the approximation error. These results represent generalizations of the corresponding ones for standard discrete-time systems. Two numerically reliable methods to compute reduced order models using the balanced truncation approach are considered. The square-root method and the potentially more accurate balancing-free square-root method belong to the family of methods with guaranteed enhanced computational accuracy. The key numerical computation in both methods is the determination of the Cholesky factors of the periodic Gramian matrices by solving nonnegative periodic Lyapunov equations with time-varying dimensions directly for the Cholesky factors of the solutions

Computation of the asymptotic states of modulated open quantum systems with a numerically exact realization of the quantum trajectory method

Quantum systems out of equilibrium are presently a subject of active research, both in theoretical and experimental domains. In this work we consider time-periodically modulated quantum systems which are in contact with a stationary environment. Within the framework of a quantum master equation, the asymptotic states of such systems are described by time-periodic density operators. Resolution of these operators constitutes a non-trivial computational task. To go beyond the current size limits, we use the quantum trajectory method which unravels master equation for the density operator into a set of stochastic processes for wave functions. The asymptotic density matrix is calculated by performing a statistical sampling over the ensemble of quantum trajectories, preceded by a long transient propagation. We follow the ideology of event-driven programming and construct a new algorithmic realization of the method. The algorithm is computationally efficient, allowing for long 'leaps' forward in time, and is numerically exact in the sense that, being given the list of uniformly distributed (on the unit interval) random numbers, $\{\eta_1, \eta_2,...,\eta_n\}$, one could propagate a quantum trajectory (with $\eta_i$'s as norm thresholds) in a numerically exact way. %Since the quantum trajectory method falls into the class of standard sampling problems, performance of the algorithm %can be substantially improved by implementing it on a computer cluster. By using a scalable $N$-particle quantum model, we demonstrate that the algorithm allows us to resolve the asymptotic density operator of the model system with $N = 2000$ states on a regular-size computer cluster, thus reaching the scale on which numerical studies of modulated Hamiltonian systems are currently performed

Geometrical Lattice models for N=2 supersymmetric theories in two dimensions

We introduce in this paper two dimensional lattice models whose continuum limit belongs to the $N=2$ series. The first kind of model is integrable and obtained through a geometrical reformulation, generalizing results known in the $k=1$ case, of the $\Gamma_{k}$ vertex models (based on the quantum algebra $U_{q}sl(2)$ and representation of spin $j=k/2$). We demonstrate in particular that at the $N=2$ point, the free energy of the $\Gamma_{k}$ vertex model can be obtained exactly by counting arguments, without any Bethe ansatz computation, and we exhibit lattice operators that reproduce the chiral ring. The second class of models is more adequately described in the language of twisted $N=2$ supersymmetry, and consists of an infinite series of multicritical polymer points, which should lead to experimental realizations. It turns out that the exponents $\nu=(k+2)/2(k+1)$ for these multicritical polymer points coincide with old phenomenological formulas due to the chemist Flory. We therefore confirm that these formulas are {\bf exact} in two dimensions, and suggest that their unexpected validity is due to non renormalization theorems for the $N=2$ underlying theories. We also discuss the status of the much discussed theta point for polymers in the light of $N=2$ renormalization group flows.Comment: 23 pages (without figures