On the redundancy of complex modal parameters

Abstract

Generating the simulation transfer function (TF) is indispensable to modal analysis, such as examining modal parameters identification algorithm, and assessing modal analysis software. Comparing 3 feasible algorithms to simulate TF shows that, one of them is preperable, which is expressing the TF as the function of the complex modal parameters (CMPs), because the deliberate behaviors of CMPs can be implemented easily, such as, dense modals, large damping, and complex modal shape, etc. Nonetheless, even this preferable algorithms is elected, the complex modal shapes cannot be specified arbitrarily, because the number of CMPs far more exceeds that in physical coordinate. So for physical realizable system, there are redundant constraints in CMPs. By analyzing the eigenvalue problem of a complex modal system, and the inversion equations from CMPs to physical parameters, the explicit redundancy constraints were presented. For the special cases, such as the real modal, the damping free modal, and non-complete identification, the specific forms of the redundancy constraints were discussed, along with the number of independent parameters. It is worthy of noting that, redundancy constraints are automatically satisfied for the real modal case. Their equivalent forms on the transfer matrix and a column of transfer matrix were also provided. These results are applicable to generate TF, to implement identification by optimization and appreciate the identification results, to evaluate residual modal, and to verify the complementary of identified modal orders.