Two approaches for testing identifiability and corresponding algorithms

Lilianne Denis-Vidal (1) , Ghislaine Joly-Blanchard (1) , Céline Noiret (1) , Michel Petitot (2)

1 LMAC - Laboratoire de Mathématiques Appliquées de Compiègne
2 LIFL - Laboratoire d'Informatique Fondamentale de Lille

This paper considers two different methods in the analysis of nonlinear controlled dynamical system identifiability. The corresponding identifiability definitions are not equivalent. Moreover one is based on the construction of an input-output ideal and the other on the similarity transformation theorem. Our aim is to develop algorithms which give identifiability results from both approaches. Differential algebra theory allows realization of such a project. In order to state these algorithms, new results of differential algebra must be proved. Then the implementation of these algorithms is done in a symbolic computation language.

Mots clés: Nonlinear dynamical systems; Structural identifiability; Symbolic manipulation

Domaines: Systèmes dynamiques [math.DS]

Lilianne Denis-Vidal, Ghislaine Joly-Blanchard, Céline Noiret, Michel Petitot. Two approaches for testing identifiability and corresponding algorithms. 2006. ⟨hal-00696659⟩