Efficient dominant eigensystem computation using nodal equations

In this paper, alternative methods are developed for computing the smallest, the largest and a given subset of the largest eigenvalues associated with linear time-invariant circuits. The proposed methods resort to the solution of DC or AC adjoint circuits, for which conventional nodal analysis can be adopted. Experimental results obtained with test cases comprising over 500 state variables show substantial computational savings with respect to standard algorithms, based on the system matrix A arising in the state-space formulation. Copyright © 2008 John Wiley & Sons, Ltd.