Structural identifiability of series-parallel LCR systems. (September 2022)

• Record Type: Journal Article
• Authors: Bortner, Cashous; Sullivant, Seth
• Is Part Of: Journal of symbolic computation. Volume 112(2022)
• Page Start: 79
• Page End: 104
• Publication Date: 2022-09
• Subjects: Identifiability -- Structural identifiability -- LCR circuit -- Resultant -- Algebraic geometry -- Algebraic statistics; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2022.01.002
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: We consider the identifiability problem for the parameters of series-parallel LCR circuit networks. We prove that for networks with only two classes of components (inductor-capacitor (LC), inductor-resistor (LR), and capacitor-resistor (RC)), the parameters are identifiable if and only if the number of non-monic coefficients of the constitutive equations equals the number of parameters. The notion of the "type" of the constitutive equations plays a key role in the identifiability of LC, LR, and RC networks. We also investigate the general series-parallel LCR circuits (with all three classes of components), and classify the types of constitutive equations that can arise, showing that there are 22 different types. However, we produce an example that shows that the basic notion of type that works to classify identifiability of two class networks is not sufficient to classify the identifiability of general series-parallel LCR circuits.