A probabilistic algorithm to test local algebraic observability in polynomial time

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 309-316

  Sedoglavic, A ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

Identifiability; Observability; Seminumerical algorithm

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR ALGEBRA; MATRIX ALGEBRA; NUMERICAL METHODS; OBSERVABILITY; PROBABILITY;

IDENTIFIABILITY; LOCAL ALGEBRAIC OBSERVABILITY; POLYNOMIAL TIME; PROBABILISTIC ALGORITHM; SEMINUMERICAL ALGORITHM;

ALGORITHMS;

EID: 0034772191     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384143     Document Type: Conference Paper

References (33)

1. The complexity of partial derivatives
2. Efficient computation of regular differential systems by change of rankings using Kähler differentials
3. Representation for the radical of a finitely generated differential ideal
4. Fast algorithms for manipulating formal power series
5. Kronecker's and Newton's approaches to solving: A first comparison
6. On nonlinear observability
7. Automatique et corps différentiels
8. Efficient algorithms and bounds for Wu-Ritt characteristic sets
9. Convergence behaviour of the Newton iteration for first order differential equations
10. A Gröbner free alternative for polynomial systems solving
11. A model for circadian oscillations in the Drosophila period protein
12. Nonlinear controllability and observability
13. Factorisation free decomposition algorithms in differential algebra
14. Kähler differentials and differential algebra
15. On the general theory of control systems
16. Computational differentiation and algebraic complexity theory
17. Parametrization of nonlinear model structures as linear regressions
18. On global identifiability for arbitrary model parametrizations
19. System identifiability based on the power series expansion of the solution
20. A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications
21. Similarity transformation approach to identifiability analysis of non linear comportemental models