Please use this identifier to cite or link to this item:
For citation please use:
Main Title: Computation of State Reachable Points of Linear Time Invariant Descriptor Systems
Author(s): Datta, Subashish
Mehrmann, Volker
Type: Research Paper
Abstract: This paper considers the problem of computing the state reachable points, from the origin, of a linear constant coefficient first or higher order descriptor system. A method is proposed that allows to compute the reachable set in a numerically stable way. The original descriptor system is transformed into a strangeness-free system within the behavioral framework followed by a projection that separates the system into differential and algebraic equations while keeping the original state variables. For first order systems it is shown that the computation of the image space of two matrices, associated with the projected system, is enough to compute the reachable set (from the origin). Moreover, a characterization is presented of all the inputs by which one can reach an arbitrary point in the reachable set. The results are extended to second order systems and the effectiveness of the proposed approach is demonstrated through some elementary examples.
Subject(s): linear time invariant descriptor system
behavior formulation
strangeness-free formulation
derivative array
second order system
Issue Date: 25-Nov-2014
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 93C05 Linear systems
93C15 Systems governed by ordinary differential equations
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2014, 17
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Format: Adobe PDF | Size: 168.09 kB
DownloadShow Preview

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.