A probabilistic algorithm to test local algebraic observability in polynomial time

  • Authors:

  • Alexandre Sedoglavic

  • Affiliations:

  • Projet Algorithmes, INRIA Rocquencourt, F-78153 Le Chesnay Cedex, France and Laboratoire GAGE, École polytechnique, F-91128 Palaiseau Cedex, France

  • Venue:
  • Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behaviour of an experiment? How many of the remaining variables should we assume to be known in order to determine all the others? These questions are parts of the local algebraic observability problem which is concerned with the existence of a non-trivial Lie subalgebra of model's symmetries letting the inputs and the outputs be invariant.We present a probabilistic seminumerical algorithm that proposes a solution to this problem in polynomial time. A bound for the necessary number of arithmetic operations on the rational field is presented. This bound is polynomial in the complexity of evaluation of the model and in the number of variables. Furthermore, we show that the size of the integers involved in the computations is polynomial in the number of variables and in the degree of the system. Last, we estimate the probability of success of our algorithm.