Skip to Main Content
Summary form only given. This paper presents an efficient linear system reduction method that computes approximations to the controllability and observability gramians of large sparse power system descriptor models. The method exploits the fact that a Lyapunov equation solution can be decomposed into low-rank Choleski factors, which are determined by the Alternating Direction Implicit (ADI) method. Advantages of the method are that it operates on the sparse descriptor matrices and does not require the computation of spectral projections onto deflating subspaces of finite eigenvalues, which are needed by other techniques applied to descriptor models. The gramians, which are never explicitly formed, are used to compute reduced-order state-space models for large-scale systems. Numerical results for small-signal stability power system descriptor models show that the new method is more efficient than other existing approaches.