Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

CLUCGS and CLUCR - two matrix solution methods for general circuit simulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Bin Li ; Microelectron. Center, Harbin Inst. of Technol., China ; Yun Zheng ; Liyi Xiao ; Yizheng Ye
more authors

Direct methods and iterative methods have been used in most analog circuit analysis tools for matrix solution. But neither can efficiently solve the large-scale sparse matrix or ill matrix because of the closely coupled relationship of execution time and matrix size for direct methods and the convergence problem for iterative methods. This paper presents two methods that are a combination of direct solution using complete LU factorization and iterative solution using conjugate gradient square (CGS) or conjugate residual (CR) method. The methods converge faster and more reliably than the LU factorization method and conjugate gradient (CG) method, and can achieve high resolution on a wide variety of circuits. A very efficient preconditioning method is used in our approach to accelerate convergence. Furthermore, we present an effective judgment method for re-factorization of matrix. Several numerical experiments results are included to compare their efficiencies

Published in:

Simulation Symposium, 2001. Proceedings. 34th Annual

Date of Conference:

2001