On global identifiability for arbitrary model parametrizations
Automatica (Journal of IFAC)
Representation for the radical of a finitely generated differential ideal
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Some effective approaches to check the identifiability of uncontrolled nonlinear systems
Mathematics and Computers in Simulation
A probabilistic algorithm to test local algebraic observability in polynomial time
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Computing representations for radicals of finitely generated differential ideals
Applicable Algebra in Engineering, Communication and Computing - Special Issue: Jacobi's Legacy
Brief paper: Structural identifiability analysis via symmetries of differential equations
Automatica (Journal of IFAC)
Computer Methods and Programs in Biomedicine
Brief Identifiability of uncontrolled nonlinear rational systems
Automatica (Journal of IFAC)
Hi-index | 0.00 |
Analysis of the identifiability of a given model system is an essential prerequisite to the determination of model parameters from physical data. However, the tools available for the analysis of non-linear systems can be limited both in applicability and by computational intractability for any but the simplest of models. The input-output relation of a model summarises the input-output structure of the whole system and as such provides the potential for an alternative approach to this analysis. However for this approach to be valid it is necessary to determine whether the monomials of a differential polynomial are linearly independent. A simple test for this property is presented in this work. The derivation and analysis of this relation can be implemented symbolically within Maple. These techniques are applied to analyse classical models from biomedical systems modelling and those of enzyme catalysed reaction schemes.