By Topic

Complete LU decomposition conjugate residual method and its performance for large-scale 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
$33 $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

4 Author(s)
A. Yajima ; Hitachi Ltd., Tokyo, Japan ; F. Yamamoto ; T. Morioka ; H. Sugihara

A method for solving large unsymmetric (LU) systems of linear equations arising from circuit transient analysis is proposed. This approach is based on the conjugate residual method, but is reinforced by the stability of LU decomposition. Unlike other preconditioned iterative methods, complete LU decomposition of a matrix at a previous time point is taken as a preconditioner of the current matrix to be solved. Only after the iterative process is judged to be nonconvergent is the current matrix decomposed. A novel test for the halt residual reduction is used to detect such a situation. Using this method, 10 LSI circuits with matrices ranging from 35 to 3668 equations have been analyzed. Correct transient solutions were obtained with only one to seven LU decompositions per hundred Newton-Raphson iterations and 8 to 40 iterations of conjugate residual on the average.<>

Published in:

Circuits and Systems, 1988., IEEE International Symposium on

Date of Conference:

7-9 June 1988