Constructing Second-Order Models of Mechanical Systems from Identified State Space Realizations. Part II: Numerical Investigations

• Published in: Journal of engineering mechanics 2003-05, Vol.129 (5), p.489-501
• Main Authors: Lu, Hilmi, De Angelis, Maurizio, Betti, Raimondo, Longman, Richard W
• Format: Article
• Language: English
• Subjects: Applied sciences; Buildings. Public works; Computational techniques; Exact sciences and technology; Finite-element and galerkin methods; Fundamental areas of phenomenology (including applications); Mathematical methods in physics; Measurement and testing methods; Measurement methods and techniques in continuum mechanics of solids; Measurements. Technique of testing; Physics; Solid mechanics; Structural and continuum mechanics; TECHNICAL PAPERS
• ISSN: 0733-9399; 1943-7889
• DOI: 10.1061/(ASCE)0733-9399(2003)129:5(489)

This paper presents various numerical investigations about obtaining physical parameters of second-order mechanical systems using the algorithms that were investigated in detail in the first part of this study. To discuss in detail the computational aspects and the limitations of each of these algorithms, the first example presented is the identification of the physical parameters of a three-degrees-of-freedom (3-DOF) system. It is shown that when the input/output data used in the identification is noise free, then each of the methodologies can exactly retrieve the second-order coefficient matrices, provided that the sensor/actuator requirements imposed by each of them are satisfied accordingly. To investigate the effects of noisy data on the identified second-order parameters, Monte Carlo simulations are performed on the 3-DOF system at different noise-to-signal ratios, and the results show that the three algorithms perform quite satisfactorily. The analysis is then extended to a 120-DOF, three-dimensional structural system, and in this part of the presentation issues such as modal truncation, insufficient instrumentation, and alternative colocation requirements are discussed. The last section of the paper is devoted to a detailed evaluation of the performance of each of the algorithms discussed in this work.