This paper describes a reliable, general algorithm for modal decomposition in real arithmetic and its use in analyzing and synthesizing control logic for linear dynamic systems. The numerical difficulties are described associated with computing the Jordan canonical form when the system has repeated, or nearly repeated, eigenvalues. A new algorithm is described that satisfactorily solves these numerical difficulties. The relation and extension to related numerical analysis research are discussed to clarify the reliability of the techniques. Finally, its implementation as a practical modal decomposition method for efficiently computing the matrix exponential, transfer functions, and frequency response is also described.
Reliable algorithm for modal decomposition
1990-10-01
Miscellaneous
No indication
English
Reliable algorithm for modal decomposition
AIAA | 1990
|Dominant modal decomposition method
Online Contents | 2017
|Modal Decomposition of Wind-Tunnel Fluctuations
TIBKAT | 2023
|Complete modal decomposition for optical waveguides
IEEE | 2005
|Modal Decomposition of Hamiltonian Variational Equations
British Library Conference Proceedings | 1994
|