A symbolic program for parameter identifiability analysis in systems modeled via equivalent linear time‐invariant electrical circuits, with application to electromagnetic harvesters

Abstract

AbstractAccurate parameter identification is a patently crucial aspect of system modeling as far as analysis, design, control, maintenance, and fault diagnosis are concerned. In this respect, an essential prerequisite is to establish a priori the solvability degree of the parameter identification problem, which is accomplished by means of testability analysis. The aim of this work is to present a program suitable for fully automated testability analysis of any physical system that can be modeled by an equivalent analog linear time‐invariant electrical circuit. Such a program has been obtained by combining the potentialities of symbolic techniques with the disclosures of a recently proposed theoretical approach to the testability measure concept, able to circumvent the main shortcomings of early methods. An efficient program, characterized by better performances with respect to previous software packages, has been thereby developed, which is herein described from both an algorithmic and a functional viewpoint. It can be advantageously used by the workers interested in system modeling as a guide to devising or refining their own parameter identification strategies. Thoroughly discussed examples of application are also given, which include a complete testability analysis and a novel parameter identification algorithm for electromagnetic harvesters.