Abstract
We introduce a new notion of parameter identifiability for ODE systems following a multi-experiment approach. We show that a system that is identifiable according to previous well-known notions is also identifiable with our definition, but that the converse is not always true. In this sense, we speak of weak identifiability. We provide finite criteria to check weak identifiability and present algorithms that decide whether a system is weakly identifiable or not.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have