Efficient computation of transfer function dominant poles using subspace acceleration
By Joost Rommes, Nelson Martins. IEEE Transactions on Power Systems, 2006
115 citations recorded by the source corpus.
Subfields: Civil and Structural Engineering, Computational Mechanics, Statistical and Nonlinear Physics
View Paper: https://www.semanticscholar.org/paper/654f7ad6c766a69f4ac65564a822a5a91829a15e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Civil and Structural Engineering
In Computational Mechanics
In Statistical and Nonlinear Physics
- Joost Rommes
- Nelson Martins
- Paulo Cesar Pellanda
- Francisco Damasceno Freitas
- Taishan Zeng
- Yuesheng Xu
Citations in the corpus
- Efficient Computation of Multivariable Transfer Function Dominant Poles Using Subspace Acceleration (2006, methodology): “The subspace accelerated MIMO dominant pole algorithm (SAMDP) is based on the dominant pole algorithm (DPA) [12], the subspace accelerated DPA (SADPA) [6] and the MIMO dominant pole algorithm (MDP) [7].”
- Gramian-Based Reduction Method Applied to Large Sparse Power System Descriptor Models (2008, background): “The intense research work on several types of model reduction reflects the fact that reduced systems can approximate well the dynamics of the full-size systems, and can be effectively used for advanced controller design and faster computation of time domain simulations [1], [2], [5], [6]–[8].”
- Computing Large-Scale System Eigenvalues Most Sensitive to Parameter Changes, With Applications to Power System Small-Signal Stability (2008, methodology): “The large system is a 1997 planning model for the Brazilian Interconnected Power System (BIPS/97) [11], [14], [23], [24].”
- Computation of Transfer Function Dominant Zeros With Applications to Oscillation Damping Control of Large Power Systems (2007, methodology): “4, needed when the schemes are extended with subspace acceleration (similar to SADPA [14] and SAMDP [15]), is not (readily and cheaply) available.”