Convergence of the Dominant Pole Algorithm and Rayleigh Quotient Iteration

@article{Rommes2008ConvergenceOT,
  title={Convergence of the Dominant Pole Algorithm and Rayleigh Quotient Iteration},
  author={Joost Rommes and Gerard L. G. Sleijpen},
  journal={SIAM J. Matrix Anal. Appl.},
  year={2008},
  volume={30},
  pages={346-363}
}
The dominant poles of a transfer function are specific eigenvalues of the state space matrix of the corresponding dynamical system. In this paper, two methods for the computation of the dominant poles of a large scale transfer function are studied: two-sided Rayleigh quotient iteration (RQI) and the dominant pole algorithm (DPA). First, a local convergence analysis of DPA will be given, and the local convergence neighborhoods of the dominant poles will be characterized for both methods. Second… 

Figures from this paper

Computing Transfer Function Dominant Poles of Large-Scale Second-Order Dynamical Systems
TLDR
The quadratic dominant pole algorithm works directly with the system matrices of the original system, so no linearization is needed, and to improve global convergence, the QDPA uses subspace acceleration, and deflation of found dominant poles is implemented in a very efficient way.
Efficient computation of transfer function dominant poles of large second-order dynamical systems
TLDR
The dominant poles and corresponding eigenvectors can be used to construct structure-preserving modal approximations, but also to improve reduced-order models computed by Krylov subspace methods, as is illustrated by numerical results.
Large-Scale Estimation of Dominant Poles of a Transfer Function by an Interpolatory Framework
TLDR
This work introduces a subspace framework to estimate a prescribed number of dominant poles of the transfer function of a descriptor system and proves an at-least-quadratic-convergence result for the framework, and provides numerical results confirming this.
Computation of Dominant Poles and Residue Matrices for Multivariable Transfer Functions of Infinite Power System Models
TLDR
This paper describes the first reliable Newton algorithm for the sequential computation of the set of dominant poles of scalar and multivariable transfer functions of infinite systems using a deflation procedure derived from the partial fraction expansion concept of analytical functions of the complex frequency s.
Efficient computation of large scale transfer function dominant zeros
This paper describes efficient algorithms for the computation of dominant zeros of large scale transfer functions. The transfer function zeros are demonstrated to be equal to the poles of a new
Fixed-Point Methods on Small-Signal Stability Analysis
TLDR
This paper introduces the Diagonal Dominant Pole Spectrum Eigensolver (DDPSE), which is a fixed-point method that computes several eigenvalues of a matrix at a time, and shows that both methods have local quadratic convergence.
Model order reduction of large-scale dynamical systems with Jacobi-Davidson style eigensolvers
TLDR
This paper focuses on a model order reduction method for linear time in-variant (LTI) systems based on modal approximation via dominant poles based on Jacobi-Davidson method, which has proven to be a suitable and competitive candidate for the solution of various eigenvalue problems.
Methods for eigenvalue problems with applications in model order reduction
TLDR
The algorithms described in this thesis are efficient and effective methods for the computation of specific dominant eigenvalues that can be used to construct reduced-order models in the form of modal approximations, but also to improve reduced- order models computed by Krylov subspace based techniques.
...
...

References

SHOWING 1-10 OF 25 REFERENCES
Regions of convergence of the Rayleigh quotient iteration method
TLDR
The regions of the unit sphere which include all possible initial vectors converging to a specific eigenvector are studied and the generalized eigenvalue problem Ax = λBx is considered and it is shown that the regions do not change when the matrix is shifted or multiplied by a scalar.
The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices
The Rayleigh Quotient Iteration (RQI) was developed for real symmetric matrices. Its rapid local convergence is due to the stationarity of the Rayleigh Quotient at an eigenvector. Its excellent
Criteria for Combining Inverse and Rayleigh Quotient Iteration
A method is presented to find selected eigenvalue-eigenvector pairs of the generalized problem $Ax = \lambda Bx$. Here A and B are real symmetric matrices and B is positive definite. It is further
Efficient computation of transfer function dominant poles using subspace acceleration
TLDR
A new algorithm to compute the dominant poles of a high-order scalar transfer function that is more robust than existing methods in finding both real and complex dominant poles and faster because of subspace acceleration.
Efficient Computation of Multivariable Transfer Function Dominant Poles Using Subspace Acceleration
TLDR
A new algorithm to compute the dominant poles of a high-order multiple-input multiple-output (MIMO) transfer function, called the Subspace Accelerated MIMO Dominant Pole Algorithm (SAMDP), which can be used to produce good modal equivalents automatically.
Localization criteria and containment for Rayleigh quotient iteration
Rayleigh quotient iteration can often yield an eigenvalue-eigenvector pair of a positive-definite Hermitian problem in a very short time. The primary hindrance associated with its use as a regular
Computing dominant poles of power system transfer functions
This paper describes the first algorithm to efficiently compute the dominant poles of any specified high order transfer function. As the method is closely related to Rayleigh iteration (generalized
Methods for eigenvalue problems with applications in model order reduction
TLDR
The algorithms described in this thesis are efficient and effective methods for the computation of specific dominant eigenvalues that can be used to construct reduced-order models in the form of modal approximations, but also to improve reduced- order models computed by Krylov subspace based techniques.
A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems
TLDR
A new method for the iterative computation of a few of the extremal eigenvalues of a symmetric matrix and their associated eigenvectors is proposed that has improved convergence properties and that may be used for general matrices.
...
...