The generalized eigenproblem: pole-zero computation
Stephen B. Haley · Proceedings of the IEEE · 1988
A modification-decomposition (MD) method is used to compute linear system transfer function poles and zeros by transforming an N-dimensional generalized eigenvalue problem to an M-dimensional standard eigenvalue problem with M>or=r, where r is the lesser of the ranks of the dynamic or nondynamic component matrix of the system. Hence, network eigenvalue problems normally solved by applying the QZ algorithm directly, or after deflation preprocessing, are solvable with the more efficient QR algorithm. It is shown that the flop (floating-point operations) count for MD-QR algorithms is always less than the flop count for the most efficient deflation-QZ algorithms. For r>
Cited by 56 works. doi:10.1109/5.4388
Authors
References
- Introduction to matrix computations
- The algebraic eigenvalue problem
- Computer-Aided Analysis of Electronic Circuits: Algorithms and Computational Techniques
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Computer Methods for Circuit Analysis and Design
- Matrix Eigensystem Routines — EISPACK Guide Extension
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Linear Algebra and its Applications
- A Method for Solving Algebraic Equations Using an Automatic Computer
- Lambda-Matrices and Vibrating Systems