KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Tue, 10 Feb 2004 10:01:35 +0100Tue, 10 Feb 2004 10:01:35 +0100Padé-like reduction of stable discrete linear systems preserving their stability
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1505
A new stability preserving model reduction algorithm for discrete linear SISO-systems based on their impulse response is proposed. Similar to the Padé approximation, an equation system for the Markov parameters involving the Hankel matrix is considered, that here however is chosen to be of very high dimension. Although this equation system therefore in general cannot be solved exactly, it is proved that the approximate solution, computed via the Moore-Penrose inverse, gives rise to a stability preserving reduction scheme, a property that cannot be guaranteed for the Padé approach. Furthermore, the proposed algorithm is compared to another stability preserving reduction approach, namely the balanced truncation method, showing comparable performance of the reduced systems. The balanced truncation method however starts from a state space description of the systems and in general is expected to be more computational demanding.S. Feldmann; P. Langreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1505Tue, 10 Feb 2004 10:01:35 +0100Parameter Influence On The Zeros Of NetworkDeterminants
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1489
To a network N(q) with determinant D(s;q) depending on a parameter vector q Î Rr via identification of some of its vertices, a network N^ (q) is assigned. The paper deals with procedures to find N^ (q), such that its determinant D^ (s;q) admits a factorization in the determinants of appropriate subnetworks, and with the estimation of the deviation of the zeros of D^ from the zeros of D. To solve the estimation problem state space methods are applied.S. Feldmann; P. Lang; D. Prätzel-Woltersreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1489Mon, 02 Feb 2004 15:32:43 +0100