Abstract
For some element values, and/or for some interconnections, linear time-invariant networks become degenerate. A description of an easily programmable algorithm which reduces the equations of any such network is presented. The reduced equations specify a set of linear independent constraints on the inputs, a set of linear independent algebraic constraints on the network variables, and a set of differential equations in the normal form on some of the network variables. In particular, the network variables and the initial conditions that can be chosen arbitrarily are easily read from the reduced equations. One feature of the proposed algorithm is that no change of variable is required; hence the results are readily interpreted.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
