Zero Assignment Problem in RLC Networks

Leventides, J., Livada, M. & Karcanias, N. (2016). Zero Assignment Problem in RLC Networks. IFAC PapersOnLine, 49(9), pp. 92-98. doi: 10.1016/j.ifacol.2016.07.502

Text - Accepted Version
Available under License : See the attached licence file.

Download (226kB) | Preview
Text (Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International Licence) - Other
Download (201kB) | Preview


The paper deals with the problem of zero assignment in RLC networks by selection of appropriate values for the non- dynamical elements, the resistors. For a certain family of network redesign problems by the additive perturbations may be described as diagonal perturbations and such modifications are considered here. This problem belongs to the family of DAP problems (Determinantal Assignment Problem) and has common features with the pole assignment problem by decentralized output feedback and the zero assignment problem via structured additive perturbations. We demonstrate that the sufficient condition for generic zero assignment by selecting the resistors holds true. This condition is related to the rank of the differential of the related map and holds true generically when the degrees of freedom of the matrix of resistors exceeds the number of frequencies to be assigned (n > p + q). Using this result, we show through a generic example that the sufficient condition for the general zero assignment problems in RLC networks is satisfied and thus, zero assignment can be achieved via resistor determination.

Item Type: Article
Additional Information: © 2016, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Uncontrolled Keywords: Systems Theory; Network Theory; Systems Redesign; Zero Assignment; Algebraic Geometry Methods;
Subjects: Q Science > QA Mathematics
Divisions: School of Engineering & Mathematical Sciences > Engineering

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics