Minimal dimension dynamic covers play an important role in solving the structural synthesis problems of minimum order functional observers or fault detectors, or in computing minimal order inverses or minimal degree solutions of rational equations. We propose numerically reliable algorithms to compute two basic types of minimal dimension dynamic covers for a linear system. The proposed approach is based on a special controllability staircase condensed form of a structured pair (A; [B1;B2]), which can be computed using exclusively orthogonal similarity transformations. Using such a condensed form minimal dimension covers and corresponding feedback/feedforward matrices can be easily computed. The overall algorithm has a low computational complexity and is provably numerically reliable.


    Access

    Download


    Export, share and cite



    Title :

    Reliable algorithms for computing minimal dynamic covers


    Contributors:

    Conference:

    2003 ; Maui, Hawaii (USA)


    Publication date :

    2003-12-01


    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    Laser Ablated Removable Car Seat Covers for Reliable Deployment of Side Airbags

    Arun Vijayan / Amit Jadhav / Rajiv Padhye | DOAJ | 2016

    Free access

    Minimal-latency human action recognition using reliable-inference

    Davis, J. W. / Tyagi, A. | British Library Online Contents | 2006


    Covers

    IEEE | 2005

    Free access

    Covers

    IEEE | 2007

    Free access