Computing the zeros of periodic descriptor systems

Varga, A;Van Dooren, Paul
(2003) Systems & Control Letters — Vol. 50, n° 5, p. 371-381 (2003)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 254.91 KB
Request a copy

Details

Authors
  • Varga, A
    Author
  • Van Dooren, PaulUCLouvain
    Author
Abstract
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. (C) 2003 Elsevier B.V. All rights reserved.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Varga, A., & Van Dooren, P. (2003). Computing the zeros of periodic descriptor systems. Systems & Control Letters, 50(5), 371-381. https://doi.org/10.1016/S0167-6911(03)00194-4 (Original work published 2003)