This paper describes the use of a quadratic manifold for the model order reduction of structural dynamics problems featuring geometric nonlinearities. The manifold is tangent to a subspace spanned by the most relevant vibration modes, and its curvature is provided by modal derivatives obtained by sensitivity analysis of the eigenvalue problem, or its static approximation, along the vibration modes. The construction of the quadratic manifold requires minimal computational effort once the vibration modes are known. The reduced order model is then obtained by Galerkin projection, where the configurationdependent tangent space of the manifold is used to project the discretized equations of motion.

Document VersionPublisher's PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication:• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publicationCitation for published version (APA): Besselink, B., Lutowska, A., Tabak, U., Wouw, van de, N., Nijmeijer, H., Hochstenbach, M. E., ... Rixen, D. J. (2013). A comparison of model reduction techniques from structural dynamics, numerical mathematics and systems and control. (CASA-report; Vol. 1327). Eindhoven: Technische Universiteit Eindhoven. General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research.• You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. AbstractIn this paper, popular model reduction techniques from the fields of structural dynamics, numerical mathematics and systems and control are reviewed and compared. The motivation for such a comparison stems from the fact the model reduction techniques in these fields have been developed fairly independently. In addition, the insight obtained by the comparison allows for making a motivated choice for a particular model reduction technique, on the basis of the desired objectives and properties of the model reduction problem. In particular, a detailed review is given on mode displacement techniques, moment matching methods and balanced truncation, whereas important extensions are outlined briefly. In addition, a qualitative comparison of these methods is presented, hereby focussing both on theoretical and computational aspects. Finally, the differences are illustrated on a quantitative level by means of application of the model reduction techniques to a common example.

In this paper, a generalization of a quadratic manifold approach for the reduction of geometrically nonlinear structural dynamics problems is presented. This generalization is constructed by a linearization of the static force with respect to the generalized coordinates, resulting in a shift of the quadratic behavior from the force to the manifold. In this framework, static derivatives emerge as natural extensions to modal derivatives for displacement fields other than the vibration modes, such as the Krylov subspace vectors. Here the dynamic problem is projected onto the tangent space of the quadratic manifold, allowing for a much less number of generalized coordinates compared to linear basis methods. The potential of the quadratic manifold approach is investigated in a numerical study, where several variations of the approach are compared on different examples, indicating a clear pattern where the proposed approach is applicable.

No abstract

SUMMARYWe introduce spectral coarse spaces for the balanced domain decomposition and the finite element tearing and interconnecting methods. These coarse spaces are specifically designed for the two‐level methods to be scalable and robust with respect to the coefficients in the equation and the choice of the decomposition. We achieve this by solving generalized eigenvalue problems on the interfaces between subdomains to identify the modes that slow down convergence. Theoretical bounds for the condition numbers of the preconditioned operators, which depend only on a chosen threshold, and the maximal number of neighbors of a subdomain are presented and proved. For the finite element tearing and interconnecting method, there are two versions of the two‐level method: one based on the full Dirichlet preconditioner and the other on the, cheaper, lumped preconditioner. Some numerical tests confirm these results. Copyright © 2013 John Wiley & Sons, Ltd.

No abstract

Domain Decomposition methods often exhibit very poor performance when applied to engineering problems with large heterogeneities. In particular for heterogeneities along domain interfaces the iterative techniques to solve the interface problem are lacking an efficient preconditioner. Recently a robust approach, named FETI-Geneo, was proposed where troublesome modes are precomputed and deflated from the interface problem. The cost of the FETI-Geneo is however high. We propose in this paper techniques that share similar ideas with FETI-Geneo but where no pre-processing is needed and that can be easily and efficiently implemented as an alternative to standard Domain Decomposition methods. In the block iterative approaches presented in this paper, the search space at every iteration on the interface problem contains as many directions as there are domains in the decomposition. Those search directions originate either from the domain-wise preconditioner (in the Simultaneous FETI method) or from the block structure of the right-hand side of the interface problem (Block FETI). We show on 2D structural examples that both methods are robust and provide good convergence in the presence of high heterogeneities, even when the interface is jagged or when the domains have a bad aspect ratio. The Simultaneous FETI was also efficiently implemented in an optimized parallel code and exhibited excellent performance compared to the regular FETI method.

No abstract