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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Reliable algorithm for modal decomposition


    Contributors:


    Publication date :

    1990-10-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English


    Keywords :


    Reliable algorithm for modal decomposition

    WALKER, ROBERT A. / BRYSON, ARTHUR E. | AIAA | 1990


    Dominant modal decomposition method

    Dombovari, Zoltan | Online Contents | 2017


    Modal Decomposition of Wind-Tunnel Fluctuations

    Fahland, Georg / Elsner, Ferdinand / Weber, Kai et al. | TIBKAT | 2023


    Complete modal decomposition for optical waveguides

    Shapira, O. / Abouraddy, A.F. / Joannopoulos, J.D. et al. | IEEE | 2005


    Modal Decomposition of Hamiltonian Variational Equations

    Wiesel, W. / United States; National Aeronautics and Space Administration / Goddard Space Flight Center | British Library Conference Proceedings | 1994