A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A probabilistic algorithm to test local algebraic observability in polynomial time

2001
*
Proceedings of the 2001 international symposium on Symbolic and algebraic computation - ISSAC '01
*

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 model's symmetries letting the

doi:10.1145/384101.384143
dblp:conf/issac/Sedoglavic01
fatcat:y7x5ediutrcl5a6biksty5wwim