{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:03Z","timestamp":1750308123305,"version":"3.41.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[1981,11,1]],"date-time":"1981-11-01T00:00:00Z","timestamp":373420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSAM Bull."],"published-print":{"date-parts":[[1981,11]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/1089270.1089275","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"23-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["NETFORM and code optimizer manual"],"prefix":"10.1145","volume":"15","author":[{"given":"J.","family":"Smit","sequence":"first","affiliation":[{"name":"Twente University of Technology, The Netherlands"}]},{"given":"J. A.","family":"van Hulzen","sequence":"additional","affiliation":[{"name":"Twente University of Technology, The Netherlands"}]},{"given":"B. J. A","family":"Hulshof","sequence":"additional","affiliation":[{"name":"Twente University of Technology, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[1981,11]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"A presentation in a comparative context., Symbolic and Algebraic Computation, Lecture notes in computer science no 72., Goos G","author":"Smit J.","year":"1979","unstructured":"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 ). 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)."},{"key":"e_1_2_1_2_1","volume-title":"A recursive tearing technique for systems in which small as well as large elementvalues are significant. THT Report 1231-AM-0378. (Dec","author":"Smit J.","year":"1978","unstructured":"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 ). 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)."},{"key":"e_1_2_1_3_1","volume-title":"An efficient factoring symbolic determinant expansion algorithm. THT report 1231-AM-0478. (Dec","author":"Smit J.","year":"1978","unstructured":"Smit J. , An efficient factoring symbolic determinant expansion algorithm. THT report 1231-AM-0478. (Dec . 1978 ). Smit J., An efficient factoring symbolic determinant expansion algorithm. THT report 1231-AM-0478. (Dec. 1978)."},{"key":"e_1_2_1_4_1","first-page":"352","volume-title":"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","author":"Smit J.","unstructured":"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 . 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."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/800206.806386"},{"key":"e_1_2_1_6_1","volume-title":"Memorandum 374","author":"Smit J.","year":"1981","unstructured":"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 ). 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)."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800206.806377"},{"key":"e_1_2_1_8_1","volume-title":"Memorandum 368","author":"Hulshof B. J. A.","year":"1981","unstructured":"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 ). 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)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089212.1089218"}],"container-title":["ACM SIGSAM Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089270.1089275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1089270.1089275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:22Z","timestamp":1750262902000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089270.1089275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["10.1145\/1089270.1089275"],"URL":"https:\/\/doi.org\/10.1145\/1089270.1089275","relation":{},"ISSN":["0163-5824"],"issn-type":[{"type":"print","value":"0163-5824"}],"subject":[],"published":{"date-parts":[[1981,11]]},"assertion":[{"value":"1981-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}