论文部分内容阅读
Algorithms and program structure of SFGEX,a program for generating symbolic networkfunctions,are introduced.The program is constructed by using the modeling method of the networkextension theory.In comparison with others,say the numerical interpolation method and thedeterminant evaluation method,the new method requires less operations and much less memoryspaces and its flexibility is incomparably good.In this paper,some algorithms integrated in SFGEXare described.A theorem for reference transformation of node impedance matrix,a least squaremethod for making division of two s-polynomials and a binary-array method for generation ofpartially symbolic network functions are used in the program.Finally,several topological rules fordeleting the redundant terms and repeated terms are given.
Algorithms and program structure of SFGEX, a program for generating symbolic networkfunctions, are introduced. The program is constructed by using the modeling method of the networkextension theory.In comparison with others, say the numerical interpolation method and the sterminant evaluation method, the new method requires less operations and much less memoryspaces and its flexibility is incomparably good. In this paper, some algorithms integrated in SFG EXE described. A theorem for reference transformation of node impedance matrix, a least square method for making division of two s-polynomials and a binary-array method for generation of partially symbolic network functions are used in the program .Finally, several topological rules fordeleting the redundant terms and repeated terms are given.