A direct method to obtain a realization of a polynomial matrix and its applications
| Autor: | Beatriz Ricarte, Ana M. Urbano, S. Moll, Rafael Cantó |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Algebra and Number Theory
Applied Mathematics Direct method 010102 general mathematics Minimal realization 01 natural sciences Polynomial matrix 010101 applied mathematics Reduction (complexity) Computational Mathematics Matrix (mathematics) Factorization Control theory Polynomial matrices Applied mathematics Geometry and Topology 0101 mathematics MATEMATICA APLICADA Realization (systems) Full rank factorization Analysis Mathematics |
| Zdroj: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia instname |
| ISSN: | 1579-1505 1578-7303 |
| DOI: | 10.1007/s13398-020-00819-1 |
| Popis: | [EN] In this paper we present a Silverman-Ho algorithm-based method to obtain a realization of a polynomial matrix. This method provides the final formulation of a minimal realization directly from a full rank factorization of a specific given matrix. Also, some classical problems in control theory such as model reduction in singular systems or the positive realization problem in standard systems are solved with this method. Work supported by the Spanish DGI grant MTM2017-85669-P-AR. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink