A UNIFIED MATRIX POLYNOMIAL APPROACH TO MODAL IDENTIFICATION

✍ Scribed by R.J. Allemang; D.L. Brown

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 278 KB
• Volume: 211
• Category: Article
• ISSN: 0022-460X
• DOI: 10.1006/jsvi.1997.1321

✦ Synopsis

One important current focus of modal identification is a reformulation of modal parameter estimation algorithms into a single, consistent mathematical formulation with a corresponding set of definitions and unifying concepts. Particularly, a matrix polynomial approach is used to unify the presentation with respect to current algorithms such as the least-squares complex exponential (LSCE), the polyreference time domain (PTD), Ibrahim time domain (ITD), eigensystem realization algorithm (ERA), rational fraction polynomial (RFP), polyreference frequency domain (PFD) and the complex mode indication function (CMIF) methods. Using this unified matrix polynomial approach (UMPA) allows a discussion of the similarities and differences of the commonly used methods. The use of least squares (LS), total least squares (TLS), double least squares (DLS) and singular value decomposition (SVD) methods is discussed in order to take advantage of redundant measurement data. Eigenvalue and SVD transformation methods are utilized to reduce the effective size of the resulting eigenvalue-eigenvector problem as well.