Answers are grounded in this paper and cite their sources.
Global deterministic identifiability of nonlinear systems is studied by constructing the family of local state isomorphisms that preserve the structure of the parametric system. The method is simplified for homogeneous systems, where such isomorphisms are shown to be linear, thereby reducing the identifiability problem to solving a set of algebraic equations. The known conditions for global identifiability in linear and bilinear systems are special cases of these results.>
No takes yet. Share an insight, caveat, or question.
Vajda et al. (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: