A polynomial matrix theory for a certain class of two-dimensional linear systems (Q1923172)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial matrix theory for a certain class of two-dimensional linear systems |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A polynomial matrix theory for a certain class of two-dimensional linear systems |
scientific article |
Statements
A polynomial matrix theory for a certain class of two-dimensional linear systems (English)
0 references
12 March 1997
0 references
Repetitive processes are a class of two-dimensional linear systems whose unique characteristic is a series of sweeps, termed passes, through a set of dynamics defined over a fixed finite duration known as the pass length. On each pass, an output, termed the pass profile, is produced which acts as a forcing function on, and hence contributes to, the next pass profile. Industrial examples include long-wall coal cutting and metal-rolling operators and algorithmic examples include classes of iterative learning control schemes. In effect, the two-dimensional systems structure of these processes arises from the need to use two coordinates to specify a variable, i.e. the pass number or index \(k>0\) and the position `\(t\)' along a given pass which is of finite duration by definition. Hence, repetitive processes are a class of two-dimensional systems where the duration of information propagation in one direction (along the pass) is finite and infinite in the other (pass to pass). One of the most powerful approaches in classical linear systems is the so-called polynomial matrix description (PMD). Here, this approach is extended to the two-dimensional case and new major results due to such an interpretation and concerning the fundamental dynamic behavior of linear differential repetitive processes are provided. A key feature here is the need to take into account the difficulties coming from the complexity of the underlying polynomial ring structure, which is a considerable task in comparison to the classical one-dimensional case.
0 references
repetitive processes
0 references
linear systems
0 references
iterative learning control
0 references
two-dimensional systems
0 references
polynomial matrix description
0 references
polynomial ring
0 references
0 references