Spectral transformation algorithms for computing unstable modes
From MaRDI portal
Abstract: In this paper we describe spectral transformation algorithms for the computation of eigenvalues with positive real part of sparse nonsymmetric matrix pencils , where is of the form . For this we define a different extension of M"obius transforms to pencils that inhibits the effect on iterations of the spurious eigenvalue at infinity. These algorithms use a technique of preconditioning the initial vectors by M"obius transforms which together with shift-invert iterations accelerate the convergence to the desired eigenvalues. Also, we see that M"obius transforms can be successfully used in inhibiting the convergence to a known eigenvalue. Moreover, the procedure has a computational cost similar to power or shift-invert iterations with M"obius transforms: neither is more expensive than the usual shift-invert iterations with pencils. Results from tests with a concrete transient stability model of an interconnected power system whose Jacobian matrix has order 3156 are also reported here.
Recommendations
- Lanczos algorithms and field of value rotations for symmetric matrix pencils
- An Arnoldi-based iterative scheme for nonsymmetric matrix pencils arising in finite element stability problems
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
Cited in
(2)
This page was built for publication: Spectral transformation algorithms for computing unstable modes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290889)