论文信息 - Symbolic network analysis-An algebraic formulation

Symbolic network analysis-An algebraic formulation

A new and efficient method of symbolic analysis of linear analog active or passive networks is introduced. The method takes advantage of several properties of determinants. By formulating the network equations such that the symbolic parameters appear only once and that too along the principal diagonal of a matrix, a method of weeding out invalid symbol combinations in a network transfer function is given. For the implementation of the method, any efficient numerical method of calculating determinants is all that is necessary. The method is conceptually simple and is computationally advantageous to the existing procedures.

Peddapullaiah Sannuti | N. Puri

[1] Shu-Park Chan,et al. Topological formulation of symbolic network functions and sensitivity analysis of active networks , 1974 .

[2] G. E. Alderson,et al. Computer generation of symbolic network functions-A new theory and implementation , 1973 .

[3] J. Vlach,et al. Symbolic analysis of analog and digital circuits , 1977 .

[4] M.L. Liou,et al. Computer-aided analysis of electronic circuits: Algorithms and computational techniques , 1977, Proceedings of the IEEE.

[5] R. Mielke,et al. A new signal flowgraph formulation of symbolic network functions , 1978 .

[6] J. Vlach,et al. Generation of immittance functions in symbolic form for lumped distributed active networks , 1974 .

[7] P. M. Lin,et al. A survey of applications of symbolic network functions , 1973 .

[8] Wai-Kai Chen,et al. Graph theory , 1972 .

[9] M.K. Sain,et al. The growing algebraic presence in systems engineering: An introduction , 1976, Proceedings of the IEEE.

[10] P. M. Lin,et al. SNAP: A computer program for generating symbolic network functions , 1970 .

[11] C. A. Desoer,et al. The Optimum Formula for the Gain of a Flow Graph or a Simple Derivation of Coates' Formula , 1960, Proceedings of the IRE.