NETFORM and code optimizer manual

ABSTRACT

NETFORM is a very powerful and flexible tool for solving (sparse) systems of linear equations in algebraic form. The system includes convenient facilities to generate (and solve) linear equations for electrical networks.The accompanying Code Optimizer is a general purpose tool to automatically optimize sets of algebraic expressions, with emphasis on those generated by the NETFORM system.Thus the combination of both systems can be used to solve numerous problems of a symbolic and/or numeric nature, taking full advantage of the REDUCE 2 embedding in which it is supported.For instance NETFORM can automatically provide a user with descriptive (tableau) equations of an arbitrary linear electrical network and, as it solves such linear equations too, calculate any transferfunction of that linear electrical network. The NETFORM environment encourages users to think of electrical networks in terms of network elements, one port elements as well as subnetworks, which can be conveniently described and manipulated.Given a complete network description, NETFORM allows different approaches in analyzing it, i.e. a full symbolic analysis, a hybrid analysis, a state analysis or a mixed hybrid and state analysis.

REFERENCES

• 1: J. Smit, New recursive minor expansion algorithms, Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, p.74-87, June 01, 1979
• 2: Smit J., A recursive tearing technique for systems in which small as well as large elementvalues are significant. THT Report 1231-AM-0378. (Dec. 1978).
• 3: Smit J., An efficient factoring symbolic determinant expansion algorithm. THT report 1231-AM-0478. (Dec. 1978).
• 4: Smit J., Sparse Kirchhoff equations, an effective support tool for the numeric and symbolic solution of large sparse systems of network equations. Proceeding of the 1981 European Conference on Circuit theory and Design, (R. Boite and P. de Wilde eds.), North Holland Publicing comp. Amsterdam-New York-Oxford, pp 352--357.
• 5: J. Smit, A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sparse sets of equations, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.146-154, August 05-07, 1981, Snowbird, Utah, United States [doi>10.1145/800206.806386]
• 6: Smit J. and van Hulzen J. A., Symbolic Numeric Methods in Microwave technology, Memorandum 374. Twente University of Technology, department of Applied Mathematics, (Dec. 1981).
• 7: J. A. van Hulzen, Breuer's grow factor algorithm in computer algebra, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.100-104, August 05-07, 1981, Snowbird, Utah, United States [doi>10.1145/800206.806377]
• 8: Hulshof B. J. A., van Hulzen J. A. and Smit J., Code optimization facilities applied in the NETFORM context, Memorandum 368. Twente University of Technology, department of Applied Mathematics, (Dec. 1981).
• 9: Hearn A. C., REDUCE 2 users manual, Univ. of Utah: Report UCP-19 (1973).
• 10: J. Marti , A. C. Hearn , M. L. Griss , C. Griss, Standard LISP report, ACM SIGSAM Bulletin, v.14 n.1, p.23-43, February 1980 [doi>10.1145/1089212.1089218]
• 11: Frick I. B., Manual for Standard Lisp on Decsystem 10 and 20. Univ. of Utah: Report TR-2, (1978).