Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation 2001
DOI: 10.1145/384101.384143
|View full text |Cite
|
Sign up to set email alerts
|

A probabilistic algorithm to test local algebraic observability in polynomial time

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 t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
77
0
2

Year Published

2002
2002
2024
2024

Publication Types

Select...
5
4
1

Relationship

1
9

Authors

Journals

citations
Cited by 47 publications
(80 citation statements)
references
References 32 publications
0
77
0
2
Order By: Relevance
“…To perform nonlinear observability analysis of the models, we apply an observability test algorithm described in [171,172] by A. Sedoglavic. The algorithm is implemented in Maple.…”
Section: Nonlinear Algebraic Methods For Observability Testmentioning
confidence: 99%
“…To perform nonlinear observability analysis of the models, we apply an observability test algorithm described in [171,172] by A. Sedoglavic. The algorithm is implemented in Maple.…”
Section: Nonlinear Algebraic Methods For Observability Testmentioning
confidence: 99%
“…Identifiability analysis can be formulated as a nonlinear observability problem [9,19]. To do so, let us augment the state variable vector so as to include also the model parameters:…”
Section: Structural Identifiability As Observabilitymentioning
confidence: 99%
“…Moderately complex nonlinear ode systems can be handled by methods of differential algebra (Saccomani [2004]) but large scale systems still remain intractable. As an alternative for larger systems, a local method has been proposed that only assigns a probability of non-identifiability (Sedoglavic [2002]). To overcome the limitations in system size the original ode system (Eq.…”
Section: Structural Identifiabilitymentioning
confidence: 99%