An algorithm is developed for recursively calculating the minimum realization of a linear system from sampled impulse response data. The Gram-Schmidt orthonormalization technique is used to generate an orthonormal basis for factorization of the data matrix. The system matrix thus identified is in upper Hessenberg form, which has advantages for the identification of modal parameters including damping coefficients, frequencies, mode shapes, and modal participation factors. It also has the property that once an element of the system matrix is computed, it is never altered as the dimension of the model is increased in the recursive process. Numerical examples are presented for comparison of the recursive and nonrecursive forms of the eigensystem realization algorithm.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Recursive form of the eigensystem realization algorithm for system identification


    Contributors:


    Publication date :

    1989-10-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English


    Keywords :



    Time-Varying Eigensystem Realization Algorithm

    Majji, Manoranjan / Juang, Jer-Nan / Junkins, John L. | AIAA | 2010



    Eigensystem realization algorithm modal identification experiences with mini-mast

    Pappa, Richard S. / Schenk, Axel / Noll, Christopher | NTRS | 1992