Identifiability with Constraints
1999 (English)Report (Other academic)
It is shown that identifiability of very general nonlinear models, described by polynomial implicit differential equations, inequations and inequalities, can be decided algorithmically. An algorithm based on differential algebra and real algebra can perform the calculations.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 1999. , 6 p.
LiTH-ISY-R, ISSN 1400-3902 ; 2129
Identifiability, Differential algebra, Constraints, Nonlinear, Parameter
IdentifiersURN: urn:nbn:se:liu:diva-55708ISRN: LiTH-ISY-R-2129OAI: oai:DiVA.org:liu-55708DiVA: diva2:316442