A probabilistic algorithm to test local algebraic observability in polynomial time
From MaRDI portal
Publication:5892265
DOI10.1145/384101.384143zbMath1356.93017OpenAlexW2128971596MaRDI QIDQ5892265
Publication date: 3 February 2017
Published in: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/384101.384143
Related Items (3)
Prediction uncertainty and optimal experimental design for learning dynamical systems ⋮ ObservabilityTest ⋮ Modular Parameter Identification of Biomolecular Networks
This page was built for publication: A probabilistic algorithm to test local algebraic observability in polynomial time