Decomposition methods for the identifiability analysis of large systemsy†

Publisher Website
Google Scholar
Abstract
Most of the work available in the literature deals with the problem of checking the identifiability of a given model structure. However two problems must often be faced in practical applications : first, as the structure to be examined increases in complexity, the proposed procedures become computationally unfeasible ; secondly, in cases where identifiability cannot be achieved, a more detailed analysis of what can be identified is of great interest. In this paper some class of model structure will be considered, in which the decomposition of the whole system in subsystems suitably connected really simplifies the checking of structural identifiability or the analysis of unidentifiable parameters.

This publication has 6 references indexed in Scilit: