Effective algorithms for parametrizing linear control systems over Ore algebras (Q2491981): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Mgfun / rank | |||
Normal rank |
Revision as of 00:59, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Effective algorithms for parametrizing linear control systems over Ore algebras |
scientific article |
Statements
Effective algorithms for parametrizing linear control systems over Ore algebras (English)
0 references
31 May 2006
0 references
The authors introduce constructive methods to study structural properties of linear control systems, surveying major achievements in the field over the last decade. They consider linear systems as functional operators defined over an Ore algebra, an algebra of non-commutative polynomials where the operators (differential, shift, difference or divided difference) satisfy some commutation rules. This allows for a unified treatment of time-varying ordinary differential equations, differential time-delay systems, partial differential equations or multidimensional systems, among others. Effective algorithms and publicly available computer packages are described to decide whether a system is controllable, parametrizable, or flat. The paper is a nice interplay between module theory, homological algebra, control theory and computational methods. It contains several illustrative examples and documented computer experiments. The paper should be of high relevance to researchers interested in mathematically sound and constructive approaches to studying structural properties of linear dynamical systems.
0 references
linear systems
0 references
non-commutative algebra
0 references
homological algebra
0 references
computational methods
0 references