A behavioral approach to identifiability of 2D scalar systems (Q674957)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 987789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A behavioral approach to identifiability of 2D scalar systems |
scientific article; zbMATH DE number 987789 |
Statements
A behavioral approach to identifiability of 2D scalar systems (English)
0 references
25 October 1998
0 references
This paper deals with the following problem: given a system belonging to the family of 2D (two dimensional) partial difference equations, identify this system starting from 2D data arrays, in the particular case of noise-free data. To this end the amount of data needed for such a reconstruction is investigated. The author expresses this amount in terms of two indices: the first is the number of 2D arrays that are necessary, while the second describes the dimension of the finite 2D support on which the 2D data arrays are given.
0 references
identifiability
0 references
2D difference equations
0 references
0 references
0 references
0.85089743
0 references
0.84608287
0 references
0.8439653
0 references
0.84203863
0 references
