A probabilistic algorithm to test local algebraic observability in polynomial time

DOI10.1006/jsco.2002.0532zbMath1055.93011arXivmath/0010045OpenAlexW2675964770MaRDI QIDQ5894826

Alexandre Sedoglavic

Publication date: 17 September 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0010045

Mathematics Subject Classification ID

Related Items (27)

Fast computation of discrete invariants associated to a differential rational mapping ⋮ Moving horizon observer with regularisation for detectable systems without persistence of excitation ⋮ Identifiability of large-scale non-linear dynamic network models applied to the ADM1-case study ⋮ Multi-experiment Parameter Identifiability of ODEs and Model Theory ⋮ Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability ⋮ Joining forces of Bayesian and frequentist methodology: a study for inference in the presence of non-identifiability ⋮ A fast algorithm to assess local structural identifiability ⋮ Observability and structural identifiability of nonlinear biological systems ⋮ AutoRepar: A method to obtain identifiable and observable reparameterizations of dynamic models with mechanistic insights ⋮ Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages ⋮ Предсказательное моделирование массообменного технологического объекта с использованием алгоритма чередующихся условных математических ожиданий ⋮ On Symbolic Approaches to Integro-Differential Equations ⋮ Weak identifiability for differential algebraic systems ⋮ State elimination and identifiability of the delay parameter for nonlinear time-delay systems ⋮ Minimal output sets for identifiability ⋮ Identifiability from a few species for a class of biochemical reaction networks ⋮ Observability of complex systems ⋮ Structural identifiability analysis of some highly structured families of statespace models using differential algebra ⋮ On the complexity of the resolvent representation of some prime differential ideals ⋮ On analytic and algebraic observability of nonlinear delay systems ⋮ Differential Algebra and System Modeling in Cellular Biology ⋮ Structural identifiability of a model for the acetic acid fermentation process ⋮ Gravito-inertial ambiguity resolved through head stabilization ⋮ Implicit Riquier bases for PDAE and their semi-discretizations ⋮ Structural identifiability analysis via symmetries of differential equations ⋮ A computational approach to the structural analysis of uncertain kinetic systems ⋮ Robust global identifiability theory using potentials -- application to compartmental models

Uses Software

• Kronecker
• ObservabilityTest

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations
• Similarity transformation approach to identifiability analysis of nonlinear compartmental models
• Reducibility by algebraic projections
• The complexity of partial derivatives
• System identifiability based on the power series expansion of the solution
• Factorization-free decomposition algorithms in differential algebra
• A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications
• Kähler differentials and differential algebra
• Associative differential operations
• Automatique et corps différentiels
• Fast Algorithms for Manipulating Formal Power Series
• Nonlinear controllability and observability
• A Gröbner free alternative for polynomial system solving
• Kronecker's and Newton's approaches to solving: a first comparison

This page was built for publication: A probabilistic algorithm to test local algebraic observability in polynomial time