Identifiability with Constraints

• 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.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)

Keyword

Identifiability

Differential algebra

Constraints

Nonlinear

Parameter

Automatic control

Reglerteknik

Publication and Content Type

vet (subject category)

rap (subject category)