We propose a computationally efficient and numerically reliable algorithm to compute the finite zeros of a linear discrete-time periodic system. The zeros are defined in terms of the transfer-function matrix corresponding to an equivalent lifted time-invariant state-space system. The proposed method relies on structure preserving manipulations of the associated system pencil to extract successively lower complexity subpencils which contains the finite zeros of the periodic system. The new algorithm uses exclusively structure preserving orthogonal transformations and for the overall computation of zeros the strong numerical stability can be proved.


    Access

    Download


    Export, share and cite



    Title :

    Strongly stable algorithm for computing periodic system zeros


    Contributors:

    Conference:

    2003 ; Maui, Hawaii (USA)


    Publication date :

    2003-12-01


    Type of media :

    Conference paper


    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

    Computing the zeros of periodic descriptor systems

    Varga, A. / Dooren, P. Van | German Aerospace Center (DLR) | 2003

    Free access


    Station-Keeping for Periodic Orbits near Strongly Perturbed Binary Asteroid Systems

    Shi, Yu / Wang, Yue / Misra, Arun K. et al. | AIAA | 2020


    Expansion Formulae of Sampled Zeros and a Method to Relocate the Zeros

    Sogo, T. | British Library Online Contents | 2010