Skip to Main content Skip to Navigation
Conference papers

A probabilistic algorithm to test local algebraic observability in polynomial time

Alexandre Sedoglavic 1, 2
1 ALIEN - Algebra for Digital Identification and Estimation
Inria Lille - Nord Europe, Inria Saclay - Ile de France, Centrale Lille, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR8146
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 behavior 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 the symmetries of the model letting the inputs and the outputs 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 differential system. Last, we estimate the probability of success of our algorithm and we present some benchmarks from our Maple implementation.
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Alexandre Sedoglavic Connect in order to contact the contributor
Submitted on : Saturday, January 27, 2007 - 11:46:49 AM
Last modification on : Friday, February 4, 2022 - 3:16:50 AM
Long-term archiving on: : Wednesday, April 7, 2010 - 2:31:43 AM


Files produced by the author(s)


  • HAL Id : inria-00126995, version 1



Alexandre Sedoglavic. A probabilistic algorithm to test local algebraic observability in polynomial time. International Symposium on Symbolic and Algebraic Computation, Jul 2001, London, Ontorio, Canada. ⟨inria-00126995⟩



Record views


Files downloads