Ritt's algorithm, Gröbner basis and discretization (Q1381803): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:09, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ritt's algorithm, Gröbner basis and discretization |
scientific article |
Statements
Ritt's algorithm, Gröbner basis and discretization (English)
0 references
26 July 1998
0 references
The purpose of this paper is to obtain a discrete-time version of Fliess' generalized canonical observability form by the application of commutative and differential algebra. Two alternative methods are described. The first applies Ritt's algorithm to the set of polynomial differential equations describing the continuous-time nonlinear system. The resulting characteristic set contains a differential polynomial which describes the input-output behavior of the system. Discretizing this polynomial leads to a dicrete-time model. The second method first discretizes the continuous-time representation and then applies Buchberger's algorithm. This yields a Gröbner base which contains a polynomial difference equation describing the input-output behavior. Two examples of dynamical systems which are algebraically observable from the output complete the paper.
0 references
canonical observability form
0 references
Ritt's algorithm
0 references
Gröbner basis
0 references
discretization
0 references
discrete-time
0 references
differential algebra
0 references