Abstract

Despite the good accuracy of finite element (FE) models to represent the dynamic behaviour of mechanical systems, practical applications show significant discrepancies between analytical predictions and experimental results, which are mostly due to uncertainties on the geometry configuration, imprecise material parameters and vague boundary conditions. Thereby, different approaches have been proposed to solve the inverse problems associated with the updating of FE models. Among them, the techniques based on minimization processes have shown to be some of the most promising ones. In this paper, a self-adaptive heuristic optimization method, namely the self-adaptive differential evolution (SADE), is evaluated. Differently from the canonical differential evolution (DE) algorithm, the SADE strategy is able to update dynamically the required parameters such as population size, crossover parameter and perturbation rate. This is done by considering a defined convergence rate on the evolution process of the algorithm in order to reduce the number of evaluations of the objective function. For illustration purposes, the SADE strategy is applied to the solution of typical mathematical functions. Additionally, the strategy is equally used to update the FE model of a rotating machine composed by a horizontal flexible shaft, two rigid discs and two unsymmetrical bearings. For comparison purposes, the canonical DE is also used. The results indicate that the SADE algorithm is a recommended technique for dealing with this kind of inverse problem.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.