skip to main content
article
Free access

NETFORM and code optimizer manual

Published: 01 November 1981 Publication History

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]
Smit J., New recursive minor expansion algorithms, A presentation in a comparative context., Symbolic and Algebraic Computation, Lecture notes in computer science no 72., Goos G. and Hartmanis J. eds., Springer (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]
Smit J., A cancellation free algorithm, with factoring capabilities for the efficient solution of large, sparse sets of equations. Proceedings of the 1981 ACM symposium on Symbolic and Algebraic Computation. pp 146--154, (P. S. Wang ed.), New York, ACM 1981.
[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]
van Hulzen, J. A., Breuer's grow factor algorithm in computer algebra. Proceedings of the 1981 ACM symposium on Symbolic and Algebraic Computation. pp 100--105, (P. S. Wang ed.). New York. ACM 1981.
[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]
Marti J. B., Hearn A. C., Griss M. L. and Griss C., Standard Lisp Report, Sigsam bulletin, Vol. 14, no 1, pp 23--43, ACM, New York, (1980).
[11]
Frick I. B., Manual for Standard Lisp on Decsystem 10 and 20. Univ. of Utah: Report TR-2, (1978).

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSAM Bulletin
ACM SIGSAM Bulletin  Volume 15, Issue 4
November 1981
30 pages
ISSN:0163-5824
DOI:10.1145/1089270
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1981
Published in SIGSAM Volume 15, Issue 4

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)54
  • Downloads (Last 6 weeks)13
Reflects downloads up to 07 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2005)Code generation and optimization for finite element analysisEUROSAM 8410.1007/BFb0032846(237-247)Online publication date: 10-Jun-2005
  • (2005)Circuit simulation code generation by computer algebraRIMS Symposia on Software Science and Engineering II10.1007/3-540-16470-7_15(307-320)Online publication date: 28-May-2005
  • (2005)Symbolic numeric methods in microwave technologyComputer Algebra10.1007/3-540-11607-9_33(281-288)Online publication date: 28-May-2005
  • (1990)A symbolic generator of state equations for modeling of electrical systemsMathematics and Computers in Simulation10.1016/0378-4754(90)90139-A32:4(339-349)Online publication date: 1-Oct-1990
  • (1989)A code optimization package for REDUCEProceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation10.1145/74540.74561(163-170)Online publication date: 17-Jul-1989
  • (1985)Formula manipulation in the bond graph modelling and simulation of large mechanical systemsJournal of the Franklin Institute10.1016/0016-0032(85)90064-X319:1-2(51-65)Online publication date: Jan-1985
  • (1983)Computer Algebra ApplicationsComputer Algebra10.1007/978-3-7091-7551-4_15(245-258)Online publication date: 1983
  • (1982)An expression analysis package for REDUCEACM SIGSAM Bulletin10.1145/1089310.108931816:4(32-44)Online publication date: 1-Nov-1982

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media