A Multilevel Newton Algorithm with Macromodeling and Latency for the Analysis of Large-Scale Nonlinear Circuits in the Time Domain

IEEE Transactions on Circuits and Systems

Volumn 26, Issue 9, 1979, Pages 733-741

  Rabbat, Guy N B ^a   Hsieh, Hsueh Y ^a   Sangiovanni Vincentelli, Alberto L ^b  

^a IBM   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - TIME DOMAIN ANALYSIS;

ELECTRIC NETWORKS, NONLINEAR;

EID: 0018522050     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCS.1979.1084693     Document Type: Article

References (37)

1. C. W. Gear, “The automatic integration of ordinary differential equations,” Information Processing 68, A. F. H. Morrel, Ed. Amsterdam, North-Holland, The Netherlands: 1968, pp. 187–193.
2. D. A. Calahan, Computer Aided Network Design, revised ed. New York:McGraw-Hill, 1972.
3. G. D. Hachtel, R. K. Brayton, and F. G. Gustavson, “The sparse tableau approach to network analysis and design,” IEEE Trans. Circuit Theory, vol. CT-18, 101–11 2 , Jan. 1971.
4. L. Nagel, “SPICE2: A computer program to simulate semiconductor circuits,” Electronics Research Laboratory Rep. No. ERL-M520, M520, University of California, Berkeley, May 1975.
5. W. T. Weeks, A. J. Jimenez, G. W. Mahoney, D. Mehta., H. Qassemzadeh, and T. R. Scott, “Algorithms for ASTAP—A network analysis program,” IEEE Trans. Circuit Theory, vol. CT-20, 20, pp. 628–634, Nov. 1973.
6. B. R. Chawla, H. K. Gummel, and P. Kozak, “MOTIS—An MOS timing simulator,” IEEE Trans. Circuits Syst., vol. CAS-23, pp. 301–310, Dec. 1975.
7. J. D. Crawford et. al., “MOTIS-C users guide,” Electronics Re-, search Laboratory, University of California, Berkeley, June 1978.
8. G. Arnout and H. J. DeMan, “The use of threshold functions and Boolean-controlled network elements for macromodelling of LSI circuits,” IEEE J. Solid-State Circuits, vol. SC-13, pp. 326–332, June 1978.
9. A. R. Newton, “The simulation of large scale integrated circuits,” Ph.D. dissertation, University of California, Berkeley, Electronics Research Laboratory Rep. No. UCB/ERL M-78/52, July 1978.
10. “LOGCAP II user's guide,” National Semiconductor, Norwalk, Conn.
11. N. B. Rabbat and H. Y. Hsieh, “A latent macromodular approach to large-scale sparse networks,” IEEE Trans. Circuits Syst., vol. CAS-22, pp. 745–752, Dec. 1976.
12. N. B. Rabbat and H. Y. Hsieh, “Concepts of latency in the time-domain solution of nonlinear differential equations,” Proc. IEEE Symp. Circuits and Systems, pp. 813–826 (New York, May 1978).
13. R. K. Brayton, F. G. Gustavson, and G. D. Hachtel, “A new efficient algorithm for solving differential-algebraic systems using implicit backward differential formulas,” Proc. IEEE, vol. 60, pp. 98–108, Jan. 1972.
14. J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables. New York: Academic Press, 1970.
15. P. Wilcox and A. Rombeck, “F/LOGIC, an interactive fault and logic simulator for digital circuits,” Proc. 13th ACM Design Automation Workshop, pp. 68–73, 1976.
16. A. R. Newton and D. O. Pederson, “Analysis time, accuracy and memory requirement tradeoffs in SPICE 2,” Proc. 11th Annu. Asilomar Conf. on Circuits, Systems, and Computers (Asilomar, California, Nov. 1977).
17. M. Y. Hsueh, A. R. Newton, and D. O. Pederson, “The development of macromodels for MOS timing simulators,” Proc. IEEE Symp. on Circuits and Systems, pp. 1–4, (New York, May 1978).
18. M. H. Heydemann, “Functional macromodeling of electrical circuits,” ibid., pp. 532–535.
19. R. Klessig and E. Polak, “An adaptive precision gradient method for optimal control,” SIAM J. Contr., vol. 11, no. 1, pp. 80–93, Feb. 1977.
20. H. Mukai and E. Polak, “On the use of approximation in algorithms for optimization problems with equality and inequality constraints,” SIAM J. Numer. Anal., vol. 15, no. 4, pp. 674–693, 1978.
21. E. Polak, “On the global stabilization of locally convergent algorithms for optimization and root finding,” Proc. 6th IFAC World Congress on Computational Methods in Control (Boston, MA, Aug. 1975).
22. E. Polak and I. Teodoru, “Newton derived methods for nonlinear equations and inequalities,” Proc. Mathematical Programming Symp., (University of Wisconsin, Madison, Apr 1974).
23. G. Kron, Diakoptics—Piecewise Solution of Large-Scale Systems. London, England: MacDonald, 1963.
24. F. H. Branin, Jr., “A sparse matrix modification of Kron's method of piecewise analysis,’ Proc. of IEEE Int. Symp. on Circuits and Systems, pp. 383–386, (Boston, MA).
25. A. J. Jimenez, “Experiences in the modular analysis of circuits,” Int. Symp. Simulation and Software, (Virginia Polytechnic Institute, Blacksburg, VA, Mar. 1977).
26. L. O. Chua and L. K. Chen, “Diakoptic and generalized hybrid analysis,” IEEE Trans. Circuits Syst., vol. CAS-22, pp. 694–706.
27. F. F. Wu, “Solution of large-scale networks by tearing,” IEEE Trans. Circuits Syst., vol. CAS-23, pp. 706–713, Dec. 1976.
28. A. Sangiovanni-Vincentelli, L. K. Chen and L. O. Chua, “A new tearing approach—Node tearing nodal analysis,” Proc. IEEE Symp. Circuits and Systems, pp. 143–147 (Phoenix, AZ, Apr. 1977).
29. A. George, “On block elimination for sparse linear systems,” SIAM J. Numer. Anal., vol. 11, no. 3, pp. 585–603, June 1974.
30. G. Guardabassi and A. Sangiovanni-Vincentelli, “A two levels algorithm for tearing,” IEEE Trans. Circuits Syst., vol. CAS-23, pp. 783–791, Dec. 1976.
31. A. Sangiovanni-Vincentelli, L. K. Chen and L. OK. Chua, “Three decomposition-based solution methods for solving a large system of linear equations,” Proc. IEEE Symp. Circuits and Systems (New York), pp. 582–586.
32. I. Hajj, ‘Sparsity considerations in network solution by tearing,” ibid., pp. 170–174.
33. C. W. Ho, A. E. Ruehli, and P. A. Brennan, “The modified nodal approach to network analysis,” IEEE Trans. Circuits Syst., vol. CAS-22, pp. 504–509, June 1975.
34. N. B. Rabbat and H. Y. Hsieh, “Macromodularity, latency and latent graph theory,” IBM Tech. Rep. No. TR 22.2067, Oct. 1976.
35. N. B. Rabbat and H. Y. Hsieh, “Latency and latent graph theory as applied to the solution of nonlinear differential equations,” IBM Tech. Rep. No. TR 22.2173, East Fishki11, Hopewell Junction, New York, Jan. 5, 1978.
36. H. Y. Hsieh and N. B. Rabbat, “Macroanalysis of large digital networks by latent techniques,” to be published.
37. N. B. Rabbat, H. Y. Hsieh, and A. E. Ruehli, “Macromodeling for the analysis of large-scale networks,” IEEE Int. Conv. Rec., Electro tro 76, pp. 21-4-1 to 21-4-8, Computer-Aided Design I, Boston, MA, May 11–14, 1976.