Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 1763

Preprint Number 1763

Previous Next Preprint server

1763. Alexey Ovchinnikov, Anand Pillay, Gleb Pogudin, and Thomas Scanlon
Computing all identifiable functions for ODE models

Submission date: 16 April 2020


Parameter identifiability is a structural property of an ODE model for recovering the values of parameters from the data (i.e., from the input and output variables). This property is a prerequisite for meaningful parameter identification in practice. In the presence of nonidentifiability, it is important to find all functions of the parameters that are identifiable. The existing algorithms check whether a given function of parameters is identifiable or, under the solvability condition, find all identifiable functions. Our first main result is an algorithm that computes all identifiable functions without any additional assumptions. Our second main result concerns the identifiability from multiple experiments. For this problem, we show that the set of functions identifiable from multiple experiments is what would actually be computed by input-output equation-based algorithms if the solvability condition is not fulfilled. We give an algorithm that not only finds these functions but also provides an upper bound for the number of experiments to be performed to identify these functions.

Mathematics Subject Classification: 34A55, 12H05, 03C60, 92B99, 93B07, 93B30

Keywords and phrases:

Full text arXiv 2004.07774: pdf, ps.

Last updated: March 23 2021 09:21 Please send your corrections to: