ACM Home Page
Please provide us with feedback. Feedback
Efficient large-scale power grid analysis based on preconditioned krylov-subspace iterative methods
Full text PdfPdf (274 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 38th annual Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 559 - 562  
Year of Publication: 2001
ISBN:1-58113-297-2
Authors
Tsung-Hao Chen  Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI
Charlie Chung-Ping Chen
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 53,   Citation Count: 33
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/378239.379023
What is a DOI?

ABSTRACT

In this paper, we propose preconditioned Krylov-subspace iterative methods to perform efficient DC and transient simulations for large-scale linear circuits with an emphasis on power delivery circuits. We also prove that a circuit with inductors can be simplified from MNA to NA format, and the matrix becomes an s.p.d matrix. This property makes it suitable for the conjugate gradient with incomplete Cholesky decomposition as the preconditioner, which is faster than other direct and iterative methods. Extensive experimental results on large-scale industrial power grid circuits show that our method is over 200 times faster for DC analysis and around 10 times faster for transient simulation compared to SPICE3. Furthermore, our algorithm reduces over 75% of memory usage than SPICE3 while the accuracy is not compromised.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
5
6
7
 
8
R.Freund,"Passive reduced-order models for interconnect simulation and their computation via Krylov-subspace algorithms,"Numerical Analysis Manuscript No.98-3-06,Bell Lab.,1998
 
9
 
10
 
11
M.Jones and P.Plassmann,"An improved incomplete Cholesky factorization,"Argonne National Laboratory,1992.
 
12
Michael T.Heath,"Parallel direct methods for sparse linear systems,"Parallel Numerical Algorithms,p55-90,1997

CITED BY  33

Collaborative Colleagues:
Tsung-Hao Chen: colleagues
Charlie Chung-Ping Chen: colleagues