Identifiability and distinguishability testing via computer algebra
This paper describes how computer algebra can be of help when studying either the identifiability of one given parametric model structure or the distinguishability of several of them. Two examples are used to briefly recall classical methods for checking model structures for these properties. The first one deals with the identifiability of model structures that are being used for describing the first-pass effect of drugs after oral administration. The second one studies the distinguishability of two nonlinear compartmental model structures with Michaelis-Menten elimination kinetics. In both cases classical methods yield a set of algebraic equations that can easily be put in polynomial form. Testing model structures for identifiability or distinguishability then amounts to characterizing the number of solutions of this set of polynomial equations. Two approaches are described for this purpose, which have been implemented using the algebraic manipulation language reduce. Among other things, they make it possible to prove that none of the model structures used for describing the first-pass effect is identifiable and to generate the set of all output-indistinguishable models.
- Algebra of Polynomials in Several Variables for a Digital Computer
- Complete parameter bounds and quasiidentifiability conditions for a class of unidentifiable linear systems
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Fonctionnelles causales non linéaires et indéterminées non commutatives
- Generalization of the Rank and Order Conditions for Identifiability
- Global approaches to identifiability testing for linear and nonlinear state space models
- scientific article; zbMATH DE number 3924604 (Why is no real title available?)
- scientific article; zbMATH DE number 3771547 (Why is no real title available?)
- scientific article; zbMATH DE number 3803235 (Why is no real title available?)
- scientific article; zbMATH DE number 3252945 (Why is no real title available?)
- Identifiability Criteria in Nonlinear Systems
- On structural identification
- On the structural output distinguishability of parametric models, and its relations with structural identifiability
- On the uniqueness of linear compartmental systems
- Parametrizations of linear dynamical systems: Canonical forms and identifiability
- Solutions of systems of polynomial equations by elimination
- Structural equivalence of linear systems and compartmental models
- System identifiability based on the power series expansion of the solution
- The Identification of Structural Characteristics
- Topics in pharmacokinetics. IV: Approximation in process space and fitting by sums of exponentials
- Unidentifiable compartmental models: What to do?
- Structural identifiability of a model for the acetic acid fermentation process
- Numerical parameter identifiability and estimability: Integrating identifiability, estimability, and optimal sampling design
- Procedures to investigate injectivity of polynomial maps and to compute the inverse
- Decomposition-based qualitative experiment design algorithms for a class of compartmental models
- Computer algebra is indispensable in some problems of mathematical biology. (Letter to the editor)
- On global identifiability for arbitrary model parametrizations
- Indistinguishability for a class of nonlinear compartmental models
- First steps towards exact algebraic identification
- Design of experiments
- Metabolic isotopomer labeling systems. II: Structural flux identifiability analysis.
- Global identifiability of the parameters of nonlinear systems with specified inputs: A comparison of methods
- A methodology for compartmental model indistinguishability
- Nonlinear compartmental model indistinguishability
- Structural identifiability of polynomial and rational systems
- Computer algebra tests on identifiability of nonlinear implicit dynamical systems
- scientific article; zbMATH DE number 4072795 (Why is no real title available?)
- Estimation of physical parameters for dynamic processes with application to an industrial robot
- scientific article; zbMATH DE number 1202701 (Why is no real title available?)
- scientific article; zbMATH DE number 1301087 (Why is no real title available?)
- Indistinguishability tests in the actor–partner interdependence model
- Algebraic tools for the analysis of state space models
- scientific article; zbMATH DE number 836575 (Why is no real title available?)
- Numerical Software with Result Verification
- Differential elimination and biological modelling
- An effective automatic procedure for testing parameter identifiability of HIV/AIDS models
- Graph-based sufficient conditions for the indistinguishability of linear compartmental models
- Indistinguishability and identifiability analysis of linear compartmental models
- Similarity transformation approach to identifiability analysis of nonlinear compartmental models
- Qualitative and quantitative experiment design for phenomenological models - a survey
This page was built for publication: Identifiability and distinguishability testing via computer algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063562)
