Identifiability analysis of interconnected zero-memory composite systems

Abstract

The deterministic identifiability is considered of interconnected non-linear memoryless composite systems having a structure described via an interconnection matrix. Both theoretical and practical identifiability criteria of system elements inside the complex system are given, and numerical aspects of parameters computed from finite-length data records are briefly discussed. Several illustrative examples are included.