System equivalence for AR-systems over rings -- with an application to delay-differential systems (Q1306786): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q587382
Property / reviewed by
 
Property / reviewed by: Frieda Theron / rank
Normal rank
 

Revision as of 17:38, 19 February 2024

scientific article
Language Label Description Also known as
English
System equivalence for AR-systems over rings -- with an application to delay-differential systems
scientific article

    Statements

    System equivalence for AR-systems over rings -- with an application to delay-differential systems (English)
    0 references
    19 December 2000
    0 references
    Auto-regressive (AR) systems with defining equations described by matrices over an arbitrary integral domain \(\mathcal{R}\) are studied in this paper. The results form a generalization of AR-systems over \({\mathbb{R}}[s]\) or \({\mathbb{R}}[s, s^{-1}]\) in a way reminiscent of the extension of the theory of state space systems over fields to the ring case. In the behavioral approach to dynamical systems, a system is described as a triple \((T,W,\mathcal{B})\), where \(T\) is the time-axis, \(W\) is the space in which the signals take their values and \(\mathcal{B}\) (the behavior) is a subspace of the signal space \(W^{T}\). The behavior is then considered as the set of all time-trajectories which satisfy the governing laws of the system. The set-up in this paper is as follows: Let \( \mathcal{R}\) be an integral domain and let \( \mathcal{M}\) be a module over \( \mathcal{R}\), consisting of all (one-variable) trajectories under consideration. Each ring element is associated with an operator acting on the elements of the module \( \mathcal{M}\). This set-up differs from the behavioral approach in that a time-axis \(T\) and a space \(W\) are not explicitly described. Instead, \( {\mathcal{M}}^{q}\) is taken as the signal space, allowing endowment with a richer structure. The goal of the paper is to characterize all matrices over \( \mathcal{R}\) describing the same behavior for a given module \( \mathcal{M}\) over \( \mathcal{R}\). This problem is tackled by defining a ring extension \( \mathcal{R}_{M}\) of \( \mathcal{R}\) which explicitly depends on \( \mathcal{M}\). It turns out that \( \mathcal{M}\) is also a module over \( \mathcal{R_M}\) and that a system \( (P, {\mathcal{M}}^q)\) over \( \mathcal{R}\), where \(P \in {\mathcal{R}}^{p \times q}\), can also be considered as a system over \( \mathcal{R_M}.\) This allows greater freedom of manipulation, provided \( \mathcal{R}\) is indeed properly contained in \( \mathcal{R_M}\). A sufficient condition for equality of these is found. For the study of system equivalence, the module \( \mathcal{M}\) is assumed to be divisible (a rather restrictive assumption, not satisfied by several discrete-time systems). Necessary and sufficient conditions for equivalence are found, first in the case of square matrices and then also in the general case. The paper concludes with an application to differential systems, where the ring \( \mathcal{R_M}\) is characterized explicitly.
    0 references
    autoregressive systems (AR-systems)
    0 references
    systems over rings
    0 references
    delay-differential systems
    0 references
    behavioral approach
    0 references
    system equivalence
    0 references

    Identifiers