Premium
Greedy‐based approximation of frequency‐weighted Gramian matrices for model reduction in multibody dynamics
Author(s) -
Fehr J.,
Fischer M.,
Haasdonk B.,
Eberhard P.
Publication year - 2013
Publication title -
zamm ‐ journal of applied mathematics and mechanics / zeitschrift für angewandte mathematik und mechanik
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 51
eISSN - 1521-4001
pISSN - 0044-2267
DOI - 10.1002/zamm.201200014
Subject(s) - gramian matrix , weighting , algorithm , estimator , multibody system , a priori and a posteriori , mathematics , mathematical optimization , approximation error , computer science , eigenvalues and eigenvectors , physics , statistics , epistemology , quantum mechanics , radiology , medicine , philosophy
The method of elastic multibody systems is frequently used to describe the dynamical behavior of the mechanical subsystems in multi‐physics simulations. One important issue for the simulation of elastic multibody systems is the error‐controlled reduction of the flexible body's degrees of freedom. By the use of second order frequency‐weighted Gramian matrix based reduction techniques the distribution of the loads is taken into account a‐priori and very accurate models can be obtained within a predefined frequency range and even a‐priori error bounds are available. However, the calculation of the frequency‐weighted Gramian matrices requires high computational effort. Hence, appropriate approximation schemes have to be used to find the dominant eigenspace of these matrices. In the current contribution, the matrix integral needed for calculating the Gramian matrices is approximated by quadratures using integral kernel snapshots. The number and location of these snapshots have a strong influence on the reduction results. Sophisticated snapshot selection methods based on Greedy algorithms from the reduced basis methods are used to construct the optimal location of snapshot frequencies. The method can be viewed as an automatic determination of optimal frequency weighting and as an adaptive learning of quadrature rules. One ingredient of Greedy algorithms is the need of error measures. To gain computational advantage two different error estimators are derived and used in the Greedy algorithm instead of the absolute or relative error.