In this paper, we give a numerically reliable algorithm to compute the zeros of a periodic descriptor system. The algorithm is a variant of the staircase algorithm applied to the system pencil of an equivalent lifted time-invariant state-space system and extracts a low-order pencil which contains the zeros (both finite and infinite) as well as the Kronecker structure of the periodic descriptor system. The proposed algorithm is efficient in terms of complexity by exploiting the structure of the pencil and is exclusively based on orthogonal transformations, which ensures some form of numerical stability.


    Access

    Download


    Export, share and cite



    Title :

    Computing the zeros of periodic descriptor systems


    Contributors:
    Varga, A. (author) / Dooren, P. Van (author)

    Published in:

    Publication date :

    2003


    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    On computing the zeros of periodic systems

    Varga, Andras / Dooren, Paul Van | German Aerospace Center (DLR) | 2002

    Free access

    Strongly stable algorithm for computing periodic system zeros

    Varga, Andras | German Aerospace Center (DLR) | 2003

    Free access



    Optimal Regulator for Descriptor Systems

    Nakata, T. / Ikeda, M. / Uezato, E. | British Library Online Contents | 1994