Simulation Procedures for Large-Scale Electronic Systems

The ever-increasing size of circuits and systems that engineers are designing has led to the development of many special-purpose simulation techniques, e.g., macromodelling. The task of trying to decide the relative merits of various simulation techniques is made difficult by the lack of a unifying framework in which to study the relationship between modelling for simulation and the actual simulation procedures. Moreover, there appears to be a lack of awareness on the part of circuit simulation program developers of the approaches which have been used to solve large-scale problems which arise in other engineering disciplines. The purpose of this paper is three-fold. To review some of the large-scale simulation procedures which have thus far been reported, emphasizing the methods which have not been primarily used for circuit simulation and presenting a unifying structure for analysing simulation procedures; to point to pertinent literature in other engineering disciplines; and to indicate some potentially...

[1]  W. Fred Ramirez,et al.  Algorithms for structuring design calculations , 1972 .

[2]  L. Nagel,et al.  Computer analysis of nonlinear circuits, excluding radiation (CANCER) , 1971 .

[3]  Arthur W. Westerberg,et al.  Assigning output variables to equations using linear programming , 1974 .

[4]  D. V. Steward.  On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations , 1962 .

[5]  Gary D. Hachtel.  Vector and Matrix Variability Type in Sparse Matrix Algorithms , 1972 .

[6]  Dale F. Rudd,et al.  Structuring design computations , 1969 .

[7]  Eli Hellerman,et al.  The Partitioned Preassigned Pivot Procedure (P4) , 1972 .

[8]  R. L. Motard,et al.  Steady state chemical process simulation , 1975 .

[9]  F. B. Hildebrand,et al.  Introduction To Numerical Analysis , 1957 .

[10]  Robert K. Brayton,et al.  The Sparse Tableau Approach to Network Analysis and Design , 1971 .

[11]  Guido O. Guardabassi,et al.  An indirect method for minimal essential sets , 1974 .

[12]  F. Harary.  A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues , 1959 .

[13]  Iain S. Duff.  Analysis of sparse systems , 1972 .

[14]  Arthur W. Westerberg,et al.  Computer-Aided Design, Part 2 An approach to convergence and tearing in the solution of sparse equation sets , 1971 .

[15]  Leon Lapidus,et al.  Topics in computer‐aided design: Part I. An optimum tearing algorithm for recycle systems , 1973 .

[16]  R. L. Norman.  A matrix method for location of cycles of a directed graph , 1965 .

[17]  L. E. Scriven,et al.  Efficient solution of sparse sets of design equations , 1974 .

[18]  Dale F. Rudd,et al.  On the ordering of recycle calculations , 1966 .

[19]  H. P. Hutchison,et al.  The analysis of chemical plant flowsheets , 1969 .

[20]  Melvin A. Breuer,et al.  Design automation of digital systems , 1972 .

[21]  Åke Björck,et al.  Numerical Methods , 1995, Handbook of Marine Craft Hydrodynamics and Motion Control.

[22]  Ravindra S. Upadhye,et al.  An efficient algorithm for optimum decomposition of recycle systems , 1972 .

[23]  D. M. Himmelblau,et al.  Decomposition Procedures for the Solving of Large Scale Systems , 1970 .

[24]  R. Willoughby.  Sparse matrices and their applications , 1972 .

[25]  Lap-Kit Cheung,et al.  The bordered triangular matrix and minimum essential sets of a digraph , 1974 .

[26]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[27]  Arthur W. Westerberg,et al.  Computer-aided design, Part 1 enhancing convergence properties by the choice of output variable assignments in the solution of Sparse equation sets , 1971 .

[28]  N. Wiener,et al.  Nonlinear Problems in Random Theory , 1964 .

[29]  James H. Christensen.  The structuring of process optimization , 1970 .

[30]  R. L. Motard,et al.  Decomposition of nets , 1972 .