Tellegen's principle, non-minimal realization of systems and inversion of polynomial Vandermonde matrices (Q2882912)

From MaRDI portal





scientific article; zbMATH DE number 6032986
Language Label Description Also known as
default for all languages
No label defined
    English
    Tellegen's principle, non-minimal realization of systems and inversion of polynomial Vandermonde matrices
    scientific article; zbMATH DE number 6032986

      Statements

      11 May 2012
      0 references
      Vandermonde matrix inversion
      0 references
      Kalman's duality
      0 references
      Tellegen's principle
      0 references
      signal flow graphs
      0 references
      inversion algorithm
      0 references
      polynomial Vandermonde matrix
      0 references
      numerical experiments
      0 references
      Gauss-Jordan method
      0 references
      0 references
      0 references
      0 references
      Tellegen's principle, non-minimal realization of systems and inversion of polynomial Vandermonde matrices (English)
      0 references
      The authors study the relationship between the following concepts: (1) Electrical Engineering -- inversion of a signal flow graph, (2) Computer Science -- Tellegen's principle, and (3) Linear Algebra -- inversion of a polynomial Vandermonde matrix. They establish the connection between Kalman's duality and Tellegen's principle. This fact is used to prove the duality theorem for the case of the non-minimal realization of a system. They develop a procedure, which for any given system of polynomials leads to an inversion algorithm for the corresponding polynomial Vandermonde matrix. The results of preliminary numerical experiments with the proposed algorithm are given. The code for the numerical experiments is written in MATLAB, for the Gauss-Jordan method.
      0 references

      Identifiers