392 research outputs found
A Vector Matroid-Theoretic Approach in the Study of Structural Controllability Over F(z)
In this paper, the structural controllability of the systems over F(z) is
studied using a new mathematical method-matroids. Firstly, a vector matroid is
defined over F(z). Secondly, the full rank conditions of [sI-A|B] are derived
in terms of the concept related to matroid theory, such as rank, base and
union. Then the sufficient condition for the linear system and composite system
over F(z) to be structurally controllable is obtained. Finally, this paper
gives several examples to demonstrate that the married-theoretic approach is
simpler than other existing approaches
Balanced truncation for time-delay systems via approximate gramians
In circuit simulation, when a large RLC network is connected with delay elements, such as transmission lines, the resulting system is a time-delay system (TDS). This paper presents a new model order reduction (MOR) scheme for TDSs with state time delays. It is the first time to reduce a TDS using balanced truncation. The Lyapunov-type equations for TDSs are derived, and an analysis of their computational complexity is presented. To reduce the computational cost, we approximate the controllability and observability Gramians in the frequency domain. The reduced-order models (ROMs) are then obtained by balancing and truncating the approximate Gramians. Numerical examples are presented to verify the accuracy and efficiency of the proposed algorithm. ©2011 IEEE.published_or_final_versionThe 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011), Yokohama, Japan, 25-28 January 2011. In Proceedings of the 16th ASP-DAC, 2011, p. 55-60, paper 1C-
Passivity-preserving parameterized model order reduction using singular values and matrix interpolation
We present a parameterized model order reduction method based on singular values and matrix interpolation. First, a fast technique using grammians is utilized to estimate the reduced order, and then common projection matrices are used to build parameterized reduced order models (ROMs). The design space is divided into cells, and a Krylov subspace is computed for each cell vertex model. The truncation of the singular values of the merged Krylov subspaces from the models located at the vertices of each cell yields a common projection matrix per design space cell. Finally, the reduced system matrices are interpolated using positive interpolation schemes to obtain a guaranteed passive parameterized ROM. Pertinent numerical results validate the proposed technique
Extended balancing of continuous LTI systems:A structure-preserving approach
In this paper, we treat extended balancing for continuous-time linear time-invariant systems. We take a dissipativity perspective, thus resulting in a characterization in terms of linear matrix inequalities. This perspective is useful for determining a priori error bounds. In addition, we address the problem of structure-preserving model reduction of the subclass of port-Hamiltonian systems. We establish sufficient conditions to ensure that the reduced-order model preserves a port-Hamiltonian structure. Moreover, we show that the use of extended Gramians can be exploited to get a small error bound and, possibly, to preserve a physical interpretation for the reduced-order model. We illustrate the results with a large-scale mechanical system example. Furthermore, we show how to interpret a reduced-order model of an electrical circuit again as a lower-dimensional electrical circuit
Efficient positive-real balanced truncation of symmetric systems via cross-riccati equations
We present a highly efficient approach for realizing a positive-real balanced truncation (PRBT) of symmetric systems. The solution of a pair of dual algebraic Riccati equations in conventional PRBT, whose cost constrains practical large-scale deployment, is reduced to the solution of one cross-Riccati equation (XRE). The cross-Riccatian nature of the solution then allows a simple construction of PRBT projection matrices, using a Schur decomposition, without actual balancing. An invariant subspace method and a modified quadratic alternating-direction-implicit iteration scheme are proposed to efficiently solve the XRE. A low-rank variant of the latter is shown to offer a remarkably fast PRBT speed over the conventional implementations. The XRE-based framework can be applied to a large class of linear passive networks, and its effectiveness is demonstrated through numerical examples. © 2008 IEEE.published_or_final_versio
- …