Abstract
Algebraic Condition for Decomposition of Large-Scale Linear Dynamic SystemsThe paper concerns the problem of decomposition of a large-scale linear dynamic system into two subsystems. An equivalent problem is to split the characteristic polynomial of the original system into two polynomials of lower degrees. Conditions are found concerning the coefficients of the original polynomial which must be fulfilled for its factorization. It is proved that knowledge of only one of the symmetric functions of those polynomials of lower degrees is sufficient for factorization of the characteristic polynomial of the original large-scale system. An algorithm for finding all the coefficients of the decomposed polynomials and a general condition of factorization are given. Examples of splitting the polynomials of the fifth and sixth degrees are discussed in detail.
Subject
Applied Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference14 articles.
1. Fast polynomical decomposition algorithms;V. Alagar;Lecture Notes in Computer Science,1985
2. Polynomial decomposition algorthims;D. Bartoni;Journal of Symbolic Computations,1985
3. Decrasing the nesting depth of expressions involving square roots;A. Borodin;Journal of Symbolic Computations,1985
4. Functional decomposition of a class of wild polynomials;R. Coulter;Journal of Combinational Mathematics & Combinational Computations,1998
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献