A behavioral approach to identifiability of 2D scalar systems (Q674957)

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.