.png){kind=icon}
.png){kind=icon}
Return
Gramian-based reduction method applied to large sparse power system descriptor models
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2008.926693.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
control systems
descriptor systems
gramians
large-scale systems
linear systems
low-rank Choleski factor ADI
Lyapunov matrix equations
model reduction
power system
small-signal stability
sparsity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
View more organizations